Cs301 Final Term Giga File by Ishfaq V.3.2.0.Pdf

Only available on StudyMode
  • Topic: Sorting algorithm, Binary tree, Insertion sort
  • Pages : 94 (25473 words )
  • Download(s) : 350
  • Published : February 1, 2012
Open Document
Text Preview
Virtual University of Pakistan CS301 Data Structure
File Version v3.2.0 Prepared For:Final Term
Note: Use Table Of Content to view the Topics, In PDF(Portable Document Format) format , you can check Bookmarks menu Disclaimer: There might be some human errors, if you find please let me know at pak.nchd@gmail.com , duplication of data may be possible but at least possible level Your Feed Back is Highly Appreciated. Compiled and Prepared by: Muhammad Ishfaq (PakPattan)

File updated on 7/14/2011

CS301 Data Structure_ Muhammad Ishfaq
----:Table of Content:----

Page No.1

Table of Content
TABLE OF CONTENT ..................................................................................................................................................................... 1 SHORT QUESTIONS PAPER ........................................................................................................................................................... 5 SET-01 ............................................................................................................................................................................................... 5 Convert the given infix form to postfix form. ............................................................................................................................... 5 A+B/C-D^E-F ................................................................................................................................................................................ 5 How we can implement Table ADT using Linked List................................................................................................................... 5 If we allow assignment to constants what will happen? ............................................................................................................. 5 How heap sort works to sort a set of data. ................................................................................................................................. 5 Give your comment on the statement that heap uses least memory in array representation of binary trees. Justify your answer in either case. .................................................................................................................................................................. 5 How we can use concept of equivalence relations to generate a Maze. ..................................................................................... 5 "For smaller lists, linear insertion sort performs well, but for larger lists, quick sort is suitable to apply." Justify why? ............ 5 6 9 5 0 4 1 7 3 2 ........................................................................................................................................................................... 5 Show the first five merging steps for Merge sort on this array. .................................................................................................. 5 What is Disjoint Sets? Explain with an example. ......................................................................................................................... 5 Write the code of the perculateDown() function and also comment it. ...................................................................................... 5 Here is an array with exactly 15 elements:.................................................................................................................................. 5 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15. ............................................................................................................................................. 5 SET-02 ............................................................................................................................................................................................... 6 Give one example of Hashing...
tracking img