7/17/ TOP DATA STRUCTURES and ALGORITHMS Multiple Choice Questions and Answers Engineering Interview nbafinals.info Engineering. Data Structures and Algorithms Multiple Choice Questions and Answers pdf free download foe cse and nbafinals.info Structures and Algorithms. Data structures & Algorithms - Multiple Choice Questions (MCQs) - Objective Following are the multiple choice questions (MCQs) or objective questions from Data . Answers. 1. Two main measures for the efficiency of an algorithm are c.

Author: | HEDY MILBRANDT |

Language: | English, Spanish, Indonesian |

Country: | Ghana |

Genre: | Health & Fitness |

Pages: | 479 |

Published (Last): | 18.09.2016 |

ISBN: | 661-3-51073-760-1 |

Distribution: | Free* [*Sign up for free] |

Uploaded by: | YOLANDA |

Data Structures MCQs | Algorithms MCQs - Quiz Objective Questions Home · Computer Science; multiple choice questions and answers Download PDF. + Multiple Choice Questions & Answers in Data Structure with explanations The section contains questions and answers on arrays, stacks, queues. Data Structures multiple choice questions and answers on data structure MCQ questions quiz on data structures objectives questions with answer test pdf.

Which of the following is true about the characteristics of abstract data types? Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ……….. A push, pop B pop, push C insert, delete D delete, insert 9. Is a pile in which items are added at one end and removed from the other. Which data structure allows deleting data elements from and inserting at rear? Which of the following is non-liner data structure? Herder node is used as sentinel in ….. Which data structure is used in breadth first search of a graph to hold nodes? Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

Which data structure allows deleting data elements from and inserting at rear? Which of the following is non-liner data structure? Herder node is used as sentinel in ….. Which data structure is used in breadth first search of a graph to hold nodes? Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Which of the following data structure is non linear type?

Which of the following data structure is linear type? To represent hierarchical relationship between elements, Which data structure is suitable? A directed graph is ………………. In the …………….. State True of False. Match the following.

A a-iii, b-ii, c-i B a-i, b-ii, c-iii C a-iii, b-i, c-ii D a-i, b-iii, c-ii In ……………, search start at the beginning of the list and check every element in the list.

State True or False.

Which of the following is not the internal sort? A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.

In a queue, the initial values of front pointer f rare pointer r should be …….. In a circular queue the value of r will be.. Which of the following statement is true?

The advantage of …………….. But disadvantage in that is they are sequential lists. There is an extra element at the head of the list called a ………. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. A vertices, edges B edges, vertices C vertices, paths D graph node, edges A ………..

In general, the binary search method needs no more than ……………. Which of the following is not the type of queue? State true or false. State true of false. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in- degree 1.

Is a directed tree in which outdegree of each node is less than or equal to two. Which of the following data structures are indexed structures? Linear arrays B. Linked lists C. Queue D. Which of the following data structure store the homogeneous data elements? Arrays B. Records C. Pointers D. In red-black trees, the leaf nodes are not relevant and do not contain data. In red-black trees, the leaf nodes are relevant but do not contain data. Which of the following ways below is a pre order traversal?

Which of the following ways below is a In order traversal? Which of the following linked list below have last node of the list pointing to the first node? Breadth First search is used in A. Binary trees B. Stacks C. Graphs D. Vertices B.

An empty list is the one which has no A. Key value pair is usually seen in A.

Hash tables B. Heaps C. Both a and b D. Skip list Ans: Binary tree B. Red black tree C. Splay tree D. AVL tree Ans: Which data structure allows deleting data elements from front and inserting at rear?

Stacks b. Queues c. Deques d. Binary search tree ans: Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Input-restricted deque b. Output-restricted deque c.

Priority queues d. None of above ans: Which of the following data structure is non-linear type? Strings b. Lists c. Stacks d. Which of the following data structure is linear type? Queues d. All of above ans: To represent hierarchical relationship between elements, which data structure is suitable? Deque b. Priority c. Tree d. A binary tree whose every node has either zero or two children is called a. Complete binary tree b.

Binary search tree c. Extended binary tree d. The depth of a complete binary tree is given by a. When representing any algebraic expression E which uses only binary operations in a 2-tree, a.

A binary tree can easily be converted into q 2-tree a. When converting binary tree into extended binary tree, all the original nodes in binary tree are a. Find out the pre order traversal a.

Which of the following sorting algorithm is of divide-and-conquer type? Bubble sort b. Insertion sort c. Quick sort d. An algorithm that calls itself directly or indirectly is known as a. Sub algorithm b. Recursion c. Polish notation d. Traversal algorithm ans: In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency.

These special pointers are called a.

Leaf b. The in order traversal of tree will yield a sorted listing of elements of tree in a. Binary trees b. Binary search trees c. Heaps d.

In a Heap tree a. Values in a node is greater than every value in left sub tree and smaller than right sub tree b. Values in a node is greater than every value in children of it c. Both of above conditions applies d. None of above conditions applies ans: A connected graph T without any cycles is called a. If every node u in G is adjacent to every other node v in G, A graph is said to be a. In linked lists there are noNULL links in: Sin gle linked list b.

Lin ear dou bly linked list c. None of the above ANS: In a Stack the com mand to access nth ele ment from the top of the stack s will be a. S[Top-n] b. S [top-n-1] d. If yyy, xxx and zzz are the ele ments of a lex i cally ordered binary tree, then in pre order tra ver sal which node will be tra verse first a.

In a bal ance binary tree the height of two sub trees of every node can not dif fer by more than a. In an array rep re sen ta tion of binary tree the right child of root will be at loca tion of a. The total num ber of com par isons in a bub ble sort is a. The dummy header in linked list contain a. First record of the actual data b. Last record of the actual data c. Pointer to the last record of the actual data d. Write the out put of the fol low ing pro gram: Junk value c.

Run time error d. Address of the third element ANS: Only i b. Only ii c. Both i and ii d. Two main measures for the efficiency of an algorithm are a. Processor and memory b. Complexity and capacity c.

Time and space d. Data and space Ans: 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 Ans: