CS301 Current Paper For Final Term

by

Today’s Current Paper of CS301

By VU HELP FORUM

August 17, 2023

MCQs:

Most are from Mooaz File and some are from handout

Short Questions:

  1. Delete the head node from the min heap and write the updated min heap
  2. Why disjoint tree are always ……..up?
  3. What is the worst case of selection and bubble sport algorithm?
  4. Answers the following
  5. If there are 33 external nodes than how many internal nodes are?
  6. If there are 40 internal nodes then how many external nodes are?
Also Read:  Cs101 today final term paper

5.AVL tree related

6……………………..

Long Questions:

  1. Make the parse tree of the following

(f+(a*b))

2.Delete the 10(head) node from minimum heap

And update the heap(tree is given)

3.put the values(11,29,22,36,7) in the hash table while h(x)=(x*2)/table size

Make the separate …..after handling collision.

4.How many pairs of set{a1,a2,a3,a4,a5} can     be made up. Suppose first is the name of Person, Second is the name Pixel, third is the electricity intensity. Also give the array order.

Also Read:  Mth301 today final term paper aug

Leave a Comment