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
Read more: CS301 Current Final Term Papers Fall 2011 ( 03 Feb to 16 Feb 2012 ) - Virtual University of Pakistan http://vustudents.ning.com/group/cs301datastructures/forum/topics/cs301-current-final-term-papers-fall-2011-03-feb-to-16-feb-2012#ixzz1lVhOgzbx
What is hashing?
Define skip list? In one line?
Heap sorting...
Binary Search is the fastest method of searching in algorithm. Justify your answer.
Sorryyyyyyyy !!!!! Baki yaad nahi aa rahe... 
BR,
SONO
Read more: CS301 Current Final Term Papers Fall 2011 ( 03 Feb to 16 Feb 2012 ) - Virtual University of Pakistan http://vustudents.ning.com/group/cs301datastructures/forum/topics/cs301-current-final-term-papers-fall-2011-03-feb-to-16-feb-2012#ixzz1lVhWvlGe
What is hashing?
Define skip list? In one line?
Heap sorting...
Binary Search is the fastest method of searching in algorithm. Justify your answer.
Sorryyyyyyyy !!!!! Baki yaad nahi aa rahe...
BR,
SONO
Read more: CS301 Current Final Term Papers Fall 2011 ( 03 Feb to 16 Feb 2012 ) - Virtual University of Pakistan http://vustudents.ning.com/group/cs301datastructures/forum/topics/cs301-current-final-term-papers-fall-2011-03-feb-to-16-feb-2012#ixzz1lVhWvlGe
No comments:
Post a Comment