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 binary tree with 24 internal node has ____ external node.

Question # 2

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

Question # 3

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

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

Question # 5

The difference between the binary tree and a binary search tree is that:

Question # 6

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

Question # 7

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

Question # 8

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

Question # 9

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.

Question # 10

_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Question # 11

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

Question # 12

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

Question # 13

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

Question # 14

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

Question # 15

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

Question # 16

Which of the following statement is correct?

Question # 17

A queen is a data structure where elements are,

Question # 18

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

Question # 19

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

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

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 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.
2 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:
A. 16, 18, 20, 22, 24, 28, 30
B. 16, 20, 18, 24, 22, 30, 28
C. 16, 24, 18, 28, 30, 20, 22
D. 16, 24, 20, 30, 28, 18, 22
3 If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?
A. 54
B. 55
C. 56
D. 57
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 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
6 Huffman encoding uses _________ tree to develop codes of varying lengths for the letters used in the original message
A. Linked List
B. Stack
C. Queue
D. Binary tree
7 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
8 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
9 A binary tree with N internal nodes has _____ links, _______ links to internal nodes and ________ links to external nodes
A. N+1, 2N, N-1
B. N+1, N-1, 2N
C. 2N, N-1, N+1
D. N-1, 2N, N+1
10 Which of the following method is helpful in creating the heap at once?
A. insert
B. add
C. update
D. preculateDown

Test Questions

Share your comments & questions here

Guest

  • No comments yet. Be the first to comment!