SILVER OAK UNIVERSITY

College of Technology
Bachelor of Technology
Information Technology
Course Name: Data Structures
Course Code: 1010043222
Semester: 3rd

Prerequisite:
1. Programming for Problem Solving

Course Objectives:
1. 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
programdevelopment. Efficient problem solving needs the application of appropriate data structure during
program development.
2. 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 thecourse of study. The
course will help students to develop the capability of selecting a particular data structure.

Teaching Scheme:

Teaching Scheme
L T P Contact Hours Credit
4 0 4 8 6

Contents:

Unit Topics Teaching % Weightage

Hours
1 INTRODUCTION TO DATA STRUCTURE: 4 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
matrixand 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,
DoubleEnded 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, Heap, 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 : 6 15%
Hashing: The symbol table, Hashing Functions, Collision-
ResolutionTechniques, Applications of Hashing.
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: 6 15%
Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge Sort
Searching – Sequential Search and Binary Search

Course Outcomes:

Sr.
CO Statement Unit
No.
Define and classify various data structures, storage structures and
CO-1 1
common operations on them
Create various linear data structures with their representation and
CO-2
perform different operations on them 2
Create various nonlinear data structures with their representation and
CO-3 3,4
perform different operations on them
CO-4 Apply various searching sorting techniques on data set 5
Solve the given a problem using an appropriate data structure to achieve
CO-5 optimal performance and compare its performance withother possible data 2,3,4,5
structures

Teaching & Learning Methodology:

The various methods or tools follows by the faculties to teach the above subject are:
1. The course includes a laboratory, where students have an opportunity to build an appreciation
forthe concepts being taught in lectures.
2. Lectures with live practical example using Projector and Computer.
3. Experiments shall be performed in the laboratory related to course contents.

List of Experiments: Total Hours: 56

Sr. No. Practical Name

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 Let stack_ptr be a pointer to stack of integers and item be an integer variable. Write
function like Push, Pop, Initialize, Empty, and Full for doing the following tasks. [You
may declare additionalvariable in your functions in needed]
 a. Return the top element of the stack and leave the top element unchanged. If the
stack is empty,return INT_MAX.
b. Return the third element from the top of the stack, provided that the stack
contains at least threeintegers. If not, return INT_MAX. Leave the stack
unchanged.
c. Returns the bottom element of stack ( or INT_MAX if stack empty), and leave
the stackunchanged.
d. Delete all occurrences of x from the stack, leaving the other elements of the
stack in the sameorder.
6 Write a program to implement QUEUE using arrays that performs followingoperations (a)
INSERT (b) DELETE (c) DISPLAY
7 Write a program to implement Circular Queue using arrays that performs following
operations. (a) INSERT (b) DELETE (c) DISPLAY
8 Use the functions developed to write other functions that will
a. Empty one stack onto the top of another stack
b. Move all the items from a queue onto a stack.
c. Start with a queue and an empty stack, and use the stack to reverse the order of all
the items inthe queue.
9 Write a menu driven program to implement following operations on the singlylinked 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.
10 Write a program to implement stack using linked list.
11 Write a program to implement Queue using linked list.
12 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.
13 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.
14 Write a program which create binary search tree.
15 Implement recursive and non-recursive tree traversing methods inorder, preorder and post-
order traversal.
16 Write a program to implement Bubble Sort, Merge Sort, Quick Sort.
17 Write a program to implement Binary Search.

Books Recommended:

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.
List of Open-Source Software/learning website:

1. http://silveroakuni.ac.in/video-lecture
2. https://nptel.ac.in/
3. https://nptel.ac.in/courses/106/102/106102064/
4. https://nptel.ac.in/courses/106/106/106106133/
5. https://www.youtube.com/watch?v=RBSGKlAvoiM
6. https://www.youtube.com/watch?v=zWg7U0OEAoE