Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
38 views1 page

Major Data Structure (5th Sem Syllabus)

The document outlines the curriculum for a 5th semester course on Data Structures using C, covering key concepts such as structured data, arrays, sorting and searching algorithms, stacks, queues, linked lists, trees, and graphs. It includes both theoretical and practical components, with recommended textbooks for further study. The practical component is based on the theoretical units discussed in the course.

Uploaded by

jasirzahoor92
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
38 views1 page

Major Data Structure (5th Sem Syllabus)

The document outlines the curriculum for a 5th semester course on Data Structures using C, covering key concepts such as structured data, arrays, sorting and searching algorithms, stacks, queues, linked lists, trees, and graphs. It includes both theoretical and practical components, with recommended textbooks for further study. The practical component is based on the theoretical units discussed in the course.

Uploaded by

jasirzahoor92
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

BACHELORS WITH INFORMATION TECHNOLOGY AS MAJOR (CT – III)

5th SEMESTER
BIT522J3: INFORMATION TECHNOLOGY _ DATA STRUCTURES USING C
CREDITS: THEORY-04; TUTORIAL-02
THEORY (4 CREDITS)
UNIT-I: INTRODUCTION TO DATA STRUCTURES

CONCEPT OF STRUCTURED DATA:


Data and Information, Data Structure, Classification of Data Structure, Primitive Data Types, Operations on Data
Structure, Control structures

ARRAYS: Introduction, representation of 1D & 2D array


Operations on arrays: Searching, traversal, insertion, deletion.

UNIT-II: SORTING AND SEARCHING ALGORITHMS

SEARCHING:
Linear search, Binary search,

SORTING:
Bubble Sort, Insertion Sort, Selection Sort, Quick sort and Merge sort

UNIT-III STACKS QUEUES AND LINKED LISTS

Stack: Introduction, Operations on the Stack Memory Representation of Stack, Array implementation of Stack,
Applications of Stack
Queue: Introduction, Queue, Operations on the Queue, Memory Representation of Queue, Array implementation of
queue, Circular Queue, Some special kinds of queues, Deque, Priority Queue, Applications of Queues.

LINKED LISTS: Introduction to Linked List, Allocation and De-allocation, Traversing a linked list, Insertion in
Linked List, Deletion from Linked List, Circular Linked List, Doubly Linked List, Traversing a doubly-linked list,
insertion and deletion from doubly linked list.

UNIT-IV TREES

TREES: Basic Terminology: Representation of Binary Trees, Binary Search Trees, Traverse a binary tree (pre-order,
In-order and Post-order) , searching, insertion and deletion in binary search tree.
GRAPHS: Introduction to graphs, BFS and DFS algorithms.

PRACTICAL (2- CREDITS)

NOTE: THE PRACTICAL COMPONENT SHALL BE BASED ON THE UNIT-I TO UNIT-IV

RECOMMENDED BOOKS:

1: Data Structures Using C by E Balagurusamy, Tata McGraw Hill, India


2. Yashwant Kanitkar “Understanding pointers in C”
3. Aaron M .Tenenbaum by Data Structure using C and C ++
4. “Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni, Galgotia Publications.
5. Data Structures by Seymour Lipschutz, MCGraw Hill Education

You might also like