CS3491 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PRACTICAL EXERCISES:

1. Implementation of Uninformed search algorithms (BFS,DFS)

2. Implementation of Informed search algorithms (A*,memory-
bounded A*)
3. Implement naïve Bayes models
4. Implement Bayesian Networks
5. Build Regression models
6. Build decision trees and random forests
7. Build SVM models
8. Implement ensembling techniques
9. Implement clustering algorithms
10. Implement EM for Bayesian networks
11. Build simple NN models
12. Build deep learning NN models

SOFTWARE LIST

Python 3.1.1

Prolog Software

Staff Incharge HOD/CSE

 CS3461 OPERATING SYSTEMS LABORATORY

COURSE OBJECTIVES:

 To install windows operating systems.

 To understand the basics of Unix command and shell programming.
 To implement various CPU scheduling algorithms.
 To implement Deadlock Avoidance and Deadlock Detection Algorithms
 To implement Page Replacement Algorithms
 To implement various memory allocation methods.
 To be familiar with File Organization and File Allocation Strategies.
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 VMwar

SOFTWARE LIST

C++
Turbo C

Staff Incharge HOD/CSE

CS3481 DATABASE MANAGEMENT SYSTEMS LABORATORY
COURSE OBJECTIVES:

 To learn and implement important commands in SQL.

 To learn the usage of nested and joint queries.
 To understand functions, procedures and procedural extensions of databases.
 To understand design and implementation of typical database applications.
 To be familiar with the use of a front end tool for GUI based application
development.

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
abovementioned 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

SOFTWARE LIST

MySQL

Turbo C++

Staff Incharge HOD/CSE

 CS3401 ALGORITHMS

PRACTICAL EXERCISES: 30 PERIODS

Searching and Sorting Algorithms

1. Implement Linear Search. Determine the time required to search for an element. Repeat
the

experiment for different values of n, the number of elements in the list to be searched and

plot a graph of the time taken versus n.

2. Implement recursive Binary Search. Determine the time required to search an element.

Repeat the experiment for different values of n, the number of elements in the list to be

searched and plot a graph of the time taken versus n.

3. Given a text txt [0...n-1] and a pattern pat [0...m-1], write a function search (char pat [ ],
char

txt [ ]) that prints all occurrences of pat [ ] in txt [ ]. You may assume that n > m.

4. Sort a given set of elements using the Insertion sort and Heap sort methods and
determine

the time required to sort the elements. Repeat the experiment for different values of n, the

number of elements in the list to be sorted and plot a graph of the time taken versus n.

Graph Algorithms

1. Develop a program to implement graph traversal using Breadth First Search

2. Develop a program to implement graph traversal using Depth First Search

3. From a given vertex in a weighted connected graph, develop a program to find the
shortest

paths to other vertices using Dijkstra’s algorithm.

4. Find the minimum cost spanning tree of a given undirected graph using Prim’s algorithm.

5. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.

6. Compute the transitive closure of a given directed graph using Warshall's algorithm.

Algorithm Design Techniques

1. Develop a program to find out the maximum and minimum numbers in a given list of n

numbers using the divide and conquer technique.

2. Implement Merge sort and Quick sort methods to sort an array of elements and
determine

the time required to sort. Repeat the experiment for different values of n, the number of

elements in the list to be sorted and plot a graph of the time taken versus n.

State Space Search Algorithms

1. Implement N Queens problem using Backtracking.

Approximation Algorithms Randomized Algorithms

1. Implement any scheme to find the optimal solution for the Traveling Salesperson
problem

and then solve the same problem instance using any approximation algorithm and
determine

the error in the approximation.

2. Implement randomized algorithms for finding the kth smallest number.

The programs can be implemented in C/C++/JAVA/ Python

SOFTWARE LIST

Python 3.11

C,C++,Java

Staff Incharge HOD/CSE

 CCS361 ROBOTIC PROCESS AUTOMATION

PRACTICAL EXERCISES:

Setup and Configure a RPA tool and understand the user interface of the tool:

1. Create a Sequence to obtain user inputs display them using a message box;

2. Create a Flowchart to navigate to a desired page based on a condition;

3. Create a State Machine workflow to compare user input with a random number.

4. Build a process in the RPA platform using UI Automation Activities.

5. Create an automation process using key System Activities, Variables and Arguments

6. Also implement Automation using System Trigger

7. Automate login to (web)Email account

8. Recording mouse and keyboard actions.

9. Scraping data from website and writing to CSV

10. Implement Error Handling in RPA platform

11. Web Scraping

12. Email Query Processing

SOFTWARE LIST

UiPath Software

Staff Incharge HOD/CSE

 CCS356 OBJECT ORIENTED SOFTWARE ENGINEERING

PRACTICAL EXERCISES: 30 PERIODS

LIST OF EXPERIMENTS:

1. Identify a software system that needs to be developed.

2. Document the Software Requirements Specification (SRS) for the identified system.

3. Identify use cases and develop the Use Case model.

4. Identify the conceptual classes and develop a Domain Model and also derive a Class

Diagram from that.

5. Using the identified scenarios, find the interaction between objects and represent them
using

UML Sequence and Collaboration Diagrams

6. Draw relevant State Chart and Activity Diagrams for the same system.

7. Implement the system as per the detailed design

8. Test the software system for all the scenarios identified as per the usecase diagram

9. Improve the reusability and maintainability of the software system by applying

appropriate

design patterns.

10. Implement the modified system and test it for various scenarios.

SUGGESTED DOMAINS FOR MINI-PROJECT:

1. Passport automation system.

2. Book bank

3. Exam registration

4. Stock maintenance system.

5. Online course reservation system

6. Airline/Railway reservation system

7. Software personnel management system

8. Credit card processing

9. e-book management system

10. Recruitment system

11. Foreign trading system

12. Conference management system

13. BPO management system

14. Library management system

15. Student information system

SOFTWARE LIST

Windows XP, MS Office

Staff Incharge HOD/CSE

 CCW332 DIGITAL MARKETING

PRACTICAL EXERCISES: 30 PERIODS

1. Subscribe to a weekly/quarterly newsletter and analyze how its content and structure
aid

with the branding of the company and how it aids its potential customer segments.

2. Perform keyword search for a skincare hospital website based on search volume and

competition using Google keyword planner tool.

3. Demonstrate how to use the Google Web Masters Indexing API

4. Discuss an interesting case study regarding how an insurance company manages leads.

5. Discuss negative and positive impacts and ethical implications of using social media for

political advertising.

6. Discuss how Predictive analytics is impacting marketing automation

SOFTWARE LIST

Online Path

Staff Incharge HOD/CSE

 CCS336 CLOUD SERVICES MANAGEMENT

PRACTICAL EXERCISES: 30 PERIODS

1. Create a Cloud Organization in AWS/Google Cloud/or any equivalent Open Source cloud
softwares like Openstack, Eucalyptus, OpenNebula with Role-based access control

2. Create a Cost-model for a web application using various services and do Cost-benefit
analysis

3. Create alerts for usage of Cloud resources

4. Create Billing alerts for your Cloud Organization

5. Compare Cloud cost for a simple web application across AWS, Azure and GCP and
suggest the best one

SOFTWARE LIST

AWS, GOOGLE, MS OFFICE

Staff Incharge HOD/CSE