Gujarat Technological University Computer Engineering (07) / Information Technology (16) / Information & Communication Technology

GUJARAT TECHNOLOGICAL UNIVERSITY
COMPUTER ENGINEERING (07) / INFORMATION TECHNOLOGY

(16) / INFORMATION & COMMUNICATION TECHNOLOGY (32)
DATA STRUCTURES
SUBJECT CODE: 2130702
B.E. 3rd Semester
Type of course: Compulsory
Prerequisite: Computer Programming & utilization
Rationale: Data structure is a subject of primary importance in Information and Communication

Technology. Organizing or structuring data is important for implementation of efficient algorithms
and program development. Efficient problem solving needs the application of appropriate data
structure during program development.
Understanding of data structures is essential and this facilitates the understanding of the
language. The practice and assimilation of data structure techniques is essential for programming. The
knowledge of „C‟ language and data structures will be reinforced by practical exercises during the
course of study. The course will help students to develop the capability of selecting a particular data
structure.
Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total
L T P C Theory Marks Practical Marks Marks
ESE PA (M) PA (V) PA
(E) PA ALA ESE OEP (I)
4 0 4 8 70 20 10 20 10 20 150
Contents:
Teaching Module
Sr. No. Topics
Hrs. Weightage
1 INTRODUCTION TO DATA STRUCTURE: 04 10
Data Management concepts, Data types – primitive and
non-primitive, 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 13 30
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 : 13 30

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 Trees-
Some 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 : 06 15
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 Sorting & Searching: 06 15
Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge
Sort Searching – Sequential Search and Binary Search
Reference Books:
1. An Introduction to Data Structures with Applications. by Jean-Paul Tremblay & Paul G.
Sorenson Publisher-Tata McGraw Hill.
2. Data Structures using C & C++ -By Ten Baum Publisher – Prenctice-Hall International.
3. Fundamentals of Computer Algorithms by Horowitz, Sahni,Galgotia Pub. 2001 ed.
4. Fundamentals of Data Structures in C++-By Sartaj Sahani.
5. Data Structures: A Pseudo-code approach with C -By Gilberg & Forouzan Publisher-
Thomson Learning.
Course Outcome:
After learning the course the students should be able:
1. Differentiate primitive and non primitive structures
2. Design and apply appropriate data structures for solving computing problems.
3. Apply sorting and searching algorithms to the small and large data sets.
List of Practical:
At least 10 practical should be performed by students using programming language.
1. Introduction to pointers. Call by Value and Call by reference.

2. Introduction to Dynamic Memory Allocation. DMA functions malloc(), calloc(), free() etc.
3. Implement a program for stack that performs following operations using array.
(a) PUSH (b) POP (c) PEEP (d) CHANGE (e) DISPLAY
4. Implement a program to convert infix notation to postfix notation using stack.

5. Write a program to implement QUEUE using arrays that performs following operations (a)
INSERT (b) DELETE (c) DISPLAY
5. Write a program to implement Circular Queue using arrays that performs following
operations. (a) INSERT (b) DELETE (c) DISPLAY
6. Write a menu driven program to implement following operations on the singly linked list.
(a) Insert a node at the front of the linked list.
(b) Insert a node at the end of the linked list.
(c) Insert a node such that linked list is in ascending order.(according to info. Field)
(d) Delete a first node of the linked list.
(e) Delete a node before specified position.
(f) Delete a node after specified position.
7. Write a program to implement stack using linked list.
8. Write a program to implement queue using linked list.
9. Write a program to implement following operations on the doubly linked list.
(a) Insert a node at the front of the linked list.
(b) Insert a node at the end of the linked list.
(c) Delete a last node of the linked list.
(d) Delete a node before specified position.
10. Write a program to implement following operations on the circular linked list.
(a) Insert a node at the end of the linked list.
(b) Insert a node before specified position.
(c) Delete a first node of the linked list.
(d) Delete a node after specified position.
10. Write a program which create binary search tree.
11. Implement recursive and non-recursive tree traversing methods inorder, preorder and post-
order traversal.
12. Write a program to implement Queue Sort
13. Write a program to implement Merge Sort
14. Write a program to implement Bubble Sort
15. Write a program to implement Binary Search.
Open Ended Problem:

1) Simulate a simple dictionary. Assume each character contains at least 10 vocabularies. Create
an index page for all characters. Retrieve the word using index value. Assume that the index
characters from a to z.
2) Design a simple search engine to display the possible websites upon entering a search query.
Use suitable data structure for storage and retrieval.
3) Design and Develop the index for a text book of at least 100 pages using alphabets.
4) Design a Student Prerequisite Subjects Management System requires the use of linked list or
tree to store different courses and their prerequisites and based on this list it will allow any
student to take any course or not.
5) Write a program that uses the radix sort to sort 1000 random digits. Print the data before and
after the sort. Each sort bucket should be a linked list. At the end of the sort, the data should
be in the original array.
ACTIVE LEARNING ASSIGNMENTS: Preparation of power-point slides, which include videos,

animations, pictures, graphics for better understanding theory and practical work – The faculty will
allocate chapters/ parts of chapters to groups of students so that the entire syllabus to be covered. The
power-point slides should be put up on the web-site of the College/ Institute, along with the names of
the students of the group, the name of the faculty, Department and College on the first slide. The best
three works should submit to GTU.

Gujarat Technological University Computer Engineering (07) / Information Technology (16) / Information & Communication Technology

Uploaded by

Copyright:

Available Formats

Gujarat Technological University Computer Engineering (07) / Information Technology (16) / Information & Communication Technology

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Gujarat Technological University Computer Engineering (07) / Information Technology (16) / Information & Communication Technology

Uploaded by

Copyright:

Available Formats

GUJARAT TECHNOLOGICAL UNIVERSITY

COMPUTER ENGINEERING (07) / INFORMATION TECHNOLOGY

Type of course: Compulsory

Prerequisite: Computer Programming & utilization

Rationale: Data structure is a subject of primary importance in Information and Communication

Teaching and Examination Scheme:

3 NONLINEAR DATA STRUCTURE : 13 30

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

1. Introduction to pointers. Call by Value and Call by reference.

4. Implement a program to convert infix notation to postfix notation using stack.

Open Ended Problem:

ACTIVE LEARNING ASSIGNMENTS: Preparation of power-point slides, which include videos,

You might also like