More Classes
5th Class
6th Class
7th Class
8th Class
9th Class
10th Class
11th Class
12th Class
NAT I
NAT II
CSS
IQ
General Knowledge
MDCAT
ECAT
GAT General
GAT Subject
Other Links
Go to Home
Online Tests
CS-301 Final Term Exams Preparation Virtual University MCQs With Answers
Question # 1
By using _____ we avoid recursive method of traversing a tree,which makes use of stacks and consumes a lot of memory and time.
Choose an answer
Binary tree only
Threaded binary tree
Heap data structure
Huffman encoding
Previous
Skip
Next
Question # 2
it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.
Choose an answer
Variable
Constant
Inconsistent
None of the above
Previous
Skip
Next
Question # 3
Which one of the following is TRUE about recursion ?
Choose an answer
Recursion extensively use stack memory
Threaded Binary Trees use the concept of recursion.
Recursive function calls consume a lot of memory.
Iteration is more efficient than iteration.
Previous
Skip
Next
Question # 4
In a min heap , preculateDown procedure will move smaller value______ and bigger value______.
Choose an answer
left,right
right,left
up,down
down,up
Previous
Skip
Next
Question # 5
Consider te following array 23 15 5 12 40 10 7 After the first pass of a particular algorithm, the array looks like 15 5 12 23 10 7 40 Name the algorithm used
Choose an answer
Heap sort
Selection sort
Insertion sort
Bubble sort
Previous
Skip
Next
Question # 6
What is the formula of approixation for the depth of a heap with n nodes?
Choose an answer
log (base 2) of n
The number of digits in n (base 10 )e,g 145 has three digit
The square root of n
n
Previous
Skip
Next
Question # 7
In complete binary tree the bottom level is filled from________
Choose an answer
Left to right
Right to left
Not filled at all
None of the given option
Previous
Skip
Next
Question # 8
If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is _______
Choose an answer
N
N
2
Nlog
2
n
log
2
N
Previous
Skip
Next
Question # 9
While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.
Choose an answer
Equal to the small frequency
Equal to the greater
Equal to the sum of the two frequencies
Equal to the difference of the two frequencies
Previous
Skip
Next
Question # 10
If there are N elements in an array then the number of maximum steps needed to find an elements using Binary Search is __________
Choose an answer
N
N
2
Nlog2N
log
2
N
Previous
Skip
Next
Back
