EC8393 – Fundamentals of Data Structures in C – Regulation 2017 Syllabus

EC8393 – NOTES & QP

NOTES CLICK HERE
SEMESTER QP CLICK HERE

EC8393 – SYLLABUS

UNIT I C PROGRAMMING BASICS

Structure of a C program — compilation and linking processes — Constants, Variables — Data Types — Expressions using operators in C — Managing Input and Output operations — Decision Making and Branching — Looping statements. Arrays — Initialization — Declaration — One dimensional and Two-dimensional arrays. Strings- String operations — String Arrays. Simple programs- sorting- searching — matrix operations.

UNIT II FUNCTIONS, POINTERS, STRUCTURES AND UNIONS

Functions — Pass by value — Pass by reference — Recursion — Pointers — Definition — Initialization — Pointers arithmetic. Structures and unions — definition — Structure within a structure — Union — Programs using structures and Unions — Storage classes, Pre-processor directives.

UNIT III LINEAR DATA STRUCTURES

Arrays and its representations — Stacks and Queues — Linked lists — Linked list-based implementation of Stacks and Queues — Evaluation of Expressions — Linked list based polynomial addition.

UNIT IV NON-LINEAR DATA STRUCTURES

Trees — Binary Trees — Binary tree representation and traversals –Binary Search Trees — Applications of trees. Set representations — Union-Find operations. Graph and its representations — Graph Traversals.

UNIT V SEARCHING AND SORTING ALGORITHMS

Linear Search — Binary Search. Bubble Sort, Insertion sort — Merge sort — Quick sort — Hash tables — Overflow handling.