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

I have implemented the queue with a circular array. If data is a circular array of CAPACITY elements, and last is an index into that array, what is the formula for the index after last?

Question # 2

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

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)?

Question # 4

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

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

Question # 6

If numbers 5,222,4,48 are inserted in queue,which one will be removed first?

Question # 7

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

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

"+” is a _________operator.

Question # 10

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

Question # 11

Here is a small function definition: void f(int i, int &k) { i = 1; k = 2; } Suppose that a main program has two integer variables x and y, which are given the value 0. Then the main program calls f(x,y); What are the values of x and y after the function f finishes?

Question # 12

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

Question # 13

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

Question # 14

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).

Question # 15

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

Question # 16

Binary Search is an algorithm of searching ,used with the ____ data .

Question # 17

Huffman encoding uses _________ tree to develop codes of varying lengths for the letters used in the original message

Question # 18

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

Question # 19

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

Question # 20

If a complete binary tree has height h then its no. of nodes will be,

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 _________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.
A. Array ()
B. List
C. Both of these
D. None of these
2 If there are 56 internal node in a binary tree then how many external nodes this binary tree will have ?
A. 54
B. 55
C. 56
D. 57
3 Binary Search is an algorithm of searching ,used with the ____ data .
A. Sorted
B. Unsorted
C. Heterogeneous
D. Heterogeneous
4 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.
A. Array
B. List
C. Both
D. None of the above
5 A complete binary tree of height ___ has node between 16 to 31.
A. 2
B. 3
C. 4
D. 5
6 Which of the following statement is true about dummy node of threaded binary tree
A. The left pointer of dummy node points to the itself while the right pointer points to the root of tree.
B. The left pointer of dummy node points to the root node of the tree while the right pointer points itself i.e. to dummy node
C. The left pointer of dummy node points to the root node of the tree while the right pointer is always NULL
D. The right pointer of dummy node points to the itself while the left pointer is always NULL
7 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:
A. 7 6 5 4 3 2 1
B. 7 3 6 2 1 4 5
C. 7 6 4 3 5 2 1
D. 7 3 6 4 2 5 1
8 Every AVL is
A. Binary tree
B. Complete tree
C. None of these
D. Binary Search tree
9 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.
10 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?
A. The pivot could be either the 7 or the 9
B. The pivot could be the 7, but it is not the 9.
C. The pivot is not the 7, but it could be the 9.
D. Neither the 7 nor the 9 is the pivot.

Test Questions

Share your comments & questions here

Guest

  • No comments yet. Be the first to comment!