Engineering Tutorials

CSE-201 F Data Structures Using ‘C’

Section-A Overview of C, Introduction, Stacks and Queues

Overview of ‘C’ :Introduction , Flow of Control, Input output functions, Arrays and

Structures, Functions

Data structures and Algorithms: an overview : concept of data structure, choice of right

data structures, types of data structures, basic terminology Algorithms, how to design and

develop an algorithm: stepwise refinement, use of accumulators and counters; algorithm

analysis, complexity of algorithms Big-oh notation.

Arrays : Searching Sorting: Introduction, One Dimensional Arrays, operations defined :

traversal, selection, searching, insertion, deletion, and sorting

Searching: linear search, binary search; Sorting : selection sort, bubble sort, insertion sort,

merge sort, quick sort, shell sort. Multidimensional arrays, address calculation of a location

in arrays.

Stacks and queues: Stacks, array representation of stack. Applications of stacks. Queues, Circular queues, , array representation of Queues,. Deques, priority queues, Applications of Queues.

Section-B Pointers and Linked Lists;

Pointers: Pointer variables, Pointer and arrays, array of pointers, pointers and structures,

Dynamic allocation.

Linked Lists: Concept of a linked list,. Circular linked list, doubly linked list, operations on

linked lists. Concepts of header linked lists. Applications of linked lists, linked stacks, linked

Queues.

Section-C Trees and Graphs

Trees: Introduction to trees, binary trees, representation and traversal of trees, operations on binary trees, types of binary trees, threaded binary trees, B Trees, . Application of trees. Graphs : Introduction, terminology, ‘set, linked and matrix’ representation, operations on graphs, Applications of graphs.

Section-D file Handling and Advanced data Structure

Introduction to file handling, Data and Information, File concepts, File organization, files and streams, working with files. AVL trees, Sets, list representation of sets, applications of sets, skip lists

Text Book:

• Data Structures using C by A. M. Tenenbaum, Langsam, Moshe J. Augentem, PHI Pub.

• Data Structures using C by A. K. Sharma, Pearson

Reference Books:

• Data Structures and Algorithms by A.V. Aho, J.E. Hopcroft and T.D. Ullman, Original edition, Addison-Wesley, 1999, Low Priced Edition.

• Fundamentals of Data structures by Ellis Horowitz & Sartaj Sahni, Pub, 1983,AW

• Fundamentals of computer algorithms by Horowitz Sahni and Rajasekaran.

• Data Structures and Program Design in C By Robert Kruse, PHI,

• Theory & Problems of Data Structures by Jr. Symour Lipschetz, Schaum’s outline by TMH

• Introduction to Computers Science -An algorithms approach , Jean Paul Tremblay, Richard B. Bunt, 2002, T.M.H.

• Data Structure and the Standard Template library – Willam J. Collins, 2003, T.M.H

Related posts:

1. CSE-201 E Data Structures & Algorithms
2. UPTU Syllabus | ECS-302 : DATA STRUCTURES USING – C
3. MDU Syllabus | F-Scheme | CSE-205 F Data Structures using ‘C’ Lab.
4. CSE-205 E Data Structures & Algorithms Lab.
5. PTU Syllabus | CS-207 DATA STRUCTURES & PROGRAMMING METHODOLOGY