McqMate
Chapters
| 401. |
When converting binary tree into extended binary tree, all the original nodes in binary tree are___________. |
| A. | internal nodes on extended tree. |
| B. | external nodes on extended tree. |
| C. | vanished on extended tree. |
| D. | post order traversal. |
| Answer» A. internal nodes on extended tree. | |
| 402. |
Which of the following conditions checks available free space in avail list? |
| A. | Avail=Top |
| B. | Null=Avail |
| C. | Avail=Null |
| D. | Avail=Max stack |
| Answer» C. Avail=Null | |
| 403. |
Which of the following sorting algorithm is of divide-and-conquer type? |
| A. | Bubble sort. |
| B. | Insertion sort. |
| C. | Quick sort. |
| D. | Algorithm. |
| Answer» C. Quick sort. | |
| 404. |
STACK is also called as ______________. |
| A. | FIFO |
| B. | LIFO |
| C. | FOLI |
| D. | FOFI |
| Answer» B. LIFO | |
| 405. |
Collection of related data items is called _______. |
| A. | files |
| B. | fields |
| C. | attributes. |
| D. | records. |
| Answer» D. records. | |
| 406. |
Breadth First search is used in____________. |
| A. | binary tree. |
| B. | stacks. |
| C. | graphs. |
| D. | both a and c. |
| Answer» C. graphs. | |
| 407. |
A variable whose size is determined at compile time and cannot be changed at run time is_________. |
| A. | static variable. |
| B. | dynamic variable. |
| C. | not a variable. |
| D. | data variable. |
| Answer» A. static variable. | |
| 408. |
Process of inserting an element in stack is called ____________. |
| A. | Create |
| B. | Push |
| C. | Evaluation |
| D. | Pop |
| Answer» B. Push | |
| 409. |
Length of linear array can be found by using the formula_________ |
| A. | UB-LB+1 |
| B. | LB+UB |
| C. | LB-UB |
| D. | LB-UB+1 |
| Answer» A. UB-LB+1 | |
| 410. |
The average number of key comparisons done in a successful sequential search in a list of length n is___________. |
| A. | log n |
| B. | n-1/2. |
| C. | n/2. |
| D. | n+1/2. |
| Answer» D. n+1/2. | |
| 411. |
A technique for direct search is _______________. |
| A. | Binary Search |
| B. | Linear Search |
| C. | Tree Search |
| D. | Hashing |
| Answer» D. Hashing | |
| 412. |
Base address is the address of __________. |
| A. | first element |
| B. | middle element |
| C. | last element |
| D. | pivot element |
| Answer» A. first element | |
| 413. |
A _____________ list is a list where the last node contains null pointer. |
| A. | circular header. |
| B. | grounded header. |
| C. | rounded header. |
| D. | linked header. |
| Answer» B. grounded header. | |
| 414. |
___________are used to facilitate the processing of information in an array. |
| A. | Pointers. |
| B. | Memory location. |
| C. | Records. |
| D. | Variables. |
| Answer» A. Pointers. | |
| 415. |
The comparison tree is also called as________. |
| A. | decision tree. |
| B. | binary tree. |
| C. | sequential tree. |
| D. | b+ tree. |
| Answer» A. decision tree. | |
| 416. |
A linked list whose last node points back to the list node instead of containing the null pointer________. |
| A. | circular list. |
| B. | linked list. |
| C. | circular doubly linked list. |
| D. | doubly linked list. |
| Answer» A. circular list. | |
| 417. |
__________________ is a header list where the last node contains the null pointer. |
| A. | Circular Header linked list |
| B. | Grounded Header Linked list |
| C. | Linked list |
| D. | Linear Array |
| Answer» B. Grounded Header Linked list | |
| 418. |
Which of the following case does not exist in complexity theory |
| A. | Best case |
| B. | Worst case |
| C. | Average case |
| D. | Null case |
| Answer» D. Null case | |
| 419. |
The _________ for a linked list is a pointer variable that locates the beginning of the list. |
| A. | anchor. |
| B. | base. |
| C. | footer. |
| D. | header. |
| Answer» D. header. | |
| 420. |
The time factor when determining the efficiency of algorithm is measured by____________. |
| A. | counting microseconds. |
| B. | counting the number of key operations. |
| C. | counting the number of statements. |
| D. | counting the kilobytes of algorithm. |
| Answer» B. counting the number of key operations. | |
| 421. |
The space factor when determining the efficiency of algorithm is measured by___________. |
| A. | counting the maximum memory needed by the algorithm. |
| B. | counting the minimum memory needed by the algorithm. |
| C. | counting the average memory needed by the algorithm. |
| D. | counting the maximum disk space needed by the algorithm. |
| Answer» A. counting the maximum memory needed by the algorithm. | |
| 422. |
The Worst case occur in linear search algorithm when_____________. |
| A. | item is somewhere in the middle of the array. |
| B. | item is not in the array at all. |
| C. | item is the last element in the array. |
| D. | item is the last element in the array or is not there at all. |
| Answer» D. item is the last element in the array or is not there at all. | |
| 423. |
The complexity of linear search algorithm is____________. |
| A. | O(log n). |
| B. | O(n). |
| C. | O(n2). |
| D. | O(n log n). |
| Answer» B. O(n). | |
| 424. |
The time required in best case for search operation in binary tree is ____________. |
| A. | O(n). |
| B. | O(2n). |
| C. | O(log n). |
| D. | O( log 2n). |
| Answer» C. O(log n). | |
| 425. |
Which of the following way follows in Post order traversal? |
| A. | Root -> Left sub tree -> Right sub tree. |
| B. | Root -> Right sub tree -> Left sub tree. |
| C. | Left sub tree -> Root -> Right sub tree. |
| D. | Left sub tree -> Right sub tree -> Root. |
| Answer» D. Left sub tree -> Right sub tree -> Root. | |
| 426. |
A _________is a linked list which always contains a special node called the header node, at the beginning of the list. |
| A. | Doubly Linked List. |
| B. | Circular List. |
| C. | Header Linked List. |
| D. | None. |
| Answer» C. Header Linked List. | |
| 427. |
_______________is a header list where the last node points back to the header node. |
| A. | Doubly header List. |
| B. | Singly header List. |
| C. | Grounder Header List. |
| D. | Circular Header List. |
| Answer» D. Circular Header List. | |
| 428. |
The advantage of a two-way list and a circular header list is combined into a ________. |
| A. | two-way circular header list. |
| B. | two-way circular list. |
| C. | two-way header circular list. |
| D. | None. |
| Answer» A. two-way circular header list. | |
| 429. |
The pointer of the last node contains a special value called_____________. |
| A. | null pointer. |
| B. | index pointer. |
| C. | pointer link. |
| D. | address pointer. |
| Answer» B. index pointer. | |
| 430. |
The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called______________. |
| A. | buffering. |
| B. | garbage collection. |
| C. | deal location. |
| D. | buffer collection. |
| Answer» B. garbage collection. | |
| 431. |
Important part of any compiler is the construction and maintenances of a dictionary, this types of dictionary are called______________. |
| A. | symbol table. |
| B. | index table. |
| C. | grammar table. |
| D. | pointer table. |
| Answer» A. symbol table. | |
| 432. |
The data structure required to check whether an expression contains balanced parenthesis is? |
| A. | queue |
| B. | stack |
| C. | linked list |
| D. | file |
| Answer» B. stack | |
| 433. |
What are the advantages of arrays? |
| A. | Easier to store elements of same data type |
| B. | Used to implement other data structures like stack and queue |
| C. | Convenient way to represent matrices as a 2D array |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 434. |
The number of possible ordered trees with three nodes A,B,C is? |
| A. | 16 |
| B. | 12. |
| C. | 10 |
| D. | 6 |
| Answer» B. 12. | |
| 435. |
The earliest use of__________ sorting was in conjunction with network analysis. |
| A. | topological. |
| B. | bubble. |
| C. | radix. |
| D. | heap. |
| Answer» A. topological. | |
| 436. |
_________is not the operation that can be performed on Queue. |
| A. | Traversal. |
| B. | Insertion. |
| C. | Deletion. |
| D. | Retrieval. |
| Answer» A. Traversal. | |
| 437. |
A tree is a finite set of_________. |
| A. | loops. |
| B. | domains. |
| C. | functions. |
| D. | nodes. |
| Answer» D. nodes. | |
| 438. |
Stack can be represented by means of ____________. |
| A. | Tree. |
| B. | Graph. |
| C. | One-way List. |
| D. | None. |
| Answer» C. One-way List. | |
| 439. |
The hashing file space is divided into_______________. |
| A. | nodes and roots. |
| B. | roots and slots. |
| C. | buckets and slots. |
| D. | slots and nodes. |
| Answer» C. buckets and slots. | |
| 440. |
Matrices with a relatively high proportion of zero entries are called _______ matrices. |
| A. | sparse. |
| B. | Null. |
| C. | Zero. |
| D. | worse. |
| Answer» A. sparse. | |
| 441. |
The Postfix equivalent of the Prefix Notation * + ab - cd is |
| A. | ab + cd - * |
| B. | abcd +-* |
| C. | ab+cd*- |
| D. | ab+-cd* |
| Answer» A. ab + cd - * | |
| 442. |
Data structure which is capable of expressing more complex relationship than that of physical adjacency is called______________. |
| A. | linear data structure. |
| B. | linked list. |
| C. | non linear data Structure |
| D. | data structure. |
| Answer» C. non linear data Structure | |
| 443. |
A tree is a data structure which represents hierarchical relationship between individual _________. |
| A. | data items. |
| B. | fields. |
| C. | nodes. |
| D. | linked list. |
| Answer» A. data items. | |
| 444. |
In a directed tree any node which has out degree 0 is called a terminal node or__________. |
| A. | a tree. |
| B. | a list. |
| C. | a node. |
| D. | a leaf. |
| Answer» D. a leaf. | |
| 445. |
In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree. |
| A. | directed. |
| B. | structure. |
| C. | ordered. |
| D. | degree of. |
| Answer» C. ordered. | |
| 446. |
______________ a tree means processing it in such a way that each node is visited only once. |
| A. | Traversing. |
| B. | Implement. |
| C. | Partition. |
| D. | Node. |
| Answer» A. Traversing. | |
| 447. |
The length of the path is the number of_____________ on the path. |
| A. | nodes. |
| B. | fields. |
| C. | data. |
| D. | edges. |
| Answer» D. edges. | |
| 448. |
The children node of same parent is called____________. |
| A. | binary tree. |
| B. | tree. |
| C. | sibling. |
| D. | list. |
| Answer» C. sibling. | |
| 449. |
The situation in linked list START = NULL is called_________ |
| A. | Overflow |
| B. | Underflow |
| C. | Zero |
| D. | None of the above |
| Answer» B. Underflow | |
| 450. |
A code which deals about short form of a program is called __________ code. |
| A. | program. |
| B. | data. |
| C. | pseudo. |
| D. | derived. |
| Answer» C. pseudo. | |
| 451. |
Which of the application may use a stack? |
| A. | Expression Evaluation |
| B. | Keeping track of local variables at run time. |
| C. | Syntax analyzer for a compiler |
| D. | All of the above. |
| Answer» A. Expression Evaluation | |
| 452. |
The queue which wraps around upon reaching the end of the array is called as____________. |
| A. | circular queue. |
| B. | linked queue. |
| C. | doubly linked list. |
| D. | representation of queue. |
| Answer» A. circular queue. | |
| 453. |
A _______________ is a reference to a memory location, which is used to store data that is described in a data type. |
| A. | element. |
| B. | variable. |
| C. | pointer. |
| D. | memory. |
| Answer» B. variable. | |
| 454. |
If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal? |
| A. | ABCD |
| B. | DCBA |
| C. | DCAB |
| D. | ABDC |
| Answer» B. DCBA | |
| 455. |
____________ has certain attributes or properties which may be assigned values. |
| A. | field system. |
| B. | record. |
| C. | entity. |
| D. | files. |
| Answer» C. entity. | |
| 456. |
The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is ____________. |
| A. | 6 |
| B. | 5 |
| C. | 7 |
| D. | 8 |
| Answer» B. 5 | |
| 457. |
Maximum degree in any vector in a graph with n vertices is ________. |
| A. | n. |
| B. | n-1. |
| C. | n+1. |
| D. | 2n+1. |
| Answer» B. n-1. | |
| 458. |
If FRONT = NULL then _________. |
| A. | queue full |
| B. | queue empty |
| C. | dequeue |
| D. | priority queue |
| Answer» B. queue empty | |
| 459. |
_______________ is a solution to a problem independent of programming language. |
| A. | Efficient. |
| B. | Linked list. |
| C. | Data structure. |
| D. | Algorithm. |
| Answer» D. Algorithm. | |
| 460. |
________ is the situation where data-structure is empty. |
| A. | Overflow. |
| B. | Underflow. |
| C. | Null. |
| D. | Empty. |
| Answer» B. Underflow. | |
| 461. |
When elements are deleted the nodes go to_________. |
| A. | registers. |
| B. | free pool. |
| C. | recycle bin. |
| D. | gets deleted permanently. |
| Answer» B. free pool. | |
| 462. |
Expression into postfix expression: (A - B) * (D / E) |
| A. | ABDE - * / |
| B. | - * / ABDE |
| C. | A B - D E * / |
| D. | * - A B / D E |
| Answer» D. * - A B / D E | |
| 463. |
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called ________ |
| A. | elementary items. |
| B. | atoms. |
| C. | scalars. |
| D. | structure. |
| Answer» D. structure. | |
| 464. |
Quick sort uses ____ for implementation. |
| A. | recursion. |
| B. | traversal. |
| C. | heaps. |
| D. | queues. |
| Answer» A. recursion. | |
| 465. |
What is the worst-case time for heap sort to sort an array of n elements? |
| A. | O(log n). |
| B. | O(n). |
| C. | O(n log n). |
| D. | O(n²). |
| Answer» C. O(n log n). | |
| 466. |
The __________________ denotes the greatest integer. |
| A. | ceiling. |
| B. | time. |
| C. | space. |
| D. | floor. |
| Answer» A. ceiling. | |
| 467. |
A binary tree of depth "d" is an almost complete binary tree if __________. |
| A. | each leaf in the tree is either at level. |
| B. | for any node. |
| C. | both a and b. |
| D. | None. |
| Answer» C. both a and b. | |
| 468. |
Program module contains its own list of variables called ____________. |
| A. | global. |
| B. | scope. |
| C. | local. |
| D. | external. |
| Answer» C. local. | |
| 469. |
The number of nodes in a complete binary tree of level 5 is__________. |
| A. | 15. |
| B. | 20. |
| C. | 63. |
| D. | 31. |
| Answer» D. 31. | |
| 470. |
The string with zero characters is called___________. |
| A. | null string. |
| B. | zero string. |
| C. | one string. |
| D. | empty string. |
| Answer» D. empty string. | |
| 471. |
The unit equal to the number of bits needed to represent a character is called a ________. |
| A. | byte. |
| B. | bit. |
| C. | mega bytes. |
| D. | kilo bytes. |
| Answer» A. byte. | |
| 472. |
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ? |
| A. | 11 |
| B. | 12 |
| C. | 13 |
| D. | 14 |
| Answer» D. 14 | |
| 473. |
In variable length storage two dollar signs are used to signal the __________. |
| A. | end of the string. |
| B. | beginning of the string. |
| C. | mid-level of the string. |
| D. | index. |
| Answer» A. end of the string. | |
| 474. |
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ? |
| A. | 2 deletions and 3 additions |
| B. | 3 additions and 2 deletions |
| C. | 3 deletions and 3 additions |
| D. | 3 deletions and 4 additions |
| Answer» C. 3 deletions and 3 additions | |
| 475. |
Each node in a singly linked lists have ______ fields |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» A. 2 | |
| 476. |
Quotation marks are also called as ____________. |
| A. | string delimiters. |
| B. | period. |
| C. | stopper. |
| D. | string. |
| Answer» A. string delimiters. | |
| 477. |
A string `s` consists of x, y and if x is an empty string then y is called as___________. |
| A. | initial substring. |
| B. | substring of s. |
| C. | node of the string. |
| D. | index. |
| Answer» A. initial substring. | |
| 478. |
The length of the string can be listed as an additional item in _____________. |
| A. | base pointer. |
| B. | pointer array. |
| C. | node. |
| D. | record. |
| Answer» B. pointer array. | |
| 479. |
Who invented Quick sort procedure? |
| A. | Hoare. |
| B. | Sedgewick. |
| C. | Mellroy. |
| D. | Coreman. |
| Answer» A. Hoare. | |
| 480. |
For the heap sort, access to nodes involves simple _______________ operations. |
| A. | binary. |
| B. | arithmetic |
| C. | algebraic |
| D. | logarithmic |
| Answer» B. arithmetic | |
| 481. |
The maximum number of nodes on level i of a binary tree is ___________. |
| A. | 2i-1. |
| B. | 3i-1. |
| C. | i+1. |
| D. | 2i+1. |
| Answer» A. 2i-1. | |
| 482. |
The number of edges in a regular graph of degree d and n vertices is _______. |
| A. | maximum of n,d. |
| B. | n+d. |
| C. | nd. |
| D. | nd/2.C |
| Answer» C. nd. | |
| 483. |
Which of the following is useful in traversing a given graph by Breath first search? |
| A. | Stack. |
| B. | Set. |
| C. | List. |
| D. | Queue. |
| Answer» D. Queue. | |
| 484. |
What is an external sorting algorithm? |
| A. | Algorithm that uses tape or disk during the sort |
| B. | Algorithm that uses main memory during the sort |
| C. | Algorithm that involves swapping |
| D. | Algorithm that are considered in place |
| Answer» A. Algorithm that uses tape or disk during the sort | |
| 485. |
Allocating memory for arrays during program compilation is___________. |
| A. | dynamic memory allocation. |
| B. | memory allocation. |
| C. | static allocation. |
| D. | random allocation. |
| Answer» C. static allocation. | |
| 486. |
The elements of an array are allocated in spaces________. |
| A. | successively. |
| B. | randomly. |
| C. | alternately. |
| D. | on any order. |
| Answer» A. successively. | |
| 487. |
Accessing and processing each array elements is called __________. |
| A. | sorting. |
| B. | traversing. |
| C. | searching. |
| D. | merging. |
| Answer» B. traversing. | |
| 488. |
An m*n array has _________number of elements. |
| A. | m. |
| B. | n. |
| C. | m2. |
| D. | m*n. |
| Answer» D. m*n. | |
| 489. |
The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________. |
| A. | row major order. |
| B. | column major order. |
| C. | random order. |
| D. | successive order. |
| Answer» B. column major order. | |
| 490. |
______ is not a technique of tree traversal. |
| A. | pre-order |
| B. | post-order |
| C. | prefix |
| D. | in-order |
| Answer» C. prefix | |
| 491. |
Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category. |
| A. | O(n log n) sorts. |
| B. | Divide-and-conquer sorts. |
| C. | Interchange sorts. |
| D. | Average time is quadratic. |
| Answer» C. Interchange sorts. | |
| 492. |
The possibility of two different keys k1 & k2 yielding the same hash address is called__________. |
| A. | merge. |
| B. | obstacle. |
| C. | overlapping. |
| D. | collision. |
| Answer» C. overlapping. | |
| 493. |
Uniform distribution of the hash address throughout the given set L is __________. |
| A. | reduce the number of collision. |
| B. | increase the number of collision. |
| C. | totally avoid collision. |
| D. | manage address. |
| Answer» A. reduce the number of collision. | |
| 494. |
An edge E is called _________ if it has identical endpoints. |
| A. | multiple edges. |
| B. | loops. |
| C. | finite. |
| D. | digraph. |
| Answer» B. loops. | |
| 495. |
__________involves maintaining two tables in memory. |
| A. | Arranging. |
| B. | Bonding. |
| C. | Combing. |
| D. | Chaining. |
| Answer» D. Chaining. | |
| 496. |
An _________ is a well defined list of steps for solving a problem. |
| A. | Algorithm. |
| B. | Program. |
| C. | Procedure. |
| D. | Process. |
| Answer» A. Algorithm. | |
| 497. |
The data items in a record form a ________ structure which can be described by means of level numbers. |
| A. | hierarchical. |
| B. | procedural. |
| C. | indexed. |
| D. | leveled. |
| Answer» A. hierarchical. | |
| 498. |
A path P of length n from a node u to a node v is defined as a sequence of _________ nodes. |
| A. | n. |
| B. | n+1. |
| C. | n+2. |
| D. | n-1. |
| Answer» B. n+1. | |
| 499. |
A vertex of degree one is called __________. |
| A. | padent |
| B. | isolated vertex |
| C. | null vertex |
| D. | colored vertex |
| Answer» A. padent | |
| 500. |
A connected graph T without any cycles is called _____________. |
| A. | a tree graph. |
| B. | free tree. |
| C. | a tree. |
| D. | all of the above. |
| Answer» D. all of the above. | |
Done Reading?