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 queen is a data structure where elements are,

Question # 2

The definition of Transitivity property is

Question # 3

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

Question # 4

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

Which of the following heap method increase the value of key at position „p‟ by the amount „delta‟?

Question # 6

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

Question # 7

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

Question # 8

Which formula is the best approximation for the depth of a heap with n nodes?

Question # 9

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

Which one of the following is NOT the property of equivalence relation

Question # 11

Which of the following is not true regarding the maze generation ?

Question # 12

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

Question # 13

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

If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure to use.

Question # 15

Searching of an element in an AVL tree take minimum ____ time (where n is number of nodes in AVL tree)

Question # 16

Consider the following infix expression: x – y * a + b / c Which of the following is a correct equivalent expression(s) for the above?

Question # 17

If there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

Question # 18

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

Question # 19

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

Question # 20

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?

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 The difference between the binary tree and a binary search tree is that:
A. a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node
B. in binary search tree nodes are inserted based on the values they contain
C. in binary tree nodes are inserted based on the values they contain
D. none of these
2 A simple sorting algorithm like selection sort or bubble sort have a wrostcase of
A. O(1) time because all lists take the same amount of time to sort
B. O(n) time because it has to perform n swaps to order the list.
C. O(n2 ) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these algorithms can guarantee that 1 element is sorted.
D. O(n3 ) time, because the worst case has really random input which takes longer to sort.
3 We can build a heap in ________ time.
A. Linear
B. Exponential
C. Polynomial
D. None of the above
4 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.
5 If numbers 5,222,4,48 are inserted in queue,which one will be removed first?
A. 48
B. 4
C. 222
D. 5
6 There is/are ________ case/s for rotation in an AVL tree,
A. 1
B. 2
C. 3
D. 4
7 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)?
A. 21
B. 41
C. 42
D. 53
8 Searching of an element in an AVL tree take minimum ____ time (where n is number of nodes in AVL tree)
A. Log2(n+1)
B. Log2(n+1) -1
C. 1.44 Log2n
D. 1.66 Log2n
9 Union is a ___________ time operation
A. Constant
B. Polynomial
C. Exponential
D. None of the above
10 In sequential access data structure ,accessing any element in the data structure takes different amount of time.Tell which one of the following is sequential access data structure.
A. Arrays
B. Lists
C. Both of these
D. None of these

Test Questions

Is this page helpful?

Share your comments & questions here

Guest

  • No comments yet. Be the first to comment!