CS301 Final Term Current Papers 2018-2020

CS301 Current Final Term Papers 2018 To 2020 2020 Paper 1

85% mcqs past se thee Heap ke bare me questions thee Hashing algorithm Work of heap sorting data But mostly tree bnana thee 45 leacture me se 2 questions the Ek 43 the me se tha Ek question binary search algorithm me se tha means 39 leacture Collision kiya leacture No 41 me se tha And leacture 43 me LogN2 wale question 1 tha r 5 mcqs thee

Paper 2

Mcqs are mostly from past papers and some of 'em are conceptual Subjective Delete from min heap Huffman coding find the value the given bit values A code is given we have to find the output A question from insertion sort Three uses of Hash function Equivalence property Two questions are related to this Get() and update() syntax

Paper 3

Mcqs 25 waqqr siddu file Subjective long me 1-question build heap program code likhna? 2 -question program me mistake mention kary? 3 - Tree dya tha expression likhna ? Short question 1lef or non leaf child btana? 2algorithm ke 2 elementary charters ? 3--dept thi thi nodes btana 7 Sorting algorithms Delete min()function Mcqs 25 waqaar file past papers Subjective me kuch ni aaya past file se.....

Paper 4

Mcq moaz and waqar past papers sy 65% the Code diya h array ka valid invalid btana tha 3 mrks Hashing and example 3 mrks Stack ka push or pop code write Disjoint and boolean konsa batter h 5mrks Array ki value di thi uska max heap diagram bnani thi 5mrks Diagram di thi A,b,c,d,e uska Huffman code likhna tha 5mrks

Paper 5

Q1. biner tree bnawa tha OS k levels btao.

Q2. carictrics of avl tree.

Q3. if node leaf and non leafe in binry tree then what the hight of tree of its depth is 7?

Q4. hight of nodes if hight is 5?

Q6. [2 9 7 5 8] sort it.

Q7. ik tree tha osko array mn conert krna tha.

Q8. crictristics of union method

Mostly mcqs and questions are from moazz files.

2019 Paper 1

Cs301 Today paper

Q1. biner tree bnawa tha OS k levels btao.

Q2. carictrics of avl tree.

Q3. if node leaf and non leafe in binry tree then what the hight of tree of its depth is 7?

Q4. hight of nodes if hight is 5?

Q6. [2 9 7 5 8] sort it.

Q7. ik tree tha osko array mn conert krna tha.

Q8. crictristics of union method

Mostly mcqs and questions are from moazz files.

Paper 2

Cs301 today papr Maze generation Parse tree of givn expression Insertion of 4 nodes in the min heap Insertion of givn values in the hash table using expression Weight method