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

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?

Question # 2

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 ____________

Question # 3

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

Question # 4

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:

Question # 5

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

Question # 6

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

Question # 7

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 # 8

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

Question # 9

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

Question # 10

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?

Question # 11

Which of the following statement is correct?

Question # 12

Which of the following statements is correct property of binary trees?

Question # 13

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

Question # 14

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?

Question # 15

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?

Question # 16

A queen is a data structure where elements are,

Question # 17

The definition of Transitivity property is

Question # 18

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

Question # 19

Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?

Question # 20

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

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 kind of expression where the operator is present between two operands called ________ expressions .
A. Postfix
B. Infix
C. Prefix
D. None of the above
2 If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is _______ .
A. N
B. N2
C. Nlog2N
D. log2N
3 Double link list is always has one NULL pointer
A. True
B. False
C. Not Sure
4 Which one of the following is TRUE about recursion ?
A. Recursion extensively use stack memory
B. Threaded Binary Trees use the concept of recursion.
C. Recursive function calls consume a lot of memory.
D. Iteration is more efficient than iteration.
5 Which one of the following is TRUE about iteration?
A. Iteration extensively uses stack memory
B. Threaded Binary Trees use the concept of iteration.
C. Iterative function calls consumes a lot of memory.
D. Recursion is more efficient than iteration.
6 Which of the following statement is NOT true about threaded binary tree?
A. Right thread of the right-most node points to the dummy node
B. Left thread of the left-most node points to the dummy node.
C. The left pointer of dummy node points to the root node of the tree
D. Left thread of the right-most node points to the dummy node.
7 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.
8 If a complete binary tree has height h then its no. of nodes will be,
A. Log (h)
B. 2h+1 - 1
C. Log (h) - 1
D. 2h - 1
9 If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a
A. Expression tree
B. threaded binary tree
C. complete binary tree
D. perfectly complete binary tree
10 Which of the following is not true regarding the maze generation ?
A. Randomly remove walls until the entrance and exit cells are in same set
B. Removing a wall is the same as doing union of operation
C. Removing a randomly chosen wall if the cell is separatedare already in the same set
D. Do not remove a randomly chosen wall if the cells it separates are already in the same set.

Test Questions

Share your comments & questions here

  • No comments yet. Be the first to comment!

Is this page helpful?