CS301 Quiz 2 Set 2

In the name of ALLAH, the most beneficient, the most merciful

Data Structures (CS301) · Multiple Choice Questions (MCQs) · Try Before You Buy · at Jomo

Try the Ekisa Slippers range before you buy with Jomo. Same day delivery in major cities. Jomo

Objective Questions

________ is when function is calling to itself.

1. Loop
2. Recursion
3. Iteration
4. Nasted loop

Which of the following operations returns "most recently entered value" from the stack?

1. Push
2. Recent
3. Top
4. First

The array in binary search is sub divided ________.

1. Once
2. Twice
3. N time
4. Untill a sublist is no more divisible

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

1. increaseKey(p,delta)
2. decreaseKey(p,delta)
3. percolateDown(p,delta)
4. remove(p,delta)

Ahmad is cousin of Ali and Ali is also cousin of Ahmad

1. Reflexivity
2. Symmetry
3. Transitivity VU Statistics 1. Courses 500 2. Video Lectures

44484

3. Handouts / PPTs

VULMS Guidelines

Important VU Links

B o o k n o w

4. All of the given

Factorial is an example of ________ function.

1. Recusive
2. Non-Recursive
3. Cube
4. Log

given the values are the array representation of heap:

If we perform 4 deleteMin operations, the last element deleted is

1. 31
2. 34
3. 44
4. 56

The difference between a " Binary Tree (BT)" and a " Binary Search Tree (BST)" is that,

1. A BST has two children per node whereas a BT can have none, one or two children per node
2. In BST nodes are inserted based on the values they contain
3. In BT nodes are inserted based on the values they contain
4. There is no difference

If a tree has 20 edges/links, then the total number of nodes in the tree will be:

1. 19
2. 20
3. 21
4. Can't be determined

An array x of 100 integers is declared as

1. int x = [100];
2. int x[100];
3. integer array x = 100;
4. integer x [] = 100;

An array is a group of ________ memory locations.

1. Scattered
2. Isolated
3. Random (non-consecutive)
4. Consecutive

What will be the value of root of an AVL and BST if built from the same data?

1. Same
2. Different in some cases
3. Root of AVL is square of root of BST
4. None of the given

If we use array to implement list, then there is an issue that it gives difficulty when:

1. We will access values randomly
2. We will remove data from it
3. We will increase its size
4. We will decrease its size

Consider we have performed the following operations on stack of size 5. Push(10);

Push(20); · Push(30); · Pop(); · Pop(); · Push(40);

1. 10
2. 20
3. 40
4. 20

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)?

1. 4 2 0
2. 0 2 4
3. 0 2
4. 2 4

To search an element in ALV tree, it takes maximum 1.88 Log2n time.

1. TRUE
2. FALSE
3. In some cases
4. None of the given

The ________ of a node in a binary tree is defined as the height of its left subtree minus height of its right subtree.

1. Height
2. Balance
3. Width
4. None of the above

for every process executing, the last part of the memory is for ________ of the program.

1. Data
2. Code
3. Stack
4. Heap