With effect from academic year 2012-13

11CS201CV
MATHEMATICAL FOUNDATIONS OF COMPUTER
SCIENCE
(Common to CSE & IT)
Instruction : 3 periods/week End Examination : 7 !arks
"utoria# : 1 period /Week $uration : 3 hours
%redits : 3 &essiona# marks : 2
UNIT-I
Mathmat!"a# Lo$!" % &tatements and notations' %onnecti(es' We## formed
formu#as' "ruth "a)#es' tauto#o*y' e+ui(a#ence imp#ication' ,orma# forms'
-uantifiers' uni(ersa# -uantifiers
UNIT-II
P&'!"at( % .redicati(e #o*ic' /ree 0 1ound (aria)#es' 2u#es of inference'
%onsistency' proof of contradiction' 3utomatic "heorem .ro(in*4
UNIT-III
R#at!on(% .roperties of )inary 2e#ations' e+ui(a#ence' "ransiti(e c#osure'
compati)i#ity and partia# orderin* re#ations' #attices' 5asse dia*ram4 /unctions:
In(erse /unction %omposition of functions' recursi(e /unctions' 6attice and its
.roperties 4
UNIT-IV
A#$)&a!" (t&*"t*&( % 3#*e)raic systems Examp#es and *enera# properties' &emi
*roups and monads' *roups su) *roups homomorphism' Isomorphism4
UNIT-V
E#mnta&+ Com)!nato&!"(% 1asis of countin*' %om)inations 0 .ermutations' with
repetitions' %onstrained repetitions' 1inomia# %oefficients' 1inomia# !u#tinomia#
theorems' the princip#es of Inc#usion- Exc#usion4 .i*eon ho#e princip#es and its
app#ication
UNIT-VI
R"*&&n" R#at!on % 7eneratin* /unctions' /unction of &e+uences %a#cu#atin*
%oefficient of *eneratin* function' 2ecurrence re#ations' &o#(in* recurrence re#ation
)y su)stitution and 7eneratin* funds4 %haracteristics roots so#ution of in
homo*eneous 2ecurrence 2e#ation4
UNIT-VII
,&a-h Tho&+ % 2epresentation of 7raph' $/&' 1/&' &pannin* "rees' p#anar 7raphs
UNIT-VIII
7raph "heory and 3pp#ications' 1asic %oncepts Isomorphism and &u) *raphs' !u#ti
*raphs and Eu#er circuits' 5ami#tonian *raphs' %hromatic ,um)ers 4
TE.T /OO0S %
14 $iscrete and %om)inationa# !athematics- 3n 3pp#ied Introduction th Edition -
2a#ph4 .47rima#di4 .earson Education
24 $iscrete mathematics for computer scientists 0 mathematicians 86 !ott' 3 9ande#'
". 1aker .5I4
REFERENCES %
14 E#ements of $iscrete !athematics-3 computer oriented approach %6 6iu' $ .
mohapatra' 3rd ed "!5
2 $iscrete !athematics and its 3pp#ications' 9enneth 54 2osen' /ifth Edition4"!54
34 $iscrete !athematics with 3pp#ications' "homas 9oshy' E#se(ier
With effect from academic year 2012-13
11CS202CV
DATASTRUCTURES THROU,H C11
(Common to CSE & IT)
Instruction : : periods/week End Examination : 7 !arks
"utoria# : 1 .eriod/Week $uration : 3 hours
%redits : : &essiona# marks : 2
Un!t I %
%;; %#ass <(er(iew- 1asic <<. concepts' %#ass $efinition' <)=ects' %#ass !em)ers'
3ccess %ontro#' %#ass &cope' %onstructors and destructors' parameter passin*
methods' In#ine functions' static c#ass mem)ers' this pointer' friend functions'
dynamic memory a##ocation and dea##ocation >new and de#ete?' exception hand#in*4
Un!t II %
/unction <(er 6oadin*' <perator <(er#oadin*' 7eneric .ro*rammin*- /unction and
c#ass temp#ates' Inheritance )asics' )ase and deri(ed c#asses' inheritance types'
)ase c#ass access contro#' runtime po#ymorphism usin* (irtua# functions' a)stract
c#asses4
Un!t III %
3#*orithms' performance ana#ysis- time comp#exity and space comp#exity4 2e(iew of
)asic data structures- "he #ist 3$"' &tack 3$"' -ueue 3$"' 3rray and #inked #ist
Imp#ementations usin* temp#ate c#asses in %;;4
"rees @ 1asic termino#o*y' 1inary tree 3$"' 3rray and #inked representations'
tra(ersa#s' threaded )inary trees
Un!t IV %
$ictionaries' #inear #ist representation' skip #ist representation' operations insertion'
de#etion and searchin*' 5ashin*-hash ta)#e representation' hash functions' co##ision
reso#ution-separate chainin*' open addressin*-#inear pro)in*' +uadratic pro)in*'
dou)#e hashin*' rehashin*' extendi)#e hashin*' comparison of hashin* and skip #ists4
Un!t V %
.riority -ueues- $efinition' 3$"' 2ea#iAin* a .riority -ueue usin* 5eaps' $efinition'
insertion' $e#etion' 5eap sort' Externa# &ortin*- !ode# for externa# sortin*' !u#tiway
mer*e' .o#yphase mer*e4
Un!t VI %
Sa&"h T&( (Pa&t1):1inary &earch "rees' $efinition' 3$"' Imp#ementation'
<perations- &earchin*' Insertion and $e#etion' 3B6 "rees' $efinition' <perations
Insertion and &earchin*
Un!t VII %
Sa&"h t&( (-a&t II) % 1-"rees' $efinition' 1-"ree of order m' insertion' de#etion
and searchin*' %omparison of &earch "rees
7raphs: 1asic termino#o*y' representations of 7raphs' 7raph search methods $/&'
1/&4
Un!t VIII %
"ext .rocessin* : .attern matchin* a#*orithms-1rute force' the 9nuth-!orris-.ratt
a#*orithm' &tandard "ries' %ompressed "ries' &uffix tries4
TE.T /OO0S %
12 %;; %omp#ete reference )y 5er)er)ert &chi#dt ':
th
Edition' "!5
24 $ata structures' 3#*orithms and 3pp#ications in %;;' &4&ahni' 2nd edition' !c
7rawhi##4
34 $ata structures and 3#*orithms in %;;' !ichae# "47oodrich' 24"amassia and $
!ount' Wi#ey student edition' &e(enth edition' 8ohn Wi#ey and &ons4
REFERENCES %
14 $ata structures and 3#*orithm 3na#ysis in %;;' !ark 3##en Weiss' .earson
Education4 6td4' &econd Edition4
24 $ata structures and a#*orithms in %;;' 3rd Edition' 3dam $roAdek' %en*a*e
34 $ata structures usin* %;;' $ & ma#ik'%en*a*e #earnin*'India Edition4
:4 $ata structures with %;;' Csin* &"6' 2
,d
edition ' W454 /ord and W424 "roop
.earson/.5I4
With effect from academic year 2012-13
11CS231CV
DATA STRUCTURES THROU,H C11 LA/
(Common to CSE & IT)
.ractica# : 3 periods/week End Examination : 0 !arks
%redits : 2 $uration : 3 hours
&essiona# marks : 2
451
Execute fo##owin* % #an*ua*e pro*rams usin* 7$14
a? &ortin* )?&earchin*
452
Execute fo##owin* % #an*ua*e pro*rams usin* 7$14
a?6inked 6ist )? 1inary "ree
453
Write %;; pro*rams to demonstrate the fo##owin*
a? c#ass scope )? %onstructors c? $estructors d?In #ine functions e? static mem)ers
45 6
Write %;; pro*rams to demonstrate the fo##owin*
a? $ynamic memory mana*ement )? /riend functions c?exception hand#in*
45 7
Write %;; pro*rams to demonstrate the fo##owin*
a?<(er#oadin* )? /unction 0 %#ass temp#ates
45 8
Write %;; pro*rams to demonstrate the fo##owin*
a? 3## inheritance types )? run time po#ymorphism usin* (irtua# functions and
a)stract c#asses
>,ote: use "emp#ate for a## remainin* pro*rams?
45 9
Write %;; pro*rams to imp#ement the fo##owin* usin* an arrays4
a? &tack 3$" )? -ueue 3$"
45 :
Write %;; pro*rams to imp#ement the fo##owin* usin* #inked #ists4
a? &tack 3$" )? -ueue 3$"
45 ;
Write a %;; pro*ram to imp#ement )inary search tree operations:
a? Insert an e#ement 4
)? $e#ete an e#ement4
c? &earch for a key e#ement4
45 10
Write %;; pro*rams to tra(erse the *i(en )inary tree in
a? .reorder )? inorder and c? postorder4
45 11
Write a %;; pro*ram to imp#ement a## the functions of a dictionary >3$"?
usin* hashin*4
45 12
-4Write %;; pro*rams for the imp#ementation of 9nuth-morris pratt pattern
matchin*
A''!t!ona# -&o$&am(
14 Write %;; pro*ram to imp#ement prority +ueue operations4
24 Write %;; pro*ram to imp#ement 3B6 trees4
34 Write %;; pro*ram to imp#ement 1 "rees4
REFERENCES %
14 $ata structures a pseudo code approach with c;; ' Indian edition' 24/47i#)er*
and 1434/orouAan %en*a*e 6earnin*4
24 .ro*rammin* .rinicp#es and .ractice usin* %;;' 14&troustrup' .earson Education
34 $ata &tructures and 3#*orithms in %;;' "hird Edition' 3dam $roAdek' "homson4
:4 $ata &tructures usin* %;;' $4&4 !a#ik' "homson 4
With effect from academic year 2012-13
11CS271CV
COMPUTER OR,ANI<ATION
(Common to CSE & IT)
Instruction : 3 periods/week End Examination : 7 !arks
"utoria# : 1 .eriod/Week $uration : 3 hours
%redits : 3 &essiona# marks : 2
UNIT-I
1asic structure of computers: computer "ypes' /unctiona# unit' 1asic <.E23"I<,36
concepts' 1us structures' &oftware' .erformance' !u#tiprocessors and mu#ti
computers4 $ata 2epresentation4 /ixed .oint 2epresentation4 /#oatin* @ .oint
2epresentation4 Error $etection codes' %omputer 3rithmetic: !u#tip#ication and
$i(ision 3#*orithms4
UNIT-II
RE,ISTER TRANSFER LAN,UA,E AND MICROOPERATIONS%
2e*ister "ransfer #an*ua*e4 2e*ister "ransfer 1us and memory transfers' 3rithmetic
!icro operations' shift micro operations' 3rithmetic #o*ic shift unit' Instruction codes4
%omputer 2e*isters %omputer instructions @ Instruction cyc#e' I/.-</. and Interrupt4
UNIT-III
INSTRUCTION SETS4 &"3%9 or*aniAation4 Instruction formats4 3ddressin* modes4
$3"3 "ransfer and manipu#ation4 .ro*ram contro#4 2educed Instruction set
computer'I3-32 3rchitecture and instruction set4
UNIT-IV
MICRO PRO,RAMMED CONTROL %
%ontro# memory' 3ddress se+uencin*' micropro*ram examp#e' desi*n of contro# unit
5ard wired contro#4 !icropro*rammed contro#4
UNIT-V
THE MEMOR= S=STEM %
1asic concepts semiconductor 23! memories4 2ead @ on#y memories %ache
memories performance considerations' (irtua# memories secondary stora*e4
Introduction to 23I$4
UNIT-VI
INPUT-OUTPUT OR,ANI<ATION %
.eriphera# $e(ices' $!3' Input @ <utput Interface' 3synchronous data transfer
!odes of "ransfer' .riority Interrupt '.%I 1us4
UNIT-VII
PIPELINE AND VECTOR PROCESSIN,%
.ara##e# .rocessin*' .ipe#inin*' 3rithmetic .ipe#ine' Instruction .ipe#ine' 2I&% .ipe#ine
Bector .rocessin*' 3rray .rocessors4
UNIT-VIII
MULTIPROCESSORS%
%haracteristics or !u#tiprocessors' Interconnection &tructures' Interprocessor
3r)itration4 Inter .rocessor %ommunication and &ynchroniAation %ache %oherence4
&hared !emory !u#tiprocessors4
TE.T /OO0S%
14 %omputer &ystems 3rchitecture @ !4!oris !ano' IIIrd Edition' .earson/
.5I>Cnits II'III'IB'BI'BII'BIII?
24 computer or*aniAation car# hamacher A(onks (ranesic safeaAaky th
Edition' !c7raw 5i##4>Cnits I 0 B?
REFERENCES%
14 %omputer <r*aniAation and 3rchitecture @ Wi##iam &ta##in*s &ixth Edition'
.earson/.5I
24 &tructured %omputer <r*aniAation @ 3ndrew &4"anen)aum' :
th
Edition
.5I/.earson
With effect from academic year 2012-13
11CS272CV
DATA /ASE MANA,EMENT S=STEMS
(Common to CSE & IT)
Instruction : : periods/week End Examination : 7 !arks
"utoria# : 1 .eriod/Week $uration : 3 hours
%redits : : &essiona# marks : 2
UNIT > I
$ata)ase &ystem 3pp#ications' data)ase systems Bs /i#e &ystems4 Biew of data-
data a)straction-instances and schemas- data mode#s- the E2 mode#D2e#ationa#
mode#-other mode#-$ata)ase #an*ua*es-$$6-$!6 @$ata)ase access for app#ication
pro*rams-$ata )ase users and administrators-"ransaction !ana*ement- data)ase
system structure-&tora*e !ana*er-the -uery .rocessor
UNIT >II
5istory <f $ata1ase &ystems4 $ata1ase $esi*n and E2-$ia*rams-)eyond E2 $esi*n
Entities4 3ttri)utes 3nd Entity &ets-2e#ation&hips and 2e#ationship &ets-3dditiona#
/eatures <f E2 !ode#-%oncept $esi*n With E2 !ode#-%onceptua# $esi*n /or 6ar*e
Enterprises4
UNIT III
Introduction to the re#ationa# !ode#-Inte*rity constraints o(er re#ations-Enforcin*
Inti*rity constraints @-ueryin* 2e#ationa# data-#o*ica# data)ase desi*n @ introduction
to (iews @destroyin*/a#terin* "a)#es and Biews4
2e#ationa# a#*e)ra-se#ection and pro=ection set operations-renamin*-=oins-di(ision-
examp#es of a#*e)ra o(er(iews @ re#ationa# %a#cu#us-"up#e 2e#ationa# ca#cu#us-$omain
re#ationa# %a#cu#us 4
UNIT IV
/orm of )asic +uery- Examp#es of )asic &-6 +uery-Introduction to ,ested -ueries @
corre#ated nested +ueries-set comparison operator-3**re*ate operators- ,C66
(a#ues and comparison usin* ,C66 (a#ues -6o*ica# connecti(ities- 3,$ '<2 and ,<"
@Impacts <n &-6 %onstructs-<C"E2 8oins @$isa##owin* ,C66 Ba#ues-%omp#ex
Inte*rity constraints in &-6 "ri**ers4
UNIT - V
&cheme 2efinement: pro)#ems caused )y redundancy-$ecompositions-pro)#ems
re#ated to $ecompositions-reasonin* a)out /$&-/I2&"' &E%<,$ "5I2$ ,orma#
/orms-1%,/-#oss#ess =oin decomposition-dependency preser(in* decomposition-
!u#ti-(a#ued dependencies -forth ,orma# /orms4
UNIT - VI
"ransaction concepts : "ransaction state @Imp#ementation <f 3tomicity and
$ura)i#ity-concurrent @execution-seria#iAa)i#ity-reco(era)i#ityDImp#ementation <f
Iso#ation @testin* for seria#iAa)i#ity @6ock 1ased .rotoco#s-"ime&tamp1ased
.rotoco#s-Ba#idation 1ased .rotoco#s-!u#tip#e 7ranu#arity4
UNIT VII
2eco(ery and 3tomicity-6o* 1ased 2eco(ery @2eco(ery with concurrent
transactions @1uffer !ana*ement @/ai#ure with 6oss <f non(o#ati#e stora*e @
3d(ance reco(ery systems -2emote 1ackup &ystems4
UNIT-VIII
$ata on externa# stora*e-/i#e <r*aniAation and indexin*-c#uster Indexes- primary
and secondary indexes- index data structure-5ash )ased indexin*-tree )ased
indexin*- comparison of /i#e or*aniAations - indexes and performance tunin*-
Intuitions for tree Indexes @Indexed se+uentia# 3ccess !ethods>I&3!?-1; "rees :3
$ynamic Index &tructure
TE.T /OO0S %
14 E$ata)ase !ana*emetn &ystemsE' 2a*hu 2ama 9rishnan' 8ohannes *ehrke
'"!5'# 3rd Edition
24 $ata)ase &ystem %oncepts' 3)raham &i#)erschatA' 5enry /4 9orth' &4
&udarshan '!c 7raw5i##
th
Edition4
REFERENCES:
14 /undamenta# <f $ata)ase systems 4 E#masri ,a(athe pearson education4
24 Introduction to $ata)ase &ystems' %48 $ate .earson Education4
34 <rac#e for professiona#s "he F team & shah and B shah &.$4
:4 $ata)ase system usin* <rac#e 3 simp#ified *uide to &-6 and .6/&-6 - shah .5I4
With effect from academic year 2012-13
11CS273CV
O/?ECT ORIENTED PRO,RAMMIN,
(Common to CSE & IT)
Instruction : : periods/week End Examination : 7 !arks
%redits : : $uration : 3 hours
&essiona# marks : 2
UNIT I%
?a@a /a(!"( 5istory of 8a(a' 8a(a )uAAwords' data types' (aria)#es' scope and #ife
time of (aria)#es' arrays' operators' expressions' contro# statements' type
con(ersion and castin*' simp#e =a(a pro*ram' c#asses and o)=ects @ concepts of
c#asses' o)=ects' constructors' methods' access contro#' this keyword' *ar)a*e
co##ection' o(er#oadin* methods and constructors' parameter passin*' recursion'
nested and inner c#asses' exp#orin* strin* c#ass
UNIT II%
Inh&!tan" @ 5ierarchica# a)stractions' 1ase c#ass o)=ect' su)c#ass' su)type'
su)stituta)i#ity' forms of inheritance- specia#iAation' specification' construction'
extension' #imitation' com)ination' )enefits of inheritance' costs of inheritance4
!em)er access ru#es' super uses' usin* fina# with inheritance' po#ymorphism-
method o(erridin*' a)stract c#asses' the <)=ect c#ass
UNIT III%
Pa"5a$( an' Int&Aa"( : $efinin*' %reatin* and 3ccessin* a .acka*e'
Cnderstandin* %63&&.3"5' importin* packa*es' differences )etween c#asses and
interfaces' definin* an interface' imp#ementin* interface' app#yin* interfaces'
(aria)#es in interface and extendin* interfaces
UNIT IV%
EB"-t!ona# Han'#!n$ %oncepts of exception hand#in*' )enefits of exception
hand#in*' exception hierarchy' usa*e of try' catch' throw' throws and fina##y' )ui#t in
exceptions' creatin* own exception su)c#ass' &trin* hand#in* 'Exp#orin* =a(a4io
packa*e
UNIT V%
M*#t!th&a'!n$%-$ifferences )etween mu#tithreadin* and mu#titaskin*' thread
#ife cyc#e' creatin* threads' thread priorities' synchroniAin* threads' Interthread
communication 'Exp#orin* =a(a4uti#-3rray6ist' &trin*"okeniAer' 2andom and Bector
c#asses4
UNIT VI%
A--#t( @ %oncepts of 3pp#ets' differences )etween app#ets and app#ications' #ife
cyc#e of an app#et' types of app#ets' creatin* app#ets' passin* parameters to app#ets
E@nt Han'#!n$% E(ents' E(ent sources' E(ent c#asses' E(ent 6isteners'
$e#e*ation e(ent mode#' hand#in* mouse and key)oard e(ents' 3dapter c#asses'
3nonymous Inner c#asses
UNIT VII
"he 3W" c#ass hierarchy' user interface components-#a)e#s' )utton' can(as'
scro##)ars' text components' check)ox' check)ox *roups' choices' #ist pane#s-
scro##pane' dia#o*s' menu)ar' 7raphics' #ayout mana*er-#ayout mana*er types-
)order' *rid' f#ow' card and *rid )a*4
UNIT VIII%
SC!n$ @ Introduction' #imitations of 3W"' !B% architecture' components'
containers' exp#orin* swin*- 83pp#et' 8/rame and 8%omponent' Icons and 6a)e#s' text
fie#ds' )uttons @ "he 81utton c#ass' %heck )oxes' 2adio )uttons' %om)o )oxes'
"a))ed .anes' &cro## .anes' "rees' and "a)#es4
TE.T /OO0S %
14 8a(aG the comp#ete reference' 7
th
editon' 5er)ert schi#dt' "!54
24 Cnderstandin* <<. with 8a(a' "4 1udd' pearson education4
REFERENCES
1 %ore 8a(a 2' Bo# 1' /undamenta#s' %ay4&45orstmann and 7ary %orne##' ei*hth
Edition' .earson Education4
2 %ore 8a(a 2' Bo# 2' 3d(anced /eatures' %ay4&45orstmann and 7ary %orne##' ei*hth
Edition' .earson Education
3 8a(a and <)=ect <rientation' an introduction' 8ohn 5unt' second editionG &prin*er
: !aurachHs 1e*innin* 8a(a2 8$9 ' 8oe# !urach' 3ndrea &tee#man' $ou* 6owe' &.$

With effect from academic year 2012-13
11CS276CV
FORMAL LANGUAGES AND AUTOMATA THEORY
(CSE)
Instruction : 3 periods/week End Examination : 7 !arks
"utoria# : 1 .eriod/Week $uration : 3 hours
%redits : 3 &essiona# marks : 2
UNIT- I
/undamenta#s : &trin*' 3#pha)et' 6an*ua*e' <perations' /inite state machine'
definitions' finite automaton mode#' acceptance of strin*s' and #an*ua*es'
deterministic finite automaton and non deterministic finite automaton' transition
dia*rams and #an*ua*e reco*niAers4
UNIT - II
/inite 3utomata: ,/3 with # transitions @ &i*nificance' acceptance of #an*ua*es4
%on(ersions and E+ui(a#ence : E+ui(a#ence )etween ,/3 with and without #
transitions' ,/3 to $/3 con(ersion' minimiAation of /&!' e+ui(a#ence )etween two
/&!Hs' /inite 3utomata with output-!oore and !e#ay machines.
UNIT- III
2e*u#ar 6an*ua*es: 2e*u#ar sets' re*u#ar expressions' identity ru#es' %onstructin*
finite 3utomata for a *i(en re*u#ar expressions' %on(ersion of /inite 3utomata to
2e*u#ar expressions4 .umpin* #emma of re*u#ar sets' c#osure properties of re*u#ar
sets >proofs not re+uired?4
UNIT- IV
7rammar /orma#ism: 2e*u#ar *rammars-ri*ht #inear and #eft #inear *rammars'
e+ui(a#ence )etween re*u#ar #inear *rammar and /3' inter con(ersion' %ontext free
*rammar' deri(ation trees' sententia# forms4 2i*ht most and #eft most deri(ation of
strin*s4
UNIT > V
%ontext /ree 7rammars: 3m)i*uity in context free *rammars' !inimiAation of
%ontext /ree 7rammars' %homsky norma# form' 7rei)ack norma# form' .umpin*
6emma for %ontext /ree 6an*ua*es4 Enumeration of properties of %/6 >proofs
omitted?4
UNIT - VI
.ush $own 3utomata: .ush down automata' definition' mode# acceptance of %/6
3cceptance )y fina# state and acceptance )y empty state and its e+ui(a#ence4
E+ui(a#ence of %/6 and .$3 intercon(ersion4 >.roofs not re+uired?4 Introduction to
$%/6 and $.$34
UNIT > VII
"unin* !achine : "urin* !achine '$efinition' !ode#' $esi*n of "!4 %omputa)#e
functions' recursi(e#y enumera)#e #an*ua*es' churchHs 5ypothesis' counter machine'
types of "urin* machines'>.roofs not re+uired?4
UNIT > VIII
%omputa)i#ity "heory: %homsky hierarchy of #an*ua*es' #inear )ounded automata
and context sensiti(e #an*ua*e' decida)i#ity of pro)#ems' Cni(ersa# "urin* !achine'
Cndecida)i#ity of post %orrespondence pro)#ems' reduci)i#ity4
TBt /oo5( %
14IIntroduction to 3utomata "heory 6an*ua*es and %omputationJ4 5opcroft 54E4 and
C##man 84$4 .earson Education
24Introduction to %omputer "heory' $anie# I4 34 %ohen4 8ohn Wi#ey4
RA&n"( %
14 Introduction to #an*ua*es and the "heory of %omputation' 8ohn % !artin' "!5I
24E#ements of "heory of %omputationJ' 6ewis 54.4 0 .apadimition %454 .earson /
.5I4
34"heory of %omputer &cience @ 3utomata #an*ua*es and computation @ !ishra and
%handrashekaran' 2
nd
edition' .5I4
:4 Introduction to "heory of %omputation @ &ipser 2
nd
edition "homson4
With effect from academic year 2012-13
11CS277CV
DESI,N AND ANAL=SIS OF AL,ORITHMS
(CSE)
Instruction : 3 periods/week End Examination : 7 !arks
"utoria# : 1 .eriod/Week $uration : 3 hours
%redits : 3 &essiona# marks : 2
UNIT-I
INTRODUCTION% 3#*orithm '.seudo code for expressin* a#*orithms' performance
ana#ysis' "ime comp#exity and space comp#exity' 3symptotic notations- < notation
<me*a notation and theta notation' #itt#e-o notation' pro)a)i#istic ana#ysis' amortiAed
ana#ysis4
UNIT-II
DIS?OINT SETS% $is=oint set operations' union and find a#*orithms' spannin*
trees' connected components and )iconnected components4
UNIT-III
DIVIDE AND CONDUER% 7enera# method' 3pp#ications: 1inary search' mer*e sort'
+uick sort' &trassenKs matrix mu#tip#ication4
UNIT-IV
,REED= METHOD% 7enera# method' 3pp#ications: =o) se+uencin* with
dead#ines'0/1 knapsack pro)#em' minimum spannin* tree' sin*#e source shortest
path pro)#em
UNIT-V
D=NAMIC PRO,RAMMIN,% 7enera# method' app#ication: !atrix chain
mu#tip#ications' optima# )inary search trees' 0/1 knapsack pro)#em' 3## pairs shortest
path pro)#em' re#ia)i#ity desi*n pro)#em' tra(e##in* sa#es person pro)#em4
UNIT-VI
/AC0 TRAC0IN,% 7enera# method' app#ications: nL+ueens pro)#em' &um of
su)sets pro)#em' *raph co#ourin* pro)#em4 5ami#tonian cyc#es4
UNIT-VII
/RANCH an' /OUND% 7enera# method' 3pp#ications: "ra(e##in* sa#es person
pro)#em'0/1 knapsack pro)#em' 6% )ranch and )ound so#ution'' /I/< )ranch and
)ound so#ution
UNIT-VIII
NP-ha&' an' NP-"om-#t -&o)#m(% )asic concepts' nondeterministic
a#*orithms' ,.-hard and ,.-comp#ete c#asses' %ookHs theorem
TE.T /OO0S%
14 E4 5<2<WI"M and &4&35,I: E/undamenta#s of a#*orithmsE 7a#*otia
24 Introduction to a#*orithms' 2
nd
edition' "454%ormen' %4E46eiserson' 24642i(est' and
%4&tein' .5I .(t 46td/.earson Education4
REFERENCES%
143#*orithm $esi*n' !ichae# .4 7oodrich' 2o)erto "amassia
24"he $esi*n and 3na#ysis of %omputer 3#*orithms @ 35< '5op %roft' C##man @ 6ow
.rice edition
With effect from academic year 2012-13
11CS2:1CV
O/?ECT ORIENTED PRO,RAMMIN, LA/
(Common to CSE & IT)
.ractica# : 3 periods/week End Examination : 0 !arks
%redits : 2 $uration : 3 hours
&essiona# marks : 2
45 1%
Write =a(a pro*rams that demonstrate the use of fo##owin* keywords
a?this )?static c? fina# d?super
45 2
a? Write a =a(a pro*ram that checks whether a *i(en strin* is pa#indrome or not4Ex:
!3$3! is a pa#indrome
)? Write a 8a(a pro*ram for sortin* a *i(en #ist of names in ascendin* order4
c? Write a 8a(a pro*ram that reads a #ine of inte*ers'and then disp#ays each inte*er
and the sum of a## the inte*ers>Cse &trin*"okeniAer c#ass of =a(a4uti#?
d? Write a =a(a pro*ram which demonstrate the concept of dynamic method
dispatchN
45 3
a)Develop a user defined package and create class Account in it ,and display the names
of customers whose balance is less than zero
b) Write a java program to demonstrate the concept of access specifiers?
456
a? Write a 8a(a .ro*ram that reads a fi#e name from the user' then disp#ays
information a)out Whether the fi#e exists' whether the fi#e is reada)#e' whether the
fi#e is writa)#e' the type of fi#e and the #en*th of the fi#e in )ytes4
)? Write a 8a(a pro*ram to copy the content from one fi#e to another fi#e
c? Write a 8a(a .ro*ram that disp#ays the num)er of characters '#ines and words in a
text fi#e4
45 7
a?Write a 8a(a .ro*ram>usin* =a(a4uti#4O packa*e? that Imp#ements stack 3$"
)?Write =a(a pro*rams that demonstrates uncau*ht exceptions and user defined
Exceptions
45 84
a?Write a 8a(a pro*ram that creates three threads4 /irst thread disp#ays I7ood
!ornin*J e(ery <ne second' the second thread disp#ays I5e##oJ e(ery two seconds
and third disp#ays IWe#comeJ e(ery three seconds4
)?Write a 8a(a pro*ram that correct#y imp#ements producer consumer pro)#em usin*
the concept of inter thread communication4
45 9
a?$e(e#op an app#et that disp#ays a simp#e messa*e
)?$e(e#op an app#et that recei(es an inte*er in one test fie#d' and computes its
factoria# Ba#ue and returns it in another text fie#d' when the )utton named I%ompute
Iis c#icked4
45 :
a?Write a 8a(a pro*ram for hand#in* mouse and key e(ents4
)?Write a pro*ram that creates a user interface to perform inte*er di(isions4 "he
user enters two num)ers in the text fie#ds4,um1 and ,um24"he di(ision of ,um1
and ,um2 is disp#ayed in the 2esu#t fie#d when the $i(ide )utton is c#icked 4If ,um1
or ,um2 were not an inte*er' the pro*ram wou#d throw a ,um)er/ormatException4
If ,um2 were Aero' the pro*ram wou#d throw an 3rithmetic Exception
45 ;
Write a 8a(a pro*ram that works as a simp#e ca#cu#ator4 Cse a *rid #ayout to arran*e
)uttons for the di*its and for the ;'-'O' P operations4 3dd a test fie#d to disp#ay the
resu#t4
45 10
a?Write a 8a(a pro*ram that simu#ates a traffic #i*ht4 "he pro*ram #ets the user
se#ect one of three 6i*hts: red' ye##ow' or *reen4 When a radio )utton is se#ected' the
#i*ht is turned on' and on#y one 6i*ht can )e on at a time4 ,o #i*ht is on when
pro*ram starts4
)?Write a 8a(a pro*ram that a##ows the user to draw #ines' rectan*#es and o(a#s4
45 11
a?Write a app#et pro*ram to create a 7CI with menus' dia#o* )oxes4>use card #ayout
for 7CI?
45 12
a?&uppose that a ta)#e named "a)#e4txt is stored in a test fi#e4 "he first #ine in the fi#e
is the header and the remainin* #ines corresponds to rows in a ta)#e4 "he e#ements
are separated )y commas' Write a =a(a pro*ram to disp#ay the ta)#e usin* 8ta)#e
component4
REFERENCES%
14 8a(a 5ow "o .ro*ram'&ixth Edition'54!4$iete# and .484$iete#'.earson
Education/.5I
24 .ro*rammin* with 8a(a'!4.41ha(e and &434.atekar'.earson Education
34 1i* 8a(a'2
nd
Edition'%ay 5orstmann'Wi#ey &tudent Edition4Wi#ey India .ri(ate
6imited4
:4 Introduction to .ro*rammin* with 8a(a'8 $ean 0 24$ean4!c7raw 5i##
education4
With effect from academic year 2012-13
11CS2:2CV
DATA/ASE MANA,EMENT S=STEMS LA/
(Common to CSE & IT)
.ractica# : 3 periods/week End Examination : 0 !arks
%redits : 2 $uration : 3 hours
&essiona# marks : 2
1 In the process of computeriAation of 2oadway "ra(e#s you ha(e to desi*n and
de(e#op a $ata)ase which consists the data of 1uses' .assen*ers' "ickets' and
2eser(ation and cance##ation detai#s4 Qou shou#d a#so de(e#op +ueryKs usin* &-6 to
retrie(e the data from the data)ase 4
3na#yAin* the pro)#em and identifyin* the Entities and 2e#ationships4
24 E-2 !ode#
34 2e#ationa# !ode#
:4 ,orma#iAation
4 %reatin* the data)ase4
R4 %reatin* ta)#es for (arious re#ations
74 -ueryin*4 a?Insertion )? 2etrie(a#> operations #ike Cnion' Insert' !inus' in'
exist' a**re*ate functions etc4
c? Cpdation
d? $e#etion
S4%reatin* Biews
T4Writin* 3ssertions4
104Writin* tri**ers4
11 Imp#ementin* operations on re#ations usin* .6/&-64
124 %reatin* 2eports4
REFERENCES%
14 Introduction to &-6'2ick /4Bander 6ans'.earson education4
24 <rac#e .6#&-6 .ro*rammin*'&te(en /euerstein'&.$4
34 &-6 0 .6#&-6 for <rac#e 1 <*'1#ack 1ook' $r4.4&4$eshpande' $ream "ech4
:4 <rac#e $ata)ase11* .6/&-6 .ro*rammin*'!4!c 6au*h#in'"!54
With effect from academic year 2012-13
11IT271CV
PRINCIPLES OF PRO,RAMMIN, LAN,UA,ES
(IT)
Instruction : 3 periods/week End Examination : 7 !arks
"utoria# : 1 .eriod/Week $uration : 3 hours
%redits : 3 &essiona# marks : 2
UNIT I
P&#!m!na&+ Con"-t(: 2easons for studyin* concepts of pro*rammin* #an*ua*es
pro*rammin* domains' #an*ua*e e(a#uation criteria' Inf#uences on #an*ua*e desi*n'
6an*ua*e cate*ories' pro*rammin* paradi*ms- Imperati(e pro*rammin*
#an*ua*e'<<.s and /unctiona# pro*rammin* 6an*ua*es' #o*ic pro*rammin*'
6an*ua*e imp#ementation @compi#ation and (irtua# machines' pro*rammin*
en(ironments4
UNIT II
S+ntaB an' Smant!"(% 7enera# pro)#ems of descri)in* syntax and semantics'
1,/' E1,/ for common pro*rammin* #an*ua*e features' parse trees' am)i*uous
*rammars' 3ttri)ute *rammer' denotationa# semantics and axiomatic semantics for
common pro*rammin* #an*ua*e features4
UNIT III
Data t+-( an' @a&!a)#(% .rimiti(e and ,on-primiti(e $ata type'character'user
defined'array'associati(e'record'union'pointer and reference types'desi*n and
imp#ementation uses re#ated to these types4 ,ames'(aria)#e'concept of )indin*' "ype
checkin*' type compati)i#ity' &tron* type' named constants' (aria)#e initia#iAation4
UNIT IV
EB-&((!on & (tatmnt(% 3rithmatic' 2e#ationa# and 1oo#ean Expression'&hort
circuit e(a#uation mixed mode assi*nment' 3ssi*nment &tatements' %ontro#
&tructures-&tatement 6e(e# %ontro# &tructures' %ompound &tatements'&e#ection'
Iteration' Cnconditiona# &tatements'*uarded commands4
UNIT V
S*)-&o$&am( an' )#o"5(% /undamenta#s of su)pro*rams' scope and #ifetime of
(aria)#e'static and dynamic scope'desi*n issues of su)pro*rams and operations' #oca#
referencin* en(ironments' .arameter passin* method' <(er#oaded &u)pro*rams
and 7eneric &u)pro*rams'parameters that are su) pro*ram names'desi*n issues for
functions user o(er#oaded operators'co-routines4
UNIT VI
A)(t&a"t 'ata t+-(% 3)stractions and encapsu#ation' Introduction to $ata
3)straction' $esi*n Issues' 6an*ua*e Examp#es' %;; parameteriAed a)stract data
types'<<. in sma## ta#k'%;;'=a(a'cU4adaT4
Con"*&&n"+% &u)pro*ram 6e(e# concurrency' &emaphores'!onitors' !essa*e
passin*' 83B3 "hreads'cU threads4
UNIT VII
EB"-t!on Han'#!n$% Exceptions'exception propa*ation' Exception hand#er in
3da'%;; and =a(a4
Lo$!" -&o$&amm!n$ #an$*a$% Introduction and o(er(iew of #o*ic pro*rammmin*
#an*ua*e' "he )asic e#ements of .2<6<7' 3pp#ications of #o*ic pro*rammin*4
UNIT VIII
F*n"t!ona# -&o$&amm!n$ #an$*a$(% Introduction' /undamenta#s of /.6' 6I&.'
3pp#ication of functiona# pro*rammin* #an*ua*e and comparison of functiona# and
imperati(e #an*ua*es4
S"&!-t!n$ Lan$*a$(% Introduction to 5"!6' %ase &tudy: 8a(a&cript- 9ey
%oncepts' Ba#ues and "ypes' Baria)#es' <)=ects in 8a(a&cript' $ynamic 5"!6 with
8a(a&cript4
TE.T /OO0S%
14 %oncepts of pro*rammin* #an*ua*es 2o)ert4W4se)esta R/e'pearson
education4
24 .ro*rammin* 6an*ua*es desi*n and imp#ementation - pratt and Me#kowitA'
fourth edition .5I/.earson Education4
34 We) .ro*rammin*' )ui#din* internet app#ications' %hris 1ates 2
nd
edition'
Wi#ey $ream"ech4
REFERENCES %
14 pro*rammin* #an*ua*es - 7heAAi'3/e'8ohn wi#ey4
24 pro*rammin* #an*ua*es @ 6ouden' second Edition'"homson4
34 6I&. patric henry Winston and pau# horn pearson education4
:4 pro*rammin* in .2<6<7 c#ocksin ' sprin*er4
With effect from academic year 2012-13
11CS203CV
DI,ITAL LO,IC DESI,N
(Common to CSE EIT & EEE)
Instruction : 3 periods/week End Examination : 7 !arks
"utoria# : 1 .eriod/Week $uration : 3 hours
%redits : 3 &essiona# marks : 2
UNIT-I
/INAR= S=STEMS % $i*ita# &ystems' 1inary ,um)ers' ,um)er )ase con(ersions'
<cta# and 5exadecima# ,um)ers' comp#ements' &i*ned )inary num)ers' 1inary
codes' 1inary &tora*e and 2e*isters' 1inary #o*ic4
UNIT-II
/OOLEAN AL,E/RA AND LO,IC ,ATES % 1asic $efinitions' 3xiomatic definition of
1oo#ean 3#*e)ra' 1asic theorems and properties of 1oo#ean a#*e)ra' 1oo#ean
functions canonica# and standard forms' other #o*ic operations' $i*ita# #o*ic *ates'
inte*rated circuits4
UNIT-III
,ATE LEVEL MINIMI<ATION % "he map method' /our-(aria)#e map' /i(e-Baria)#e
map' product of sums simp#ification $onHt-care conditions' ,3,$ and ,<2
imp#ementation other "wo-#e(e# imp#ementations' Exc#usi(e -<r function' 5ard ward
$escription #an*ua*e >5$6?4
UNIT - IV
COM/INATIONAL LO,IC % %om)inationa# %ircuits' 3na#ysis procedure $esi*n
procedure' 1inary 3dder-&u)tractor $ecima# 3dder' 1inary mu#tip#ier' ma*nitude
comparator' $ecoders' Encoders' !u#tip#exers' 5$6 for com)inationa# circuits4
UNIT - V
S=NCHRONOUS SEDUENTIAL LO,IC % &e+uentia# circuits' #atches' /#ip-/#ops
3na#ysis of c#ocked se+uentia# circuits' 5$6 for se+uentia# circuits' &tate 2eduction
and 3ssi*nment' $esi*n .rocedure4
UNIT - VI
2e*isters' shift 2e*isters' 2ipp#e counters synchronous counters' other counters'
5$6 for 2e*isters and counters4
UNIT - VII
Introduction' 2andom-3ccess !emory' !emory $ecodin*' Error $etection and
correction 2ead-on#y memory' .ro*ramma)#e #o*ic 3rray pro*ramma)#e 3rray #o*ic'
&e+uentia# .ro*ramma)#e $e(ices4
UNIT-VIII
AS=NCHRONOUS SEDUENTIAL LO,IC % Introduction' 3na#ysis .rocedure' %ircuits
with 6atches' $esi*n .rocedure' 2educiton of state and /#ow "a)#es' 2ace-/ree state
3ssi*nment 5aAards' $esi*n Examp#e4
TE.T /OO0S %
14 $i*ita# $esi*n ' !4!orris !ano' "hird Edition' .earson Education/.5I4
24 /undamenta#s of 6o*ic desi*n' 2oth' th Edition'"homson4
REFERENCES %
14 &witchin* and /inite 3utomata "heory )y M(i4 9oha(i' "ata !c7raw 5i##4
22 /undamenta#s of $i*ita# 6o*ic0micro %omputer $esi*n' !4 2afi+uAAaman Ed' WE
34 $i*ita# .rincip#es and $esi*n '$ona#d $47i(one' "ata !c7raw 5i##' Edition4
With effect from academic year 2012-13
12CS101CV
PRO/LEM SOLVIN, THROU,H FCG
(Common to a## /&an"h()
Instruction : 3 periods/week End Examination : 7 !arks
%redits : 3 $uration : 3 hours
&essiona# marks : 2
UNIT - I
Int&o'*"t!on to Com-*t&(%
5ardware components: %.C' 23!' I/< $e(ices4
&oftware : 3pp#ication software and &ystem &oftware4 %omputer
6an*ua*es4 &imp#e pro)#em so#(in*: 3#*orithms' .seudo code' f#ow
charts4 Examp#e pro)#ems- so#(in* a +uadratic e+uation' findin* sum of
di*its of a *i(en num)er'4
UNIT > II
Int&o'*"t!on to C Lan$*a$% &tructure of % pro*ram4 %ompi#ation
process4
1asic .ro*rammin* constructs- Identifiers' 1asic data types' Baria)#es'
%onstants' I/< functions4 <perators- Expressions' .recedence and
3ssociati(ity' Expression E(a#uation' "ype con(ersions' 1it wise operators'
&tatements' .ro*rammin* examp#es4
UNIT > III
S#"t!on Statmnt(% if @if-else' nested if' else-if ladder. 1#ock of
statements and scope4 switch statement4 )reak and goto statements4
Examp#es- student *rade decision )ased on marks o)tained' simp#e
ca#cu#ator pro*ram4
Loo- (tatmnt( @ whi#e' for' do-whi#e statements' 6oop examp#es4
<ther statements re#ated to #oopin* @ )reak' continue' *oto'
.ro*rammin* examp#es-findin* *cd of two num)ers' findin* factoria# of
*i(en num)er' *eneratin* prime num)ers etc4
UNIT - IV
Int&o'*"t!on to St&*"t*&' P&o$&amm!n$% .reprocessin* phase
.reprocessor directi(es-sym)o#ic constants' macros' conditiona#
compi#ation4 &tandard sym)o#ic constants4
F*n"t!on( /a(!"( @function header' function prototype specification'
function definition and function ca##4 3ctua#' forma# parameters and return
statement4 Examp#es-standard #i)rary functions and simp#e user defined
functions4
UNIT - V
R"*&(!on% recursion- recursi(e functions and tracin* recursi(e ca##s4
Examp#es factoria#' /i)onacci' "owers of 5anoi4 &cope and extent of
(aria)#es4&tora*e c#asses-automatic' re*ister' static and *#o)a#4
UNIT -VI
A&&a+(: %oncepts' arrays representation in %' passin* array as ar*ument
to functions4 "wo @ dimensiona# arrays-2$ array or*aniAation in memory-
row ma=or and co#umn ma=or4 1asics of mu#tidimensiona# arrays4
Examp#es pro*rams on !atrix operations4
UNIT - VII
Po!nt&(: Introduction >1asic %oncepts?' .ointers as ar*uments to
functions4 .ointers to arrays' pointer-to-pointer ' array-of-pointers4
$ynamic memory a##ocation functions' pro*rammin* app#ications4
UNIT - VIII
St&!n$(% &trin* representation ' &trin* Input / <utput functions4
&trin* manipu#ation function imp#ementation4 %ommand #ine ar*uments4
TE.T /OO0S %
14 % .ro*rammin* 0 $ata &tructures' 1434/orouAan and 24/4 7i#)er*'
"hird Edition' %en*a*e 6earnin*4
24 .ro)#em &o#(in* and .ro*ram $esi*n in %' 8424 5an#y and E414 9offman' /ifth
Edition' .earson education4
REFERENCES %
14 I5ow to &o#(e it )y %omputerJ )y 2 7 $romey
24 "he % .ro*rammin* 6an*ua*e' 14W4 9erni*han and $ennis !42itchie'
.5I/.earson Education
34 % .ro*rammin* with pro)#em so#(in*' 8434 8ones 0 94 5arrow' dreamtech
.ress
:4 .ro*rammin* in % @ &tephen 74 9ochan' III Edition' .earson Eductaion4
With effect from academic year 2012-13
12CS171CV
DATA STRUCTURES THROU,H FCG
(Common to a## /&an"h()
Instruction : 3 periods/week End Examination : 7 !arks
%redits : 3 $uration : 3 hours
&essiona# marks : 2
UNIT > I
D&!@' T+-( : &tructures @$ec#aration definition' type-definin*4
Initia#iAation' accessin* structures4 3rray of structures' passin*
structures as ar*uments to functions' pointers to structures'
nested structures' se#f referentia# structures4
Cnions and enumerated types4
UNIT - II
In-*t an' O*t-*t% .ersistent stora*e of data' streams' standard
input / output functions- character I/<' strin* I/<' formatted I/< and
)inary I/<4
<ther fi#e status and position functions-feof>>?' ferror>?' fseek>?' fte##>?'
rewind>? etc
UNIT-III
Sa&"h!n$ T"hn!H*(% Introduction to a#*orithm time and space
comp#exities4 < and notations4 &earchin* pro)#em - se+uentia# search
and )inary search and their time comp#exity4
UNIT-IV
So&t!n$ T"hn!H*(- Introduction to sortin* pro)#em se#ection sort'
)u))#e sort' insertion sort' +uick sort' mer*e sort and their time
comp#exities4
UNIT-V
Data St&*"t*&( @ Introduction to $ata &tructures' a)stract
data types' 6inear #ist @ sin*#y #inked #ist imp#ementation'
insertion' de#etion and searchin* operations on #inear #ist'
UNIT-VI
Sta"5( an' A--#!"at!on(% &tack 3$" ' operations on stack' array and
#inked representations of stacks4
&tack app#ication- infix to postfix con(ersion' postfix expression
e(a#uation' recursion imp#ementation
UNIT-VII
D**(--ueue 3$"' operations on +ueues' array and #inked
representations of +ueue4 3pp#ications of +ueue data structure4
UNIT-VIII
Int&o'*"t!on to Non-L!na& Data St&*"t*&(% Introduction to trees
and *raphs4 "heoretica# concepts of )inary trees4 "ra(ersa# techni+ues-
inorder' preorder and postorder 4

TE.T /OO0S %
14 % .ro*rammin* 0 $ata &tructures' 1434/orouAan and 24/4 7i#)er*'
"hird Edition' %en*a*e 6earnin*4
24 I$ata &tructures 3 pseudocode 3pproach with %J )y 24/47i#)er* and
1434/orouAan "homson 2
nd
edition
REFERENCES%
1?% .ro*rammin* with pro)#em so#(in*' 8434 8ones 0 94 5arrow' dreamtech .ress
2?.ro*rammin* in % @ &tephen 74 9ochan' III Edition' .earson Education4
3?$ata &tructures usin* % @ 34!4"anen)aum' Q46an*sam' and !484 3u*enstein'
.earson Education / .5I
:?I5ow to &o#(e it )y %omputerJ )y 2 7 $romey
With effect from academic year 2012-13
12CS131CV
COMPUTER PRO,RAMMIN, LA/
(Common to a## /&an"h()
.ractica# : 3 periods/week End Examination : 0 !arks
%redits : 2 $uration : 3 hours
&essiona# marks : 2
14 Write the a#*orithm and draw the f#ow chart to find the roots of a +uadratic
e+uation
24 Write the a#*orithm and draw the f#ow chart to find the sum of di*its of a
*i(en n di*it num)er
34 Write a % pro*ram to exp#ore '"!ma# ' o"ta#' hBa'"!ma#E *n(!$n'E
*n(!$n' #on$ #on$ formats of inte*ers with -&!ntA and ("anA functions4
:4 Write a % pro*ram to con(ert the *i(en temperature in %e#sius into
/ahrenheit4
4 7i(en marks of R su)=ects as input in rea# format' find whether a *i(en
student is passed or not4 3#so disp#ay his a**re*ate percenta*e and pass
cate*ory > 70 and a)o(e : distinction' R0 to 70: first di(ision' 0 to R0:
second di(ision' 3 to 0: third di(ision?4
R4 Write a simp#e ca#cu#ator pro*ram which reads o-&an'1E o-&ato& and
o-&an'2 as input and disp#ays the resu#t 4
74 Write a % pro*ram to find the sum of indi(idua# di*its of a positi(e inte*er4
S4 2ewrite the ca#cu#ator pro*ram *i(en in +uestion no R to y run the operations
unti# userHs choice is exit4
T4 Write a % pro*ram to *enerate a## the prime num)ers )etween 1 and n' where
n is a (a#ue supp#ied )y the user4
104 3 num)er is said to )e 3rmstron* if the num)er is e+ui(a#ent to the sum of
cu)es of its di*its4 Write a % pro*ram to check whether a *i(en num)er is
3rmstron* or not4
114 Write a % pro*ram to define the macros SUM(aE ))E SDUARE(a) an'
SDUARE( SUM(aE)) ) and print the resu#ts2
124 Write a % pro*ram to i##ustrate functions C!tho*t -a&amt&( an' C!tho*t
&t*&n t+-E C!tho*t -a&amt&( an' C!th &t*&n t+-E C!th
-a&amt&( an' C!tho*t &t*&n t+- and C!th -a&amt&( an' C!th
&t*&n t+-4
134 Write a % function to ca#cu#ate the sine series sum 1- B
3
I3J 1 B
7
II7J-
KKKKK and ca## the function4
1:4 Write a % pro*ram to Write a % pro*ram in which a recursi(e and non
recursi(e functions are ca##ed to compute factoria# (a#ues )ased on userHs
choice4
14 Write a % pro*ram in which a recursi(e and non recursi(e functions are ca##ed
to *enerate /i)onacci series )ased on userHs choice4
1R4 Write a % pro*ram to find the sum of the e#ements of a *i(en #ist>array?4
174 Imp#ement two separate functions which return the m!n!m*m and
maB!m*m @a#*( of a *i(en array-#ist and ca## these functions4
1S4 Write a % pro*ram to find the transpose of a *i(en input matrix>read the
dimensions of matrix too as input?4
1T4 Imp#ement two separate functions for findin* the sum and product of matrices
and ca## these functions4
204 Imp#ement a % function to exchan*e the (a#ues of *i(en two (aria)#es and ca##
the function>usin* pointers?4
214 Imp#ement two separate % functions to perform !n(&t!on oA an #mnt
and '#t!on oA an #mnt o-&at!on( on an array at a specified position>
pass the array and its siAe as pointers?4
224 Write a % pro*ram to create a dynamic #ist of rea# num)ers where the siAe of
the #ist is accepted as input' extend its siAe and re#ease it >use dynamic
memory a##ocation functions?4
234 Write a % pro*ram to accept strin* as input and find its #en*th usin* a user-
defined strin* #en*th function' re(erse the strin* and check whether the strin*
is pa#indrome or not4
2:4 Imp#ement a % function to read a mu#ti-word strin* and copy the input strin*
to other strin*>the destination strin* must )e a dynamica##y a##ocated strin*?4
24 Write a % pro*ram to i##ustrate command-#ine ar*uments4
With effect from academic year 2012-13
12CS1:1CV
DATASTRUCTURES THROU,H FCG LA/
(Common to a## /&an"h()
.ractica# : 3 periods/week End Examination : 0 !arks
%redits : 2 $uration : 3 hours
&essiona# marks : 2
14 Write a % pro*ram to create a user defined data-type Com-#B and
imp#ement addition' su)traction and mu#tip#ication operations on comp#ex
num)ers4
24 %reate a user defined data-type St*'nt containin* the fie#ds &o##NoE
nam and 'atOA/!&th>)y creatin* a user defined type Dat?4
Imp#ement % functions to read the detai#s of a student and create an array
of students4
34 Write a % pro*ram i##ustrate the user-defined data type union4
:4 Write a % pro*ram to read the content of a *i(en text fi#e and count the
num)er of characters' words and #ines in it>2ead the fi#e name as
command #ine ar*ument ?4
4 Write a % pro*ram to read the content of a *i(en text fi#e' con(ert a##
#ower case #etters into upper case and disp#ay it on the screen4
R4 Write a % pro*ram to write the record #ist of St*'nt type into a )inary
fi#e (t*'nt2'at2 2e-open the fi#e read the records from the fi#e and
disp#ay on the screen4
74 Write a % pro*ram to imp#ement se+uentia# search4
S4 Imp#ement functions recursi(e and non-recursi(e )inary search and ca##
these functions from main4
T4 Write a % pro*ram to imp#ement )u))#e sort usin* functions
104 Write a % pro*ram to imp#ement se#ection sort usin* functions
114 Write a % pro*ram to imp#ement insertion sort usin* functions
124 Write a % pro*ram to imp#ement +uick sort usin* functions
134 Write a % pro*ram to imp#ement mer*e sort usin* functions
1:4 Imp#ement 3rray #ist 3$" and a## operations on it as % functions4
14 Imp#ement &in*#e 6inked 6ist 3$" and a## operations on it as % functions4
1R4 Imp#ement &tack 3$" and a## operations on it as % functions
174 Write a % pro*ram' to con(ert an infix-expression into post-fix expression4
1S4 Write a % pro*ram' to e(a#uate post-fix expression4
1T4 Imp#ement -ueue 3$" and a## operations on it as % functions4