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

In an array we can store data elements of different types

Question # 2

Which of the following is not true regarding the maze generation ?

Question # 3

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

Question # 4

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

Question # 5

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

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

Question # 7

_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Question # 8

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

Question # 9

Every AVL is

Question # 10

In an array list the current element is

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 Merge sort and quicksort both fail into the same category of sorting algorithms,What is this category ?
A. O(nlogn) sorts
B. Interchange sort
C. Average time is quadratic
D. None of the given options.
2 We can build a heap in ________ time.
A. Linear
B. Exponential
C. Polynomial
D. None of the above
3 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
4 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.
5 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?
A. (i) queue (ii) insertion (iii) removals (iv) top
B. (i) stack (ii) insertion (iii) removals (iv) bottom
C. (i) stack (ii) insertion (iii) removals (iv) top
D. (i) tree (ii) insertion (iii) removals (iv) top
6 _____ only removes items in reserve order as they were entered
A. Stack
B. Queue
C. Both of these
D. None of these
7 Every AVL is
A. Binary tree
B. Complete tree
C. None of these
D. Binary Search tree
8 Which one of the following is NOT the property of equivalence relation
A. Reflexive
B. Symmetric
C. Transitive
D. Associative
9 By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time.
A. Binary tree only
B. Threaded binary tree
C. Heap data structure
D. Huffman encoding
10 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

Test Questions

Is this page helpful?

Share your comments & questions here

Guest

  • No comments yet. Be the first to comment!