You are on page 1of 2
Bir Insite of Technology Science, Plank Work-tegrate Learaing Programmes Divison First Semester 20123018 ‘Comprehensive Hxomination (EC-3 Regular) course No. 3520519 Couse Tile DATA STRUCTURE AND ALGORITHMS DESIGN Nate ofExam Open Book Weighage 50% No.of Paes Duration 3 Hows Neer =3 Date of Exam i/IN2012._ (AN) ote 1 Please otow a the sn Calter gven a he cor page fhe answer bok 4 Atsonpora made ysl bested ety a te beginng of your swe 53, Steak qostoe fom espa Nate stale ssumgboy waver equ end explity neon hh bp of enc uesion De pasa conee wife sewing eons. OY Sungest suitable dat strictures for modeling cach of the following problems (separately) (@) Back operation in windows explorer or other graphical directory browser. {Assume that multiple browser windows cannot be opened.) —$ () searching contact by name or number in a smart phone. [Assume unlimited space for string the contacts} (©) Determining top-10 gainers in stock market on a given day. [Note: Provide only data structures tobe used, No algorithm should be writen for this question) B2=6 2. Consier the problem defined as follows You are traveling by @ canoe down a river and there aren ting posts along the way. Before stating your journey, you ae given foreach 1 ¢i

You might also like