Scribd
Upload
78 views1 page

Objective: This Unit Discusses About The Analysis and Performance Measure of Data

This document outlines the syllabus for the Data Structures and Algorithms course CS9212. It covers asymptotic notations for analyzing algorithms, elementary data structures like arrays and linked lists, trees, solving recurrence relations, NP-completeness and more. The course is divided into 9 sessions that will use whiteboarding and lectures to cover these topics over 9 weeks using references from 2-5 textbooks.

Uploaded by

Kavinhariharasudhan Sankaralingam
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
78 views1 page

Objective: This Unit Discusses About The Analysis and Performance Measure of Data

This document outlines the syllabus for the Data Structures and Algorithms course CS9212. It covers asymptotic notations for analyzing algorithms, elementary data structures like arrays and linked lists, trees, solving recurrence relations, NP-completeness and more. The course is divided into 9 sessions that will use whiteboarding and lectures to cover these topics over 9 weeks using references from 2-5 textbooks.

Uploaded by

Kavinhariharasudhan Sankaralingam
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Sub Code & Name: CS9212 DATA STRUCTURES & ALGORITHMS

Branch :M.E CSE Semester :I UNIT I COMPLEXITY ANALYSIS & ELEMENTARY DATA STRUCTURES 9 Asymptotic notations Properties of big oh notation asymptotic notation with several parameters conditional asymptotic notation amortized analysis NP-completeness NP-hard recurrence equations solving recurrence equations arrays linked lists trees.

Objective: This unit discusses about the analysis and performance measure of data structures as well as algorithmic techniques. Session No 1. 2 3. 4. 5 6. 7. 8. 9. Topics to be covered Introduction,Basic concepts of algorithms Algorithm Specifications Asymptotic notation Asymptotic notation-different parameters,condition Amortized analysis NP completeness NP hard Recurrence equations,Arrays Linked lists and trees Time Allocation 50m 50m 50m 50m 50m 50m 50m 50m 50m Books Referred 2,4 2,4 2,4,5 2,4,5 2,4,5 1,2,5 1,2,5 1,2 1,2 Teaching Method BB BB BB BB BB BB BB BB BB

You might also like