CSD201 Questions and Answers | Updated
Which one of the following is an application of Stack Data Structure? ** Answ**
Managing function calls, The stock span problem, Arithmetic expression evaluation.
Which of the following is true about linked list implementation of stack? ** Answ** In
push operation = False.
To evaluate an expression without any embedded function calls: ** Answ** One
stack is enough.
What is written to the screen for the input "FileComp****ress*ion**" ? ** Answ**
iserCeliF
Suppose the f(n) function is defined on the set of integer numbers as below. What is the
value of f(-5)? ** Answ** 3
An algorithm that calls itself directly or indirectly is known as ** Answ** Recursion
Which data structure allows deleting data elements from front and inserting at rear? **
Answ** Queues
Identify the data structure which allows deletions at both ends of the list but insertion at
only one end. ** Answ** Input-restricted deque
Which of the following data structure is non-linear type? ** Answ** (Strings, Lists,
Stacks)= False.
Which of the following data structure is linear type? ** Answ** (Strings, Lists,
Stacks)= True.
To represent hierarchical relationship between elements, which data structure is
suitable? ** Answ** Tree
A binary tree whose every node has either zero or two children is called ** Answ**
Extended binary tree
The depth of a complete binary tree is given by ** Answ** Dn = log2n + 1
When representing any algebraic expression E which uses only binary operations in a
2-tree, ** Answ** the variable in E will appear as external nodes and operations in
internal nodes
A binary tree can easily be converted into q 2-tree ** Answ** by replacing each ...
new external node
,When converting binary tree into extended binary tree, all the original nodes in binary
tree are ** Answ** internal nodes on extended tree
The post order traversal of a binary tree is DEBFC. Find out the pre order traversal **
Answ** ABDECF
Which of the following sorting algorithm is of divide-and-conquer type? ** Answ**
Quick sort
In a binary tree, certain null entries are replaced by special pointers which point to
nodes higher in the tree for efficiency. These special pointers are called ** Answ**
thread
The in order traversal of tree will yield a sorted listing of elements of tree in ** Answ**
Binary search trees
In a Heap tree ** Answ** Values in a node is greater than every value in children of
it
In a graph if e=[u, v], Then u and v are called ** Answ** endpoints of e & adjacent
nodes & neighbors
A connected graph T without any cycles is called ** Answ** a tree graph & free tree
& a tree
In a graph if e=(u, v) means ** Answ** e begins at u and ends at v & u is processor
and v is successor
If every node u in G is adjacent to every other node v in G, A graph is said to be **
Answ** complete
Suppose a singly linked list of integers is given below: (head)7 10 6 4 2 13 8 3(tail) **
Answ** 7 10 6 4 2 13 8 5 3
Multi-programming. ** Answ** may use a queue
Select the most correct statement about the complexity of bubble sort * ** Answ**
The best case is 0(n). and the worst case is 0(n~2)
Object dequeue() {if (isEmpty()) return(null); return(pool.remove(0));} ** Answ** True
What is written to the screen for the input "HowAre**YouTo***Day" ? ** Answ**
ToDay
,Suppose a singly linked list of integers is given below and p is a reference to the node
with value 9 in the list (i.e. p.info=9): (head) 7 11 6 4 3 9 8 21 (tail) ** Answ** 7 11 6
4 3 13 9 8 21
In a linked list, the tail node is introduced for performance purpose only. ** Answ**
True
Using the Huffman code tree below. What is the result of decoding the string:
1100000001100 ? ** Answ** AABBBCAB
Which call will result in the most recursive calls? ** Answ** fun(-1012);
Select the most correct statement about the complexity of insertion sort ** Answ**
The best case is 0(n). and the worst case is 0(n~2)
A recursive method is a method that invokes itself directly or indirectly. For a recursive
method to terminate there must be one or more base cases. ** Answ** Most Correct
The operation for removing and returning the top element of the stack is traditionally
called: ** Answ** pop
What is the breadth-first traversal of a tree below after deleting the node 5 by merging?
** Answ** 2.1.4. 3. 7. 6. 8
In a singly-linked list we can insert a node after a given node with time complexity 0(1)
** Answ** True
In a singly-linked list there is no efficient way to insert a node before a given node in the
middle of the list (the action is considered efficient if it's complexity is 0(1)). ** Answ**
True
Specify the reason for data compression (select the best answer): ** Answ** Saving
data storage
Suppose you are using the LZW algorithm to encode the message AABCADAB
contents of the dictionary at the beginning of encoding are: (1) A (2) B (3) C (4) D What
string is denoted by code word (5)7 ** Answ** AA
Linked lists are best suited ** Answ** for relatively permanent collections of data.
Consider the binary tree below. Which statement is correct? (full binary tree = proper
binary tree = 2-tree) ** Answ** The tree is neither complete nor full.
The complexity of heap sort is ** Answ** 0(nlog n)
, What is the minimum number of nodes in a full binary tree with height 3? find a tree the
height of root is 1. and in a full binary tree every node other than tle leaves has two
children). ** Answ** 7
What is the minimum number of nodes in a nearly complete binary tree with heigh 4?
** Answ** 7
Given a raw message 'FFFF0000FFF00FFFFF00' (without single quote). Run the run-
length encoding algorithm for that message, what is the output? ** Answ**
4F403F205F20
Fill in the blank of the statement to form the most correct one: In a every element
contains some data and a link to the next element which allows to keep the structure.
** Answ** singly linked list
What is the correct definition of a hash table? ** Answ** ...used for storing items or
their addresses... i = h(x) in the table.
Specify the correct statement about chaining method for handling collision ** Answ**
In chaining ... keys or references to keys.
Which of the following applications may use a stack? ** Answ** Auxiliary data
structure for algorithms.
Select the most correct statement about the complexity of selection sort ** Answ**
Both best and worst cases are 0(n^2)
What values of n are directly handled by the stopping (base) case? ** Answ**
n==0&& n<35
6, 4, 7, 3, 5, 2 What is the balance factor of the node 4?(please note that the tree is still
AVL) ** Answ** 0
Consider the AVL tree below. What is the breadth first traversal of the tree after
inserting a node with value 24? ** Answ** 35, 22, 39, 12, 32, 37, 27, 24,
which call will result in the most recursive calls ? ** Answ** fun(-1025)
Consider the binary tree below. Which statement is correct? ** Answ** The tree is
full but not complete.
The Order followed by stack data structure is ** Answ** FIFO
How many stack will be needed for the evaluation of a prefix expression ** Answ** 0
Which one of the following is an application of Stack Data Structure? ** Answ**
Managing function calls, The stock span problem, Arithmetic expression evaluation.
Which of the following is true about linked list implementation of stack? ** Answ** In
push operation = False.
To evaluate an expression without any embedded function calls: ** Answ** One
stack is enough.
What is written to the screen for the input "FileComp****ress*ion**" ? ** Answ**
iserCeliF
Suppose the f(n) function is defined on the set of integer numbers as below. What is the
value of f(-5)? ** Answ** 3
An algorithm that calls itself directly or indirectly is known as ** Answ** Recursion
Which data structure allows deleting data elements from front and inserting at rear? **
Answ** Queues
Identify the data structure which allows deletions at both ends of the list but insertion at
only one end. ** Answ** Input-restricted deque
Which of the following data structure is non-linear type? ** Answ** (Strings, Lists,
Stacks)= False.
Which of the following data structure is linear type? ** Answ** (Strings, Lists,
Stacks)= True.
To represent hierarchical relationship between elements, which data structure is
suitable? ** Answ** Tree
A binary tree whose every node has either zero or two children is called ** Answ**
Extended binary tree
The depth of a complete binary tree is given by ** Answ** Dn = log2n + 1
When representing any algebraic expression E which uses only binary operations in a
2-tree, ** Answ** the variable in E will appear as external nodes and operations in
internal nodes
A binary tree can easily be converted into q 2-tree ** Answ** by replacing each ...
new external node
,When converting binary tree into extended binary tree, all the original nodes in binary
tree are ** Answ** internal nodes on extended tree
The post order traversal of a binary tree is DEBFC. Find out the pre order traversal **
Answ** ABDECF
Which of the following sorting algorithm is of divide-and-conquer type? ** Answ**
Quick sort
In a binary tree, certain null entries are replaced by special pointers which point to
nodes higher in the tree for efficiency. These special pointers are called ** Answ**
thread
The in order traversal of tree will yield a sorted listing of elements of tree in ** Answ**
Binary search trees
In a Heap tree ** Answ** Values in a node is greater than every value in children of
it
In a graph if e=[u, v], Then u and v are called ** Answ** endpoints of e & adjacent
nodes & neighbors
A connected graph T without any cycles is called ** Answ** a tree graph & free tree
& a tree
In a graph if e=(u, v) means ** Answ** e begins at u and ends at v & u is processor
and v is successor
If every node u in G is adjacent to every other node v in G, A graph is said to be **
Answ** complete
Suppose a singly linked list of integers is given below: (head)7 10 6 4 2 13 8 3(tail) **
Answ** 7 10 6 4 2 13 8 5 3
Multi-programming. ** Answ** may use a queue
Select the most correct statement about the complexity of bubble sort * ** Answ**
The best case is 0(n). and the worst case is 0(n~2)
Object dequeue() {if (isEmpty()) return(null); return(pool.remove(0));} ** Answ** True
What is written to the screen for the input "HowAre**YouTo***Day" ? ** Answ**
ToDay
,Suppose a singly linked list of integers is given below and p is a reference to the node
with value 9 in the list (i.e. p.info=9): (head) 7 11 6 4 3 9 8 21 (tail) ** Answ** 7 11 6
4 3 13 9 8 21
In a linked list, the tail node is introduced for performance purpose only. ** Answ**
True
Using the Huffman code tree below. What is the result of decoding the string:
1100000001100 ? ** Answ** AABBBCAB
Which call will result in the most recursive calls? ** Answ** fun(-1012);
Select the most correct statement about the complexity of insertion sort ** Answ**
The best case is 0(n). and the worst case is 0(n~2)
A recursive method is a method that invokes itself directly or indirectly. For a recursive
method to terminate there must be one or more base cases. ** Answ** Most Correct
The operation for removing and returning the top element of the stack is traditionally
called: ** Answ** pop
What is the breadth-first traversal of a tree below after deleting the node 5 by merging?
** Answ** 2.1.4. 3. 7. 6. 8
In a singly-linked list we can insert a node after a given node with time complexity 0(1)
** Answ** True
In a singly-linked list there is no efficient way to insert a node before a given node in the
middle of the list (the action is considered efficient if it's complexity is 0(1)). ** Answ**
True
Specify the reason for data compression (select the best answer): ** Answ** Saving
data storage
Suppose you are using the LZW algorithm to encode the message AABCADAB
contents of the dictionary at the beginning of encoding are: (1) A (2) B (3) C (4) D What
string is denoted by code word (5)7 ** Answ** AA
Linked lists are best suited ** Answ** for relatively permanent collections of data.
Consider the binary tree below. Which statement is correct? (full binary tree = proper
binary tree = 2-tree) ** Answ** The tree is neither complete nor full.
The complexity of heap sort is ** Answ** 0(nlog n)
, What is the minimum number of nodes in a full binary tree with height 3? find a tree the
height of root is 1. and in a full binary tree every node other than tle leaves has two
children). ** Answ** 7
What is the minimum number of nodes in a nearly complete binary tree with heigh 4?
** Answ** 7
Given a raw message 'FFFF0000FFF00FFFFF00' (without single quote). Run the run-
length encoding algorithm for that message, what is the output? ** Answ**
4F403F205F20
Fill in the blank of the statement to form the most correct one: In a every element
contains some data and a link to the next element which allows to keep the structure.
** Answ** singly linked list
What is the correct definition of a hash table? ** Answ** ...used for storing items or
their addresses... i = h(x) in the table.
Specify the correct statement about chaining method for handling collision ** Answ**
In chaining ... keys or references to keys.
Which of the following applications may use a stack? ** Answ** Auxiliary data
structure for algorithms.
Select the most correct statement about the complexity of selection sort ** Answ**
Both best and worst cases are 0(n^2)
What values of n are directly handled by the stopping (base) case? ** Answ**
n==0&& n<35
6, 4, 7, 3, 5, 2 What is the balance factor of the node 4?(please note that the tree is still
AVL) ** Answ** 0
Consider the AVL tree below. What is the breadth first traversal of the tree after
inserting a node with value 24? ** Answ** 35, 22, 39, 12, 32, 37, 27, 24,
which call will result in the most recursive calls ? ** Answ** fun(-1025)
Consider the binary tree below. Which statement is correct? ** Answ** The tree is
full but not complete.
The Order followed by stack data structure is ** Answ** FIFO
How many stack will be needed for the evaluation of a prefix expression ** Answ** 0
