Assignment and Tutorial Questions: DAA-CA-1
The assignments questions are based on class room discussion.
Students are advised to submit assignment on submit@mbchandak.com

Assignment 1: Refer the presentation in the link: For roll numbers: 2, 7, 12, 17:  
Last date of submission: 24th Dec 2014. knapsack

Assignment: 2: Refer the presentation and implement Prims’ and Kruskals’ algorithm Home Assignment-1

Assignment 3: For students with roll numbers 41, 46, 51, 56: Date of presentation: 02-Jan-2015. Java Implementation of any application based on Prims Algorithm. Points to be discussed in presentation: (i) Application (ii) Methods Descriptions (iii) Code execution (iv) Complexity (v) Data structures used in design

Assignment 4: For student with roll numbers: 3, 8, 13, 18: Refer Goolge map to find actual distance between cities: Nagpur, Pune, Patna, Hyderabad, Delhi, Chennai, Bangalore, Raipur, Jaipur, Lucknow. The distance matrix will be of size 10×10. If any one city is considered as source, implement single source shortest path algorithm. Comment on complexity and two type of paths between source and destination. Direct path and Indirect path. Date of Presentation 09-Jan-2015.

 Assignment 5: For students with roll numbers: 42, 47, 52, 57: Implement all sorting algorithm discussed in class. Discuss the complexity equation of each algorithm. Write menu driven & function based program in netbeans – Java. Create a dynamic array and dynamic memory structure and demonstrate how Binary search can be used in Real Time Systems. Date of Presentation: 09-Jan-2015

Assignment 6: For students with roll numbers: 4,9,14,19: Presentation on Randomized Quick Sort covering following points: (i) Introduction (ii) Algorithm (iii) Difference with Quick Sort (iv) Applications (v) Comment on Randomness (iv) Implementation in Java. Date of Presentation: 09-Jan-2015

Class Assignment (Max.marks:02): Conducted: Question Set: assignment1_jan_2015_daa

Assignment 7: For students with roll numbers:43,48,53,58:Write program for string editing and discuss method to justify the cost of editing. Also apply the method on the matrix and justify the cost of editing.

Assignment 8: For students with roll numbers:5,10,15,20: Implement assignment 4 for All pair shortest path algorithm.

Assignment 9: Class problem for roll numbers 41-61 [Last date of submission 11th April 2015: Hard copy]

Assignment 10: For all students: assignment2

 

Note for assignments: If any of roll numbers is not in existence, student with next roll number will be part of group.