VU PHY-101 Online Test Preparation

PHY-101 Quiz OnlineTest

Try the PHY-101 Quiz OnlineTest.

Total Questions20
Time Allowed20

Start Test

PHY-101 Quiz OnlineTest

00:00

Question # 1

_____ only removes items in reserve order as they were entered

Stack A
Queue B
Both of these C
None of these D

Question # 2

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

8 to 14 A
8 to 15 B
8 to 16 C
8 to 17 D

Question # 3

Every AVL is

Binary tree A
Complete tree B
None of these C
Binary Search tree D

Question # 4

Which of the following statement is NOT true 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. A
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. B
Initially each set contains one element. C
initially each set contains one element and it does not make sense to make a tree of one node only. D

Question # 5

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

Remove A
Next B
Start C
Back D

Question # 6

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

Question # 7

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 A
only front pointer charges B
Only rear pointer changes. C
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. D

Question # 8

Suppose we have 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 A
145 B
143 C
148 D

Question # 9

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

Equal to the small frequency A
Equal to the greater B
Equal to the sum of the two frequencies C
Equal to the difference of the two frequencies D

Question # 10

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] A
data[1] B
data[n-1] C
data[n] D

Question # 11

Consider a min heap, represented by the following array: 3,4,6,7,5,10 After inserting a node with value 1.Which of the following is the updated min heap?

3,4,6,7,5,10,1 A
3,4,6,7,5,1,10 B
3,4,1,5,7,10,6 C
1,4,3,5,7,10,6close to correct but correct ans is 1,4,3,7,5,10,6 D

Question # 12

A complete binary tree us a tree that is ___ filled with the possible exception of the bottom level.

partially A
completely B
incompletely C
partly D

Question # 13

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. A
x is now 1 but y is still 0 B
x is still 0,but y is now 2 C
x is now1 1 and y is now 2 D

Question # 14

Consider the following paragraph with blanks. A …….…….. is a linear list where …………… and ………… take place at the same end . This end is called the …….………. What would be the correct filling the above blank positions?

(i) queue (ii) insertion (iii) removals (iv) top A
(i) stack (ii) insertion (iii) removals (iv) bottom B
(i) stack (ii) insertion (iii) removals (iv) top C
(i) tree (ii) insertion (iii) removals (iv) top D

Question # 15

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

Array () A
List B
Both of these C
None of these D

Question # 16

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 A
41 B
42 C
53 D

Question # 17

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. A
The pivot could be the 7, but it is not the 9. B
The pivot is not the 7, but it could be the 9 C
Neither the 7 nor the 9 is the pivot. D

Question # 18

What is the formula of approixation for the depth of a heap with n nodes?

log (base 2) of n A
The number of digits in n (base 10 )e,g 145 has three digit B
The square root of n C
n D

Question # 19

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

Postfix A
Infix B
Prefix C
None of the above D

Question # 20

Double link list is always has one NULL pointer

True A
False B
Not Sure C

Submit

Prepare All PHY-101 Quiz OnlineTest MCQs With Answers

Set 1

20 Questions
Start
Set 2

20 Questions
Start
Set 3

20 Questions
Start
Set 4

20 Questions
Start
Set 5

20 Questions
Start
Set 6

20 Questions
Start
Set 7

20 Questions
Start

Latest Educational News Stories

Pakistan's Largest Database of Colleges and Universities

BS Programs

University Past Papers

University Results

Exam Results 2024

Study Abroad Programs and Opportunities for Pakistani Students

VU PHY-101 Online Test Preparation

PHY-101 Quiz OnlineTest

PHY-101 Quiz OnlineTest

PHY-101 Quiz OnlineTest

_____ only removes items in reserve order as they were entered

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

Every AVL is

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

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

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

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?

Suppose we have 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 ?

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

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?

Consider a min heap, represented by the following array: 3,4,6,7,5,10 After inserting a node with value 1.Which of the following is the updated min heap?

A complete binary tree us a tree that is ___ filled with the possible exception of the bottom level.

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?

Consider the following paragraph with blanks. A …….…….. is a linear list where …………… and ………… take place at the same end . This end is called the …….………. What would be the correct filling the above blank positions?

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

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

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 this2 5 1 7 9 12 11 10Which statement is correct?

What is the formula of approixation for the depth of a heap with n nodes?

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

Double link list is always has one NULL pointer

Prepare All PHY-101 Quiz OnlineTest MCQs With Answers

Set 1

Set 2

Set 3

Set 4

Set 5

Set 6

Set 7

Top Scorers of PHY-101 Quiz OnlineTest

Test Questions

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?