Course Plan: ST ND

COURSE PLAN
2013-14
Regulation: R11
FACULTY DETAILS:
Name of the Faculty:: M.Chandrasekhar
Designation: Assistant Professor
Department:: MCA
COURSE DETAILS
Name Of The Programme:: Data Structures and Algorithms Batch:: 2013
Designation:: Assistant Professor
Year 1st Semester 2nd
Department:: MCA
Title of The Subject Data Structures and Algorithms Subject Code
No of Students 11
2013-14
COURSE PLAN
Regulation: R11
FACULTY DETAILS:
Department:: MCA
1. TARGET
a) Percentage Pass 100
b) Percentage I class 90
2. COURSE PLAN
(Please write how you intend to cover the contents: i.e., coverage of Units by lectures, guest lectures, design exercises, solving
numerical problems, demonstration of models, model preparation, or by assignments, etc.)
1. Coverage of Subject, unit-wise by teaching in the class

2. Student interaction with the subject, by applications in daily life examples
3. Assignments from previous question papers
4. Quiz and brain storming etc. techniques to learn the subject fast & applications
5. Latest updates from internet and videos related to concept provided to the student.
6. Uploading Previous Year Papers & Their solutions for future reference for Regular External Exams
3. METHOD OF EVALUATION
3.1. Continuous Assessment Examinations (CAE 1, CAE 2) Yes
3.2. Assignments / Seminars Yes
3.3. Mini Projects
3.4. Quiz Yes
3.5. Term End Examination Yes
3.6. Others
4. List out any new topic(s) or any innovation you would like to introduce in teaching the subject in this Semester.
1. Seminars by students by browsing the subject related Websites & Journal, to get depth of knowledge beyond the
class work
2. Making students to join Technical Societies or Associations which organizing the subject research works, job
opportunities, advance. topics info.
3. Encourage the students to participate in conference papers (or) workshops conducted by technical institutions /
organizations.
Signature of HOD Signature of Faculty

Date: Date:
2013-14
GUIDELINES TO STUDY THE SUBJECT

Regulation: R11
FACULTY DETAILS:
Department:: MCA
Guidelines for Preparing the Course: Data Structures and Alogorithms
Course Description:
Data Structures is a subject of primary importance to the discipline of Computer Science and Engineering. It is a
logical and mathematical model of sorting and organizing data in a particular way in a computer, required for
designing and implementing efficient algorithms and program development. Different kinds of data structures like
arrays, linked lists, stacks, queues, etc.. are suited to different kinds of applications. Some specific data structures
are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of
data, such as large databases and internet indexing services. Nowadays, various programming languages like
C,C++ and Java are used to implement the concepts of Data Structures.
Course Objectives:
1. Know the basics data structures and its importance to develop any system program.
2. To find the computational complexity of a given algorithm
3. Apply the different operations of linked list. Must know the merging of single linked list and the advantages and
disadvantages of linked list
4. To understand the basic concepts of stack
5. Must know the application of stacks
6. Must know the evaluation of arithmetic expressions
7. To understand the basic concepts of Queue and the applications of Queue
8. To understand tree, binary tree concepts and the operations on binary trees
9. To understand the basic concepts of graphs
10. To understand the BFS,DFS graph traversals
11. Must know the search algorithms
12. Must know the different sorting algorithms
13. To understand the different sorting techniques.
14. To Understand the Binary Search tree and operations and know the AVL tree operations
15. To understand the B-Tree operations and introduction of Red black and Splay Trees.
16. To understand the algorithm Design Methods and applications.
17. To understand the different Pattern Matching algorithms.
Learning Outcomes:
1. Familiar with writing recursive methods.
2. Compare iterative and recursive solutions for elementary problems.
3. Analyze various algorithms and its time and space complexity.
4. Understand the usage of various data structures.
5. Familiar with various searching and sorting techniques.
6. Analyze the associated algorithms, operations and time complexity.
7. Design and apply appropriate data structures for solving computing problems.
8. Solve problems using various data structures like linear list, stack, queue, trees and graphs.
9. Think critically and solve problems independently.
10. Understand how to choose the best algorithm or data structure for a particular task.
2013-14
COURSE OBJECTIVES
Regulation: R11
FACULTY DETAILS:
Department:: MCA
On completion of this Subject / Course the student shall be able to:
S.No. Objectives Outcomes

1.
Basic concepts of ,Data structures, Algorithms, Performance analysis, Asymptotic Analysis- Linear data
structures Singly Linked Lists-Operations, Stack ADT,definitions,operations, array and linked
implementations, applications Queue, definitions and operations ,array and linked Implementations 1,2,3,4,5,6
,7.
2.
Trees, Binary tree ADT, array and linked representations traversals, threaded binary trees, Priority Queues-
Definition, ADT, Realizing a Priority Queue using Heap. Graphs Graph Representations Graph traversals-
DFS and BFS
8,9,10
3.
Searching-Linear Search ,Binary Search Comparison of Searching methods. Sorting- Bubble Sort, Insertion
Sort, Selection Sort, Heap Sort, Radix Sort. Algorithm Design method- Divide and Conquer method-
applications- Quick sort, Merge sort, Comparison of Sorting methods, Model for External Sorting.
11.12.13
4.
Search Trees-Binary Search Trees, Definition, ADT, Implementation, Operations, AVL Trees, Definition,
Operations – Insertion and Searching, B-Trees, Definition, B-Tree of order m, operations Introduction to
Red-Black and Splay Trees, Comparison of Search Trees
14,15
5.
Algorithm Design methods-Greedy method-applications-Kruskal’s Algorithm for Minimum cost Spanning
trees, Dynamic Programming method-applications
Text Processing - Pattern matching algorithm- The Knuth-Morris-Pratt algorithm, Tries- Standard Tries,
Compressed Tries, and Suffix tries
16,17
Signature of Faculty
Date:
Note: For each of the OBJECTIVE indicate the appropriate OUTCOMES to be achieved.
Kindly refer Page 16, to know the illustrative verbs that can be used to state the objectives.
2013-14
COURSE OUTCOMES
Regulation: R11
FACULTY DETAILS:
Department:: MCA
The expected outcomes of the Course / Subject are:
S.No. General Categories of Outcomes Specific Outcomes of the Course

An ability to apply knowledge of mathematics,
A. science, and engineering
An ability to design and conduct experiments, as

B. well as to analyze and interpret data
An ability to design a system, component, or
C. process to meet desired needs within realistic
Constraints such as economic, environmental,
social, political, ethical, health and safety,
Manufacturability and sustainability
D. An ability to function on multi-disciplinary teams
An ability to identify, formulate, and solve

E. engineering problems
An understanding of professional and ethical

F. responsibility
G. An ability to communicate effectively
The broad education necessary to understand the

H. impact of engineering solutions in a global,
economic, environmental, and societal context
A recognition of the need for, and an ability to
I. engage in life-long learning
J. A knowledge of contemporary issues
An ability to use the techniques, skills, and

K. modern engineering tools necessary for
Engineering practice.
Objectives – Outcome Relationship Matrix (Indicate the relationships by  mark).
Outcomes
Objectives A B C D E F G H I J K
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
5
FACULTY DETAILS:
Department:: MCA
The Schedule for the whole Course / Subject is::
2013-14
COURSE SCHEDULE
Regulation: R11
Duration (Date) Total No.

S. No. Description
From To of Periods
1.
Unit-1
Basic concepts of ,Data structures, Algorithms, Performance analysis,
Asymptotic Analysis- Linear data structures Singly Linked Lists-
Operations, Stack ADT,definitions,operations, array and linked
implementations, applications Queue, definitions and operations ,array
and linked Implementations
18/3/2014 15/4/2014 10
2.
Unit-2
Trees, Binary tree ADT, array and linked representations traversals,
threaded binary trees, Priority Queues-Definition, ADT, Realizing a
Priority Queue using Heap. Graphs Graph Representations Graph
traversals- DFS and BFS
16/4/2014 10/5/2014 9
3.
Unit-3
Searching-Linear Search ,Binary Search Comparison of Searching
methods. Sorting- Bubble Sort, Insertion Sort, Selection Sort, Heap
Sort, Radix Sort. Algorithm Design method- Divide and Conquer
method-applications- Quick sort, Merge sort, Comparison of Sorting
methods, Model for External Sorting.
18/6/2014 3/7/2014 10
4.
Unit-4
Search Trees-Binary Search Trees, Definition, ADT, Implementation,
Operations, AVL Trees, Definition, Operations – Insertion and
Searching, B-Trees, Definition, B-Tree of order m, operations
Introduction to Red-Black and Splay Trees, Comparison of Search
Trees
4/7/2014 15/7/2014 10
5.
Unit-5
Algorithm Design methods-Greedy method-applications-Kruskal’s
Algorithm for Minimum cost Spanning trees, Dynamic Programming
method-applications
Text Processing - Pattern matching algorithm- The Knuth-Morris-Pratt
algorithm, Tries- Standard Tries, Compressed Tries, and Suffix tries
16/7/2014 9/8/2014 10
Total No. of Instructional periods available for the course: Hours / Periods
SCHEDULE OF INSTRUCTIONS 2013-14
UNIT - I Regulation: R11
FACULTY DETAILS:
Department:: MCA
The Schedule for the whole Course / Subject is:: Data Structures and Algorithms
Objectives & References

SI. No. of
Date Topics / Sub - Topics Outcome (Text Book, Journal…
No. Periods
Nos. Page No___ to __
Data structures, Algori
Objectives:1 and Applications in C
Basic concepts-Data types, Abstract Data Types
Outcomes:1 S.Sahani
1 24/3/2014 1
Data structures ,Algorithms, Performance Objectives:2 and Applications in C
analysis- time complexity and space complexity Outcomes:2 S.Sahani
2 25/3/2014 1
Asymptotic Analysis-Big Omega and Theta Objectives:2 and Applications in C
notations Outcomes:2 S.Sahani
3 26/3/2014 1
Linear data structures- Linear Lists, Sequential
and Linked allocation ,The list ADT, array and
Outcomes:3 S.Sahani
linked Implementations
4 27//2014 1
Singly Linked Lists-Operations-Insertion, Deletion,
Doubly Linked
Outcomes:2 S.Sahani
Lists- Operations- Insertion, Deletion
5 28/3/2014 1
Deletion, Stack ADT,definitions,operations, array Objectives:5 and Applications in C
and linked implementations Outcomes:3 S.Sahani
6 3/4/2014 1
applications-infix to postfix conversion
Outcomes:3 S.Sahani
7 5/4/2014 1
Queue ADT, definitions and operations Data structures, Algori
Outcomes:3 S.Sahani
8 9/4/2014 1
array and linked Implementations
Outcomes:3 S.Sahani
9 13/4/2014 1
Date
Note: 1. ENSURE THAT ALL TOPICS SPECIFIED IN THE COURSE ARE MENTIONED .
2. ADDITIONAL TOPICS COVERED, IF ANY, MAY ALSO BE SPECIFIED BOLDLY .
3. MENTION THE CORRESPONDING COURSE OBJECTIVE AND OUT COME NUMBERS AGAINST EACH TOPIC .
SCHEDULE OF 2013-14
INSTRUCTIONS
UNIT - II Regulation: R11
FACULTY DETAILS:
Department:: MCA

SI. No. of
Date Topics / Sub - Topics Outcome (Text Book, Journal…)
No. Periods
Nos. Page No___ to ___
Data structures, Algorithms
Non Linear data structures- Trees – Basic Objectives:8 and Applications in C++,
Terminology, Outcomes:3 S.Sahani
1 16/4/2014 1
Objectives:8 and Applications in C++,
Binary tree ADT
Outcomes:3 S.Sahani
2 17/4/2014 1
array and linked representations
Outcomes:3 S.Sahani
3 22/4/2014 1
traversals, threaded binary trees
Outcomes:3 S.Sahani
4 24/4/2014 1
Disjoint Sets, Union and Find algorithms
Outcomes:3 S.Sahani
5 25/4/2014 1
Priority Queues-Definition,ADT, Realizing a Priority Objectives:8 and Applications in C++,
Queue using Heap Outcomes:3 S.Sahani
6 26/4/2014 1
Graphs – Introduction, Basic Terminology
Outcomes:4 S.Sahani
7 28/4/2014 1
Graph Representations- Adjacency matrix, Objectives:9 and Applications in C++,
Adjacency lists, Adjacency multilists Outcomes:4 S.Sahani
8 05/5/2014 1
Graph traversals- DFS and BFS
Outcomes:4 S.Sahani
9 10/5/2014 1
Date
MENTION THE CORRESPONDING COURSE OBJECTIVE AND OUT COME NUMBERS AGAINST EACH TOPIC .
2013-14
SCHEDULE OF INSTRUCTIONS
UNIT - III Regulation: R11
FACULTY DETAILS:
Department:: MCA

SI. No. of
No. Periods
1 Searching- Linear Search ,Binary Search
Outcomes:5 S.Sahani
18/6/2014 1
2 Hashing-Introduction, hash tables, hash functions
Outcomes:5 S.Sahani
19/6/2014 1
3 Comparison of Searching methods
Outcomes:5 S.Sahani
20/6/2014 1
4 Sorting- Bubble Sort, Insertion Sort, Selection Sort
Outcomes:5 S.Sahani
21/6/2014 1
5 Heap Sort, Radix Sort Algorithm
Outcomes:5 S.Sahani
24/6/2014 1
Design method- Divide and Conquer method- Objectives:13 and Applications in C++,
6 applications Outcomes:5 S.Sahani
25/6/2014 1
7 Quick sort, Merge sort
Outcomes:5 S.Sahani
26/6/2014 1
Comparison of Sorting methods, Model for Objectives:13 and Applications in C++,
8 External Sorting Outcomes:5 S.Sahani
03/7/2014 1
Date
2013-14
UNIT - IV Regulation: R11
FACULTY DETAILS:
Department:: MCA

SI. No. of
No. Periods
Search Trees-Binary Search Trees, Definition
Outcomes:6 S.Sahani
1 4/7/2014 1
Implementation, Operations- Searching, Insertion Objectives:14 and Applications in C++,
and Deletion Outcomes:6 S.Sahani
2 5/7/2014 1
AVL Trees, Definition, Operations – Insertion and Objectives:14 and Applications in C++,
Searching Outcomes:6 S.Sahani
3 8/7/2014 1
B-Trees, Definition, B-Tree of order m, operations- Objectives:15 and Applications in C++,
insertion and deletion Outcomes:6 S.Sahani
4 9/7/2014 1
Red-Black and Splay Trees(Elementary treatment
Outcomes:6 S.Sahani
5 11/7/2014 1
Comparison of Search Trees
Outcomes:6 S.Sahani
6 15/7/2014 1
Date
2013-14
UNIT - V Regulation: R11
FACULTY DETAILS:
Department:: MCA

SI. No. of
No. Periods
Algorithm Design methods-Greedy method
Outcomes:7 S.Sahani
1 16/7/2014 1
Kruskal’s Algorithm for Minimum cost Spanning Objectives:16 and Applications in C++,
trees Outcomes:7 S.Sahani
2 17/7/2014 1
Job Sequencing with deadlines, Single Source Objectives:16 and Applications in C++,
Shortest path problem Outcomes:7 S.Sahani
3 19/7/2014 1
Dynamic Programming method-applications- Objectives:16 and Applications in C++,
Ordering matrix multiplications Outcomes:7 S.Sahani
4 22/7/2014 1
Optimal Binary Search Trees
Outcomes:7 S.Sahani
5 23/7/2014 1
APSP problem
Outcomes:7 S.Sahani
6 24/7/2014 1
Text Processing - Pattern matching algorithm
Outcomes:8 S.Sahani
7 26/7/2014 1
The Knuth-Morris-Pratt algorithm, Tries
Outcomes:8 S.Sahani
8 03/8/2014 1
- Standard Tries, Compressed Tries, Suffix tries.
Outcomes:8 S.Sahani
9 09/8/2014 1
Date
MENTION THE CORRESPONDING COURSE OBJECTIVE AND OUT COME NUMBERS
AGAINST EACH TOPIC.
2013-14
COURSE COMPLETION STATUS
Regulation: R11
FACULTY DETAILS:
Subject:: Data structures and Algorithms Subject Code
Department:: MCA
Actual Date of Completion & Remarks, if any
Nos. of
Units Remarks Objectives
Achieved
Unit 1 Completed
7
Unit 2 Completed 3
Unit 3 Completed 3
Unit 4 2
Completed
Unit 5 2
Completed
Signature of Dean of School Signature of Faculty

Date: Date:
NOTE: AFTER THE COMPLETION OF EACH UNIT MENTION THE NUMBER OF OBJECTIVES ACHIEVED.
2013-14
TUTORIAL SHEETS - I
Regulation: R11
FACULTY DETAILS:
Department:: MCA
The Schedule for the whole Course / Subject is:: Data structures and Algorithms
Date:
This Tutorial corresponds to Unit Nos. 1, 2 Time:
Q1. Explain briefly about performance analysis (i) time complexity (ii) space
Complexity?
Q2. Implement double linked list ADT?
Q3. What is stack? Explain about stack applications?
Q4. What is Queue? Explain Queue applications?
Q5. Explain Asymptotic analysis (i) Big O,(ii)omega , (iii)theta notations?
Please write the Questions / Problems / Exercises which you would like to give to the students and also mention
the objectives to which these questions / Problems are related.

Date: Date:
2013-14
TUTORIAL SHEETS - II
Regulation: R11
FACULTY DETAILS:
Department:: MCA
The Schedule for the whole Course / Subject is:: Data structures and Algorithms
Date:
This Tutorial corresponds to Unit Nos. 3, 4, 5 Time:
Q1. Explain hashing & hashing functions with examples
Q2. Differentiate Insertion & section sort
Q3. Explain model for external sorting
Q4. Explain AVL tree rotations & insertion an a element
Q5. Explain greedy method apply jobseq with dead lines?
Please write the Questions / Problems / Exercises which you would like to give to the students and also mention
the objectives to which these questions / Problems are related.
Date: Date:
2013-14
ILLUSTRATIVE VERBS
FOR STATING
INSTRUCTIONAL OBJECTIVES Regulation: R11
These verbs can also be used while framing questions for Continuous Assessment Examinations as well as for End –
Semester (final) Examinations.
ILLUSTRATIVE VERBS FOR STATING GENERAL OBJECTIVES
Know Understand Analyze Generate

Comprehend Apply Design Evaluate
ILLUSTRATIVE VERBS FOR STATING SPECIFIC OBJECTIVES:

A. Cognitive
Domain
1 2 3 4 5 6
Comprehension
Knowledge Application Analysis Synthesis Evaluation
Understanding
of knowledge & of whole w.r.t. its combination of
judgement
comprehension constituents ideas/constituents
Define Convert Change Breakdown Categorize Appraise

Identify Defend Compute Differentiate Combine Compare
Label Describe (a Demonstrate Discriminate Compile Conclude
List procedure) Deduce Distinguish Compose Contrast
Match Distinguish Manipulate Separate Create Criticize
Reproduce Estimate Modify Subdivide Devise Justify
Select Explain why/how Predict Design Interpret
State Extend Prepare Generate Support
Generalize Relate Organize
Give examples Show Plan
Illustrate Solve Rearrange
Infer Reconstruct
Summarize Reorganize
Revise
C. Psychomotor Domain (skill

B. Affective Domain development)
Adhere Resolve Bend Dissect Insert Perform Straighten
Assist Select Calibrate Draw Keep Prepare Strengthen
Attend Serve Compress Extend Elongate Remove Time
Change Share Conduct Feed Limit Replace Transfer
Develop Connect File Manipulate Report Type
Help Convert Grow Move preciselyReset Weigh
Influence Decrease Handle Operate Run
Initiate Demonstrate Increase Paint Set
2013-14
LESSON PLAN
Unit-1
Regulation: R11
Name of the Faculty: M. Chandrasekhar

Subject Data structures and Alogorithms Subject Code
Unit 1
INSTRUCTIONAL OBJECTIVES:
Teachi
Session ng
Topics to be covered
No Time Ref Metho
d
Data structures-
1 Basic concepts-Data types, Abstract Data Types 50Mins BB
S.Sahani
Data structures ,Algorithms, Performance analysis- time complexity and space 50Mins Data structures-
2 BB
complexity S.Sahani
50Mins Data structures-
3 Asymptotic Analysis-Big Omega and Theta notations BB
S.Sahani
Linear data structures- Linear Lists, Sequential and Linked allocation ,The list 50Mins Data structures-
4 BB
ADT, array and linked Implementations S.Sahani
Singly Linked Lists-Operations-Insertion, Deletion, Doubly Linked 50Mins Data structures-
5 BB
Lists- Operations- Insertion, Deletion S.Sahani
6 Deletion, Stack ADT,definitions,operations, array and linked implementations BB
S.Sahani
7 applications-infix to postfix conversion BB
S.Sahani
Queue ADT, definitions and operations 50Mins Data structures-
8 BB
S.Sahani
9 Basic concepts-Data types, Abstract Data Types BB
S.Sahani
On completion of this lesson the student shall be able to(Outcomes)
1. To ability to understand the basics data structures and its importance to develop any system program.
2. To ability to understand the computational complexity of a given algorithm
3. To ability to understand how to Apply the different operations of linked list. Must know the merging of single
linked list and the advantages and disadvantages of linked list
4. To ability to understand basic concepts of stack
5. To ability to understand the application of stacks
6. To ability to understand the evaluation of arithmetic expressions
7. To understand the basic concepts of Queue and the applications of Queue

2013-14
ASSIGNMENT
Unit-I
Regulation: R11
Assignment / Questions
1. Explain briefly about performance analysis (i) time complexity (ii) space
Complexity?
2. Implement double linked list ADT?
3. What is stack? Explain about stack applications?
4. What is Queue? Explain Queue applications?
5. Explain priority Queue using heap?
Note: Mention for each question the relevant objectives and outcomes.
2013-14
LESSON PLAN
Unit-II
Regulation: R11
Name of the Faculty:

Subject Subject Code
Unit
Teac
Session hing
No Time Ref Met
hod
Data structures-
1 Non Linear data structures- Trees – Basic Terminology, 50Mins BB
S.Sahani
2 Binary tree ADT BB
S.Sahani
3 array and linked representations BB
S.Sahani
4 traversals, threaded binary trees BB
S.Sahani
5 Disjoint Sets, Union and Find algorithms BB
S.Sahani
6 Priority Queues-Definition,ADT, Realizing a Priority Queue using Heap BB
S.Sahani
7 Graphs – Introduction, Basic Terminology BB
S.Sahani
8 Graph Representations- Adjacency matrix, Adjacency lists, Adjacency multilists BB
S.Sahani
9 Graph traversals- DFS and BFS BB
S.Sahani
On completion of this lesson the student shall be able to
1. To ability to understand tree, binary tree concepts and the operations on binary trees
2. To ability to understand the basic concepts of graphs
3. To ability to understand the BFS,DFS graph traversals

2013-14
ASSIGNMENT
Unit-II
Regulation: R11
1. Explain (i) disjoin set (ii) union (III) find

2. Implement Binary ADT?
3. Explain graph travels with example?
4. Explain threaded binary tree with example?
5. Explain how many binary tree representations?
2013-14
LESSON PLAN
Unit-III
Regulation: R11

Unit
Teachi
Session ng
No Time Ref Metho
d
Data structures-
1 Searching- Linear Search ,Binary Search 50Mins BB
S.Sahani
2 Hashing-Introduction, hash tables, hash functions BB
S.Sahani
3 Comparison of Searching methods BB
S.Sahani
4 Sorting- Bubble Sort, Insertion Sort, Selection Sort BB
S.Sahani
5 Heap Sort, Radix Sort Algorithm BB
S.Sahani
6 Design method- Divide and Conquer method-applications BB
S.Sahani
7 Quick sort, Merge sort BB
S.Sahani
8 Comparison of Sorting methods, Model for External Sorting BB
S.Sahani
On completion of this lesson the student shall be able to(Outcomes)
1. To ability to understand the search algorithms
2. To ability to understand the different sorting algorithms
3. To ability to understand the different sorting techniques.

2013-14
ASSIGNMENT
Unit-III
Regulation: R11
1. Differentiate Insertion & section sort

2. Explain quick sort & merge sort
3. Comparison of searching methods
4. Comparison of sorting methods
5. Explain model for external sorting
2013-14
LESSON PLAN
Unit-IV
Regulation: R11

Unit
Teachin
Session
Topics to be covered g
No Time Ref
Method
Data structures-
1 Search Trees-Binary Search Trees, Definition 50Mins BB
S.Sahani
2 Implementation, Operations- Searching, Insertion and Deletion BB
S.Sahani
3 AVL Trees, Definition, Operations – Insertion and Searching BB
S.Sahani
4 B-Trees, Definition, B-Tree of order m, operations- insertion and deletion BB
S.Sahani
5 Red-Black and Splay Trees(Elementary treatment BB
S.Sahani
6 Comparison of Search Trees BB
S.Sahani
On completion of this lesson the student shall be able to (Outcomes)
1. To ability to Understand the Binary Search tree and operations and know the AVL tree operations
2. To ability to understand the B-Tree operations and introduction of Red black and Splay Trees
2013-14
ASSIGNMENT
Unit-IV
Regulation: R11
1. Explain AVL tree rotations & insertion an a element

2. Avl trees operations insertion deletion searching
3. What is BST? Explain operations of BST.
4. Differentiate Search trees.
2013-14
LESSON PLAN
Unit-V
Regulation: R11

Unit
Teachi
Session ng
No Time Ref Metho
d
Data structures-
1 Algorithm Design methods-Greedy method 50Mins S.Sahani BB

2 Kruskal’s Algorithm for Minimum cost Spanning trees BB
S.Sahani
3 Job Sequencing with deadlines, Single Source Shortest path problem BB
S.Sahani
4 Dynamic Programming method-applications-Ordering matrix multiplications BB
S.Sahani
5 Optimal Binary Search Trees BB
S.Sahani
6 APSP problem BB
S.Sahani
7 Text Processing - Pattern matching algorithm BB
S.Sahani
8 The Knuth-Morris-Pratt algorithm, Tries BB
S.Sahani
9 - Standard Tries, Compressed Tries, Suffix tries. BB
S.Sahani
On completion of this lesson the student shall be able to (Outcomes)
1. To ability to understand the algorithm Design Methods and applications.

2. To ability to understand the different Pattern Matching algorithms.
2013-14
ASSIGNMENT
Unit-V
Regulation: R11
1. Explain pattern matching tech

2. Explain Kruskal’s algorithm problem.
3. Explain greedy method application jobseq with dead lines
4. Explain tries with examples
5. Explain prim’s algorithm with example

Course Plan: ST ND

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Course Plan: ST ND

Uploaded by

Copyright:

Available Formats

COURSE PLAN

a) Percentage Pass 100

1. Coverage of Subject, unit-wise by teaching in the class

3.1. Continuous Assessment Examinations (CAE 1, CAE 2) Yes

3.2. Assignments / Seminars Yes

3.3. Mini Projects

3.4. Quiz Yes

3.5. Term End Examination Yes

Signature of HOD Signature of Faculty

GUIDELINES TO STUDY THE SUBJECT

2. To find the computational complexity of a given algorithm

4. To understand the basic concepts of stack

5. Must know the application of stacks

6. Must know the evaluation of arithmetic expressions

7. To understand the basic concepts of Queue and the applications of Queue

9. To understand the basic concepts of graphs

10. To understand the BFS,DFS graph traversals

11. Must know the search algorithms

12. Must know the different sorting algorithms

13. To understand the different sorting techniques.

16. To understand the algorithm Design Methods and applications.

17. To understand the different Pattern Matching algorithms.

2. Compare iterative and recursive solutions for elementary problems.

3. Analyze various algorithms and its time and space complexity.

4. Understand the usage of various data structures.

5. Familiar with various searching and sorting techniques.

6. Analyze the associated algorithms, operations and time complexity.

9. Think critically and solve problems independently.

On completion of this Subject / Course the student shall be able to:

S.No. Objectives Outcomes

The expected outcomes of the Course / Subject are:

S.No. General Categories of Outcomes Specific Outcomes of the Course

An ability to design and conduct experiments, as

D. An ability to function on multi-disciplinary teams

An ability to identify, formulate, and solve

An understanding of professional and ethical

G. An ability to communicate effectively

The broad education necessary to understand the

J. A knowledge of contemporary issues

An ability to use the techniques, skills, and

Objectives – Outcome Relationship Matrix (Indicate the relationships by  mark).

Duration (Date) Total No.

UNIT - I Regulation: R11

Designation: Assistant Professor

Objectives & References

UNIT - II Regulation: R11

Designation: Assistant Professor

Objectives & References

UNIT - III Regulation: R11

Designation: Assistant Professor

Objectives & References

UNIT - IV Regulation: R11

Designation: Assistant Professor

Objectives & References

UNIT - V Regulation: R11

Designation: Assistant Professor

Objectives & References

Subject:: Data structures and Algorithms Subject Code

Actual Date of Completion & Remarks, if any

Signature of Dean of School Signature of Faculty

Q2. Implement double linked list ADT?

Q3. What is stack? Explain about stack applications?