Today I'm done cs301
1.Avl tree ki deletion type
2.philosophy of Divide and conquer
3. Union ka tree banana tha kuch aise tha
(1,3)
(1,7)
(8,9)
(8,4)
(9,1)
(14,15)
(14,17)
(9,14)
4. max heap wala tha ek or
.5. ek or union wala e tha itne e yadd han bs easy tha
Cs301 31-082021
Long questions
Postfix likhna tha 2 data ka
Insertion sort algorithim
basic step bubble sort
Short question
two condtion of 2nd cae delete AVL tree
in a heap from a, item at position i, where are the parent, let child and right child located?
MCQs
Heap can be implement through_______
Iteration, heap,
huff code, Hashing,
Today cs301 at 9:30
Mcq sbh handout s thy bht easy
Hashing waly topic s aik question tha
Aik code ko explain krna tha heap class ka code
Binary tree given the child batany thy
How implemention of disjoint set is better than Booleean matrix
Almost easy tha paper
Cs301 31-082021
Long questions
Postfix likhna tha 2 data ka
Insertion sort algorithim
basic step bubble sort
Short question
two condtion of 2nd cae delete AVL tree
in a heap from a, item at position i, where are the parent, let child and right child located?
MCQs
Heap can be implement through_______
Iteration, heap,
huff code, Hashing,
My Today Paper 📜 of CS301: 31 August 6:00 PM
18 MCQs: 14 from Past papers
Subjective: 1. 3 character of good Hashing function
2. Find mid of the array
3. Find Left child, Right Child and Parent nodes of given array.
4. Frequency table of "Data Structures"
5. Write C++ Code for Insertion Sort
Best of Luck 👍
Today monday:
Time:11.00 am
Date :30 August 2021.
Subject : cs301
Mcqz kuch past file se thy or kuch new thy.
Q:1:- 3 marks 97,76,61,42,54,59,31,23,17,44 heap trea me 86 insert kr k btaye.
Q:2:-
Skip list k three characteristics btaye.
Q:3:-
AVL tree me 1st deletion me hone wali two condition btaye.
Q:4:-
How we can generate a maze with the help of union.
Long question 5 marks
Q:5:-
hashing table bna k results chk kry
23,46,58,68,78,86 ye table tha or mode 11 diye hue thy h(x) =x.
Q. 6:-
91
77 96
68 81 11
ayse tree bnai hui thi or kaha tha k esko min heap me change kry.
cs301(Hasnain)
1st sept 2021.
Objective sara moaz file sy tha.
1.what is hashing ? give an example
2.Given an array 2,3,7,8,15,18,19,20,26,24,2
find childre of value 15 in array.
3.aik array thi us par insertion sort kr k steps btany thy.
4.Expression tree bnani thi postfix expression ki.
5.if a tree has 6 internal nodes then find total links,externa links,internal links.
6.how to apply find operation on tree in which union is applied.
(Cs301 exams 2021
Timing 4:30pm)
1: defibe symbol tables?
2:min heap is suitable ha ?
3:min heap tree tha os may 4 nodes delete kernay thy or phir tree show kerna tha?
4: hash tables fill kerna tha or formal diya tha slove kerna tha ?
5:single right rotation pic banani thi ?
Mcqs conceptual or pastpapers say thy ?
Abstract base
Inheritance
Complete specialization
Pure/virtual function
Template mostly STL
Classes & object
Static keywords it's uses in inheritance
Is sab ko axhay se prepare kry agr Marks lany ha ye most important ha
Huffman coding
Heap sort
Merge algorithm
AVL tree
Binary search tree
Template uses in data structure
Priority Queue Using Heap
Lecture 38
Sorted and Unsorted Sequential Array
Operation on Table ADT
Implementation on Table
Lecture 41
AVL Tree
Hashing
Lecture 43
Application of Hashing
When did Hashing is Suitable
What is Sorting
How to sort integers in Array?
Lecture 44
Bubble Sort
Insertion Sort
Lecture 45
Divide and Conquer
Merge sort
Cs301 paper
Mcqs tqreebn 10 past papers sy thy.
1 Avl tree ko balance krna tha left rotation kr k.
2 Binary search k array value di gyi the 15 ki position find krna the.
3 Min Heep k tree bnana tha or stuts btana tha.
4 When hashing is suitable.
5 Table size hashcoding is tra k code tha1 code dia gya tha us my return value btani the.
Or 1 question yad nhi
Paper cs301
Mcqs
Total Mcqs:16
Past paper say ay thay 2 he out of past paper say thay jo conceptual thay
1. Huffman encoding may just frequency btani thi table given tha just values put krni thi
2. What is collision and explain it's solution
3. Ek question heap ka tha tree given tha Ye btana tha k Ye MAX heap hai ya MIN or array index banana tha
4. Sequential Array index given tha is may ek values 98 insert krwani thi bad may usko resultant heap bnana tha
Today paper 11:00
Cs 301
Mcqs mostly from past paper AVL ko btana tha k node ko delete krne se Kia affect aye ga . Skip list ka tha question or equilance relation with examples
0 Comments