[go: up one dir, main page]
Scribd
Upload
7 views2 pages

TBC 201 Data Structures and File Organization

The document outlines the course details for 'Data Structures and File Organization' (TBC-201), including contact hours, examination duration, weightage, credits, prerequisites, and objectives. It specifies the course outcomes, which include comprehensive knowledge of data structures, algorithmic design, and practical experience with searching and sorting algorithms. Additionally, the document provides a detailed syllabus covering various topics such as algorithms, stacks, queues, linked lists, searching, sorting, trees, and file organization.

Uploaded by

yj318883
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views2 pages

TBC 201 Data Structures and File Organization

The document outlines the course details for 'Data Structures and File Organization' (TBC-201), including contact hours, examination duration, weightage, credits, prerequisites, and objectives. It specifies the course outcomes, which include comprehensive knowledge of data structures, algorithmic design, and practical experience with searching and sorting algorithms. Additionally, the document provides a detailed syllabus covering various topics such as algorithms, stacks, queues, linked lists, searching, sorting, trees, and file organization.

Uploaded by

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

Subject Name: Data Structures and File Organization Subject Code: TBC-201

1 Contact Hours: 42 L 2 T1 P 2
2 Examination Duration(Hrs): Theory 0 3 Practical 0 2

3 Relative Weightage: CWE: 25 MTE: 25 ETE: 50

4 Credits: 0 3

5 Semester: 
Autumn Spring Both

6 Pre-Requisite: Basic knowledge of the C programming Concepts

7 Subject Area: Programming

8 Objective: To familiarize students with the basic knowledge of the data structures
which are applied at the various levels of the computer science.

9 Course Outcome: A student who successfully fulfills the course requirements will be able to-
a. Have a comprehensive knowledge of the data structures and algorithms on which file structures
and data bases are based.
b. Understand the importance of data and be able to identify the data requirements for an
application.
c. Have a solid understanding and practical experience of algorithmic design and implementation.
d. Understand the basics of searching and sorting algorithms.
e. Understand the concepts of trees in data structure.

10 Details of the Course:


Unit CONTENT CONTACT
No. HOURS
1 Algorithm Basics: Basic Terminology, types and characteristics, Algorithm 8
Complexity and Time-Space trade-off.
Introduction to Data Structure: Elementary Data Organization, Data Structure
operations,
Pointers Review; Static and Dynamic Memory Allocation;
Arrays: Definition, Representation and Analysis, Single and Multidimensional
Arrays, address calculation, application of arrays, Character, Array as
Parameters, Ordered list, Sparse Matrices, and Vector.
2 Stacks: Array Representation and Implementation of stack, Operations and 9
Stacks: Push and POP, Array Representation of Stack, Linked Representation of
stack, Operations Associated with Stacks, Application of stack, Conversion of
Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using
stack.
Queues: Array and linked representation and implementation of queues,
Operations on Queue; Create, Add, Delete, Full and Empty, Circular queue, De-

Graphic Era Deemed to be University, 2021, Review-6, w.e.f.: 2021-22


que, and Priority Queue.
3 Link List (s): Representation and implementation of Singly linked lists, Header 8
Linked List, Insertion and deletion to from Linked Lists Traversing and
Searching of Linked List, Overflow and Underflow, , Insertion and deletion
Algorithms, Doubly linked list, Polynomial representation and addition,
Generalized linked list, Garbage Collection and Compaction.

4 Searching : Linear and Binary searching, Hashing ,Hash table, Hash collisions 8
removal techniques.
Sorting: Bubble sort technique, Selection sort technique, Insertion sort
technique, Merge sort technique, quick sort technique.
Recursion: definition, types of recursion, call stack, iteration – recursion
difference.
5 Trees: Basic terminology, types; 9
Binary Trees : Binary Tree, Binary tree representation algebraic Expressions,
Complete Binary Tree, Extended Binary Tree, Array and Linked Representation
of Binary trees, Traversing Binary trees;
Binary Search Trees: insertion, traversing, search, deletion operations
Threaded binary tree, AVL tree(Height balance tree),
Huffman algorithm : Huffman tree and Codes;
Multi-way Search trees: B –Trees, B+ Tree;
File organizations :Introduction to file system ,Sequential file organization,
Index sequential organization, Relative file organization, Multi-key file
organization.
TOTAL 42

11 Suggested Books:
Sl. NO. YEAR OF
NAME OF AUTHERS/BOOKS/PUBLISHERS PUBLICATION
1 G.S.Baluja ,”Data Structure through C”,Dhanpat Rai 2007
2 Lipschutz ,”Data Structure”,TMH 2002
3 Data Structure and Program Design in C-Tanenbaum 1998

Graphic Era Deemed to be University, 2021, Review-6, w.e.f.: 2021-22

You might also like