2-2R10(IT) syllabus

8/12/2019 2-2R10(IT) syllabus

1/35

2010-11

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

Kakinada 533 003

II !TECH! "IN#OR$ATION TECHNOLOGY%

II !T&'(! "IT% I!S&)! * II S&)!"C+))+n ,i( II !T&'(! I!S&)! "CSE%%

COURSE STRUCTURE AND SYLLAUS . 2010-11 ATCH

II Y&a/

I SE$ESTER C II SE$ESTER

S!N+! S&' C S!N+! S&'

1Managerial Economics and

Financial Analysis

4+1* 41

Data Communication 4+1* 4

2

Probability & Statistics 4+1* 4

2

Principles o Programming

!anguages

4+1* 4

"

Mat#ematical Foundations o

Computer Science and

Engineering

4+1* 4"

$b%ect $riented Programming

t#roug# a'a4+1* 4

(Digital !ogic Design 4+1* 4

(Computer $rgani)ation & Arc#itecture 4 +1*4

Electronic De'ices and

Circuits

4+1* 4

Data ase Management Systems 4+1* 4

,Data Structures 4+1* 4

,Automata -#eory & CompilerDesign

4+1* 4

.Electronic De'ices andCircuits !ab

3 2.

$b%ect $riented Programming !ab 3 2

/ Data Structures !ab 3 2 / Data ase Management Systems !ab 3 2

0Proessional

Communicational sills2 1

0Proessional Communicational sills 2 1

T+a C/&di6 27 T+a C/&di6

8T+/ia

8/12/2019 2-2R10(IT) syllabus

2/35

2010-11


!TECH! "IN#OR$ATION TECHNOLOGY%

II Y&a/ !T&'(! . I S&)

$ANAGERIAL ECONO$ICS AND #INANCIAL ANALYSIS

Uni I

In/+d'i+n + $ana9&/ia E'+n+)i'6:

In/+d'i+n + $ana9&/ia E'+n+)i'6 * D&)and Ana;6i6:Deinition o Managerial Economics

C#aracteristics and Scope 3 Managerial Economics and its relation 4it# ot#er sub%ects5 asic economic

tools in Managerial Economics

D&)and Ana;6i6: Meaning5 Demand distinctions5 Demand determinants5 !a4 o Demand and its

e6ceptions7

Uni-II

Ea6i'i; +< D&)and * D&)and #+/&'a6in9 8 Deinition 5-ypes o Elasticity o demand 5 Measurement

o price elasticity o demand8 -otal outlay met#od Point met#od and Arc met#od5 Signiicance o

Elasticity o Demand7

D&)and #+/&'a6in9:Meaning 5 Factors go'erning demand orecasting 5 Met#ods o demand orecasting

9sur'ey o buyers: ;ntentions Delp#i met#od Collecti'e opinion Analysis o -ime series and -rend

pro%ections Economic ;ndicators Controlled e6periments and udgmental approac#< 5 Forecasting demand

or ne4 products5 Criteria o a good orecasting met#od7

Uni-III

T(&+/; +< /+d'i+n and C+6 Ana;6i68 Production Function5 ;so=uants and ;socosts M>-S !a4 o

'ariable proportions5 !a4 o returns to scale5 !east Cost Combination o ;nputs Cobb5Douglas

Production unction 5 Economies o Scale7

C+6 Ana;6i6:Cost concepts $pportunity cost Fi6ed ?s ?ariable costs E6plicit costs ?s7 ;mplicit costs

$ut o pocet costs 's7 ;mputed costs75Determination o rea5E'en Point 9simple problems< 5 Manageria

Signiicance and limitations o EP7

UNIT-IV

In/+d'i+n + $a/k&6= $ana9&/ia T(&+/i&6 +< (& #i/) * /i'in9 +i'i&6: Maret structures-ypes o competition Features o Perect Competition Monopoly and Monopolistic Competition7 Price5

$utput Determination under Perect Competition Monopoly Monopolistic Competition and $ligopoly

Managerial t#eories o t#e irm5 Marris and @illiamson:s models7

/i'in9 +i'i&6: Met#ods o Pricing-Marginal Cost Pricing !imit Pricing Maret Simming Pricing

Penetration Pricing undling Pricing and Pea !oad Pricing7;nternet Pricing Models8 Flat rate pricing

sage sensiti'e pricing -ransaction based pricing Priority pricing c#arging on t#e basis o social cost

Precedence model Smart maret mec#anism model7

8/12/2019 2-2R10(IT) syllabus

3/35

Uni V

T;>&6 +< Ind6/ia O/9ani?ai+n * In/+d'i+n + 6in&66 ';'&68 C#aracteristic eatures o

;ndustrial organi)ation Features and e'aluation o Sole Proprietors#ip Partners#ip oint Stoc Company

StateBPublic Enterprises and t#eir types7In/+d'i+n + 6in&66 ';'&6:Meaning5P#ases o business cycles5 Features o business cycles7

Uni VI

In/+d'i+n + #inan'ia A''+nin9: ;ntroduction to Double5entry system ournal !edger -ria

alance5 Final Accounts 94it# simple ad%ustments/&ai+n and ana;6i6 +< #inan'ia Sa&)&n:>atio Analysis 3 !i=uidity ratios Proitability ratios

and sol'ency ratios 3 Preparation o c#anges in 4oring capital statement and und lo4 statement7

Uni VIII

Capitaland Ca>ia d9&in98 Meaning o capital budgeting eed or capital budgeting 3 Capital

budgeting decisions 9E6amples o capital budgeting< 5 Met#ods o Capital udgeting8 Paybac Met#od

Accounting >ate o >eturn 9A>>> and et Present ?alue Met#od 9simple problems>a Ra+! * ! Via;a K)a/8 Managerial Economics and Financial Analysis: CengagePublications e4 Del#i 211

R&

8/12/2019 2-2R10(IT) syllabus

4/35


II Y&a/ !T&'(! . I S&)

ROAILITY AND STATISTICS

UNIT-I

Probability8 Sample space and e'ents 3 Probability 3 -#e a6ioms o probability 3 Some Elementaryt#eorems 5 Conditional probability 3 aye:s t#eorem7

UNIT-II

>andom 'ariables 3 Discrete and continuous distributions 5 Distribution unction7

UNIT-III

inomial Poisson normal distribution 3 related properties7 Moment generating unction Moments o

standard distributions 3 properties7

UNIT-IV

Population and samples7 Sampling distribution o mean 94it# no4n and unno4n 'ariance

8/12/2019 2-2R10(IT) syllabus

5/35

27 Probability Statistics and Hueuing t#eory applications or Computer Sciences 2 ed -ri'edi o#n

@iley7

8/12/2019 2-2R10(IT) syllabus

6/35

2010-11



II Y&a/ !T&'(! . I S&)

$ATHE$ATICAL #OUNDATIONS #OR CO$UTER SCIENCE * ENGINEERING

UNIT I:$a(&)ai'a L+9i' 8

Propositional Calculus8 Statements and otations Connecti'es -rut# -ables -autologies E=ui'alence oFormulas Duality la4 -autological ;mplications ormal Forms -#eory o ;nerence or Statement

Calculus C+n6i6&n'; +< /&)i6&6= Indi/&' $&(+d +< /++

/&di'a& 'a'6:Predicati'e !ogic Statement Functions ?ariables and Huantiiers Free & ound

?ariables ;nerence t#eory or predicate calculus7

UNIT II :N)&/ T(&+/; * Ind'i+n:Properties o integers Di'ision -#eorem -#e Jreatest Common Di'isor Euclidean Algorit#m !east

Common Multiple -esting or Prime umbers -#e Fundamental -#eorem o Arit#metic Modular

Arit#metic 9 Fermat:s -#eorem and Euler s -#eoremelations8 Properties o inary >elations >elation Matri6 and Digrap# $perations on >elations Partition

and Co'ering -ransiti'e Closure E=ui'alence Compatibility and Partial $rdering >elations asseDiagrams7

#n'i+n68 i%ecti'e Functions Composition o Functions ;n'erse Functions Permutation Functions

>ecursi'e Functions

UNIT IV:G/a>( T(&+/;:

asic Concepts o Jrap#s Sub grap#s Matri6 >epresentation o Jrap#s8 Ad%acency Matrices ;ncidence

Matrices ;somorp#ic Jrap#s Pat#s and Circuits Eulerian and amiltonian Jrap#s Multigrap#s9Problems and -#eorems 4it#out proos( T(&+/; II:Planar Jrap#s Euler:s Formula Jrap# Colouring and Co'ering C#romatic umber9 Problems and

-#eorems 4it#out proosepetition o $b%ects Circular

Permutations >estricted Permutations Combinations >estricted Combinations Pigeon#ole Principle and

its Application7

inomial -#eorem=inomial and Multinomial Coeicients Jenerating Functions o Permutations and

Combinations -#e Principles o ;nclusion 3 E6clusion7

UNIT VIII: R&'//&n'& R&ai+n:

Jenerating Function o Se=uences Partial Fractions Calculating Coeicient o Jenerating Functions

>ecurrence >elations Formulation as >ecurrence >elations Sol'ing linear #omogeneous recurrence>elations by substitution generating unctions and -#e Met#od o C#aracteristic >oots7

Sol'ing ;n#omogeneous >ecurrence >elations

TET OOKS :

17 Discrete Mat#ematical Structures 4it# Applications to Computer Science -remblay Mano#ar -M

27 Discrete Mat#ematics or Computer Scientists & Mat#ematicians 2Be Mott Iandel aer P;

RE#ERENCE OOKS:

17 Discrete Mat#ematics S7Sant#a Cengage27 Discrete Mat#ematics 4it# Applications -#omas Ios#y Else'ier

"7 Discrete Mat#ematics2Be I S#arma Macmillan

8/12/2019 2-2R10(IT) syllabus

8/35

2010-11


!TECH! "CO$$ON #OR CO$UTER SCIENCE ENGINEERING AND IN#OR$ATION

TECHNOLOGY%

II Y&a/ !T&'(! . I S&)!

DIGITAL LOGIC DESIGN

Uni I : N)&/ S;6&)6

inary $ctal Decimal e6adecimal umber Systems7 Con'ersion o umbers From $ne >adi6 -o

Anot#er >adi6 r:s Complement and 9r51S5 !atc#sing AD and $> Jates -rut# -ables7 >SI- and D Flip Flops -rut# and E6citation -ables

Con'ersion o Flip Flops7 Flip Flops @it# Async#ronous ;nputs 9Preset and Clear

8/12/2019 2-2R10(IT) syllabus

9/35

Uni VIII: R&9i6&/6 and C+n&/6

Design o >egisters uer >egister Control uer >egisters idirectional S#it >egisters ni'ersalS#it >egister Design o >ipple Counters Sync#ronous Counters and ?ariable Modulus Counters >ing

Counter o#nson Counter7

TET OOKS :

17 Digital Design (Be M7Morris Mano Mic#ael D Ciletti PEA27 Fundamentals o !ogic Design Be >ot# Cengage

RE#ERENCE OOKS

17 S4itc#ing and Finite Automata -#eory"BeIo#a'i #a Cambridge7

27 Digital !ogic Design !eac# Mal'ino Sa#a-M

"7Modern Digital Electronics >7P7 ain -M

2010-11

8/12/2019 2-2R10(IT) syllabus

10/35



TECHNOLOGY%

II Y&a/ !T&'(! . I S&)!

ELECTRONIC DEVICES AND CIRCUITS

Uni-I

E&'/+n ai6i'6 and A>>i'ai+n6: Force on C#arged Particles in Electric ield Constant Electric

Field Potential >elations#ip bet4een Field ;ntensity and Potential -4o Dimensional Motion

Electrostatic Delection in Cat#ode ray -ube C>$ Force in Magnetic Field Motion in Magnetic Field

Magnetic Delection in C>- Magnetic Focusing Parallel Electric and Magnetic ields and Perpendicular

Electric and Magnetic Fields7

Uni- II

R&Bi&, +< S&)i C+nd'+/ (;6i'6 : ;nsulators Semi conductors and Metals classiication using Energy

and Diagrams Mobility and Conducti'ity Electrons and #oles in ;ntrinsic Semi conductors E6trinsic

Semi Conductor 9P and -ype semiconductor< all eect Jeneration and >ecombination o C#arges

Diusion Continuity E=uation ;n%ected Minority Carriers !a4 o unction Fermi Dirac Function Fermi

le'el in ;ntrinsic and E6trinsic Semiconductor

Uni- III

Jn'i+n Di+d& C(a/a'&/i6i'6 : $pen circuited P unction For4ard and >e'erse ias Current

components in P Diode Diode E=uation?olt5Amper C#aracteristic -emperature Dependence on ? 3 ;

c#aracteristic Step Jraded unction Diusion Capacitance and Diode >esistance 9Static and Dynamic&'ia Di+d&68 A'alanc#e and Gener rea Do4n Gener C#aracterisitics -unnel Diode C#aracteristics

4it# t#e #elp o Energy and Diagrams ?aractor Diode !ED P; Diode P#oto Diode

Uni IV

R&'i

8/12/2019 2-2R10(IT) syllabus

11/35

Uni- V

T/an6i6+/6 : unction transistor -ransistor current components -ransistor as an ampliier C#aracteristics

o -ransistor in Common ase and Common Emitter Conigurations Analytical e6pressions or -ransistor

C#aracteristics Punc# -#roug#B >eac# -#roug# P#oto -ransistor -ypical transistor %unction 'oltage

'alues7

Uni VI

#i&d Eao I> Murty I >a%a >a%es4ari PC> Pantulu Pearson 2 n

edition

***

8/12/2019 2-2R10(IT) syllabus

12/35

2010-11



TECHNOLOGY%

II Y&a/ !T&'(! . I S&)!

DATA STRUCTURES

UNIT I:R&'/6i+n and Lin&a/ S&a/'(:

Preliminaries o algorit#m Algorit#m analysis and comple6ity7

>ecursion8 Deinition Design Met#odology and ;mplementation o recursi'e algorit#ms !inear and binary

recursion recursi'e algorit#ms or actorial unction JCD computation Fibonacci se=uence -o4ers o

anoi -ail recursion

!ist Searc#es using !inear Searc# inary Searc#Fibonacci Search,

UNIT II: S+/in9 T&'(ni&6:

asic concepts Sorting by 8 insertion 9;nsertion sortepresentation o inary -rees using arrays and lined listsoperations on a inary tree inary -ree -ra'ersals 9recursi'e

8/12/2019 2-2R10(IT) syllabus

13/35

UNIT VI:AdBan'&d '+n'&>6 +< T/&&6:

-ree -ra'els using stac 9non recursi'e(6:

asic concepts >epresentations o Jrap#s8 using !ined list and ad%acency matri6 Jrap# algorit#ms

Jrap# -ra'ersals 9FS & DFS&;ntroduction to abstraction Model or an Abstract Data -ype AD- $perations AD-

Data Structure AD- ;mplementation o stac and =ueue 7

TET OOKS:

17 Data Structures 2Be >ic#ard F Jilberg Forou)an Cengage

27 Data Structures and Algorit#ms 2/J7A7?7Pai -M

RE#ERENCE OOKS:

17 Data Structure 4it# C Seymour !ipsc#ut) -M27 Classic Data Structures 2Be Debasis SamantaP;20

"7 Fundamentals o Data Structure in C 2Be oro4it)Sa#ni Anderson Freedni'ersity Prees

8/12/2019 2-2R10(IT) syllabus

14/35

2010-11



TECHNOLOGY%

II Y&a/ !T&'(! . I S&)!

ELECTRONIC DEVICES AND CIRCUITS LA

ART A : "On; - D;ACs ->;ACs

!inear and Digital ;Cs7

"7 Soldering practice 3 Simple Circuits using acti'e and passi'e components7

(7 Single layer and Multi layer PCs 9;dentiication and tilityegulated Po4er Supplies

17 Study and $peration o C>$7

ART : "#+/ La+/a+/; &@a)inai+n . $ini)) +< 10 &@>&/i)&n6%

1! #/&&n'; )&a6/)&n 6in9 Li66a+6 #i9/&6

27 P unction diode c#aracteristics A7 For4ard bias 7 >e'erse bias79 cut5in 'oltage & >esistance

calculations&6= and indin96:

-#e otion o inding -ime $b%ect !ietime and Storage Management Scope >ules ;mplementing

Scope -#e Meaning o ames 4it#in a Scope -#e inding o >eerencing En'ironments Macro

E6pansion Separate Compilation

UNIT III: S&)ani' Ana;6i6:

-#e >ole o t#e Semantic Analy)er Attribute Jrammars E'aluating Attributes Action >outines Space

Management or Attributes Decorating a Synta6 -ree

UNIT IV: C+n/+ #+,:

E6pression E'aluation Structured and nstructured Flo4 Se=uencing Selection ;teration >ecursionon determinacy

UNIT V: Daa T;>&6:

-ype Systems -ype C#ecing >ecords 9Structures< and ?ariants 9nionsecursi'e -ypes !ists Files and ;nputB $utput E=uality -esting and Assignment

UNIT VI: S/+in&6 and C+n/+ A6/a'i+n:

>e'ie4 o Stac !ayout Calling Se=uences Parameter Passing Jeneric Subroutines and Modules

E6ception andling Coroutines E'ents

C+n'//&n';: Concurrent Programming Fundamentals ;mplementing Sync#roni)ation !anguage5!e'e

Mec#anisms Message Passing

>un5time Program Management8 !ate inding o Mac#ine Code ;nspectionB;ntrospection

UNIT VII: Daa A6/a'i+n and O&' O/i&nai+n:

$b%ect5$riented Programming Encapsulation and ;n#eritance ;nitiali)ation and Finali)ation Dynamic

Met#od inding Multiple ;n#eritance

8/12/2019 2-2R10(IT) syllabus

24/35

UNIT VIII: #n'i+na Lan9a9&6:Functional Programming Concepts A >e'ie4B$'er'ie4 o Sc#eme

E'aluation $rder >e'isited ig#er5$rder Functions -#eoretical Foundations

L+9i' Lan9a9&68 !ogic Programming Concepts Prolog -#eoretical Foundations !ogic Programming in

Perspecti'e

TET OOKS:

17 Programming !anguage Pragmatics "B e Mic#ael Scott Else'ier Morgan Iaumann2027 Concepts o Programming languages Sebesta /B e PEA

RE#ERENCE OOKS:

17 Programming !anguages Design and ;mplementation (Be Pratt Gelo4it) P;

27 Programming !anguages !ouden 2 Be Cengage2""7 Fundamentals o Programming languages oro4it) Jalgotia

8/12/2019 2-2R10(IT) syllabus

25/35

2010-11



II Y&a/ !T&'(! . II S&)

OJECT ORIENTED ROGRA$$ING THROUGH JAVA

"C+))+n ,i( CSE%

UNIT I: a6i'6 +< O&' O/i&n&d /+9/a))in9 "OO%:

eed or $$ paradigm A 4ay o 'ie4ing 4orld 3 Agents responsibility messages met#ods classes andinstances class #ierarc#ies 9;n#eritancei+n (andin9 and $i(/&adin9:

Concepts o e6ception #andling beneits o e6ception #andling -ermination or presumpti'e models

e6ception #ierarc#y usage o try catc# t#ro4 t#ro4s and inally built in e6ceptions creating o4n

e6ception sub classes7 Dierences bet4een multi t#reading and multitasing t#read lie cycle creatingt#reads sync#roni)ing t#reads daemon t#reads t#read groups7

UNIT VI: A>>&6:Concepts o Applets dierences bet4een applets and applications lie cycle o an applet types o applets

creating applets passing parameters to applets7 Applet to applet communication secure applet7

UNIT VII: EB&n Hand!in9:

E'ents E'ent sources E'ent classes E'ent !isteners Delegation e'ent model #andling mouse and

eyboard e'ents Adapter classes inner classes7 -#e A@- class #ierarc#y user interace components5

labels button can'as scrollbars te6t components c#ec bo6 c#ec bo6 groups c#oices lists panels 3

8/12/2019 2-2R10(IT) syllabus

26/35

scrollpane dialogs menubar grap#ics layout manager 3 layout manager types 3 boarder grid lo4 card

and grid bag7

UNIT VIII: S,in96:

;ntroduction limitations o A@- M?C arc#itecture components containers e6ploring s4ing5 AppletFrame and Component ;cons and !abels te6t ields buttons 3 -#e utton class C#ec bo6es >adio

buttons Combo bo6es -abbed Panes Scroll Panes -rees and -ables7

TET OOKS:

17 a'a8 -#e complete reerence .Be erbert sc#ildt -M727 a'a8 o4 to Program /Be Dietal Dietal P;

RE#ERENCE OOKS:

17 !earn $b%ect $riented Programming using a'a ?enates4arlu E ? Prasad S7 C#and27 Programming in a'a2 Dr I SomaSundaram A;C$ Publis#ing #ouse

"7 $b%ect $riented Programming t#roug# a'a P7 >ad#a Iris#na ni'ersity Press7

8/12/2019 2-2R10(IT) syllabus

27/35

2010-11



II Y&a/ !T&'(! . II S&)

CO$UTER ORGANIATION AND ARCHITECTURE

UNIT I: A /i&< Hi6+/; +< C+)>&/s8

?on eumann Mac#ine Designing or perormance E'olution o ;ntel 6/, Arc#itecture computercomponents Computer unctions bus inter connection PC; Coniguration7

A! 2:complemented multiplication 9oot#:s Algorit#m< and di'ision loating point AddersB

Subtracters7

UNIT II: $a'(in& In6/'i+n 6&:Addressing Modes //, addressing Modes ;nstruction Formats Processor $rgani)ation registerorgani)ation instruction cycle

UNIT III: In6/'i+n >i>&inin98

Pipelining a)ards Dealing 4it# ranc#es //, Processor Family >educed ;nstruction Set Computers;nstruction E6ecution C#aracteristics large >egister Files >;SC Arc#itecture

UNIT IV: /+'&66+/ C+n/+ Uni:

Micro5$perations Control o t#e Processor // Arc#itecture instruction set and assembly language

programming #ard4ired ;mplementation

UNIT V: $i'/+ /+9/a) C+n/+:

Micro ;nstruction Se=uencing -a6onomy o Micro ;nstructions Micro ;nstruction E6ecution

anoprogramming7

UNIT VI: In&/na $&)+/;:

Semiconductor main memory D>AM S>AM D>AM organi)ation -ypes o >$Ms

cac#e memory principles Elements o cac#e Design Cac#e organi)ation Magnetic dis P#ysicalc#aracteristics o dis systems compact dis memory #ierarc#y concepts o partitioning paging 'irtual

memory demand paging and segmentation7

UNIT VII: In> O>8

E6ternal de'ices ;B$ modules ;B$ addressing programmed ;B$ ;nterrupt dri'en ;B$ DMA ;B$ c#annel

and processors7

UNIT VIII: a/a& /+'&66in9:

Multiple Processors Symmetric Multiprocessors Cac#e Co#erence Concepts o Multit#read andApproac#es to e6plicit multi t#reading onuniorm Memory Access Approac#es to ?ector Computation

Concepts o Multicore Computers //, Multicore $rgani)ation

8/12/2019 2-2R10(IT) syllabus

28/35

TET OOKS:

17 Computer $rgani)ation and Arc#itecture @illiam Stalling /Be P;7

RE#ERENCE OOKS:

17 Computer $rgani)ation Carl amac#er G'ono ?ranesic Sa4at Gay Be -M7

27 Computer Systems Arc#itecture and $rgani)ation o#n D7 Carpinelli PEA

"7 Computer Arc#itecture and $rgani)ation"Be o#n P7 ayes -M

8/12/2019 2-2R10(IT) syllabus

29/35

2010-11



II Y&a/ !T&'(! . II S&)

DATAASE $ANAGE$ENT SYSTE$S

"C+))+n ,i( CSE%

UNIT I : In/+d'i+n:

Data base System Applications data base System ?S ile System ?ie4 o Data Data Abstraction

nstances and Sc#emas data Models t#e E> Model

>elational Model $t#er ModelsDatabase !anguages 8 DD! DM! database Access or applicationsPrograms data base sers and Administrator -ransaction Management data base System Structure

Storage Manager t#e Huery Processor

UNIT II : Hi6+/; +< Daa a6& S;6&)68

Data base design and E> diagrams eyond E> Design Entities Attributes and Entity sets >elations#ips

and >elations#ip sets Additional eatures o E> Model Concept Design 4it# t#e E> Model ConceptuaDesign or !arge enterprises7

UNIT III : In/+d'i+n + (& R&ai+na $+d&:

;ntegrity Constraint $'er relations Enorcing ;ntegrity constraints Huerying relational data !ogical database Design ;ntroduction to ?ie4s Destroying Baltering -ables and ?ie4s7

R&ai+na A9&/a:Selection and pro%ection set operations renaming oins Di'ision E6amples o

Algebra o'er'ie4s

R&ai+na 'a'68 -uple relational Calculus

UNIT IV : #+/) +< a6i' SL &/;:

E6amples o asic SH! Hueries ;ntroduction to ested Hueries Correlated ested Hueries Set

Comparison $perators Aggregati'e $perators !! 'alues Comparison using ull 'alues !ogical

connecti'ity:s AD $> and $- ;mpact on SH! Constructs $uter oins Disallo4ing !! 'aluesComple6 ;ntegrity Constraints in SH! -riggers and Acti'e Data bases7

UNIT V : S'(&)a R&S- SEC$D -;>D ormal orms CF !ossless %oin Decomposition Dependency

preser'ing Decomposition Sc#ema reinement in Data base Design Multi 'alued Dependencies F$>-

ormal Form7

UNIT VI : T/an6a'i+n C+n'&>:

-ransaction State5 ;mplementation o Atomicity and DurabilityConcurrent E6ecutions Seriali)ability>eco'erability ;mplementation o ;solation -esting or seriali)ability Failure

classiicationStorage>eco'ery and Atomicity>eco'ery algorit#m7

UNIT VII : S+/a9& and Ind&@in9 :

8/12/2019 2-2R10(IT) syllabus

30/35

Data on E6ternal Storage File $rgani)ation and ;nde6ing Cluster ;nde6es Primary and Secondary

;nde6es ;nde6 data Structures as# ased ;nde6ing 8-ree base ;nde6ing Comparison o File

$rgani)ations ;nde6es and Perormance -uning7

UNIT VIII : T/&& S/'/&d Ind&@in9 :

;ntuitions or tree ;nde6es ;nde6ed Se=uential Access Met#ods 9;SAM$Coronel Ceneage7

8/12/2019 2-2R10(IT) syllabus

31/35

2010-11



II Y&a/ !T&'(! . II S&)

AUTO$ATA THEORY and CO$ILER DESIGN

UNIT I: #+/)a Lan9a9& and R&9a/ E@>/&66i+n6:

!anguages operations on languages regular e6pressions 9reig#tmost Deri'ations Parse -rees Ambiguity Jrammars

-op5Do4n Parsing >ecursi'e Descent Parsers8 !!9I< Parsers and !!91< Parsers7

UNIT III: ++) > >a/6in9:

>ig#tmost Parsers8 S#it >educe Parser andles andle pruning Creating !> 9< Parser S!> 91< Parser

!> 91< & !A!> 91< Parsers Parser ierarc#y Ambiguous Jrammars Qacc Programming Speciications7

UNIT IV:S;na@ Di/&'&d T/an6ai+n:

Deinitions construction o Synta6 -rees S5attributed and !5attributed grammars ;ntermediate code

generation abstract synta6 tree translation o simple statements and control lo4 statements7

UNIT V:S&)ani' Ana;6i6:

Semantic Errors C#omsy #ierarc#y o languages and recogni)ers -ype c#ecing type con'ersionse=ui'alence o type e6pressions Polymorp#ic unctions o'erloading o unctions and operators7

UNIT VI: S+/a9& O/9ani?ai+n:

Storage language ;ssues Storage Allocation Storage Allocation Strategies Scope Access to onlocalames Parameter Passing Dynamics Storage Allocation -ec#ni=ues7

UNIT VII:C+d& O>i)i?ai+n:

;ssues in t#e design o code optimi)ation Principal sources o optimi)ation optimi)ation o basic blocs!oop optimi)ation peep#ole optimi)ation lo4 grap#s Data lo4 analysis o lo4 grap#s7

UNIT VIII: C+d& G&n&/ai+n:;ssues in t#e design o code Jeneration Mac#ine Dependent Code Jeneration ob%ect code orms generic

code generation algorit#m >egister allocation and assignment DAJ representation o basic locs

Jenerating code rom DAJs7

TET OOKS:

17 ;ntroduction to Automata -#eory !anguages & Computation "Be opcrot llman PEA

8/12/2019 2-2R10(IT) syllabus

32/35

27 Compilers Principles -ec#ni=ues and -ools A#o llman >a'i Set#i PEA

RE#ERENCE OOKS:

17 Principles o Compiler Design A7?7 A#o 7 7D7llmanR PEA27 -#eory o Computer Science Automata languages and computation 2Be Mis#ra C#andra

S#earan P;

"7 Elements o Compiler Design A7Meduna Auerbac# Publications -aylor and Francis Jroup7

8/12/2019 2-2R10(IT) syllabus

33/35

2010-11



II Y&a/ !T&'(! . II S&)

OJECT ORIENTED ROGRA$$ING LA

17 se DI 17 or abo'e on any platorm e7g7 @indo4s or ni6727 Student is e6pected to complete any 1, programs7

"7 -#e Fibonacci se=uence is deined by t#e ollo4ing rule7 -#e irst 2 'alues in t#e se=uence are 1 17

E'ery subse=uent 'alue is t#e sum o t#e 2 'alues preceding it7 @rite A a'a Program 9@AP< t#atuses bot# recursi'e and non5recursi'e unctions to print t#e nth'alue o t#e Fibonacci se=uence7

(7 @AP to demonstrate 4rapper classes and to i6 t#e precision7

7 @AP t#at prompts t#e user or an integer and t#en prints out all t#e prime numbers up to t#at ;nteger7

,7 @AP t#at c#ecs 4#et#er a gi'en string is a palindrome or not7 E68 MA!AQA!AM is a palindrome7.7 @AP or sorting a gi'en list o names in ascending order7

/7 @AP to c#ec t#e compatibility or multiplication i compatible multiply t4o matrices and ind its

transpose707 @AP t#at illustrates #o4 runtime polymorp#ism is ac#ie'ed7

17 @AP to create and demonstrate pacages7

117 @AP using StringTokenizerclass 4#ic# reads a line o integers and t#en displays eac# integer andt#e sum o all integers7

127 @AP t#at reads on ile name rom t#e user t#en displays inormation about 4#et#er t#e ile e6ists

4#et#er t#e ile is readableB4ritable t#e type o ile and t#e lengt# o t#e ile in bytes and display t#e

content o t#e usingFileInutStreamclass7

1"7 @AP t#at displays t#e number o c#aracters lines and 4ords in a te6tBte6t ile71(7 @rite an Applet t#at displays t#e content o a ile7

17 @AP t#at 4ors as a simple calculator7 se a grid layout to arrange buttons or t#e digits and or t#e +5 6 B operations7 Add a te6t ield to display t#e result7

1,7 @AP or #andling mouse e'ents7

1.7 @AP demonstrating t#e lie cycle o a t#read71/7 @AP t#at correctly implements Producer5Consumer problem using t#e concept o ;nter -#read

Communication7

107 @AP t#at lets users create Pie c#arts7 Design your o4n user interace 94it# S4ings & A@-

8/12/2019 2-2R10(IT) syllabus

34/35

27 @AP t#at creates " t#reads by e6tending -#read class7 First t#read displays UJood MorningV e'ery 1

sec t#e second t#read displays UelloV e'ery 2 seconds and t#e t#ird displays U@elcomeV e'ery "

seconds7 9>epeat t#e same by implementing >unnableodent Mouse Jerbil amster etc7 ;n t#e base class pro'ide

met#ods t#at are common to all >odents and o'erride t#ese in t#e deri'ed classes to perorm dierent

be#a'iors depending on t#e speciic type o >odent7 Create an array o >odent ill it 4it# dierentspeciic types o >odents and call your base class met#ods7

8/12/2019 2-2R10(IT) syllabus

35/35

2010-11



II Y&a/ !T&'(! . II S&)

DATA ASE $ANAGE$ENT SYSTE$S LA

17 E6ecute a single line and group unctions or a table727 E6ecute DC! and -C! Commands7

"7 Create and manipulate 'arious D ob%ects or a table7

(7 Create 'ie4s partitions and locs or a particular D7

7 @rite P!BSH! procedure or an application using e6ception #andling7,7 @rite P!BSH! procedure or an application using cursors7

.7 @rite a DMS program to prepare reports or an application using unctions7

/7 @rite a P!BSH! bloc or transaction operations o a typical application using triggers707 @rite a P!BSH! bloc or transaction operations o a typical application using pacage7

17 Design and de'elop an application using any ront end and bac end tool 9mae use o E> diagram

and DFD

2-2R10(IT) syllabus

Documents