Sandip Foundation's
SANDIP INSTITUTE OF TECHNOLOGY AND RESEARCH CENTRE
Department of Computer Engineering
INSTRUCTION PLAN OF DSA
CLASS – SE Div :- A Academic Year :2017-18
Subset of PO achieved by this course:
1. An ability to apply knowledge of Mathematics, Computer Science and Engineering to obtain the solution of complex engineering problems. 2. An ability to identify, formulate and analyze complex engineering problems in the field of Computer Science and Engineering.
3. An ability to use research methods to investigate complex problem by designing experiments analyzing and interpreting data & synthesis the information to compute valid conclusion
4. An ability to create and use the techniques,algorithms model,processes & modern software & hardware tools necessary for computer engineering.
Course Outcomes:
1.To discriminate the usage of various structures in approaching the problem solution. 2.To design the algorithms to solve the programming problems.
3.To use effective and efficient data structures in solving various Computer Engineering domain problems. 4.To analyze the problems to apply suitable algorithm and data structure.
LECT URE NO.
UNIT / SUB-UNIT
LECTURE CONTENT LECTURE OUTCOME
TEACHING METHOD
INSTRUCTION MATERIAL
LEARNING MATERIAL
REMARKS
1 Unit-I:
Introduction to Algorithm and Data Structures
Algorithms- Problem Solving, Introduction to Algorithms,Characterist ics of algorithms
Apply
knowledge to write algorithm
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.1-5 Text Book: Gilles Brassard
and Paul Bratley, “Algorithmics”
2 Algorithm Design Tools: Pseudo Code and flowchart
1.Use flowchart to design the problem
2.Write
pseudocode to solve the problem
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.3-5 3 Analysis of Algorithms Apply
knowledge of Time & space complexity to analyze
algorithm
Chalk and talk , Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.14-40 Text Book: Gilles Brassard
and Paul Bratley, “Algorithmics”
4 Complexity of algorithms- Space complexity, Time complexity
1.Find time complexity of an algorithm.
2.Find Space complexity of an algorithm.
Chalk and talk Notes Notes Text Book: E.
Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.14-18
5. Asymptotic
notation-Big-O, Theta and Omega
Understanding of asymptotic notations
Chalk and talk , Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
6 Standard measures of efficiency.
Use knowledge
to find
efficiency of an algorithm
Chalk and talk , Question & Answer
Notes Notes
Text Book: Gilles Brassard
and Paul Bratley, “Algorithmics”
,PRENTICE HALL, Englewood Cliffs, New Jersey,PP.
37-52 7 Data Structures- Data
structure, Abstract Data Types (ADT), Concept of linear and Non-linear, static and dynamic, persistent and ephemeral data structures and relationship among data, data structure, and algorithm, From Problem to Program.
1. Write ADT
of data
structure
2.
Understanding
of data
structures
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
textbooks Referencebook
8 Algorithmic Strategies-Introduction to algorithm design strategies- Divide and Conquer, and Greedy strategy.
Apply appropriate algorithmic design strategy to solve the given problems
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.127-131,197 9 Recurrence relation
-Recurrence Relation, Linear Recurrence Relations, With constant Coefficients, Homogeneous
Solutions. Solving recurrence relations
Apply
nkowledge to find time complexity of an algorithm using
recurrence relations
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: Gilles Brassard
and Paul Bratley, “Algorithmics”
,PRENTICE HALL, Englewood Cliffs, New Jersey,PP.65-78 10 Sequential Organization Implementation
of array using sequential organization
Chalk and talk , Question & Answer,Notes
Notes Notes
1 Linear Data Structure Using Sequential Organization
Understand concept of linear data structures
Chalk and talk , Question & Answer, notes
Notes Notes
Unit-II
Linear Data Structures Using Sequential
Organization
12 Array as an
Abstract Data Type, Memory Representation
Write an ADT of an array
Chalk and talk , Question & Answer,n otes
Notes Notes
13 Address Calculation,
Inserting an element into an array, Deleting
an element,
Multidimensional Arrays, Two-dimensional arrays, n-dimensional arrays
Calculate address of particular element in array
Chalk and talk ,
Exercise,Q&A Notes Notes
14 Concept of Ordered
List, Single Variable Polynomial,
Representation using arrays
1. Understand concept of ordered list
2. Implement polynomial using array
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
15 Polynomial as array of structure, Polynomial addition, Polynomial multiplication
Apply concept of polinomial representation for finding addition,
subtraction & multiplication
Chalk and Talk Lecture Notes Question & Answer,
Exercise
Notes Notes,Textbook s,Refreence
16 Sparse Matrix, Sparse matrix representation
Understand concept of sparse matrix
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
17 Sparse matrix addition, Transpose of sparse matrix
Apply concept of sparse matrix
representation for finding addition,
subtraction , multiplication & transpose of matrices
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
18 String Manipulation
Using Array. Case Study- Use of sparse matrix in Social Networks and Maps.
Write a
program to implement string operations using array
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
19 Concept, Comparison
of sequential and linked organizations
Understand concept of sequential & linked
organization
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
Unit-III Linked Lists
20 Primitive operations, Realization of Linked Lists, Realization of linked list using arrays,Dynamic
Memory Management
Apply
knowledge to implement dynamic memory management using linklist
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
21 Linked list using
dynamic memory management Linked List Abstract Data Type
Write ADT of Linkedlist
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
22 Linked list operations, Head pointer and header node, Types of linked list- Linear and circular linked lists
Implement operations on linkedlist
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
23 Doubly Linked List and
operations
Implement operations on Doubly linked list
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
24 Circular Linked List, Singly circular linked list, Doubly circular linked list
1.Implement operations on singly circular linked list
2.Implement operations on Doubly circular linked list
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
25 Polynomial
Manipulations -Polynomial addition, Multiplication of two polynomials using linked list
Implement Polynomial addition, Multiplication using
linked list
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
26 Generalized Linked List (GLL) concept, representation of polynomial and sets using GLL.
Representation of GLL
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
27 Case Study- Garbage Collection.
Implementation of garbase collection
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
28
Unit IV : Stacks
Stacks- concept, Primitive operations
Implement ADT of Stack
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.69-76 29 Stack Abstract Data
Type, Representation of Stacks Using Sequential Organization
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
30 Stack operations, Multiple Stacks
Apply concept of stack to implement multi stack.
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.69-76 31 Applications of
Stack-Expression Evaluation and Conversion
1. Apply stack to convert expresseions
2. Apply stack to evaluate expresseions.
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
32 Polish notation and expression conversion
Understanding of polish notation
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
33 Need for prefix and postfix expressions, Postfix expression evaluation, Linked Stack and Operations.
Implement stack using Linked list
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
34 Recursion- concept, variants of recursion-direct, inrecursion-direct, tail and tree,
Implement recursive functions
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
35 Backtracking
algorithmic strategy, use of stack in backtracking
Apply
knowledge of stack in backtracking
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
36 Case Study- 4 Queens problem, Android-multiple tasks/Android-multiple activities and back stack
Implement multi queen problem
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.353-357 37
Unit V:Queues
Concept, Queue as Abstract Data Type
Implement Adt of queue
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
38 Realization of Queues Using Arrays
Implement queue using array
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.69-76 39 Realization of Queues
Using Arrays
Implement queue using array
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
40 Circular Queue,
Advantages of using circular queues
Implement circular queue using array
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
41 Multi-queues Implementation
of multiqueues
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
42 Deque Implement
deque using array
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
43 Priority Queue, Array implementation of priority queue
Implement priority queue using array
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.91-99
44 Linked Queue and
operations.
Implement queue using linklist
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
45 Case study- Priority queue in bandwidth management.
Apllication of -Priority queue in bandwidth
management
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.91-99
46 Searching- Search
Techniques, Sequential search
Implementation of sequential search on lists.
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
Unit VI:Sorting and Searching
47 Variant of sequential search- sentinel search
Understanding of Variant of sequential search- sentinel search
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
books
48 Binary search Implemnet
binary search on list of elements
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: Gilles Brassard
and Paul Bratley, “Algorithmics”
,PRENTICE HALL, Englewood Cliffs, New Jersey,PP.
109-115 49 Fibonacci search. Case
Study- Use of Fibonacci search in non-uniform access memory storage and in Optimization of Unimodal Functions.
Implemnet fibonacci search on list of elements
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,Textbook s,Refreence
50 Sorting- Types of sorting-Internal an external sorting, General sort concepts-sort order, stability, efficiency, number of passes
Understand the concept of searching & sorting
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
Text Book: Gilles Brassard
and Paul Bratley, “Algorithmics”
,PRENTICE HALL, Englewood Cliffs, New
51 Sorting methods-Bubble sort,Insertion sort
1.Implement bubble sort
2. Implement insersion sort
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
Text Book: Gilles Brassard
and Paul Bratley, “Algorithmics”
,PRENTICE HALL, Englewood Cliffs, New
Jersey
52 Selection sort,Quick
sort
1.Implement selection sort
2.Implement quick sort
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
53 Heap sort,Shell sort 1.Implement heap sort
2.Implement shell sort
Chalk and Talk Lecture Notes Question & Answer
Notes Notes
Text Book: E. Horowitz , Sartaj Sahani,S.
Rajsekaran, “Computer Algorithms”,C
omputer Science Press,
2nd ,Edition,
PP.92-99 54 Bucket sort, Radix sort,
Comparison of All Sorting Methods. Case Study- Timsort as a hybrid stable sorting algorithm.
Implement radix sort
Chalk and Talk Lecture Notes Question & Answer
Notes Notes,books
Signature :
Name of Faculty: HOD
Note:
Lecture shall have three phases- introduction, development & consolidation
2-3 teaching methods shall be employed during each lecture
