Scribd
Upload
71 views

Data and File Structures

This document outlines the course content for the subject "Data and File Structures" which is part of the 3rd semester Computer Science and Engineering program. The course covers linear data structures like arrays, stacks, queues and linked lists, nonlinear data structures like trees and graphs, hashing techniques and file organization methods. Students will complete at least 10 practical programming assignments to reinforce concepts. Reference books on data structures using C/C++ are also provided.

Uploaded by

VivekPatel
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
71 views

Data and File Structures

This document outlines the course content for the subject "Data and File Structures" which is part of the 3rd semester Computer Science and Engineering program. The course covers linear data structures like arrays, stacks, queues and linked lists, nonlinear data structures like trees and graphs, hashing techniques and file organization methods. Students will complete at least 10 practical programming assignments to reinforce concepts. Reference books on data structures using C/C++ are also provided.

Uploaded by

VivekPatel
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

GUJARAT TECHNOLOGICAL UNIVERSITY

B.E Semester: 3
Computer Science and Engineering
Subject Code
Subject Name

Sr.No

130702
DATA AND FILE STRUCTURES

Course content

1.

INTRODUCTION TO DATA STRUCTURE:


Data Management concepts, Data types primitive and nonprimitive,
Performance Analysis and Measurement (Time and space analysis of
algorithms-Average, best and worst case analysis), Types of Data
Structures- Linear & Non Linear Data Structures.

2.

LINEAR DATA STRUCTURE Array:


Representation of arrays, Applications of arrays, sparse matrix and its
representation., Stack: Stack-Definitions & Concepts, Operations On
Stacks, Applications of Stacks, Polish Expression, Reverse Polish
Expression And Their Compilation, Recursion, Tower of Hanoi, Queue:
Representation Of Queue, Operations On Queue, Circular Queue, Priority
Queue, Array representation of Priority Queue, Double Ended Queue,
Applications of Queue, Linked List: Singly Linked List, Doubly Linked list,
Circular linked list ,Linked implementation of Stack, Linked implementation
of Queue, Applications of linked list.

3.

NONLINEAR DATA STRUCTURE :


Tree-Definitions and Concepts, Representation of binary tree, Binary tree
traversal (Inorder, postorder, preorder), Threaded binary tree, Binary search
trees, Conversion of General Trees To Binary Trees, Applications Of TreesSome balanced tree mechanism, eg. AVL trees, 2-3 trees, Height
Balanced, Weight Balance , Graph-Matrix Representation Of Graphs,
Elementary Graph operations,(Breadth First Search, Depth First Search,
Spanning Trees, Shortest path, Minimal spanning tree )

4.

HASHING AND FILE STRUCTURES :


Hashing: The symbol table, Hashing Functions, Collision-Resolution
Techniques, File Structure: Concepts of fields, records and files,
Sequential, Indexed and Relative/Random File Organization, Indexing
structure for index files, hashing for direct files, Multi-Key file organization
and access methods.

5.

PRACTICAL DETAILS:
At least 10 practical should be performed by students using programming
language.

Reference Books:
1.
2.
3.
4.
5.

An Introduction to Data Structures with Applications. by Jean-Paul Tremblay &


Paul G. Sorenson Publisher-Tata McGraw Hill.
Data Structures using C & C++ -By Ten Baum Publisher Prenctice-Hall
International.
Fundamentals of Computer Algorithms by Horowitz, Sahni,Galgotia Pub. 2001
ed.
Fundamentals of Data Structures in C++-By Sartaj Sahani.
Data Structures: A Pseudo-code approach with C -By Gilberg & Forouzan
Publisher-Thomson Learning.

You might also like