Cs 301

paper was very easy, mostly from Moaz bhai files, can say 80% mcqs were from
past and subjective 2 question from moaz file,

Q1, how can we avoid dangling reference? marks 2
Q2: tree was given from that, we have to show, level-order traversal, tree nodes were, root 5...left child 2 right child 10....10's
right child 20 and left child 8, 20's left child 15, right child 22 marks 3
Q3: why queue is linear data? marks 2
Q4: a program line was given from class template, and we had to tell it is true or false, and tell the reason as well marks 3
Q5: a program was given of reference variable, of 4 lines , we have to write comments in front and one line they says its
wrong, we have to identify the line as well marks 5
Q6: a tree was given with nodes , and we have to follow the post order traversal and then make the binary search tree of it,
marks 5,
best of luck to every one

My paper
Total 26 questions 20mcqs
1) Inorder and postorder were given
Inorder : {L,C,A,D,F,M}
Postorder: {L,C,D,F,M,A} :- not sure about sequence
Draw binary tree usning inorder and postorder.
Hint: last variable of postorder is root.variables before the root in inorder forms left subtree and variables after the root in
inorder forms right subtree. (5 marks)
2) A tree was given and last node inserted was told.do double rotation to form AVL tree. (5marks)
3) A tree was given,check if it is AVL tree.if not,given reason.
4) A function was given,tell what thhis function is doing.function was of preoder tranversal.
I forgot two questions

75 percent MCQs from Moaaz file
How we can delete a node with two Childs in a binary search tree using its right sub tree.(2 Marks)
Explain the two cases in which we apply double rotation in An Avl tree.(2 Marks)
If we delete the node from the given tree then draw the tree.(3 Marks)

Total Marks = 40
Total MCQs of 1 Mark = 20
Short Subjective Question of 2 Marks = 2
Subjective Question of 3 Marks = 2
Subjective Questions of 5 Marks = 2

MCQs was from past papers
What is the difference between call by value and call by reference? 2
What is a pre-order traversal? 2
Redraw the given tree and write balance of it. 2
A code was given and we have to tell what the recursive function is doing. 3
10 integer values was given and we have to draw a binary search tree. Then delete a node 65 from it and redraw the tree. 5
Values was given and we have to draw AVL tree after balancing it. 5

CS301 paper

1. describe level in Binary tree ? (2)
2. In which condition of AVL tree we use double rotation ? (2)
3. code tha Myint ka ka btana tha is mn kia ho rha ha .(3)
4. Binary tree dia hoa tha is mn kia problm ha nd solution kia hoga . (3)
5. AVL tree bnana tha nodes die hoe the . (5)
6. BST ki pre order , post order nd inorder traversal krni thi .(5)

Total Questions: 27
Total MCQs of 1 Mark: 22
Total Short Subjective Question of 3 Marks:3
Total Long Subjective Question of 5 Marks:2
Q23)Question on Binary tree?
Q24)Question on AVL Tree ?
Q25)Question on pre order traversal?
Q26)Question on in order traversal ?

Total Questions = 26
Total Marks = 40
Q)What are the disadvantages of AVL tree(2)
Q)Describe the Logic of Function:(2)
int&Fun(int&y)
{
y=y+100;
return y;
}
Q)Define the remove method of BST and its two arguments(3)
Q)Tell the Levels of the tree :(3)

20 mcqz and 7 subjective questions
7,8 mcqz from past papers moaaz file
2 marks questions are
Aik code dia tha T_ree node ka usko complete krna tha.
difference between depth d and depth of tree.
How we can say thats this is AVL tree.
Aik code diya tha uski correction krni thee.
Aik tree di thee us main preorder and inorder traversal krni thee.
Aik or tree di thee us ki AVL bnani thee or rotaion krni thee one by one all steps perform krne thay according to AVL tree.
yeh tha mera paper too much easy..
Plz pray for me
best of luck to all of u.

Objective to 22 lwectures se but subjective mostly last lectures se ata hai trees se
ap log agr subjective k liyee just trees ko b achay se krain to apka 80% paper bht acha ho jae.
jin students ko is subjec main problem arhee hai wo preshan na hn trss k concepts clear krain or inorder , preorder,
postorder k to apko koi difficulty nai ho gi.
Objective k liyee Lnk list. Array, stack, Queue , inorder, pre and postorder and trees k concepts ko clear krain.

subjective were from AVL, BST, reference variable..
half of mcqs were also from AVL, BST, reference variable. I would suggest you to get these prepared before you appear.
5marks questions were as follow
1, Rebuild BST from given tree.
2, Build and rotate AVL tree from given data.
3marks question were as follow
1, reference variable code was given, we have tell what it suppose to do
2, BST was given, we have to delete node from it and rebuild tree
2marks questions were as follow1, BST tree was given, we have to find root's successor after deleting root. only node number
was asked, no diagram
2, Defination of BST, its depth and level was asked
80% mcqs were new, 20% were from previous papers.

Q:In case of in order traversal of BST, which node is node "in-order successor" of current node?(2)
Q:Which type of rotation of needed to restore the balance of the following.(2)

Q: Output btani thi (3)
Q:Draw BST of the values of 2,6,5,4,7,8,9 (3)
Q:Code was given:
2 parts were given to define that conditions of code.(5)
Q:Unbalanced tree was given ,perform the double rotation(both steps).Last inserted node is 8.(5)

paper was very easy, mostly from Moaz bhai files, can say 80% mcqs were from past and subjective 2 question from moaz file,
marks 5,

My paper


Total Marks = 40


CS301 paper


Total Questions: 27

Total Marks = 40
int&Fun(int&y)
{
y=y+100;
return y;
}

Plz pray for me



My paper
Hint: last variable of postorder is root.variables before the root in inorder forms left subtree and variables after the root in inorder
forms right subtree. (5 marks)

paper was very easy, mostly from Moaz bhai files, can say 80% mcqs were from past and subjective 2 question from moaz file,
marks 5,

My paper


Total Marks = 40


CS301 paper


Total Questions: 27

Total Marks = 40
int&Fun(int&y)
{
y=y+100;
return y;
}

Plz pray for me



My Today's paper.
MCQ's were mostly from past papers......
Q 1: How can we calculate the height of tree?
Q 2: Draw the resultant binary search tree (BST) after deleting the node 8 from the following BST.

Q 3: show the result of inserting 2,1,4,5,9,3,6 into an empty AVL tree. You have to show only the complete AVL tree, steps
are not required.
Q 4: Consider the following AVL tree. Insert a new node with key of 12,no need to show all steps just draw the final AVL tree.

Q 5: Last question related to Inorder and pre-order.
BEST OF LUCK

12
8
15
2
7
14
g 18
4
13

My Today's paper.

are not required.

BEST OF LUCK

My Today's paper.

12
8
15
2
7
14
g 18
4
13
12
8
15
2
7

are not required.

BEST OF LUCK

CS301- Data Structures

JAN 30,2011

LATEST SOLVED MCQS FROM FINALTERM PAPERS

MC100401285 Moaaz.pk@gmail.com MC100401285@gmail.com PSMD01

FINALTERM EXAMINATION
Spring 2010

Question No: 1 ( Marks: 1 ) - Please choose one

A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time.

True (Page 4)

False


Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure?
Linked List

Stack (Page 54)

Queue Tree


What will be postfix expression of the following infix expression? Infix Expression : a+b*c-d

ab+c*d

abc*+d abc+*d abcd+*


For compiler a postfix expression is easier to evaluate than infix expression?

True Click here for detail
14
g 18
4
13

False

Question No: 5 ( Marks: 1 ) - Please choose one Consider the following pseudo code

declare a stack of characters

while ( there are more characters in the word to read ) {

read a character

push the character on the stack
}

while ( the stack is not empty ) {

pop a character off the stack write the character to the screen
}

What is written to the screen for the input "apples"? selpa

selppa apples

aaappppplleess


Consider the following function:

void test_a(int n)

{

cout << n << " "; if (n>0)

test_a(n-2);
}

What is printed by the call test_a(4)?

4 2

0 2 4 0 2 2 4


If there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

N -1 (Page 304)

N+1 N+2 N


If there are N internal nodes in a binary tree then what will be the no. of external nodes in this binary tree?
N -1

N

N +1 (Page 303)

N +2


If we have 1000 sets each containing a single different person. Which of the following relation will be true on each set:

Reflexive (page 387) Symmetric

Transitive Associative


Which one of the following is NOT the property of equivalence relation:
Reflexive

Symmetric Transitive

Associative (page 387)

A binary tree of N nodes has _______.
Log10 N levels

Log2 N levels (Page 212)

N / 2 levels N x 2 levels


The easiest case of deleting a node from BST is the case in which the node to be deleted ___________.

Is a leaf node (Page 173)

Has left subtree only Has right subtree only Has both left and right subtree


If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is
_______ .

N

N2

Nlog2N
log2N Question No: 14

O(nlogn) sorts Interchange sort Average time is quadratic

None of the given options. (page 440)

( Marks: 1 ) - Please choose one

Merge sort and quick sort both fall into the same category of sorting algorithms. What is this category?

(not sure)

(Page 488)


If one pointer of the node in a binary tree is NULL then it will be a/an _______ .

External node (Page 303)

Root node Inner node Leaf node


We convert the ________ pointers of binary to threads in threaded binary tree.
Left

Right

NULL (Page 312)

None of the given options


If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a

Expression tree

Threaded binary tree

complete Binary tree (Page 323) Perfectly complete Binary tree

Question No: 18 ( Marks: 1 ) - Please choose one What is the best definition of a collision in a hash table?
Two entries are identical except for their keys. Two entries with different data have the exact same key

Two entries with different keys have the same exact hash value. (page 464) Two entries with the exact same key have
different hash values.


Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are now
guaranteed to be in their final spot (never to be moved again )

21

41

42 Click here for detail 43

Question No: 20 ( Marks: 1 ) - Please choose on

Suppose you implement a Min heap (with the smallest element on top) in an array. Consider the different arrays below;
determine the one that cannot possibly be a heap:

16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28 16, 24, 18, 28, 30, 20, 22

16, 24, 20, 30, 28, 18, 22 (page 334)


Do you see any problem in the code of nextInOrder below: TreeNode * nextInorder(TreeNode * p)

{

if(p->RTH == thread)
return( p->R );

else {

p = p->R;

while(p->LTH == child) p = p->R;

return p; }

}

The function has no problem and will fulfill the purpose successfully. The function cannot be compile as it has syntax
error. The function has logical problem, therefore, it will not work properly.

The function will be compiled but will throw runtime exception immediately after the control is transferred to this
function.


Which of the following statement is correct about find(x) operation:
A find(x) on element x is performed by returning exactly the same node that is found. A find(x) on element x is
performed by returning the root of the tree containing x. Click here for detail A find(x) on element x is performed by
returning the whole tree itself containing x. A find(x) on element x is performed by returning TRUE.


Which of the following statement is NOT correct about find operation:

It is not a requirement that a find operation returns any specific name, just that finds on two elements return the same
answer if and only if they are in the same set.

One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can
be used to name the set.

Initially each set contains one element.

Initially each set contains one element and it does not make sense to make a tree of one node only.


In complete binary tree the bottom level is filled from ________

Left to right (Page 323)

Right to left

Not filled at all


Question
No: 25
( Marks: 1 ) - Please
choose one

Here is an array of
ten integers:

5 3 8 9 1 7 0 2 6 4
The array after the FIRST iteration of the large loop in a
selection sort (sorting from smallest to largest).
0 3 8 9 1 7 5 2 6 4 (Page 477)
2 6 4 0 3 8 9 1 7 5
2 6 4 9 1 7 0 3 8 5
0 3 8 2 6 4 9 1 7 5
Question
No: 26
choose one

What requirement is placed on an array, so that binary search may be used to locate an entry?
The array elements must form a heap.

The array must have at least 2 entries.

The array must be sorted. Click here for detail The arrays size must be a power of two


Spring 2010


Which one of the following operations returns top value of the stack?
Push

Pop

Top (page 53)

First


Compiler uses which one of the following in Function calls,
Stack (page 80)

Queue

Binary Search Tree AVL Tree


Every AVL is _________________

Binary Tree

Complete Binary Tree None of these

Binary Search Tree Click here for detail


If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?
54

55 56

57 (page 303)

If there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?
23

24 21

22 (page 303)

Which one of the following is not an example of equivalence relation?
Electrical connectivity

Set of people

<= relation (page 388) Set of pixels


Binary Search is an algorithm of searching, used with the ______ data.

Sorted (page 432)

Unsorted

Heterogeneous Random


Which one of the following is NOT true regarding the skip list?
Each list Si contains the special keys + infinity and - infinity. List S0 contains the keys of S in non-decreasing
order. Each list is a subsequence of the previous one. List Sh contains only the n special keys. (page 446)


A simple sorting algorithm like selection sort or bubble sort has a worst-case of
O(1) time because all lists take the same amount of time to sort O(n) time because it has to perform n swaps to
order the list.

O(n2) time because sorting 1 element takes O(n) time - After 1 pass through the list,either of these algorithms
can guarantee that 1 element is sorted. (page 487)

O(n3) time, because the worst case has really random input which takes longer to sort.


Which of the following is a property of binary tree?
A binary tree of N external nodes has N internal node. A binary tree of N internal nodes has N+ 1 external
node. (page 303)
A binary tree of N external nodes has N+ 1 internal node. A binary tree of N internal nodes has N- 1 external
node.
Question No: 11

consumes a lot of memory and time.
Binary tree only Threaded binary tree Heap data structure ( Marks: 1 ) - Please choose one By using
__________we avoid the recursive method of traversing a Tree, which makes use of stacks and

(page 306 )

Huffman encoding


Which of the following statement is true about dummy node of threaded binary tree?
This dummy node never has a value.

This dummy node has always some dummy value.

This dummy node has either no value or some dummy value. (Page 321) This dummy node has always some
integer value.


For a perfect binary tree of height h, having N nodes, the sum of heights of nodes is
N - (h - 1)

N - (h + 1) (page 373)

N - 1

N - 1 + h

Question No: 14 ( Marks: 1 ) - Please choose one What is the best definition of a collision in a hash table? Two entries are
identical except for their keys.
Two entries with different data have the exact same key

Two entries with different keys have the same exact hash value. (page 464) Two entries with the exact same key
have different hash values.


Which formula is the best approximation for the depth of a heap with n nodes?

log (base 2) of n (page 353)

The number of digits in n (base 10), e.g., 145 has three digits The square root of n

n



It is not a requirement that a find operation returns any specific name, just that finds on two elements return the
same answer if and only if they are in the same set.

One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the
root can be used to name the set.




Which of the following is not true regarding the maze generation? Randomly remove walls until the entrance and exit cells
are in the same set. Removing a wall is the same as doing a union operation.

Remove a randomly chosen wall if the cells it separates are already in the same set. (page 424) Do not remove a
randomly chosen wall if the cells it separates are already in the same set.


In threaded binary tree the NULL pointers are replaced by ,
preorder successor or predecessor

inorder successor or predecessor (page 307) postorder successor or predecessor NULL pointers are not replaced


Which of the given option is NOT a factor in Union by Size:
Maintain sizes (number of nodes) of all trees, and during union. Make smaller tree, the subtree of the larger one.

Make the larger tree, the subtree of the smaller one. (page 408)

Implementation: for each root node i, instead of setting parent[i] to -1, set it to -k if tree rooted at i has k nodes.


Suppose we had a hash table whose hash function is n % 12, if the number 35 is already in the hash table, which of the
following numbers would cause a collision?

144

145 143 148

Question No: 21 ( Marks: 1 ) - Please choose o


The array must have at least 2 entries. The array must be sorted. Click here for detail The arrays size must be a power
of two


A binary tree with 24 internal nodes has ______ external nodes.
22

23 48

25 (page 303)


In case of deleting a node from AVL tree, rotation could be prolong to the root node.
Yes (Page 267)

No


when we have declared the size of the array, it is not possible to increase or decrease it during the ________of the
program.

Declaration

Execution (page 17)

Defining

None of the abov


it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.

Variable

Constant (page 60) Inconsistent

None of the above


_______ is the stack characteristic but _______was implemented because of the size limitation of the array.

isFull(),isEmpty() pop(), push()

isEmpty() , isFull() (page 59) push(),pop()

Spring 2010


What kind of list is best to answer questions such as "What is the item at position n?"

Lists implemented with an array. Click here for detail

Doubly-linked lists.

Singly-linked lists.

Doubly-linked or singly-linked lists are equally best


Each node in doubly link list has,
1 pointer

2 pointers (page 39)

3 pointers

4 pointers



54

55 56
57 Question No: 4 (page 303)

N -1

N

N +1 (page 303)

N +2


A binary tree with N internal nodes has _____ links, _______ links to internal nodes and ________ links to external nodes

N+1, 2N, N-1 N+1, N-1, 2N

2N, N-1, N+1 (page 304)

N-1, 2N, N+1


The definition of Transitivity property is
For all element x member of S, x R x For all elements x and y, x R y if and only if y R x

For all elements x, y and z, if x R y and y R z then x R z (page 385)

For all elements w, x, y and z, if x R y and w R z then x R z


Which one of the following is not an example of equivalence relation:

Set of people

<= relation (page 388)

Set of pixels


Union is a _______ time operation.

Constant (page 405)

Polynomial

Exponential




Sorted (page 432)

Unsorted




O(1) time because all lists take the same amount of time to sort O(n) time because it has to perform n swaps to order the
list.

O(n2) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these algorithms




O(nlogn) sorts

Interchange sort

Average time is quadratic
None of the given options.
( Marks: 1 ) (Page 488) - Please choose one

Huffman encoding uses _________ tree to develop codes of varying lengths for the letters used in the original message.

Linked list Stack

Queue

Binary tree (page 287)


The left pointer of dummy node points to the itself while the right pointer points to the root of tree. The left
pointer of dummy node points to the root node of the tree while the right pointer points
itself i.e. to dummy node (page 321)

The left pointer of dummy node points to the root node of the tree while the right pointer is always NULL.

The right pointer of dummy node points to the itself while the left pointer is always NULL.


Consider a min heap, represented by the following array: 10,30,20,70,40,50,80,60

After inserting a node with value 31.Which of the following is the updated min heap?
10,30,20,31,40,50,80,60,70 (page 336)

10,30,20,70,40,50,80,60,31

10,31,20,30,40,50,80,60,31 31,10,30,20,70,40,50,80,60


Consider a min heap, represented by the following array: 11,22,33,44,55


11,22,33,44,55,66 (page 336)

11,22,33,44,66,55

11,22,33,66,44,55 11,22,66,33,44,55


Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are now guaranteed
to be in their final spot (never to be moved again)?

21

41

42 Click here for detail

43


_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Array () List

Both of these (page 10)

None of these


The maximum number of external nodes (leaves) for a binary tree of height H is _________
2H Click here for detail

2H +1

2H -1 2H +2


A complete binary tree of height ____ has nodes between 16 to 31 .
2

3

4 (page 373)

5





Question
No: 21
( Marks:
1 )
- Please
choose one

Here is an array of
ten integers:

5 3 8 9 1 7 0 2 6 4
0 3 8 9 1 7 5 2 6 4 (Page 477)
2 6 4 0 3 8 9 1 7 5
2 6 4 9 1 7 0 3 8 5
0 3 8 2 6 4 9 1 7 5
Question
No: 22
( Marks:
1 )
- Please
choose one

Suppose A is an array containing numbers in increasing order, but some numbers occur more than once when using a binary
search for a value, the binary search always finds ____________

the first occurrence of a value. Click here for detail

the second occurrence of a value.

may find first or second occurrence of a value. None of the given options.



22 23 48

25 (page 303)



Variable

Constant (page 60)

Inconsistent

None of the above


+ is a _________operator.

Unary

Binary (page 64) Ternary

None of the above


A kind of expressions where the operator is present between two operands called ________expressions.

Postfix

Infix (page 64)

Prefix

None of the above.


Spring 2010


Here is a small function definition:

void f(int i, int &k)

{

i = 1; k = 2; }

Suppose that a main program has two integer variables x and y, which are given the value 0. Then the main program calls
f(x,y); What are the values of x and y after the function f finishes?

Both x and y are still 0. x is now 1, but y is still 0. x is still 0, but y is now 2. x is now 1, and y is now 2.



N+1, 2N, N-1 N+1, N-1, 2N

2N, N-1, N+1 (page 304) N-1, 2N, N+1



1 pointer

2 pointers (Page 39) 3 pointers

4 pointers


If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure
to use.

Array

List

Both of these (page 10) None of these




Set of people

<= relation (Page 388) Set of pixels


If a complete binary tree has height h then its no. of nodes will be,
Log (h)

2h+1- 1 (page 125) Log (h) - 1

2h - 1


If a max heap is implemented using a partially filled array called data, and the array contains n elements (n >

0), where is the entry with the greatest value? Data[0] is correct

data[1] data[n-1] data[n]

data[2*n+1]


Which one is a self-referential data type?

Stack

Queue

Link list Click here for detail

All of these


There is/are ________ case/s for rotation in an AVL tree,

1

3 2

4 (page 229)


Which of the following can be the inclusion criteria for pixels in image segmentation.

Pixel intensity

Texture

Threshold of intensity

All of the given options (page 421)


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

Heap sort

Selection sort Insertion sort

Bubble sort (According to rule)


In a perfectly balanced tree the insertion of a node needs ________ .

One rotation (Page 225)

Two rotations

Rotations equal to number of levels No rotation at all


_______ .

N

N2

Nlog2N

log2N (page 440)


Which of the following is NOT a correct statement about Table ADT.
In a table, the type of information in columns may be different. A table consists of several columns, known as
entities. (page 408) The row of a table is called a record.

A major use of table is in databases where we build and use tables for keeping information.


If both pointers of the node in a binary tree are NULL then it will be a/an _______ .

Inner node

Leaf node (page 120) Root node

Question No: 16 ( Marks: 1 ) - Please choose one Suppose we are sorting an array of eight integers using quick sort, and we
have just finished the first partitioning with the array looking like this:

2 5 1 7 9 12 11 10

Which statement is correct?

The pivot could be either the 7 or the 9.(page 506) The pivot could be the 7, but it is not the 9. The pivot is not the
7, but it could be the 9. Neither the 7 nor the 9 is the pivot.


What is the best definition of a collision in a hash table?





N - (h - 1)

N - (h + 1) (Page 373)

N - 1

N - 1 + h


A binary tree with 33 internal nodes has _______ links to internal nodes.

31

32 (Page 304) 33

66



16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28 16, 24, 18, 28, 30, 20, 22

16, 24, 20, 30, 28, 18, 22 (see min heap property at page 337)


Which of the following is not true regarding the maze generation?

Randomly remove walls until the entrance and exit cells are in the same set. Removing a wall is the same as doing a
union operation.

Remove a randomly chosen wall if the cells it separates are already in the same set. (Page 424) Do not remove a



log (base 2) of n (Page 353)


n




inorder successor or predecessor (Page 307) postorder successor or predecessor NULL pointers are not replaced


The _______ method of list will position the currentNode and lastCurrentNode at the start of the list.

Remove

Next

Start (Page 38)

Back


Mergesort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?

Elements in the first half of the array are less than or equal to elements in the second half of the array. None of the given
options.

The array elements form a heap.

Elements in the second half of the array are less than or equal to elements in the first half of the

array. Click here for detail



144

145 143 148


Fall 2009


The arguments passed to a function should match in number, type and order with the parameters in the function definition.

True False


If numbers 5, 222, 4, 48 are inserted in a queue, which one will be removed first?

48

4

222

5 (According to rule)


Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode).
What statement changes currentNode so that it refers to the next node?

currentNode ++;

currentNode = nextNode; currentNode += nextNode;

currentNode = currentNode->nextNode;


A Compound Data Structure is the data structure which can have multiple data items of same type or of different types.
Which of the following can be considered compound data structure?
Arrays

LinkLists

Binary Search Trees

All of the given options Click here for detail




{

i = 1; k = 2; }


Both x and y are still 0.

x is now 1, but y is still 0. x is still 0, but y is now 2. x is now 1, and y is now 2.


The difference between a binary tree and a binary search tree is that ,

a binary search tree has two children per node whereas a binary tree can have none, one, or two children per
node Click here for detail

in binary search tree nodes are inserted based on the values they contain in binary tree nodes are inserted based on the
values they contain none of these


Compiler uses which one of the following to evaluate a mathematical equation,

Binary Tree

Binary Search Tree

Parse Tree (Page 274)

AVL Tree


54

55 56

57 (Page 303)


23

24 21

22 (n-1) (Page 304)


Which of the following method is helpful in creating the heap at once?
insert

add

update

preculateDown (Page 358)




For all elements x, y and z, if x R y and y R z then x R z (Page 385) For all elements w, x, y and z, if x R y and w R z
then x R z
Question No: 12 ( Marks: 1 ) - Please choose one A binary tree of N nodes has _______.
Log10 N levels

Log2 N levels (Page 349) N / 2 levels

N x 2 levels


_______ .

N

N2

Nlog2N

log2N (page 440)



23 15 5 12 40 10 7


15 12 23 10 7 40


Heap sort

Bubble sort



Inner node

Leaf node (Page 313)

Root node



By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of
memory and time.

Binary tree only
Threaded binary tree (page 306 ) Heap data structure Huffman encoding

Question No: 17

( Marks: 1 ) - Please choose one A complete binary tree of height 3 has between ________ nodes.
8 to 14 8 to 15 (Page 124)

8 to 16 8 to 17

2^(d+1) - 1 = 2^(3+1) -1 = 2^4 -1 = 16-1 = 15


Consider a min heap, represented by the following array: 3,4,6,7,5,10


3,4,6,7,5,10,1

3,4,6,7,5,1,10 3,4,1,5,7,10,6

1,4,3,5,7,10,6 close to correct but correct ans is 1,4,3,7,5,10,6 (page 337)




10,30,20,31,40,50,80,60,70 (page 337)

10,30,20,70,40,50,80,60,31

10,31,20,30,40,50,80,60,31 31,10,30,20,70,40,50,80,60


Which one of the following algorithms is most widely used due to its good average time,
Bubble Sort

Insertion Sort

Quick Sort Click here for detail Merge Sort



performed by returning the root of the tree containing x.
Click here for detail

A find(x) on element x is performed by returning the whole tree itself containing x. (Page 10) A find(x) on element x is
performed by returning TRUE.








The following are statements related to queues.

last item to be added to a queue is the first item to be removed False statement
A queue is a structure in which both ends are not used False statement

The last element hasnt to wait until all elements preceding it on the queue are removed False statement queue is said to be a last-in-first-out
list or LIFO data structure. False statement

Which of the above is/are related to normal queues?

(iii) and (ii) only

(i), (ii) and (iv) only (ii) and (iv) only




2H +1

2H -1 2H +2




Right to left

Not filled at all



We are given N items to build a heap, this can be done with _____ successive inserts.

N-1

N (Page 353)

N+1 N^2



144

145 143 148

Question
No: 28
choose one

Here is an array of
ten integers:
5 3 8 9 1 7 0 2 6 4
0 3 8 9 1 7 5 2 6 4 (Page 477)
2 6 4 0 3 8 9 1 7 5
2 6 4 9 1 7 0 3 8 5
0 3 8 2 6 4 9 1 7 5
Question
No: 29
choose one




The array must be sorted. Click here for detail The arrays size must be a power of two.



Yes (Page 267)

No


Fall 2009


__________ only removes items in reverse order as they were entered.

Stack (Page 81)

Queue

Both of these None of these




{

i = 1; k = 2; }




Question No: 3 ( Marks: 1 ) - Please choose one Select the one FALSE statement about binary trees:
Every binary tree has at least one node. (Page 113)
Every non-empty tree has exactly one root node. Every node has at most two children. Every non-root node
has exactly one parent.


Every AVL is _________________

Binary Tree

Binary Search Tree Click here for detail Question No: 5

( Marks: 1 ) - Please choose one Searching an element in an AVL tree take maximum _______ time (where n is no. of nodes
in AVL tree),
Log2(n+1) Log2(n+1) -1 1.44 Log2n (Page 227) 1.66 Log2n


Suppose that we have implemented a priority queue by storing the items in a heap. We are now executing a reheapification
downward and the out-of-place node has priority of 42. The nodes parent has a priority of 72, the left child has priority 52 and
the nodes right child has priority 62. Which statement best describes the status of the reheapification.

The reheapification is done.

The next step will interchange the two children of the out-of-place node. The next step will swap the out-of-place node
with its parent. The next step will swap the out-of-place node with its left child.


Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays below, determine the
one that cannot possibly be a heap:

7 6 5 4 3 2 1

7 3 6 2 1 4 5 7 6 4 3 5 2 1 7 3 6 4 2 5 1

According to max heap property



23

24 21

22 (N-1)


N -1 (Page 304)

N+1 N+2 N



Reflexive


Associative (Page 385)



then x R z



Constant ( Page 120)

Polynomial

Exponential

None of the given option


Which of the following is NOT a correct statement about Table ADT. In a table, the type of information in columns may be
different. yes A table consists of several columns, known as entities. (Page 408 ) The row of a table is called a record.



In the worst case of deletion in AVL tree requires _________.
Only one rotation

Rotation at each non-leaf node Rotation at each leaf node

Rotations equal to log2 N (Page 441)


Sorted (Page 432)

Unsorted



Which of the following statement is correct?

A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense,
a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in
actual sense, a link) to its PREOREDR successor.

actual sense, a link) to its INORDER successor. (Page 307)

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual
sense, a link) to its POSTORDER successor.


memory and time.

Binary tree only

Threaded binary tree (page 306 )

Heap data structure Huffman encoding


Which of the following statement is NOT true about threaded binary tree?
Right thread of the right-most node points to the dummy node. Left thread of the left-most node points to the
dummy node. The left pointer of dummy node points to the root node of the tree. Left thread of the right-most node
points to the dummy node. (page 321)




11,22,33,44,55,66 (page 337)

11,22,33,44,66,55

11,22,33,66,44,55 11,22,66,33,44,55



After calling the function deleteMin().Which of the following is the updated min heap?
4,6,7,5

6,7,5,4

4,5,6,7 (page 349) 4,6,5,7


We can build a heap in ________ time.

Linear (Page 353)

Exponential

Polynomial



Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array
looking like this:

2 5 1 7 9 12 11 10


The pivot could be either the 7 or the 9. (page 506)

The pivot could be the 7, but it is not the 9. The pivot is not the 7, but it could be the 9 Neither the 7 nor the 9 is the
pivot.





n



16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28 16, 24, 18, 28, 30, 20, 22

16, 24, 20, 30, 28, 18, 22 Its not satisfy the min heap property.

While joining nodes in the building of Huffman encoding tree if there are more nodes with same frequency, we choose the
nodes _______.

Randomly (Page 289)

That occur first in the text message That are lexically smaller among others. That are lexically greater among others


Consider the following paragraph with blanks.

A ... is a linear list where and take place at the same end . This end is called the ..

would be the correct filling the above blank positions?
(i) queue (ii) insertion (iii) removals (iv) top (i) stack (ii) insertion (iii) removals (iv) bottom (i) stack (ii)
insertion (iii) removals (iv) top (Page 52)
(i) tree (ii) insertion (iii) removals (iv) top


31

32 (n-1 links to internal nodes) (Page 304)

33 66


Which traversal gives a decreasing order of elements in a heap where the max element is stored at the top?
post-order

level-order inorder



What requirement is placed on an array, so that binary search may be used to locate an entry


The array must be sorted Click here for detail

The arrays size must be a power of two.


Which of the following is a non linear data structure?
Linked List

Stack

Queue

Tree (Page 112)

Fall 2009


The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should

Use better data structures

Increase the hard disk space (Page 5)

Use the better algorithm

Use as much data as we can store on the hard disk


In an array list the current element is

The first element Click here for detail

The middle element The last element

The element where the current pointer points to


Which one of the following is a valid postfix expression?

ab+c*d

abc*+d(According to rule)

abc+*d

(abc*)+d


In sequential access data structure, accessing any element in the data structure takes different amount of time. Tell which one
of the following is sequential access data structure,

Arrays

Lists Click here for detail

Both of these

None of these


I have implemented the queue with a circular array. If data is a circular array of CAPACITY elements, and last is an index into
that array, what is the formula for the index after last?

(last % 1) + CAPACITY

last % (1 + CAPACITY)

(last + 1) % CAPACITY

last + (1 % CAPACITY)

This expression will point to field after last that will be the first field.


Which one of the following is TRUE about recursion?

Recursion extensively uses stack memory. (page 149)

Threaded Binary Trees use the concept of recursion. Recursive function calls consume a lot of memory. Iteration is
more efficient than iteration.



Binary Tree

Binary Search Tree


AVL Tree


Which one of the following is TRUE about iteration?

Iteration extensively uses stack memory. Threaded Binary Trees use the concept of iteration. Iterative function calls
consumes a lot of memory.

Recursion is more efficient than iteration. Click here for detail


If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the
entry with the greatest value? Data[0] is correct

data[1]

data[n-1] data[n]

data[2*n+1]



54

55 56
57 Question No: 11 (n+1)

Which of the following heap method increase the value of key at position p by the amount delta?

increaseKey(p,delta) (Page 363)

decreaseKey(p,delta)

preculateDown(p,delta) remove(p,delta)



Reflexive (page 387)

Symmetric




Electrical connectivity Set of people

<= relation (Page 388)

Set of pixels
Question No: 14

Log10 N levels Log2 N levels N / 2 levels ( Marks: 1 ) - Please choose one A binary tree of N nodes has _______.

(Page 212)

N x 2 levels

Question No: 15 ( Marks: 1 ) http://vustudents.ning.com - Please choose one


Sorted (Page 432)

Unsorted


23 15 5 12 40 10 7
15 5 12 23 10 7 40


Heap sort

Bubble sort Question No: 17 (According to rule) ( Marks: 1 ) - Please choose one

Which of the following statements is correct property of binary trees? A binary tree with N internal nodes has N+1 internal
links. A binary tree with N external nodes has 2N internal nodes.

A binary tree with N internal nodes has N+1 external nodes. (page 304)

None of above statement is a property of the binary tree.


A binary tree of N external nodes has N internal node.

A binary tree of N internal nodes has N+ 1 external node. (Page 304)

A binary tree of N external nodes has N+ 1 internal node. A binary tree of N internal nodes has N- 1 external node.

- Please choose one

The left pointer of dummy node points to the itself while the right pointer points to the root of tree.

The left pointer of dummy node points to the root node of the tree while the right pointer points
(Page 321)





Expression tree


complete Binary tree (Page 323)

Perfectly complete Binary tree


In a selection sort of n elements, how many times the swap function is called to complete the execution of the algorithm?

n-1 Click here for detail

n log n n2

1



performed by returning the root of the tree containing x. Click here for
detail

A find(x) on element x is performed by returning the whole tree itself containing x. A find(x) on element x is performed
by returning TRUE.








Consider the following postfix expression S and the initial values of the variables.

S = A B - C + D E F - + ^

Assume that A=3, B=2, C=1, D=1, E=2, F=3

What would be the final output of the stack?


2

0 -1



2H +1

2H -1 2H +2




inorder successor or predecessor (Page 307)

postorder successor or predecessor NULL pointers are not replaced


In a min heap , preculateDown procedure will move smaller value______ and bigger value______.
left,right

right,left

up,down (Page 358)

down,up
Question No: 28 Which of the following statement is correct about union:

root of the other.

( Marks: 1 )
(Greedy algorithms , Page 7) - Please choose one To perform Union of two sets, we merge the two trees
by making the root of one tree point to the

To perform Union of two sets, we merge the two trees by making the leaf node of one tree point to the root of the
other.

To perform Union of two sets, merging operation of trees in not required at all. None of the given options.







Let heap stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root of the heap contains the maximum
element. What is the result of deleting 40 from this heap

[50,32, 37,13, 28, 22, 36] according to max heap property.

[37, 28, 32, 22, 36, 13]

[37, 36, 32, 28, 13, 22] [37, 32, 36, 13, 28, 22]

Fall 2009


In an array we can store data elements of different types.

True

False


Which one of the following statement is NOT correct .

In linked list the elements are necessarily to be contiguous

In linked list the elements may locate at far positions in the memory (page 18)

In linked list each element also has the address of the element next to it In an array the elements are contiguous
Question No: 3

True

False(page 39)

Question No: 4 ( Marks: 1 ) - Please choose one Doubly Linked List always has one NULL pointer.

( Marks: 1 )

- Please choose one

A queue is a data structure where elements are,

inserted at the front and removed from the back. .(see example at page #89 nd 90)

inserted and removed from the top.

inserted at the back and removed from the front. inserted and removed from both ends.



1 pointer

2 pointers(page 39)

3 pointers

4 pointers


I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers
will change during an insertion into an EMPTY queue?

Neither changes

Only front pointer changes. Only rear pointer changes.

Both change.

Since it is an empty queue the front and rear are initialize to -1, so on insertion both the pointers will change and point
to 0.



Binary Tree

Binary Search Tree

Parse Tree(page 274)

AVL Tree


If a complete binary tree has n number of nodes then its height will be,

Log2 (n+1) -1(page 139)

2n

Log2 (n) - 1 2n - 1



Log (h)

2h+1- 1(page 324) Log (h) - 1

2h - 1


A binary relation R over S is called an equivalence relation if it has following property(s)

Reflexivity

Symmetry Transitivity




Sorted (page 432)

Unsorted



_______ .

N

N2

Nlog2N
log2N Question No: 13 (page 440)

Use of binary tree in compression of data is known as _______ .

Traversal

Heap

Union
Huffman encoding Question No: 14 (page 287) ( Marks: 1 ) - Please choose one

While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.
Equal to the small frequency

Equal to the greater

Equal to the sum of the two frequencies (page 293)

Equal to the difference of the two frequencies



A binary tree with N internal nodes has N+ 1 external node. (page 303)




A binary tree of N internal nodes has N+ 1 external node. (page 303)




A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in
actual sense, a link) to its INORDER successor.


A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD
(in actual sense, a link) to its INORDER successor. (Page 307)

actual sense, a link) to its POSTORDER successor.





A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD
(in actual sense, a link) to its INORDER predecessor.

actual sense, a link) to its POSTORDER predecessor.


A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a
link) to its __________ successor.

levelorder

Preorder

Inorder Click here for detail

Postorder




This dummy node has either no value or some dummy value. .(page 321)

This dummy node has always some integer value.


A complete binary tree is a tree that is _________ filled, with the possible exception of the bottom level.
partially

completely (page 323)

incompletely

partly


A complete binary tree of height 3 has between ________ nodes.
8 to 14

8 to 15 (page 124)

8 to 16 8 to 17



Linear (page 353)

Exponential Polynomial




21

41


43



16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28 16, 24, 18, 28, 30, 20, 22
Question No: 26 16, 24, 20, 30, 28, 18, 22 ( Marks: 1 ) - Please choose one Its not satisfy the min heap property







Consider the following infix expression:

x - y * a + b / c

Which of the following is a correct equivalent expression(s) for the above?

x y -a * b +c /

x *y a - b c / +

x y a * - b c / + Hint :- (x - y * a) +( b / c)

x y a * - b/ + c


2

3

4 (page 124)

5

Question
No: 29
( Marks:
1 )
- Please
choose one

Here is an array of
ten integers:

5 3 8 9 1 7 0 2 6 4
0 3 8 9 1 7 5 2 6 4 (Page 477)
2 6 4 0 3 8 9 1 7 5
2 6 4 9 1 7 0 3 8 5
0 3 8 2 6 4 9 1 7 5
Question
No: 30
( Marks:
1 )
- Please
choose one




The array must be sorted. Click here for detail



JAN 30,2011

LATEST SOLVED MCQS FROM FINALTERM PAPERS

MC100401285 Moaaz.pk@gmail.com MC100401285@gmail.com PSMD01

Spring 2010


A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time.

True (Page 4)

False


Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure?
Linked List

Stack (Page 54)

Queue Tree


What will be postfix expression of the following infix expression? Infix Expression : a+b*c-d

ab+c*d

abc*+d abc+*d abcd+*


For compiler a postfix expression is easier to evaluate than infix expression?

True Click here for detail

False

Question No: 5 ( Marks: 1 ) - Please choose one Consider the following pseudo code


while ( there are more characters in the word to read ) {

read a character

}

while ( the stack is not empty ) {

pop a character off the stack write the character to the screen
}

What is written to the screen for the input "apples"? selpa

selppa apples

aaappppplleess



void test_a(int n)

{

cout << n << " "; if (n>0)

test_a(n-2);
}


4 2

0 2 4 0 2 2 4



N -1 (Page 304)

N+1 N+2 N


N -1

N

N +1 (Page 303)

N +2



Reflexive (page 387) Symmetric



Reflexive


Associative (page 387)

A binary tree of N nodes has _______.
Log10 N levels

Log2 N levels (Page 212)

N / 2 levels N x 2 levels


The easiest case of deleting a node from BST is the case in which the node to be deleted ___________.

Is a leaf node (Page 173)

Has left subtree only Has right subtree only Has both left and right subtree


_______ .

N

N2

Nlog2N
log2N Question No: 14

O(nlogn) sorts Interchange sort Average time is quadratic

None of the given options. (page 440)



(not sure)

(Page 488)


If one pointer of the node in a binary tree is NULL then it will be a/an _______ .

External node (Page 303)

Root node Inner node Leaf node


We convert the ________ pointers of binary to threads in threaded binary tree.
Left

Right

NULL (Page 312)




Expression tree


complete Binary tree (Page 323) Perfectly complete Binary tree

Question No: 18 ( Marks: 1 ) - Please choose one What is the best definition of a collision in a hash table?

Two entries with different keys have the same exact hash value. (page 464) Two entries with the exact same key have
different hash values.


Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are now
guaranteed to be in their final spot (never to be moved again )

21

41

42 Click here for detail 43



16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28 16, 24, 18, 28, 30, 20, 22

16, 24, 20, 30, 28, 18, 22 (page 334)


Do you see any problem in the code of nextInOrder below: TreeNode * nextInorder(TreeNode * p)

{

if(p->RTH == thread)
return( p->R );

else {

p = p->R;

while(p->LTH == child) p = p->R;

return p; }

}

The function has no problem and will fulfill the purpose successfully. The function cannot be compile as it has syntax
error. The function has logical problem, therefore, it will not work properly.

The function will be compiled but will throw runtime exception immediately after the control is transferred to this
function.


performed by returning the root of the tree containing x. Click here for detail A find(x) on element x is performed by
returning the whole tree itself containing x. A find(x) on element x is performed by returning TRUE.



It is not a requirement that a find operation returns any specific name, just that finds on two elements return the same
answer if and only if they are in the same set.

One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can
be used to name the set.






Right to left

Not filled at all


Question
No: 25
choose one

Here is an array of
ten integers:

5 3 8 9 1 7 0 2 6 4
0 3 8 9 1 7 5 2 6 4 (Page 477)
2 6 4 0 3 8 9 1 7 5
2 6 4 9 1 7 0 3 8 5
0 3 8 2 6 4 9 1 7 5
Question
No: 26
choose one



The array must be sorted. Click here for detail The arrays size must be a power of two


Spring 2010


Which one of the following operations returns top value of the stack?
Push

Pop

Top (page 53)

First


Compiler uses which one of the following in Function calls,
Stack (page 80)

Queue

Binary Search Tree AVL Tree


Every AVL is _________________

Binary Tree


Binary Search Tree Click here for detail


54

55 56

57 (page 303)

23

24 21

22 (page 303)

Which one of the following is not an example of equivalence relation?

Set of people

<= relation (page 388) Set of pixels



Sorted (page 432)

Unsorted



Which one of the following is NOT true regarding the skip list?
Each list Si contains the special keys + infinity and - infinity. List S0 contains the keys of S in non-decreasing
order. Each list is a subsequence of the previous one. List Sh contains only the n special keys. (page 446)


O(1) time because all lists take the same amount of time to sort O(n) time because it has to perform n swaps to
order the list.

O(n2) time because sorting 1 element takes O(n) time - After 1 pass through the list,either of these algorithms



A binary tree of N external nodes has N internal node. A binary tree of N internal nodes has N+ 1 external
node. (page 303)
A binary tree of N external nodes has N+ 1 internal node. A binary tree of N internal nodes has N- 1 external
node.
Question No: 11

consumes a lot of memory and time.
Binary tree only Threaded binary tree Heap data structure ( Marks: 1 ) - Please choose one By using
__________we avoid the recursive method of traversing a Tree, which makes use of stacks and

(page 306 )

Huffman encoding




This dummy node has either no value or some dummy value. (Page 321) This dummy node has always some
integer value.


N - (h - 1)

N - (h + 1) (page 373)

N - 1

N - 1 + h

Question No: 14 ( Marks: 1 ) - Please choose one What is the best definition of a collision in a hash table? Two entries are
identical except for their keys.
Two entries with different data have the exact same key




log (base 2) of n (page 353)


n








Which of the following is not true regarding the maze generation? Randomly remove walls until the entrance and exit cells
are in the same set. Removing a wall is the same as doing a union operation.

Remove a randomly chosen wall if the cells it separates are already in the same set. (page 424) Do not remove a



inorder successor or predecessor (page 307) postorder successor or predecessor NULL pointers are not replaced







144

145 143 148

Question No: 21 ( Marks: 1 ) - Please choose o


The array must have at least 2 entries. The array must be sorted. Click here for detail The arrays size must be a power
of two


22

23 48

25 (page 303)


Yes (Page 267)

No


when we have declared the size of the array, it is not possible to increase or decrease it during the ________of the
program.

Declaration

Execution (page 17)

Defining

None of the abov



Variable

Constant (page 60) Inconsistent

None of the above


_______ is the stack characteristic but _______was implemented because of the size limitation of the array.

isFull(),isEmpty() pop(), push()

isEmpty() , isFull() (page 59) push(),pop()

Spring 2010


What kind of list is best to answer questions such as "What is the item at position n?"

Lists implemented with an array. Click here for detail

Doubly-linked lists.

Singly-linked lists.

Doubly-linked or singly-linked lists are equally best


1 pointer

2 pointers (page 39)

3 pointers

4 pointers



54

55 56
57 Question No: 4 (page 303)

N -1

N

N +1 (page 303)

N +2



N+1, 2N, N-1 N+1, N-1, 2N

2N, N-1, N+1 (page 304)

N-1, 2N, N+1



For all elements x, y and z, if x R y and y R z then x R z (page 385)

For all elements w, x, y and z, if x R y and w R z then x R z



Set of people

<= relation (page 388)

Set of pixels



Constant (page 405)

Polynomial

Exponential




Sorted (page 432)

Unsorted




O(1) time because all lists take the same amount of time to sort O(n) time because it has to perform n swaps to order the
list.

O(n2) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these algorithms




O(nlogn) sorts

Interchange sort

Average time is quadratic
( Marks: 1 ) (Page 488) - Please choose one

Huffman encoding uses _________ tree to develop codes of varying lengths for the letters used in the original message.

Linked list Stack

Queue

Binary tree (page 287)


The left pointer of dummy node points to the itself while the right pointer points to the root of tree. The left
pointer of dummy node points to the root node of the tree while the right pointer points
itself i.e. to dummy node (page 321)





10,30,20,31,40,50,80,60,70 (page 336)

10,30,20,70,40,50,80,60,31

10,31,20,30,40,50,80,60,31 31,10,30,20,70,40,50,80,60




11,22,33,44,55,66 (page 336)

11,22,33,44,66,55

11,22,33,66,44,55 11,22,66,33,44,55



21

41


43


_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Array () List

Both of these (page 10)

None of these



2H +1

2H -1 2H +2


2

3

4 (page 373)

5





Question
No: 21
( Marks:
1 )
- Please
choose one

Here is an array of
ten integers:

5 3 8 9 1 7 0 2 6 4
0 3 8 9 1 7 5 2 6 4 (Page 477)
2 6 4 0 3 8 9 1 7 5
2 6 4 9 1 7 0 3 8 5
0 3 8 2 6 4 9 1 7 5
Question
No: 22
( Marks:
1 )
- Please
choose one







22 23 48

25 (page 303)



Variable

Constant (page 60)

Inconsistent

None of the above



Unary

Binary (page 64) Ternary

None of the above


A kind of expressions where the operator is present between two operands called ________expressions.

Postfix

Infix (page 64)

Prefix

None of the above.


Spring 2010




{

i = 1; k = 2; }


Both x and y are still 0. x is now 1, but y is still 0. x is still 0, but y is now 2. x is now 1, and y is now 2.



N+1, 2N, N-1 N+1, N-1, 2N

2N, N-1, N+1 (page 304) N-1, 2N, N+1



1 pointer

2 pointers (Page 39) 3 pointers

4 pointers


If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure
to use.

Array

List

Both of these (page 10) None of these




Set of people

<= relation (Page 388) Set of pixels


Log (h)

2h+1- 1 (page 125) Log (h) - 1

2h - 1


If a max heap is implemented using a partially filled array called data, and the array contains n elements (n >

0), where is the entry with the greatest value? Data[0] is correct

data[1] data[n-1] data[n]

data[2*n+1]


Which one is a self-referential data type?

Stack

Queue

Link list Click here for detail

All of these



1

3 2

4 (page 229)


Which of the following can be the inclusion criteria for pixels in image segmentation.

Pixel intensity

Texture

Threshold of intensity




23 15 5 12 40 10 7

15 5 12 23 10 7 40


Heap sort


Bubble sort (According to rule)


In a perfectly balanced tree the insertion of a node needs ________ .

One rotation (Page 225)

Two rotations

Rotations equal to number of levels No rotation at all


_______ .

N

N2

Nlog2N

log2N (page 440)


Which of the following is NOT a correct statement about Table ADT.
In a table, the type of information in columns may be different. A table consists of several columns, known as
entities. (page 408) The row of a table is called a record.




Inner node

Leaf node (page 120) Root node

Question No: 16 ( Marks: 1 ) - Please choose one Suppose we are sorting an array of eight integers using quick sort, and we
have just finished the first partitioning with the array looking like this:

2 5 1 7 9 12 11 10


The pivot could be either the 7 or the 9.(page 506) The pivot could be the 7, but it is not the 9. The pivot is not the
7, but it could be the 9. Neither the 7 nor the 9 is the pivot.


What is the best definition of a collision in a hash table?





N - (h - 1)

N - (h + 1) (Page 373)

N - 1

N - 1 + h



31

32 (Page 304) 33

66



16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28 16, 24, 18, 28, 30, 20, 22

16, 24, 20, 30, 28, 18, 22 (see min heap property at page 337)


Which of the following is not true regarding the maze generation?

Randomly remove walls until the entrance and exit cells are in the same set. Removing a wall is the same as doing a
union operation.

Remove a randomly chosen wall if the cells it separates are already in the same set. (Page 424) Do not remove a





n




inorder successor or predecessor (Page 307) postorder successor or predecessor NULL pointers are not replaced


The _______ method of list will position the currentNode and lastCurrentNode at the start of the list.

Remove

Next

Start (Page 38)

Back


Mergesort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?

Elements in the first half of the array are less than or equal to elements in the second half of the array. None of the given
options.

The array elements form a heap.

Elements in the second half of the array are less than or equal to elements in the first half of the

array. Click here for detail



144

145 143 148


Fall 2009


The arguments passed to a function should match in number, type and order with the parameters in the function definition.

True False


If numbers 5, 222, 4, 48 are inserted in a queue, which one will be removed first?

48

4

222

5 (According to rule)


Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode).
What statement changes currentNode so that it refers to the next node?

currentNode ++;

currentNode = nextNode; currentNode += nextNode;



A Compound Data Structure is the data structure which can have multiple data items of same type or of different types.
Which of the following can be considered compound data structure?
Arrays

LinkLists

Binary Search Trees

All of the given options Click here for detail




{

i = 1; k = 2; }






a binary search tree has two children per node whereas a binary tree can have none, one, or two children per
node Click here for detail

in binary search tree nodes are inserted based on the values they contain in binary tree nodes are inserted based on the
values they contain none of these



Binary Tree

Binary Search Tree


AVL Tree


54

55 56

57 (Page 303)


23

24 21

22 (n-1) (Page 304)


Which of the following method is helpful in creating the heap at once?
insert

add

update

preculateDown (Page 358)




then x R z
Question No: 12 ( Marks: 1 ) - Please choose one A binary tree of N nodes has _______.
Log10 N levels

Log2 N levels (Page 349) N / 2 levels

N x 2 levels


_______ .

N

N2

Nlog2N

log2N (page 440)



23 15 5 12 40 10 7


15 12 23 10 7 40


Heap sort

Bubble sort



Inner node

Leaf node (Page 313)

Root node



memory and time.

Binary tree only
Threaded binary tree (page 306 ) Heap data structure Huffman encoding

Question No: 17

( Marks: 1 ) - Please choose one A complete binary tree of height 3 has between ________ nodes.
8 to 14 8 to 15 (Page 124)

8 to 16 8 to 17

2^(d+1) - 1 = 2^(3+1) -1 = 2^4 -1 = 16-1 = 15


Consider a min heap, represented by the following array: 3,4,6,7,5,10


3,4,6,7,5,10,1

3,4,6,7,5,1,10 3,4,1,5,7,10,6

1,4,3,5,7,10,6 close to correct but correct ans is 1,4,3,7,5,10,6 (page 337)




10,30,20,31,40,50,80,60,70 (page 337)

10,30,20,70,40,50,80,60,31

10,31,20,30,40,50,80,60,31 31,10,30,20,70,40,50,80,60


Which one of the following algorithms is most widely used due to its good average time,
Bubble Sort

Insertion Sort

Quick Sort Click here for detail Merge Sort



performed by returning the root of the tree containing x.
Click here for detail

A find(x) on element x is performed by returning the whole tree itself containing x. (Page 10) A find(x) on element x is
performed by returning TRUE.









last item to be added to a queue is the first item to be removed False statement
A queue is a structure in which both ends are not used False statement

The last element hasnt to wait until all elements preceding it on the queue are removed False statement queue is said to be a last-in-first-out
list or LIFO data structure. False statement


(iii) and (ii) only

(i), (ii) and (iv) only (ii) and (iv) only




2H +1

2H -1 2H +2




Right to left

Not filled at all



We are given N items to build a heap, this can be done with _____ successive inserts.

N-1

N (Page 353)

N+1 N^2



144

145 143 148

Question
No: 28
choose one

Here is an array of
ten integers:

5 3 8 9 1 7 0 2 6 4
0 3 8 9 1 7 5 2 6 4 (Page 477)
2 6 4 0 3 8 9 1 7 5
2 6 4 9 1 7 0 3 8 5
0 3 8 2 6 4 9 1 7 5
Question
No: 29
choose one




The array must be sorted. Click here for detail The arrays size must be a power of two.



Yes (Page 267)

No


Fall 2009


__________ only removes items in reverse order as they were entered.

Stack (Page 81)

Queue

Both of these None of these




{

i = 1; k = 2; }




Question No: 3 ( Marks: 1 ) - Please choose one Select the one FALSE statement about binary trees:
Every binary tree has at least one node. (Page 113)
Every non-empty tree has exactly one root node. Every node has at most two children. Every non-root node
has exactly one parent.


Every AVL is _________________

Binary Tree

Binary Search Tree Click here for detail Question No: 5

( Marks: 1 ) - Please choose one Searching an element in an AVL tree take maximum _______ time (where n is no. of nodes
in AVL tree),
Log2(n+1) Log2(n+1) -1 1.44 Log2n (Page 227) 1.66 Log2n


Suppose that we have implemented a priority queue by storing the items in a heap. We are now executing a reheapification
downward and the out-of-place node has priority of 42. The nodes parent has a priority of 72, the left child has priority 52 and
the nodes right child has priority 62. Which statement best describes the status of the reheapification.

The reheapification is done.

The next step will interchange the two children of the out-of-place node. The next step will swap the out-of-place node
with its parent. The next step will swap the out-of-place node with its left child.


Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays below, determine the
one that cannot possibly be a heap:

7 6 5 4 3 2 1

7 3 6 2 1 4 5 7 6 4 3 5 2 1 7 3 6 4 2 5 1

According to max heap property



23

24 21

22 (N-1)


N -1 (Page 304)

N+1 N+2 N



Reflexive


Associative (Page 385)



then x R z



Constant ( Page 120)

Polynomial

Exponential

None of the given option


Which of the following is NOT a correct statement about Table ADT. In a table, the type of information in columns may be
different. yes A table consists of several columns, known as entities. (Page 408 ) The row of a table is called a record.



In the worst case of deletion in AVL tree requires _________.
Only one rotation

Rotation at each non-leaf node Rotation at each leaf node

Rotations equal to log2 N (Page 441)


Sorted (Page 432)

Unsorted




A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense,
a link) to its INORDER successor.


actual sense, a link) to its INORDER successor. (Page 307)

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual
sense, a link) to its POSTORDER successor.


memory and time.

Binary tree only

Threaded binary tree (page 306 )

Heap data structure Huffman encoding


Which of the following statement is NOT true about threaded binary tree?
Right thread of the right-most node points to the dummy node. Left thread of the left-most node points to the
dummy node. The left pointer of dummy node points to the root node of the tree. Left thread of the right-most node
points to the dummy node. (page 321)




11,22,33,44,55,66 (page 337)

11,22,33,44,66,55

11,22,33,66,44,55 11,22,66,33,44,55



After calling the function deleteMin().Which of the following is the updated min heap?
4,6,7,5

6,7,5,4

4,5,6,7 (page 349) 4,6,5,7



Linear (Page 353)

Exponential

Polynomial



Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array
looking like this:

2 5 1 7 9 12 11 10


The pivot could be either the 7 or the 9. (page 506)

The pivot could be the 7, but it is not the 9. The pivot is not the 7, but it could be the 9 Neither the 7 nor the 9 is the
pivot.





n



16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28 16, 24, 18, 28, 30, 20, 22

16, 24, 20, 30, 28, 18, 22 Its not satisfy the min heap property.

While joining nodes in the building of Huffman encoding tree if there are more nodes with same frequency, we choose the
nodes _______.

Randomly (Page 289)

That occur first in the text message That are lexically smaller among others. That are lexically greater among others


Consider the following paragraph with blanks.

A ... is a linear list where and take place at the same end . This end is called the ..

would be the correct filling the above blank positions?
(i) queue (ii) insertion (iii) removals (iv) top (i) stack (ii) insertion (iii) removals (iv) bottom (i) stack (ii)
insertion (iii) removals (iv) top (Page 52)
(i) tree (ii) insertion (iii) removals (iv) top


31

32 (n-1 links to internal nodes) (Page 304)

33 66


Which traversal gives a decreasing order of elements in a heap where the max element is stored at the top?
post-order

level-order inorder



What requirement is placed on an array, so that binary search may be used to locate an entry


The array must be sorted Click here for detail



Linked List

Stack

Queue

Tree (Page 112)

Fall 2009


The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should


Increase the hard disk space (Page 5)





The first element Click here for detail

The middle element The last element




ab+c*d

abc*+d(According to rule)

abc+*d

(abc*)+d


In sequential access data structure, accessing any element in the data structure takes different amount of time. Tell which one
of the following is sequential access data structure,

Arrays

Lists Click here for detail

Both of these

None of these


I have implemented the queue with a circular array. If data is a circular array of CAPACITY elements, and last is an index into
that array, what is the formula for the index after last?

(last % 1) + CAPACITY

last % (1 + CAPACITY)

(last + 1) % CAPACITY

last + (1 % CAPACITY)

This expression will point to field after last that will be the first field.


Which one of the following is TRUE about recursion?

Recursion extensively uses stack memory. (page 149)

Threaded Binary Trees use the concept of recursion. Recursive function calls consume a lot of memory. Iteration is
more efficient than iteration.



Binary Tree

Binary Search Tree


AVL Tree


Which one of the following is TRUE about iteration?

Iteration extensively uses stack memory. Threaded Binary Trees use the concept of iteration. Iterative function calls
consumes a lot of memory.

Recursion is more efficient than iteration. Click here for detail


If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the
entry with the greatest value? Data[0] is correct

data[1]

data[n-1] data[n]

data[2*n+1]



54

55 56
57 Question No: 11 (n+1)

Which of the following heap method increase the value of key at position p by the amount delta?

increaseKey(p,delta) (Page 363)

decreaseKey(p,delta)

preculateDown(p,delta) remove(p,delta)



Reflexive (page 387)

Symmetric




Electrical connectivity Set of people

<= relation (Page 388)

Set of pixels
Question No: 14

Log10 N levels Log2 N levels N / 2 levels ( Marks: 1 ) - Please choose one A binary tree of N nodes has _______.

(Page 212)

N x 2 levels



Sorted (Page 432)

Unsorted


23 15 5 12 40 10 7
15 5 12 23 10 7 40


Heap sort

Bubble sort Question No: 17 (According to rule) ( Marks: 1 ) - Please choose one


A binary tree with N internal nodes has N+1 external nodes. (page 304)




A binary tree of N internal nodes has N+ 1 external node. (Page 304)


- Please choose one

The left pointer of dummy node points to the itself while the right pointer points to the root of tree.

The left pointer of dummy node points to the root node of the tree while the right pointer points
(Page 321)





Expression tree


complete Binary tree (Page 323)

Perfectly complete Binary tree


In a selection sort of n elements, how many times the swap function is called to complete the execution of the algorithm?

n-1 Click here for detail

n log n n2

1



performed by returning the root of the tree containing x. Click here for
detail

A find(x) on element x is performed by returning the whole tree itself containing x. A find(x) on element x is performed
by returning TRUE.








Consider the following postfix expression S and the initial values of the variables.

S = A B - C + D E F - + ^

Assume that A=3, B=2, C=1, D=1, E=2, F=3

What would be the final output of the stack?


2

0 -1



2H +1

2H -1 2H +2




inorder successor or predecessor (Page 307)

postorder successor or predecessor NULL pointers are not replaced


In a min heap , preculateDown procedure will move smaller value______ and bigger value______.
left,right

right,left

up,down (Page 358)

down,up
Question No: 28 Which of the following statement is correct about union:

root of the other.

( Marks: 1 )
(Greedy algorithms , Page 7) - Please choose one To perform Union of two sets, we merge the two trees
by making the root of one tree point to the

To perform Union of two sets, we merge the two trees by making the leaf node of one tree point to the root of the
other.

To perform Union of two sets, merging operation of trees in not required at all. None of the given options.







Let heap stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root of the heap contains the maximum
element. What is the result of deleting 40 from this heap

[50,32, 37,13, 28, 22, 36] according to max heap property.

[37, 28, 32, 22, 36, 13]

[37, 36, 32, 28, 13, 22] [37, 32, 36, 13, 28, 22]

Fall 2009



True

False




In linked list the elements may locate at far positions in the memory (page 18)

In linked list each element also has the address of the element next to it In an array the elements are contiguous
Question No: 3

True

False(page 39)

Question No: 4 ( Marks: 1 ) - Please choose one Doubly Linked List always has one NULL pointer.

( Marks: 1 )

- Please choose one

A queue is a data structure where elements are,

inserted at the front and removed from the back. .(see example at page #89 nd 90)

inserted and removed from the top.

inserted at the back and removed from the front. inserted and removed from both ends.



1 pointer

2 pointers(page 39)

3 pointers

4 pointers


I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers
will change during an insertion into an EMPTY queue?

Neither changes

Only front pointer changes. Only rear pointer changes.

Both change.

Since it is an empty queue the front and rear are initialize to -1, so on insertion both the pointers will change and point
to 0.



Binary Tree

Binary Search Tree

Parse Tree(page 274)

AVL Tree


If a complete binary tree has n number of nodes then its height will be,

Log2 (n+1) -1(page 139)

2n

Log2 (n) - 1 2n - 1



Log (h)

2h+1- 1(page 324) Log (h) - 1

2h - 1


A binary relation R over S is called an equivalence relation if it has following property(s)

Reflexivity

Symmetry Transitivity




Sorted (page 432)

Unsorted



_______ .

N

N2

Nlog2N
log2N Question No: 13 (page 440)

Use of binary tree in compression of data is known as _______ .

Traversal

Heap

Union
Huffman encoding Question No: 14 (page 287) ( Marks: 1 ) - Please choose one

While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.
Equal to the small frequency

Equal to the greater

Equal to the sum of the two frequencies (page 293)

Equal to the difference of the two frequencies



A binary tree with N internal nodes has N+ 1 external node. (page 303)




A binary tree of N internal nodes has N+ 1 external node. (page 303)






A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD
(in actual sense, a link) to its INORDER successor. (Page 307)

actual sense, a link) to its POSTORDER successor.





A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD
(in actual sense, a link) to its INORDER predecessor.

actual sense, a link) to its POSTORDER predecessor.


A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a
link) to its __________ successor.

levelorder

Preorder

Inorder Click here for detail

Postorder




This dummy node has either no value or some dummy value. .(page 321)

This dummy node has always some integer value.


A complete binary tree is a tree that is _________ filled, with the possible exception of the bottom level.
partially

completely (page 323)

incompletely

partly


A complete binary tree of height 3 has between ________ nodes.
8 to 14

8 to 15 (page 124)

8 to 16 8 to 17



Linear (page 353)

Exponential Polynomial




21

41


43



16, 18, 20, 22, 24, 28, 30

16, 20, 18, 24, 22, 30, 28 16, 24, 18, 28, 30, 20, 22
Question No: 26 16, 24, 20, 30, 28, 18, 22 ( Marks: 1 ) - Please choose one Its not satisfy the min heap property








x - y * a + b / c


x y -a * b +c /

x *y a - b c / +

x y a * - b c / + Hint :- (x - y * a) +( b / c)

x y a * - b/ + c


2

3

4 (page 124)

5

Question
No: 29
( Marks:
1 )
- Please
choose one

Here is an array of
ten integers:

5 3 8 9 1 7 0 2 6 4
0 3 8 9 1 7 5 2 6 4 (Page 477)
2 6 4 0 3 8 9 1 7 5
2 6 4 9 1 7 0 3 8 5
0 3 8 2 6 4 9 1 7 5
Question
No: 30
( Marks:
1 )
- Please
choose one




The array must be sorted. Click here for detail


MIDTERM EXAMINATION
Spring 2010
www.vuzs.net
http://groups.google.com/group/vuzs



In linked list the elements may locate at far positions in the memory
In linked list each element also has the next to it
In an array the elements are contiguous


Each operator in a postfix expression refers to the previous ________ operand(s).

One
Two
Three
Four
p67

Which one of the following calling methods does not change the original value of the argument in
the calling function?
Call by passing the value of the argument
Call by passing reference of the argument
Call by passing the address of the argument

A tree is an AVL tree if

Any one node fulfills the AVL condition

At least half of the nodes fulfill the AVL condition
All the nodes fulfill the AVL condition


www.vuzs.net


Suppose currentNode refers to a node in a linked list (using the Node class with member
variables called data and nextNode). What statement changes currentNode so that it refers to the next
node?

currentNode ++;
currentNode = nextNode;
currentNode += nextNode;

A queue where the de-queue operation depends not on FIFO, is called a priority queue
False
True
p101

Which one is a self- referential data type?
Stack
Queue

Link list

All of these



1 pointer

2 pointers

3 pointers

4 pointers

p39


I have implemented the queue with a linked list, keeping track of a front pointer and a rear
pointer. Which of these pointers will change during an insertion into an EMPTY queue?

Neither changes

Only front pointer changes.

Only rear pointer changes.

Both change.

Consider the following tree.

How many of the nodes have at least one sibling?
8
7
5
6


The nodes with no successor are called _________
Root Nodes
Leaf Nodes
Both of these
None of these
www.vuzs.net


AVL Tree is,
Non Linear data structure
Linear data structure

Hybrid data structure (Mixture of Linear and Non Linear)



We access elements in AVL Tree in,

Linear way only

Non Linear way only

Both linear and non linear ways



A binary search tree should have minimum of one ________ node/s at each level,

One ( not sure )

Two

Three

Four


Consider the following statements.
(i) A binary tree can contain at least 2
L
Nodes at level L.
(ii) A complete binary tree of depth d is a binary tree that contains 2
L
Nodes at each level L
between 0 and d, both inclusive.
(iii) The total number of nodes (T
n
) in a complete binary tree of depth d is 2
d+1
- 1 .
(iv) The height of the complete binary tree can be written as h = log
2
(T
n
+1)-1 where T
n
is
Total number of Nodes.

Which one of the following is correct in respect of the above statements regarding the Binary trees?

(i) and (iii) only
(i), (ii) and (iii) only
(ii) and (iii) only
(ii), (iii) and (iv) only


Unary

Binary
Ternary

None of the above

Question No: 17 ( Marks: 2 )

What would the state of a stack be after the following operations?

create stack
push A onto stack
push F onto stack
push X onto stack
pop item from stack
push B onto stack
pop item from stack
pop item from stack

A Remening On The Stack


What are the applications of Binary Tree.


What is difference between call by reference and call by value?

One application is to find duplicates in a list of numbers. Let
a given list be" 12 34 56 89 33 11 89
the first number in the list is placed in a node that is established as the root of a binary tree. Each
number is compared with the node in the root, if the number is larger, we search the right subtree
else we search the left sub-tree. If the sub-tree is empty, the number is not a duplicate and this will
be added as a new node.
2. Binary trees can be used for sorting a given list such that, if we take the first number as root, the
numbers less than that number will be transfered to left sub-tree and the greater numbers to right
sub-tree.
3. Binary trees are also used for developing the huffman codes.


What is the functionality of the following method of BST class
TreeNode<int>* function(TreeNode<int>* tree)
{
if( tree == NULL )
return NULL;
if( tree->getLeft() == NULL )
return tree; // this is it.
return function( tree->getLeft() );
}


a) Write a C++ statement that declares a valid reference of int i;
b) What is the benefit of reference and where can we use it?

In the last lecture we were discussing about reference variables, we saw three examples; call by
value, call by reference and call by pointer. We saw the use of stack when a function is called by
value, by reference or by pointer. The arguments passed to the function and local variables are
pushed on to the stack. There is one important point to note that in this course, we are using C/C++
but the usage of stack is similar in most of the computer languages like FORTRAN and Java . The

syntax we are using here is C++ specific, like we are sending a parameter by pointer using & sign. In Java,
the native data types like int, float are passed by value and the objects are passed by reference. In
FORTRAN, every parameter is passed by reference. In PASCAL, you can pass a parameter by value or
by reference like C++. You might have heard of ALGOL, this language had provided another way
of passing parameter ca
lled call by name. These kinds of topics are covered in subjects like


Determine what the following recursive mystery function computes when given a pointer to
the root node of a binary tree.
struct bt_s { int key; struct bt_s *left, *right; } bt_t; int
MFunc (bt_t *T) {
int N1, N2;
if (T == NULL) return -1;
N1 = MFunc(T->left);
N2 = MFunc(T->right);
return (N1 > N2 ? N1 : N2) + 1;
}


Is the given tree is an AVL tree? If Not then redraw is so that it becomes AVL

MIDTERM EXAMINATION
Spring 2010
Time: 60 min
Marks: 38
A
queue where the de-queue operation depends not on FIFO, is called a priority queue
False

True

The
data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we
should


Increase the hard disk space


Consider the function X as under
int X (int& Value)
{
return Value;
}
Now a and b are integers in a calling function. Which one of the following is a valid call to the
above function X.
a = X (b) ;
a = X (&b) ;
a = X (*b) ;

In the call by value methodology, a copy of the object is passed to the called function.
False
True

The tree data structure is a

Non-linear data structure
Graphical data structure
Data structure like queue

When should you use a const reference parameter?
Whenever the parameter has huge size.

Whenever the parameter has huge size, the function changes the parameter within its
body, and you do NOT want these changes to alter the actual argument.

body, and you DO want these changes to alter the actual argument.
Whenever the parameter has huge size, and the function does not change the parameter
within its body.


Here is the start of a C++ class declaration:
class foo
{
public:
void x(foo f);
void y(const foo f);
void z(foo f) const;

Which of the three member functions can alter the PRIVATE member variables of the foo object
that activates the function?

Only x can alter the private member variables of the object that activates the function.
Only y can alter the private member variables of the object that activates the function.

Only z can alter the private member variables of the object that activates the function.
Two of the functions can alter the private member variables of the object that activates the
function.

What is the maximum depth of recursive calls a function may make?

1
2
n (where n is the argument)
There is no fixed maximum

Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for
a search operation are,

Log
2
(n+1) -1

Log
2
(n+1)

Log
2
(n) - 1

Log
2
(n)

In the linked list implementation of the stack class, where does the push member function places the
new entry on the linked list?

At the head

At the tail
After all other entries that are greater than the new entry.
After all other entries that are smaller than the new entry.


Suppose we have a circular array implementation of the queue class, with ten items in the queue
stored at data[2] through data[11]. The CAPACITY is 42, i.e., the array has been declared to be of
size 42. Where does the push member function place the new entry in the array?

data[1]
data[2]
data[11]
data[12]

The expression AB+C* is called ?

Prefix expression
Postfix expression

Infix expression
None of these


_________ is a binary tree where every node has a value, every node's left subtree contains only
values less than or equal to the node's value, and every node's right subtree contains only values that
are greater then or equal ?
Strictly Binary Tree
Binary Search tree

AVL tree

All of these


Consider the following binary search tree (BST):

If node A in the BST is deleted, which two nodes are the candidates to take its place?

J and I

H and E

D and E

L and M


Lets call the node as a that requires re-balancing. Consider the two cases given below:
1) An insertion into left subtree of the left child of a
2) An insertion into right subtree of the right child of a.
Which of the following statement is correct about these two cases.

1) The insertion occurs outside (i.e., left-left or right-right) in cases 1 and 2. single rotation can fix
the balance in these two cases.
2) The insertion occurs inside ((i.e., left-left or right-right) in cases 1 and 2. single rotation
cannot fix the balance in these two cases



Linear way only

Non Linear way only



AVL Tree is,






How we can delete a node with two Childs in a binary search tree using its right sub tree.

What is Function Call Stack Give short answer.


xplain the two cases in which we apply double rotation in an AVL tree.


Here is a small binary tree.

Write the order of the nodes visited in
a) A Post-order traversal
b) A level-order traversal

Please consider the following AVL tree.
1. Insert new node 87 in this tree and make tree balance.
2. Write balance factor of each node after and before inserting node 87.


Consider the following binary tree

Show the state of the tree after deleting 24.

MIDTERM EXAMINATION
Fall 2009
CS301- Data Structures (Session - 5)
Time: 60 min
Marks: 38


ab+c*d-
abc*+d-
abc+*d-
(abc*)+d-

The
tree data structure is a



A Compound Data Structure is the data structure which can have multiple data items of
same type or of different types. Which of the following can be considered compound data
structure?

Arrays

LinkLists
Binary Search Trees

All of the given options


Suppose a pointer has been declared in main but has not assigned any variable address then
That pointer points to First byte in main function
That pointer contains a NULL value
None of these

That pointer points to any memory address

class foo
{
public:
void x(foo f);


function.

The
operation for removing an entry from a stack is traditionally called:
delete
peek
pop
remove

Which statement of the following statements is incorrect?
Lists can be implemented by using arrays or linked lists

A list is a sequence of one or more data items
Stack is a special kind of list in which all insertions and deletions take place at one end
Stacks are easier to implement than lists

Parameters in function call are passed using,
Stack
Queue

Binary Search Tree
AVL Tree

Consider the following sequence of push operations in a stack:
stack.push(7);
stack.push(8);
stack.push(9);
stack.push(10);
stack.push(11);
stack.push(12);
7 8 9 10 11 12
9 8 11 10 7 12
9 10 8 11 12 7
9 10 8 12 7 11


1
2

void test_a(int n)
{
cout << n << " ";
if (n>0)
test_a(n-2);
}

4 2
0 2 4
0 2
2 4
www.vuzs.net


Queue follows,
Last in First out
First in Last out
First in First out
None of these


Binary Search tree
AVL tree

All of these

Four
statements about trees are below. Three of them are correct. Which one is INCORRECT?
Trees are recursively defined multi-dimensional data structures
The order of a tree indicates a maximum number of childen allowed at each node of the tree
A search tree is a special type of tree where all values (i.e. keys) are ordered

If Tree1's size is greater than Tree2's size, then the height of Tree1 must also be greater than
Tree2's height.

Below is a binary search tree. If we delete the value 50 using the algorithm we discussed, what
value will be in the root of the remaining tree?

50
60
70
80
www.vuzs.net

_________ is a data structure that can grow easily dynamically at run time without having to
copy existing elements.
Array

List
Both of these
None of these

Give the names of basic Queue Operations
Ans:
Definition: A collection of items in which only the earliest added item may be accessed. Basic
operations are add (to the tail) or enqueue and delete (from the head) or dequeue. Delete returns the
item removed. Also known as "first-in, first-out" or FIFO.

Give one benefit of using Stack.
In computer science, a stack is a last in, first out (LIFO) abstract data type and data structure. A
stack can have any abstract data type as an element, but is characterized by only two
fundamental operations: push and pop. the data structure itself enforces the proper order of
calls.
www.vuzs.net





stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
stack.push(5);
stack.push(6);

You can insert as many stack.pop()s as you like in the above sequence of stack.pushs to get a
desired output. Which of the following cannot be an output?
A. 123456
B. 325416
C. 342561
D. 342615
E. 342165


Give short answers of the following questions:
1. Why List wastes less memory as compared to Arrays.

Ans:
1. Linked lists do not need contiguous blocks of memory; extremely large data sets stored in an
array might not be able to fit in memory.
2. Linked list storage does not need to be preallocated (again, due to arrays needing contiguous

memory blocks).
3. Inserting or removing an element into a linked list requires one data update, inserting or
removing an element into an array requires n (all elements after the modified index need to be
shifted).
Array is a collection of same data type. In linked list there are two field one is address and other is
pointer. In array elements are arranged in a specific order

2. Why we can change the size of list after its creation when we can not do that in simple
arrays.
Some how the answer will be same as part 1 because Inserting or removing an element into a
linked list requires one data update, inserting or removing an element into an array requires n (all
elements after the modified index need to be shifted).

Array is a collection of same data type. The size of array is mentioned with its declaration. in
arrays the elements are in contiguous position. one must after another. while in linked list we
gave the address of next element in the next part of node.

www.vuzs.net

Convert the following infix expression into postfix expressions using stack (Show complete
steps)
1-2 -3-3-(4+5*6)*7
Step Post fix stack
1

MIDTERM EXAMINATION

www.vuzs.net
Time: 60 min
Marks: 38

In linked list the elements may locate at far positions in the memory In
linked list each element also has the address of the element next to it In an
array the elements are contiguous

In a program a reference variable, say x, can be declared as
int &x ;
int *x ;
int x ;
Linked lists are collections of data items "lined up in a row" , insertions and deletions can be
made only at the front and the back of a linked list.
True
False
A Linear Data Structure is the data structure in which data elements are arranged in a
sequence or a linear list. Which of the following is Non Linear Data Structure?
Arrays
LinkLists
Binary Search Trees
None of these

Which one of the following statements is correct?

AVL
is created
Which one of the following is correct about pointers?
They

Which of the following abstract data types are NOT used by Integer Abstract Data type group?

The operation for adding an entry to a stack is traditionally called :

The operation for removing an entry from a stack is traditionally called:

www.vuzs.net

We can add elements in QUEUE From _________

or two
children per node
in

Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a
search operation are,
2
(n+1) -1
2
(n+1)
2
(n) - 1
2
(n)
The following is a segment of a C program.
int pqr(BinaryNode t)
{ if (t == null )
return -1;
else
return 1+max(pqr(t.left),pqr(t.right)) }
Identify, what the above program intend(s) to do?
-order traversal
-order traversal
-order traversal
-order traversal
3 + 5 * 6 - 7 * (8 + 5)
3 6 5 + * 7 5 8 + - *
3 6 5 7 5 8 + * + - *
3 5 6 + * 7 8 5 + - *
3 5 6 * + 7 8 5 + * -
www.vuzs.net

An array is a group of consecutive related memory locations.
True
False
Is this a correct statement? Give answer in Yes or No.
A node cannot be deleted, when the node to be deleted has both left and right subtrees.
No, it can be deleted.
Deleting a leaf node in binary search tree involves setting ______ pointer/s of that nodes parent as
null.
1
2
3
4
Describe any two uses of priority queues?
How we evaluate postfix expressions?
Following is the while loop used in level-order traversal:
while( !q.empty() )
{

treeNode = q.dequeue();
cout << *(treeNode->getInfo()) << " ";
if(treeNode->getLeft() != NULL )
q.enqueue( treeNode->getLeft());
if(treeNode->getRight() != NULL )
?
}
What should be the statement to replace the question mark in the loop above:
www.vuzs.net

Write a friend function for a Linked List class called mergeLists that takes two non-empty lists,
merge these two lists and return the merged list.
Use the following function prototype:
List mergeLists(List x,List y)
MIDTERM EXAMINATION
Spring
www.vuzs.net

A subscript of an array may be an integer or an integer expression.
True
False
Doubly Linked List always has one NULL pointer.

True
False
In which of the traversal method, the recursive calls can be used to traverse a binary tree ?
In preorder traversal only
In inorder traversal only
In postorder traversal only

variables called data and nextNode). What boolean expression will be true when cursor refers to the
tail node of the list?
(currentNode == null)
(currentNode->nextNode == null)
(nextNode.data == null)
(currentNode.data == 0.0)
Suppose that the class declaration of SomeClass includes the following function prototype.
bool LessThan( SomeClass anotherObject );
Which of the following tests in the client code correctly compares two class objects alpha
and beta?

if (alpha < beta)
if (alpha.LessThan(beta))
if (LessThan(alpha, beta))
if (LessThan(alpha).beta)
In C what is the operation that you can not do with primitive types?
Assign a value to primitive type using a literal
Declare primitive types to be constant using the Const keyword
Create a new instance of primitive type with New keyword
None of these
add
append
insert
push
delete
peek
pop
remove
stack.push(7);
stack.push(8);
stack.push(9);
stack.push(10);
stack.push(11);
stack.push(12);

7 8 9 10 11 12
9 8 11 10 7 12
9 10 8 11 12 7
9 10 8 12 7 11

www.vuzs.net

________ is the maximum number of nodes that you can have on a stack-linked list ?
Zero
2n (where n is the number of nodes in linked list)
Any Number
None of these
Which of the following can be used to reverse a string value,

Stack
Queue
Both of these
None of these
Consider the following tree,

How many leaves does it have?
2
4
6
9
AVL Tree is,

Question No: 15 ( Marks: 1 ) - Please choose vuzs one
(i) The last item to be added to a queue is the first item to be removed (ii)
A queue is a structure in which both ends are not used
(iii) The last element hasnt to wait until all elements preceding it on the queue are removed
(iv)A queue is said to be a last-in-first-out list or LIFO data structure.

(iii) and (ii) only
(i), (ii) and (iv) only
(ii) and (iv) only

True
False

In which of traversal method, recursion can not be applied.?

What is meant by an empty stack?


Is the following statement correct? If your answer is No, then correct it.
A tree is an AVL tree if at least half of the nodes fulfill the AVL condition

The following function is performing some operation on the elements of a singly link list please tell
what this functions is doing,
void LinkList::mystery(){
Node * temp = headNode;
int result = 0;
while( temp->getNext() != NULL ){
temp = temp->getNext();
int value = temp->get();
if(value % 2 == 0)
{ value ++;
temp->set(value);
}
}
}

See the code below , give comments against each line and identify which line will result in error?
1. void main(void)
2. {
3. int actual = 123;
4. int &other = actual;
5.
6. int natural = 456;
7. other = &natural;
8. }

Draw AVL Tree by following digits 78, 21, 25, 28, 38, 36, 75 and also perform necessary
rotation, while showing all the intermediate trees being created in the process. In each
stage, the AVL transformation should be conducted at a discrepancy that is farthest from
the root.

MIDTERM EXAMINATION
Spring 2010
www.vuzs.net
Time: 60 min
Marks: 38



True

False



The first element
The middle element
The last element





Which one of the following statements is NOT correct?

Array size can be changed after its creation.
Link List size can be changed after its creation

Binary Search Tree size can be changed after its creation
AVL Tree size can be changed after its creation
and beta?

if (alpha < beta)


A queue is a ________data structure, whereas a stack is a ________data structure.
FIFO, LIFO
LIFO,FIFO
none of these
both of these

Which one of the following operators has higher priority than all of others ?
Multiplication operator
Minus operator
Plus operator

Exponentiation operator

Each node in Binary Search Tree has
1 pointer

2 pointers

3 pointers
4 pointers

www.vuzs.net


Four statements about trees are below. Three of them are correct. Which one is INCORRECT?


The order of a tree indicates a maximum number of childen allowed at each node of the
tree

Tree2's height.


Which of the following is "TRUE" about arrays,

We can increase the size of arrays after their creation.

We can decrease the size of arrays after their creation.

We can increase but can't decrease the size of arrays after their creation.

We can neither increase nor decrease the array size after their creation.


Searching an element in an AVL tree take maximum _______ time (where n is no. of nodes in
AVL tree),

Log
2
(n+1)
Log
2
(n+1) -1
1.44 Log
2
n

1.66 Log
2
n

www.vuzs.net


1
3
2

4


(v) A binary tree can contain at least 2
L
Nodes at level L.
(vi) A complete binary tree of depth d is a binary tree that contains 2
L
(vii) The total number of nodes (T
n
d+1
- 1 .
(viii) The height of the complete binary tree can be written as h = log
2
(T
n
+1)-1 where T
n
is


(i) and (iii) only
(ii) and (iii) only


Consider the following infix expression.
5 + 6/2
If one converts the above expression into postfix, what would be the resultant expression?
56/ + 2
5 6 2 / +
5 6 / 2 +
/62 + 5


Linked List
Stack
Queue
Tree


Unary
Binary
Ternary

None of the above

Which process places data at the back of the queue?




Why we use Reference Variables. Give one example.


The nodes of a binary tree have data 1, 2, 3, 4. The in-order traversal of the tree yields
2,1,4,3. The postorder traversal is 2, 4, 3, 1. The root of the tree is at level 0.
Q3: Which value is in the right child of the root? (1 Pt)
(A) 1 (B) 2 (C) 3 (D) 4 (E) none


What normally is the sequence of operations while constructing an AVL tree?


Here is a small binary tree:

14
/ \
2 11
/ \ / \
1 3 10 30
/ /
7 40
Write the order of the nodes visited in:
A. An in-order traversal:

B. A pre-order traversal:

www.vuzs.net



LATEST SOLVED SUBJECTIVES
FROM MIDTERM PAPERS
MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com
MC110200030 awais4you@gmail.com

DEC 09,2011

PSMD01
PLHR25

1

Cs301- current midterm paper-1(NOV 2011)
Q:1 What is complete binary tree?
Answer:
"A complete binary tree is a binary tree with the additional property that every node must have exactly two
children if an internal node, and zero children if a leaf node."
Q:2 How single left rotation is performed in AVL tree?
Answer:
This rotation is almost similar to the single right rotation. We start from tree node k1. k1 is the root whilet ree node
k2 is its right child. Due to the left rotation, the right child k2 of the root k1 will become the root. The k1 will go
down to the left child of k2.
Q:3 describe the following
(i) Height of tree
(ii) Balance of Node

(i) Height of tree
Answer: (Page 209)
The height of a binary tree is the maximum level of its leaves (also called the depth).
Answer: (page 215)
The balance of a node in a binary search tree is defined as the height of its left subtree minus height of its right
subtree. In other words, at a particular node, the difference in heights of its left and right subtree gives the
balance of the node.


Q1 what is binary tree brief it?
Answer:-
A binary tree is a finite set of elements that is either empty or is partitioned into three disjoint subsets. The first
subset contains a single element called the root of the tree. The other two subsets are themselves binary trees called
the left and right sub-trees.
Q2.what is different between binary tree and AVL tree
Answer:- (Page 212)
An AVL tree is identical to a BST, barring the following possible differences:
Height of the left and right subtrees may differ by at most 1.
Height of an empty tree is defined to be (-1).

Why queue is linear data structure.
Answer:-(Page 87)
A queue is a linear data structure into which items can only be inserted at one end and removed from the other.
2

In contrast to the stack, which is a LIFO (Last In First Out) structure, a queue is a FIFO (First In First Out)
structure.
Answer:- Page 263
The node to be deleted has either left child (subtree) or right child (subtree).In this case we bypass the node in such a
way that we find the inorder successor of this node and then link the parent of the node to be deleted to this
successor node. Thus the node was deleted.

define const keyword, reference variable, Dangling reference
Answer: (Page 198)
Const keyword
The const keyword is used for something to be constant. The actual meanings depend on where it occurs but it
generally means something is to held constant. There can be constant functions, constant variables or parameters
etc.
Reference variable
The references are pointers internally, actually they are constant pointers. You cannot perform any kind of
arithmetic manipulation with references that you normally do with pointers.
Dangling reference
The pointer of the object (when object has already been deallocated or released) is called dangling pointer.
Q: 1 what is complete binary tree?
Answer: (Page 123)
The definition of the complete binary tree is
A complete binary tree of depth d is the strictly binary tree all of whose leaves are level d.
Q: 2 how single left rotation is performed in AVL tree?
Answer: rep
(i) Height of tree
Answer: rep
Q1 what is binary tree breif it?
Answer:- rep

Answer: rep

Answer: rep

3

MIDTERM EXAMINATION 2011 (MAY)
1. What is function of length () method in the Queue
Answer: (page 111)
In Queue length() method, has a single statement i.e.
return size ;
This method returns the size of the queue, reflecting the number of elements in the queue. It is not the size of the
array used internally to store the elements of the queue.

2. Explain the two cases in which we apply double rotation in An Avl tree
Answer: (Page 229)
Sometimes a single rotation is not sufficient to balance an unbalanced tree.
The two cases are following:
1. Insertion into the right subtree of the left child of X node (RL)
2. Insertion into the left subtree of the right child of X node (LR)

3. How can we perform level-order traversal on a tree?
Answer:- (For More detail and code see Page 161 )
We can print a binary tree level by level by employing recursive or non-recursive method.
The idea of a level-order traversal is to visit the root, then visit all nodes "1 level away" (depth 2) from the root
(left to right), then all nodes "2 levels away" (depth 3) from the root, etc. For the example tree, the goal is to visit the
nodes in the following order:

A level-order traversal requires using a queue (rather than a recursive algorithm, which implicitly uses a stack). A
queue is a FIFO structure, which can make the level-order traversal easier.

4. How can the dangling reference problem be avoided?
Answer:- ( Page 200 )
To avoid dangling reference, dont return the reference of a local variable (transient) from a function.


Answer: rep

Answer: rep
What is binary tree breif it?
Answer:- rep
4

Answer:- rep

Q: Define const keyword, reference variable , Dangling reference
Answer: rep
Q:3 Describe the following
(i) Height of tree
Answer: rep

Q.21A: - Similarity between AVL and Binary Search Tree?
Answer:- rep

Q.21B: - How AVL is different from Binary Search Tree?
Answer:- (http://answers.yahoo.com/question/index?qid=20071213000314AAU8p08)
A binary tree is a tree data structure in which each node has at most two children. Typically the child nodes are
called left and right. One common use of binary trees is binary search trees; another is binary heaps.
While an AVL tree is a self-balancing binary search tree.
In an AVL tree the heights of the two child sub-trees of any node differ by at most one, therefore it is also called
height-balanced. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases.
Additions and deletions may require the tree to be rebalanced by one or more tree rotations.

Q.22: - What the maximum no of comparisons we have to perform during insertion in BST?
If we have a complete binary tree with n numbers of nodes, the depth d of the tree can be found by the following
equation:
d=log
2
(n + 1) - 1
If the tree is complete binary or near-to-complete, we need log
2
(n) number of comparison. Whereas in a
linked list, the comparisons required could be a maximum of n.

MIDTERM EXAMINATION 2010

What is Function Call Stack Give short answer?
Answer:-
Stacks play a key role in implementation of function calls in programming languages.
In C++, for example, the call stack is used to pass function arguments and receive return values.
The call stack is also used for local variables

5


a) A Post-order traversal :(L, R, N)
Answer:-
Post-order traversal:: CDBHFIGEA
level-order traversal:: ABEDGCFIH


What are the applications of Binary Tree?
Answer:-
The binary tree is a useful data structure for rapidly storing sorted data and rapidly retrieving stored data. It
can hold objects that are sorted by their keys.
It can represent a structured object, An operating system maintains a disk's file system as a tree, where file
folders act as tree nodes:
Answer:- (page 88)
Queue Operations
The queue data structure supports the following operations:
Operation Description
enqueue(X) Place X at the rear of the queue.
dequeue() Remove the front element and return it.
front() Return front element without removing it.
isEmpty() Return TRUE if queue is empty, FALSE otherwise

6

Answer:- (Page 53)
In computer science, a stack is a last in, first out (LIFO) abstract data type and data structure. A stack can have any
abstract data type as an element, but is characterized by only two fundamental operations: push and pop.the data
structure itself enforces the proper order of calls.

Answer:-
1. Linked lists do not need contiguous blocks of memory; extremely large data sets stored in an array might not be
able to fit in memory.
2. Linked list storage does not need to be preallocated (again, due to arrays needing contiguous memory
blocks).
3. Inserting or removing an element into a linked list requires one data update, inserting or removing an
element into an array requires n (all elements after the modified index need to be shifted).
Array is a collection of same data type. In linked list there are two field one is address and other is pointer. In
array elements are arranged in a specific order

2. Why we can change the size of list after its creation when we can not do that in simple arrays?
Answer:-
Some how the answer will be same as part 1 because Inserting or removing an element into a linked list
requires one data update, inserting or removing an element into an array requires n (all elements after the
modified index need to be shifted).
Array is a collection of same data type. The size of array is mentioned with its declaration. in arrays the
elements are in contiguous position. One must after another. While in linked list we gave the address of next
element in the next part of node.


Answer:- (page 101)
Priority queue being used at many places especially in the operating systems. In operating systems, we have queue of
different processes. If some process comes with higher priority, it will be processed first. Here we have seen a
variation of queue. We will use the priority queue in the simulation. The events will be inserted in the queue and the event
going to occur first in future, will be popped.

7

Question No: 21
Describe the Use of Queues?
Answer:- (Page 96)
Use of Queues:
Out of the numerous uses of the queues, one of the most useful is simulation. A simulation program attempts to
model a real-world phenomenon. Many popular video games are simulations, e.g., SimCity, Flight Simulator etc.
Each object and action in the simulation has a counterpart in the real world. Computer simulation is very powerful
tool and it is used in different high tech industries, especially in engineering projects. For example, it is used in aero
plane manufacturing. Actually Computer Simulation is full-fledged subject of Computer Science and contains
very complex Mathematics, sometimes. For example, simulation of computer networks, traffic networks etc.

Answer: (Page 67)
Evaluating Postfix Expression:
o Each operator in a postfix expression refers to the previous two operands. o
Each time we read an operand, we push it on a stack.
o When we reach an operator, we pop the two operands from the top of the stack, apply the operator and
push the result back on the stack.


Answer: (Page 54)
Empty stack means that there is no element on the stack. IsEmpty() boolean function returns true if stack is
empty, false otherwise.
Answer: (page 214)
Statement is wrong, Correct statement is:
A tree is an AVL tree if all the nodes fulfill the AVL condition.


Answer: (page 87)
enqueue(X) Place X at the rear/back of the queue.

8

Answer:- (Page 263)
The node to be deleted has either left child (sub-tree) or right child (sub-tree).In this case we bypass the node in
such a way that we find the in-order successor of this node and then link the parent of the node to be deleted to this
successor node. Thus the node was deleted.
Answer:- Click here for detail
C++ references allow you to create a second name for the a variable that you can use to read or modify the
original data stored in that variable.
#include
main()
{
int x;
int& foo = x;
// foo is now a reference to x so this sets x to 56
foo = 56;
std::cout << x <<std::endl;
}
17. Define Reference Variable, Dangling Reference & Const
Answer:-
In the C++ programming language, a reference is a simple reference datatype that is less powerful but safer
than the pointer type inherited from C. The name C++ reference may cause confusion, as in computer science
a reference is a general concept datatype, with pointers andC++ references being specific reference datatype
implementations Dangling Reference & Const
Dangling pointers and wild pointers in computer encoding are pointers that do not point to a valid object of
the suitable type. These are special cases of violations of memory safety
18. What is the use of Reference Variable, Give example? 3 Marks
Answer:-
A reference variable is used to refer a particular object Location which resides on a garbage collectable heap.
c++ supports one more type of variable called reference variable. In addition to pointer variable and value
variable of reference variable behaves similar to both vaule variable and pointer variable. Reference variable has
all access that variable has.

How we can avoid the problem of Dangling reference
Answer:-
To avoid dangling reference, dont return the reference of a local variable (Transient) from a function.

9


DEC 09,2011

FROM MIDTERM PAPERS

MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01
MC110200030 awais4you@gmail.com PLHR25



Answer:

"A complete binary tree is a binary tree with the additional property that every node must have exactly two children if an
internal node, and zero children if a leaf node."


Answer:

This rotation is almost similar to the single right rotation. We start from tree node k1. k1 is the root whilet ree node k2 is its
right child. Due to the left rotation, the right child k2 of the root k1 will become the root. The k1 will go down to the left child
of k2.

(i) Height of tree


(i) Height of tree

Answer: (Page 209)



Answer: (page 215)

The balance of a node in a binary search tree is defined as the height of its left subtree minus height of its right subtree. In
other words, at a particular node, the difference in heights of its left and right subtree gives the balance of the node.



Answer:

A binary tree is a finite set of elements that is either empty or is partitioned into three disjoint subsets. The first subset
contains a single element called the root of the tree. The other two subsets are themselves binary trees called the left and right
sub-trees.


Answer:- (Page 212)

Height of the left and right subtrees may differ by at most 1. Height of an empty tree is defined to be (-1).


Answer:-(Page 87)


In contrast to the stack, which is a LIFO (Last In First Out) structure, a queue is a FIFO (First In First Out) structure.


Answer:- Page 263

The node to be deleted has either left child (subtree) or right child (subtree).In this case we bypass the node in such a way that
we find the inorder successor of this node and then link the parent of the node to be deleted to this successor node. Thus the
node was deleted.


Answer: (Page 198)

Const keyword

The const keyword is used for something to be constant. The actual meanings depend on where it occurs but it generally means
something is to held constant. There can be constant functions, constant variables or parameters etc.

Reference variable

The references are pointers internally, actually they are constant pointers. You cannot perform any kind of arithmetic
manipulation with references that you normally do with pointers.

Dangling reference




Answer: (Page 123)




Answer: rep

Q:3 describe the following (i) Height of tree


Answer: rep



Answer:- rep


Answer: rep


Answer: rep


1. What is function of length () method in the Queue Answer: (page 111)

return size ;

This method returns the size of the queue, reflecting the number of elements in the queue. It is not the size of the array
used internally to store the elements of the queue.


Answer: (Page 229)

Sometimes a single rotation is not sufficient to balance an unbalanced tree. The two cases are following:

1. Insertion into the right subtree of the left child of X node (RL) 2. Insertion into the left subtree of the right child of X node
(LR)



We can print a binary tree level by level by employing recursive or non-recursive method. The idea of a level-order traversal is
to visit the root, then visit all nodes "1 level away" (depth 2) from the root (left to right), then all nodes "2 levels away" (depth
3) from the root, etc. For the example tree, the goal is to visit the nodes in the following order:

A level-order traversal requires using a queue (rather than a recursive algorithm, which implicitly uses a stack). A queue is a
FIFO structure, which can make the level-order traversal easier.






Answer: rep


Answer: rep


Answer:- rep


Answer:- rep


Answer: rep

Q:3 Describe the following (i) Height of tree

Answer: rep


Answer:- rep



A binary tree is a tree data structure in which each node has at most two children. Typically the child nodes are called left and
right. One common use of binary trees is binary search trees; another is binary heaps.


In an AVL tree the heights of the two child sub-trees of any node differ by at most one, therefore it is also called height-
balanced. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases. Additions and deletions
may require the tree to be rebalanced by one or more tree rotations.



If we have a complete binary tree with n numbers of nodes, the depth d of the tree can be found by the following equation:

d=log2 (n + 1) - 1

If the tree is complete binary or near-to-complete, we need log2(n) number of comparison. Whereas in a linked list, the
comparisons required could be a maximum of n.




Answer:

Stacks play a key role in implementation of function calls in programming languages. In C++, for example, the call stack is
used to pass function arguments and receive return values. The call stack is also used for local variables




a) A Post-order traversal :(L, R, N) b) A level-order traversal

Answer:

Post-order traversal:: CDBHFIGEA level-order traversal:: ABEDGCFIH




Answer:

The binary tree is a useful data structure for rapidly storing sorted data and rapidly retrieving stored data. It can hold objects
that are sorted by their keys.

It can represent a structured object, An operating system maintains a disk's file system as a tree, where file folders act as tree
nodes:




Answer:- (page 88)

Queue Operations






Answer:- (Page 53)

In computer science, a stack is a last in, first out (LIFO) abstract data type and data structure. A stack can have any abstract
data type as an element, but is characterized by only two fundamental operations: push and pop.the data structure itself
enforces the proper order of calls.


Give short answers of the following questions: 1. Why List wastes less memory as compared to Arrays.

Answer:

1. Linked lists do not need contiguous blocks of memory; extremely large data sets stored in an array might not be able to fit
in memory.

2. Linked list storage does not need to be preallocated (again, due to arrays needing contiguous memory blocks).

3. Inserting or removing an element into a linked list requires one data update, inserting or removing an element into an
array requires n (all elements after the modified index need to be shifted).

Array is a collection of same data type. In linked list there are two field one is address and other is pointer. In array elements
are arranged in a specific order


Answer:

Some how the answer will be same as part 1 because Inserting or removing an element into a linked list requires one
data update, inserting or removing an element into an array requires n (all elements after the modified index need to be
shifted).

Array is a collection of same data type. The size of array is mentioned with its declaration. in arrays the elements are in
contiguous position. One must after another. While in linked list we gave the address of next element in the next part of node.




Answer:- (page 101)

Priority queue being used at many places especially in the operating systems. In operating systems, we have queue of different
processes. If some process comes with higher priority, it will be processed first. Here we have seen a variation of queue. We will use
the priority queue in the simulation. The events will be inserted in the queue and the event going to occur first in future, will be
popped.

Question No: 21


Answer:- (Page 96)

Use of Queues:

Out of the numerous uses of the queues, one of the most useful is simulation. A simulation program attempts to model a real-world
phenomenon. Many popular video games are simulations, e.g., SimCity, Flight Simulator etc. Each object and action in the
simulation has a counterpart in the real world. Computer simulation is very powerful tool and it is used in different high tech
industries, especially in engineering projects. For example, it is used in aero plane manufacturing. Actually Computer
Simulation is full-fledged subject of Computer Science and contains very complex Mathematics, sometimes. For example,
simulation of computer networks, traffic networks etc.



Answer: (Page 67)


o Each operator in a postfix expression refers to the previous two operands. o Each time we read an operand, we push it on a
stack.





Answer: (Page 54)

Empty stack means that there is no element on the stack. IsEmpty() boolean function returns true if stack is empty, false
otherwise.


Is the following statement correct? If your answer is No, then correct it. A tree is an AVL tree if at least half of the
nodes fulfill the AVL condition

Answer: (page 214)






Answer: (page 87)




Answer:- (Page 263)

The node to be deleted has either left child (sub-tree) or right child (sub-tree).In this case we bypass the node in such a way
that we find the in-order successor of this node and then link the parent of the node to be deleted to this successor node. Thus
the node was deleted.




C++ references allow you to create a second name for the a variable that you can use to read or modify the original data stored
in that variable.

#include

main()
{

int x;

int& foo = x;

// foo is now a reference to x so this sets x to 56 foo = 56;

}


Answer:

In the C++ programming language, a reference is a simple reference datatype that is less powerful but safer than the pointer
type inherited from C. The name C++ reference may cause confusion, as in computer science a reference is a general concept
datatype, with pointers andC++ references being specific reference datatype implementations Dangling Reference & Const

Dangling pointers and wild pointers in computer encoding are pointers that do not point to a valid object of the suitable type.
These are special cases of violations of memory safety


Answer:

A reference variable is used to refer a particular object Location which resides on a garbage collectable heap. c++ supports one
more type of variable called reference variable. In addition to pointer variable and value variable of reference variable behaves
similar to both vaule variable and pointer variable. Reference variable has all access that variable has.



Answer:



DEC 09,2011

FROM MIDTERM PAPERS

MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01
MC110200030 awais4you@gmail.com PLHR25



Answer:

"A complete binary tree is a binary tree with the additional property that every node must have exactly two children if an
internal node, and zero children if a leaf node."


Answer:

This rotation is almost similar to the single right rotation. We start from tree node k1. k1 is the root whilet ree node k2 is its
right child. Due to the left rotation, the right child k2 of the root k1 will become the root. The k1 will go down to the left child
of k2.

(i) Height of tree


(i) Height of tree

Answer: (Page 209)



Answer: (page 215)

The balance of a node in a binary search tree is defined as the height of its left subtree minus height of its right subtree. In
other words, at a particular node, the difference in heights of its left and right subtree gives the balance of the node.



Answer:

A binary tree is a finite set of elements that is either empty or is partitioned into three disjoint subsets. The first subset
contains a single element called the root of the tree. The other two subsets are themselves binary trees called the left and right
sub-trees.


Answer:- (Page 212)

Height of the left and right subtrees may differ by at most 1. Height of an empty tree is defined to be (-1).


Answer:-(Page 87)


In contrast to the stack, which is a LIFO (Last In First Out) structure, a queue is a FIFO (First In First Out) structure.


Answer:- Page 263

The node to be deleted has either left child (subtree) or right child (subtree).In this case we bypass the node in such a way that
we find the inorder successor of this node and then link the parent of the node to be deleted to this successor node. Thus the
node was deleted.


Answer: (Page 198)

Const keyword

The const keyword is used for something to be constant. The actual meanings depend on where it occurs but it generally means
something is to held constant. There can be constant functions, constant variables or parameters etc.

Reference variable

The references are pointers internally, actually they are constant pointers. You cannot perform any kind of arithmetic
manipulation with references that you normally do with pointers.

Dangling reference




Answer: (Page 123)




Answer: rep

Q:3 describe the following (i) Height of tree


Answer: rep



Answer:- rep


Answer: rep


Answer: rep


1. What is function of length () method in the Queue Answer: (page 111)

return size ;

This method returns the size of the queue, reflecting the number of elements in the queue. It is not the size of the array
used internally to store the elements of the queue.


Answer: (Page 229)

Sometimes a single rotation is not sufficient to balance an unbalanced tree. The two cases are following:

1. Insertion into the right subtree of the left child of X node (RL) 2. Insertion into the left subtree of the right child of X node
(LR)



We can print a binary tree level by level by employing recursive or non-recursive method. The idea of a level-order traversal is
to visit the root, then visit all nodes "1 level away" (depth 2) from the root (left to right), then all nodes "2 levels away" (depth
3) from the root, etc. For the example tree, the goal is to visit the nodes in the following order:

A level-order traversal requires using a queue (rather than a recursive algorithm, which implicitly uses a stack). A queue is a
FIFO structure, which can make the level-order traversal easier.






Answer: rep


Answer: rep


Answer:- rep


Answer:- rep


Answer: rep

Q:3 Describe the following (i) Height of tree

Answer: rep


Answer:- rep



A binary tree is a tree data structure in which each node has at most two children. Typically the child nodes are called left and
right. One common use of binary trees is binary search trees; another is binary heaps.


In an AVL tree the heights of the two child sub-trees of any node differ by at most one, therefore it is also called height-
balanced. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases. Additions and deletions
may require the tree to be rebalanced by one or more tree rotations.



If we have a complete binary tree with n numbers of nodes, the depth d of the tree can be found by the following equation:

d=log2 (n + 1) - 1

If the tree is complete binary or near-to-complete, we need log2(n) number of comparison. Whereas in a linked list, the
comparisons required could be a maximum of n.




Answer:

Stacks play a key role in implementation of function calls in programming languages. In C++, for example, the call stack is
used to pass function arguments and receive return values. The call stack is also used for local variables




a) A Post-order traversal :(L, R, N) b) A level-order traversal

Answer:

Post-order traversal:: CDBHFIGEA level-order traversal:: ABEDGCFIH




Answer:

The binary tree is a useful data structure for rapidly storing sorted data and rapidly retrieving stored data. It can hold objects
that are sorted by their keys.

It can represent a structured object, An operating system maintains a disk's file system as a tree, where file folders act as tree
nodes:




Answer:- (page 88)

Queue Operations






Answer:- (Page 53)

In computer science, a stack is a last in, first out (LIFO) abstract data type and data structure. A stack can have any abstract
data type as an element, but is characterized by only two fundamental operations: push and pop.the data structure itself
enforces the proper order of calls.


Give short answers of the following questions: 1. Why List wastes less memory as compared to Arrays.

Answer:

1. Linked lists do not need contiguous blocks of memory; extremely large data sets stored in an array might not be able to fit
in memory.

2. Linked list storage does not need to be preallocated (again, due to arrays needing contiguous memory blocks).

3. Inserting or removing an element into a linked list requires one data update, inserting or removing an element into an
array requires n (all elements after the modified index need to be shifted).

Array is a collection of same data type. In linked list there are two field one is address and other is pointer. In array elements
are arranged in a specific order


Answer:

Some how the answer will be same as part 1 because Inserting or removing an element into a linked list requires one
data update, inserting or removing an element into an array requires n (all elements after the modified index need to be
shifted).

Array is a collection of same data type. The size of array is mentioned with its declaration. in arrays the elements are in
contiguous position. One must after another. While in linked list we gave the address of next element in the next part of node.




Answer:- (page 101)

Priority queue being used at many places especially in the operating systems. In operating systems, we have queue of different
processes. If some process comes with higher priority, it will be processed first. Here we have seen a variation of queue. We will use
the priority queue in the simulation. The events will be inserted in the queue and the event going to occur first in future, will be
popped.

Question No: 21


Answer:- (Page 96)

Use of Queues:

Out of the numerous uses of the queues, one of the most useful is simulation. A simulation program attempts to model a real-world
phenomenon. Many popular video games are simulations, e.g., SimCity, Flight Simulator etc. Each object and action in the
simulation has a counterpart in the real world. Computer simulation is very powerful tool and it is used in different high tech
industries, especially in engineering projects. For example, it is used in aero plane manufacturing. Actually Computer
Simulation is full-fledged subject of Computer Science and contains very complex Mathematics, sometimes. For example,
simulation of computer networks, traffic networks etc.



Answer: (Page 67)


o Each operator in a postfix expression refers to the previous two operands. o Each time we read an operand, we push it on a
stack.





Answer: (Page 54)

Empty stack means that there is no element on the stack. IsEmpty() boolean function returns true if stack is empty, false
otherwise.


Is the following statement correct? If your answer is No, then correct it. A tree is an AVL tree if at least half of the
nodes fulfill the AVL condition

Answer: (page 214)






Answer: (page 87)




Answer:- (Page 263)

The node to be deleted has either left child (sub-tree) or right child (sub-tree).In this case we bypass the node in such a way
that we find the in-order successor of this node and then link the parent of the node to be deleted to this successor node. Thus
the node was deleted.




C++ references allow you to create a second name for the a variable that you can use to read or modify the original data stored
in that variable.

#include

main()
{

int x;

int& foo = x;

// foo is now a reference to x so this sets x to 56 foo = 56;

}


Answer:

In the C++ programming language, a reference is a simple reference datatype that is less powerful but safer than the pointer
type inherited from C. The name C++ reference may cause confusion, as in computer science a reference is a general concept
datatype, with pointers andC++ references being specific reference datatype implementations Dangling Reference & Const

Dangling pointers and wild pointers in computer encoding are pointers that do not point to a valid object of the suitable type.
These are special cases of violations of memory safety


Answer:

A reference variable is used to refer a particular object Location which resides on a garbage collectable heap. c++ supports one
more type of variable called reference variable. In addition to pointer variable and value variable of reference variable behaves
similar to both vaule variable and pointer variable. Reference variable has all access that variable has.



Answer:


Cs301 solved quiz
Created by hackerzZzz

Question # 1 of 10 Total Marks: 1
The _____ of the in a binary tree is defined as the height of its left
sub tree
minus the height of its right sub tree.
Height
Balance
Depth
None of above

In which case of insertion a single rotation can make the AVL tree
balanced?
An insertion into left subtree of the left child of .
An insertion into right subtree of the left child of . An
insertion into left subtree of the right child of . None
of above.

The _____ of a binary tree is the maximum levels of its leaves (also
called
the depth)?
Level
Width

Height
None of the above

Maximum time an insertion operation can take in AVL tree is? Here Log
stands for Log to the base of 2.
Log(n)
1.44 Log (n)
1.66 Log (n)
Log (n+1)

Which one of the following is to more close to AVL Tree?
BST
Complete BST
Heap
None of above

Imrangee

Which of the following data structure is of linear type?
Strings
Queues
Lists
All of above

A binary search tree (BST) every node has two or zero node is
called_____.

Complete BST
BST
Extended BST
None of above

Which data structure allows inserting elements at the back and
removing
from the front?
Stacks
Queues
BST
Deques

BST violates the condition of AVL when any node has a balance equal
to____
2 or -2
1 or -1
0
None of above

Incase of insertion of left outer node in BST we apply___
Single right rotation to make it AVL
Single left rotation to make it AVL
Double rotation, first left then right rotation.
None of above

1. Which data structure allows deleting data elements from front and
inserting at rear?
a. Stacks
b. Queues

c. Deques
d. Binary search tree
2. Identify the data structure which allows deletions at both ends of
the list but insertion at
only one end.

a. Input-restricted deque
b. Output-restricted deque

c. Priority queues
d.None of above
3. Which of the following data structure is non-linear type?

a. Strings
b. Lists

c. Stacks
d.None of above
4. Which of the following data structure is linear type?

a. Strings
b. Lists

c. Queues
d. All of above
5. To represent hierarchical relationship between elements, which data
structure is not
suitable?
a. Deque
b. Priority

c. Tree
d. All of above
6. A binary tree whose every node has either zero or two children is
called
a. Complete binary tree

b.Binary search tree
c.Extended binary tree

d.None of above
7. The depth of a complete binary tree is given by
a. Dn = n log2n

b. Dn = n log2n+1
c. Dn = log2n

d. Dn= log2n+1

8. When representing any algebraic expression E which uses only binary
operations in a
2-tree,
a. the variable in E will appear as external nodes and operations in
internal nodes
b.the operations in E will appear as external nodes and variables in
internal nodes
c.the variables and operations in E will appear only in internal nodes
d.the variables and operations in E will appear only in external nodes

9. A binary tree can easily be converted into q 2-tree
a. by replacing each empty sub tree by a new internal node
b. by inserting an internal nodes for non-empty node

c. by inserting an external nodes for non-empty node
d. by replacing each empty sub tree by a new external node
10. When converting binary tree into extended binary tree, all the
original nodes in binary tree
are

a. internal nodes on extended tree
b. external nodes on extended tree

c. vanishedon extended tree
d.None of above

11. The post order traversal of a binary tree is DEBFCA. Find out the
pre order traversal
a. ABFCDE
b.ADBFEC

c.ABDECF
d.ABDCEF
12. Which of the following sorting algorithm is of divide-and-conquer
type?
a. Bubble sort

b. Insertion sort
c. Quick sort
d. All of above

13. An algorithm that calls itself directly or indirectly is known as
a. Sub algorithm

b. Recursion
c. Polish notation
d. Traversal algorithm
14. 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
a. Leaf

b. branch
c. path

d. thread
15. The in order traversal of tree will yield a sorted listing of elements of
tree in
a. Binary trees
b. Binary search trees

c. Heaps
d. None of above

16. In a Heap tree
a. Values in a node is greater than every value in left sub tree and
smaller
than right sub tree
b. Values in a node is greater than every value in children of it

c. Both of above conditions applies
d. None of above conditions applies
17. In a graph if e=[u, v], Then u and v are called

a. endpoints of e
b. adjacent nodes

c. neighbors
d. all of above

18. A connected graph T without any cycles is called
a. a tree graph

b. free tree
c. a tree

d .All of above
19. In a graph if e=(u, v) means
a. u is adjacent to v but v is not adjacent to u

b. e begins at u and ends at v
c. u is processor and v is successor

d. both b and c
20. If every node u in G is adjacent to every other node v in G, A graph is
said to be
a. isolated
b. complete

c.finite
d.strongly connected
Top of Form

MC090406505 : Sumera Naz Time 66
Left sec(s)

Quiz Start Time: 08:55 PM

Question # 1 of 10 ( Start time: 08:55:33 PM ) Total Marks: 1
In which case of insertion single rotation can make the AVL tree
balanced.

Select correct option:

Bottom of Form
Top of Form

MC090406505 : Sumera Naz
Time 74
Left sec(s)




Top of Form

Time 41
Left sec(s)




Top of Form

Time 83
Left sec(s)


Which one the following is more closer to AVL tree, (chose the best
option)


Top of Form

Left sec(s)


In the call by reference methodology, a copy of the object is passed to
the called function.


Top of Form

Time 61
Left sec(s)


When representing any algebraic expression E which uses only binary
operations in a 2-tree,


Top of Form



Question # 7 of 10 ( Start time: 08:59:25 PM ) A
parse tree should be a/an ,


Time 45
Left sec(s)

Total Marks: 1

Top of Form

Time 62
Left sec(s)



A variable P is called pointer if

Top of Form

Time 67
Left sec(s)


The _________ of a binary tree is the maximum level of its leaves
(also called the depth).


Top of Form

Left sec(s)


The depth of a complete binary tree is given by _________


Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form

1. _____________ Memory is Volatile

main Random Access Both 1 and 2 Virtual

2. An _________ data type is a keyword of a programming
language that specifies the amount of memory needed to store data
and the kind of data that will be stored in that memory location

abstract int vector None of these

Short Int float long

3. Which of the following abstract data types are NOT used by
Integer Abstract Data type group?

Short Int float long
4. The hashString() member function is called by other member
functions of the Hashtable class whenever a function needs to
convert a ________________

a hash number key to a key key to a hash number key a key to
an Index None of these
5. An application iterates the hashtable by calling the ______ and
______ member functions

hasNext() and hasDelete() hasNext() and getNextKey() Both 1
and 2 None of these
6. The java.util package contains two classes that are designed to
work with hashtables. They are _______ and _________..
Hashtable , HashMap class Hashtable,List Vector,List
Vector,Hashtable
7. Data members of the Hashtable class stored in the private
access specifier
private access specifier Public access specifier common
access specifier None of these
8. _____ is the common programming technique used for hashing in all
hashing functions

Cloning Bit Shifting Hashmapping Listing
9. If the depth of a tree is 3 levels, then what is the Size of the
Tree?

4 2 8 6
10. deleteNode() function requires the _____ of the data element of
the node that is being removed

reference value declaration variable
11. Value of the first linked list index is _______

One Zero -1 None of these
12. A linked list index is ____ that represents the position of a
node in a linked list.

An Integer a variable a character a boolean

13. Why is the constructor of the QueueLinkedList class empty?

because initialization of data members of the LinkedList class is
performed by the constructor of the LinkedList class. because
initialization of data members of the LinkedList class is performed by
the destructor of the LinkedList class. because initialization of data
members of the QueueLinkedList class is performed by the
constructor of the LinkedList class. because initialization of data
members of the QueueLinkedList class is performed by the destructor of
the LinkedList class
14. _______ form of access is used to add and remove nodes from a
queue
LIFO,Last In First Out FIFO , First In First Out Both 1 and 2
None of these
15. ______ form of access is used to add and remove nodes from a
stack

LIFO FIFO Both 1 and 2 None of these
16. New nodes are added to the _____ of the queue.

front back middle Both 1 and 2
17. 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.

queue linked list stacks linked list both of them neither
of them
18. In an array queue, data is stored in an _____ element.

Node linked list array constructor
19. The pop() member function determines if the stack is empty by
calling the _____ member function

removeback() isEmpty() removedfront() hasNext()
20. What happens when you push a new node onto a stack?

the new node is placed at the front of the linked list. the new
node is placed at the back of the linked list. the new node is placed
at the middle of the linked list. No Changes happens
Top of Form

MC090400297 : Naveed Ali Time 68
Left sec(s)


From the following; which on is the correct syntax of an array
declaration: array size is 5 and it is of float data type?

float [5] name;
name[5] float;
float name[5];


Bottom of Form

Top of Form

MC090400297 : Naveed Ali
Time 86
Left sec(s)


In the case of pointer to pointer or _______________, the first
pointer contains the address of the second pointer, which contains the
address of the variable, which contains the desired value.

double dereference

Single dereference

Dereference

None of the given

Bottom of Form
Top of Form

Time 89

Left sec(s)


A structure is a collection of _____________under a single name.


values

variables

data

None of the given

Bottom of Form
Top of Form

Time 84
Left sec(s)


The ws manipulator can be used with ______ stream(s).

Output

Input

Input/Output


Bottom of Form

Top of Form

Time 89

Left sec(s)


Look at the program code and identify the error. 1 #include 2 #define PI
3.1415926; // Defining PI 3 main() { 4 int radius = 5; 5 cout << "Area of
circle with radius " << radius << " = " << PI * radius * radius; }
It will be compiled successfully and will not generate error It
will be compiled and returns nothing
Error exists in line number 2. Semi colon is not allowed with
define directive

The value of PI cannot be defined in the beginning

Bottom of Form
Top of Form

Time 81
Left sec(s)



+= , *= , /= , etc are called,

Assignment operators

Logical operator

Compound assignment operator

Unary operator

Bottom of Form

Top of Form

MC090405699 : Irfan Perveiz Time 86
Abbasi
Left sec(s)



The data type before a function name represents its,

Return Type

Function data

Function arguments

Function name

Top of Form

MC090405699 : Irfan Perveiz
Time 88
Abbasi
Left sec(s)



When we call a function, its control

transfers to its Prototype
transfers to its definition

returns to statement following function call

The compiler stops execution of whole program

Top of Form

Time 74
Abbasi
Left sec(s)


When an array of object is created dynamically then there is no way to
provide parameterized constructors for array of objects.

True

False

Top of Form

Time 88
Abbasi
Left sec(s)


Reference is not really an address it is ______________.

a synonym

an antonym

a value

a number

Top of Form

Time 88
Abbasi
Left sec(s)



Which of the following concept is NOT associated with stream?


Source

Template

Destination

State

Top of Form

Time 86
Abbasi
Left sec(s)


___________ work more or less in the same way as macros

Friend functions

Inline functions

User defined functions

Built-in functions

Top of Form

Time 73
Abbasi
Left sec(s)



To get the memory address of a variable we use ____ .


&

%

*

$

Top of Form

Time 88
Abbasi
Left sec(s)



Class is a user defined___________.

data type

memory reference

value

none of the given options.

Top of Form

Time 79
Abbasi
Left sec(s)



The compiler generates __________________ automatically


member functions

classes

objects of a class

constructors

Top of Form

Time 88
Abbasi
Left sec(s)


In_________, we try to have a precise problem statement

Analysis

Design

Coding

None of the given

Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form
Bottom of Form

ASSALAM O ALAIKUM all fellows
ALL IN ONE Mega File
CS301 Midterm PAPERS,
MCQz & subjective
Created BY Farhan & Ali
BS (cs) 3rd sem
Hackers Group
Mandi Bahauddin
Remember us in your prayers

Mindhacker124@gmail.com
Hearthacker124@gmail.com
Paper # 1
Today MIDTERM EXAMINATION
Spring 2011

Question No:1 ( Marks: 1 ) - Please choose one

Which one of the following calling methods does not change the original
value of the argument in the calling function?


Stack
Queue

Link list

All of these

AVL Tree is,






Linear way only

Non Linear way only





Unary

Binary
Ternary

None of the above


-- is a _________operator.

Unary

Binary

Ternary

None of the above
The data of the problem is of 2GB and the hard disk is of 1GB capacity, to
solve this problem we should


1

2
Suppose n is the number of nodes in a complete Binary Tree then
maximum steps required for a search operation are,

Log
2
(n+1) -1

Log
2
(n+1)

Log
2
(n) - 1
Log
2
(n)

_________ is a binary tree where every node has a value, every node's left
sub tree contains only values less than or equal to the node's value, and
every node's right subtree contains only values that are greater then or
equal?
Binary Search tree

AVL tree

All of these

Below is a binary search tree. If we delete the value 50 using the algorithm we
discussed, what value will be in the root of the remaining tree?

50
60
70

80


Four statements about trees are below. Three of them are correct. Which
one is INCORRECT?

The order of a tree indicates a maximum number of childen allowed at
each node of the tree
A search tree is a special type of tree where all values (i.e. keys) are
ordered

If Tree1's size is greater than Tree2's size, then the height of Tree1
must also be greater than Tree2's height.

Define Complete Binary tree
Answer:
"A complete binary tree is a binary tree with the additional property that
every node must have exactly two children if an internal node, and zero
children if a leaf node."

Question No: ( Marks: 2 )

Write APPLIICATION OF BST
Answer:
Binary tree is useful structure when two-way decisions are made at each
point. Suppose we want to find all duplicates in a list of the following
numbers: 14, 15, 4, 9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14, 5 This list may
comprise numbers of any nature. For example, roll numbers, telephone
numbers or voters list. In addition to the presence of duplicate number, we

may also require the frequency of numbers in the list. As it is a small list, so
only a cursory view may reveal that there are some duplicate numbers
present in this list. Practically, this list can be of very huge size ranging to
thousands or millions.
Question No: ( Marks: 3 )
What normally is the sequence of operations while constructing an AVL
tree?
Answer:

Basic operations of an AVL tree involve carrying out the same actions as
would be carried out on an unbalanced binary search tree, but
modifications are precede or followed by one or more operations called tree
rotations, wh

Question No: (Marks: 3)

Define the following
The Height of the Tree:
The definition of height of a tree is:
The height of a binary tree is the maximum level of its leaves (also called the
depth).
The balance of a node:
The balance of a node is defined as:
The balance of a node in a binary tree is defined as the height of its left
subtree minus height of its right subtree.
Question No: ( Marks: 5)

Define

MCQz & subjective
BS (cs) 3rd sem
Hackers Group
Mandi Bahauddin


MIDTERM EXAMINATION
Fall 2009
Ref No: 885482
Time: 60 min
Marks: 38


ab+c*d-
abc*+d-
abc+*d-
(abc*)+d-



A Compound Data Structure is the data structure which can have multiple data
items of same type or of different types. Which of the following can be considered
compound data structure?

Arrays
LinkLists

Binary Search Trees


Question No: 4 (Marks: 1) - Please choose one
Suppose a pointer has been declared in main but has not assigned any variable
address then

class foo
{
public:
void x(foo f);

Which of the three member functions can alter the PRIVATE member variables of the foo
object that activates the function?

function.
t that activates the function.
the object that activates the function.

the function.


delete
peek
pop page 53
remove


Stack is a special kind of list in which all insertions and deletions take place at
one end

Stack

Queue
Binary Search Tree
AVL Tree

stack.push(7);
stack.push(8);
stack.push(9);
stack.push(10);
stack.push(11);
stack.push(12);

7 8 9 10 11 12
7 12


1
2
there is no fixed maximum

void test_a(int n)
{
cout << n << " ";
if (n>0)
test_a(n-2);
}

4 2
0 2 4
0 2
2 4

Queue follows,
Last in First out
First in Last out
First in First out

None of these

_________ is a binary tree where every node has a value, every node's left subtree
contains only values less than or equal to the node's value, and every node's right subtree
contains only values that are greater then or equal?

Four statements about trees are below. Three of them are correct. Which one is
INCORRECT?

-dimensional data structures

the tree
e ordered

Tree1's size is greater than Tree2's size, then the height of Tree1 must also be greater than
Tree2's height.

Below is a binary search tree. If we delete the value 50 using the algorithm we discussed,
what value will be in the root of the remaining tree?

50
60
70
80

_________ is a data structure that can grow easily dynamically at run time without
having to copy existing elements.
Array

List
Both of these
None of these

Ans:
Definition: A collection of items in which only the earliest added item may be accessed.
Basic operations are add (to the tail) or enqueue and delete (from the head) or dequeue.
Delete returns the item removed. Also known as "first-in, first-out" or FIFO.

In computer science, a stack is a last in, first out (LIFO) abstract data type and data

structure. A stack can have any abstract data type as an element, but is characterized by
only two fundamental operations: push and pop. the data structure itself enforces the
proper order of calls.

Lets call the node as a that requires re-balancing. Consider the two cases given
below:

1) The insertion occurs outside (i.e., left-left or right-right) in cases 1 and 2. single
rotation can fix the balance in these two cases.
2) The insertion occurs inside ((i.e., left-left or right-right) in cases 1 and 2. single
rotation cannot fix the balance in these two cases

stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
stack.push(5);
stack.push(6);

You can insert as many stack.pop()s as you like in the above sequence of stack.pushs to get
a desired output. Which of the following cannot be an output?
A. 123456
B. 325416
C. 342561
D. 342615
E. 342165


Ans:
1. Linked lists do not need contiguous blocks of memory; extremely large data sets

stored in an array might not be able to fit in memory.
2. Linked list storage does not need to be preallocated (again, due to arrays needing
contiguous memory blocks).
3. Inserting or removing an element into a linked list requires one data update, inserting or
removing an element into an array requires n (all elements after the modified index need to
be shifted).

Array is a collection of same data type. In linked list there are two field one is address
and other is pointer. In array elements are arranged in a specific order
2. Why we can change the size of list after its creation when we can not do that in
simple arrays.
Some how the answer will be same as part 1 because Inserting or removing an element
into a linked list requires one data update, inserting or removing an element into an array
requires n (all elements after the modified index need to be shifted).
Array is a collection of same data type. The size of array is mentioned with its
declaration. in arrays the elements are in contiguous position. one must after another.
while in linked list we gave the address of next element in the next part of node.

MCQz & subjective
BS (cs) 3rd sem
Hackers Group
Mandi Bahauddin


MIDTERM EXAMINATION
Spring 2010


Which one of the following statement is NOT correct?




One
Two
Three
Four


Which one of the following calling methods does not change the original value of the
argument in the calling function?





Suppose currentNode refers to a node in a linked list (using the Node class with
member variables called data and nextNode). What statement changes currentNode so
that it refers to the next node?

currentNode ++;


False

True page #101


Stack
Queue

Link list

All of these



1 pointer

2 pointers page39

3 pointers

4 pointers


I have implemented the queue with a linked list, keeping track of a front pointer and a
rear pointer. Which of these pointers will change during an insertion into an EMPTY
queue?

Neither changes



Both change.



8
7
5
6

Root Nodes
Leaf Nodes
Both of these

None of these


AVL Tree is,

Non Linear data structure page112






Linear way only

Non Linear way only




A binary search tree should have minimum of one ________ node/s at
each level,

One

Two

Three

Four


L
Nodes at level L.
(ii) A complete binary tree of depth d is a binary tree that contains
2
L
Nodes at each level L between 0 and d, both inclusive.
(iii)T he total number of nodes (T
n
) in a complete binary tree of
depth d is 2
d+1
- 1 .
2 (Tn+1)-1 where Tn is Total number of Nodes.
Which one of the following is correct in respect of the above statements
regarding the Binary trees?

(i) and (iii) only

(ii) and (iii) only


Unary
Binary
Ternary

None of the above



create stack
push A onto stack
push F onto stack
push X onto stack
pop item from stack
push B onto stack
pop item from stack
pop item from stack
A Remening On The Stack


Answer:
Binary tree is useful structure when two-way decisions are made at each point.

Suppose we want to find all duplicates in a list of the following numbers: 14, 15, 4, 9, 7,
18, 3, 5, 16, 4, 20, 17, 9, 14, 5


Answer:

One application is to find duplicates in a list of numbers. Let
a given list be" 12 34 56 89 33 11 89
the first number in the list is placed in a node that is established as the root of a binary
tree. Each number is compared with the node in the root, if the number is larger, we
search the right sub-tree else we search the left sub-tree. If the sub-tree is empty, the
number is not a duplicate and this will be added as a new node.
2. Binary trees can be used for sorting a given list such that, if we take the first number as
root, the numbers less than that number will be transfered to left sub-tree and the greater
numbers to right sub-tree.


{
if( tree == NULL )
return NULL;
}


In the last lecture we were discussing about reference variables, we saw three examples; call
by value, call by reference and call by pointer. We saw the use of stack when a function is

called by value, by reference or by pointer. The arguments passed to the function and local
variables are pushed on to the stack. There is one important point to note that in this course,
we are using C/C++ but the usage of stack is similar in most of the computer languages like
FORTRAN and Java . The syntax we are using here is C++ specific, like we are sending a
parameter by pointer using & sign. In Java, the native data types like int, float are passed by
value and the objects are passed by reference. In FORTRAN, every parameter is passed by
reference. In PASCAL, you can pass a parameter by value or by reference like C++. You
might have heard of ALGOL, this language had provided another way of passing parameter
ca


Determine what the following recursive mystery function computes when given a
pointer to the root node of a binary tree.

struct bt_s { int key; struct bt_s *left, *right; } bt_t; int
MFunc (bt_t *T) {
int N1, N2;
return (N1 > N2 ? N1 : N2) + 1;
}



MCQz & subjective
BS (cs) 3rd sem
Hackers Group
Mandi Bahauddin


MIDTERM EXAMINATION
Spring 2010
Ref No: 1128537
Time: 60 min
Marks: 38

In the statement int x[6]; , we cannot assign any value to x because x is
not an value.
True
False


What will be postfix expression of the following infix expression?
Infix Expression : a+b*c-d
ab+c*d-
abc*+d-
abc+*d-
abcd+*-

Which one of the following calling methods does not change the original value of the

argument in the calling function?

int &x ;
int *x ;
int x ;



Consider the following pseudo code
while ( there are more characters in the word to read )
{

read a character
}
while ( the stack is not empty )
{
pop a character off the stack
write the character to the screen
}
What is written to the screen for the input "apples"?

selpa
selppa
apples
aaappppplleess
In the following C++ code, how many function calls are made?
int x, y, z;
x = 2;
y = 3 + x;
z = foobar(x,y);
1
4
7
8

Front

Rear
From Both Rare and Front
None of these


8
7
5
6



How many descendants does the root have?
5
6
7
8


Below is a binary search tree. If we delete the value 50 using the
algorithm we discussed, what value will be in the root of the remaining
tree?

50
60
70
80



Linear way only
Non Linear way only

Which of the following statement regarding binary tree is NOT correct.
A binary tree can contain at least 2L Nodes at level L.
A complete binary tree of depth d is a binary tree that contains 2L
Nodes at each level L between 0 and d, both inclusive.
The total number of nodes (Tn ) in a complete binary tree of depth d is
2 d+1 - 1 .

The height of the complete binary tree can be written as h = log 2
(Tn+1)-1 where Tn is Total number of Nodes.

1. The last item to be added to a queue is the first item to be removed
2. A queue is a structure in which both ends are not used
3. The last element hasnt to wait until all elements preceding it on the queue
are removed
4. A queue is said to be a last-in-first-out list or LIFO data structure.
(iii) and (ii) only
(ii) and (iv) only

The________ method of list data structure removes the element residing at
the current position.

Add
next
remove
find

It will be efficient to place stack elements at the start of the list because insertion
and removal take _______time.
Variable
Constant
Inconsistent
None of the above
Question No: 17 ( Marks: 2
)
Assume that numbers 1, 312, 8, 34, 11 are pushed on a stack, three numbers are
popped, then numbers 12, 44 are pushed on the stack, and one number is popped.
What are the final contents of the stack?
Ans:
11,34,8,44,12,312,1

Ans:
To avoid dangling reference, dont return the reference of a local variable
(Transient) from a function.

Traverse the following tree in inorder and postorder
15
/ \
2 11

Ans:

Post order traversal:
Traversal order will be LEFT,RIGHT,ROOT
IN THIS CASE IS,
11.2.15
In-order traversal:
Traversal order will be LEFT,ROOT,RIGHT
IN THIS CASE we got data in sorted form
11.15.2

The nodes of a binary tree have data 1, 2, 3, 4. The in-order traversal of the tree
yields 2,1,4,3. The postorder traversal is 2, 4, 3, 1. The root of the tree is at level 0.
(A) 1 (B) 2 (C) 3 (D) 4 (E) none
Ans:
C(3)

In which cases of insertion we require double rotations to make tree balance?
Ans:
Write a recursive function that given a Binary Search Tree and a low and a high
value, prints all records (data values) in that Binary Search Tree that fall between the
two values ( Our function will print all those values which are between the low and
high value we will pass to that function).

For full credit, the function PrintRange should visit as few nodes as possible.
It's prototype is given below,
int PrintRange(Node* root, int low, int high);
Suppose that the following is a balanced AVL tree. Insert a new node p into the tree.
Then the resulting tree may or may not remain balanced.

Ans:
int PrintRange(Node* root, int low, int high);

BinarySearch(A[0..N-1], value, low, high) {
if (high < low)
return -1 // not found
mid = low + ((high - low) / 2)
if (A[mid] > value)
return BinarySearch(A, value, low, mid-1)
else if (A[mid] < value)
return BinarySearch(A, value, mid+1, high)
else
return mid // found
}


MCQz & subjective
BS (cs) 3rd sem
Hackers Group
Mandi Bahauddin

CS301 DATA STRUCTURE
Mid Term Examination - May 2010
16 MCQs of one number each. All MCQs less one & long Questions

1. Addition of new items in stack make the pointer ------------ by 2 :-
a. Increment, bits
b. Increment, bytes
c. Decrement, bits
d. Decrement, bytes

2. Next item in a linked list is known as:-
a. Index
b. Item
c. Node
d. Child
3. What will be the postfix notation of 5+6/2.
a. 56+/2
b. 562+/
c. 562/+
d. 5+62/

4. In an AVL tree to delete a parent with two childs in a straight line following
rotations will be required:-

a. Single
b. Double
c. Triple
d. None.

5. To check the depth of an AVL tree following time will be taken:-
a. 1.66 Log 2 n

b. 1.44 Log2 n
c. Log2 (n+1)-1
d. 1.66 Log 2 n (n+1)
6. BST is a _______ Structure:-
a. Linear
b. Non Linear
c. Circular
d. None of Above

7. After creation of an arry:-

a. Size can be increase but can not be decreased.
b. Size can be decreased but can not be increased.
c. Size can neither be increased nor be decreased.
d. Size can be increased and can also be decreased.
8. Each node in a BST has ______ Pointers:-

a. 1
b. 2
c. 3
d. 4

9. Highest Operators Precedence is of the following operator:-
a. Plus
b. Minus
c. Multiply
d. Exponentiation

10. Following are the linear data structures:-
a. Stacks
b. Queues
c. Both a & b
d. None of the above

11. Each entry which points to a null value in a Singly Linked List is known as:-
a. Node
b. First Node
c. Last Node
d. Head Node

12. Non recursive calls are faster than the Recursive calls.
a. True
b. False
13. Tree data structure is a ________
a. Linear
b. Non Linear
c. Circular
d. None of Above

14. What will be the valid postfix notation of A+B*C-D
a. ABC+*D-
b. ABC*+D-
c. ABCD+-*
d. AB+D*C
15. When an operator is used in between two operands this is which type of
notation
a. Prefix
b. Postfix
c. Infix
d. None of the Above
16. Give two uses of Queues?
2 Marks
Answer:
In the C++ programming language, a reference is a simple reference datatype
that is less powerful but safer than the pointer type inherited from C. The
name C++ reference may cause confusion, as in computer science a reference is a
general concept datatype, with pointers andC++ references being specific
reference datatype implementations
Dangling Reference & Const
Dangling pointers and wild pointers in computer encoding are pointers that
do not point to a valid object of the suitable type. These are special cases of
violations of memory safety

3 Marks
Answer:
A reference variable is used to refer a particular object Location which resides on
a garbage collectable heap.
c++ supports one more type of variable called reference variable. In addition
to pointer variable and value variable of reference variable behaves similar to
both vaule variable and pointer variable. Reference variable has all access that
variable has.
19. Write does the following instruction do? 5
Marks
a. Int x;
Int* y = &x;
b. Int x;
Int &y = &x;
c. Int x;
Int y = x;
20. See the following BST and give its in order traversal. 5 Marsk

MCQz & subjective
BS (cs) 3rd sem
Hackers Group
Mandi Bahauddin


In Order Traversal: 3, 4, 5, 7, 9, 14, 15, 16, 17, 18, 20

Paper # 2
MIDTERM EXAMINATION
Spring 2010
Time: 60 min
Marks: 38

A
False

True

The
data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we
should



int X (int& Value)
{
return Value;
}
Now a and b are integers in a calling function. Which one of the following is a valid call to the
above function X.

a = X (b) ;
a = X (&b) ;
a = X (*b) ;

False
True




body, and you do NOT want these changes to alter the actual argument.
body, and you DO want these changes to alter the actual argument.

Whenever the parameter has huge size, and the function does not change the parameter
within its body.


class foo
{
public:
void x(foo f);


Only x can alter the private member variables of the object that activates the
function.

function.


1

2

Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for
a search operation are,

Log
2
(n+1) -1

Log
2
(n+1)

Log
2
(n) - 1

Log
2
(n)

In the linked list implementation of the stack class, where does the push member function places the
new entry on the linked list?

At the head
At the tail


Suppose we have a circular array implementation of the queue class, with ten items in the queue
stored at data[2] through data[11]. The CAPACITY is 42, i.e., the array has been declared to be of
size 42. Where does the push member function place the new entry in the array?

data[1]
data[2]
data[11]
data[12]


Prefix expression

Postfix expression page70
Infix expression
None of these


Binary Search tree

AVL tree

All of these




J and I

H and E

D and E

L and M

Which of the following statement is correct about these two cases?




Linear way only

Non Linear way only



AVL Tree is,







Answer:
We know the functionality of the function calls. Whenever a programmer calls a function, he or
she passes some arguments or parameters to the function. The function does work on these
arguments and returns a value to the calling function or program. This value is
known as the return value of the function. We declare some variables inside the function which
are local variables of the function.

MCQz & subjective
BS (cs) 3rd sem
Hackers Group
Mandi Bahauddin


True
False

True
False
In preorder traversal only
variables called data and nextNode). What boolean expression will be true when cursor refers to the
tail node of the list?

and beta?
if (alpha < beta)
None of these
add
append
insert
Push
delete
peek
pop
remove
stack.push(7);
stack.push(8);
stack.push(9);
stack.push(10);
stack.push(11);
stack.push(12);
7 8 9 10 11 12
9 8 11 10 7 12
9 10 8 11 12 7
9 10 8 12 7 11

2
4
6 not conform
9
AVL Tree is,




(i) The last item to be added to a queue is the first item to be removed

(ii) A queue is a structure in which both ends are not used

(iii) and (ii) only
(ii) and (iv) only

True
False



The following function is performing some operation on the elements of a singly link list please tell
what this functions is doing,
int result = 0;
if(value % 2 == 0)
{ value ++;
temp->set(value);
}
}
}

1. void main(void)
2. {
5.
8. }

the root.

MCQz & subjective
BS (cs) 3rd sem
Hackers Group
Mandi Bahauddin


MIDTERM EXAMINATION
Spring 2010
Ref No: 1349576
Time: 60 min
Marks: 38



True
False



The first element

The middle element

The last element








and beta?

if (alpha < beta)
Reference
http://www.sonic.net/sarkar/quizzes/cis10/ch15qz.htm



FIFO, LIFO
LIFO,FIFO
none of these
both of these

Minus operator

Plus operator



1 pointer

2 pointers

3 pointers

4 pointers



The order of a tree indicates a maximum number of childen allowed at each node of the
tree


Tree2's height.








Searching an element in an AVL tree take maximum _______ time (where n is no. of nodes in
AVL tree),

Log
2
(n+1)
Log
2
(n+1) -1
1.44 Log
2
n

1.66 Log
2
n



1
3
2
4


L
Nodes at level L.
L

n
d+1
- 1 .
2
(T
n
+1)-1 where T
n
is

(i) and (iii) only
(ii) and (iii) only


5 + 6/2

56/ + 2
5 6 2 / +
5 6 / 2 +
/62 + 5



Linked List

Stack
Queue
Tree

Unary
Binary
Ternary

None of the above








The nodes of a binary tree have data 1, 2, 3, 4. The in-order traversal of the tree yields
2,1,4,3. The postorder traversal is 2, 4, 3, 1. The root of the tree is at level 0.

(A) 1 (B) 2 (C) 3 (D) 4 (E) none





14
/ \
2 11
/ \ / \
1 3 10 30
/ /
7 40




ASSALAM O ALAIKUM all
fellows
MCQz & subjective
BS (cs) 3rd sem
Hack
ers
Group
Mandi
Bahau
ddin

Mindhacker124
@gmail.com
Hearthacker124
@gmail.com

Paper 1 (spring 2010 a )
Paper 2 (spring 2010 b )
Paper 3 ( session 5 , 2009 )
Paper 4 ( unknown a )
Paper 5 (unknown b )
Paper 6 (spring 2010 c )
Paper 7 (unknown c )

( paper 5 completed)

Paper1
MIDTERM EXAMINATION
Spring 2010 a









One

Two

Three

Four

p67


Which one of the following calling methods does not change the original value of the argument in the
calling function?








All the nodes fulfill the AVL condition ( p 213)



variables called data and nextNode). What statement changes currentNode so that it refers to the
next node?

currentNode ++;






False

True

p101



Stack

Queue

Link list

All of these



1 pointer

2 pointers

3 pointers

4 pointers

p39


I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which
of these pointers will change during an insertion into an EMPTY queue?

Neither changes



Both change.




8

7

5

6



Root Nodes

Leaf Nodes

Both of these

None of these


AVL Tree is,







Linear way only

Non Linear way only




A binary search tree should have minimum of one ________ node/s at each level,

One

Two

Three

Four



L
Nodes at level L.
(ii) A complete binary tree of depth d is a binary tree that contains 2
L
(iii) The total number of nodes (T
n
d+1
- 1 .
2
(T
n
+1)-1 where T
n
is


(i) and (iii) only


(ii) and (iii) only




Unary

Binary

Ternary

None of the above



create stack
push A onto stack
push F onto stack
push X onto stack
pop item from stack
push B onto stack
pop item from stack
pop item from stack

A Remaining On The Stack





One application is to find duplicates in a list of numbers.
Let a given list be" 12 34 56 89 33 11 89
the first number in the list is placed in a node that is established as the root of a binary tree. Each
number is compared with the node in the root, if the number is larger, we search the right sub-
tree else we search the left sub-tree. If the sub-tree is empty, the number is not a duplicate and
this will be added as a new node.
2. Binary trees can be used for sorting a given list such that, if we take the first number as root,
the numbers less than that number will be transfered to left sub-tree and the greater numbers to
right sub-tree.



{
if( tree == NULL )
return NULL;

}



In the last lecture we were discussing about reference variables, we saw three examples; call by
value, call by reference and call by pointer. We saw the use of stack when a function is called by
value, by reference or by pointer. The arguments passed to the function and local variables are
pushed on to the stack. There is one important point to note that in this course, we are using C/C++
but the usage of stack is similar in most of the computer languages like FORTRAN and Java . The
syntax we are using here is C++ specific, like we are sending a parameter by pointer using & sign. In
Java, the native data types like int, float are passed by value and the objects are passed by reference.
In FORTRAN, every parameter is passed by reference. In PASCAL, you can pass a parameter by
value or by reference like C++. You might have heard of ALGOL, this language had provided
another way of passing parameter ca


Determine what the following recursive mystery function computes when given a pointer to the
root node of a binary tree.

struct bt_s { int key; struct bt_s *left, *right; } bt_t;

int MFunc (bt_t *T) {
int N1, N2;
return (N1 > N2 ? N1 : N2) + 1;
}



Paper2
MIDTERM EXAMINATION
Spring 2010 b

Time: 60 min
Marks: 38

A

False

True ( p 101)

The
data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should


Increase the hard disk space (p 5)



int X (int& Value)
{
return Value;
}
Now a and b are integers in a calling function. Which one of the following is a valid call to the above
function X.

a = X (b) ;

a = X (&b) ;

a = X (*b) ;




False

True (p 202)




Non-linear data structure (p 112)






Whenever the parameter has huge size, the function changes the parameter within its body, and
you do NOT want these changes to alter the actual argument.

Whenever the parameter has huge size, the function changes the parameter within its body, and
you DO want these changes to alter the actual argument.
Whenever the parameter has huge size, and the function does not change the parameter within its
body.



class foo
{
public:
void x(foo f);
...

Which of the three member functions can alter the PRIVATE member variables of the foo object that
activates the function?




function.



1

2





Log
2
(n+1) -1 (p 139 )

Log
2
(n+1)

Log
2
(n) 1

Log
2
(n)


In the linked list implementation of the stack class, where does the push member function places the new
entry on the linked list?

At the head (p 53 )

At the tail




Suppose we have a circular array implementation of the queue class, with ten items in the queue stored at
data[2] through data[11]. The CAPACITY is 42, i.e., the array has been declared to be of size 42. Where
does the push member function place the new entry in the array?

data[1]

data[2]

data[11]

data[12]



Prefix expression

Postfix expression (p 70)

Infix expression

None of these


_________ is a binary tree where every node has a value, every node's left subtree contains only values
less than or equal to the node's value, and every node's right subtree contains only values that are greater
then or equal ?


Binary Search tree

AVL tree

All of these




J and I

H and E

D and E

L and M




1) The insertion occurs outside (i.e., left-left or right-right) in cases 1 and 2. single rotation can fix the
balance in these two cases.
2) The insertion occurs inside ((i.e., left-left or right-right) in cases 1 and 2. single rotation cannot fix the
balance in these two cases



Linear way only

Non Linear way only




AVL Tree is,










xplain the two cases in which we apply double rotation in an AVL tree.



a) A Post-order traversal


Please consider the following AVL tree.
1. Insert new node 87 in this tree and make tree balance.
2. Write balance factor of each node after and before inserting node 87.


Consider the following binary tree

Show the state of the tree after deleting 24.

Paper3
MIDTERM EXAMINATION
Fall 2009
Ref No: 885482
Time: 60 min
Marks: 38



ab+c*d-( according to rule)
abc*+d-

abc+*d-
(abc*)+d-

The
tree data structure is a

Non-linear data structure (page 112 )


A Compound Data Structure is the data structure which can have multiple data items of same type
or of different types. Which of the following can be considered compound data structure?

Arrays

LinkLists

Binary Search Trees



Suppose a pointer has been declared in main but has not assigned any variable address then

ULL value



class foo
{
public:
void x(foo f);
...

Which of the three member functions can alter the PRIVATE member variables of the foo object that
activates the function?

ct that activates the function.

Two of the functions can alter the private member variables of the object that activates
the function.

The
operation for removing an entry from a stack is traditionally called:
delete
peek
pop (page 53)
remove



Stack is a special kind of list in which all insertions and deletions take place at one end



Stack (page 80)

Queue

Binary Search Tree

AVL Tree


stack.push(7);
stack.push(8);
stack.push(9);
stack.push(10);
stack.push(11);
stack.push(12);

7 8 9 10 11 12



1
2



void test_a(int n)
{
cout << n << " ";
if (n>0)
test_a(n-2);
}


4 2 0
0 2 4
0 2

2 4


Queue follows,

Last in First out

First in Last out

First in First out (page 87)

None of these


_________ is a binary tree where every node has a value, every node's left subtree contains only values
less than or equal to the node's value, and every node's right subtree contains only values that are greater
then or equal ?


Four
statements about trees are below. Three of them are correct. Which one is INCORRECT?
-dimensional data structures
the
tree

Tree1's size is greater than Tree2's size, then the height of Tree1 must also be greater
than Tree2's height.


Below is a binary search tree. If we delete the value 50 using the algorithm we discussed, what value will
be in the root of the remaining tree?

50
60
70
80


_________ is a data structure that can grow easily dynamically at run time without having to copy
existing elements.

Array

List

Both of these

None of these

Ans:
Definition: A collection of items in which only the earliest added item may be accessed. Basic operations
are add (to the tail) or enqueue and delete (from the head) or dequeue. Delete returns the item removed.
Also known as "first-in, first-out" or FIFO.


In computer science, a stack is a last in, first out (LIFO) abstract data type and data structure. A stack can
have any abstract data type as an element, but is characterized by only two fundamental operations: push
and pop. the data structure itself enforces the proper order of calls.





1) The insertion occurs outside (i.e., left-left or right-right) in cases 1 and 2. single rotation can fix the
balance in these two cases.
2) The insertion occurs inside ((i.e., left-left or right-right) in cases 1 and 2. single rotation cannot fix the
balance in these two cases



stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
stack.push(5);
stack.push(6);

You can insert as many stack.pop()s as you like in the above sequence of stack.pushs to get a desired
output. Which of the following cannot be an output?
A. 123456
B. 325416
C. 342561
D. 342615

E. 342165




Ans:
1. Linked lists do not need contiguous blocks of memory; extremely large data sets stored in an array
might not be able to fit in memory.
2. Linked list storage does not need to be preallocated (again, due to arrays needing contiguous memory
blocks).
3. Inserting or removing an element into a linked list requires one data update, inserting or removing an
element into an array requires n (all elements after the modified index need to be shifted).

Array is a collection of same data type. In linked list there are two field one is address and other is
pointer. In array elements are arranged in a specific order

2. Why we can change the size of list after its creation when we can not do that in simple arrays.
Some how the answer will be same as part 1 because Inserting or removing an element into a linked list
requires one data update, inserting or removing an element into an array requires n (all elements after the
modified index need to be shifted).

Array is a collection of same data type. The size of array is mentioned with its declaration. in arrays the
elements are in contiguous position. one must after another. while in linked list we gave the address of
next element in the next part of node.


Convert the following infix expression into postfix expressions using stack (Show complete steps)

1-2 -3-3-(4+5*6)*7

Paper4

Unknown (a)
Time: 60 min
Marks: 38

In linked list each element also has the address of the element next to it

int &x ;
int *x ;

int x ;

Linked lists are collections of data items "lined up in a row" , insertions and deletions can
be made only at the front and the back of a linked list.
True
False

A Linear Data Structure is the data structure in which data elements are arranged in a
sequence or a linear list. Which of the following is Non Linear Data Structure?
Arrays
LinkLists
Binary Search Trees
None of these

false
True (page 101)

Which one of the following statements is correct?
Array size is fixed once it is created.
Link List size is fixed once it is created.
Binary Search Tree size is fixed once it is created
AVL Tree size is fixed once it is created

Which one of the following is correct about pointers?
They always point to
different memory locations
memory location
The address of two pointer variables is same
None of these

Which of the following abstract data types are NOT used by Integer Abstract Data type group?
short
int
float
long

add
append
insert
push (page 53)

delete
peek
pop (page 53)
remove

Front
Rear (page 53)
From Both Rare and Front
None of these

a binary search tree has
two children per node whereas a binary tree can have none, one, or two children per
node
in binary search tree nodes are inserted based on the values they contain

in binary tree nodes are inserted based on the values they contain
none of these

Log
2
(n+1) -1 (page 139)
Log
2
(n+1)
Log
2
(n) 1
Log
2
(n)

The following is a segment of a C program.
int pqr(BinaryNode t)
{ if (t == null )
return -1;
else
return 1+max(pqr(t.left),pqr(t.right)) }
Identify, what the above program intend(s) to do?
Compute the height of a binary tree using an in-order traversal
Compute the height of a binary tree using a pre-order traversal
Compute the depth of a binary tree using a pre-order traversal
Compute the depth of a binary tree using a post-order traversal

3 + 5 * 6 7 * (8 + 5)
3 6 5 + * 7 5 8 + - *
3 6 5 7 5 8 + * + - *
3 5 6 + * 7 8 5 + - *
3 5 6 * + 7 8 5 + * -

True
False

Is this a correct statement? Give answer in Yes or No.
A node cannot be deleted, when the node to be deleted has both left and right subtrees.
No, it can be deleted.

Deleting a leaf node in binary search tree involves setting ______ pointer/s of that nodes parent
as null.
1
2
3
4

Following is the while loop used in level-order traversal:
while( !q.empty() )
{
treeNode = q.dequeue();
cout << *(treeNode->getInfo()) << " ";
if(treeNode->getLeft() != NULL )
q.enqueue( treeNode->getLeft());
if(treeNode->getRight() != NULL )
?
}
What should be the statement to replace the question mark in the loop above:
Write a friend function for a Linked List class called mergeLists that takes two non-empty lists,
merge these two lists and return the merged list.
Use the following function prototype:
List mergeLists(List x,List y)

Paper5

Unknown(b)
True
False

True
False ( p 43)

In preorder traversal only ( p 143)

All the nodes fulfill the AVL condition (p 213 )
variables called data and nextNode). What boolean expression will be true when cursor refers to
the tail node of the list?

and beta?

if (alpha < beta)
None of these
add
append
insert
push ( p 53)
delete
peek
pop (p 53 )
remove
stack.push(7);
stack.push(8);
stack.push(9);
stack.push(10);
stack.push(11);
stack.push(12);

7 8 9 10 11 12
9 8 11 10 7 12
9 10 8 11 12 7
9 10 8 12 7 11
________ is the maximum number of nodes that you can have on a stack-linked list ?
Zero
2n (where n is the number of nodes in linked list)
Any Number
None of these
Which of the following can be used to reverse a string value,

Stack

Queue

Both of these

None of these

Consider the following tree,


2
4
6
9
AVL Tree is,






(i) The last item to be added to a queue is the first item to be removed
(ii) A queue is a structure in which both ends are not used


(iii) and (ii) only
(ii) and (iv) only


True
False




The following function is performing some operation on the elements of a singly link list please
tell what this functions is doing,
int result = 0;
if(value % 2 == 0)
{ value ++;
temp->set(value);
}
}
}

1. void main(void)
2. {
5.
8. }

the root.

Paper6

MIDTERM EXAMINATION
Spring 2010 (c)
Ref No: 1349576
Time: 60 min
Marks: 38



True

False (p 7 )



The first element

The middle element

The last element



Which one of the following calling methods does not change the original value of the argument in the
calling function?













Which of the following tests in the client code correctly compares two class objects alpha and beta?

if (alpha < beta)






FIFO, LIFO

LIFO,FIFO

none of these

both of these




Minus operator

Plus operator




1 pointer

2 pointers

3 pointers

4 pointers




The order of a tree indicates a maximum number of childen allowed at each node of the tree


If Tree1's size is greater than Tree2's size, then the height of Tree1 must also be greater than Tree2's
height.








Searching an element in an AVL tree take maximum _______ time (where n is no. of nodes in AVL
tree),

Log
2
(n+1)

Log
2
(n+1) -1

1.44 Log
2
n (p 227 )

1.66 Log
2
n



1

3

2

4 (p 229)



L
Nodes at level L.
L
n
d+1
- 1 .
2
(T
n
+1)-1 where T
n
is


(i) and (iii) only


(ii) and (iii) only



5 + 6/2

56/ + 2

5 6 2 / + (p 66)

5 6 / 2 +

/62 + 5



Linked List

Stack

Queue

Tree (p 112)



Unary

Binary (p 64)

Ternary

None of the above








The nodes of a binary tree have data 1, 2, 3, 4. The in-order traversal of the tree yields 2,1,4,3. The
postorder traversal is 2, 4, 3, 1. The root of the tree is at level 0.
(A) 1 (B) 2 (C) 3 (D) 4 (E) none





14
/ \

2 11
/ \ / \
1 3 10 30
/ /
7 40





Paper7

Unknown c

MIDTERM EXAMINATION
Spring 2010

1. Addition of new items in stack make the pointer ------------ by 2

a. Increment, bits
b. Increment, bytes
c. Decrement, bits
d. Decrement, bytes

2. Next item in a linked list is known as
a. Index
b. Item
c. Node
d. Child

3. What will be the postfix notation of 5+6/2.
a. 56+/2
b. 562+/
c. 562/+ (Page 66)
d. 5+62/

4. In an AVL tree to delete a parent with two childs in a straight line following rotations will be
required:-
a. Single
b. Double
c. Triple
d. None.

5. To check the depth of an AVL tree following time will be taken:-
a. 1.66 Log2n
b. 1.44 Log2n (Page 227)
c. Log2 (n+1)-1
d. 1.66 Log2n (n+1)

6. BST is a Structure:-
a. Linear
b. Non Linear
c. Circular
d. None of Above

7. After creation of an array:-
a. Size can be increase but can not be decreased.
b. Size can be decreased but can not be increased.
c. Size can neither be increased nor be decreased. Click here for detail
d. Size can be increased and can also be decreased.

8. Each node in a BST has Pointers:-
a. 1
b. 2
c. 3
d. 4

9. Highest Operators Precedence is of the following operator:-

a. Plus
b. Minus
c. Multiply Click here for detail
d. Exponentiation

10. Following are the linear data structures:-
a. Stacks
b. Queues
c. Both a & b (Page 52, 87)
d. None of the above

11. Each entry which points to a null value in a Singly Linked List is known as:-
a. Node
b. First Node
c. Last Node
d. Head Node

12. Non recursive calls are faster than the Recursive calls.
a. True (Page 323)
b. False

13. Tree data structure is a
a. Linear
b. Non Linear (Page 112) rep
c. Circular
d. None of Above

14. What will be the valid postfix notation of A+B*C-D
a. ABC+*D-
b. ABC*+D- (According to rule)
c. ABCD+-*
d. AB+D*C 15.

15.When an operator is used in between two operands this is which type of
notation
a. Prefix
b. Postfix
c. Infix (Page 64)
d. None of the Above

Q 16. Give two uses of queues ? 2 marks
Q 17 . define reference variable , dangling reference and const ? 3 marks
Q 18 . what is the use of reference variable ? give example. 3 marks

Cs 301

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cs 301

Uploaded by

Copyright:

Available Formats

paper was very easy, mostly from Moaz bhai files, can say 80% mcqs were from

past and subjective 2 question from moaz file,

You might also like