Scribd
Upload
47 views3 pages

Q.No. Question Choice 1 Choice 2 Linked List Implementation of Queue

The document contains 25 multiple choice questions related to data structures and algorithms. It tests knowledge of concepts like stacks, queues, linked lists, trees, graphs, sorting algorithms, and more. The questions have 4 possible choices for each answer, with only one being marked as correct.

Uploaded by

Nick
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
47 views3 pages

Q.No. Question Choice 1 Choice 2 Linked List Implementation of Queue

The document contains 25 multiple choice questions related to data structures and algorithms. It tests knowledge of concepts like stacks, queues, linked lists, trees, graphs, sorting algorithms, and more. The questions have 4 possible choices for each answer, with only one being marked as correct.

Uploaded by

Nick
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 3

Q.No.

Question Choice 1 Choice 2


1 Which of the following data structure follows Last in First Out manner? Array Stack
2 Queue full as well as queue empty conditions at a time occurs due to……? Improper empty condition Linked List implementation of queue

3 Which of the following is false about Linked List? Random access with It is easy to insert and delete element in
linked list is fast Linked list

4 Which of the following is nonlinear data structure? Stack Linked List

5 In case of binary Search Tree which of the following traversal method gives Preorder Postorder
sorted output?

6 In which of the following tree height of left sub tree and height of right AVL Tree Expression Tree
sub tree differ at most by one?

An undirected Graph does


not An undirected can have at most one
7 Which of the following is false about Graph? contain multiple copies of edge between two vertices
same edge
8 Breadth First Search graph traversal method makes use of ………. data structure. Tree Stack
9 Complexity of merge sort algorithm is ….. O(n) O(log n)
10 If the number of records to be sorted is small, then ...... sorting can be efficient. Merge Heap
11 The operation for removing an entry from a stack is traditionally called: delete peek

What is the following code segment doing?

void fn( ){
char c;
cin.get(c);
if (c != '\n') { The string entered is The string entered is printed in
12 fn( ); printed as it is reverse order.
cout.put(c);
}
}

13 Which of the following statement is false ? Arrays are dense lists and stat Data elements in linked list need not be stor
14 Item in priority queue can jump to the front on the line if they have priority 1 0
15 The data structure required for Breadth First Traversal on a graph is Queue Stack
16 Which of the following operations is performed more efficiently by doubly linked list Deleting a node whose locationSearching of an unsorted list for a given item
17 Which of the following can a Dynamic Link Library contain? Only Code Code and Data Only
18 A full binary tree with 2n+1 nodes contain n leaf nodes n non-leaf nodes
19 If a node in a BST has two children, then its inorder predecessor has no left child no right child
What data structures you should use for dictionary searching and it should be capable of
20 doing spell check also ? array hashing

21 A technique for direct search is binary search linear search


22 Convert the infix to postfix for A-(B+C)*(D/E) ABC+DE/*- ABC-DE/*-
23 What is the postfix form of the following prefix expression -A/B*C$DE ABCDE$*/- A-BCDE$*/-

For a doubly linked list does the following segment


of code removes the element pointed to by X , if it is
24 assumed that X points to neither the first nor the last 1 0
element in the list.
X->prev->next = X->next;
X->next->prev = X->prev; ?

25 The situation when in a linked list START=NULL is underflow overflow


Choice 3 Choice 4 Correct Answer
Linked List Queue Choice 2
Improper full condition Wrong algorithm Choice 3
Linked list cannot be
Linked list can grow implemented Choice 1
dynamically using array also
Queue Tree Choice 4

Inorder none of these Choice 3

Threaded Binary Tree B Tree Choice 1

The graph can contain self


A graph in which edges have
edges. direction is called as Digraph Choice 3
A Self edge is called loop.

Queue Linked List Choice 3


O(n2) O(n log n) Choice 4
Selection Bubble Choice 3
pop remove Choice 3

It will go in an infinite
loop. It will print an empty line. Choice 2

Pointers store the next data elLinked lists are collection of the Choice 3
None Error Choice 1
Array Tree Choice 1
Inverting a node after the nodTraversing a list to process each Choice 1
Code and Resources only Code, Data and Resources Choice 4
(n-1) leaf nodes (n-1) non-leaf nodes Choice 2
two children no child Choice 2

linked list tree Choice 2

tree search hashing Choice 4


ABC-DE*/- none of these Choice 1
ABC$ED*/- A-BCDE$*/ Choice 1

none Error Choice 1

saturated housefull Choice 1


Choice 1
Choice 2
Choice 3
Choice 4

You might also like