Problem Solving and Python

GE3171 Programming Laboratory

CS3271 Programming in C Laboratory

CS3311 Data Structures Laboratory

CS3381 Object Oriented Programming Laboratory

CS3361 Data Science Laboratory

GE3361 Professional Development

CS3461 Operating Systems Laboratory

Database Management
CS3481 Systems Laboratory
 2021 REGULATIONS- PRACTICALS LABORATORY LIST

SNO SEMESTER SUBJECT SUBJECT NAME

CODE

1 I Problem Solving and Python Programming

GE3171 Laboratory
2 II Programming in C Laboratory
CS3271
3 III Data Structures Laboratory
CS3311
4 III Object Oriented Programming Laboratory
CS3381
5 III Data Science Laboratory
CS3361
6 III Professional Development Laboratory
GE3361
7 IV Operating Systems Laboratory
CS3461
8 IV Database Management Systems Laboratory
CS3481
SUB.CODE:GE3171
SUB.NAME: PROBLEM SOLVING AND PYTHON PROGRAMMING LABORATORY
YEAR/SEMESTER: I/I

LIST OF EXPERIMENTS:

1. Identification and solving of simple real life or scientific or technical problems, and
developing flow charts for the same. (Electricity Billing, Retail shop billing, Sin
series, weight of a motorbike, Weight of a steel bar, compute Electrical Current in Three
Phase AC Circuit, etc.)
2. Python programming using simple statements and expressions (exchange the values of two
variables, circulate the values of n variables, distance between two points).
3. Scientific problems using Conditionals and Iterative loops. (Number series, Number
Patterns, pyramid pattern)
4. Implementing real-time/technical applications using Lists, Tuples. (Items present in
a library/Components of a car/ Materials required for construction of a building
5. Implementing real-time/technical applications using Sets, Dictionaries.
(Language, components of an automobile, Elements of a civil structure, etc.-
operations of Sets & Dictionaries)
6. Implementing programs using Functions.Factorial, largest number in a list, area of Shape.
7. Implementing programs using Strings. (reverse, palindrome, character count,
replacing characters)
8. Implementing programs using written modules and Python Standard Libraries
(pandas, numpy. Matplotlib, scipy)
9. Implementing real-time/technical applications using File handling. (copy from one file
to another, word count, longest word)
10. Implementing real-time/technical applications using Exception handling. (divide by zero
error,voter’s age validity, student mark range validation)
11. Exploring Pygame tool.
12. Developing a game activity using Pygame like bouncing ball, car race etc.
SUB CODE: CS3271
SUB NAME:PROGRAMMING IN C LABORATORY
YEAR/SEMESTER:I/II

LIST OF EXPERIMENTS:

1. I/O statements, operators, expressions

2. Decision-making constructs: if-else, goto, switch-case, break-continue
3. Loops: for, while, do-while
4. Arrays: 1D and 2D, Multi-dimensional arrays, traversal
5. Strings: operations
6. Functions: call, return, passing parameters by (value, reference), passing arrays to function.
7. Recursion
8. Pointers: Pointers to functions, Arrays,Strings, Pointers to Pointers, Array of Pointers
9. Structures: Nested Structures, Pointers to Structures, Arrays of Structures and Unions.
10. Files: reading and writing, File pointers, file operations, random access, processor directives
SUB CODE: CS3311
SUB NAME:DATA STRUCTURES LABORATORY
YEAR/SEMESTER: II/III

LIST OF EXERCISES:
1. Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs
4. Implementation of Polynomial Manipulation using Linked list
5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Implementation of Dijkstra’s Algorithm
10. Implementation of Prim’s Algorithm
11. Implementation of Linear Search and Binary Search
12. Implementation of Insertion Sort and Selection Sort
13. Implementation of Merge Sort
14. Implementation of Open Addressing (Linear Probing and Quadratic Probing)
SUB CODE: CS3461
SUB NAME:Operating Systems Laboratory
YEAR/SEMESTER:II/IV

LIST OF EXPERIMENTS:

1. Installation of windows operating system

2. Illustrate UNIX commands and Shell Programming
3. Process Management using System Calls : Fork, Exit, Getpid, Wait, Close
4. Write C programs to implement the various CPU Scheduling Algorithms
5. Illustrate the inter process communication strategy
6. Implement mutual exclusion by Semaphore
7. Write C programs to avoid Deadlock using Banker's Algorithm
8. Write a C program to Implement Deadlock Detection Algorithm
9. Write C program to implement Threading
10. Implement the paging Technique using C program
11. Write C programs to implement the following Memory Allocation Methods
a. First Fit b. Worst Fit c. Best Fit
12. Write C programs to implement the various Page Replacement Algorithms
13. Write C programs to Implement the various File Organization Techniques
14. Implement the following File Allocation Strategies using C programs
a. Sequential b. Indexed c. Linked
15. Write C programs for the implementation of various disk scheduling algorithms
16. Install any guest operating system like Linux using VMware.
SUB CODE: CS3381
SUB NAME: OBJECT ORIENTED PROGRAMMING LABORATORY
YEAR/SEMESTER:II/IV

LIST OF EXPERIMENTS
1. Solve problems by using sequential search, binary search, and quadratic sorting algorithms
(selection, insertion)
2. Develop stack and queue data structures using classes and objects.
3. Develop a java application with an Employee class with Emp_name, Emp_id, Address,
Mail_id, Mobile_no as members. Inherit the classes, Programmer, Assistant Professor,
Associate Professor and Professor from employee class. Add Basic Pay (BP) as the member of
all the inherited classes with 97% of BP as DA, 10 % of BP as HRA, 12% of BP as PF, 0.1% of
BP for staff club funds. Generate pay slips for the employees with their gross and net salary.
4. Write a Java Program to create an abstract class named Shape that contains two integers and
an empty method named printArea(). Provide three classes named Rectangle, Triangle and
Circle such that each one of the classes extends the class Shape. Each one of the classes contains
only the method printArea( ) that prints the area of the given shape.
5. Solve the above problem using an interface.
6. Implement exception handling and creation of user defined exceptions.
7. Write a java program that implements a multi-threaded application that has three threads.
First thread generates a random integer every 1 second and if the value is even, the second
thread computes the square of the number and prints. If the value is odd, the third thread will
print the value of the cube of the number.
8. Write a program to perform file operations. 9. Develop applications to demonstrate the
features of generics classes.
10. Develop applications using JavaFX controls, layouts and menus.
11. Develop a mini project for any application using Java concepts
SUB CODE: CS3361
SUB NAME : DATA SCIENCE LABORATORY
YEAR/SEMESTER:II/III

LIST OF EXPERIMENTS:

1. Download, install and explore the features of NumPy, SciPy, Jupyter,

Statsmodels and Pandas packages.
2. Working with Numpy arrays
3. Working with Pandas data frames
4. Reading data from text files, Excel and the web and exploring various
commands for doing descriptive analytics on the Iris data set.
5. Use the diabetes data set from UCI and Pima Indians Diabetes data set for
performing the following:
a. Univariate analysis: Frequency, Mean, Median, Mode, Variance,
Standard Deviation, Skewness and Kurtosis.
b. Bivariate analysis: Linear and logistic regression modeling
c. Multiple Regression analysis
d. Also compare the results of the above analysis for the two data sets.
6. Apply and explore various plotting functions on UCI data sets.
a. Normal curves
b. Density and contour plots
c. Correlation and scatter plots
d. Histograms
e. Three dimensional plotting
7.Visualizing Geographic Data with Basemap
SUB CODE: CS3481
SUB NAME : DATABASE MANAGEMENT SYSTEMS LABORATORY
YEAR/SEMESTER:II/IV
LIST OF EXPERIMENTS:
1. Create a database table, add constraints (primary key, unique, check,
Not null), insert rows, update and delete rows using SQL DDL and
DML commands.
2. Create a set of tables, add foreign key constraints and incorporate referential
integrity.
3. Query the database tables using different ‘where’ clause conditions
and also implement aggregate functions.
4. Query the database tables and explore sub queries and simple join operations.
5. Query the database tables and explore natural, equi and outer joins.
6. Write user defined functions and stored procedures in SQL.
7. Execute complex transactions and realize DCL and TCL commands.
8. Write SQL Triggers for insert, delete, and update operations in a database table.
9. Create View and index for database tables with a large number of records.
10. Create an XML database and validate it using XML schema.
11. Create Document, column and graph based data using NOSQL database tools.
12. Develop a simple GUI based database application and
incorporate all the above- mentioned features
13. Case Study using any of the real life database applications from the following list
a) Inventory Management for a EMart Grocery Shop
b) Society Financial Management
c) Cop Friendly App – Eseva
d) Property Management – eMall
e) Star Small and Medium Banking and Finance
●Build Entity Model diagram. The diagram should align with the
business and functional goals stated in the application.
●Apply Normalization rules in designing the tables in scope.
●Prepared applicable views, triggers (for auditing purposes),
functions for enabling enterprise grade features.
●Build PL SQL / Stored Procedures for Complex
Functionalities, ex EOD Batch Processing for calculating
the EMI for Gold Loan for each eligible Customer.
●Ability to showcase ACID Properties with sample queries with appropriate settings
 DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

SUB CODE: AD3271

SUB NAME : DATA STRUCTURES DESIGN LABORATORY
YEAR/SEMESTER:I/II
LIST OF EXPERIMENTS:

Note: The lab instructor is expected to design problems based on the topics listed.
The Examination shall not be restricted to the sample experiments designed.

1. Implement simple ADTs as Python classes

2. Implement recursive algorithms in Python
3. Implement List ADT using Python arrays
4. Linked list implementations of List
5. Implementation of Stack and Queue ADTs
6. Applications of List, Stack and Queue ADTs
7. Implementation of sorting and searching algorithms
8. Implementation of Hash tables
9. Tree representation and traversal algorithms
10. Implementation of Binary Search Trees
11. Implementation of Heaps
12. Graph representation and Traversal algorithms
13. Implementation of single source shortest path algorithm
14. Implementation of minimum spanning tree algorithms

CP4161 ADVANCED DATA STRUCTURES AND ALGORITHMS LT PC

 LABORATORY 0 04 2
COURSE OBJECTIVES:

 To acquire the knowledge of using advanced tree structures

 To learn the usage of heap structures
 To understand the usage of graph structures and spanning trees
 To understand the problems such as matrix chain multiplication,
activity selection and Huffman coding
 To understand the necessary mathematical abstraction to solve
problems.
LIST OF EXPERIMENTS:

1: Implementation of recursive function for tree traversal and

Fibonacci 2: Implementation of iteration function for tree
traversal and Fibonacci 3: Implementation of Merge Sort and
Quick Sort
4: Implementation of a Binary Search
Tree 5: Red-Black Tree
Implementation
6: Heap Implementation
7: Fibonacci Heap
Implementation 8: Graph
Traversals
9: Spanning Tree Implementation
10: Shortest Path Algorithms (Dijkstra's algorithm, Bellman Ford
Algorithm) 11: Implementation of Matrix Chain Multiplication
12: Activity Selection and Huffman Coding Implementation
HARDWARE/SOFTWARE REQUIREMENTS

1. 64-bit Open source Linux or its derivative

2. Open Source C++ Programming tool like G++/GCC
 CP4212/Software Engineering Lab

S.NO. EXPERIMENT
1 Introduction To software engineering
2 Dataflow diagram
3 Sample diagrams
i)Class diagram
ii)sequence diagram
iii)state chart diagram
iv)use case diagram
4 CMS i) problem analysis
ii)software requirement analysis
iii)design
iv)proto type
5 EASY LEAVE i) problem analysis
ii)software requirement analysis
iii)design
iv)proto type
6 E-BIDDING i) problem analysis
ii)software requirement analysis
iii)design
iv)proto type
7 ELECTRONIC CASH COUNTER
i) problem analysis
ii)software requirement analysis
iii)design
iv)proto type