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 N internal nodes has ____ links ,links to internal node and ____links to external

Question # 2

Suppose currentNode refers to a node in a linked list(using the Node class with member variables called data and next node),What statement changes currentNode so that it refers to the next node?

Question # 3

While building Huffman encoding tree the new node that is the result of joining two nodes has the frequency.

Question # 4

What requirement is placed on an array, so that binary search may be used to locate an entry?

Question # 5

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?

Question # 6

Let heap stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root of the heap contains the maximum element. What is the result of deleting 40 from this heap

Question # 7

it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.

Question # 8

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

Question # 9

Consider the following infix expression: x – y * a + b / c Which of the following is a correct equivalent expression(s) for the above?

Question # 10

Which one of the following is NOT the property of equivalence relation

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 _________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.
A. Array ()
B. List
C. Both of these
D. None of these
2 If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?
A. Data[0]
B. data[1]
C. data[n-1]
D. data[n]
3 A simple sorting algorithm like selection sort or bubble sort have a wrostcase of
A. O(1) time because all lists take the same amount of time to sort
B. O(n) time because it has to perform n swaps to order the list.
C. O(n2 ) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these algorithms can guarantee that 1 element is sorted.
D. O(n3 ) time, because the worst case has really random input which takes longer to sort.
4 While joining nodes in the building of Huffman encoding tree if there are more nodes with same frequency, we choose the nodes _______.
A. Randomly
B. That occur first in the text message
C. That are lexically smaller among others
D. That are lexically greater among others
5 Every AVL is
A. Binary tree
B. Complete tree
C. None of these
D. Binary Search tree
6 A queen is a data structure where elements are,
A. inserted at the front and removed from the back
B. inserted and removed from the top.
C. inserted at the back and removed from the front.
D. inserted and removed from both ends.
7 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
8 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
9 If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a
A. Expression tree
B. threaded binary tree
C. complete binary tree
D. perfectly complete binary tree
10 What is the formula of approixation for the depth of a heap with n nodes?
A. log (base 2) of n
B. The number of digits in n (base 10 )e,g 145 has three digit
C. The square root of n
D. n

Test Questions

Share your comments & questions here

Guest

  • No comments yet. Be the first to comment!