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

A complete binary tree of height ___ has node between 16 to 31.

Question # 2

In an array we can store data elements of different types

Question # 3

Every AVL is

Question # 4

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

Question # 5

Which of the following method is helpful in creating the heap at once?

Question # 6

Which of the following statement is NOT true about threaded binary tree?

Question # 7

Which of the following algorithm is most widely used due to its good average time

Question # 8

In a perfectly balanced tree the insertion of a node needs ________ .

Question # 9

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?

Question # 10

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

Question # 11

In a selection sort of n element ,how many times the swap function is called the execution of the algorithm?

Question # 12

Which of the following is NOT a correct statement about Table ADT.

Question # 13

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

Question # 14

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

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

Question # 16

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

Question # 17

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

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

Question # 19

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

Question # 20

If there are N elements in an array then the number of maximum steps needed to find an elements 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 Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest).
A. 0 3 8 9 1 7 5 2 6 4
B. 2 6 4 0 3 8 9 1 7 5
C. 2 6 4 9 1 7 0 3 8 5
D. 0 3 8 2 6 4 9 1 7 5
2 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?
A. N-1
B. N
C. N+1
D. N+2
3 Binary Search is an algorithm of searching ,used with the ____ data .
A. Sorted
B. Unsorted
C. Heterogeneous
D. Heterogeneous
4 it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.
A. Variable
B. Constant
C. Inconsistent
D. None of the above
5 A complete binary tree of height 3 has between _____ node
A. 8-14
B. 8-15
C. 8-16
D. 8-17
6 While joining nodes in the building of Huffman encoding tree if there are more nodes with same frequency, we choose the nodes _______.
A. Randomly
B. That occur first in the text message
C. That are lexically smaller among others
D. That are lexically greater among others
7 A complete binary tree of height ___ has node between 16 to 31.
A. 2
B. 3
C. 4
D. 5
8 Union is a ___________ time operation
A. Constant
B. Polynomial
C. Exponential
D. None of the above
9 Select the FALSE statement binary tree.
A. Every binary tree has at least one node.
B. Every non-empty tree has exactly one root node.
C. Every node has at most two children.
D. Every non-root node has exactly one parent.
10 Consider te following array 23 15 5 12 40 10 7 After the first pass of a particular algorithm, the array looks like 15 12 23 10 7 40 Name the algorithm used
A. Heap sort
B. Selection sort
C. insertion sort
D. Bubble sort

Test Questions