CS301 Final Term Current Paper by Adil Alvi

Cs301 current final term paper

Date = 21-09-2021

10 Mcqs were from past paper. Remaining other were new.

1. If we make a Boolean matrix for 100 items, its size will be.

•  10
•  100
•  1000
•  10000

2. The first case is that the parent of the deleted node had a balance of _____ and the node was deleted in the parent’s left subtree.

•  0
•  1
•  2
•  3

3. 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 in order successor

•  Threaded binary tree
•  Val tree
•  Binary tree
•  Binary search tree

Subjective.

Q1. If a tree has 23 internal node then how many?

i) Internal links. ii) External nodes. iii) External links

Q2. When hashing is suitable?

3. Threshold scheme was given 5 you have two separate two colors red and green.

Q4. When we use formula of 2i and 2i +1? And when we sorting element in array why we starting from 1 why not 0?

5. Write infix form of given tree.