CS301 Current Finalterm Papers Fall 2020 and Past Solved Papers

[+ M.Tariq Malik]

CS301 Current Finalterm Papers Fall 2020 and Past Solved Papers

Dear Students, Please share your Current Finalterm Paper (Current Paper) Fall 2020 as well Past papers and MCQs. This will be helpful for many students who are looking for help/assistance regarding there Current Finalterm Paper Fall 2020.

 

Let's help each other in Current Papers and make VU ning forum into a better community for VU students.

 

Just copy text of each MCQ/Question of current papers and paste here or save in a MS Word file and upload in replies.

 

VU ning team will post here Current Papers, to help VU Students.

Let's discuss here Current Finalterm Paper Fall 2020, clear your concepts, improve learning and help each other. Good luck 

 

Share anything you remember!

[+ M.Tariq Malik]

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

CS301

+ View All Featured Discussions

[+ M.Tariq Malik]

Today CS301 Current final term paper fall 2020

27-02-2021

cs301 paper 7:30 am 27 feb

Mcqs all from past papers

Objective shorts from past papers sorting k zyada questions aye

Hashing properties

Subjective

Bubble sort program

Types of image

[+ M.Tariq Malik]

CS301 Final Term Current Paper FALL 2020-21

27-FEB-2021

Time 7:30 Saturday

Mcqs .... totally handout se or conceptual the....past papers se ek bhi nhi aya tha....Mcqs bhut ziada difficult the 38 questions the

30 mcqs the or 8 question the.....

1. Table abstract data type k btana tha...

2. Skip list k characteristics

3. Code tha us ka output batana tha

4.array {19 18 4 9 41 79 } (aese hi kuch number the) insertion krni thi contain 1 to 10

5. Min heap ka sawal thaa

6 Binary search tree banani this .....

[Mufakir Mairaj]

Date : 27-2-2021 Time 11:30am

A question from insertion sort code complete krna tha
Delete from min-heap diagram thi
Delete from binary search diagram thi
infix prefix postfix ki exporessin tree draw krna tha ((x+y)*(p-q))-s+
mcqs past main sy 20% baki algorithm k time or worst cases the infix postfix prefix say 4 mcqs the
Disjoint and boolean better batana tha
name of two divides and conquer algorithm

[+ M.Tariq Malik]

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 ta

[+ M.Tariq Malik]

TIME 7:30 SATURDAY

1.

Mcqs .... totally handout se or conceptual the....past papers se ek bhi nhi aya tha....Mcqs bhut ziada difficult the 38 questions the

30 mcqs the or 8 question the.....

1. Table abstract data type k btana tha...

2. Skip list k characteristics

3. Code tha us ka output batana tha

4.array {19 18 4 9 41 79 } (aese hi kuch number the) insertion krni thi contain 1 to 10

5. Min heap ka sawal thaa

6 Binary search tree banani this .....

301 paper 7:30 am 27 feb

2.

Mcqs all from past papers

Objective shorts from past papers sorting k zyada questions aye

Hashing properties

Subjective

Bubble sort program

Types of image

CS301: 9:30 27 FEB

3.

mostly mcqs past papers mai se thy

Short:

methods of resolving collision in hashing?

BT or BT pointer?

AVl tree... aik mai bnana tha or dosre mai aik node nikal de tu kesa bany ga Avl Tree.. esa kuch tha

important fact about building heap?

Long:

Rotations of threading Binary Tree?

Heap Tree bana tha aik... wo batana tha Min heap tha ya max heap or sath uska array index likhna tha?

insertion sort algorithm.. write each step?

Lectures 30 to 45.... the most important

Best of luck for CS301

[+ M.Tariq Malik]

CS301 Current Finalterm Papers Fall 2020

---

CS301 Current Finalterm Papers Fall 2020 27-02-2021

 

#CS301 important Topics for Finals
AVL tree
BST
Lecture no 24
Parse tree
Lecture no 25
Expression tree
Huffman encoding
Lecture no 26
Mathematical properties of binary tree ( MCQS)
Lecture no 27
Properties of binary tree (Mcqs)
Lecture no 28
Complete Binary tree
Lecture no 29
Heap ,max,insertion in a heap
Lecture no 30
Insertion into a min- heap
Lecture no 31
Build heap
Lec no 32
PerculateDown Method
GetMin Method
BuildHeap Method
Lec no 33
Heap sort
Disjoint set ADT
Equivalence relationship
Lec no 34
Equivalence realtion
Lec no 36
Union by size
Union by height
Lec no 37
Image segment ( short)
Lec no 38
Table and dictionaries
Operation on table ADT
Binary search
Lec no 39
Seraching an array : B S
Lec no 40
Skip list (Mcqs)
Full
Lec no 41
Quad node
AVL tree
Hashing
Lec no 42
Collision
Linear probing
Lec no 44
 Most imp
Lec no 45
Merge sort
Quicksort

[+ M.Tariq Malik]

CS301 Paper

1.

Mcqs .... totally handout se or conceptual the....past papers se ek bhi nhi aya tha....Mcqs bhut ziada difficult the 38 questions the

30 mcqs the or 8 question the.....

1. Table abstract data type k btana tha...

2. Skip list k characteristics

3. Code tha us ka output batana tha

4.array {19 18 4 9 41 79 } (aese hi kuch number the) insertion krni thi contain 1 to 10

5. Min heap ka sawal thaa

6 Binary search tree banani this .....

301 paper 7:30 am 27 feb

2.

Mcqs all from past papers

Objective shorts from past papers sorting k zyada questions aye

Hashing properties

Subjective

Bubble sort program

Types of image

CS301: 9:30 27 feb

3.

mostly mcqs past papers mai se thy

Short:

methods of resolving collision in hashing?

BT or BT pointer?

AVl tree... aik mai bnana tha or dosre mai aik node nikal de tu kesa bany ga Avl Tree.. esa kuch tha

important fact about building heap?

Long:

Rotations of threading Binary Tree?

Heap Tree bana tha aik... wo batana tha Min heap tha ya max heap or sath uska array index likhna tha?

insertion sort algorithm.. write each step?

Lectures 30 to 45.... the most important

Best of luck for CS301

[+ M.Tariq Malik]

CS301 Current Finalterm Papers Fall 2020

---

CS301 Current Finalterm Papers Fall 2020 |  01-03-2021 | 09:30 AM

Cs301 9:30
Mcqs moaz file past se full...
1Short three operation name in used selection..
2 Ak long me hash ka program dia tha result btana tha...
3 Give any three characterstics of union by weight method..
4Ak diagram di thi k ye heap hai ni hai to minimum changes kry to ho jy gai heap?5 num.ka tha ye..
5 how awst case use in selection and bubble sort..
6 compression me find kasy kam krta?
7 ak array data Kia tha k binary tree bnani or max value search krni...
8 ak value list di thi us me 3 step ka pocha k link kitni external use ho gai or internal kitni ho 12 nodes thi ...

[+ M.Tariq Malik]

CS301 Current Finalterm Papers Fall 2020

---

CS301 Current Finalterm Papers Fall 2020 | 28-02-2021 | 11:30 AM

 

[+ M.Tariq Malik]

CS301 Current Finalterm Papers Fall 2020

---

CS301 Current Finalterm Papers Fall 2020 |  02-03-2021

 

Cs301 k mcqs 50% moize ki file mei sy ay thy
Subjective
1st case of deletion in avl tree
Pixel ka ak question tha
Binary Tree bnana tha input array diya howa tha
Hashing ki two applications likhni thi