Go To Top Reset
<<= Back
Next =>>
You Are On Multi Choice Question Bank SET 2479
123951. Two basic types of record access methods are
(A): sequential and random (B): direct and immediate (C): sequential and indexed (D): online and real time
123952. Data dictionary is a special file that contains
(A): the names of all fields in all files (B): the data types of all fields of all files (C): Both of above (D): None of above
123953. The incubation period of measles:
(A): 2-6 days (B): 6-10 days (C): 10-14 days (D): 14-20 days
123954. Large collection of files are called
(A): fields (B): Records (C): Database (D): Sectors
123955. Which is a type of DBMS software
(A): utilities (B): query language (C): report writer (D): All of above
123956. Fragmentation of a file system
(A): Can always be prevented (B): occurs only is file is not used properly (C): Can be temporarily removed by compaction (D): None of above
123957. Which among following is not a relational database
(A): dBase IV (B): 4th Dimention (C): FoxPro (D): Reflex
123958. Modify operation is likely to be done after
(A): Delete (B): Lookup (C): Indexing (D): Insertion
123959. Physical location of a record in database is determined with the help of
(A): B tree file (B): Indexed file (C): Hashed file (D): sequential file
123960. Transaction processing was made possible by the development of
(A): direct access storage (B): magnetic tape (C): cash register input (D): minicomputers
123961. Which normal form is considered adequate for normal relational database design
(A): 2NF (B): 5NF (C): 3NF (D): 4NF
123962. The logical structure with one to many relationships is a
(A): network (B): tree (C): chain (D): relational
123963. Which among following contains a complete record of all activity that affected the contents of a database during a creation period of time
(A): report writer (B): query language (C): DML (D): transaction log (E): Answer And Explanation
123964. Which among following is an approach for standardizing storing of data
(A): MIS (B): Structured programming (C): CODASYL specifications (D): None of above
123965. RAID configurations of a disk are used to provide
(A): fault tolerance (B): high speed (C): high data density (D): none of above
123966. Data management system may be implemented as
(A): system software (B): application software (C): computer program (D): all of above
123967. Koplik’s spot is seen in:
(A): Measles (B): Mumps (C): Rubella (D): Tetanus
123968. Network structure
(A): is a physical representation of data (B): is conceptually simple (C): allows many to many relationships (D): none of above
123969. Embedded pointer provides
(A): a secondary access path (B): a physical record key (C): an inverted index (D): all of above
123970. Which is not a logical database structure
(A): Chain (B): Tree (C): Relational (D): Network
123971. Ascending order of data hierarchy is
(A): bit->byte->record->field->file->database (B): bit->byte->field->record->file->database (C): byte->bit->field->record->file->database (D): byte->bit->field->file->record->database
123972. Database management systems are used to
(A): eliminate data redundancy (B): establish relationships among records in different files (C): manage file access (D): none of above
123973. German measles is also known as:
(A): Measles (B): Rubella (C): Mumps (D): Polio
123974. Allocation map
(A): Used to store program data (B): specifies which blocks are used by which file (C): is updated by application programs (D): allow programs to erase files
123975. Attribute of one table matching to the primary key of other table, is called as
(A): foreign key (B): secondary key (C): candidate key (D): composite key
123976. If a relation scheme is in BSNF then it is also in
(A): First normal form (B): Second normal form (C): Third normal form (D): Not in any normal form
123977. Which of the following statement is false
(A): Pointers are very useful. (B): Pointers store the next data element of a list (C): Data elements in linked lists need not be stored in adjacent space in memory (D): Linked lists are collection of the nodes that contain information part and next pointer. (E): Arrays are dense lists and static data structure.
123978. What are the minimum number of queues needed to implement the priority queue?
(A): One (B): Two (C): Three (D): Four
123979. The complexity of merge sort algorithm is
(A): O(n) (B): O(log n) (C): O(n2) (D): O(n log n)
123980. The complexity of Bubble sort algorithm is
(A): O(n) (B): O(log n) (C): O(n2) (D): O(n log n)
123981. The complexity of Binary search algorithm is
(A): O(n) (B): O(log n) (C): O(n2) (D): O(n log n)
123982. The complexity of linear search algorithm is
(A): O(n) (B): O(log n) (C): O(n2) (D): O(n log n)
123983. Which of the following data structure is linear data structure
(A): Trees (B): Graphs (C): Array (D): None of above
123984. Which of the following name does not relate to stacks
(A): FIFO lists (B): LIFO list (C): Piles (D): Push-down lists
123985. The memory address of the first element of an array is called
(A): floor address (B): first address (C): foundation address (D): base address
123986. A graph with one or more edges is at least
(A): 1-chromatic (B): 2-chromatic (C): 3-chromatic (D): 4-chromatic
123987. Which data structure is needed to convert infix notations to postfix notations
(A): linear list (B): tree (C): stack (D): queue
123988. Which sorting method is slowest
(A): Quick sort (B): Heap sort (C): Shell sort (D): Bubble sort
123989. Which is having highest precedence in C
(A): relational operators (B): equality operator (C): logical operator (D): arithmetic operator
123990. Merge sort uses
(A): Divide and conquer strategy (B): Backtracking approach (C): Heuristic search (D): Greedy approach
123991. Which of the languages is often translated to the pseudo code
(A): PASCAL (B): FORTRAN (C): PL/I (D): BASIC
123992. O log(n) can be conneted with
(A): Selection sort (B): Insertion sort (C): Binary sort (D): Merge sort
123993. How many divisions are there in COBOL language
(A): Two (B): Three (C): Four (D): Five
123994. Which is ALGOL based simulation language
(A): FORTRAN (B): SIMSCRIPT (C): GASP IV (D): none of above
123995. A linear list from which elements can be added or removed from either end is called
(A): stack (B): queue (C): deque (D): tree
123996. Recursive problems are implemented by
(A): queues (B): stacks (C): linked lists (D): strings
123997. Bordetella pertussis causes:
(A): Diphteria (B): Influenza (C): Tetanus (D): Whooping cough
123998. Sort which compares adjacent elements in a list and switches where necessary is
(A): Insertion sort (B): Heap sort (C): Quick sort (D): Bubble sort
123999. Which is problem oriented language
(A): BASIC (B): PL/I (C): FORTRAN (D): none of above
124000. minimum number of stacks of size n required to implement a queue of size n
(A): One (B): Two (C): Three (D): Four
<<= Back
Next =>>
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use
Powered By:Omega Web SolutionsPrivacy | Terms And Conditions
Powered By:Omega Web Solutions