# CS301 Final Term Past Paper

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2020

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

CS301 Final Term Past Paper

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2020

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

*Good luck *

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2020

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

1- lef or non leaf child btana?

2- algorithm 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.....

Cs301.....

Best regards...

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2020

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

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2020

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?

Q.4hight of nodes if hight is 5?

Q.6 [2 9 7 5 8] sort it.

Q.7 ik tree tha osko array mn conert krna tha.

Q8.crictristics of union method

Mostly mcqs and questions are from moazz files.

#### cs301 final term past papers

Download### VU Subjects Available List

Available Subjects List### Join Chat Room

Join Chat### Join our FB Group For VU help

Join VU Group#### CS301 Final term MCQs Test Online 1

Take a Test 1#### CS301 Final term MCQs Test Online 2

Take a Test 2#### CS301 Final term MCQs Test Online 3

Take a Test 3#### CS301 Final term MCQs Test Online 4

Take a Test 4#### CS301 Final term MCQs Test Online 5

Take a Test 5#### CS301 Final term MCQs Test Online 6

Take a Test 6#### CS301 Final term MCQs Test Online 7

Take a Test 7#### CS301 Final term MCQs Test Online 8

Take a Test 8#### CS301 Final term MCQs Test Online 9

Take a Test 9#### CS301 Final term MCQs Test Online 10

Take a Test 10#### cs301 Final Term Paper Shared by Student

cs301 current paper 2020

75 % Tak Moaz Ki File say MCQS thy

4 Tree K Question thy. Heap Property hy ya Ni.

2 Code Mistake Nikalni Thi

Aik Transitivity Function Ki Definition ko Prove krna tha

K x R y iff y R x

Skipp List S0 say S3 Draw Krni thi

Or Or Hashing Or uski Example bs

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2020

Cs301 mostly from past papers 80 percent almost objective and subjective

Maza generation

Code maza generation

Output find

Min heap

Huffman coding

Dynamic equivalence problem

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2020

1.Find leaf and non leaf node of tree of depth 7.

2.find sum of height of tree have level 5.

3.Discuss two cases in which hashing is not suitable.

4.Write names of six basic operation of BST.

5.write steps of level order traversing.

6.Draw a balanced AVL tree after inserting a node.

7.Aik theorem proof karna tha.

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2019

Mcqs mostly from past papers

subjective.

1.Application of Hashing

2.Transitivity relationship

3.Deleta a node from max heap and draw again.

4.Frequency table

5.Program given and write about variable

6.bubble sort after two iterations. 5 Marks

7.Threded binary tree given and for one node write its four varaibles values

a.left flag

B.Right flag

C.left pointer node.

D.Right pointer node.

5 Marks

8. AVL tree after deleting one node draw Balance tree. 5 marks

9.For furniture selling compay to customer s write

a) What are basic operation must select for the databese system

b)On what basic points the data structure is select for this company. 5 Marks

10.Write and Explain Union and Find operation for Dynamic Equivalence Problem

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2019

90% objective from Past papers...

50% Subjective from Past papers

Some Subjective Questions are below

1) Construct BST ( binary search tree )

2) Equliance Relation

3) Expression tress

4) AVL tree

5) convert linked list into BST

6) Find MIN Heap

7) Describe 2i , 2i+1

#### cs301 Final Term Paper Shared by Student

cs301 current paper 2019

Short question

Which data structure is used in Huffman encoding.

Characteristics of union by size methode

Characteristics of skip list

A minh heap tree fig( delete the top value ) re construct it

A ALV tree delete top value then re construct it

Difference between binary tree and binary search tree

A perfect binary tree have h hight then prove that

2 power k+1 _ 1 node ………

MCQ 18 t0 20 from old papers out of 40

## Leave a comment