Programming and data structures 1 syllabus

PROGRAMMING AND DATA STRUCTURES 1 SYLLABUS

OBJECTIVES: sem2 Programming and data structures 1
The student should be made to:
 Be familiar with the basics of C programming language.
 Be exposed to the concepts of ADTs
 Learn linear data structures – list, stack, and queue.
 Be exposed to sorting, searching, hashing algorithms

UNIT I C PROGRAMMING FUNDAMENTALS

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

UNIT II C PROGRAMMING ADVANCED FEATURES

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

UNIT III LINEAR DATA STRUCTURES

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).

UNIT IV LINEAR DATA STRUCTURES – STACKS, QUEUES

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

UNIT V 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.

PREFERRED LINKS :

• Engineering physics II syllabus
• Technical English – II Syllabus
• Programming and Data Structures I Syllabus
• Engineering Chemistry – II Syllabus
• Mathematics – II Syllabus
• Digital Principles and System Design Syllabus

 

For further syllabus, notes, video materials and question papers visit kprblog.in

 Mail your Feedback/Queries to [email protected]

For more knowledge visit tricksout