VU CS-301 Online Test Preparation

MCQ's Test For CS-301 Final Term Exams Preparation Virtual University

Try The MCQ's Test For CS-301 Final Term Exams Preparation Virtual University

  • Total Questions10

  • Time Allowed10

Start Test Download PDF

CS-301 Final Term Exams Preparation Virtual University

00:00
Question # 1

A binary tree with 24 internal node has ____ external node.

Question # 2

I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?

Question # 3

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

Question # 4

Consider the following postfix expression S and the initial values of the variable,
S = A B - C + D E F - + ^ Assume that A=3, B=2, C=1, D=1, E=2, F=3 What would be the final output of the stack?

Question # 5

A binary tree of N nodes has _____

Question # 6

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

Question # 7

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

Question # 8

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

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

Which of the following statement is NOT correct?

Submit

Prepare Complete Set Wise CS-301 Final Term Exams Preparation Virtual University MCQs Online With Answers


Topic Test

00:00
Submit

Top Scorers Of CS-301 Final Term Exams Preparation Virtual University MCQ`s Test

  • T
    Tahira Nawaz 26 - Feb - 2023 00 Min 02 Sec 10/10
  • Q
    Qudsia fatima 11 - Feb - 2024 00 Min 35 Sec 10/10
  • J
    Jehanzaib khalil 15 - Aug - 2023 00 Min 48 Sec 10/10
  • E
    Eiza Munawar 22 - Sep - 2022 01 Min 07 Sec 10/10
  • S
    Shabnam Irshad 17 - Aug - 2023 01 Min 18 Sec 10/10
  • A
    Ayesha javaid 02 - Mar - 2023 01 Min 24 Sec 10/10
  • S
    Sana Riaz 11 - Feb - 2024 01 Min 26 Sec 10/10
  • A
    Ayesha Butt 31 - May - 2024 01 Min 46 Sec 10/10
  • U
    Uzair sajid 18 - Feb - 2024 02 Min 12 Sec 10/10
  • R
    Rubab Irfan 22 - Sep - 2022 01 Min 09 Sec 9/10
  • R
    Rabani baloch 07 - Jun - 2024 01 Min 19 Sec 9/10
  • B
    bc210402145 MOHTASHAM JAVED 15 - Aug - 2023 01 Min 44 Sec 9/10
  • A
    Asif Iqbal 15 - Feb - 2024 01 Min 49 Sec 9/10
  • M
    Mehwish Khan 04 - Mar - 2023 02 Min 26 Sec 8/10
  • U
    U Shop 4 All 04 - Oct - 2022 02 Min 37 Sec 8/10

Virtual University CS-301 Chapter 1 Important MCQ's

Sr.# Question Answer
1 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. Nlog2 n
D. log2N
2 Which of the following is a property of binary tree?
A. A binary tree of N external nodes has N internal node.
B. A binary tree of N internal nodes has N+ 1 external node
C. A binary tree of N external nodes has N+ 1 internal node
D. A binary tree of N internal nodes has N- 1 external node.
3 A binary tree with 33 internal nodes has _______ links to internal nodes.
A. 31
B. 32
C. 33
D. 66
4 A binary relation R over S is called an equivalence relation if it has following property(s)
A. Reflexivity
B. Symmetry
C. Transitivity
D. All of the given options
5 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
6 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
7 In a min heap , preculateDown procedure will move smaller value______ and bigger value______.
A. left,right
B. right,left
C. up,down
D. down,up
8 We are given N items to build a heap ,this can be done with ______ successive inserts.
A. N-1
B. N
C. N+1
D. N+2
9 A complete binary tree of height 3 has between _____ node
A. 8-14
B. 8-15
C. 8-16
D. 8-17
10 Which of the following is not an example of equivalence relation:
A. Electrical Connectivity
B. Set of people
C. <= relation
D. Set of pixels

Test Questions

Share your comments & questions here

  • No comments yet. Be the first to comment!

Is this page helpful?