Data Structure Set 2
On This Page
This set of Data Structure DS Multiple Choice Questions & Answers (MCQs) focuses on Data Structure Set 2
Q1 | The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
- lists
- linked lists
- trees
- queues
Q2 | What will be the value of top, if there is a size of stack STACK_SIZE is 5
- 5
- 6
- 4
- none
Q3 | ………… is not the operation that can be performed on queue.
- insertion
- deletion
- retrieval
- traversal
Q4 | There is an extra element at the head of the list called a ……….
- antinel
- sentinel
- list header
- list head
Q5 | A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
- vertices, edges
- edges, vertices
- vertices, paths
- graph node, edges
Q6 | A ……….. is a graph that has weights of costs associated with its edges.
- network
- weighted graph
- both a and b
- none a and b
Q7 | In general, the binary search method needs no more than ……………. comparisons.
- [log2n]-1
- [logn]+1
- [log2n]
- [log2n]+1
Q8 | Which of the following is not the type of queue?
- ordinary queue
- single ended queue
- circular queue
- priority queue
Q9 | The property of binary tree is
- the first subset is called left subtree
- the second subtree is called right subtree
- the root cannot contain null
- the right subtree can be empty
Q10 | Any node is the path from the root to the node is called
- successor node
- ancestor node
- internal node
- none of the above
Q11 | Which is/are the application(s) of stack
- function calls
- large number arithmetic
- evaluation of arithmetic expressions
- all of the above
Q12 | A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
- directed tree
- undirected tree
- dis-joint tree
- direction oriented tree
Q13 | …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
- unary tree
- binary tree
- trinary tree
- both b and c
Q14 | Which of the following data structure is non-linear type?
- strings
- lists
- stacks
- tree
Q15 | Which of the following data structure is linear type?
- array
- tree
- graphs
- hierarchy
Q16 | The logical or mathematical model of a particular organization of data is called a ………
- data structure
- data arrangement
- data configuration
- data formation
Q17 | The simplest type of data structure is ………………
- multidimensional array
- linear array
- two dimensional array
- three dimensional array
Q18 | Linear arrays are also called ……………….
- straight line array
- one-dimensional array
- vertical array
- horizontal array
Q19 | Arrays are best data structures …………
- for relatively permanent collections of data
- for the size of the structure and the data in the structure are constantly changing
- for both of above situation
- for none of the above
Q20 | Which of the following data structures are indexed structures?
- linear arrays
- linked lists
- graphs
- trees
Q21 | Each node in a linked list has two pairs of ………….. and ……………….
- link field and information field
- link field and avail field
- avail field and information field
- address field and link field
Q22 | A …………………… does not keep track of address of every element in the list.
- stack
- string
- linear array
- queue
Q23 | When does top value of the stack changes?
- before deletion
- while checking underflow
- at the time of deletion
- after deletion
Q24 | Arrays are best data structures …………
- for relatively permanent collections of data.
- for the size of the structure and the data in the structure are constantly changing
- for both of above situation
- for none of the above
Q25 | Arrays are best data structures
- for relatively permanent collections of data
- for the size of the structure and the data in the structure are constantly changing
- for both of above situation
- for none of above situation