CS301- Data Structures finalterm paper
Virtual Position Forum :: STUDY CORNER :: Study Matters :: VU Current Exam Papers :: FinalTerm Papers
Page 1 of 1 • Share
CS301- Data Structures finalterm paper
CS301 todays paper
Total 52 questions
40MCQ's and
2x4=questions
3x4=questions
5x4=questions
Question No: 41 ( Marks: 2 )
Convert the given infix form to postfix form.
A+B/C-D^E-F
Question No: 42 ( Marks: 2 )
How we can implement Table ADT using Linked List
Question No: 43 ( Marks: 2 )
If we allow assignment to constants what will happen?
Question No: 44 ( Marks: 2 )
How heap sort works to sort a set of data.
Question No: 46 ( Marks: 3 )
Give your comment on the statement that heap uses least memory in array representation of binary trees. Justify your answer in either case.
Question No: 47 ( Marks: 3 )
How we can use concept of equivalence relations to generate a Maze.
Question No: 48 ( Marks: 3 )
"For smaller lists, linear insertion sort performs well, but for larger lists, quick sort is suitable to apply." Justify why?
Question No: 49 ( Marks: 5 )
6 9 5 0 4 1 7 3 2
Show the first five merging steps for Merge sort on this array.
Question No: 50 ( Marks: 5 )
What is Disjoint Sets? Explain with an example.
Question No: 51 ( Marks: 5 )
Write the code of the perculateDown() function and also comment it.
Question No: 52 ( Marks: 5 )
Here is an array with exactly 15 elements:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15.
Suppose that we are doing a binary search for an element. Indicate any elements that will be found by examining two or fewer numbers from the array.
Total 52 questions
40MCQ's and
2x4=questions
3x4=questions
5x4=questions
Question No: 41 ( Marks: 2 )
Convert the given infix form to postfix form.
A+B/C-D^E-F
Question No: 42 ( Marks: 2 )
How we can implement Table ADT using Linked List
Question No: 43 ( Marks: 2 )
If we allow assignment to constants what will happen?
Question No: 44 ( Marks: 2 )
How heap sort works to sort a set of data.
Question No: 46 ( Marks: 3 )
Give your comment on the statement that heap uses least memory in array representation of binary trees. Justify your answer in either case.
Question No: 47 ( Marks: 3 )
How we can use concept of equivalence relations to generate a Maze.
Question No: 48 ( Marks: 3 )
"For smaller lists, linear insertion sort performs well, but for larger lists, quick sort is suitable to apply." Justify why?
Question No: 49 ( Marks: 5 )
6 9 5 0 4 1 7 3 2
Show the first five merging steps for Merge sort on this array.
Question No: 50 ( Marks: 5 )
What is Disjoint Sets? Explain with an example.
Question No: 51 ( Marks: 5 )
Write the code of the perculateDown() function and also comment it.
Question No: 52 ( Marks: 5 )
Here is an array with exactly 15 elements:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15.
Suppose that we are doing a binary search for an element. Indicate any elements that will be found by examining two or fewer numbers from the array.
Asad- Deep Bench
- Posts : 563
Join date : 2011-02-11
Re: CS301- Data Structures finalterm paper
17 feb.
MCQs were new
mostly from BST, min and max heap, thread binary tree, quick sort, merge sort
2 and 3 marks
drawback of using array to store BST.
applications of hashing.
what is c++ template.
meant by "Sibling" in relation
5≥2 is any equivalence relation between there?
5 marks questions
explain and write the code for union and find operation of parent array in disjoint sets.
merge sort, and array
deletion of nodes in tree
[You must be registered and logged in to see this image.]
MCQs were new
mostly from BST, min and max heap, thread binary tree, quick sort, merge sort
2 and 3 marks
drawback of using array to store BST.
applications of hashing.
what is c++ template.
meant by "Sibling" in relation
5≥2 is any equivalence relation between there?
5 marks questions
explain and write the code for union and find operation of parent array in disjoint sets.
merge sort, and array
deletion of nodes in tree
[You must be registered and logged in to see this image.]
Asad- Deep Bench
- Posts : 563
Join date : 2011-02-11
Re: CS301- Data Structures finalterm paper
objective mostly past prrz sy aya tha...............
1-3 important characteristics of skip list.
2-drawback of using array to store BST.
3-examples of hashing.
4-c++ code to add node in doubly link list.
5-wat u conclude from the running time analysis of disjoint sets.
6-explain how heap sort work.
7-what is c++ template.
[You must be registered and logged in to see this image.]
8-explain and write the code for union and find operation of parent array in disjoint sets.
[You must be registered and logged in to see this image.]
aur 2 question main coding thi.........aik main error theakh krna tha aur dosra yaad nae kia krna tha
han aik aur v question tha...............5 3 8 9 1 7 0 2 6 4 is main select sort operation krna tha..........
--
1-3 important characteristics of skip list.
2-drawback of using array to store BST.
3-examples of hashing.
4-c++ code to add node in doubly link list.
5-wat u conclude from the running time analysis of disjoint sets.
6-explain how heap sort work.
7-what is c++ template.
[You must be registered and logged in to see this image.]
8-explain and write the code for union and find operation of parent array in disjoint sets.
[You must be registered and logged in to see this image.]
aur 2 question main coding thi.........aik main error theakh krna tha aur dosra yaad nae kia krna tha
han aik aur v question tha...............5 3 8 9 1 7 0 2 6 4 is main select sort operation krna tha..........
--
Asad- Deep Bench
- Posts : 563
Join date : 2011-02-11
Re: CS301- Data Structures finalterm paper
total 56 que
40 MCQS and 12 subjective
postfix to infix conversion
insertion
show all steps by converting the array into min heap
conclusion of running time analysis of ADT
length() method
c++ code
[You must be registered and logged in to see this image.]
bus yehi yaad hai
40 MCQS and 12 subjective
postfix to infix conversion
insertion
show all steps by converting the array into min heap
conclusion of running time analysis of ADT
length() method
c++ code
[You must be registered and logged in to see this image.]
bus yehi yaad hai
Asad- Deep Bench
- Posts : 563
Join date : 2011-02-11
Re: CS301- Data Structures finalterm paper
today cs301 current paper short questions
Short Question :linear probing qud probing union by weight union by size quick sort merge sort and collision
Short Question :linear probing qud probing union by weight union by size quick sort merge sort and collision
Asad- Deep Bench
- Posts : 563
Join date : 2011-02-11
Similar topics
» CS301 Final Term Paper
» CS301 Final Term Paper
» CS301 FinalTerm Paper
» CS301 Current Finalterm papers
» CS301 Final Term Paper
» CS301 Final Term Paper
» CS301 FinalTerm Paper
» CS301 Current Finalterm papers
» CS301 Final Term Paper
Virtual Position Forum :: STUDY CORNER :: Study Matters :: VU Current Exam Papers :: FinalTerm Papers
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
Sat May 04, 2024 11:49 am by ali001
» house disrepair claims
Thu May 02, 2024 4:29 pm by Ibad Khan Buledi
» Bounce n Bang: Physics puzzler
Thu May 02, 2024 11:39 am by ali001
» AIChatSY - AIChatbot Assistant
Wed May 01, 2024 10:48 am by ali001
» Storybook Magic App
Tue Apr 30, 2024 7:06 pm by ali001
» Flower Book Match3 Puzzle Game
Tue Apr 30, 2024 12:17 pm by ali001
» Avian Influenza Symptom in Chickens "Bird Flu H5N1 Virus" Vet learning materials, Poultry Farming
Sat Apr 27, 2024 9:57 am by Ibad Khan Buledi
» Aloha Planner - Note-Taker
Thu Apr 11, 2024 4:52 pm by ali001
» Streaming Guide Film TV Series
Tue Apr 09, 2024 9:39 pm by ali001