cs301 Final Term Current Paper spring 2021

Cs301
10 mcq from Past papers 10 from handouts vaki conceptual thy
5 marks ka insertion sort ka code in c++
5 marks ka Tree tha usko balance krna tha after deleted root node
3 marks nlog2n vala tha us k points btany thy
3 marks ka tree tha array representation btani thy baki conceptual paper tha na file sy tha na handouts sy

 Today's CS301 paper at 7:30 A.M
Mostly from past papers 38 questions.. 30 mcqs 4 questions 3 marks and 4 questions 5 marks.
Topics include:
AVL tree
Binary search tree
Heap
Huffman encoding
Pseudo code for maze game
Infix 
Arrays, dynamic array
Priority queue
Traversal algorithm
Complete, perfect binary tree

Today's CS301 paper at 7:30 A.M
Mostly from past papers 38 questions.. 30 mcqs 4 questions 3 marks and 4 questions 5 marks.
Topics include:
AVL tree
Binary search tree
Heap
Huffman encoding
Pseudo code for maze game
Infix 
Arrays, dynamic array
Priority queue
Traversal algorithm
Complete, perfect binary tree