UPDATED DS LAB SCHEDULE FOR MINOR - 2 AND SYLLABUS

DS LAB MINOR - 2  WILL BE SCHEDULED ALONG WITH REGULAR MINOR - 2 EXAMS FOR BOTH 3RD AND 5TH SEM (EXCEPT DIPLOMA STUDENTS ).

DURATION - 1HR 15MINS.

EXAM PATTERN
Any 2 FULL Questions to be attempted out of 3. Max 40marks.

1. STACKS - INFIX TO POSTFIX CONVERSION.

2. QUEUES - LINEAR QUEUE, CIRCULAR QUEUE.

3. LINKED LIST - SINGLY LINKED LIST, DOUBLY LINKED LIST, CIRCULAR SINGLY LINKED LIST

4. TREES - DEFINITION OF TREE, TYPES OF TREES, CONSTRUCTION AND TRAVERSAL OF BINARY TREE & BINARY SEARCH TREE.

SEMINAR TOPICS

DS LAB - SEMINAR TOPICS - for 3rd and 5th Sem.

Every topic should have

                1. Theory / Concept

                2. Algorithm

                3. Asymptotic analysis - best case, average and worst case.

                4. Examples ( one or more ).

                5. Tracing of example.

                6. Asymptotic Analysis of example.

1. List out and Discuss the Asymptotic Notations - O (big oh), Ω( omega ) and Θ ( theta). Also relate these notations with best case, average case and worst case scenarios.

2. Write an modular program (using functions) on MERGE SORT. Using Asymptotic Notations perform best case, average case and worst case analysis.

3. Write and Design an modular (using functions) program on QUICK SORT. Using Asymptotic Notations perform best case, average case and worst case analysis.

4. Write an modular program (using functions) on HEAP SORT. Using Asymptotic Notations perform best case, average case and worst case analysis.

5. Write an modular program (using functions) on SHELL SORT. Using Asymptotic Notations perform best case, average case and worst case analysis.

6. Write an modular program (using functions) on RADIX SORT. Using Asymptotic Notations perform best case, average case and worst case analysis.

7. Write an modular program (using functions) on Direct address Tables. Discuss its performance -  best case, average case and worst case analysis.

8. Write an modular program (using functions) on Hash Tables. Discuss its performance - best case, average case and worst case analysis.

9. Write an modular program (using functions) on Linear Search. Discuss its performance analysis for best case, average case and worst case.

10. Write an modular program (using functions) on Binary Search. Discuss its performance analysis for best case, average case and worst case.

TEAMS

TEAMS FOR SEMINAR
	3A	3B
SEMINAR TOPIC NO	ROLL NOS.	ROLL NOS.
1	1 to 7	73 to 79
2	8 to 13	80 to 86
3	14 to 19	87 to 94
4	20 to 26	95 to 102
5	27 to 33	103 to 110
6	34 to 39	111 to 119
7	40 to 47	121 TO 127
8	48 to 56	128 TO 134
9	57 to 62	135 TO 141
10	63 to 68	142 TO 154
7	25, 43, 51, 69 to 72	155 TO 160
8	-------	161, 894, 1391 TO 1393

TEAMS FOR SEMINAR 5A DIV 5B DIV SEMINAR TOPIC ROLL NOS. ROLL NOS. 1 1 to 6 73-77 2 7 to 13 78-82 3 14 to 19 83-87 4 20 to 25 88-92 5 26 to 31 93-98 6 32 to 37 99-103 7 38 to 43 104-122 8 44 to 49 123-128 9 50 to 55 129-134 10 56 to 61 135-144 7 62 to 67 -----

RESOURCE ON C PROGRAMMING FOR 7TH SEM

TO ACCESS PPT - CLICK HERE TO VIEW PPT

TO ACCESS PDF BOOK -
LET US C BY YK - CLICK HERE

DATA STRUCTURES NOTES
FIRST SESSION. INTRODUCTION TO DATA STRUCTURES. CLICK HERE
SECOND SESSION. STACKS, QUEUES AND RECURSION. CLICK HERE
THIRD SESSION. LINKED LIST. CLICK HERE
FOURTH SESSION. BINARY TREES. CLICK HERE
                                   BINARY SEARCH TREES. CLICK HERE
FIFTH SESSION. GRAPHS. CLICK HERE

MINOR 1 QUESTIONS.

FOR 3 A DIVISION
CLICK HERE TO VIEW QUESTIONS.

FOR 3 B  DIVISION.
CLICK HERE TO VIEW THE QUESTIONS

FOR 5 A DIVISION
CLICK HERE TO VIEW QUESTIONS

FOR 5 B DIVISION
CLICK HERE TO VIEW THE QUESTIONS

INTERESTED STUDENTS OF RESPECTIVE DIVISION CAN SUBMIT THE SOLUTION FOR ABOVE MINOR QUESTIONS.
LAST DATE: 20 OCTOBER 2018.

MINOR - 1 MARKS.

5-A DIVISION
CLICK HERE TO VIEW MARKS


3 - B DIVISION

5- B DIVISION