click on link to fill* course exit form for SE IT/ Sem III/ DSAA

*Requires google login

click on link to fill* course exit form for SE IT/ Sem III/ DSAA

*Requires google login

**List of defaulters in DSAA subject**

**Roll #**

3, 4, 7, 9,

11, 12, 13, 16, 19, 20,

21, 23, 25, 27,

32, 34, 35, 37,

41, 43, 44, 45, 47, 48, 49,

55, 56, 57, 59,

63, 64, 65, 66, 67, 68, 69, 70,

71, 72, 73, 74, 75, 76, 77, 78, 79, 80

**Submission Instructions:**

- All the defaulters will report for submission of DSAA on 15th November 2016 in following given time slot only

Roll numbers range | Time slot |

1 to 10 | 9.00 to 9.30 |

11 to 20 | 9.30.00 to 10.30 |

21 to 30 | 10.30 to 11.00 |

31 to 40 | 11.00 to 11.30 |

41 to 50 | 11.30 to 12.30 |

51 to 60 | 12.30 to 1.00 |

61 to 70 | 2.00 to 3.00 |

71 to 80 | 3.00 to 4.00 |

- Cover page of each experiment will be as per new format given. Cover page depicting previous format can be retained if and only if marks are awarded on them.
- Students have to be prepared to solve questions related with practical in order to get marks for knowledge of each practical.
- Index of DSAA along with DOS & DOP will be provided in another blog post, refer it to download, print and attach it with filled condition.
- Arrange file as per index only.
- If any experiments are not corrected, then same will be done at the time of submission itself..

**on date of DSAA practical exam**

**Sign**on**submission list**.**verify****marks**in**IAE**and**sign**on**IAE****average****mark****list**.

DSAA a batch

DSAA b batch

DSAA c batch

OOPM b batch

Assignment#1 18/8/2016,

Assignment #2 12/9/2016

Assignment #3 as per date of online exam

click to download Index for SE IT Sem 3 DSAA

Punishment for DSAA defaulters will be as follows,

- Any one question of 10 marks from Dec 2013 to May 2016 University question papers on each of the following topic as a complete answer in legitimate handwriting.
- Mention question number along with Month-Year of question paper referred for each topic.
- Topics list (attempt any 15)
- Recursion and induction
- Time complexity and notations of complexity measurement
- Stack and applications of stack
- Queue and applications of queue
- Linked list and application of linked list
- Implementation of algorithm for Stack or Queue or Linked list related topic
- Expression tree
- BST
- AVL tree
- Red-Black tree
- B-Tree
- Priority queue
- Heap tree
- Sorting algorithms
- BFS, DFS
- Shortest path algorithm
- Minimum spanning tree

**Submission Instructions:**- All the defaulters will report for submission of DSAA on 7th and 8th November 2016 in between 11.00 to 4.00 only.

- Cover page of each experiment will be as per new format given. Cover page depicting previous format can be retained if and only if marks are awarded on them.
- Students have to be prepared to solve questions related with practical in order to get marks for knowledge of each practical.
- Index of DSAA along with DOS & DOP will be provided in another blog post, refer it to download, print and attach it with filled condition.
- Arrange file as per index only.
- If any experiments are not corrected, then same will be done at the time of submission itself.

Continue reading Punishment assignment and Schedule of submission for Defaulters in DSAA

**List of defaulters in DSAA subject**

**Roll #**

3, 4, 7, 9,

11, 12, 13, 16, 19, 20,

21, 23, 25, 27,

32, 34, 35, 37,

41, 43, 44, 45, 47, 48, 49,

55, 56, 57, 59,

63, 64, 65, 66, 67, 68, 69, 70,

71, 72, 73, 74, 75, 76, 77, 78, 79, 80

**Submission Instructions:**

- All the non defaulters will report for submission of DSAA on 2
^{nd}November 2016 in following given time slot only

Roll numbers range | Time slot |

1 to 10 | 10.00 to 11.00 |

11 to 20 | 11.00 to 12.00 |

21 to 30 | 12.00 to 1.00 |

31 to 40 | 1.30 to 2.30 |

41 to 50 | 2.30 to 3.30 |

51 to 60 | 3.30 to 4.30 |

61 to 70 | 4.30 to 5.00 |

- Cover page of each experiment will be as per new format given. Cover page depicting previous format can be retained if and only if marks are awarded on them.
- Students have to be prepared to solve questions related with practical in order to get marks for knowledge of each practical.
- Index of DSAA along with DOS & DOP will be provided in another blog post, refer it to download, print and attach it with filled condition.
- Arrange file as per index only.
- If any experiments are not corrected, then same will be done at the time of submission itself.
- Submission schedule of defaulters will be posted later but instructions from 2 to 6 are also applicable on them.

Q#-Question

1 Linked list: insert(), delete(), traverse()

2 Linked list: insert(), copy(), concat()

3 Doubly linked list: insert(), delete(), traverse()

4 Stack using doubly linked list

5 Queue using doubly linked list

6 Input restricted DQ

7 Ouput restricted DQ

8 Insertion and Bubble sort

9 Bucket sort

10 BFS on graph

11 DFS on graph

12 Static list

13 Stack using an array

14 Queue using an array

15 Quick sort

16 Merge sort

17 Convert infix expression to prefix expression

18 Construct expression tree from postfix expression

19 AVL tree insertion

20 Heap sort

21 Heap tree

22 BST: insert(), show()

Based on above list of practical exam questions following is the list of 6 questions to be prepared for practical exam of DSAA by each student.

**Only one question** that **has to be performed** on day of practical exam, will be out of specified 6 questions, but it will **NOT** be **CHOICE** **OF** **STUDENT**. Hence student has to prepare **ALL** **6 QUESTIONS**.

**External examiner may ask to make some changes** in program by asking to add some more functionality, student has to be ready for that too.

**Change of question in practical exam will not be entertained.**

**Partial completion** of practical program will be treated as **INCOMPLETE** only.

click to open DSAA PRACTICAL EXAM QUESTION BANK excel file

- B-Tree construction
- Priority queue
- Heap tree construction
- write a code for any sorting algo
- Searching algorithm differences between seq and indexed seq
- merge sort with example
- Quick sort with example
- Sorting algo properties
- Graph traversal techniques
- shortest path algortihm for non negative edges in graph
- Shortest path algorithm for negative edges in graph
- Minimum spanning tree
- acyclic graph