CS3353 C Programming and Data Structures Notes
Download CS3353 C Programming and Data Structures Books, Lecture Notes, Part-A 2 marks with answers, Part-B 16 marks Questions, PDF Books. In this Notes Very Useful for Second Year Third Semester Students.
“CS3353 C Programming and Data Structures Books”
“CS3353 C Programming and Data Structures Lecture Notes”
“CS3353 C Programming and Data Structures Study Material”
“CS3353 C Programming and Data Structures Notes”
Subject Info:
| Semester | Third Semester |
| Department | ECE |
| Year | Second Year |
| Regulation | R 2021 |
| Subject Code / Name | CS3353 C Programming and Data Structures |
| Content | Local Authors Books, Lecture Notes |
Syllabus:
CS3353 C Programming and Data Structures
UNIT I C PROGRAMMING FUNDAMENTALS (8+1 SKILL)
Data Types – Variables – Operations – Expressions and Statements – Conditional Statements – Functions – Recursive Functions – Arrays – Single and Multi-Dimensional Arrays.
UNIT II C PROGRAMMING – ADVANCED FEATURES (8+1 SKILL)
Structures – Union – Enumerated Data Types – Pointers: Pointers to Variables, Arrays and Functions – File Handling – Preprocessor Directives.
UNIT III LINEAR DATA STRUCTURES (8+1 SKILL)
Abstract Data Types (ADTs) – List ADT – Array-Based Implementation – Linked List – Doubly- Linked Lists – Circular Linked List – Stack ADT – Implementation of Stack – Applications – Queue ADT – Priority Queues – Queue Implementation – Applications.
UNIT IV NON-LINEAR DATA STRUCTURES (8+1 SKILL)
Trees – Binary Trees – Tree Traversals – Expression Trees – Binary Search Tree – Hashing – Hash Functions – Separate Chaining – Open Addressing – Linear Probing– Quadratic Probing – Double Hashing – Rehashing.
UNIT V SORTING AND SEARCHING TECHNIQUES (8+1 SKILL)
Insertion Sort – Quick Sort – Heap Sort – Merge Sort –Linear Search – Binary Search.