McqMate
Chapters
501. |
If every node u in G is adjacent to every other node v in G, A graph is said to be _______. |
A. | isolate. |
B. | complete. |
C. | finite. |
D. | Strongly connected. |
Answer» B. complete. |
502. |
In a graph G if e=(u,v), then u and v are called ___________. |
A. | endpoints. |
B. | adjacent nodes. |
C. | neighbours. |
D. | all of the above. |
Answer» D. all of the above. |
503. |
Which of the following is true while inserting a new node in the list? |
A. | Check there is node in the list. |
B. | Check in the free node in the pool. |
C. | There is no node. |
D. | Underflow. |
Answer» B. Check in the free node in the pool. |
504. |
Which of the following data structures are indexed structures? |
A. | Linear arrays. |
B. | Linked lists. |
C. | Arrays. |
D. | First address. |
Answer» A. Linear arrays. |
505. |
The efficiency of a BFS algorithm is dependent on _______. |
A. | Algorithm. |
B. | Tree. |
C. | Problem. |
D. | Graph. |
Answer» D. Graph. |
506. |
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. |
507. |
Divide and conquer is an important algorithm design paradigm based on _______. |
A. | multi-branched recursion. |
B. | single-branched recursion. |
C. | two-way recursion. |
D. | None. |
Answer» A. multi-branched recursion. |
508. |
The correctness of a divide and conquer algorithm is usually proved by _________. |
A. | mathematical theorem. |
B. | de-Morgan `s law. |
C. | mathematical induction. |
D. | none. |
Answer» C. mathematical induction. |
509. |
The ____________ is used in an elegant sorting algorithm. |
A. | Heap sort. |
B. | Quick sort. |
C. | Merge sort. |
D. | Radix sort. |
Answer» A. Heap sort. |
510. |
____________ is finding a path/tour through the graph such that every vertex is visited exactly once. |
A. | Travelling Salesman tour. |
B. | Eulerian tour. |
C. | Hamiltonian tour. |
D. | None. |
Answer» C. Hamiltonian tour. |
511. |
____________ data structure is used to implement Depth First search. |
A. | Array. |
B. | Linked list. |
C. | Queue. |
D. | Stack. |
Answer» D. Stack. |
512. |
The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is |
A. | log2N |
B. | n-1 |
C. | n |
D. | None of the above |
Answer» B. n-1 |
513. |
Each entry in a linked list is a called a_______________. |
A. | Link. |
B. | Node. |
C. | Data Structure. |
D. | Avail. |
Answer» B. Node. |
514. |
Which of the following is two way lists? |
A. | Grounded header list. |
B. | Circular header list. |
C. | Linked list with header and trailer nodes. |
D. | List traversed in two directions. |
Answer» D. List traversed in two directions. |
515. |
In a linked list the _________field contains the address of next element in the list. |
A. | Link field. |
B. | Next element field. |
C. | Start field. |
D. | Info field . |
Answer» A. Link field. |
516. |
A list that has no nodes is called________. |
A. | End list. |
B. | Zero list. |
C. | Null list. |
D. | Sentinel list. |
Answer» C. Null list. |
517. |
The special list which consists of unused memory space is called __________. |
A. | Free space. |
B. | Empty space. |
C. | Available space. |
D. | Free storage list. |
Answer» D. Free storage list. |
518. |
The efficient searching algorithm for algorithm for a sorted array is _________. |
A. | Binary search. |
B. | Linear search. |
C. | Indexed search. |
D. | Repeated search. |
Answer» A. Binary search. |
519. |
To insert a new node in linked list free node will be available in ___________. |
A. | Available list. |
B. | Avail list. |
C. | Free node list. |
D. | Memory space list. |
Answer» B. Avail list. |
520. |
A ______________ list is a header list where the node points back to the header node. |
A. | Circular header. |
B. | Grounded header. |
C. | Two way header. |
D. | One way header. |
Answer» A. Circular header. |
521. |
How many pointers are necessarily changed for the insertion in a Linked List? |
A. | 1. |
B. | 2. |
C. | 3. |
D. | 5. |
Answer» B. 2. |
522. |
An algorithm that calls itself directly or indirectly is known as ____________. |
A. | Sub algorithm. . |
B. | Recursion. |
C. | Polish notation. |
D. | Traversal algorithm. |
Answer» B. Recursion. |
523. |
Minimum number of fields in each node of a doubly linked list is____ |
A. | 2 |
B. | 3 |
C. | 4 |
D. | None of the above |
Answer» B. 3 |
524. |
A graph in which all vertices have equal degree is known as ____ |
A. | Complete graph |
B. | Regular graph |
C. | Multi graph |
D. | Simple graph |
Answer» A. Complete graph |
525. |
A vertex of in-degree zero in a directed graph is called a/an |
A. | Root vertex |
B. | Isolated vertex |
C. | Sink |
D. | Articulation point |
Answer» C. Sink |
526. |
A graph is a tree if and only if graph is |
A. | Directed graph |
B. | Contains no cycles |
C. | Planar |
D. | Completely connected |
Answer» B. Contains no cycles |
527. |
The elements of a linked list are stored |
A. | In a structure |
B. | In an array |
C. | Anywhere the computer has space for them |
D. | In contiguous memory locations |
Answer» C. Anywhere the computer has space for them |
528. |
A parentheses checker program would be best implemented using |
A. | List |
B. | Queue |
C. | Stack |
D. | Any of the above |
Answer» C. Stack |
529. |
To perform level-order traversal on a binary tree, which of the following data structure will be required? |
A. | Hash table |
B. | Queue |
C. | Binary search tree |
D. | Stack |
Answer» B. Queue |
530. |
Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation? |
A. | Queue |
B. | Linked list |
C. | Binary search tree |
D. | None of above |
Answer» D. None of above |
531. |
A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree. |
A. | Threaded tree |
B. | Complete binary tree |
C. | M-way search tree |
D. | Full binary tree |
Answer» B. Complete binary tree |
532. |
Which of following data structure is more appropriate for implementing quick sort iteratively? |
A. | Deque |
B. | Queue |
C. | Stack |
D. | Priority queue |
Answer» C. Stack |
533. |
The number of edges in a complete graph of n vertices is |
A. | n(n+1)/2 |
B. | n(n-1)/2 |
C. | n2/2 |
D. | n |
Answer» B. n(n-1)/2 |
534. |
If two trees have same structure and but different node content, then they are called ___ |
A. | Synonyms trees |
B. | Joint trees |
C. | Equivalent trees |
D. | Similar trees |
Answer» D. Similar trees |
535. |
If two trees have same structure and node content, then they are called ____ |
A. | Synonyms trees |
B. | Joint trees |
C. | Equivalent trees |
D. | Similar trees |
Answer» C. Equivalent trees |
536. |
Finding the location of a given item in a collection of items is called …… |
A. | Discovering |
B. | Finding |
C. | Searching |
D. | Mining |
Answer» C. Searching |
537. |
The time complexity of quicksort is …….. |
A. | O(n) |
B. | O(logn) |
C. | O(n2) |
D. | O(n logn) |
Answer» D. O(n logn) |
538. |
Quick sort is also known as …….. |
A. | merge sort |
B. | tree sort |
C. | shell sort |
D. | partition and exchange sort |
Answer» D. partition and exchange sort |
539. |
………. sorting is good to use when alphabetizing a large list of names. |
A. | Merge |
B. | Heap |
C. | Radix |
D. | Bubble |
Answer» C. Radix |
540. |
The total number of comparisons in a bubble sort is …. |
A. | O(n logn) |
B. | O(2n) |
C. | O(n2) |
D. | O(n) |
Answer» A. O(n logn) |
541. |
……… form of access is used to add and remove nodes from a queue. |
A. | LIFO, Last In First Out |
B. | FIFO, First In First Out |
C. | Both a and b |
D. | None of these |
Answer» B. FIFO, First In First Out |
542. |
New nodes are added to the ……… of the queue. |
A. | Front |
B. | Back |
C. | Middle |
D. | Both A and B |
Answer» B. Back |
543. |
The term push and pop is related to |
A. | Array |
B. | Lists |
C. | Stacks |
D. | Trees |
Answer» C. Stacks |
544. |
Which of the following is an application of stack? |
A. | finding factorial |
B. | tower of Hanoi |
C. | infix to postfix |
D. | all of the above |
Answer» D. all of the above |
545. |
The operation of processing each element in the list is known as …… |
A. | sorting |
B. | merging |
C. | inserting |
D. | traversal |
Answer» D. traversal |
546. |
The situation when in a linked list START=NULL is …. |
A. | Underflow |
B. | Overflow |
C. | Houseful |
D. | Saturated |
Answer» A. Underflow |
547. |
Which of the following are two-way lists? |
A. | Grounded header list |
B. | Circular header list |
C. | Linked list with header and trailer nodes |
D. | List traversed in two directions |
Answer» D. List traversed in two directions |
548. |
Which is the pointer associated with the availability list? |
A. | FIRST |
B. | AVAIL |
C. | TOP |
D. | REAR |
Answer» B. AVAIL |
549. |
Which of the following data structure can’t store the non-homogeneous data elements? |
A. | Arrays |
B. | Records |
C. | Pointers |
D. | Stacks |
Answer» A. Arrays |
550. |
Which of the following is non-liner data structure? |
A. | Stacks |
B. | List |
C. | Strings |
D. | Trees |
Answer» D. Trees |
551. |
To represent hierarchical relationship between elements, which data structure is suitable? |
A. | Dequeue |
B. | Priority |
C. | Tree |
D. | Graph |
Answer» C. Tree |
552. |
Identify the data structure which allows deletions at both ends of the list but insertion at only one end. |
A. | Input restricted dequeue |
B. | Output restricted qequeue |
C. | Priority queues |
D. | Stack |
Answer» A. Input restricted dequeue |
Done Reading?