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

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

Question # 2

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

Question # 3

Which of the given option is NOT a factor in Union by Size:

Question # 4

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

Question # 5

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

Question # 6

In an array list the current element is

Question # 7

A simple sorting algorithm like selection sort or bubble sort have a wrostcase of

Question # 8

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

Question # 9

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

Question # 10

Which of the following is a non linear data structure?

Question # 11

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

Question # 12

Which of the following statement is true about dummy node of threaded binary tree

Question # 13

If both pointers of the node in a binary trees are NULL then it will be a___

Question # 14

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

Question # 15

A binary tree with N internal nodes has ____ links ,links to internal node and ____links to external

Question # 16

By using _____ we avoid recursive method of traversing a tree,which makes use of stacks and consumes a lot of memory and time.

Question # 17

If there are N internal nodes in a binary tree then what will be the number of the no,of external node in the binary tree?

Question # 18

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

Question # 19

Which one of the following is TRUE about recursion ?

Question # 20

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

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 If numbers 5,222,4,48 are inserted in queue,which one will be removed first?
A. 48
B. 4
C. 222
D. 5
2 In an array we can store data elements of different types
A. True
B. False
C. Not sure
3 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
A. Heap sort
B. Selection sort
C. Insertion sort
D. Bubble sort
4 A binary tree of N nodes has _____
A. Log10N Levels
B. Log2 N levels
C. N/2 Levels
D. N X2 Levels
5 Consider the following infix expression: x – y * a + b / c Which of the following is a correct equivalent expression(s) for the above?
A. x y -a * b +c /
B. x *y a - b c / +
C. x y a * - b c / +
D. x y a * - b/ + c
6 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
7 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?
A. (i) queue (ii) insertion (iii) removals (iv) top
B. (i) stack (ii) insertion (iii) removals (iv) bottom
C. (i) stack (ii) insertion (iii) removals (iv) top
D. (i) tree (ii) insertion (iii) removals (iv) top
8 Which of the given option is NOT a factor in Union by Size:
A. Maintain sizes (number of nodes) of all trees, and during union.
B. Make smaller tree, the subtree of the larger one
C. Make the larger tree, the subtree of the smaller one.
D. 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
9 Which of the following statement is NOT true about find operation :
A. 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.
B. 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.
C. Initially each set contains one element.
D. initially each set contains one element and it does not make sense to make a tree of one node only.
10 A binary tree with 24 internal node has ____ external node.
A. 22
B. 23
C. 48
D. 25

Test Questions

Is this page helpful?