VU CS-301 Online Test Preparation

Online MCQ`s Test For Chapter 1 "CS-301 Final Term Exams Preparation Virtual University"

Try The MCQ`s Test For Chapter 1 "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

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?

Both x and y are still 0. A
Both x and y are still 0. B
x is still 0, but y is now 2. C
x is now 1, and y is now 2. D

Question # 2

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

22 A
23 B
48 C
25 D

Question # 3

Which of the following is a non linear data structure?

Linked List A
Stack B
Tree C
Queue D

Question # 4

Which of the following statement is NOT true about find operation :

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. A
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. B
Initially each set contains one element. C
initially each set contains one element and it does not make sense to make a tree of one node only. D

Question # 5

We are given N items to build a heap ,this can be done with ______ successive inserts.

N-1 A
N B
N+1 C
N+2 D

Question # 6

Consider a min heap, represented by the following array: 10,30,20,70,40,50,80,60 After inserting a node with value 31.Which of the following is the updated min heap?

10,30,20,31,40,50,80,60,70 A
10,30,20,70,40,50,80,60,31 B
10,31,20,30,40,50,80,60,31 C
31,10,30,20,70,40,50,80,60 D

Question # 7

A binary tree with 33 internal nodes has _______ links to internal nodes.

31 A
32 B
33 C
66 D

Question # 8

Consider the following paragraph with blanks. A …….…….. is a linear list where …………… and ………… take place at the same end . This end is called the …….………. What would be the correct filling the above blank positions?

(i) queue (ii) insertion (iii) removals (iv) top A
(i) stack (ii) insertion (iii) removals (iv) bottom B
(i) stack (ii) insertion (iii) removals (iv) top C
(i) tree (ii) insertion (iii) removals (iv) top D

Question # 9

Which one of the following is TRUE about recursion ?

Recursion extensively use stack memory A
Threaded Binary Trees use the concept of recursion. B
Recursive function calls consume a lot of memory. C
Iteration is more efficient than iteration. D

Question # 10

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

N+1, 2N, N-1 A
N+1, N-1, 2N B
2N, N-1, N+1 C
N-1, 2N, N+1 D

Submit

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

Set 1

10 Questions
Start
Set 2

10 Questions
Start
Set 3

10 Questions
Start
Set 4

10 Questions
Start
Set 5

10 Questions
Start
Set 6

10 Questions
Start
Set 7

10 Questions
Start
Set 8

10 Questions
Start
Set 9

10 Questions
Start
Set 10

10 Questions
Start
Set 11

10 Questions
Start
Set 12

10 Questions
Start
Set 13

10 Questions
Start

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

Online MCQ`s Test For Chapter 1 "CS-301 Final Term Exams Preparation Virtual University"

CS-301 Final Term Exams Preparation Virtual University

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?

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

Which of the following is a non linear data structure?

Which of the following statement is NOT true about find operation :

We are given N items to build a heap ,this can be done with ______ successive inserts.

Consider a min heap, represented by the following array: 10,30,20,70,40,50,80,60 After inserting a node with value 31.Which of the following is the updated min heap?

A binary tree with 33 internal nodes has _______ links to internal nodes.

Consider the following paragraph with blanks. A …….…….. is a linear list where …………… and ………… take place at the same end . This end is called the …….………. What would be the correct filling the above blank positions?

Which one of the following is TRUE about recursion ?

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

Prepare Complete Set Wise Chapter 1 "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

CS-301 Quiz Online Test

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

Test Questions

Is this page helpful?

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?

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