Core – VI Practical

SEMESTER:III CREDIT: 5
23UBCAP34 : DATA STRUCTURES AND
PART: III HOURS: 4
ALGORITHMS LAB
COURSE OBJECTIVES
1. To understand the concepts of ADTs
2. To learn linear data structures- lists, stacks, queues
3. To learn Tree structures and application of trees
4. To learn graph structures and application of graphs
5. To understand various sorting and searching

LIST OF EXPERIMENTS
1. Write a program to implement the List ADT using arrays and linked lists.
2. Write a programs to implement the following using a singly linked list.
Stack ADT, Queue ADT
3. Write a program that reads an infix expression, converts the expression
To postfix form and then evaluates the postfix expression (use stack ADT).
4. Write a program to implement priority queue ADT.
5. Writeaprogramtoperformthefollowingoperations:
Insert an element into a binary search tree.
Delete an element from a binary search tree.
Search for a key element in a binary search tree.
6. Write a program to perform the following operations
Insertion into an AVL-tree
Deletion from an AVL-tree
7. Write a programs for the implementation of BFS and DFS for a given graph.
8. Write a program for implementing the following searching methods:
Linear search
Binary search.
9. Write a program for implementing the following sorting methods:
Bubble sort
Selection sort
Insertion sort
Radix sort.
SEMESTER: V 22UBCAC51: RDBMS CREDIT:4
 PART: III HOURS: 4/W

COURSE OBJECTIVES
1. Students are able to understand database concepts and ER model.
2. The students are able to understand the relational data model.
3. Students are able to know about relational database design concepts.
4. Knowledge about file structure and organization.
5. The students are able to write PL/SQL commands to create tables,
insert/update/delete data, and query data in a relational DBMS.

UNIT I : DATABASE ARCHITECTURE &ENTITY-RELATIONSHIP MODEL Hours: 12

Database system applications - Purpose of database systems - View of data-
Database languages and design – Data storage and querying – Transaction
Management Concept - Database architecture - Database users and administrators.
Entity-Relationship Model: Entity Sets -Relationship Sets - Attributes - Constraints:
Mapping Cardinalities - Keys - Entity Relationship Diagrams: Basic Structure of E-R
Diagram - MappingCardinalityinE-Rdiagram-ComplexAttributes-Roles–Non-
BinaryRelationshipSets-WeakEntitySets.
UNIT II: RELATIONAL MODEL Hours:12
Relational Model Structure - Relational Algebra - The Tuple Relational Calculus -
The Domain Relational Calculus – SQL Introduction: Overview of SQL – SQL Data
Definition Language - Basic Structure of SQL Queries –Basic Operations - Set
Operations- Aggregate Functions-Null Values -Nested Sub Queries-Modification of the
Database – Join Expressions - Integrity Constraints .
UNIT III: RELATIONAL DATABASE DESIGN Hours:12
Normalization: First Normal Form – Decomposition using Functional
Dependencies - Keys and Functional Dependencies – Boyce Codd Normal Form –
Third Normal Form – Decomposition using Multivalve Dependencies: Multivalve
Dependencies – Fourth Normal form.
UNIT IV: STORAGE AND FILE STRUCTURE Hours:12
Disks - RAID -Tertiary Storage - File Organization – Organization of Records in
Files - Data Dictionary storage – Database Buffer.
UNIT V: PL/SQL Hours: 12
Introduction to PL/SQL: PL/SQL B lock Structure – PL/SQL Tables - Cursors –
Exception Handling S ection– Procedures - Functions - Packages - Triggers.

COURSE OUTCOMES
After completing the Course successfully, the student will be able to
1. 1.Describe the database architecture and the ER diagram for real
world applications.
2. Knowledge about the relational algebra and calculus.
3. Knowledge about the normalization forms.
4. Explain the storage and accessing of data.
 5. Programming skills in SQL and PL/SQL.

Text Books
1. Abraham Silberschatz, Henry Korth, S.Sudarshan, ,2010, McGraw Hill,
Sixth Edition, ” Database Systems Concepts”.
2. Raghu Ramakrishnan and Johannes Gehrke,2002,Third Edition,”
Database management systems”
3. S.K.Singh, 2010, PHI Learning Private Limited , Sixth Edition,”Database
Management Systems” , New Delhi,
Supplementary Readings
1. Ramakrishnan, Gehrke,2003, Mc Graw Hill ,Third Edition,”Database
Management Systems”, New Delhi.
2. Bipin Desai,2010, Galgotia Publications “An Introduction to database
systems”.
3. RamezElamassri, Shankant B-Navathe, 2015, Pearson, 7th Edition,
“Fundamentals of Database Systems”.
4. Rajesh Narang,2010, PHI Learning Private Limited, Sixth
Edition,”Database Management Systems”, New Delhi.

Core – V
SEMESTER:III CREDIT:5
23UBCAC33 : DATA STRUCTURES AND
PART: III HOURS:5
ALGORITHMS

COURSE OBJECTIVES
1. To understand the concepts of ADTs
2. To learn linear data structures-lists, stacks, queues
3. To learn Tree structures and application of trees
4. To learn graph structures and application of graphs
5. To understand various sorting and searching

UNIT I : Basics of ADT Hours:15

Abstract Data Types (ADTs)- List ADT-array-based implementation-linked list
implementation singly linked lists-circular linked lists- doubly linkedlists-applications of
lists-Polynomial Manipulation-All operations - Insertion - Deletion-Merge- Traversal

UNIT II:Stack & Queue Operations Hours:15

Stack ADT- Operations- Applications- Evaluating arithmetic expressions–Conversion of
infix to postfix expression- QueueADT- Operations- CircularQueue-Priority Queue-
deQueue applications of queues.

UNIT III:Trees Hours:15

TreeADT-treetraversals-Binary Tree ADT- expression trees- applications of trees-binary
search tree ADT- Threaded Binary Trees-AVL Trees-B-Tree-B+Tree –Heap-
Applications of heap

UNIT IV:Graphs Hours:15

Definition- Representation of Graph-Types of graph- Breadth first traversal – Depth first
traversal-Topological sort- Bi-connectivity – Cutvertex- Euler circuits-Applications of
graphs

UNIT V:Searching and Sorting Hours:15

Searching- Linear search-Binary search-Sorting-Bubble sort-Selection sort-Insertions
Sort-Shell sort-Radix sort-Hashing-Hash functions-Separate chaining.

COURSE OUTCOMES
After completing the Course successfully, the student will be able to
1. Understand the concept of Dynamic memory management, data types, algorithms.
2. Understand basic data structures such as arrays, linked lists, stacks and queues
3. Describe the hash function and concepts of collision and its resolution methods.
4. Solve problem involving graphs, trees and heaps.
5. Apply Algorithm for solving problems like sorting, searching, insertion and deletion of
data
.
Text Books (In API Style)
1. Mark Allen Weiss ― Data Structures and Algorithm Analysis in C++‖,Pearson
Education2014,4thEdition.
2. ReemaThareja,―DataStructuresUsingC‖,OxfordUniversitiesPress2014,2nd
Edition
Supplementary Readings
1.ThomasH.Cormen,ChalesE.Leiserson,RonaldL.Rivest,CliffordStein,―Introduction to
Algorithms‖,McGrawHill2009,3rdEdition..
2.Aho,Hopcroft and Ullman ,―Data Structures andalgorithms‖,PearsonEducation2003