Category Archives: DSAA

Data Structure and Algorithm Analysis

SE IT/ Sem 3/ DSA/ Index

A batch

B batch

C batch

Advertisements

Data required to fill Mentor Diary

Click to download pdf

  • Bring details along with documentary proof mentioned in PDF as well as below on submission day, else submission will not be accepted.
  • Details required:
    • Recent passport size photo
    • Name, address, contact, aadhar card number (Aadhar card xerox as proof)
    • Email id of self
    • Father’s details (name, address, contact, occupation, email id if any) (Aadhar card xerox as proof)
    • SSC details (ssc marksheet xerox as proof)
    • HSC details (hsc marksheet xerox as proof)
    • FE/ Diploma details (FE/ Diploma final year marksheets xerox)
    • SE details (SE marksheet xerox)
  • FE & SE details
    • IAE 1 & 2 marks for each semester each subject
    • end semester marks for each semester each subject

SE IT/ Sem 3/ DSAA/ Practical exam question bank

  1. Implementation of Infix to postfix expression conversion algorithm.
  2. Implementation of stack using an array (push, pop, peek operations).
  3. Implementation of queue using an array (insert, delete operations).
  4. Implementation of linked list. (insert, delete, concat, search operations)
  5. Implementation of stack using linked list. (push, pop, peek operations)
  6. Implementation of stack using linked list. (insert, delete operations)
  7. Implementation of Infix to postfix expression evaluation algorithm.
  8. Implementation of double ended queue. (input restricted, output restricted)
  9. implementation of priority queue. (ascending order, descending order priority queue)
  10. Implementation of quick sort.
  11. Implementation of bubble sort.
  12. Implementation of insertion sort.
  13. Implementation of merge sort.
  14. Implementation of hashing with collision resolution as open addressing chained hashing.
  15. Implementation of index sequential search on array. (array of strings, array of integers)
  16. Implementation of binary search on array. (array of strings, array of integers)

Note:

  • Text in bracket indicates variations of programs/ questions.
  • Question to implement will be given on random order upon arriving for exam.
  • In practical exam, in 2 hours given one question has to implemented with working code and proper output.
  • No help in error removal, has to be done on own.
  • External examiner may suggest additional changes in question.
  • Oral exam will be followed separately or along with practical exam.
  • Be prepared and no cheat by any means.

SE IT/ Sem 3/ DSA/ Submission notice

 

Inconvenience caused due to misplace/ stolen files/experiments of few students from my cabin, submission of DSAA is rescheduled as follows;

Date Roll numbers range
6th Nov’17 1 to 30
7th Nov’17 31 to 60
8th Nov’17 61 onward

Timing: 11.00 am to 5.00 pm

Note:

  • Above schedule is for all students; defaulters and non defaulters too.
  • Collect your experiments/ assignments, if misplaced write back. Sorry for inconvenience caused.
  • File submission decides TERMWORK marks and failed to submit termwork will null and void entire semester. Termwork marks are independent of Practical/ Oral marks.

 

 

SE IT/ Sem 3/ DSA/ defaulter’s assignment

DSA defaulter’s assignment:

1. What is data structure? Why it’s importance in computing? What are its types?

2. What is Asymptotic notations? What are its types? Explain with example.

3. Compare and contrast recursion with iteration.

4. What is Euclid’s algorithm? Solve it using induction method.

5. Write an algorithm to implement stack using a linked list.

6. How a stack can be used to perform conversion of polish notations. Explain with algorithm and example of any one conversion.

7. Implement push and pop operation of stack.

8. With proper example of each explain Linear, Circular, priority, double ended queue.

9. With pseudo code explain working of double linked list.

10. What are application of stack, queue and linked list. Write at least significant 5 applications of each.

11. Write an algorithm to implement Quick sort, Merge sort, Insertion sort. Implement any one.

12. Compare and contrast all sorting techniques.

13. What is hashing in searching algorithms. What is collision? How it can be resolved, list all techniques? Explain any one with example.

14. With example of each list different types of trees in data structure.

15. Explain Threaded Binary Tree with suitable example.

16. What is sparse matrix? How it can be resolved in data structure?

17. What is Prim’s and Kruskal’s algorithm? With example show how it can be used to find minimum spanning tree in a graph.

18. Explain with example Dijkstra’s algorithm.

19. What are different graph traversal techniques?

20. What are applications of tree and graph? Write at least 5 of each.

SE IT/ Sem 3/ DSA/ Defaulter’s list

DSA defaulter’s list:

  • List is prepared considering actual attendance till 23rd Oct’17.
  • Defaulters are with attendance less than 75%.
  • Critically defaulters are with attendance less than equal to 50%
Roll
Number
NAME July Aug Sep Oct Att %
14 12 14 6 46
116601 ANSARI ABDUL MAAJID AEJAZ AHMED 12 6 8 4 30 65.22
116602 ANSARI ARHAM ABRAR 10 11 10 6 37 80.43
116603 ANSARI RAMSHA KHURSHID AHMED 10 10 12 4 36 78.26
116604 BAGWALA MANSOOR HASANALI 2 8 4 6 20 43.48
116605 BARMARE ZAID RAFIQUE 10 6 12 4 32 69.57
116606 BHATKAR AMINA MUBEEN AHEMAD 14 8 10 6 38 82.61
116607 CHACHIYA SHAHANAWAZ ALTAF 12 12 14 6 44 95.65
116608 CHUNAWALA FARHAN ABDUL KADER 6 4 6 2 18 39.13
116609 DAHODWALA ADNAN MUSTAFA 10 10 4 6 30 65.22
116610 DHANSURA HUSAIN ALIASGER 14 10 8 6 38 82.61
116611 GAUTAM DEEPESH AJAY 0 0 0 0 0 0
116612 GHAWTE ALFIYA MOHD ANIS 14 6 12 6 38 82.61
116613 HAIDER S HASAN  WASI HAIDER 10 9 8 6 33 71.74
116614 KHAN IZAAN NIZAMUDDIN 0 0 0 0 0 0
116615 KADIWALA TAHIR ABBAS SHABBIR ALI 6 8 8 4 26 56.52
116616 KHAN ROHAAN QADEER 12 6 6 4 28 60.87
116617 KAZI NEHA ZAHIR 12 12 14 6 44 95.65
116618 KHAN MOHAMMEDALI HADISULLAH 12 10 10 6 38 82.61
116619 KHAN SARGUROH MOHD ARSHAD N 6 6 8 4 24 52.17
116620 KHAN YASIRAMMAR MAZHARUDDIN 14 12 14 4 44 95.65
116621 KHOT AL TAMASH SAYEED 8 8 12 4 32 69.57
116622 KUMAR NIRANJAN SANJAI 0 0 0 0 0 0
116623 MANSURI FARHEEN BANOO NASEEM A 12 12 14 6 44 95.65
116624 MANSURI MUBASSHIRA MOHD SHAFI 14 10 10 4 38 82.61
116625 MODAK MUAZ SIRAJ 6 10 8 6 30 65.22
116626 MOMIN AFFAN AHMED IRFAN AHMED 0 0 0 0 0 0
116627 MORBIWALA IBRAHIM MUNTAZIR 12 9 2 4 27 58.7
116628 MUN ALIFIYA KHOZEMA 14 12 8 4 38 82.61
116629 PANDEY RAHUL HRIDAYNARAYAN 10 9 14 6 39 84.78
116630 PANDEY NILESHKUMAR UMESH 10 6 8 2 26 56.52
116631 PAYAK MUBEEN HAMID 10 6 8 2 26 56.52
116632 QAZI ALTAMASH MOHAMMED AKRAM 8 10 10 4 32 69.57
116633 SABUWALA ABDEALI ALIASGER 10 9 8 6 33 71.74
116634 SHAIKH MOHAMMED FARAZ N 12 6 8 4 30 65.22
116635 SAYED MOHAMMED AMIN GAZALI 10 9 12 4 35 76.09
116636 SHAIKH AALIA ABDULKAREEM 14 12 14 6 46 100
116637 SHAIKH IQRA ZAFAR IQBAL 8 9 10 6 33 71.74
116638 SHAIKH KAUSAR FIROZ 12 11 14 6 43 93.48
116639 SIDDIQUE MOHD ARSHAD MOHD HANIF 14 8 10 2 34 73.91
116640 SIDDIQUE MOHD ASIF SHAKIL AHMED 10 8 8 4 30 65.22
116641 SINGH PRATEEK KUMAR BIRENDRA K 8 10 14 2 34 73.91
116642 TAYADE SANJEET VIJAYKUMAR 2 0 0 0 2 4.35
116643 VADHER PARAG JAGJIVAN 8 12 12 2 34 73.91
116644 BEIG MOHD KASHIF SALIM 12 8 10 6 36 78.26
116645 BHAYANI ARISH MEHBOOB 0 0 0 0 0 0
116646 DALAL MISBAH IMTIYAZ 12 6 12 4 34 73.91
116647 FURNITUREWALA FATIMA ABUBAKAR 0 0 0 0 0 0
116648 KHAN SAMRIN SAMIR 8 8 8 6 30 65.22
116649 KHAN SHAHID GAYASUDDIN 0 0 0 0 0 0
116650 KHAN UZMA AMZAD 14 8 4 2 28 60.87
116651 MAAZ MOHAMMED HUSSAIN 14 12 14 2 42 91.3
116652 MOTIWALA QUSAI ZOHER 2 4 4 0 10 21.74
116653 PANUGANTI AJAY SRINIVAS 12 10 12 2 36 78.26
116654 PAWAR ABRAR AHMED ABDUL AZIZ 10 6 8 4 28 60.87
116655 QURESHI AAIMON MOHD TAREQUE 12 8 12 4 36 78.26
116656 RIZVI NOOREEN ZEHRA MOHD SADIQ 8 0 12 2 22 47.83
116657 SHAIKH NAIYER ABDUL WAHAB 12 6 12 2 32 69.57
116658 SHEIKH AZIM AYUB ISMAIL 14 12 14 2 42 91.3
116659 SIDDIQUI MOHD ANAS SIDDIQUI M R 10 10 4 2 26 56.52
116660 THAKUR ZAID ABDUL KADAR 10 12 12 4 38 82.61
116661 VERMA PANKAJ INDRABHAN 12 10 14 2 38 82.61
116662 WAGLE SUFYAAN SHAKEEL 12 8 12 2 34 73.91
116663 SHAUKAT SALINA 0 0 0 0 0 0
115664 KHAN ATIF 10 8 8 6 32 69.57
115665 AVEIS SHAIKH 10 8 8 0 26 56.52
115666 HAWA ABDUL BASIT 14 10 10 2 36 78.26
217667 AIBANI MOHD AKMAL MD AFZAL 0 0 10 4 14 70
217668 ANSARI  MOHD OBEI ABDUL AZIZ 0 0 10 4 14 70
217669 ANSARI ANUSHA SEEMAB 0 0 8 2 10 50
217670 ANSARI FARHAN ZAHIR AHMED 0 0 10 6 16 80
217671 BAGA SHAHNOOR AHMED 0 0 10 4 14 70
217672 KAZI NAGMA MOHIYODDIN 0 0 14 4 18 90
217673 KHALIFA NAGAMA ABDUL 0 0 12 6 18 90
217674 KHAN FARHEEN NOOR MD 0 0 12 2 14 70
217675 KHAN IQRA MAZHAR 0 0 8 2 10 50
217676 MANCHEKAR SANIYA ASIF 0 0 14 6 20 100
217677 SHAIKH AFRIDI ABDUL GANI 0 0 8 4 12 60
217678 SHAIKH MOHD MUSTAFA PARVEZ 0 0 6 2 8 40
217679 SHAIKH SAMEENA SAEED JAMAL 0 0 14 6 20 100
217680 SHAIKH UZMA SHARFUDDIN 0 0 10 4 14 70
217681 SIDDIQUI KULSUM SHAZMA 0 0 12 4 16 80
217682 YUSRA ZAFAR MIRZA 0 0 12 6 18 90
114683 BHUTEKAR GANESH RAMESH 0 0 6 4 10 50

SE IT/ Sem 3/ Assignment #1

1. What is need of data structure? How linear data structure differs from non-linear data structure?

2. Explain with example of tower of Hanoi, how mathematical induction technique can be used in computer algorithms to solve problem.

3. Implement an algorithm to convert polish notations to reverse polish notations for given statement.

4. Implement round robin job scheduling algorithm using Queue concept.

5. Explain how a binary tree can be represented using double linked list. Implement same.

DOP: 6/10/2017

Note: This assignment is valid for Diploma students and those who have not yet submitted assignment #1.

SE IT/ Sem 3/ DSAA/ Assignment #2

1. List all sorting algorithms types with examples of sorting algorithms. Also with proper justification state which sorting algorithm should be used.

2. Implement hashing based searching algorithm with open addressing double hashing as collision resolution technique.

3. Implement network flow alogorithm to be used for network routers for routing packet.

4. What is threaded binary tree? What is practical application of same?

5. Justify “DFS is not complete searching technique”. Explain with example IDDFS.

DOP: 6/10/2017