Replies to This Discussion

Advertise Here

Permalink Reply by ღ Alone Soul ღ on May 29, 2012 at 10:26pm

download it

Attachments:

•  CS301-FINALTERM SOLVED MCQS WITH REFERENCES.pdf, 367 KB

Permalink Reply by ღ Alone Soul ღ on May 29, 2012 at 10:27pm

CS301+Solved+Subjective+Questions

Attachments:

•  CS301+Solved+Subjective+Questions.pdf, 769 KB

Permalink Reply by ღ Alone Soul ღ on May 29, 2012 at 10:27pm

Attachments:

•  CS301-FINALTERM SOLVED MCQS WITH REFERENCES.pdf, 367 KB

Permalink Reply by ღ Alone Soul ღ on May 29, 2012 at 10:27pm

My Current Paper at 8:00 am 3-2-2012

Questions were about

1.Table ADT

2. Bubble Sort

3. Solution of AB-C+DEF-+^ while given values were A=3, B=2, C=1, D=1, E=2 and F= 3

4. Binary Search is an algorithm used with the  ------ data.

5. If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search are --------.

6. In disjoint sets Union is a ------ time operation.

7. Circular linked list

8. Creating a heap of given data.

9. Mergesort method

Permalink Reply by ღ Alone Soul ღ on May 29, 2012 at 10:27pm

CS301 Data Structure Paper:

 

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
Q.52  Forgot                                 5 Marks

Permalink Reply by ღ Alone Soul ღ on May 29, 2012 at 10:28pm

urrent papercs301 2012 final term

---

FINAL TERM EXAMINATION

CS301 – Data Structure

FALL February 2012

Dated 3rd February 2012 (Umair Saulat) 

North Nazimabad Karachi 

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.

Permalink Reply by ღ Alone Soul ღ on May 29, 2012 at 10:28pm

past paper sy nai aya

 

mcq's boht asan thy simple sy thy samjh a jati thi

or subject me

1 Q tha k 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 number thy usy selection sort me karna tha 5 marks

4 numer thy usy kaha k binary search tree me kar k pta nai kia maloos kary us ki samjh nai i  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 he tha Q bhol gya

 

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

Q.52 Forgot 5 Marks

 

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

 

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 ღ Alone Soul ღ on May 29, 2012 at 10:28pm

CS_301_..CURRENT_Subjective_PAPER_(DATE_13FEB_2012)_BY_MASOOM_FAIRY

Attachments:

•  CS_301_..CURRENT_PAPER_(DATE_13FEB_2012)_BY_MASOOM_FAIRY..pdf, 354 KB

Permalink Reply by My Sweet Passion on May 30, 2012 at 3:31pm

CS301 paper

• CS301 solvedpaper.docx, 59 KB

Permalink Reply by My Sweet Passion on May 30, 2012 at 3:35pm

CS301 solved subjective part

• CS301 solvedpaper.docx, 446 KB

Permalink Reply by My Sweet Passion on May 30, 2012 at 3:43pm

Here 10 solved papers in one file.

• CS301FINALTERMSOLVEDMCQSWITHREFERENCES.pdf, 367 KB

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

very nice work