Cs301 today final papers

 

[17/09, 10:11 PM] Usama: 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?

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.

[17/09, 10:11 PM] Usama: Today my cs301 paper

   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

[17/09, 10:11 PM] Usama: 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?

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.

[17/09, 10:11 PM] Usama: Today cs 301 paper 2:30 pm

Mostly questions and mcqs from past papers moazz file 

Characteristics of AVL tree

How can we say that a relation is a equivalence relation.

Ek tree given tha us ka balance factor btana tha r ye btana tha k wo tree AVL hai ya nhe.

Disjoint set bolean expression se ku better hai.

[2 9 7 5 8 ] using insertion sort algorithm es array ko sort krna tha.

Ek postfix expression dia hua tha us ka expression tree bnana tha.

Ye btana tha k expression tree k inner nodes r leaf nodes kya represent krti hn.

Write 2 conditions in which hashing is not suitable. 

Ek code given tha us mn se error find krny thy.

[17/09, 10:11 PM] Usama: Today my cs301 ppr  mostly mcqs from pst pprs and subjective Huffman codes ,bst ExPression tree and binary tree ,bubbly  sort ,postfix , aur ik program tha baqi  yad nhi reha

[17/09, 10:11 PM] Usama: 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...

[17/09, 10:11 PM] Usama: Today mhr Khalil cs 301 paper 11am 12/09/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

[17/09, 10:11 PM] Usama: CS301 important topics

Lecture 23

Expression tree, parse tree

Huffman Encoding

Properties of binary tree (for mcq)

Complete Binary Tree

Heap, max and min heap insertion, deletion and sorting in heap (complete concept with code)

Image segmentation (for short )

Operations on table ADT and implementation of table (for short)

Sorted and Unsorted Sequential Array

Binary search examples for concept

Skip list concept

Quad Node(for short)

Hashing concept

Lecture 42-45

[17/09, 10:11 PM] Usama: 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?

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.

[17/09, 10:11 PM] Usama: Today mhr Khalil cs 301 paper 11am 12/09/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