REGULATION -2008

LAB SYLLABUS
SEM
ESTER - I

GE2115 COMPUTER PRACTICE LABORATORY I 0 0 3 100

LIST OF EXERCISES

a) Wo! Po"#$$%&' 15

1. Document creation, Text manipulation with Scientific notations.
2. Table creation, Table formatting and Conversion.
3. ail merge and !etter preparation.
". Drawing # flow Chart

() S)#a! S*##+ 15

$. Chart # !ine, %&, 'ar and (ie.
). *ormula # formula editor.
+. Spread sheet # inclusion of ob,ect, (icture and graphics, protecting the document and sheet.
-. Sorting and .mport / 0xport features.

Simple C Programming * 15

1. Data t2pes, 0xpression 0valuation, Condition Statements.
13. 4rra2s
11. Structures and 5nions
12. *unctions
TOTAL, -5 PERIO.S

6 *or programming exercises *low chart and pseudocode are essential

/AR.WARE 0 SOFTWARE RE1UIRE. FOR A BATC/ OF 30 STU.ENTS

/a!2a#

1 7!48 S2stem with 33 nodes 9:;< Standalone (Cs = 33 8os.
2 7(rinters = 3 8os.
Software

1 7:S = >indows / 58.% Clone
2 74pplication (ac?age = :ffice suite
3 7Compiler = C
SEM
ESTER - II

GE2155 COMPUTER PRACTICE LABORATORY II 0 1 2 100


LIST OF EXPERIMENTS


13 UNIX COMMAN.S 15

Stud2 of 5nix :S # 'asic Shell Commands # 5nix 0ditor

23 S/ELL PROGRAMMING 15

Simple Shell program # Conditional Statements # Testing and !oops

33 C PROGRAMMING ON UNIX 15

D2namic Storage 4llocation#(ointers#*unctions#*ile @andling


TOTAL, -5 PERIO.S


/AR.WARE 0 SOFTWARE RE1UIREMENTS FOR A BATC/ OF 30 STU.ENTS

/a!2a#

1 71 58.% Clone Server
2 733 8odes 9thin client or (Cs<
3 7(rinter = 3 8os.

So4+2a#

" 7:S = 58.% Clone 933 user license or !icense free !inux<
$ 7Compiler # C
SEM
ESTER - III
IT 2205 .ATA STRUCTURES AN. ALGORIT/MS LAB L T P C
0 0 3 2
AIM
To develop programming s?ills in design and implementation of data structures and their
applications.
LIST OF EXPERIMENTS
1. .mplement singl2 and doubl2 lin?ed lists.
2. ;epresent a pol2nomial as a lin?ed list and write functions for pol2nomial addition.
3. .mplement stac? and use it to convert infix to postfix expression
". .mplement arra2#based circular Aueue and use it to simulate a producerconsumer
problem.
$. .mplement an expression tree. (roduce its pre#order, in#order, and post#order
traversals.
). .mplement binar2 search tree.
+. .mplement priorit2 Aueue using heaps
-. .mplement hashing techniAues.
1. .mplement Di,?straBs algorithm using priorit2 Aueues
13. .mplement a bac?trac?ing algorithm for Cnapsac? problem
TOTAL, -5PERIO.S
L%$+ o4 E56%)7#&+$ a&! "o7)o&#&+$ 4o A Ba+"* o4 30 $+6!#&+$ 81 )# (a+"*)
1. S:*T>4;0 ;0D5.;0D = TURBOC 9#$%o& 3 o GCC 9#$%o&
2. :(0;4T.8E S&ST0 = WIN.OWS 2000 0 XP 0 NT OR LINUX
3. C:(5T0;S ;0D5.;0D = 30 No$. 9inimum ;eAuirement F (entium ... or
(entium .G with 2$) ;4 and "3 E' harddis?<
CS 220: OB;ECT-ORIENTE. PROGRAMMING LAB L T P C
9Common to CS0 H .T< 0 0 3 2
LIST OF EXPERIMENTS
1. Design CII classes with static members, methods with default arguments, friend functions.
9*or example, design matrix and vector classes with static allocation, and a friend function to do
matrix#vector multiplication<
2. .mplement complex number class with necessar2 operator overloadings and t2pe conversions
such as integer to complex, double to complex, complex to double etc.
3. .mplement atrix class with d2namic memor2 allocation and necessar2 methods.
Eive proper constructor, destructor, cop2 constructor, and overloading of assignment operator.
". :verload the new and delete operators to provide custom d2namic allocation of memor2.
$. Develop a template of lin?ed#list class and its methods.
). Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge
sort, and Auic? sort.
+. Design stac? and Aueue classes with necessar2 exception handling.
-. Define (oint class and an 4rc class. Define a Eraph class which represents graph as a
collection of (oint ob,ects and 4rc ob,ects. >rite a method to find a minimum cost spanning tree
in a graph.
1. Develop with suitable hierarch2, classes for (oint, Shape, ;ectangle, SAuare, Circle, 0llipse,
Triangle, (ol2gon, etc. Design a simple test application to demonstrate d2namic pol2morphism
and ;TT..
13. >rite a CII program that randoml2 generates complex numbers 9use previousl2 designed
Complex class< and writes them two per line in a file along with an operator 9I, #, 6, or /<. The
numbers are written to file in the format 9a I ib<. >rite another program to read one line at a
time from this file, perform the corresponding operation on the two complex numbers read, and
write the result to another file 9one per line<.
L%$+ o4 E56%)7#&+$ a&! $o4+2a# 4o a (a+"* o4 30 $+6!#&+$
1. (C = 33 nos.
J (rocessor = 2.3 E@K or higher
J ;4 = 2$) ' or higher
J @ard dis? = 23 E' or higher
J :S# >indows 2333/ >indows %(/ 8T
2. Software = Turbo C 9freeware< = to be installed in all (CLs.
SEM
ESTER - I<
CS 2258 .BMS LAB 0 0 3 2
9Common to CS0 H .T<
1. Data Definition, Table Creation, Constraints,
2. .nsert, Select Commands, 5pdate H Delete Commands.
3. 8ested Dueries H Moin Dueries
". Giews
$. @igh level programming language extensions 9Control structures, (rocedures and
*unctions<.
). *ront end tools
+. *orms
-. Triggers
1. enu Design
13. ;eports.
11. Database Design and implementation 9ini (ro,ect<.
CS 225= OPERATING SYSTEMS LAB 0 0 3 2
9Common to CS0 H .T<
8I7)>#7#&+ +*# 4o>>o2%&' o& LINUX o o+*# U&%? >%@# )>a+4o73 U$# C 4o *%'* >#9#>
>a&'6a'# %7)>#7#&+a+%o&)
1. >rite programs using the following s2stem calls of 58.% operating s2stemF
for?, exec, getpid, exit, wait, close, stat, opendir, readdir
2. >rite programs using the ./: s2stem calls of 58.% operating s2stem 9open,
read, write, etc<
3. >rite C programs to simulate 58.% commands li?e ls, grep, etc.
". Eiven the list of processes, their C(5 burst times and arrival times,
displa2/print the Eantt chart for *C*S and SM*. *or each of the scheduling
policies, compute and print the average waiting time and average turnaround
time. 92 sessions<
$. Eiven the list of processes, their C(5 burst times and arrival times,
displa2/print the Eantt chart for (riorit2 and ;ound robin. *or each of the
scheduling policies, compute and print the average waiting time and average
turnaround time. 92 sessions<
). Developing 4pplication using .nter (rocess communication 9using shared
memor2, pipes or message Aueues<
+. .mplement the (roducer = Consumer problem using semaphores 9using
58.% s2stem calls<.
-. .mplement some memor2 management schemes = .
1. .mplement some memor2 management schemes = ..
13. .mplement an2 file allocation techniAue 9!in?ed, .ndexed or Contiguous<
SEMESTER - <
CS2308 SYSTEM SOFTWARE LAB L T P C
0 0 3 2
(U$%&' C)
1. .mplement a s2mbol table with functions to create, insert, modif2, search, and
displa2.
2. .mplement pass one of a two pass assembler.
3. .mplement pass two of a two pass assembler.
". .mplement a single pass assembler.
$. .mplement a two pass macro processor
). .mplement a single pass macro processor.
+. .mplement an absolute loader.
-. .mplement a relocating loader.
1. .mplement pass one of a direct#lin?ing loader.
13..mplement pass two of a direct#lin?ing loader.
11..mplement a simple text editor with features li?e insertion / deletion of a
character, word, and sentence.
12. .mplement a s2mbol table with suitable hashing
9*or loader exercises, output the snap shot of the main memor2 as it would be, after the
loading has ta?en place<
TOTALA -5 PERIO.S
IT2305 ;A<A PROGRAMMING LAB L T P C
0 0 3 2
1. Develop a Mava pac?age with simple Stac? and Dueue classes. 5se MavaDoc comments for
documentation.
2. Design a class for Complex numbers in Mava. .n addition to methods for basic operations on
complex numbers, provide a method to return the number of active ob,ects created.
3. Design a Date class similar to the one provided in the ,ava.util pac?age.
". Develop with suitable hierarch2, classes for (oint, Shape, ;ectangle, SAuare, Circle, 0llipse,
Triangle, (ol2gon, etc. Design a simple test application to demonstrate d2namic pol2morphism.
$. Design a Mava interface for 4DT Stac?. Develop two different classes that implement this
interface, one using arra2 and the other using lin?ed#list. (rovide necessar2 exception handling
in both the implementations.
). >rite a Mava program to read a file that contains D84 seAuences of arbitrar2 length one per
line 9note that each D84 seAuence is ,ust a String<. &our program should sort the seAuences in
descending order with respect to the number of BT4T4B subseAuences present. *inall2 write the
seAuences in sorted order into another file.
+. Develop a simple paint#li?e program that can draw basic graphical primitives in different
dimensions and colors. 5se appropriate menu and buttons.
-. Develop a scientific calculator using even#driven programming paradigm of Mava.
1. Develop a template for lin?ed#list class along with its methods in Mava.
13. Design a thread#safe implementation of Dueue class. >rite a multi#threaded producer#
consumer application that uses this Dueue class.
11. >rite a multi#threaded Mava program to print all numbers below 133,333 that are both prime
and fibonacci number 9some examples are 2, 3, $, 13, etc.<. Design a thread that generates prime
numbers below 133,333 and writes them into a pipe. Design another thread that generates
fibonacci numbers and writes them to another pipe. The main thread should read both the pipes
to identif2 numbers common to both.
12. Develop a multi#threaded E5. application of 2our choice.
TOTALA -5 PERIO.S
SEMESTER - <I
IT235= WEB TEC/NOLOGY LAB L T P C
0 0 3 2
LIST OF EXPERIMENTS
1.Create a web page with the following using @T!
To embed an image map in a web page
To fix the hot spots
Show all the related information when the hot spots are clic?ed.
2. Create a web page with all t2pes of Cascading st2le sheets.
3. Client Side Scripts for Galidating >eb *orm Controls using D@T!
". >rite programs in Mava to create applets incorporating the following featuresF
Create a color palette with matrix of buttons
Set bac?ground and foreground of the control text area b2 selecting a color from
color palette.
.n order to select *oreground or bac?ground use chec? box control as radio
buttons
To set bac?ground images
$. >rite programs in Mava using ServletsF
To invo?e servlets from @T! forms
To invo?e servlets from 4pplets
). >rite programs in Mava to create three#tier applications using MS( and Databases
for conducting on#line examination.
for displa2ing student mar? list. 4ssume that student information is available in a
database which has been stored in a database server.
+. (rograms using %! = Schema = %S!T/%S!
-. (rogram using D: / S4%
1. (rograms using 4M4%
13. Consider a case where we have two web Services# an airline service and a travel
agent and the travel agent is searching for an airline. .mplement this scenario using
>eb Services and Data base.
TOTAL A -5 PERIO.S
CS235= OB;ECT ORIENTE. ANALYSIS AN. .ESIGN LAB L T P C
0 0 3 2
OB;ECTI<E,
To !#9#>o) a 7%&%-)oB#"+ 4o>>o2%&' +*# 12 #?#"%$#$ >%$+#! (#>o23
1. To develop a problem statement.
2. Develop an .000 standard S;S document. 4lso develop ris? management and
pro,ect plan 9Eantt chart<.
3. .dentif2 5se Cases and develop the 5se Case model.
". .dentif2 the business activities and develop an 5! 4ctivit2 diagram.
$. .dentit2 the conceptual classes and develop a domain model with 5! Class
diagram.
). 5sing the identified scenarios find the interaction between ob,ects and represent
them using 5! .nteraction diagrams.
+. Draw the State Chart diagram.
-. .dentif2 the 5ser .nterface, Domain ob,ects, and Technical services. Draw the
partial la2ered, logical architecture diagram with 5! pac?age diagram notation.
1. .mplement the Technical services la2er.
13. .mplement the Domain ob,ects la2er.
11. .mplement the 5ser .nterface la2er.
12. Draw Component and Deplo2ment diagrams.
TOTAL A -5 PERIO.S
S6''#$+#! !o7a%&$ 4o M%&%-)oB#"+3
1. (assport automation s2stem.
2. 'oo? ban?
3. 0xam ;egistration
". Stoc? maintenance s2stem.
$. :nline course reservation s2stem
). 0#tic?eting
+. Software personnel management s2stem
-. Credit card processing
1. e#boo? management s2stem
13. ;ecruitment s2stem
11. *oreign trading s2stem
12. Conference anagement S2stem
13. '(: anagement S2stem
CS230= NETWORC LAB L T P C
0 0 3 2
1. (rograms using TC( Soc?ets 9li?e date and time server H client, echo server H
client, etc..<
2. (rograms using 5D( Soc?ets 9li?e simple D8S<
3. (rograms using ;aw soc?ets 9li?e pac?et capturing and filtering<
". (rograms using ;(C
$. Simulation of sliding window protocols
0xperiments using simulators 9li?e :(80T<
). (erformance comparison of 4C protocols
+. .mplementing ;outing (rotocols
-. (erformance comparison of ;outing protocols
1. Stud2 of 5D( performance
13. Stud2 of TC( performance.
TOTAL A -5 PERIO.S
REGULATION -2013
LAB SYLLABUS
SEMESTER-I
GED1D1 COMPUTER PRACTICES LABORATORY L T P C
0 0 3 2
LIST OF EXPERIMENTS
1. Search, generate, manipulate data using S office/ :pen :ffice.
2. (resentation and GisualiKation = graphs, charts, 2D, 3D
3. (roblem formulation, (roblem Solving and *lowcharts
". C (rogramming using Simple statements and expressions
$. Scientific problem solving using decision ma?ing and looping.
). Simple programming for one dimensional and two dimensional arra2s.
+. Solving problems using String functions
-. (rograms with user defined functions = .ncludes (arameter (assing
1. (rogram using ;ecursive *unction and conversion from given program to flow chart.
13. (rogram using structures and unions.
TOTAL , -5 PERIO.S
SEMESTER II