Worksheets3ICTH7H8DSA
Total questions: 25
Worksheet time: 6hrs 1mins
Name
Class
Date
1.
In DFS, how many times a node is visited?
a)
Once
b)
Twice
c)
equivalent to number of indegree of the node
d)
equivalent to number of outdegree of the node
2.
The data structure required for BFS on a graph is ___________
a)
Queue
b)
Stack
c)
Linked list
d)
Array
3.
Which type of traversal of binary search tree outputs the value in sorted order?
a)
Pre-order
b)
In-order
c)
Post-order
d)
None
4.
A graph containing only isolated node is called a__________
a)
Simple Graph
b)
Weighted Graph
c)
Null Graph
d)
Multi Graph
5.
For the adjacency matrix of a directed graph, the row sum is the _________ degree and the column sum is the ________ degree.
a)
In, Out
b)
Out, In
c)
In, Total
d)
Out, Total
6.
Which of the following is non-liner data structure?
a)
Stacks
b)
List
c)
Strings
d)
Trees
7.
________ is a directed tree in which outdegree of each node is less than or equal to two.
a)
Unary tree
b)
Binary tree
c)
Threaded Binary tree
d)
BST
8.
Which of the following is an in-place sorting algorithm?
a)
Selection sort
b)
Bubble Sort
c)
Quick sort
d)
Insertion sort
9.
In a circular queue, how do you increment the rear end of the queue?
a)
rear++
b)
(rear+1) % CAPACITY
c)
(rear % CAPACITY)+1
d)
rear--
10.
A graph is a tree if and only if graph is
a)
Directed graph
b)
Contains no cycles
c)
Planar
d)
Completely connected
11.
Finding the location of a given item in a collection of items is called ______
a)
Discovering
b)
Searching
c)
Finding
d)
Traversing
12.
The searching technique that takes O (1) time to find a data is__________
a)
Linear Search
b)
Binary search
c)
Hashing
d)
Tree search
13.
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
14.
Assuming int is of 4 bytes, what is the size of int arr[15];?
a)
15
b)
19
c)
35
d)
60
15.
The postfix form of A*B+C/D is?
a)
*AB/CD+
b)
AB*CD/+
c)
A*BC+/D
d)
ABCD+/*
16.
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
17.
Which of the following sorting algorithm does not use recursion?
a)
Merge sort
b)
Quick sort
c)
Heap sort
d)
Insertion sort
18.
What maximum difference in heights between the leafs of a AVL tree is possible?
a)
log(n) where n is the number of nodes
b)
0 or 1
c)
atmost 1
d)
equal heights
19.
A ________ does not keep track of address of every element in the list
a)
Stack
b)
String
c)
Linear array
d)
Linked list
20.
Which one of the following is an application of Queue Data Structure?
a)
When a resource is shared among multiple consumers.
b)
When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes
c)
Load Balancing
d)
All of the above
21.
A normal queue, if implemented using an array of size MAX_SIZE, it gets full when_______
a)
Rear==MAX_SIZE-1
b)
Front==(Rear+1)mod MAX_SIZE
c)
Front==Rear+1
d)
Rear==front
22.
______ eliminates primary clustering but not secondaryclustering.
a)
Linear probing
b)
Quadratic probing
c)
Double hashing
d)
Rehashing
23.
What is a hash function?
a)
A function has allocated memory to keys
b)
A function that computes the location of the key in the array
c)
A function that creates an array
d)
A function that computes the location of the values in the array
24.
Which of the following is not an application of stack?
a)
Finding Factorial
b)
Tower of Hanoi
c)
An escalator
d)
DVD Disc stand
25.
Each node in a linked list has two pairs of _______ and _______
a)
Information field and link field
b)
Link field and avail field
c)
Avail field and information field
d)
Address field and link field
100 %
