Chapter:

310+ more mcqs Solved MCQs

in Data Structures (DS)

Chapters

Take a Test Download as PDF
More MCQs
1.

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
Answer» D. all of the above
discuss
2.

A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

A. avl tree
B. red-black tree
C. lemma tree
D. none of the above
Answer» A. avl tree
discuss
3.

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
Answer» A. last in first out
discuss
4.

…………… is not the component of data structure.

A. operations
B. storage structures
C. algorithms
D. none of above
Answer» D. none of above
discuss
5.

Which of the following is not the part of ADT description?

A. data
B. operations
C. both of the above
D. none of the above
Answer» D. none of the above
discuss
6.

……………. Is a pile in which items are added at one end and removed from the other.

A. stack
B. queue
C. list
D. none of the above
Answer» B. queue
discuss
7.

………… is very useful in situation when data have to stored and then retrieved in reverse order.

A. stack
B. queue
C. list
D. link list
Answer» A. stack
discuss
8.

Which data structure allows deleting data elements from and inserting at rear?

A. stacks
B. queues
C. dequeues
D. binary search tree
Answer» B. queues
discuss
9.

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
discuss
10.

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
Answer» A. queue linked list
discuss
11.

Which of the following is non-liner data structure?

A. stacks
B. list
C. strings
D. trees
Answer» D. trees
discuss
12.

Herder node is used as sentinel in …..

A. graphs
B. stacks
C. binary tree
D. queues
Answer» C. binary tree
discuss
13.

Which data structure is used in breadth first search of a graph to hold nodes?

A. stack
B. queue
C. tree
D. array
Answer» B. queue
discuss
14.

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
discuss
15.

Which of the following data structure is non linear type?

A. strings
B. lists
C. stacks
D. graph
Answer» D. graph
discuss
16.

Which of the following data structure is linear type?

A. graph
B. trees
C. binary tree
D. stack
Answer» D. stack
discuss
17.

To represent hierarchical relationship between elements, Which data structure is suitable?

A. dequeue
B. priority
C. tree
D. graph
Answer» C. tree
discuss (1)
18.

A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

A. weakly connected
B. strongly connected
C. tightly connected
D. linearly connected
Answer» B. strongly connected
discuss
19.

In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

A. depth first
B. breadth first
C. with first
D. depth limited
Answer» A. depth first
discuss
20.

The number of comparisons done by sequential search is ………………

A. (n/2)+1
B. (n+1)/2
C. (n-1)/2
D. (n+2)/2
Answer» B. (n+1)/2
discuss
21.

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
Answer» A. linear search
discuss
22.

Which of the following is not the internal sort?

A. insertion sort
B. bubble sort
C. merge sort
D. heap sort
Answer» C. merge sort
discuss
23.

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
Answer» B. bipartite
discuss
24.

In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.

A. 0 and 1
B. 0 and -1
C. -1 and 0
D. 1 and 0
Answer» B. 0 and -1
discuss
25.

In a circular queue the value of r will be ..

A. r=r+1
B. r=(r+1)% [queue_size – 1]
C. r=(r+1)% queue_size
D. r=(r-1)% queue_size
Answer» C. r=(r+1)% queue_size
discuss
26.

The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

A. lists
B. linked lists
C. trees
D. queues
Answer» B. linked lists
discuss
27.

What will be the value of top, if there is a size of stack STACK_SIZE is 5

A. 5
B. 6
C. 4
D. none
Answer» C. 4
discuss
28.

………… is not the operation that can be performed on queue.

A. insertion
B. deletion
C. retrieval
D. traversal
Answer» D. traversal
discuss
29.

There is an extra element at the head of the list called a ……….

A. antinel
B. sentinel
C. list header
D. list head
Answer» B. sentinel
discuss
30.

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
Answer» A. vertices, edges
discuss
31.

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
Answer» C. both a and b
discuss
32.

In general, the binary search method needs no more than ……………. comparisons.

A. [log2n]-1
B. [logn]+1
C. [log2n]
D. [log2n]+1
Answer» D. [log2n]+1
discuss
33.

Which of the following is not the type of queue?

A. ordinary queue
B. single ended queue
C. circular queue
D. priority queue
Answer» B. single ended queue
discuss
34.

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
Answer» D. the right subtree can be empty
discuss
35.

Any node is the path from the root to the node is called

A. successor node
B. ancestor node
C. internal node
D. none of the above
Answer» B. ancestor node
discuss
36.

Which is/are the application(s) of stack

A. function calls
B. large number arithmetic
C. evaluation of arithmetic expressions
D. all of the above
Answer» D. all of the above
discuss
37.

A …………… is an acyclic digraph, which has only one 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
Answer» A. directed tree
discuss
38.

…………………. Is a directed tree in which outdegree of each node is less than or equal to two.

A. unary tree
B. binary tree
C. trinary tree
D. both b and c
Answer» B. binary tree
discuss
39.

Which of the following data structure is non-linear type?

A. strings
B. lists
C. stacks
D. tree
Answer» D. tree
discuss
40.

Which of the following data structure is linear type?

A. array
B. tree
C. graphs
D. hierarchy
Answer» A. array
discuss
41.

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
Answer» A. data structure
discuss
42.

The simplest type of data structure is ………………

A. multidimensional array
B. linear array
C. two dimensional array
D. three dimensional array
Answer» B. linear array
discuss
43.

Linear arrays are also called ……………….

A. straight line array
B. one-dimensional array
C. vertical array
D. horizontal array
Answer» B. one-dimensional array
discuss
44.

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
Answer» A. for relatively permanent collections of data
discuss
45.

Which of the following data structures are indexed structures?

A. linear arrays
B. linked lists
C. graphs
D. trees
Answer» A. linear arrays
discuss
46.

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
Answer» A. link field and information field
discuss
47.

A …………………… does not keep track of address of every element in the list.

A. stack
B. string
C. linear array
D. queue
Answer» C. linear array
discuss
48.

When does top value of the stack changes?

A. before deletion
B. while checking underflow
C. at the time of deletion
D. after deletion
Answer» D. after deletion
discuss
49.

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
Answer» A. for relatively permanent collections of data.
discuss
50.

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 above situation
Answer» A. for relatively permanent collections of data
discuss
51.

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
Answer» A. it is possible to get into infinite loop.
discuss
52.

A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

A. singly linked list
B. circular linked list
C. doubly linked list
D. linear linked list
Answer» C. doubly linked list
discuss
53.

A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

A. circular queue
B. random of queue
C. priority
D. dequeue
Answer» D. dequeue
discuss
54.

In a priority queue, insertion and deletion takes place at ………………

A. front, rear end
B. only at rear end
C. only at front end
D. any position
Answer» D. any position
discuss
55.

The time complexity of quick sort is …………..

A. o(n)
B. o(n2)
C. o(n log n)
D. o(log n)
Answer» C. o(n log n)
discuss
56.

Which of the following is an application of stack?

A. finding factorial
B. tower of hanoi
C. infix to postfix conversion
D. all of the above
Answer» B. tower of hanoi
discuss
57.

The data structure which is one ended is ………………

A. queue
B. stack
C. tree
D. graph
Answer» B. stack
discuss
58.

A list which displays the relationship of adjacency between elements is said to be

A. linear
B. non linear
C. linked list
D. trees
Answer» A. linear
discuss
59.

……………….. level is where the model becomes compatible executable code

A. abstract level
B. application level
C. implementation level
D. all of the above
Answer» C. implementation level
discuss
60.

Which of the following data structure is not linear data structure?

A. arrays
B. linked lists
C. both of the above
D. none of the above
Answer» D. none of the above
discuss
61.

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 ………..operation.

A. push, pop
B. pop, push
C. insert, delete
D. delete, insert
Answer» A. push, pop
discuss
62.

Each array declaration need not give, implicitly or explicitly, the information about

A. the name of array
B. the data type of array
C. the first data from the set to be stored
D. the index set of the array
Answer» C. the first data from the set to be stored
discuss
63.

The elements of an array are stored successively in memory cells because

A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
B. the architecture of computer memory does not allow arrays to store other than serially
C. both of above
D. none of above
Answer» A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
discuss
64.

Linked lists are best suited

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 above situation
Answer» B. for the size of the structure and the data in the structure are constantly changing
discuss
65.

Finding the location of the element with a given value is:

A. traversal
B. search
C. sort
D. none of above
Answer» B. search
discuss
66.

The operation of processing each element in the list is known as

A. sorting
B. merging
C. inserting
D. traversal
Answer» D. traversal
discuss
67.

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 above situatio
Answer» A. for relatively permanent collections of data
discuss
68.

Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

A. i-only
B. ii-only
C. both i and ii
D. none of the above
Answer» C. both i and ii
discuss
69.

What will be the value of top, if there is a size of stack STACK_SIZE is 5

A. 5
B. 6
C. 4
D. none of the above
Answer» C. 4
discuss
70.

………… is not the operation that can be performed on queue.

A. insertion
B. deletion
C. retrieval
D. traversal
Answer» D. traversal
discuss
71.

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. queue
D. dequeue
Answer» D. dequeue
discuss
72.

Which of the following name does not relate to stacks?

A. fifo lists
B. lifo list
C. piles
D. push-down lists
Answer» A. fifo lists
discuss
73.

The term "push" and "pop" is related to the

A. array
B. lists
C. stacks
D. all of the above
Answer» C. stacks
discuss
74.

Which data structure allows deleting data elements from front and inserting at rear?

A. stacks
B. queue
C. dequeue
D. binary search tree
Answer» B. queue
discuss
75.

node.next -> node.next.next; will make

A. node.next inaccessible
B. node.next.next inaccessible
C. this node inaccessible
D. none of the above
Answer» A. node.next inaccessible
discuss
76.

A circular linked list can be used for

A. stack
B. queue
C. both stack & queue
D. neither stack or queue
Answer» C. both stack & queue
discuss
77.

In doubly linked lists

A. a pointer is maintained to store both next and previous nodes.
B. two pointers are maintained to store next and previous nodes.
C. a pointer to self is maintained for each node.
D. none of the above
Answer» B. two pointers are maintained to store next and previous nodes.
discuss
78.

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
Answer» A. it is possible to get into infinite loop
discuss
79.

A linear list in which each node has pointers to point to the predecessor and successors nodes is called as

A. singly linked list
B. circular linked list
C. doubly linked list
D. linear linked list
Answer» C. doubly linked list
discuss
80.

The situation when in a linked list START=NULL is

A. underflow
B. overflow
C. housefull
D. saturated
Answer» A. underflow
discuss
81.

In doubly linked lists, traversal can be performed?

A. only in forward direction
B. only in reverse direction
C. in both directions
D. none of the above
Answer» C. in both directions
discuss
82.

What differentiates a circular linked list from a normal linked list?

A. you cannot have the ‘next’ pointer point to null in a circular linked list
B. it is faster to traverse the circular linked list
C. you may or may not have the ‘next’ pointer point to null in a circular linked list
D. head node is known in circular linked list
Answer» C. you may or may not have the ‘next’ pointer point to null in a circular linked list
discuss
83.

How do you count the number of elements in the circular linked list?

A. public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != head) { temp = temp.getnext(); length++; } return length; }
B. public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != null) { temp = temp.getnext(); length++; } return length; }
C. public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != head && temp != null) { temp = head.getnext(); length++; } return length; }
D. public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != head && temp == null) { temp = head.getnext(); length++; } return length; }
Answer» A. public int length(node head) { int length = 0; if( head == null) return 0; node temp = head.getnext(); while(temp != head) { temp = temp.getnext(); length++; } return length; }
discuss
84.

public int function()
{
if(head == null)
return Integer.MIN_VALUE;
int var;
Node temp = head;
while(temp.getNext() != head)
temp = temp.getNext();
if(temp == head)
{
var = head.getItem();
head = null;
return var;
}
temp.setNext(head.getNext());
var = head.getItem();
head = head.getNext();
return var;
} What is the functionality of the following code? Choose the most appropriate answer.

A. return data from the end of the list
B. returns the data and deletes the node at the end of the list
C. returns the data from the beginning of the list
D. returns the data and deletes the node from the beginning of the list
Answer» D. returns the data and deletes the node from the beginning of the list
discuss
85.

What is the functionality of the following code? Choose the most appropriate answer. public int function()
{
if(head == null)
return Integer.MIN_VALUE;
int var;
Node temp = head;
Node cur;
while(temp.getNext() != head)
{
cur = temp;
temp = temp.getNext();
}
if(temp == head)
{
var = head.getItem();
head = null;
return var;
}
var = temp.getItem();
cur.setNext(head);
return var;
}

A. return data from the end of the list
B. returns the data and deletes the node at the end of the list
C. returns the data from the beginning of the list
D. returns the data and deletes the node from the beginning of the list
Answer» B. returns the data and deletes the node at the end of the list
discuss
86.

How do you insert a node at the beginning of the list?

A. public class insertfront(int data) { node node = new node(data, head, head.getnext()); node.getnext().setprev(node); head.setnext(node); size++; }
B. public class insertfront(int data) { node node = new node(data, head, head); node.getnext().setprev(node); head.setnext(node); size++; }
C. public class insertfront(int data) { node node = new node(data, head, head.getnext()); node.getnext().setprev(head); head.setnext(node); size++; }
D. public class insertfront(int data) { node node = new node(data, head, head.getnext()); node.getnext().setprev(node); head.setnext(node.getnext()); size++; }
Answer» A. public class insertfront(int data) { node node = new node(data, head, head.getnext()); node.getnext().setprev(node); head.setnext(node); size++; }
discuss
87.

What is a dequeue?

A. a queue with insert/delete defined for both front and rear ends of the queue
B. a queue implemented with a doubly linked list
C. a queue implemented with both singly and doubly linked lists
D. a queue with insert/delete defined for front side of the queue
Answer» A. a queue with insert/delete defined for both front and rear ends of the queue
discuss
88.

Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

A. full: (rear+1) mod n == front, empty: rear == front
B. full: (rear+1) mod n == front, empty: (front+1) mod n == rear
C. full: rear == front, empty: (rear+1) mod n == front
D. full: (front+1) mod n == rear, empty: rear == front
Answer» A. full: (rear+1) mod n == front, empty: rear == front
discuss
89.

Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?

A. a queue cannot be implemented using this stack.
B. a queue can be implemented where enqueue takes a single instruction and dequeue takes a sequence of two instructions.
C. a queue can be implemented where enqueue takes a sequence of three instructions and dequeue takes a single instruction.
D. a queue can be implemented where both enqueue and dequeue take a single instruction each.
Answer» C. a queue can be implemented where enqueue takes a sequence of three instructions and dequeue takes a single instruction.
discuss
90.

Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are:
i. isEmpty (Q) — returns true if the queue is empty, false otherwise.
ii. delete (Q) — deletes the element at the front of the queue and returns its value.
iii. insert (Q, i) — inserts the integer i at the rear of the queue.
Consider the following function:
void f (queue Q) {
int i ;
if (!isEmpty(Q)) {
i = delete(Q);
f(Q);
insert(Q, i);
}
}What operation is performed by the above function f ?

A. leaves the queue q unchanged
B. reverses the order of the elements in the queue q
C. deletes the element at the front of the queue q and inserts it at the rear keeping the other elements in the same order
D. empties the queue q
Answer» B. reverses the order of the elements in the queue q
discuss
91.

Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS.
ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on
an array for almost all the basic LIST operations.
iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES
on a linear array with two indices.
iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?

A. (ii) and (iii) are true
B. (i) and (ii) are true
C. (iii) and (iv) are true
D. (ii) and (iv) are true
Answer» A. (ii) and (iii) are true
discuss
92.

Which of the following option is not correct?

A. if the queue is implemented with a linked list, keeping track of a front pointer, only rear pointer s will change during an insertion into an non-empty queue.
B. queue data structure can be used to implement least recently used (lru) page fault algorithm and quick short algorithm.
C. queue data structure can be used to implement quick short algorithm but not least recently used (lru) page fault algorithm.
D. both (a) and (c)
Answer» C. queue data structure can be used to implement quick short algorithm but not least recently used (lru) page fault algorithm.
discuss
93.

Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?

A. q[0]
B. q[1]
C. q[9]
D. q[10]
Answer» A. q[0]
discuss
94.

Overflow condition in linked list may occur when attempting to .............

A. create a node when free space pool is empty
B. traverse the nodes when free space pool is empty
C. create a node when linked list is empty
D. none of these
Answer» A. create a node when free space pool is empty
discuss
95.

Which of the following is not a type of Linked List ?

A. doubly linked list
B. singly linked list
C. circular linked list
D. hybrid linked list
Answer» D. hybrid linked list
discuss
96.

Linked list is generally considered as an example of _________ type of memory allocation.

A. static
B. dynamic
C. compile time
D. none of these
Answer» B. dynamic
discuss
97.

Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.

A. pointer to class
B. pointer to an integer
C. pointer to character
D. pointer to node
Answer» D. pointer to node
discuss
98.

If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?

A. 1036
B. 1028
C. 1038
D. none of these
Answer» D. none of these
discuss
99.

In Circular Linked List insertion of a node involves the modification of ____ links.

A. 3
B. 4
C. 1
D. 2
Answer» D. 2
discuss
100.

If a list contains no elements it is said to be

A. hollow
B. empty
C. finite
D. infinite
Answer» B. empty
discuss

Done Reading?

Take a Test Download as PDF
Tags
Question and answers in more mcqs, more mcqs multiple choice questions and answers, more mcqs Important MCQs, Solved MCQs for more mcqs, more mcqs MCQs with answers PDF download