VU CS-301 Online Test Preparation

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	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 __________ successor	A. levelorder B. Preorder C. Inorder D. Postorder
2	The definition of Transitivity 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
3	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?	A. N-1 B. N C. N+1 D. N+2
4	In complete binary tree the bottom level is filled from________	A. Left to right B. Right to left C. Not filled at all D. None of the given option
5	Compiler uses which one of the following to evaluate a mathematical equation	A. Binary Tree B. Binary Search Tree C. Parse Tree D. AVL Tree
6	In case of deleting a node from AVL tree,rotation could be prolong to the root node.	A. yes B. no C. not sure
7	In a selection sort of n element ,how many times the swap function is called the execution of the algorithm?	A. n-1 B. 0 C. n log n D. 1
8	While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.	A. Equal to the small frequency B. Equal to the greater C. Equal to the sum of the two frequencies D. Equal to the difference of the two frequencies
9	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.
10	Double link list is always has one NULL pointer	A. True B. False C. Not Sure

Latest Educational News Stories

Pakistan's Largest Database of Colleges and Universities

BS Programs

University Past Papers

University Results

Exam Results 2024

Study Abroad Programs and Opportunities for Pakistani Students

VU CS-301 Online Test Preparation

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

CS-301 Final Term Exams Preparation Virtual University

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

A complete binary tree of height ___ has node between 16 to 31.

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.

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?

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

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

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

The definition of transitive property is

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?

Which of the following method is helpful in creating the heap at once?

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

Set 1

Set 2

Set 3

Set 4

Set 5

Set 6

Set 7

Set 8

Set 9

Set 10

Set 11

Set 12

Set 13

Topic Test

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

Virtual University CS-301 Chapter 1 Important MCQ's

Test Questions

Share your comments & questions here

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?