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 0 C II SE$ESTER 0 C S!N+! S123&'- 0 C S!N+! S123&'- 0 C 1 Managerial Economics and Financial Analysis 4+1* 4 1 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'a 4+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 & Compiler Design 4+1* 4 . Electronic De'ices and Circuits !ab 3 2 . $b%ect $riented Programming !ab 3 2 / Data Structures !ab 3 2 / Data +ase Management Systems !ab 3 2 0 Proessional Communicational s1ills 2 1 0 Proessional Communicational s1ills 2 1 T+-a5 C/&di-6 27 T+-a5 C/&di-6 27 8T1-+/ia5
2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . I S&) $ANAGERIAL ECONO$ICS AND #INANCIAL ANALYSIS Uni- I In-/+d1'-i+n -+ $ana9&/ia5 E'+n+)i'6: In-/+d1'-i+n -+ $ana9&/ia5 E'+n+)i'6 * D&)and Ana5;6i6: Deinition o Managerial Economics2 C#aracteristics and Scope 3 Managerial Economics and its relation 4it# ot#er sub%ects5 +asic economic tools in Managerial Economics D&)and Ana5;6i6: Meaning5 Demand distinctions5 Demand determinants5 !a4 o Demand and its e6ceptions7 Uni--II E5a6-i'i-; +< D&)and * D&)and #+/&'a6-in98 Deinition 5-ypes o Elasticity o demand 5 Measurement o price elasticity o demand8 -otal outlay met#od2 Point met#od and Arc met#od5 Signiicance o Elasticity o Demand7 D&)and #+/&'a6-in9: Meaning 5 Factors go'erning demand orecasting 5 Met#ods o demand orecasting 9sur'ey o buyers: ;ntentions2 Delp#i met#od2 Collecti'e opinion2 Analysis o -ime series and -rend pro%ections2 Economic ;ndicators2 Controlled e6periments and &udgmental approac#< 5 Forecasting demand or ne4 products5 Criteria o a good orecasting met#od7 Uni--III T(&+/; +< 0/+d1'-i+n and C+6- Ana5;6i68 Production Function5 ;so=uants and ;socosts2 M>-S2 !a4 o 'ariable proportions5 !a4 o returns to scale5 !east Cost Combination o ;nputs2 Cobb5Douglas Production unction 5 Economies o Scale7 C+6- Ana5;6i6: Cost concepts2 $pportunity cost2 Fi6ed ?s ?ariable costs2 E6plicit costs ?s7 ;mplicit costs2 $ut o poc1et costs 's7 ;mputed costs75Determination o +rea15E'en Point 9simple problems< 5 Managerial Signiicance and limitations o +EP7 UNIT-IV In-/+d1'-i+n -+ $a/k&-6= $ana9&/ia5 T(&+/i&6 +< -(& #i/) * 0/i'in9 0+5i'i&6: Mar1et structures: -ypes o competition2 Features o Perect Competition2 Monopoly and Monopolistic Competition7 Price5 $utput Determination under Perect Competition2 Monopoly2 Monopolistic Competition and $ligopoly Managerial t#eories o t#e irm 5 Marris and @illiamson:s models7 0/i'in9 0+5i'i&6: Met#ods o Pricing-Marginal Cost Pricing2 !imit Pricing2 Mar1et S1imming Pricing2 Penetration Pricing2 +undling Pricing2 and Pea1 !oad Pricing7 ;nternet Pricing Models8 Flat rate pricing2 Asage sensiti'e pricing2 -ransaction based pricing2 Priority pricing2 c#arging on t#e basis o social cost2 Precedence model2 Smart mar1et mec#anism model7 Uni- V T;>&6 +< Ind16-/ia5 O/9ani?a-i+n * In-/+d1'-i+n -+ 216in&66 ';'5&68 C#aracteristic eatures o ;ndustrial organi)ation2 Features and e'aluation o Sole Proprietors#ip2 Partners#ip2 &oint Stoc1 Company2 StateBPublic Enterprises and t#eir types7 In-/+d1'-i+n -+ 216in&66 ';'5&6: Meaning5P#ases o business cycles5 Features o business cycles7 Uni- VI In-/+d1'-i+n -+ #inan'ia5 A''+1n-in9: ;ntroduction to Double5entry system2 &ournal2 !edger2 -rial +alance5 Final Accounts 94it# simple ad%ustments<5 !imitations o Financial Statements7 Uni- VII In-&/>/&-a-i+n and ana5;6i6 +< #inan'ia5 S-a-&)&n-: >atio Analysis 3 !i=uidity ratios2 Proitability ratios and sol'ency ratios 3 Preparation o c#anges in 4or1ing capital statement and und lo4 statement7 Uni- VIII Capital and Ca>i-a5 1d9&-in98 Meaning o capital budgeting2 Ceed or capital budgeting 3 Capital budgeting decisions 9E6amples o capital budgeting< 5 Met#ods o Capital +udgeting8 Paybac1 Met#od2 Accounting >ate o >eturn 9A>><2 ;>> and Cet Present ?alue Met#od 9simple problems< T&@- ++k6: 17 J!V!0/a2(aka/ Ra+8 Managerial Economics and Financial Analysis2 Marut#i Publications2 2D11 27 N! A>>a Ra+! * 0! Vi3a;a K1)a/8 EManagerial Economics and Financial Analysis:2 Cengage Publications2 Ce4 Del#i2 2D11 R&<&/&n'&6: 17 A > Aryasri - Managerial Economics and Financial Analysis2 -MF 2D11 27 Suma damodaran5 Managerial Economics2 $6ord 2D11 "7 S7A7 Siddi=ui & A7S7 Siddi=ui2 Mangerial Economice and Financial Analysis2 Ce4 Age ;nternational Publis#ers2 2D117 *** 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . I S&) 0ROAILITY AND STATISTICS UNIT-I Probability8 Sample space and e'ents 3 Probability 3 -#e a6ioms o probability 3 Some Elementary t#eorems 5 Conditional probability 3 +aye:s t#eorem7 UNIT-II >andom 'ariables 3 Discrete and continuous distributions 5 Distribution unction7 UNIT-III +inomial2 Poisson2 normal distribution 3 related properties7 Moment generating unction2 Moments o standard distributions 3 properties7 UNIT-IV Population and samples7 Sampling distribution o mean 94it# 1no4n and un1no4n 'ariance<2 proportion2 'ariances7 5 Sampling distribution o sums and dierences7 Point and inter'al estimators or means2 'ariances2 proportions7 UNIT-V Statistical Fypot#esis 3 Errors o -ype ; and -ype ;; errors and calculation7 $ne tail2 t4o5tail tests7 -esting #ypot#esis concerning means2 proportions and t#eir dierences using G5test7 UNIT-VI -ests o #ypot#esis using Student:s t5test2 F5test and 2 test77 -est o independence o attributes 5 AC$?A or one54ay and t4o54ay classiied data7 UNIT-VII Statistical Huality Control met#ods 3 Met#ods or preparing control c#arts 3 Problems using 65bar2 p2 > c#arts and attribute c#arts 3 Simple Correlation and >egression7 UNIT-VIII Hueuing -#eory8 Pure +irt# and Deat# Process MBMB1 Model and Simple Problems7 TEAT OOK 17 Probability and Statistics or Engineers2 Miller and &o#n E7 Freund2 Prentice Fall o ;ndia7 27 Probability and Statistics2 D7 I7 Murugeson & P7 Juru S4amy2 Anurad#a Publis#ers7 RE#ERENCE 17 Probability2 Statistics and >andom processes7 -7 ?eerra%an2 -ata Mc7Jra4 Fill2 ;ndia7 27 Probability2 Statistics and Hueuing t#eory applications or Computer Sciences 2 ed2 -ri'edi2 &o#n @iley7 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . I S&) $ATHE$ATICAL #OUNDATIONS #OR CO$0UTER SCIENCE * ENGINEERING UNIT I:$a-(&)a-i'a5 L+9i' 8 Propositional Calculus8 Statements and Cotations2 Connecti'es2 -rut# -ables2 -autologies2 E=ui'alence o Formulas2 Duality la42 -autological ;mplications2 Cormal Forms2 -#eory o ;nerence or Statement Calculus2 C+n6i6-&n'; +< 0/&)i6&6= Indi/&'- $&-(+d +< 0/++<! 0/&di'a-& 'a5'1516: Predicati'e !ogic2 Statement Functions2 ?ariables and Huantiiers2 Free & +ound ?ariables2 ;nerence t#eory or predicate calculus7
UNIT II :N1)2&/ T(&+/; * Ind1'-i+n: Properties o integers2 Di'ision -#eorem2 -#e Jreatest Common Di'isor2 Euclidean Algorit#m2 !east Common Multiple2 -esting or Prime Cumbers2 -#e Fundamental -#eorem o Arit#metic2 Modular Arit#metic 9 Fermat:s -#eorem and Euler Es -#eorem< $a-(&)a-i'a5 Ind1'-i+n: 0/in'i>5& +< $a-(&)a-i'a5 Ind1'-i+n= &@&/'i6&6 UNIT III:S&- T(&+/;: ;ntroduction2 $perations on +inary Sets2 Principle o ;nclusion and E6clusion >elations8 Properties o +inary >elations2 >elation Matri6 and Digrap#2 $perations on >elations2 Partition and Co'ering2 -ransiti'e Closure2 E=ui'alence2 Compatibility and Partial $rdering >elations2 Fasse Diagrams7 #1n'-i+n68 +i%ecti'e Functions2 Composition o Functions2 ;n'erse Functions2 Permutation Functions2 >ecursi'e Functions UNIT IV:G/a>( T(&+/;: +asic Concepts o Jrap#s2 Sub grap#s2 Matri6 >epresentation o Jrap#s8 Ad%acency Matrices2 ;ncidence Matrices2 ;somorp#ic Jrap#s2 Pat#s and Circuits2 Eulerian and Familtonian Jrap#s2 Multigrap#s2 9Problems and -#eorems 4it#out proos< UNIT V:G/a>( T(&+/; II: Planar Jrap#s2 Euler:s Formula2 Jrap# Colouring and Co'ering2 C#romatic Cumber29 Problems and -#eorems 4it#out proos< -rees2 Directed trees2 +inary -rees2 Decision -rees2 Spanning -rees8 Properties2 Algorit#ms or Spanning trees and Minimum Spanning -ree7 UNIT VI: A59&2/ai' S-/1'-1/&6: La--i'&: Properties2 !attices as Algebraic Systems2 Algebraic Systems 4it# one +inary $peration2 Properties o +inary operations2 Semi groups and Monoids8 Fomomorp#ism o Semi groups and Monoids2 Jroups8 Abelian Jroup2 Cosets2 Subgroups 9 Deinitions and E6amples o all Structures< Algebraic Systems 4it# t4o +inary $perations8 >ings UNIT VII: C+)2ina-+/i'6: +asic o Counting2 Permutations2 Derangements2 Permutations 4it# >epetition o $b%ects2 Circular Permutations2 >estricted Permutations2 Combinations2 >estricted Combinations2 Pigeon#ole Principle and its Application7 +inomial -#eorem= +inomial and Multinomial Coeicients2 Jenerating Functions o Permutations and Combinations2 -#e Principles o ;nclusion 3 E6clusion7 UNIT VIII: R&'1//&n'& R&5a-i+n: Jenerating Function o Se=uences2 Partial Fractions2 Calculating Coeicient o Jenerating Functions >ecurrence >elations2 Formulation as >ecurrence >elations2 Sol'ing linear #omogeneous recurrence >elations by substitution2 generating unctions and -#e Met#od o C#aracteristic >oots7 Sol'ing ;n#omogeneous >ecurrence >elations TEAT OOKS : 17 Discrete Mat#ematical Structures 4it# Applications to Computer Science2 -remblay2 Mano#ar2 -MF 27 Discrete Mat#ematics or Computer Scientists & Mat#ematicians2 2Be2 Mott2 Iandel2 +a1er2 PF; RE#ERENCE OOKS: 17 Discrete Mat#ematics2 S7Sant#a2 Cengage 27 Discrete Mat#ematics 4it# Applications2 -#omas Ios#y2 Else'ier "7 Discrete Mat#ematics22Be2 &I S#arma 2Macmillan 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "CO$$ON #OR CO$0UTER SCIENCE ENGINEERING AND IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . I S&)! DIGITAL LOGIC DESIGN Uni- I : N1)2&/ S;6-&)6 +inary2 $ctal2 Decimal2 Fe6adecimal Cumber Systems7 Con'ersion o Cumbers From $ne >adi6 -o Anot#er >adi6 2 r:s Complement and 9r51<:s Complement Subtraction o Ansigned Cumbers2 Problems2 Signed +inary Cumbers2 @eig#ted and Con 4eig#ted codes Uni- II:L+9i' Ga-&6 And ++5&an A59&2/a +asic Jates C$-2 ACD2 $>2 +oolean -#eorms2Complement And Dual o !ogical E6pressions2 Ani'ersal Jates2 E65$r and E65Cor Jates2 S$P2P$S2 Minimi)ations o !ogic Functions Asing +oolean -#eorems2 -4o le'el >eali)ation o !ogic Functions Asing Ani'ersal Jates7 ?erilog programming or t#e minimi)ed logic unctions7 Uni- III: Ga-&- L&B&5 $ini)i?a-i+n Iarnaug# Map Met#od9I5Map<8 Minimi)ation o +oolean Functions ma6imum upto Four ?ariables 2 P$S And S$P2 Simpliications @it# Don:t Care Conditions Asing I5Map7 Uni- IV: C+)2ina-i+na5 A/i-()&-i' L+9i' Ci/'1i-6 Design o Fal Adder2 Full Adder2 Fal Subtractor 2 Full Subtractor2 >ipple Adders and Subtractors2 >ipple AdderBSubtractor Asing $nes and -4os Complement Met#od7 Serial Adder 2 Carry !oo1 A#ead Adder7 Uni- V: C+)2ina-i+na5 L+9i' Ci/'1i-6 Design o Decoders2 Encoders2 Multiple6ers2 Demultiple6ers2 Fig#er $rder Demultiple6ers and Multiple6ers2 >eali)ation o +oolean Functions Asing Decoders and Multiple6ers2 Priority Encoder2 Code Con'erters2 Magnitude Comparator7 Uni- VI: In-/+d1'-i+n -+ 0/+9/a))a25& L+9i' D&Bi'&s 9P!$s< P!A2 PA!2 P>$M7 >eali)ation o S4itc#ing Functions Asing P>$M2 PA! and P!A7 Comparison o P!A2 PA! and P>$M77 Uni- VII: In-/+d1'-i+n -+ S&C1&n-ia5 L+9i' Ci/'1i-6 Classiication o Se=uential Circuits2 +asic Se=uential !ogic Circuits8 !atc# and Flip5Flop2 >S5 !atc# Asing CACD and C$> Jates2 -rut# -ables7 >S2&I2- and D Flip Flops 2 -rut# and E6citation -ables2 Con'ersion o Flip Flops7 Flip Flops @it# Async#ronous ;nputs 9Preset and Clear<7 Uni- VIII: R&9i6-&/6 and C+1n-&/6 Design o >egisters2 +uer >egister2 Control +uer >egisters2 +idirectional S#it >egisters2 Ani'ersal S#it >egister2 Design o >ipple Counters2 Sync#ronous Counters and ?ariable Modulus Counters2 >ing Counter2 &o#nson Counter7 TEAT OOKS : 17 Digital Design 2(Be2 M7Morris Mano2 Mic#ael D Ciletti2 PEA 27 Fundamentals o !ogic Design2 *Be2 >ot#2 Cengage RE#ERENCE OOKS 17 S4itc#ing and Finite Automata -#eory2"Be2Io#a'i2 &#a2 Cambridge7 27 Digital !ogic Design2 !eac#2 Mal'ino2 Sa#a2-MF "7Modern Digital Electronics2 >7P7 &ain2 -MF 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "CO$$ON #OR CO$0UTER SCIENCE ENGINEERING AND IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . I S&)! ELECTRONIC DEVICES AND CIRCUITS Uni--I E5&'-/+n a55i6-i'6 and A>>5i'a-i+n6: Force on C#arged Particles in Electric ield2 Constant Electric Field2 Potential2 >elations#ip bet4een Field ;ntensity and Potential2 -4o Dimensional Motion2 Electrostatic Delection in Cat#ode ray -ube2 C>$2 Force in Magnetic Field2 Motion in Magnetic Field2 Magnetic Delection in C>-2 Magnetic Focusing2 Parallel Electric and Magnetic ields and Perpendicular Electric and Magnetic Fields7 Uni-- II R&Bi&, +< S&)i C+nd1'-+/ 0(;6i'6 : ;nsulators2 Semi conductors2 and Metals classiication using Energy +and Diagrams2 Mobility and Conducti'ity2 Electrons and #oles in ;ntrinsic Semi conductors2 E6trinsic Semi Conductor2 9P and C -ype semiconductor< Fall eect2 Jeneration and >ecombination o C#arges2 Diusion2 Continuity E=uation2 ;n%ected Minority Carriers2 !a4 o &unction2 Fermi Dirac Function2 Fermi le'el in ;ntrinsic and E6trinsic Semiconductor Uni-- III J1n'-i+n Di+d& C(a/a'-&/i6-i'6 : $pen circuited P C &unction2 For4ard and >e'erse +ias2 Current components in PC Diode2 Diode E=uation2?olt5Amper C#aracteristic2 -emperature Dependence on ? 3 ; c#aracteristic2 Step Jraded &unction2 Diusion Capacitance and Diode >esistance 9Static and Dynamic<2 Energy +and Diagram o PC Diode2 S>&'ia5 Di+d&68 A'alanc#e and Gener +rea1 Do4n2 Gener C#aracterisitics2 -unnel Diode2 C#aracteristics 4it# t#e #elp o Energy +and Diagrams2 ?aractor Diode2 !ED2 P;C Diode2 P#oto Diode Uni- IV R&'-i<i&/6 and #i5-&/6: Fal 4a'e rectiier2 ripple actor2 ull 4a'e rectiier94it# and 4it#out transormer<2 Farmonic components in a rectiier circuit2 ;nductor ilter2 Capacitor ilter2 !5 section ilter2 5 section ilter2 Multiple !5 section and Multiple section ilter2 and comparison o 'arious ilter circuits in terms o ripple actors2 Simple circuit o a regulator using )ener diode2 Series and S#unt 'oltage regulators Uni-- V T/an6i6-+/6 : &unction transistor2 -ransistor current components2 -ransistor as an ampliier2 C#aracteristics o -ransistor in Common +ase and Common Emitter Conigurations2 Analytical e6pressions or -ransistor C#aracteristics2 Punc# -#roug#B >eac# -#roug#2 P#oto -ransistor2 -ypical transistor %unction 'oltage 'alues7 Uni- VI #i&5d E<<&'- T/an6i6-+/6: &FE- c#aracteristics 9Hualitati'e and Huantitati'e discussion<2 Small signal model o &FE-2 M$SFE- c#aracteristics 9En#ancement and depletion mode<2 Symbols o M$SFE-2 ;ntroduction to SC> and A&- and t#eir c#aracteristics2 UNIT-VII T/an6i6-+/ ia6in9 and T(&/)a5 S-a2i5i?a-i+n : -ransistor +iasing and -#ermal Stabili)ation8 $perating point2 +asic Stability2 Collector to +ase +ias2 Sel +ias Ampliiers2 Stabili)ation against 'ariations in ? +E 22 and K or t#e sel bias circuit2 Stabili)ation actors2 9S2 S L 2 S L: <2 +ias Compensation2 -#ermistor and Sensitor compensation2 Compensation against 'ariation in ? +E 2 ; co 22 -#ermal runa4ay2 -#ermal stability UNIT- VIII S)a55 6i9na5 5+, </&C1&n'; T/an6i6-+/ )+d&56: -4o port de'ices and t#e Fybrid model2 -ransistor Fybrid model2 Determination o #5parameters rom c#aracteristics2 Measurement o #5parameters2 Con'ersion ormulas or t#e parameters o t#ree transistor conigurations2 Analysis o a -ransistor Ampliier circuit using #5 parameters2 Comparison o -ransistor Ampliier conigurations T&@- ++k6 17 Electronic De'ices and Circuits 3 &7 Millman2 C7C7 Fal1ias2 -ata Mc5Jra4 Fill R&<&/&n'& 17 Electronic De'ices and Circuits 3 I Satya Prasad2 ?JS +oo1 !in1s 27 ;ntegrated Electronics 3 &acob Millman2 C#ritos C7 Fal1ies22 -ata Mc5Jra4 Fill2 2DD0 "7 Electronic De'ices and Circuits 3 Sali'a#anan2 Iumar2 ?alla'ara%2 -A-A McJra4 Fill2 Second Edition (7 Electronic De'ices and Circuits 3 >7!7 +oylestad and !ouis Cas#els1y2 PearsonBPrentice Fall20t#Edition22DD, *7 Electronic De'ices and Circuits 5+? >ao2 I+> Murty2 I >a%a >a%es4ari2 PC> Pantulu2 Pearson2 2 nd edition *** 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "CO$$ON #OR CO$0UTER SCIENCE ENGINEERING AND IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . I S&)! DATA STRUCTURES UNIT I: R&'1/6i+n and Lin&a/ S&a/'(: Preliminaries o algorit#m2 Algorit#m analysis and comple6ity7 >ecursion8 Deinition2 Design Met#odology and ;mplementation o recursi'e algorit#ms2 !inear and binary recursion2 recursi'e algorit#ms or actorial unction2 JCD computation2 Fibonacci se=uence2 -o4ers o Fanoi2 -ail recursion !ist Searc#es using !inear Searc#2 +inary Searc#2 Fibonacci Search,
UNIT II: S+/-in9 T&'(niC1&6: +asic concepts2 Sorting by 8 insertion 9;nsertion sort<2 selection 9#eap sort<2 e6c#ange 9bubble sort2 =uic1 sort<2 distribution 9radi6 sort < and merging 9merge sort < Algorithms. UNIT III: S-a'k6 and D1&1&6: +asic Stac1 $perations2 >epresentation o a Stac1 using Arrays2 Stac1 Applications8 >e'ersing list2 Factorial Calculation2 ;n5i65 to posti6 -ransormation2 E'aluating Arit#metic E6pressions7 D1&1&6: +asic Hueues $perations2 >epresentation o a Hueue using array2 ;mplementation o Hueue $perations using Stac12 Applications o Hueues5>ound robin Algorit#m2 En=ueue2 De=ueue2 Circular Hueues2 Priority Hueues7 UNIT IV: Link&d Li6-6: ;ntroduction2 single lin1ed list2 representation o a lin1ed list in memory2 $perations on a single lin1ed list2 merging t4o single lin1ed lists into one list2 >e'ersing a single lin1ed list2 applications o single lin1ed list to represent polynomial e6pressions and sparse matri6 manipulation2 Ad'antages and disad'antages o single lin1ed list2 Circular lin1ed list2 Double lin1ed list UNIT V: T/&&6: +asic tree concepts2 +inary -rees8 Properties2 >epresentation o +inary -rees using arrays and lin1ed lists2 operations on a +inary tree 2 +inary -ree -ra'ersals 9recursi'e<2 Creation o binary tree rom in5order and pre9post<order tra'ersals2 UNIT VI: AdBan'&d '+n'&>-6 +< T/&&6: -ree -ra'els using stac1 9non recursi'e<2 -#readed +inary -rees7 +inary searc# tree2 +asic concepts2 +S- operations8 insertion2 deletion2 +alanced binary trees 3 need2 basics and applications in computer science 9Co operations < UNIT VII: G/a>(6: +asic concepts2 >epresentations o Jrap#s8 using !in1ed list and ad%acency matri62 Jrap# algorit#ms Jrap# -ra'ersals 9+FS & DFS<2 applications8 Di%1stra:s s#ortest pat#2 -ransiti'e closure2 Minimum Spanning -ree using Prim:s Algorit#m2 4ars#all:s Algorit#m7 Uni- VIII: S&-6: Deinition2 >epresentation o Sets using !in1ed list2 operations o sets using lin1ed lists2 application o sets5 ;normation storage using bit strings A26-/a'- Da-a T;>& ;ntroduction to abstraction2 Model or an Abstract Data -ype2 AD- $perations2 AD- Data Structure2 AD- ;mplementation o stac1 and =ueue 7 TEAT OOKS: 17 Data Structures2 2Be2 >ic#ard F2 Jilberg 2 Forou)an2 Cengage 27 Data Structures and Algorit#ms2 2DD/2J7A7?7Pai2 -MF RE#ERENCE OOKS: 17 Data Structure 4it# C2 Seymour !ipsc#ut)2 -MF 27 Classic Data Structures2 2Be2 Debasis 2Samanta2PF;22DD0 "7 Fundamentals o Data Structure in C2 2Be2 Foro4it)2Sa#ni2 Anderson Freed2Ani'ersity Prees
2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "CO$$ON #OR CO$0UTER SCIENCE ENGINEERING AND IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . I S&)! ELECTRONIC DEVICES AND CIRCUITS LA 0ART A : "On5; <+/ BiBa B+'& E@a)ina-i+n% ELECTRONIC WORKSHOP PRACTICE ( in 6 lab sessions) : 17 ;dentiication2 Speciications2 -esting o >2 !2 C Components 9Colour Codes<2 Potentiometers2 S4itc#es 9SPD-2 DPD-2 and D;P<2 Coils2 Jang Condensers2 >elays2 +read +oards7 27 ;dentiication2 Speciications and -esting o Acti'e De'ices2 Diodes2 +&-s2 !o4po4er &FE-s2 M$SFE-s2 Po4er -ransistors2 !EDs2 !CDs2 $ptoelectronic De'ices2 SC>2 A&-2 D;ACs2 ->;ACs2 !inear and Digital ;Cs7 "7 Soldering practice 3 Simple Circuits using acti'e and passi'e components7 (7 Single layer and Multi layer PC+s 9;dentiication and Atility<7 *7 Study and operation o M Multimeters 9Analog and Digital< M Function Jenerator M >egulated Po4er Supplies 17 Study and $peration o C>$7 0ART : "#+/ La2+/a-+/; &@a)ina-i+n . $ini)1) +< 10 &@>&/i)&n-6% 1! #/&C1&n'; )&a61/)&n- 16in9 Li66a3+16 #i91/&6 27 PC &unction diode c#aracteristics A7 For4ard bias +7 >e'erse bias79 cut5in 'oltage & >esistance calculations< "7 Gener diode c#aracteristics and Gener as a regulator (7 -ransistor C+ c#aracteristics 9;nput and $utput< & # Parameter calculations *7 -ransistor CE c#aracteristics 9;nput and $utput< & # Parameter calculations ,7 >ectiier 4it#out ilters 9Full 4a'e & Fal 4a'e< .7 >ectiier 4it# ilters 9Full 4a'e & Fal 4a'e< /7 FE- c#aracteristics 07 SC> C#arecteristics 1D7 A&- C#arectristics 117 CE Ampliier 127 CC Ampliier 9Emitter Follo4er<7 0ART C: EC1i>)&n- /&C1i/&d <+/ La2+/a-+/i&6: 17 >egulated Po4er supplies 9>PS< 5 D5"D' 27 C>$s 5 D52DM F)7 "7 Function Jenerators 5 D51 M F)7 (7 Multimeters *7 Decade >esitance +o6esB>#eostats ,7 Decade Capacitance +o6es .7 Micro Ammeters 9Analog or Digital< 5 D52D NA2 D5*DNA2 D51DDNA2 D5 2DDNA /7 ?oltmeters 9Analog or Digital< 5 D5*D?2 D51DD?2 D52*D? 07 Electronic Components 5 >esistors2 Capacitors2 +&-s2 !CDs2 SC>s2 A&-s2 FE-s2 !EDs2 M$SFE-s2diodes2transistors *** 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . I S&) DATA STRUCTURES LA E@&/'i6& 1: @rite recursi'e programme 4#ic# computes t#e n t# Fibonacci number2 or appropriate 'alues o n7 Analy)e be#a'ior o t#e programme $btain t#e re=uency count o t#e statement or 'arious 'alues o n7 E@&/'i6& 2: @rite recursi'e programme or t#e ollo4ing a< @rite recursi'e C programe or calculation o Factorial o an integer b< @rite recursi'e C programe or calculation o JCD 9n2 m< c< @rite recursi'e C programe or -o4ers o Fanoi 8 C dis1s are to be transerred rom peg S to peg D 4it# Peg ; as t#e intermediate peg7 E@&/'i6& 3: a< @rite C programs t#at use bot# recursi'e and non recursi'e unctions to perorm !inear searc# or a Iey 'alue in a gi'en list7 b< @rite C programs t#at use bot# recursi'e and non recursi'e unctions to perorm +inary searc# or a Iey 'alue in a gi'en list7 c< @rite C programs t#at use bot# recursi'e and non recursi'e unctions to perorm Fibonacci searc# or a Iey 'alue in a gi'en list7 E@&/'i6& 4: a< @rite C programs t#at implement +ubble sort2 to sort a gi'en list o integers in ascending order b< @rite C programs t#at implement Huic1 sort2 to sort a gi'en list o integers in ascending order c< @rite C programs t#at implement ;nsertion sort2to sort a gi'en list o integers in ascending order E@&/'i6& 5: @rite C programs t#at implement #eap sort2 to sort a gi'en list o integers in ascending order d< @rite C programs t#at implement radi6 sort2 to sort a gi'en list o integers in ascending order e< @rite C programs t#at implement merge sort2 to sort a gi'en list o integers in ascending order E@&/'i6& E: a< @rite C programs t#at implement stac1 9its operations< using arrays b< @rite C programs t#at implement stac1 9its operations< using !in1ed list E@&/'i6& F: a< @rite a C program t#at uses Stac1 operations to Con'ert ini6 e6pression into posti6 e6pression a< @rite C programs t#at implement Hueue 9its operations< using arrays7 b< @rite C programs t#at implement Hueue 9its operations< using lin1ed lists E@&/'i6& G: a< @rite a C program t#at uses unctions to create a singly lin1ed list b< @rite a C program t#at uses unctions to perorm insertion operation on a singly lin1ed list c< @rite a C program t#at uses unctions to perorm deletion operation on a singly lin1ed list E@&/'i6& 7:
d< Adding t4o large integers 4#ic# are represented in lin1ed list as#ion7 e< @rite a C programme to re'erse elements o a single lin1ed list7 < @rite a C programme to store a polynomial e6pression in memory using lin1ed list g< @rite a C programme to representation t#e gi'en Sparse matri6 using arrays7 #< @rite a C programme to representation t#e gi'en Sparse matri6 using lin1ed list E@&/'i6&108 a< @rite a C program to Create a +inary -ree o integers b< @rite a recursi'e C program2 or -ra'ersing a binary tree in preorder2 inorder and postorder7 c< @rite a non recursi'e C program2 or -ra'ersing a binary tree in preorder2 inorder and postorder7 d< Program to c#ec1 balance property o a tree7 E@&/'i6& 11: a< @rite a C program to Create a +S- b< @rite a C programme to insert a note into a +S-7 c< @rite a C programme to delete a note rom a +S-7 E@&/'i6& 12: a< @rite a C programme to compute t#e s#ortest pat# o a grap# using Di%1stra:s algorit#m b< @rite a C programme to ind t#e minimum spanning tree using @ars#all:s Algorit#m 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ .I S&)! "C+))+n -+ A55 /an'(&6% ENGLISH CO$$UNICATION 0RACTICE LI#E= LANGUAGE AND CULTURE EA0LORATIONS-I LI#E= LANGUAGE AND CULTURE EA0LORATIONS-I 01/>+6& +< -(& C+1/6&8 Englis# or Semesters " is designed to pro'ide t#e learners an opportunity to en#ance t#eir language s1ills t#roug# a reading o literary te6ts 4#ic# 4ill also #elp t#em relate t#emsel'es to dierent cultures 'is5O5'is t#eir o4n7 ;ndependent reading is also e6pected to increase spontaneity in e6pression among t#e learners7 O23&'-iB&68 -#e Course aims at e6posing t#e learners to nuances in culture2 inculcating t#e #abit o independent reading 4#ic# pro'ides t#e learners an opportunity to de'elop critical t#in1ing and analytical s1ills t#at can be applied to any sub%ect7 C+n-&n- +< -(& '+1/6&8 -#e literary pieces are careully c#osen rom across cultures as samples o contemporary lie and issues o global interest7 -#is is meant to encourage students to relate language to personality de'elopment7 ;n all2 i'e stories #a'e been selected or Englis# Communication Practice7 T+>i'68 Culture and traditions2 p#ilosop#y2 amilial relations#ips2 et#ics2 inter5personal relations#ips2 ability to ace disaster and po'erty2 tolerance7 Ti)& </a)&HH+1/6 +< in6-/1'-i+n: 2#rs per 4ee1 9or pre5reading and post reading tas1s o t#e lessons<7 -otal number o #ours per semester 5 "27 Ti)& A55+'a-i+n8 >eading o t#e te6t s#ould be done at #ome7 -#e class #ours are meant or discussion2 analysis and related acti'ities7 Pro%ect s#ould be completed in consultation 4it# t#e teac#er7 EBa51a-i+n: -#e learner 4ill be assessed on a continuous basis by 4ay o pro%ects and 4or15s#eets gi'en at t#e end o eac# story7 Stories selected or Englis# Communication Practice Life, Language and Culture: 1! T(& C+> and -(& An-(&) 2; O! H&n/; 2! T(& #&6-iBa5 +< -(& Sa'/&d T++-( R&5i' in S/i Lanka 9based on t#e -ra'elogues o FA Fien Compiled by As#o1 &ainAssisted by D#ur%%ati Sarma< 3!T(& Ha,k and -(& T/&& by Mo#ammad A)am >a#na4ard Garyab 4! T+ & +/ N+- T+ & by Ga#eda Fina 5! ad& (ai Saa29My Elder +rot#er< by Munshi Premchand R&'+))&nd&d ++k: !ie2 !anguage and Culture E6plorations5;2 Cengage !earning ;ndia P't7 !td72 Ce4 Del#i7 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . II S&) DATA CO$$UNICATIONS UNIT I : #1nda)&n-a56 O< Da-a C+))1ni'a-i+n: Data Communication Cet4or1 Arc#itecture2 Protocols and standards2 standards organi)ations or Data Communication2 !ayered Cet4or1 Arc#itecture2 $pen Systems ;nterconnection2 Data Communication circuits2 Serial and parallel Data -ransmission2 Data communications Circuit Arrangements2 Data communications Cet4or1s7 SIGNALS= NOISE= $ODULATION= AND DE$ODULATION : Signal Analysis2 Electrical Coise and Signal5to5Coise >atio2 Analog Modulation Systems2 ;normation Capacity2 +its2 +it >ate2 +aud2 and M5ary Encoding2 Digital Modulation7 UNIT II : $&-a55i' Ca25& T/an6)i66i+n $&dia : Metallic -ransmission !ines2 -rans'erse Electromagnetic @a'es2 C#aracteristics o Electromagnetic @a'es2 -ransmission !ine Classiications2 Metallic -ransmission !ine -ypes2 @a'e Propagation on Metallic -ransmission !ines2 Metallic -ransmission !ine losses 7 O0TICAL #IER TRANS$ISSION $EDIA : Ad'antages and Disad'antages o $ptical Fiber Cables2 Electromagnetic spectrum2 $ptical Fiber Communications System +loc1 Diagram2 $ptical Fiber construction2 -#e P#ysics o !ig#t2 ?elocity o Propagation2 Propagation o !ig#t -#roug# an $ptical iber Cable2 $ptical Fiber Modes and Classiications2 $ptical Fiber Comparison2 !osses in $ptical Fiber Cables7 UNIT III : Di9i-a5 T/an6)i66i+n 8 Pulse Modulation2 Pulse code Modulation2 Signal ?oltage3to5Huanti)ation Coise ?oltage >atio2 !inear ?ersus Conlinear PCM Codes2 Companding2 PCM !ine Speed7 Delta Modulation PCM Dierential PCM7 $15-i>5&@in9 and Ca//i&/6 : -ime5 Di'ision Multiple6ing2 -1 Digital Carrier System2 Digital !ine Encoding2 - Carrier systems2 Statistical -ime 3 Di'ision Multiple6ing2 Frame Sync#roni)ation2 Fre=uency5 Di'ision Multiple6ing2 @a'elengt#5 Di'ision Multiple6ing7 UNIT IV : Wi/5&66 C+))1ni'a-i+n6 S;6-&)6 8 Electromagnetic Polari)ation2 >ays and @a'e ronts2 Electromagnetic >adiation2 Sp#erical @a'e ront and t#e ;n'erse S=uare !a42 @a'e Attenuation and Absorption2 $ptical Properties o >adio @a'es2 -errestrial Propagation o Electromagnetic @a'es2 S1ip Distance2 Free5Space Pat# !oss2 Micro4a'e Communications Systems2 Satellite Communications Systems7 UNIT V : T&5&>(+n& In6-/1)&n-6 And Si9na568 -#e Subscriber !oop2 Standard -elep#one Set2 +asic -elep#one Call Procedures2 Call Progress -ones and Signals2 Cordless -elep#ones2 Caller ;D2 Electronic -elep#ones2 Paging systems7 THE TELE0HONE CIRCUIT: -#e !ocal Subscriber !oop2 -elep#one Message5C#annel Coise and Coise @eig#ting2 Anits o Po4ers Measurement2 -ransmission Parameters and Pri'ate5!ine Circuits 2 Crosstal17 UNIT VI : C&5515a/ T&5&>(+n& C+n'&>-6 And S;6-&)6: Mobile -elep#one ser'ice2 Cellular -elep#one2 Fre=uency >euse2 ;ntererence2 Cell Splitting2 Sectoring2 Segmentation and Duali)ation2 Cellular System -opology2 >oaming and #ando2 Cet4or1 Components2 Call Processing7 First Jeneration Analog Cellular -elep#one2 Personal Communications system2 Second Jeneration Cellular -elep#one Systems2 Digital Cellular -elep#one 2 Jlobal System or Mobile Communications7 UNIT VII: Da-a C+))1ni'a-i+n6 C+d&6= E//+/ C+n-/+5= and Da-a #+/)a-6: Data Communications C#aracter Codes2 +ar Codes2 Error Control2 Error Detection2 Error Correction2 C#aracter Sync#roni)ation7 UNIT VIII: Da-a C+))1ni'a-i+n6 EC1i>)&n-: Digital Ser'ice Anit and C#annel Ser'ice Anit2 ?oice5+and Data Communication Modems2 +ell Systems5 Compatible ?oice5+and Modems2 ?oice5+and Modern +loc1 Diagram2 ?oice5+and Modem Classiications2 Async#ronous ?oice5+and Modems2 Sync#ronous ?oice5+and Modems2 Modem Sync#roni)ation2 ;-A5- ?oice5 +and Modem and *,I Modems2 Cable Modems7 TEAT OOKS: 17 ;ntroduction to Data Communications and Cet4or1ing2 "Be2 @ayne -omasi2 PEA7 RE#ERENCE OOKS: 17 Data and computer Communications2 /Be2 @illiam Stallings2 PF;7 27 Data Communications and Cet4or1ing2 (Be2 +e#rou) A Forou)an2 -MF7 "7 Anderstanding Data Communications 2.Be2 Jilbert Feld2 PEA 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . II S&) 0RINCI0LES O# 0ROGRA$$ING LANGUAGES "C+))+n ,i-( CSE% UNIT I: In-/+d1'-i+n: -#e Art o !anguage Design2 Programming !anguage Spectrum2 @#y Study Programming !anguagesP Compilation and ;nterpretation2 Programming En'ironments2 $'er'ie4 o Compilation 0/+9/a))in9 Lan91a9& S;n-a@8 Speciying Synta68 >egular E6pressions and Conte6t5Free Jrammars2 Scanning2 Parsing2 -#eoretical Foundations UNIT II: Na)&6= S'+>&6= and indin96: -#e Cotion o +inding -ime2 $b%ect !ietime and Storage Management2 Scope >ules2 ;mplementing Scope2 -#e Meaning o Cames 4it#in a Scope2 -#e +inding o >eerencing En'ironments2 Macro E6pansion2 Separate Compilation UNIT III: S&)an-i' Ana5;6i6: -#e >ole o t#e Semantic Analy)er2 Attribute Jrammars2 E'aluating Attributes2 Action >outines2 Space Management or Attributes2 Decorating a Synta6 -ree UNIT IV: C+n-/+5 #5+,: E6pression E'aluation2 Structured and Anstructured Flo42 Se=uencing2 Selection2 ;teration2 >ecursion2 Con determinacy UNIT V: Da-a T;>&6: -ype Systems2 -ype C#ec1ing2 >ecords 9Structures< and ?ariants 9Anions<2 Arrays2 Strings2 Sets2 Pointers and >ecursi'e -ypes2 !ists2 Files and ;nputB $utput2 E=uality -esting and Assignment UNIT VI: S12/+1-in&6 and C+n-/+5 A26-/a'-i+n: >e'ie4 o Stac1 !ayout2 Calling Se=uences2 Parameter Passing2 Jeneric Subroutines and Modules2 E6ception Fandling2 Coroutines2 E'ents C+n'1//&n';: Concurrent Programming Fundamentals2 ;mplementing Sync#roni)ation2 !anguage5!e'el Mec#anisms2 Message Passing >un5time Program Management8 !ate +inding o Mac#ine Code2 ;nspectionB;ntrospection UNIT VII: Da-a A26-/a'-i+n and O23&'- O/i&n-a-i+n: $b%ect5$riented Programming2 Encapsulation and ;n#eritance2 ;nitiali)ation and Finali)ation2 Dynamic Met#od +inding2 Multiple ;n#eritance UNIT VIII: #1n'-i+na5 Lan91a9&6: Functional Programming Concepts2 A >e'ie4B$'er'ie4 o Sc#eme2 E'aluation $rder >e'isited2 Fig#er5$rder Functions2 -#eoretical Foundations L+9i' Lan91a9&68 !ogic Programming Concepts2 Prolog2 -#eoretical Foundations2 !ogic Programming in Perspecti'e TEAT OOKS: 17 Programming !anguage Pragmatics2 "B e2 Mic#ael Scott2 Else'ier2 Morgan Iaumann22DD0 27 Concepts o Programming languages2 Sebesta2 /B e2 PEA RE#ERENCE OOKS: 17 Programming !anguages Design and ;mplementation 2 (Be Pratt 2 Gel1o4it)2 PF; 27 Programming !anguages 2!ouden2 2 Be2 Cengage22DD" "7 Fundamentals o Programming languages2 Foro4it)2 Jalgotia 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . II S&) OJECT ORIENTED 0ROGRA$$ING THROUGH JAVA "C+))+n ,i-( CSE%
UNIT I: a6i'6 +< O23&'- O/i&n-&d 0/+9/a))in9 "OO0%: Ceed or $$ paradigm2 A 4ay o 'ie4ing 4orld 3 Agents2 responsibility2 messages2 met#ods2 classes and instances2 class #ierarc#ies 9;n#eritance<2 met#od binding2 o'erriding and e6ceptions2 summary o oop concepts2 coping 4it# comple6ity2 abstraction mec#anisms7 UNIT II: JaBa a6i'6: Data types2 'ariables2 scope and lie time o 'ariables2 arrays2 operators2 e6pressions2 control statements2 type con'ersion and costing2 simple %a'a program2 classes and ob%ects 3 concepts o classes2 ob%ects2 constructors2 met#ods2 access control2 t#is 1ey4ord2 garbage collection2 o'erloading met#ods and constructors2 parameter passing2 recursion2 string #andling7
UNIT III: In(&/i-an'&: Fierarc#ical abstractions2 +ase class ob%ect2 subclass2 subtype2 substitutability2 orms o in#eritance5 speciali)ation2 speciication2 construction2 e6tension2 limitation2 combination2 beneits o in#eritance2 costs o in#eritance7 Member access rules2 super uses2 using inal 4it# in#eritance2 polymorp#ism2 abstract classes7
UNIT IV: 0a'ka9&6 and In-&/<a'&6: Deining2 Creating and Accessing a Pac1age2 Anderstanding C!ASSPA-F2 importing pac1ages2 dierences bet4een classes and interaces2 deining an interace2 implementing interace2 applying interaces2 'ariables in interace and e6tending interaces7 UNIT V: E@'&>-i+n (and5in9 and $15-i-(/&adin9: Concepts o e6ception #andling2 beneits o e6ception #andling2 -ermination or presumpti'e models2 e6ception #ierarc#y2 usage o try2 catc#2 t#ro42 t#ro4s and inally2 built in e6ceptions2 creating o4n e6ception sub classes7 Dierences bet4een multi t#reading and multitas1ing2 t#read lie cycle2 creating t#reads2 sync#roni)ing t#reads2 daemon t#reads2 t#read groups7
UNIT VI: A>>5&-6: Concepts o Applets2 dierences bet4een applets and applications2 lie cycle o an applet2 types o applets2 creating applets2 passing parameters to applets7 Applet to applet communication2 secure applet7 UNIT VII: EB&n- Hand!5in9: E'ents2 E'ent sources2 E'ent classes2 E'ent !isteners2 Delegation e'ent model2 #andling mouse and 1eyboard e'ents2 Adapter classes2 inner classes7 -#e A@- class #ierarc#y2 user interace components5 labels2 button2 can'as2 scrollbars2 te6t components2 c#ec1 bo62 c#ec1 bo6 groups2 c#oices2 lists panels 3 scrollpane2 dialogs2 menubar2 grap#ics2 layout manager 3 layout manager types 3 boarder2 grid2 lo42 card and grid bag7 UNIT VIII: S,in96: ;ntroduction2 limitations o A@-2 M?C arc#itecture2 components2 containers2 e6ploring s4ing5 &Applet2 &Frame and &Component2 ;cons and !abels2 te6t ields2 buttons 3 -#e &+utton class2 C#ec1 bo6es2 >adio buttons2 Combo bo6es2 -abbed Panes2 Scroll Panes2 -rees2 and -ables7
TEAT OOKS: 17 &a'a8 -#e complete reerence2 .Be2 Ferbert sc#ildt2 -MF7 27 &a'a8 Fo4 to Program2 /Be2 Dietal2 Dietal2 PF; RE#ERENCE OOKS: 17 !earn $b%ect $riented Programming using &a'a2 ?en1ates4arlu2 E ? Prasad2 S7 C#and 27 Programming in &a'a22 Dr I SomaSundaram2 &A;C$ Publis#ing #ouse "7 $b%ect $riented Programming t#roug# &a'a2 P7 >ad#a Iris#na2 Ani'ersity Press7 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . II S&) CO$0UTER ORGANIIATION AND ARCHITECTURE UNIT I: A /i&< Hi6-+/; +< C+)>1-&/s8 ?on Ceumann Mac#ine2 2 Designing or perormance E'olution o ;ntel 6/, Arc#itecture2 computer components2 Computer unctions2 bus inter connection2 PC; Coniguration7 A!A2 2:complemented multiplication 9+oot#:s Algorit#m< and di'ision2 loating point AddersB Subtracters7 UNIT II: $a'(in& In6-/1'-i+n 6&-: Addressing Modes2 /D/, addressing Modes2 ;nstruction Formats2 Processor $rgani)ation2 register organi)ation2 instruction cycle2 UNIT III: In6-/1'-i+n >i>&5inin98 Pipelining Fa)ards2 Dealing 4it# +ranc#es2 /D/, Processor Family2 >educed ;nstruction Set Computers8 ;nstruction E6ecution C#aracteristics2 large >egister Files2 >;SC Arc#itecture UNIT IV: 0/+'&66+/ C+n-/+5 Uni-: Micro5$perations2 Control o t#e Processor2 /D/* Arc#itecture2 instruction set and assembly language programming2 #ard4ired ;mplementation UNIT V: $i'/+ 0/+9/a) C+n-/+5: Micro ;nstruction Se=uencing2 -a6onomy o Micro ;nstructions2 Micro ;nstruction E6ecution2 Canoprogramming7 UNIT VI: In-&/na5 $&)+/;: Semiconductor main memory2 D>AM2 S>AM2 D>AM organi)ation2 -ypes o >$Ms2 cac#e memory principles 2Elements o cac#e Design2 Cac#e organi)ation2 Magnetic dis12 P#ysical c#aracteristics o dis1 systems2 compact dis12 memory #ierarc#y2 concepts o partitioning2 paging2 'irtual memory2 demand paging2 and segmentation7 UNIT VII: In>1-H O1->1-8 E6ternal de'ices2 ;B$ modules2 ;B$ addressing2 programmed ;B$2 ;nterrupt dri'en ;B$2 DMA2 ;B$ c#annel and processors7 UNIT VIII: 0a/a55&5 0/+'&66in9: Multiple Processors2 Symmetric Multiprocessors2 Cac#e Co#erence2 Concepts o Multit#read and Approac#es to e6plicit multi t#reading2 Conuniorm Memory Access2 Approac#es to ?ector Computation2 Concepts o Multicore Computers2 /D/, Multicore $rgani)ation TEAT OOKS: 17 Computer $rgani)ation and Arc#itecture2 @illiam Stalling2 /Be2 PF;7 RE#ERENCE OOKS: 17 Computer $rgani)ation2 Carl Famac#er2 G'on1o ?ranesic2 Sa4at Ga1y2 *Be2 -MF7 27 Computer Systems Arc#itecture and $rgani)ation2 &o#n D7 Carpinelli2 PEA "7 Computer Arc#itecture and $rgani)ation2"Be2 &o#n P7 Fayes2 -MF 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . II S&) DATAASE $ANAGE$ENT SYSTE$S "C+))+n ,i-( CSE% UNIT I : In-/+d1'-i+n: Data base System Applications2 data base System ?S ile System2 ?ie4 o Data2 Data Abstraction2 nstances and Sc#emas2 data Models2 t#e E> Model2 >elational Model 2$t#er Models2Database !anguages 8 DD!2 DM!2 database Access or applications Programs 2data base Asers and Administrator 2-ransaction Management 2data base System Structure 2 Storage Manager2 t#e Huery Processor UNIT II : Hi6-+/; +< Da-a 2a6& S;6-&)68 Data base design and E> diagrams2 +eyond E> Design Entities2 Attributes and Entity sets2 >elations#ips and >elations#ip sets2 Additional eatures o E> Model2 Concept Design 4it# t#e E> Model 2Conceptual Design or !arge enterprises7 UNIT III : In-/+d1'-i+n -+ -(& R&5a-i+na5 $+d&5: ;ntegrity Constraint $'er relations 2 Enorcing ;ntegrity constraints 2 Huerying relational data 2!ogical data base Design 2 ;ntroduction to ?ie4s 2 Destroying Baltering -ables and ?ie4s7 R&5a-i+na5 A59&2/a: Selection and pro%ection set operations 2 renaming2 &oins 2 Di'ision 2 E6amples o Algebra o'er'ie4s R&5a-i+na5 'a5'15168 -uple relational Calculus UNIT IV : #+/) +< a6i' SDL D1&/;: E6amples o +asic SH! Hueries2 ;ntroduction to Cested Hueries 2Correlated Cested Hueries Set 2Comparison $perators2 Aggregati'e $perators2 CA!! 'alues 2 Comparison using Cull 'alues2 !ogical connecti'ity:s2 ACD2 $> and C$-2 ;mpact on SH! Constructs 2 $uter &oins2 Disallo4ing CA!! 'alues2 Comple6 ;ntegrity Constraints in SH! -riggers and Acti'e Data bases7 UNIT V : S'(&)a R&<in&)&n- 8 Problems Caused by redundancy2 Decompositions 2 Problem related to decomposition 2 reasoning about FDS2 F;>S-2 SEC$CD2 -F;>D Cormal orms2 +CCF 2!ossless %oin Decomposition 2Dependency preser'ing Decomposition2 Sc#ema reinement in Data base Design2 Multi 'alued Dependencies2 F$>-F Cormal Form7 UNIT VI : T/an6a'-i+n C+n'&>-: -ransaction State5 ;mplementation o Atomicity and Durability2Concurrent E6ecutions2 Seriali)ability2 >eco'erability 2;mplementation o ;solation2 -esting or seriali)ability2 Failure classiication2Storage2>eco'ery and Atomicity2>eco'ery algorit#m7 UNIT VII : S-+/a9& and Ind&@in9 : Data on E6ternal Storage 2 File $rgani)ation and ;nde6ing2 Cluster ;nde6es2 Primary and Secondary ;nde6es 2 ;nde6 data Structures 2 Fas# +ased ;nde6ing 8-ree base ;nde6ing 2Comparison o File $rgani)ations 2;nde6es and Perormance -uning7 UNIT VIII : T/&& S-/1'-1/&d Ind&@in9 : ;ntuitions or tree ;nde6es2 ;nde6ed Se=uential Access Met#ods 9;SAM< ++ -rees8 A Dynamic ;nde6 Structure7 TEAT OOKS: 17 Data base Management Systems2 "Be2 >ag#urama Iris#nan2 &o#annes Je#r1e2 -MF 27 Data base System Concepts2*Be2 Silbersc#at)2 Iort#2 -MF RE#ERENCE OOKS: 17 Data base Management System2 *Be2 Elmasri Ca'at#e 2PEA 27 ;ntroduction to Database Systems2 /Be2 C7&7Date2 PEA "7 Database System Concepts2 Peter >$+2Coronel2 Ceneage7 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . II S&) AUTO$ATA THEORY and CO$0ILER DESIGN UNIT I: #+/)a5 Lan91a9& and R&915a/ E@>/&66i+n6: !anguages2 operations on languages2 regular e6pressions 9re<2 languages associated 4it# 9re<2 operations on 9re<2 ;dentity rules or 9re<2 Finite Automata8 DFA2 CFA2 Con'ersion o regular e6pression to CFA2 CFA to DFA7 Applications o Finite Automata to le6ical analysis2 le6 tools7 UNIT II: C+n-&@- #/&& 9/a))a/6 and >a/6in9: Conte6t ree Jrammars2 !etmost Deri'ations2 >ig#tmost Deri'ations2 Parse -rees2 Ambiguity Jrammars2 -op5Do4n Parsing2 >ecursi'e Descent Parsers8 !!9I< Parsers and !!91< Parsers7 UNIT III: +--+) 1> >a/6in9: >ig#tmost Parsers8 S#it >educe Parser2 Fandles2 Fandle pruning2 Creating !> 9D< Parser2 S!> 91< Parser2 !> 91< & !A!> 91< Parsers2 Parser Fierarc#y2 Ambiguous Jrammars2 Qacc Programming Speciications7 UNIT IV: S;n-a@ Di/&'-&d T/an65a-i+n: Deinitions2 construction o Synta6 -rees2 S5attributed and !5attributed grammars2 ;ntermediate code generation2 abstract synta6 tree2 translation o simple statements and control lo4 statements7 UNIT V: S&)an-i' Ana5;6i6: Semantic Errors2 C#oms1y #ierarc#y o languages and recogni)ers2 -ype c#ec1ing2 type con'ersions2 e=ui'alence o type e6pressions2 Polymorp#ic unctions2 o'erloading o unctions and operators7 UNIT VI: S-+/a9& O/9ani?a-i+n: Storage language ;ssues2 Storage Allocation2 Storage Allocation Strategies2 Scope2 Access to Conlocal Cames2 Parameter Passing2 Dynamics Storage Allocation -ec#ni=ues7
UNIT VII: C+d& O>-i)i?a-i+n: ;ssues in t#e design o code optimi)ation2 Principal sources o optimi)ation2 optimi)ation o basic bloc1s2 !oop optimi)ation2 peep#ole optimi)ation2 lo4 grap#s2 Data lo4 analysis o lo4 grap#s7 UNIT VIII: C+d& G&n&/a-i+n: ;ssues in t#e design o code Jeneration2 Mac#ine Dependent Code Jeneration2 ob%ect code orms2 generic code generation algorit#m2 >egister allocation and assignment2 DAJ representation o basic +loc1s2 Jenerating code rom DAJs7 TEAT OOKS: 17 ;ntroduction to Automata -#eory !anguages & Computation2 "Be2 Fopcrot2 Allman2 PEA 27 Compilers Principles2 -ec#ni=ues and -ools2 A#o2 Allman2 >a'i Set#i2 PEA RE#ERENCE OOKS: 17 Principles o Compiler Design2 A7?7 A#o 7 &7D7AllmanR PEA 27 -#eory o Computer Science2 Automata languages and computation 2 2Be2 Mis#ra2 C#andra S#e1aran2 PF; "7 Elements o Compiler Design2 A7Meduna2 Auerbac# Publications2 -aylor and Francis Jroup7 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . II S&) OJECT ORIENTED 0ROGRA$$ING LA 17 Ase &DI 17* or abo'e on any platorm e7g7 @indo4s or Ani67 27 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 12 17 E'ery subse=uent 'alue is t#e sum o t#e 2 'alues preceding it7 @rite A &a'a Program 9@A&P< t#at uses bot# recursi'e and non5recursi'e unctions to print t#e n th 'alue o t#e Fibonacci se=uence7 (7 @A&P to demonstrate 4rapper classes2 and to i6 t#e precision7 *7 @A&P 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 @A&P t#at c#ec1s 4#et#er a gi'en string is a palindrome or not7 E68 MA!AQA!AM is a palindrome7 .7 @A&P or sorting a gi'en list o names in ascending order7 /7 @A&P to c#ec1 t#e compatibility or multiplication2 i compatible multiply t4o matrices and ind its transpose7 07 @A&P t#at illustrates #o4 runtime polymorp#ism is ac#ie'ed7 1D7 @A&P to create and demonstrate pac1ages7 117 @A&P2 using StringTokenizer class2 4#ic# reads a line o integers and t#en displays eac# integer and t#e sum o all integers7 127 @A&P t#at reads on ile name rom t#e user t#en displays inormation about 4#et#er t#e ile e6ists2 4#et#er t#e ile is readableB4ritable2 t#e type o ile and t#e lengt# o t#e ile in bytes and display t#e content o t#e using FileInutStream class7 1"7 @A&P t#at displays t#e number o c#aracters2 lines and 4ords in a te6tBte6t ile7 1(7 @rite an Applet t#at displays t#e content o a ile7 1*7 @A&P t#at 4or1s as a simple calculator7 Ase a grid layout to arrange buttons or t#e digits and or t#e + 5 6 B S operations7 Add a te6t ield to display t#e result7 1,7 @A&P or #andling mouse e'ents7 1.7 @A&P demonstrating t#e lie cycle o a t#read7 1/7 @A&P t#at correctly implements Producer5Consumer problem using t#e concept o ;nter -#read Communication7 107 @A&P t#at lets users create Pie c#arts7 Design your o4n user interace 94it# S4ings & A@-<7 2D7 @A&P t#at allo4s user to dra4 lines2 rectangles and o'als7 217 @A&P t#at implements a simple clientBser'er application7 -#e client sends data to a ser'er7 -#e ser'er recei'es t#e data2 uses it to produce a result and t#en sends t#e result bac1 to t#e client7 -#e client displays t#e result on t#e console7 For e68 -#e data sent rom t#e client is t#e radius o a circle and t#e result produced by t#e ser'er is t#e area o t#e circle7 227 @A&P to generate a set o random numbers bet4een t4o numbers 61 and 622 and 61TD7 2"7 @A&P to create an abstract class named S#ape2 t#at contains an empty met#od named number$Sides9<7 Pro'ide t#ree classes named -rape)oid2 -riangle andFe6agon2 suc# t#at eac# one o t#e classes contains only t#e met#od number$Sides9<2 t#at contains t#e number o sides in t#e gi'en geometrical igure7 2(7 @A&P to implement a Hueue2 using user deined E6ception Fandling 9also ma1e use o t#ro42 t#ro4s<7 2*7 @A&P t#at creates " t#reads by e6tending -#read class7 First t#read displays UJood MorningV e'ery 1 sec2 t#e second t#read displays UFelloV e'ery 2 seconds and t#e t#ird displays U@elcomeV e'ery " seconds7 9>epeat t#e same by implementing >unnable< 2,7 Create an in#eritance #ierarc#y o >odent2 Mouse2 Jerbil2 Famster 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'iors2 depending on t#e speciic type o >odent7 Create an array o >odent2 ill it 4it# dierent speciic types o >odents and call your base class met#ods7 2010-11 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA !TECH! "IN#OR$ATION TECHNOLOGY% II Y&a/ !T&'(! . II S&) DATA ASE $ANAGE$ENT SYSTE$S LA
17 E6ecute a single line and group unctions or a table7 27 E6ecute DC! and -C! Commands7 "7 Create and manipulate 'arious D+ ob%ects or a table7 (7 Create 'ie4s2 partitions and loc1s or a particular D+7 *7 @rite P!BSH! procedure or an application using e6ception #andling7 ,7 @rite P!BSH! procedure or an application using cursors7 .7 @rite a D+MS program to prepare reports or an application using unctions7 /7 @rite a P!BSH! bloc1 or transaction operations o a typical application using triggers7 07 @rite a P!BSH! bloc1 or transaction operations o a typical application using pac1age7 1D7 Design and de'elop an application using any ront end and bac1 end tool 9ma1e use o E> diagram and DFD<7 117 Create table or 'arious relation 127 ;mplement t#e =uery in s=l or a< insertion b< retrie'al c< updation d< deletion 1"7 Creating ?ie4s 1(7 @riting Assertion 1*7 @riting -riggers 1,7 ;mplementing operation on relation using P!BSH! 1.7 Creating Forms 1/7 Jenerating >eports -ypical Applications 3 +an1ing2 Electricity +illing2 !ibrary $peration2 Pay roll2 ;nsurance2 ;n'entory etc7