Replies to This Discussion

Advertise Here

Permalink Reply by Yasmeen(S.admin) on February 4, 2012 at 11:55am

CS301 Fall 2011 Final Term Feb 2012 – VU Current Paper – 03 Feb 2012

total MCQs 40
MCQs were mixed old and new
subjective questions
1 in which situation hash is not suit able
2 for implementing priority which data structure is best
3 steps for merge sort
4 merge sort heap sort and quick sort
5 1 daigram min heap deletionn
6 how we insert new element in array at first position
7 write c++ code for recursive function call
8 find the errors in code

Permalink Reply by Yasmeen(S.admin) on February 4, 2012 at 12:15pm

CS301 Fall 2011 Final Term Feb 2012 –– 03 Feb 2012

All MCQS from past papers and long questions Given below.

Q 41: Where is hashing suitable? 2 Marks
Q.42 When Hashing is not Suitable? 2 Marks
Q.43 Forgot 2 Marks
Q.44 Forgot 2 Marks
Q.45 How many parameters used in following operation? write their names,
0. Find,
1. Add
3. Remove 3 Marks
Q.46 Forgot
Q.49 Union by size tree formation, Assignment no4 was asked 5 Marks
Q.50 Code for Union and find operation in disjoints sets. 5Marks
Q.51 A function Hash(x) = (x*2)/ tablesize and is given index from 0 to 11, to find out the contents of tables of values in
order 11, 29, 36, 22, 27( 5Marks

Permalink Reply by Yasmeen(S.admin) on February 4, 2012 at 12:18pm

CS301 Fall 2011 Final Term Feb 2012 – 03 Feb 2012

1 stack me postfin or infix kesy kam karty hai- 5 marks
2 heapsort or array mil k kesy kth smallest value maloom karty hai- 5 marks
3 selection sort me karna tha -5 marks
4 binary search tree - 5 marks
5 lenght() method maloom karna tha in query -3 marks
6 heap sort ki advantage -3 marks
7 searing in skip list method -3 marks
8 number thy usy merge array me karna tha- 3 marks
9 what is ADT -2 marks
10 collision ka pocha tha k kesy hoti hai- 2 marks
11 divide and conquer k elwa kn sa sort k method hai- 2 marks
12 heapsort k bary me

Permalink Reply by Yasmeen(S.admin) on February 4, 2012 at 10:00pm

Total Number 80
Time 120 minutes
Total Question 52
40 MCQs from Past Papers
2 four-long questions
3 four-long questions
5 four-long questions

Q1. How we can implement Table ADT using Linked List (2)
Q2. What is hashing? (2)Q3. Describe the conditions for second case of deletion in AVL Trees. (2)
Q4. What is an Equivalent relation? Give any two examples. (2)
Q1. Write down the parameter name of the following:- (3)1. Delete
2. Insert
3. Find
Q2. Where Inorder Predecessor of a non leaf node is is present in a Binary Search Tree? :- (3)
Q3. How we can search an element in Skip List. (3)
Q4. Convert the given infix form to postfix form. Y-Z*X-Q^P-(3)
Q1. 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. (5)
Q2. Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest). (5)

Q3. Consider the following array as input
13468971015 


Prove that it is a heap and also explain what type of heap it is.? Draw the final NOT for all.
Q4. Draw the following sequence of union commands on the set of elements {1,2,3,4, 5}:
union(4,2)union(3,1)union(5,4)union(5,3)Show the result when the unions are performed. We need only Final results of union NOT for all. 

Permalink Reply by Yasmeen(S.admin) on February 5, 2012 at 7:23pm

Total Marks=80
Total questions=52
MCQS=40
Short questions=12

QUESTIONS are here.

Q1.which proces places data at the back of the queue?     2

Q2.Give the name of two sorting algorithem that dont follow "divid ad conquer" strategy?  2

Q3.How a heap sort work to sort a set of data?   2

Q4.If data is in sorted order what will be its impact on find operation of table ADT?    2

Q5. Apply operation delMin on it and show the resultant heap?     3

Q.6 how many parameters are required for performing the following operations on table also tell name of these parameters.

1. Insert
2. Find
3. Remove

Q.7 how is an array of ten integer.  3

      5,3,8,9,1,7,0,2,6,4
 draw this array after the first iteration of main loop of insertion sort (sorting from smallest to largest).this iteration has shifted at least one item in array.

Q.8  Here is a small binary tree  5

 

write the order of nodes visited in

A.an in order traversal
B.a pre order traversal

Q.9 Show the steps of merge sort procedure applied to the following list        5

22,31,42,11,12,41,23,13,21,33

Q.10 consider the following heap        5

1.is it min heap or max
2.show the context of array used to store it in array

Permalink Reply by Yasmeen(S.admin) on February 8, 2012 at 12:49pm

what is tree?(2)
what is hashing(2)
apply union operation and draw the tree applying following union operation?(5)
Another Paper:
all mcqs were from past solved papers jo papers bilal bhai ne upload kiay huay hain. 40 mai se almost 30 mcqs un papers mai se thay.
long questions mai se:
write down the algorithm for making maze? 2 marks
difine recursive relationship between siblings and parnts from distinct people? 2 marks
array was given sort that by bubble sort method? 5 marks
array was given sort that by selection sort method? 3 marks
array was given make a binary search tree and then remove a node from resultant tree.? 5 marks
define union by weight? 3 marks
define merge sort algorithm? 2 marks 

Permalink Reply by Yasmeen(S.admin) on February 16, 2012 at 10:28pm

TOTAL QUESTIONS: 52:
MCQs: 40:

Subjective paper is here:
Q: 41: How can we generate maze. Give an algorithm. MARKS: 2:
Q: 42: The relation “>” between real numbers is equivalence relation or not? Explain. MARKS: 2:
Q: 43: What is meant by the following statement in context of linked list data structure?

Node* new Node = new Node(9); MARKS: 2:
Q: 44: Give the names of any two Nlog(N) sorting algorithm. MARKS: 2:
Q: 45: Give any three characteristics of Union by weight methode. MARKS: 3:
Q: 46: “For smaller list linear insertion sort performs well, but for larger lists, quick sort is suitable to apply. Why? MARKS: 3:
Q: 47: The relation “is a sibling of” (used to pairs of distict people, who have the same Parents) on the set of all human beings is equivalence relation or not? Explain. MARKS: 3:
Q: 48: Write down the code for isEmpty() and isFull() functions of the stack data structure implemented through arrays.
MARKS: 3:
Q: 49: Give an array of ontegers. Draw a maximum heap and show the final updates array.
12 57 19 87 15 44 23 MARKS: 5:
Q: 50: Here is an array of 15 elements :
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Suppose that we have Binary search tree for an element.
Indicate any element will be found by examining two or few numbers from the array. MARKS: 5:
Q: 51: If we use linked list implemented push and pop stack. What is the better side for Push an element and also for Pop an element in to the array. MARKS: 5:

Permalink Reply by Yasmeen(S.admin) on April 19, 2012 at 11:27am

FINAL TERM EXAMINATION

CS301 – Data Structure

FALL February 2012

Total Number 80                                                               

Time 120 minutes

Total Question 52

40       MCQs from Past Papers

2          four-long questions

3          four-long questions

5          four-long questions

 

Q1.     How we can implement Table ADT using Linked List (2)

Q2.     What is hashing? (2)

Q3.     Describe the conditions for second case of deletion in AVL Trees. (2)

Q4.     What is an Equivalent relation? Give any two examples. (2)

 

Q1.     Write down the parameter name of the following:-  (3)

1.     Delete

2.     Insert

3.     Find

Q2.     Where Inorder Predecessor of a non leaf node is is present in a Binary Search Tree? :-  (3)

Q3.     How we can search an element in Skip List. (3)

Q4.     Convert the given infix form to postfix form. Y-Z*X-Q^P-(3)

 

Q1.     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.   (5)

 

Q2.     Here is an array of ten integers:

5   3   8   9   1   7   0   2   6   4

The  array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest).    (5)

 

 

Q3.     Consider the following array as input

 

13

4

6

8

9

7

10

15

 

Prove that it is a heap and also explain what type of heap it is.? Draw the final NOT for all.

 

Q4.     Draw the following sequence of union commands on the set of elements{1,2,3,4, 5}:

 

union(4,2)

union(3,1)

union(5,4)

union(5,3)

Show the result when the unions are performed. We need only Final results of union NOT for all.

 

  shareshare

 

Permalink Reply by PRINCE ZORRO on December 10, 2012 at 9:24am

NICe for me thanks