Programming and Data Structures I

CS6202
CSE IT

Unit 1

C PROGRAMMING FUNDAMENTALS- A REVIEW

Conditional statements – Control statements – Functions – Arrays – Preprocessor - Pointers - Variation in pointer declarations – Function Pointers – Function with Variable number of arguments

Part A (2m) Part B (16m)

Unit 2

C PROGRAMMING ADVANCED FEATURES

Structures and Unions - File handling concepts – File read – write – binary and Stdio - File Manipulations I

Part A (2m) Part B (16m)

Unit 3

LINEAR DATA STRUCTURES – LIST

Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation –– singly linked lists- circularly linked lists- doubly-linked lists – applications of lists –Polynomial Manipulation – All operation (Insertion, Deletion, Merge, Traversal) 27

Part A (2m) Part B (16m)

Unit 4

LINEAR DATA STRUCTURES – STACKS, QUEUES

Stack ADT – Evaluating arithmetic expressions- other applications- Queue ADT – circular queue implementation – Double ended Queues – applications of queues

Part A (2m) Part B (16m)

Unit 5

SORTING, SEARCHING AND HASH TECHNIQUES

Sorting algorithms: Insertion sort - Selection sort - Shell sort - Bubble sort - Quick sort - Merge sort - Radix sort – Searching: Linear search –Binary Search Hashing: Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing

Part A (2m) Part B (16m)
Related Notes