VU PHY-101 Online Test Preparation

MCQ's Test For Chapter 1 "PHY-101 Quiz OnlineTest"

Try The MCQ's Test For Chapter 1 "PHY-101 Quiz OnlineTest"

  • Total Questions20

  • Time Allowed20

Start Test Download PDF

PHY-101 Quiz OnlineTest

00:00
Question # 1

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?

Question # 2

In case of deleting a node from AVL tree,rotation could be prolong to the root node.

Question # 3

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:

Question # 4

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

Question # 5

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

Question # 6

Which one is a self-referential data type?

Question # 7

Consider a min heap, represented by the following array: 11,22,33,44,55 After inserting a node with value 66.Which of the following is the updated min heap?

Question # 8

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

Question # 9

"+” is a _________operator.

Question # 10

The maximum number of external nodes for a binary tree of height H is

Question # 11

A binary tree with 24 internal node has ____ external node.

Question # 12

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

Question # 13

Merge sort and quicksort both fail into the same category of sorting algorithms,What is this category ?

Question # 14

Which of the following statement is correct?

Question # 15

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?

Question # 16

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

Question # 17

Which one of the following is TRUE about recursion ?

Question # 18

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

Question # 19

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

Question # 20

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

Submit

Prepare Complete Set Wise Chapter 1 "PHY-101 Quiz OnlineTest" MCQs Online With Answers


Topic Test

00:00
Submit

Top Scorers Of Chapter 1 "PHY-101 Quiz OnlineTest" MCQ`s Test

  • U
    Unknown 18 - Jan - 2024 00 Min 45 Sec 20/20
  • M
    Maheen Qaisar 31 - May - 2024 01 Min 02 Sec 17/20
  • K
    Khubaib Qaisar 30 - Jul - 2024 01 Min 01 Sec 13/20
  • I
    Izma Chughtai 10 - Dec - 2024 05 Min 23 Sec 11/20
  • J
    junaid wali 13 - Jul - 2024 05 Min 57 Sec 11/20
  • M
    Muhammad Zain 23 - Feb - 2024 02 Min 47 Sec 10/20
  • Z
    Zain 19 - Dec - 2024 04 Min 19 Sec 9/20
  • A
    Ayman amn 26 - May - 2024 09 Min 14 Sec 9/20
  • K
    khazima naveed 16 - Feb - 2024 01 Min 51 Sec 8/20
  • M
    Madiha Najeeb 15 - Dec - 2024 03 Min 28 Sec 8/20
  • R
    Rabia Adrees 20 - Jul - 2024 03 Min 58 Sec 8/20
  • Z
    Zain 07 - Feb - 2024 07 Min 05 Sec 8/20
  • S
    Safa Marwa 08 - Dec - 2024 02 Min 11 Sec 7/20
  • M
    Mian Uzair 04 - Dec - 2024 04 Min 56 Sec 7/20
  • A
    Ali Hassnain Azmat 04 - Dec - 2024 06 Min 05 Sec 7/20

Virtual University CS-301 Chapter 1 Important MCQ's

Sr.# Question Answer
1 A binary tree with 33 internal nodes has _______ links to internal nodes.
A. 31
B. 32
C. 33
D. 66
2 Consider the following postfix expression S and the initial values of the variable,
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?
A. 1
B. 2
C. 0
D. -1
3 Binary Search is an algorithm of searching ,used with the ____ data .
A. Sorted
B. Unsorted
C. Heterogeneous
D. Heterogeneous
4 In a perfectly balanced tree the insertion of a node needs ________ .
A. One rotation
B. Two rotations
C. Rotations equal to number of levels
D. No rotation at all
5 Use of binary tree in compression of data is known as _______
A. Traversal
B. Heap
C. Union
D. Huffman encoding
6 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?
A. Neither changes
B. only front pointer charges
C. Only rear pointer changes.
D. 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.
7 Which of the following statement is correct?
A. 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.
B. 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.
C. 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.
D. 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.
8 Merge sort and quicksort both fail into the same category of sorting algorithms,What is this category ?
A. O(nlogn) sorts
B. Interchange sort
C. Average time is quadratic
D. None of the given options.
9 The arguments passed to a function should match in number, type and order with the parameters in the function definition.
A. True
B. False
C. both
10 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 ____________
A. the first occurrence of a value.
B. the second occurrence of a value
C. may find first or second occurrence of a value.
D. None of the given options

Test Questions

Is this page helpful?