Download DATA STRUCTURES ONE MARK and more Exams Data Structures and Algorithms in PDF only on Docsity!
Home » Data Structures and Algorithms Questions and AnswersALGORITHMS Multiple Choice Questions and » 100 TOP DATA STRUCTURES and Answers
100 TOP DATA STRUCTURES
and ALGORITHMS Multiple
Choice Questions and Answers
Posted on March 13, 2017 by engineer 46 Comments
Data Structures and Algorithms Multiple
Choice Questions and Answers :-
- Which if the following is/are the levels of implementation of data structure A) Abstract level B) Application level C) Implementation level D) All of the above
- A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called …… A) AVL tree
Engineering Interview Questions.com
Engineering interview questions,multiple choice questions,objective type
questions,seminor topics,lab viva questions and answers ,online quiz test pdf free
download for freshers.
HOMEONLINE TEST interview Questions GATE IIT JEE MCQs CAT *LAB VIVA CLASS NOTES SEMINAR TOPICS
1 Questions and Answers 2 MCQ PDF
Ads by Google
B) Red-black tree C) Lemma tree D) None of the above
- ……………….. level is where the model becomes compatible executable code A) Abstract level B) Application level C) Implementation level D) All of the above
ALGORITHMS Multiple Choice^ DATA STRUCTURES and Questions and Answers
- Stack is also called as A) Last in first out B) First in last out C) Last in last out D) First in first out
- Which of the following is true about the characteristics of abstract data types? i) It exports a type. ii) It exports a set of operations A) True, False B) False, True
powered by^ Custom SearchSearch
price drop
- ………… is very useful in situation when data haveto stored and then retrieved in reverse order.
A) Stack B) Queue C) List D) Link list
- Which data structure allows deleting data elements from and inserting at rear? A) Stacks B) Queues C) Dequeues D) Binary search tree
- Which of the following data structure can’t store the non-homogeneous data elements? A) Arrays B) Records C) Pointers D) Stacks
- A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out. A) Queue linked list B) Stacks linked list C) Both of them D) Neither of them
- Which of the following is non-liner data structure? A) Stacks B) List
C) Strings D) Trees
- Herder node is used as sentinel in ….. A) Graphs B) Stacks C) Binary tree D) Queues
- Which data structure is used in breadth first search of a graph to hold nodes? A) Stack B) queue C) Tree D) Array
- 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
- Which of the following data structure is non linear type? A) Strings B) Lists C) Stacks D) Graph
- Which of the following data structure is lineartype?
iii) A graph is said to be complete if there is no edge betweenevery pair of vertices.
A) True, False, True B) True, True, False C) True, True, True D) False, True, True
- Match the following. a) Completeness i) How long does it take to find a solution b) Time Complexity ii) How much memory need to perform the search. c) Space Complexity iii) Is the strategy guaranteed to find thesolution when there in one.
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
- The number of comparisons done by sequential search is ……………… A) (N/2)+ B) (N+1)/ C) (N-1)/ D) (N+2)/
- In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search
- State True or False.
i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True
- Which of the following is not the internal sort? A) Insertion Sort B) Bubble Sort C) Merge Sort D) Heap Sort
- State True or False. i) An undirected graph which contains no cycles is called forest. ii) A graph is said to be complete if there is an edge between every pair of vertices. A) True, True B) False, True C) False, False D) True, False
- 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. A) Partite B) Bipartite C) Rooted D) Bisects
- What will be the value of top, if there is a size ofstack STACK_SIZE is 5
A) 5 B) 6 C) 4 D) None
- ………… is not the operation that can be performed on queue. A) Insertion B) Deletion C) Retrieval D) Traversal
- There is an extra element at the head of the list called a ………. A) Antinel B) Sentinel C) List header D) List head
- A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges
- A ……….. is a graph that has weights of costs associated with its edges. A) Network
B) Weighted graph C) Both A and B D) None A and B
- In general, the binary search method needs no more than ……………. comparisons. A) [log2n]- B) [logn]+ C) [log2n] D) [log2n]+
- Which of the following is not the type of queue? A) Ordinary queue B) Single ended queue C) Circular queue D) Priority queue
- The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty
- State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes. A) True, True B) True, False C) False, True
- A …………… is an acyclic digraph, which has onlyone node with indegree 0, and other nodes have in- degree 1. A) Directed tree B) Undirected tree C) Dis-joint tree D) Direction oriented tree
- …………………. Is a directed tree in which outdegreeof each node is less than or equal to two.
A) Unary tree B) Binary tree C) Trinary tree D) Both B and C
- State true or false. i) An empty tree is also a binary tree. ii) In strictly binary tree, the out-degree of every node is either oor 2.
A) True, False B) False, True C) True, True D) False, False
- Which of the following data structures are indexed structures? A. Linear arrays B. Linked lists C. Queue D. Stack
- Which of the following data structure store thehomogeneous data elements?
A. Arrays B. Records C. Pointers D. Lists
- When new data are to be inserted into a data structure, but there is not available space; thissituation is usually called ….
A. Underflow B. overflow C. houseful D. saturated
- A data structure where elements can be added or removed at either end but not in the middle is called … A. linked lists B. stacks C. queues D. dequeue
- Operations on a data structure may be ….. A. creation B. destruction C. selection D. all of the above
- The way in which the data item or items arelogically related defines …..
A. storage structure B. data structure
Data Structures and Algorithms Multiple ChoiceQuestions and Answers :-
- Which of the following data structure is non-linear type? A) Strings B) Lists C) Stacks D) Tree
- Which of the following data structure is linear type? A) Array B) Tree C) Graphs D) Hierarchy
- The logical or mathematical model of a particular organization of data is called a ……… A) Data structure B) Data arrangement C) Data configuration D) Data formation
- The simplest type of data structure is ……………… A) Multidimensional array B) Linear array C) Two dimensional array D) Three dimensional array
- Linear arrays are also called ………………. A) Straight line array
B) One-dimensional array C) Vertical array D) Horizontal array
- Arrays are best data structures ………… A) For relatively permanent collections of data. B) For the size of the structure and the data in the structure are constantly changing C) For both of above situation D) For none of the above
- Which of the following data structures are indexed structures? A) Linear arrays B) Linked lists C) Graphs D) Trees
- Each node in a linked list has two pairs of ………….. and ………………. A) Link field and information field B) Link field and avail field C) Avail field and information field D) Address field and link field
- A …………………… does not keep track of address of every element in the list. A) Stack B) String C) Linear array D) Queue
D) Three dimensional array
- Linear arrays are also called ………………. A) Straight line array B) One-dimensional array C) Vertical array D) Horizontal array
- Arrays are best data structures ………… A) For relatively permanent collections of data. B) For the size of the structure and the data in the structure are constantly changing C) For both of above situation D) For none of the above
- Which of the following data structures are indexed structures? A) Linear arrays B) Linked lists C) Graphs D) Trees
- Each node in a linked list has two pairs of ………….. and ………………. A) Link field and information field B) Link field and avail field C) Avail field and information field D) Address field and link field
- A …………………… does not keep track of address of every element in the list. A) Stack
B) String C) Linear array D) Queue
- When does top value of the stack changes? A) Before deletion B) While checking underflow C) At the time of deletion D) After deletion
- Arrays are best data structures A) for relatively permanent collections of data B) for the size of the structure and the data in the structure areconstantly changing
C) for both of above situation D) for none of above situation
- Which of the following data structure is not lineardata structure?
A) Arrays B) Linked lists C) Both of the above D) None of the above
- The disadvantage in using a circular linked list is ……………………. A) It is possible to get into infinite loop. B) Last node points to first node. C) Time consuming D) Requires more memory space
