https://github.com/paulthomas20002/s3-data-structures

KTU S3 CST 201
https://github.com/paulthomas20002/s3-data-structures

cst201 data-structures ktu module s3

Last synced: about 2 months ago
JSON representation

KTU S3 CST 201

• Host: GitHub
• URL: https://github.com/paulthomas20002/s3-data-structures
• Owner: PaulThomas20002
• Created: 2021-11-22T13:05:07.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2022-03-02T18:43:56.000Z (almost 3 years ago)
• Last Synced: 2023-06-14T19:08:49.878Z (over 1 year ago)
• Topics: cst201, data-structures, ktu, module, s3
• Language: C
• Homepage:
• Size: 138 KB
• Stars: 3
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# S3-Data-Structures

KTU S3 CST 201 & CSL 201






To help 2nd Year KTU students

CST201



DATA-STRUCTURES-SYLLABUS






Module 1




Basic Concepts of Data Structures

System Life Cycle, Algorithms, Performance Analysis, Space Complexity, Time Complexity,

Asymptotic Notation, Complexity Calculation of Simple Algorithms





Module 2




Arrays and Searching

Polynomial representation using Arrays, Sparse matrix, Stacks, Queues-Circular Queues, Priority

Queues, Double Ended Queues, Evaluation of Expressions

Linear Search and Binary Search





Module 3




Linked List and Memory Management

Self Referential Structures, Dynamic Memory Allocation, Singly Linked List-Operations on

Linked List. Doubly Linked List, Circular Linked List, Stacks and Queues using Linked List,

Polynomial representation using Linked List

Memory allocation and de-allocation-First-fit, Best-fit and Worst-fit allocation schemes





Module 4




Trees and Graphs

Trees, Binary Trees-Tree Operations, Binary Tree Representation, Tree Traversals, Binary Search

Trees- Binary Search Tree Operations

Graphs, Representation of Graphs, Depth First Search and Breadth First Search on Graphs,

Applications of Graphs





Module 5




Sorting and Hashing

Sorting Techniques – Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Heap Sort

Hashing- Hashing Techniques, Collision Resolution, Overflow handling, Hashing functions –

Mid square, Division, Folding, Digit Analysis