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

If there are 56 internal node in a binary tree then how many external nodes this binary tree will have ?

Question # 2

Suppose we have a hash table whose hash function is "n% 12",if the number 35 is already in the hash table which of the following numbers would cause a collision ?

Question # 3

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

Question # 4

Which one is a self-referential data type?

Question # 5

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

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

Question # 7

Consider a min heap, represented by the following array: 11,22,33,44,55 After inserting a node with value 66.Which of the following is the updated min heap?

Question # 8

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

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

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

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 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 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.
3 The definition of transitive property is
A. For all element x member of S, x R x
B. For all elements x and y, x R y if and only if y R x
C. For all elements x, y and z, if x R y and y R z then x R z
D. For all elements w, x, y and z, if x R y and w R z then x R z
4 Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?
A. 4,6,7,5
B. 6,7,5,4
C. 4,5,6,7
D. 4,6,5,7
5 Which of the following is NOT a correct statement about Table ADT.
A. n a table, the type of information in columns may be different. yes
B. A table consists of several columns, known as entities.
C. The row of a table is called a record.
D. A major use of table is in databases where we build and use tables for keeping information.
6 _____ only removes items in reserve order as they were entered
A. Stack
B. Queue
C. Both of these
D. None of these
7 Which of the following statement is NOT true about find operation :
A. It is not a requirement that a find operation returns any specific name, just that finds on two elements return the same answer if and only if they are in the same set.
B. One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can be used to name the set.
C. Initially each set contains one element.
D. initially each set contains one element and it does not make sense to make a tree of one node only.
8 In an array list the current element is
A. the first element
B. the middle element
C. the last element
D. The element where the current pointer points to
9 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
10 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.

Test Questions

Is this page helpful?