Posts

Data Structures and Algorithms PCCST303 KTU 2024 Scheme- Dr Binu V P

About Me Syllabus and evaluation scheme  1.Basic Concepts of Data Structures     Data structures and data abstraction     Time and Space Complexity     Asymptotic Analysis and Asymptotic Notations     Best case, Worst case and Average Case Analysis of Algorithms     Frequency Count Method of Algorithm Analysis     Polynomial Representation using arrays      Polynomial Addition using arrays      Sparse Addition and Transpose     Stacks     Multi Stacks      Queue using array      Circular Queue using array      Double ended Queue using array     Infix to postfix and postfix evaluation     Infix to prefix and prefix evaluation    2.Linked List and Memory Management          Self Referential Data Structures     Dynamic Memory Allocation in C     Singly Linked...
Post a Comment
Read more

Data Structures and Algorithms PCCST303 KTU 2024 Scheme- Syllabus

  SEMESTERS 3 DATA STRUCTURES AND ALGORITHMS (Common to CS/CA/CM/CD/CR/AI/AM/AD/CB/CN/CC/CU/CI/CG)   Course Code PCCST303 CIE Marks 40 Teaching Hours/Week (L: T:P: R)   3:1:0:0 ESE Marks 60 Credits 4 Exam Hours 2Hrs.30 Min. Prerequisites(if any) UCEST105 Course Type Theory Course Objectives: 1. To provide the learner a comprehensive understanding of data structures and algorithms. 2. To prepare them for advanced studies or professional work in computer science and related fields. SYLLABUS   Module No. Syllabus Description Contact Hours       1 Basic Concepts of Data Structures Definitions; Data Abstraction; Performance Analysis - Time& Space Complexity, Asymptotic Notations; Polynomial representation using Arr...
Post a Comment
Read more