×

Close

Type:
**Note**Institute:
**
Visvesvaraya Technological University
**Course:
**
B.Tech
**Specialization:
**Computer Science Engineering**Views:
**16**Uploaded:
**5 months ago**Add to Favourite

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
LESSSSON PLAN
Subject Code
Subject Title
Year of
Study
Year/Se
m.
Name of the Faculty
Design and
II Year/
ANANTHANAGU
Analysis of
2017-18
IV Sem
Algorithms Lab
IA Marks 20 Number of Lecture Hours/Week 01 I + 02 P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03 Credits – 02
Course objectives:
This course will enable students to
Design and implement various algorithms in JAVA
Employ various design strategies for problem solving.
Measure and compare the performance of different algorithms.
15CSL47
Prerequisite:
1. Basic Knowledge of data structures.
2. Basic Knowledge of C and C++ programming.
3. Working procedures of Linux systems.
Lecture
Session
1
2
3
Text &
Reference
Topics Covered
Introduction
to
Course
Objective/Course Outcomes
Delivery
Methodology
Overview/Course
Experiment I
A. Create a Java class called Student with the
following details as variables within it.
i. USN ii. Name iii. Branch iv. Phone Write a Java
program to create n Student objects and print the
USN, Name, Branch, and Phone of these objects
with suitable headings.
B. Write a Java program to implement the Stack
using arrays. Write Push(), Pop(), and display()
methods to demonstrate its working.
Experiment II
A. Design a superclass called Staff with details as
Staff Id, Name, Phone, Salary. Extend this class by
writing three subclasses namely Teaching (domain,
publications), Technical (skills), and Contract
(period). Write a Java program to read and display
at least 3 staff objects of all three categories
B. Write a Java class called Customer to store their
name and date_of_birth. The date_of_birth format
should be dd/mm/yyyy. Write methods to read
customer data as and display as using String
Tokenizer class considering the delimiter character
T1,T2,R2
T1,T2,R2
Hands on Session
Hands on Session

as “/”.
4
5
6
7
8
9
10
11
Experiment III
A. Write a Java program to read two integers a and
b. Compute a/b and print, when b is not zero. Raise
an exception when b is equal to zero.
B. Write a Java program that implements a multithread application that has three threads. First
thread generates a random integer for every 1
second; second thread computes the square of the
number and prints; third thread will print the value
of cube of the number.
Experiment IV
Sort a given set of n integer elements using Quick
Sort method and
compute its time complexity. Run the program for
varied values of n>
5000 and record the time taken to sort. Plot a
graph of the time taken
versus non graph sheet. The elements can be read
from a file or can be
generated using the random number generator.
Demonstrate using
Java how the divide and-conquer method works
along with its time
complexity analysis: worst case, average case and
best case.
Experiment V
Sort a given set of n integer elements using Merge
Sort method and compute its time complexity. Run
the program for varied values of n> 5000, and
record the time taken to sort. Plot a graph of the
time taken versus non graph sheet. The elements
can be read from a file or can be generated using
the random number generator. Demonstrate using
Java how the divide and-conquer method works
along with its time complexity analysis: worst
case, average case and best case.
Experiment VI
Implement in Java, the 0/1 Knapsack problem
using
(a) Dynamic Programming method
(b) Greedy method.
Experiment VII
From a given vertex in a weighted connected
graph, find shortest paths to other vertices using
Dijkstra's algorithm. Write the program in Java.
Experiment VIII
Find Minimum Cost Spanning Tree of a given
connected undirected graph using Kruskal's
algorithm. Use Union-Find algorithms in your
program.
Experiment IX
Find Minimum Cost Spanning Tree of a given
T1,T2,R2
Hands on Session
T1,T2,R2
T1,T2,R2
T1,T2,R2
T1,T2,R2
T1,T2,R2
T1,T2,R2
T1,T2,R2
Hands on Session
Hands on Session
Hands on Session
Hands on Session
Hands on Session
Hands on Session

12
13
14
connected undirected graph using Prim's
algorithm.
Experiment X
Write Java programs to
(a) Implement All-Pairs Shortest Paths problem
using Floyd's algorithm.
(b) Implement Travelling Sales Person problem
using Dynamic programming.
Experiment XI
Design and implement in Java to find a subset of a
given set S = {Sl, S2,.....,Sn} of n positive integers
whose SUM is equal to a given positive integer d.
For example, if S ={1, 2, 5, 6, 8} and d= 9, there
are two solutions {1,2,6}and {1,8}. Display a
suitable message, if the given problem instance
doesn't have a solution.
Experiment XII
Design and implement in Java to find all
Hamiltonian Cycles in a connected undirected
Graph G of n vertices using backtracking principle.
Content Behind the syllabus Programs
T1,T2,R2
Hands on Session
T1,T2,R2
Hands on Session
T1,T2,R2
Hands on Session
Hands on Session
Text Books:
T1. Introduction to the Design and Analysis of Algorithms, Anany Levitin:, 2rd Edition, 2409.
Pearson.
T2. Computer Algorithms/C++, Ellis Horowitz, Satraj Sahni and Rajasekaran, 2nd Edition, 2414,
Universities Press
Reference Books:
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest,
Clifford Stein, 3rd Edition, PHI
2. Design and Analysis of Algorithms , S. Sridhar, Oxford (Higher Education)
Conduction of Practical Examination:
All laboratory experiments (Twelve problems) are to be included for practical
examination. Students are allowed to pick one experiment from the lot.
To generate the data set use random number generator function.
Strictly follow the instructions as printed on the cover page of answer script for
breakup of marks
Marks distribution: Procedure + Conduction + Viva: 20 + 50 + 10 (80).
Change of experiment is allowed only once and marks allotted to the procedure
Prepared by
(Course Faculty)
Scrutinized by
( Dept. Academic Coordinator )
Approved by HOD
Signature:
Signature:
Signature:
Name:
Name:
Name:

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI
CHOICE BASED CREDIT SYSTEM (CBCS)
SCHEME OF TEACHING AND EXAMINATION 2015-2016
B.E. Computer Science & Engineering/ B.E. Information Science & Engineering
IV SEMESTER
Teaching Hours /Week
Sl. No
Title
Subject Code
Theory
Practical/
Drawing
Duration
Examination
Theory/
Practica I.A. Marks
l Marks
80
20
1
15MAT41
Engineering Mathematics - IV
04
--
03
2
15CS 42
Software Engineering
04
--
03
80
3
15CS43
Design and Analysis of Algorithms
04
--
03
4
15CS 44
Microprocessors and Microcontrollers
04
--
5
15CS45
Object Oriented Concepts
04
6
15CS46
Data Communication
7
15CSL47
Design and Analysis of Algorithm
Laboratory
8
15CSL48
Microprocessors Laboratory
TOTAL
Credits
Total Marks
100
4
20
100
4
80
20
100
4
03
80
20
100
4
--
03
80
20
100
4
04
--
03
80
20
100
4
--
1I+2P
03
80
20
100
2
--
1I+2P
03
80
20
100
2
24
06
24
640
160
800
28
Note: ‘I’ Stands for Instruction Hours and ‘P’ for practical Hours
1

## Leave your Comments