Data Structures Syllabus

B.Tech. (ECE) V Semester

DATA STRUCTURES using ‘C’

Course Code: EUREC504 Category: CE

Credits: 3 Hours: 3 per week

Department: ECE

UNIT-I

Arrays: Organization and use of one-dimensional arrays, operations, two dimensional and multidimensional arrays – Algorithms of all operations on linear arrays.

UNIT-II

Structures, pointers and files: definition of structures and unions, programming examples; pointers, pointer expression, programming examples; file operations, process.

UNIT-III

Linear Data Structures: Stack representation, operational algorithms, arithmetic expression: polish Notation. Queue representation, operations algorithms deques, priority queues, circular queues. Linked list representation operations algorithms double linked and circular lists.

UNIT-IV

Non-linear Data structures: Tress, Binary tree representation, tree traversals, Huffman’s algorithms conversion of general tree to binary tree. Graph representation, Warshall’s algorithms, shortest paths, linked representation of a graph, operations of graph, traversing a graph.

UNIT-V

Sorting, Searching and Unix operating systems: Bubble sort, quick sort, hcap sort Linear search. Binary search, Study of Unix operating system: file system protection, Unix shell programming.

Text Books:

1. Programming in ANSIC – E Balaguruswamy

2. Data Structures using C, - A.M. Tanebaum and others 2003

Reference Books:

1. Data Structures – Schaum’s outline series.

2. An introduction to data structures with applications – Trembly & Sorenson.