Mca i Year Syllabus 1

8/4/2019 Mca i Year Syllabus 1

1/21

UTTARAKHAND TECHNICAL UNIVERSITY

COURSES OF STUDY, SCHEME OF EXAMINATION & SYLLABUS FOR M.C.A.

1

COURSES OF STUDY, SCHEME OF EXAMINATION & SYLLABUS

FOR

M.C.A. (MASTER OF COMPUTER APPLICATION)I Year (I&II Semester)

(Effective from the session: 2010-2011)

Uttarakhand Technical University, Dehradun


2/21



2


3/21



3

M.C.A. (MASTER OF COMPUTER APPLICATION)

1.0 COURSE OUTLINE AND SCHEME OF EXAMINATION

YEAR-1, SEMESTER-I

COURSES OF STUDY

S.N

O.

SUBJECT

CODESUBJECT

CONTACT

HRS.CREDIT

1 MCA-101Mathematical Foundation of Computer

Science3-1-0 4

2 MCA-102 Principles of Financial Accounting 3-1-0 4

3 MCA-103Fundamental of Computer and Digital

Electronics3-1-0 4

4 MCA-104Programming Fundamentals and C

Programming3-1-0 4

5 MCA-105 Logic and Its Applications 2-0-0 2

6 MCA-106Technical Writing & Communication

Skills2-0-0 2

PRACTICALS

7 MCA-111 Programming Lab 0-0-2 2

8 MCA-112 Communication Skill Lab. 0-0-2 2

9 MCA-113 Digital Electronics Lab 0-0-2 2

10 MCA 114 Seminar 0-0-4 4

Total 30


4/21



4

SCHEME OF EXAMINATION

S.

No.

SUBJECT

CODE SUBJECT

PERIODS

EVALUATION SCHEME

SESSIONAL

EXAM ESESubjec

Total

L T P CT TA Total

1 MCA-101

MathematicalFoundation of

Computer Science3 1 0 30 20 50 100 150

2 MCA-102Principles of

Financial Accounting3 1 0 30 20 50 100 150

3 MCA-103

Fundamental ofComputer and Digital

Electronics3 1 0 30 20 50 100 150

4 MCA-104

Programming

Fundamentals andC Programming

3 1 0 30 20 50 100 150

5 MCA-105Logic and ItsApplications

2 0 0 15 10 25 50 75

6 MCA-106

Technical Writing &

Communication

Skills

2 0 0 15 10 25 50 75

TOTAL (Theory) 750

PRACTICALS

7 MCA-111 Programming Lab 0 0 2 25 25 25 50

8 MCA-112Communication Skill

Lab.0 0 2 25 25 25 50

9. MCA-113Digital Electronics

Lab0 0 2 25 25 25 50

10 MCA 114 Seminar 0 0 4 50 50 50 100

Total (Practical) 250

Total (Theory + Practical) 16 4 10 1000

TA Teacher Assessment CT Cumulative Test ESE End Semester Examination

Note: Duration of ESE shall be 3 (Three) hours.


5/21



5

YEAR I, SEMESTER II

COURSES OF STUDY

S.

NO.

SUBJECT

CODE SUBJECT

CONTACT

HRS. CREDIT

1 MCA-201Organizational Structure and

Personnel Management2-0-0 2

2 MCA-202 Data Structures 3-1-0 4

3 MCA-203 Computer Organization 3-1-0 4

4 MCA-204Computer Based Numerical &

Statistical Techniques2-0-0 2

5 MCA-205 Operating System 3-1-0 4

6 MCA-206 Object Oriented Programming 3-1-0 4PRACTICALS

7 MCA-211 Data Structure Lab 0-0-2 2

8 MCA-212 CBNST Lab 0-0-2 2

9 MCA-213Object Oriented Programming

Lab0-0-2 2

10 MCA 215 Colloquium 0-0-4 4

Total 30


6/21



6

SCHEME OF EXAMINATION

S.

No.

COURSE

CODE SUBJECT

PERIODS

EVALUATION SCHEME

SESSIONAL

EXAM

ESE Subje

Tota

L T P CT TA Total

1 MCA-201

Organizational

Structure and

Personnel

Management

2 0 0 15 10 25 50 75

2 MCA-202 Data Structures 3 1 0 30 20 50 100 150

3 MCA-203Computer

Organization3 1 0 30 20 50 100 150

4 MCA-204

Computer Based

Numerical &

StatisticalTechniques

2 0 0 15 10 25 50 75

5 MCA-205 Operating System 3 1 0 30 20 50 100 150

6 MCA-206Object Oriented

Programming3 1 0 30 20 50 50 100

TOTAL (Theory) 750

PRACTICALS

7 MCA-211 Data Structure Lab 0 0 2 25 25 25 50

8 MCA-212 CBNST Lab 0 0 2 25 25 25 50

9 MCA-213Object Oriented

Programming Lab0 0 2 25 25 25 50

11 MCA-214 Colloquium 0 0 4 50 50 50 100

Total (Practical) 250

Total (Theory + Practical) 16 4 10 1000

TA Teacher Assessment CT Cumulative Test ESE End Semester Examination

Note: Duration of ESE shall be 3 (Three) hours


7/21



7

YEAR I, SEMESTER I

MCA 101 - MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE

Objectives: The ob jec t ive o f th is course is to present the foundat ions o f many bas ic computer re la ted

concepts and pr ov id e a coherent deve lopm ent to th e stu dents for th e cour ses l ike Fundament a ls o f Com put erOrgan izat ion, RDBMS, Data S t ruc tures , Ana lys is o f A lgor i thms, Theory o f Computat ion ,Cryptography ,Ar t i f i c ia l In te l l igence and o thers . Th is course w i l l enhance the s tudent s ab i l i t y to th ink log ica l ly andmathemat ica l ly .

Prerequisites: Know ledge o f bas ic concepts on Sets , d i f fe rent operat ion s on sets , b inar y op erat ions ,func t ions .

UNIT-IRELATION: Type and comp os i t ions o f r e la t ions , P ictor ia l r epresenta t ion o f r e la t ions , Equ iva lence re la t ions ,Pa r t i a l o rde r ing re lat i on . Funct i on : Types, Com p osi t i on o f f unc t i on , Recu rs i vel y def i ned f unc t i onMathem at ical Indu c t ion: P iano s ax iom s, Math emat ica l Induc t ion , D iscre te Num er ic Func t ions and Generat ingfunc t ions , Sim ple Recur r ence re la t ion w i th constant coef f icients , l inear r ecur rence re la t ion w i th out cons tant

coef f ic ients , Asympt ot ic Behav ior o f func t ions , A lgebra ic St r uc tur es: Prop er t ies , Semi gr oup, mon oid , Grou p,Abel ian group, proper t ies o f group, Subgroup, Cyc l ic group, Cosets , Permutat ion groups , Homomorph ism,I som or ph ism and A u t om or ph ism o f groups .UNIT II

Preposit ional Logic: Preposi t ion, First order logic, Basic logical operat ions, Tautologies, Contradict ions,A lgebra o f Prop os i t ion , Log ical im pl ica t ion, Log ica l equ iva lence, Nor m al fo rm s, In ference Theor y , Pred icatesand q uan t i f i ers, Posets, Hasse Diagr am,UNIT -III

Lat t ices : In t roduc t ion, Ordered set , Hasse d iagram of par t ia l ly ordered set , Cons is tent enumerat ion,I somor h ic or dered set , Wel l o rd ered set , Lat t ices, Prop er t ies o f la t t i ces , Bound ed la t t ices , D is t r ibu t ive la t t ices ,and Complem ented la t t ices.UNIT-IVI n t roduc t ion to def in ing language, K leene Closure, Ar i thmet ic express ions , Chomsky H ierarchy , Regular

expressions , Genera l ized Tr ans i t ion graph.f in i te Boo lean a lgebr a, func t ion s o f Boo lean algebra.UNIT -VConvers ion o f regu lar expression t o F in i t e Autom ata, NFA, DFA, Convers ion o f NFA to DFA, Opt im iz ing DFA,FA w i th ou r M oor e machine, Mealy m achin e, Conver s ions .

Text Books:

1 . Ber nar d Kolman, Robert Busby, Sharon C. Ross, Discrete Mathematical Structures , Six th Ed i t ion ,200 8, Pearson Educat ion I nc ., New Delh i . / P rent ice Hal l o f Ind ia (PHI ) Pv t . L td ., New Delh i .

Reference Books:

1 . K en n et h H. Rosen, Discrete Mathematics and Its Applications , Six th Ed i t ion , 2008 , Tata McGraw -Hi l l

(TM H) Publ ica t ions Pv t . L td . , New Delh i .2 . D. S. Malik& M. K. Sen, Discrete Mathematical Structures , First Edi t ion, 2005, CENGAGE LearningInd i a Pv t . L td . , New Delh i .

3 . Ju d i t h L. Gersting, Mathematical Structures for Computer Science: A Modern treatment to DiscreteMathematics , F i f th / Six th Ed i t ion ( As ian Stud ent Ed i t i ons) , 200 8, W. H. Freeman & Com pany, NewDelh i .

4 . Rich ar d Johnsonbaugh, Discrete Mathematics , Sevent h Edit ion , 20 08 , Pearson Educat io n In c., NewDelh i .

5 . C.L .L iu E lem en t s o f D i sc ret e M a t hem at i cs , M cGraw H i l l

1

L T P

3 1 0


8/21



8

MCA 102 - PRINCIPLES OF FINACIAL ACCOUNTING

Objective: The ob jec t ive o f th is course to prov ide awareness o f the under l ine f inanc ia l s t ruc ture andprocedures o f the organ izat ion so that the in terac t ion o f f inanc ia l sys tem wi th in format ionsystems can be under s tood by the in for m at ion system d esigner .

Prerequisite: N o n e

Unit-1

Accounting: Pr inc ip les , concepts and convent ion s , doub le ent r y sys tem of account ing, Ledger p os t ing andTr i a l ba lance.Final accounts: Tr ad ing, pr o f i t and loss accounts and b a lance sheet o f so le pr opr ie tary concern w i th n orm alc losing ent r i es. In t r oduc t ion t o manu factur ing account , f ina l account o f par tn ersh ip f i r m s, l im i ted compan y.

Unit-IIFinancial Management: Meaning, ro le and scope o f f inanc ial m anagement .Basic Financial concepts: Tim e va lue o f Mon ey, pr esent va lue, fu tur e va lue o f a ser ies o f cash f low s, annu i t y .Pract ica l app l ica t ions o f com poun din g and pr esent va lue techn iqu es.

Long-term sources of finance: I n t r oduc t ion to shares, debentur es, pre ference shares .

Unit-III

Capital Budgeting: M ean ing , im p or t ance, d i f f i cu l t i es. I n t r od uc t i on t o evalua t i on t echn iques Trad i t i ona ltechni qu es (ARR Payback m ethod ). Discount ing cash f low techni ques (Present value, NPV, IRR)Ratio Analysis: Meaning, advantages , l im i ta t ions o f ra t io ana lys is, Types o f ra t ios and the i r usefu ln ess .

Unit-IV

Costing: Natur e , im por tance and t ypes o f cos tMarginal costing: Nature, scope and importance of marginal cost ing, Break-even analys is, i ts uses andl im i ta t ions , cons t ru c t ion o f br eak-even char ts . Prac t ical app l ica t ions o f m arg ina l cos t ing.Inventory control system: The need, cost o f in ventor y , m ethods o f inventor y cos t ing.

Unit-V

Introduction to Computerized Accounting System: Cod ing l og i c and codes requ i r ed , m as t er f i l es ,t ransac t ion f i les , in t r oduc t ion to d ocuments used for data co l lect ion. Process ing o f d i f fe rent f i l es and out putsobta ined.

Text Book

1 . K han & Ja in , M anagem en t A ccoun t i ng , Ta t a M cGraw H i l l P ub l i ca t i on

Reference Books:1 . Jawahar La l , F inanc ial A ccoun t i ng , W heele r Pub l i sh ing .2 . S.N. Maheswar i & S. K . Mahesw ar i , In t rod uc t ion to F inanc ia l Account ancy , V ikas Publ ica t ion.

L T P

3 1 0


9/21



9

MCA 103 Fundamental of Computer and Digital Electronics

Objectives: The ob j ect ives o f th i s course is

To learn th e basic method s for the des ign o f d ig i ta l c i rcu i t s and p rov i de the fundam enta l conceptsused in the comp uter systems, m ic ropr ocessor e tc .

To pr ov ide an exposure to dea l w i th v ar ious e lec t ron ic ci rcu i t s . A t th e end o f th e cour se the s tudentsw i l l ga in know ledge t o des ign e lect r on i c c i r cu i t s and f o r consum er and i nd us t r i a l p roduc t s as w e l l .

Prerequisite: None

Unit-I

I n t r oduc t ion to Compu ter : -Defin i t ion , Charac ter is t ics. Generat ion o f Compu ters , Capabi l i t ies and L im i ta t ions .In t r oduc t ion to Operat ing Sys tem. Concept o f B ios , Boot ing F i les. Bas ic Com ponent s o f a Comput er System -Cont r o l Un i t , ALU, Inpu t / outp ut func t ion s and charac ter is t ics. Mem ory In t r oduc t ion , Class i f ica t ions- Vola t i leMem ory and Non - Vola t i le , F lash M emor y , ROM, RAM, EPROM, PROM , EEPROM ot her t ypes o f mem ory .Unit-III npu t , Outp ut and s torage Uni t s :-Com put er Keyboard, Po in t ing D ev ices : Mouse, Tr ackba l l , Touch Panel , andJoyst ick , Ligh t Pen, Scanners, Var i ous ty pes of M oni tor s, Tou ch-sensi t iv e screens, Opt ical Recognit i on System ,

Pen based systems, Digi t izers, MICR, OCR, OMR, Bar-code Reader, digi ta l camera.Hard Copy Dev ices :- I m p act and N on- I m pac t P r in t e r s - Da isy W heel , Do t M a t r i x , L ine P r in t e r , Cha in P r in t e r ,Com b Pr in t ers , Non Im pact Pr i n ters - DeskJet , Laser Pr in t er , Ther m al Trans fer Pr in ter , Barcode Pr in ters ,E lec t ro s ta t ic pr in t ers and p l o t ters .Unit-III

High Leve l Language and Low Leve l Language, Sof tw are and i t s d i f fe rent t y pes- Sys tem Softw are, App l ica t ionsoftw are. Hard w are , F i rm w are, , Com pi ler , In terp re ter and Assembler . F i le A l locat ion T ab le (FAT, FAT 32 &NTFS) . I n t r odu c t i on t o a lgo r i t hm and F low char t : - Represen t a t i on o f an algo r i t hm , f l owchar t s ym bo ls andleve ls o f f low char t , ru les, advantage and l im i ta t ions o f f low char t and p seudo code.Unit-IV

B i n ar y , Oc ta l, D ec im a l , H e xa d eci m a l - N u m b er b a se co n v er s i on s co m p l e m e n t s si gn e d Bi n a r ynum bers . B ina ry A r i t h m e t i c- B ina ry codes: We igh t ed B CD-2421-Gray code-Excess 3 code-A SCI I Er r o r d e t ect i n g co d e c on v er s i on f r o m o n e co d e t o a n ot h e r - Bo o l ea n p o st u l at es an d l a w s De -

M o r g an s T h e or e m - Pr i n c i p l e o f D u al i t y - B o ol ea n e xp r e ssi o n B o ol ea n f u n ct i o n - M i n i m i z a ti o n o fB oo lean exp ress ions Sum o f P roduc t s (SOP) Produc t o f Sum s (P OS) - M in t e rm - M ax t e rm - Canon ica lf o rm s Convers ion be t ween canon ical fo rm s K arnaugh m ap M in im iza t i on Don t care cond i t i ons.

Unit-V

LOGIC GATES: AND, OR, NOT, NAND, NOR, Exclus ive OR and Exclus ive NOR- Im plem entat ions o fLog ic Func t i ons using ga t es , NA ND NOR im p lem en t a t i ons M u l t i l evel gat e im p lem en t a t i ons - M u l t iou t pu t ga t e im p lem en t a t i ons .CO M B IN A T I ON A L CI RCU I T S:D esi g n p r o c ed u r e A d d er s -Su b t r a ct o r s Ser i a l a d d er / Su b t r a ct o r -Pa ra l l el adder / Sub t rac t o r - Car r y l ook ahead adder - B CD adder - M agn i t ude Com para t o r - M u l t i p lexe r / D em u l t i p l e xe r - en c od e r / d e co d er p a r i t y ch e ck e r c od e co n v er t e r s.

TEXT BOOKS

1. M . M or r i s Mano, Digi tal Design, 3.ed. , Prent ice Hal l of Ind ia Pvt . Ltd ., New Delhi , 200 3/ Pearson Edu cat ion(Singapo re) Pvt . Ltd ., New Delhi , 200 3

2. John .M Yar br ough , Digi t al LogicApplications and Design, Thom son- V ikas pub l ish ing house, New Delh i ,2 0 0 2 .

L T P

3 1 0


10/21



10

L T P

3 1 0

A-104 - FUNDAMENTAL OF PROGRAMMING IN C LANGUAGE

Objectives: This hands-on cour se pr ov ides a compr ehensive in t r oduc t ion to p rogr amm ing, and bu i ld s a so l idfoundat i on o f progr amm ing sk i l l s that can be used to master add i t iona l pr ogram m ing languagesl ike C, C++. In th is cour se, s tudent w r i t e , comp i le , and d ebug pr ograms in C.

Prerequisite: None

UNIT-ISt r uc tur e and p rop er t ies o f a lgor i th m , F low char t , A lgor i th m s for g .c .d ., Factor i a l , F ibonacci ser ies , Pr im enum ber generat ion and o ther s imp le prob l ems, search ing & sor t i ng techn i quesUNIT IIC language fundamentals: Character set , Key words, Ident i f iers, data types, Constants and var iables,Statem ents, Expr essions, Operato rs, Pr ecedence and A ssociat iv i ty of op erator s, Sid e ef fects, Typ e conver s ion,M anaging i npu t and ou t pu tCont r o l s t ruc tur es: Dec ision m ak ing, branch in g and loop ing.UNIT -III

Arrays : one d imens iona l , mul t id imens iona l ar ray and the i r app l ica t ions , Dec lara t ion and manipu la t ion o f

a r raysSt r ings : St r ing var iab le , St r ing h andl ing func t ions , Ar ray o f s t r in gsFunc t ions : Des ign ing s t ruc tur ed pr ogram s, Func t ions in C, User def ined and s tandar d fun c t ions , Form al vs .actua l ar guments , Func t ion category , Func t ion p ro t o typ e, Param eter p ass ing, Recurs ive fu nc t ions .Stor age classes: Auto, Extern , r egister and stat ic var iablesUNIT IV

Poin ters : Po in ter var iab le and i t s impor tance, po in ter ar i thmet ic and sca le fac tor , Compat ib i l i t y ,Dereferenc ing, L-va lue and R-va lue, Po in ters and ar r ays, Po in ter and character s t r i ngs , Po in ters andfunc t ions , Ar r ay o f po in ters , po in t ers to po in tersUNIT- VDynam ic m em ory a l l oca t i onSt r uc tur e and u n ion : declara t ion and i n i t i a l izat ion o f s t r uc tur es, St r uc tur e as func t ion par ameters , St r uc tur epo in t ers , Un ions .

F i le Managem ent : Def in ing and opening a f i le , Clos ing a f i le , Inpu t / outp ut Operat ions in f i les, Random Accessto f i les, Er r or hand l ingThe Pre-pr ocessor d i r ect ives , comm and l ine argum ents , Macros .

Text books:

1 . Beh r ou z A . Forouzan and Richard F. Gi lberg . Com put er Science: A St ru c tured Appr oach Us ing C,Th i r d Ed i t ion , 2007 , CENGAGE Learn ing In d ia Pv t . L td ., New Delh i .

2 . E. Balguruswamy, Program m ing in ANSI C , 4 th ed i t ion , 200 7, McGraw -Hi l l Pub l ica t ion, New Delh i .3 . E. Horowitz and S.Sahani Fundam enta ls o f Com put er A lgor i t hm s, (Galgot ia , New Delh i )

Reference books;1 . L et u s C- Ya sh w a n t K an et k ar .2 . K .R. Venugopal , S.R. Prasad, M aster in g C, McGraw-H i l l Educat ion In d ia3 . P . Dey , M . Ghosh , P rog ram m in g i n C , Oxf o rd Un ive rs i t y P ress4 . K .N . K ing ,C P rogram m ing -A m od ern app roach , W .W. Nor t on5 . S. Pr a t a, C P r i m e r p l u s , 5 th Edi t ion , Pearson Educat ion In d ia


11/21



11

MCA 105- LOGIC AND ITS APPLICATIONS

Objectives: The ob jec t ive o f the course w i l l be to in t r oduce the main not ions o f m athemat ica l log ic: logica lno t a t i ons ( syn t ax ) and how t o assign m ean ing t o t h em ( sem an t i c s) . W e w i l l t hen s t udy f o rm a l f r am ewor ks ( i nthe sense o f be ing r igor ous as w el l as in th e sense o f mani pu la t in g " form ") fo r cons t ruc t ing log ica l argum ents(pr oof theory ) , s tudy in g in par t icu lar some deduc t ive sys tems for prop os i t iona l and f i rs t -ord er log ic .Natur a l ly , w e w i l l b e concern ed w i th the cor r ectness and com ple teness o f these deduc t ive sys tem s, as wel l asw i t h t he algo r i t hm ic .

Prerequisites: Form a l m a t hem at i c s, and shou ld have t he ab i l i t y t o t h ink r i go rous l y and p r og ram in t e l l i gen t l y

UNIT- I

Introduction: logic, t ruth tables, equivalence, language to logic, appl icat ions to c ircui t design, exponent ialgrow th, Semant ic Tab leaux , pr ob lem so lv ing w i th semant ic Tab leaux .

UNIT- II

Propositional logic: Syntax o f pr opos i t iona l log ic , ru les o f natur a l deduc t ion , the sequent ca lcu lus , reso lu t ionin p rop os i t iona l log ic : Nor m al fo rm s, Reso lv ing argum ents , Reso lu t ion, Com binator ia l search pr ob lems.

UNIT- III

Predicate Logic: I n t roduc t ion, ob jec ts , pred icates and quant i f ie rs , func t ions , f i r s t o rder languages ,quant i f ie r s , scope, and b ind ing, In terpr e ta t ions , h igher ord er log ic , seman t ic tab leaux in pr ed icate log ic .

UNIT- IV

Resolution in Predicate Logic: Nor mal For m s, Herb rand Universes, Reso lu t ion, Un i f icat ion, Prob lem so lv in gus ing reso lu t i on

Text Book:

1. The Essence o f Logic . John Kel ly . Prent ice-Hal l In tern at iona l

Reference Books:

1 . V i r g in ia K lenk , Unders t and ing Sym bo l i c Logic , 5 / e , P ea rson E ducat i on2. C. L . Chang and R. C. T. Lee, Sym bol ic Log ic and M echanica l Theorem Prov in g, Academ ic

Press.

L T P

2 0 0


12/21



12

MCA106 TECHNICAL WRITING AND COMMUNICATION SKILLS

Objectives: Technical Comm unicat ion is m ost essent ia l fo r s tudents and p ro fessiona ls . Thus th ere is a dras t icneed for e f fec t ive comm uni cat ion. Due to the var iou s phenom enal changes in the bus inessenv i r onm en t , r ec ru i t e r s are now look ing f o r s t uden t s w i t h good com pu t e r kn ow ledge as w e l l as

good comm uni cat ion sk i l l s . Thu s , the ob jec t ive o f th is cour se is to equ ip th e stud ents w i th t hebasics o f com m unicat ion sk i l l s and techn ica l w r i t ing , so that they can put i t i n to use in the i r d ay-to-day act iv i t ies.

Prerequisites: None

UNIT I

Introduction to CommunicationWhat is Communicat ion, Leve ls o f Communicat ion, Impor tance o f Techn ica l Communicat ion, Bar r ie rs toCommunicat ion, Non-Verba l Communicat ion, Technology-Enabled Communicat ion, Impact o f Technology ,Se lec t ion o f Appr opr ia te Com m unicat ion T echnol ogyUNIT IIOral Forms of Communication

Effect iv e l is tenin g, Act iv e vs Passive Listeni ng, Ef fect ive Pr esent at ion Str ategies, Ef fect iv e Use of Visual Ai ds,Unders tand in g the N uances o f Del ivery , In t erv iew s, Types o f In terv i ews, Grou p Di scussion, Meet ings ,ConferencesUNIT III

Introduction to Essential English GrammarPunctuat ion and Capital izat ion, Nouns and Verbs, Pronouns, Adject ives, Preposi t ions, Conjunct ions, Tenses,Ac t ive and Passive Vo ice, Use o f Ar t ic les, Com m on Er ro rs in Usage, W ord s Com m only M i sspe l tUNIT IV

Effective WritingWords and Phrases, Guidel ines for Ef fect iveness, Sentence Construct ion, Paragraph Development , PrecisW r i t ing , Reading Com pr ehensionWritten Forms of CommunicationLet ter W r i t ing , Mem orand um s, E-mai ls , Repor t W r i t ing , Techn ica l Prop osals , Research Paper , D isser t a t ion,

Thes is, Ins t ruc t ion Man uals , Techn ica l Descr ip t ion

Text Books:

a. T ech ni cal Co m m u ni cat io n Pr i nci pl es an d Pr act ice b y M een ak sh i Ram an & San geet a Sh ar m a,Oxford Uni vers i t y Pr ess , Six teenth Im pr ess ion 200 7.

2 . B u si n ess Co m m u n i ca t io n b y M e e n ak s h i Ra m a n & P r ak a sh Si n g h, Ox f or d U n i v e r si t y Pr e ss, Se ve n t hI m p ress ion 2008 .

3 . H igh Sch oo l En gl ish Gr am m a r an d Co m p osi t io n by W r e n & M a r t i n

Reference Books:1 . Ef fec ti v e B u si n e ss Co m m u n i ca t io n b y H e r t a A M u r p h y , H e r b er t W . H i l d er b r a n d t & Ja n e P T h o m a s,

Seventh Ed i t i on , Tata McGraw Hi l l Pub l ica t ion

2 . E ff ec t i ve B usiness Com m un ica t i on by A sha K au l , P ren t i ce -Ha l l I nd ia P v t . L t d ., M arch 2 0083 . Techn ical W r i t i ng by B . N . B asu , P ren t i ce -Ha l l I nd ia P v t . L t d ., 2007

L T P

2 0 0


13/21



13

MCA 111 - PROGRAMMING LAB

1 . W r i t e p r o g r am t o f i n d la r ge st o f t h r e e i n t eg er s .2 . W r i t e p r o g r am t o c h eck w h e t h er t h e gi v en st r i n g i s p a li n d r o m e o r n o t .3 . W r i t e p r o g r am t o f i n d w h e t h er t h e g i v en i n t eg er i s a p r i m e n u m b e r & a n A r m s t r o n g n u m b e r .4 . W r i t e p r o gr a m f o r Pasca l tr i an gl e.

5 . W r i t e p r o gr a m t o f i n d s u m a n d av er a ge o f n i n t e ge r u si n g l in e ar a r r a y .6 . W r i t e p r o g r am t o p e r f o r m a d d it i o n , m u l t i p l i c at i o n , t r a n sp o se on m a t r i c es.7 . W r i t e p rog ram t o f i nd fi bbonacci se r i es o f i t era t i ve m e t hod us ing user -de f i ned f unc t i on .8 . W r i t e p r o gr a m t o f i n d f act o r i a l o f n b y r e cu r s io n u s in g u ser - d e fi n e d f u n ct i o n s.9 . W r i t e p r o gr a m t o p e r f o r m f o l l o w i n g o p er a t i o n s b y u si n g u se r d e fi n e d fu n c t io n s:1 0 . Co n ca t en a t i on1 1 . R ev er se1 2 . St r i n g M a t ch i n g13 . W r i t e p r og ram t o f i nd sum o f n t e rm s o f ser i es: n n*2 / 2 ! + n *3 / 3 ! - n *4 / 4 ! + ...............14 . W r i t e p rog ram t o i n t er change t w o values us ing1 5 . Ca ll b y v a lu e.16 . Ca l l by r e f erence.17 . W r i t e p rog ram t o so r t t he l i st o f i n t ege rs us ing dynam ic m em ory a l l oca t i on .

18 . W r i t e p rog ram t o d i sp lay t he m ar k shee t o f a st uden t us ing s t r uc t u re .19 . W r i t e p r og ram t o pe r f o rm f o l l ow ing ope ra t i ons on dat a f i l es : Read f r om d a t a f i l e & Wr i t e t o da t a f i l e.20 . W r i t e C p rog ram t o copy t he con t en t o f one fi l e t o ano t he r f i l e using com m and l i ne argum en t .

MCA 112 - COMMUNICATION SKILL LAB

Lab sessions w i l l be devoted t o pr act ice act iv i t ies based on a l l th ree mo dules o f theory .a. phonemic transcription

St uden t s w i l l be t r a ined t o f i nd ou t t he co r rect p r onunc ia t i on o f w o rds w i t h t h e help o f a d i c t i ona ry , t oenab le t hem t o m on i t o r and cor r ect t he i r ow n p ron unc ia t i on .

( i ) t r a n sc r i p t i on o f w o r d s an d s h or t s en t e n ce s i n n o r m a l En g li sh o r t h o gr a p h y ( w r i t i n g) i n t o t h ei rIPA equ iva lents ;

( i i ) t r an scr i p t i on o f w o r d s p r ese nt ed o r al l y ;( i i i ) co n v er s i on o f w o r d s p r e se n t ed t h r o u gh I P A sy m b o l s i n t o n o r m a l o r t h o g r ap h y( i v ) sy l l ab le d i v i s i on and st r ess m ark ing ( i n w ords p resen t ed i n I PA f o rm )

b. Listening( i ) l i st en ing w i t h a f ocus on p ronunc ia t i on (ear - t r a in ing ) : segm en t al sounds , st r ess, w eak f o rm s ,

in ton at ion Stud ents shou ld be exposed, i f possib le , to th e fo l low ing var ie t ies o f Eng l ish dur ingl is ten ing pr act ice : Standard Ind ian, Br i t i sh and A mer ican.

c. Speaking( i ) p r o n u n c ia t io n p r a ct i ce ( fo r a cc en t n e u t r a li za t io n ) , p a r t i cu l ar l y o f p r o b l em s o u n d s, i n i so l at ed

w ord s as w el l as sentences( i i ) p rac t i si ng wor d st r ess , r hy t h m in sen t ences, w eak f o rm s , i n t ona t i on( i i i ) read ing a loud o f d i a logues, poems, excerpts f rom p lays , speeches etc . fo r p rac t ice in

p ronunc ia t i ond. Grammar and usage

The focus w i l l be on the e l im inat io n o f comm on er r ors . Som e wr i t in g ac t iv i t ies (e.g . w r i t ing o f shor tparagraphs on assigned top ics) can be used to id ent i f y th ese er ror s .* i den t i f y i ng t he cen t ra l i d ea as w e l l as suppor t i ng ideas* prepa r ing no t es i n d iag ram m at i c f o rm a f t er r ead ing a t ex t , show ing t he m a in i dea and suppor t i ng

ideas and the re la t ionsh ips betw een them .Project Work

St uden t s w i l l be r equ i r ed t o p rodu ce and subm i t by t he end o f Sem est e r 1 a 350 -500 w ord p ro ject r epo r t on atop ic o f th e i r cho ice. The pr o jec t shou ld invo lv e data co l lec t ion, ana lysis and repor t in g.

L T P

0 0 2

L T P

0 0 2


14/21



14

MCA 113 DIGITAL ELECTRONICS LAB

List of Experiments

1 . St udy o f Logic Ga t es : T ru t h - t ab le ve r i f i ca t i on o f OR, A ND, NOT, X OR, NA ND and NOR gat es;Real izat io n of OR, AND, NOT and XOR funct i ons usin g uni versal gates.2 . H al f A d d er / F ul l Ad d er : R eal i zat i on u si n g b asi c an d XOR ga tes.3 . H al f Su b t r act o r / F ul l Su b t r act o r : Real i za ti o n u si n g N A N D ga tes.4 . Pa r al l el A d d er / Su b t r act o r : Per f or m ad d er a n d su b t r act o r o p er a ti o n u si n g I C7 4 8 3 ch i p .5 . 4 - Bi t B i n ar y - t o -Gr a y & Gr a y -t o -B i n ar y Co d e Co n v er t e r : R ea li z at i o n u si n g XOR ga t es.6 . 4 -B it a nd 8 - Bi t Co m p ar a to r : I m p l em e n t at i on u si n g I C7 4 8 5 m a gn i t u d e co m p ar a to r ch i p s.7 . M u l t i pl ex er : T r u t h -t ab l e v er i f icat i on a n d r e al i zat i on o f H a lf ad d er an d F u l l ad d er u s i n g I C7 4 1 5 3 ch i p .8 . D em u l t i p l e xe r : T r u t h - t ab l e v er i f i ca t io n an d r e al i za ti o n of H al f su b t r a ct o r an d Fu l l su b t r a ct o r u si n gIC741 39 ch ip .9 . L ED D isp l ay : U se of BCD t o 7 Seg m en t d eco d er / d r i v er c h ip t o d r i v e L ED d i sp l ay .

10 . F l i p Flops : T ru t h - t ab le ve r i f i ca t i on o f JK M ast e r Slave FF, T - t ype and D- t ype FF using I C7476 ch ip .1 1 . A sy n ch r o n o u s Co u n t er : Re al i za t io n o f 4 -b i t u p co u n t er a n d M o d - N co u n t er u s i n g I C7 4 9 0 & I C7 4 9 3 c h i p .1 2 . Sy n ch r o n o u s Co u n t er : R ea l iz at i o n of 4 -b i t u p / d o w n co u n t er a n d M o d -N co u n t er u s in g I C7 4 1 9 2 &IC741 93 ch ip .13. Sh i f t Regis ter : Study o f sh i f t r igh t , SIPO, SISO, P IPO, P ISO & Shi f t le f t operat ion s us ing IC7495ch ip .1 4 . R in g co u n t er a n d T w i s t ed Ri n g Co u n t er : R ea li z at i o n u si n g I C7 4 9 5 ch i p .1 5 . RA M : St u dy of RA M (2 K x 8 RA M ) o per at io n.1 6 . D A C Op e r at i o n : St u d y o f 8 -b i t D A C ( I C 0 8 / 0 8 0 0 c h ip ) , o b t ai n st a ir c ase w a v ef o r m u s i n g I C7 4 9 3 c h i p .

L T P

0 0 2


15/21



15

YEAR I, SEMESTER II

MCA 201 - ORGANIZATIONAL STRUCTURE AND PERSONNEL MANAGEMENT

Objective: The ob jec t ives o f th is course are tw o- fo ld . F i rs t , the course is in tend ed to pr ov ide a compr ehensivebackground in the s t r a tegic , econom ic , f inanc ia l and or gan izat iona l aspec ts o f Indu s t ry . Secondl y ,

t he cou rse w i l l seek t o p r ov ide a p rac t i ca l f r am ew ork f o r m anager ia l dec i sion -m ak ing i n t h econtex t o f IT sec tor .Prerequisite: n o n e

Unit I

Organization Structure: Classical theor ies of Management : Scient i f ic management theory, Fayol s 14pr inc ip les o f Management , Webar s bureaucrat ic theory . Def in i t ion o f organ izat ion and organ izat ionSt ruc ture .Some concepts regarding Organization Structure: Line and S ta f f author i t y , Cent ra l iza t ion andDecent ra l iza t ion, Span o f cont r o l , Form al and In for m al Organ izat ion.Forms of organization structure and features: Funct ion based, Product based, Geography based, Projectbased ( Mat r ix )Organization Design: Mechanis t ic and Organ ic St r uc tur e , V i r t ua l and Netw ork organ izat ion St r uc tur e

Unit-II

Motivation: Def in i t ion o f Mot iva t ion, Impor tance o f Mot iva t ion, Mot iva t ion and behav ior , Theor ies o fM o t i va t i on M as low s need H ie ra r chy , Tw o- Fac t o r Theory , M cCle l l and s Need Theory , Theory X and Th eoryY.Training and Development: Nat u re o f t r a in ing and Deve lopm en t , I npu t s i n t r a in ing and Deve lopm en t ,im por tance o f t ra in i ng and Developm ent , t ra in ing pr ocess, t r a in ing o f In tern at iona l ass ignm ent

Unit- III

Nature and Scope of Human resource Management: Scope o f HRM, HRM func t ions and ob ject ives , HRMm ode l .Personnel Function: Personnel po l ices and pr inc ip les , dut ies and respons ib i l i t ies o f personnel manager ,d i f fe rences betw een HRM and PM Emer g ing t rends o f personnel m anagem ent in Ind i a

Unit-IV

Human Resource Planning: Meaning, def in i t io n and im por tance o f HRP.Job analysis: M eanin g and d ef in i t ion , pr ocess o f job ana lysis .Recruitment: M eanin g and d ef in i t ion , im por tance, sources o f rec ru i tm ent . Ind i an scenar ioSelection: M eanin g and d ef in i t ion , select ion pr ocess , t yp es o f in terv iew

Reference Books:

1. L . M. Prasad, Organ izat iona l Behav ior , S. Chand.2 . V . S. P . Rao, P . S. Narayana, Organ izat iona l Theory and Behav ior , Konark Publ ishers Pv t . L td .3 . T r i p a t h i , R ed d y , Pr i n c i p les of M a n ag em e n t , T M H

4. K oon t z , We ih r i ch , E ssen t i a l s o f M anagem en t , TM H5 . F r ed L u t h a n s, Or g an i z at i o n al B e h av i o u r , M c Gr a w H i l l6 . K . A sw a t happa , Hu m an Resource and Personne l M anagem en t , TM H7. L . M . Prasad , Hum an Recourse M anagem en t , S. Chand

L T P

2 0 0


16/21



16

MCA 202 - DATA STRUCTURE

Objectives:

T o d e v el o p p r o f i ci en c y i n t h e sp e ci f i ca t io n , r e p r e se n t at i o n , a n d i m p l e m e n t at i o n o f D at a T y p es an dData Structures.

T o b e a bl e t o ca r r y o u t th e A n a ly si s o f v a r i ou s A l go r i t h m s fo r m a i n l y T i m e an d Sp a ce Co m p l e xi t y . T o g et a g oo d u n d er st an d i n g of ap p l icat i on s of D at a St r u ct u r es. T o d ev el o p a b ase fo r a dv an ced co m p u t er s ci en ce st u d y.

Prerequisites: Any pr ogram m ing language l ike C, C++

Unit I

Introduction: Basic Term ino logy , Elementary Data Organ izat ion, St r uc tur e operat ions , A lgor i th m Com plex i t yand T im e-Space t rade-of f

Arrays: A r ray Def in i t ion , Representa t ion and Analys is , S ing le and Mul t id imens iona l Ar rays , addresscalculat ion, appl icat ion of arrays, Character Str ing in C, Character st r ing operat ion, Array as Parameters,Ord ered List , Spar se M atr ices and Vector s.Stacks: Arr ay Representa t ion and Im plem entat ion o f s tack , Operat ions on S tacks : Push & Pop,Ar ray Repr esentat i on of Stack, Lin ked Repr esentat i on of Stack, Operat i ons Associated w ith Stacks,

Appl i cat ion o f s tack : Convers ion o f In f ix to Pref ix and Post f ix Expressions , Eva luat ion o f pos t f ix expressionusing stack.Recursion: Recurs ive def in i t io n and pr ocesses, recurs ion i n C, exam ple o f r ecur s ion, Tow er o f H anoiProb lem, sim ula t ing r ecur s ion, Back t r ack in g, recurs ive a lgor i thm s.Unit - II

Queues: Arr ay and l ink ed repr esenta t ion and i m plem entat ion o f qu eues, Operat ions on Queue: Create , Add,Delete , Fu l l and Em pty , Ci rcu l ar q ueues, D-queues and Pr ior i t y Queues.Linked list: Representa t ion and Im plem entat ion o f Sing ly L ink ed L is ts, Tw o-w ay Header L i s t , Tr avers ing andSearch ing o f L inked L ist , Over f l ow and Under f l ow , I nser t i on and de le t i on t o / f r om L inked L i s t s, I nser t i on anddele t ion A lgor i t hm s, Doubly l ink ed l is t , L ink ed L is t in Ar r ay , Po lynom ia l repr esenta t ion and add i t ion , GarbageCol lec t ion and Com pact ion.Unit - III

Trees: Basic term ino logy , B inary Tr ees , B inary t r ee repr esenta t ion, a lgebra ic Expressions , Com plete B inar yTree, Ex tended B inary Trees , Ar ray and L inked Representa t ion o f B inary t rees , Travers ing B inary t rees ,Thr eaded B inary t r ees , path length a lgor i t hm . H u f f m an A l go r i t h m .Searching and Hashing: Sequent ial search, binary search, compar ison and analys is, Hash Table, HashFunct ions , Co l l i s ion Reso lu t ion St r a tegies, Hash Tab le Im plem entat ion.Unit IV

Sorting: I nser t ion Sor t , Bubble Sor t ing, Quick Sor t , Tw o W ay M erge Sor t , Heap Sor t , Sor t ing on D i f fe rent K eys.Binary Search Trees: B inary Search Tree (BST), Insert ion and Delet ion in BST, Complexi ty of SearchA lgo r i t hm .Unit - V

Introduction to Graphs: Termino logy & Representa t ions , Graphs & Mul t i -g raphs , D i rec ted Graphs ,Sequent ial Repr esentat i ons of Graphs, Adj acency M atr ices, Tr aversalFile Structures: Physical Storage Media Fi le Organizat ion, Organizat ion of records into Blocks, Sequent ial

F i les, Index ing and Hash ing, Pr im ary i nd ices , Secondar y in d ices, B+ Tr ee index F i les, B Tr ee index F i les,Index ing and H ash ing Compar isons.

References

1 . Horow i t z and Sahan i , Fundam en t a l s o f da t a St ru c t u res , Ga lgo t i a2. R. Kru se e ta l , Data St r uc tur es and Program Design in C Pearson Educat ion3. A M Tenenbaum eta l , Data St ru c tures using C & C++ , PHI4 . L ipschu t z , Da t a St ruc t u r e , TM H5. A dam Drozdek , Da t a St ruc t u r es and A lgo r i t hm s in C++ , Thom son A sia6 . P al G . So renson , A n I n t r oduc t i on t o Da t a St ruc t u r es w i t h A pp l i cat i on , TM H.

L T P

3 1 0


17/21



17

MCA-203 - COMPUTER ORGANIZATION

Objectives: The ob jec t i ve o f t h i s cou rse i s t o s t udy t he des ign op t i ons i n com pu t e r a r ch i t ect u r e and

organ izat ion. Th is course a lso inc lud es func t ion a l un i t s o f th e PC, basic w ork ing o f CPU, m emor yorgan izat ion and I / O dev ice etc .Prerequisites: Fundam enta l o f Com put ers Sys tems and Dig i ta l E lect ro n ics

Unit-I

Regi st er T r an sf er L an gu age, B us an d M e m or y T r an sf er s, B us A r ch i tect u r e, B us A r b it r at i on , A r it h m et i cL ogi c, Sh i ft M i cr o op er at i on , A r it h m et i c L ogi c Sh i ft U ni t , D esi gn o f Fast ad d r ess, A r it h m et i c A lgo r it h m s( ad d i t io n , su b t r act i on , B oo t h M u l t i p l ic at i o n) , I EEE st an d ar d f or F lo at i n g p o i nt n u m b e r s.

Unit-IIControl Design: H ar d w ir ed & M icr o Pr ogr am m ed ( Con tr ol Un it ): Fu nd am en tal Con cep ts ( Regi st erT r an sf er s, Per f or m i n g o f ar i t hm e ti c o r l ogi cal o per at i on s, Fet ch i ng a w o r d f r om m e m o r y, st o r in g a w o r din m em or y) , Execu ti on of a com p let e in st ru ct ion , M ul t i p le-B u s or gan izat ion , H ar dw i r ed Con tr ol ,

M icr o p ro gr am m ed co nt ro l( M icr o i nst r uct io n, M icr op ro gr am seq uen ci ng, W i de-Br an ch ad dr essi ng,M i c r o i n st r u c t i on w i t h N ex t - ad d r e ss f i el d , P r ef et c h in g M i c r o i n st r u c t i o n ) .

Unit-III

Processor Design: Pr ocessor Or gan izat ion : Gen er al r egi st er o rgan izat ion , St ack o rgan izat io n,A d d r e s si n g m o d e , I n st r u c t i o n f o r m a t , D a t a t r a n sf er & m a n i p u l at i o n s, P r o gr a m Co n t r o l , R ed u c ed I n st r u c t i onSe t Com pu t e r .Input-Output Organization: I / O I nt er face, M o des o f t r an sfer , I nt er r u pt s & I nt er r u pt h an dl in g, D ir ectM e m o r y a cc ess, I n p u t - Ou t p u t p r o c esso r , Ser i a l Co m m u n i c at i o n .

Unit -IV

Memory Organization: M em or y H ier ar ch y, M ain M em or y ( RAM an d ROM Ch ip s) , o r gan izat ion of 2 D

an d 21/ 2

D , A u x i li ar y m e m o r y , Ca ch e m e m o r y , V i r t u al M e m o r y , M e m o r y m a n ag em e n t h ar d w ar e .

Unit-V

Assembly LanguageProgramming

Text Book:1. Computer System Architecture, PHI/Pearson Education, 3

rdEdition, M. Morris Mano

2. Digital Computer Fundamentals , Tata McGraw Hill, 6th

Edition, Thomas C. Bartee

Reference Book:

1 . Co m p u t er Or g an i zat i o n, V r av i ce, Z ak y & H am a ch er ( T M H P u b l ica ti o n )

2 . St r u c t u r ed Co m p u t e r O r ga n iz at i o n , T a n n en b a u m ( P H I )

3 . Co m p u t e r Or g an i z at i o n , St al l i n g s( P H I)

4 . Co m p u t er Or g an i zat i o n, Jo h n P.H ay es ( M cGr a w H i l l)

L T P

3 1 0


18/21



18

MCA-204 - COMPUTER BASED NUMERICAL AND STATISTICAL TECHNIQUES

Objectives: W i t h t he cu r r en t dep loym en t o f com pu t e r t echno logy and t oo l s, i t i s ve r y im por t an t t o developef f ic ient a lgor i thms for so lv ing prob lems in sc ience, eng ineer ing, techno logy , insurance &bank ing. Thus , the ob jec t ive o f th is course is to enab le s tudents to obta in an in tu i t ive and

work ing unders tand ing o f numer ica l methods for the bas ic prob lems of numer ica l ana lys is andgain exper i ence in th e im plem entat ion o f num er ica l methods us ing a compu ter . They w ould a lsoga in an appr ecia t ion o f th e concept o f er ror in th ese method s and t he need to ana lyze and pr ed ic ti t .

Prerequisites: Basic know ledge o f func t ions , logar i thm ic , t r igonom et r ic and expon ent ia l func t ions , graph ofa func t ion, po lyn om ia ls , and root s o f a po lynom ia l , d i f fe rent ia t ion and in tegra t ion .

Unit-I

Floating point Arithmetic: Repr esenta t ion o f f loa t ing po i n t num bers , Operat ions , Nor m al izat ion, P i t fal ls o ff l oat i ng po in t r ep resen t a t i on , Er r o r s i n num er i cal com p u t a t i onIterative Methods: Zeros o f a s ing le t ranscendenta l equat ion and zeros o f po lynomia l us ing B isec t ionMethod , I te ra t ion M ethod, Regula-Fals i m ethod, Newto n Raphson m ethod, Secant m ethod, Rate o fconvergence o f i t e ra t ive m ethods .

Unit-II

Simultaneous Linear Equations: So lu t i ons o f system of L inear equat ions , Gauss E l im i nat ion d i r ect m ethodand p ivot i ng, I l l Condi t io ned system of equat ions , Refinem ent o f so lu t ion. Gauss Se ida l i t e ra t ive m ethod, Rateof Conv ergenceInterpolation and approximation: F in i te D i f fe rences, D i f fe rence tab les,Po lynom ia l In t erpo la t ion : Newt on sforw ard and backw ard form ula ,Cent ra l D i f fe rence Form ulae: Gauss forw ard and backw ard form ula , St i r l ing s,Bessel s , Everet t s form ula.Interpolation with unequal intervals: Langranges In terpo la t ion, Newton D iv ided d i f fe rence formula ,

Herm i te s In ter po la t ion ,App rox im at ion o f func t ion by Tay lor s ser i es and Chebyshev po lynom ia l

Unit-III

Numerical Differentiation and Integration: I n t r oduc t ion , Num er ica l D i f fe rent ia t ion, Num er ica l In t egra t ion,Trapezo ida l r u le , Sim psons ru les, Boo le s Rule , W eddle s Rule Eu ler - Mac laur in Form ulaSolution of differential equations: P icard s Method , Eu ler s Method , Tay lor s Method, Runge-Kut ta m ethods ,Pred i c t o r - co r r ect o r m e t hod , A u t om at i c e r ro r m on i t o r i n g , s t ab i l i t y o f solu t i on .

Unit-IV

Curve fitting, Cubic Spline and Approximation: Method o f leas t squares , f i t t ing o f s t ra ight l ines ,po lyn om ia ls , exponent ia l cur ves etcFrequency Chart: D i f ferent f requency char t l i ke H i s togram, Frequency cur ve, P i -char t .Regression analysis: L inear and Non - l inear r egress ion, m ul t i p le regressions

References:

1 . Raja ram an V ., Com pu t e r Or ien t ed Num er i cal M e t hods , PH I2 . Gerald & Wh eat ley , A pp l i ed Num er i cal A na lyses , A W3. Ja in , I yengar and Ja in , Num er ica l Methods for Sc ient i f i c and Engineer in g Com put at ions , New Age In t .4 . Grew al B . S., Num er ica l meth ods in Eng ineer in g and Sc ience , Khanna Publ ishers , De lh i5 . T . Veera ra jan , T Ram achandr an , Theory and P rob lem s in Num er i cal M e t hods , TM H6. P rad ip N iyog i , Num er i cal A na lysi s and A lgor i t hm s , TM H

L T P

2 0 0


19/21



19

MCA 205 - OPERATING SYSTEM

Objectives: To p r ov ide an unders t and ing o f t h e f unct i ons o f ope ra t i ng sys t em s . To p r ov ide an i ns igh t i n t o i n t e rn a l s and f unc t i ona l m odu les o f opera t i ng syst em s . To s t udy t he concep t s unde r l y ing t he des ign and im p lem en t a t i on o f ope ra t i ng sys t em s .

Prepare a base for advanced sub jec ts in Comp uter Sc ience and Ap pl ica t ions .

Prerequisites: B as i c know ledge o f Com pu t e r ha rdw are and so ft w a re K now ledge o f p rog ram m in g l anguage l i ke C/ C++

Unit-I

I n t r oduc t ion : Operat ing Sys tem and Func t ion, Evo lu t ion o f Operat ing System , Batch, In ter act ive , T ime Shar i ngand Real Time System, System Protect ion. Operat ing System Structure: System Components, SystemStr uctu r e, Operat i ng System Serv ices.

Unit-II

Concur r ent Processes: Process Concept , Pr in c iple of Concur r ency, Prod ucer / Consum er Prob lem , Cr i t ical

Sect ion, Problem, Semaphores, Classical Problems in Concurrency, Inter Processes Communicat ion, ProcessGenerat i on, Process Schedul ing.

Unit-III

CPU Schedul ing: Schedul ing Concept , Performance Cr i ter ia Schedul ing Algor i thm, Evolut ion, Mult iprocessorSchedul ing. Deadlock: System Model, Deadlock Character izat ion, Prevent ion, Avoidance and Detect ion,Recovery f rom Deadlock .

Unit-IV

M em ory M anagem en t : B as i c M ach ine , Res iden t M on i t o r , M u l t i p rog ram m ing w i t h F i xed P a r t i t i on ,Mul t ip rogramming Wi th Var iab le Par t i t ion , Mul t ip le Base Regis ter , Pag ing, Segmentat ion, PagedSegmentat ion, V i r tu a l ' M emor y Concept , Demand Paging, Per for m ance,Paged Replaced A lgor i thm, A l locat ion o f Frames, Thrash ing, Cache Memory Organ izat ion, Impact onPer formance.

Unit-V

I / O Managem ent & D isk Schedul ing: I / O Dev ices and th e Organ izat ion o f I / O Disk I / O, Operat ing Sys temDesign Issues. Fi le System: Fi le Concept , Fi le Organizat ion and Access Mechanism, Fi le Director ies, Fi leShar in g, Impl ementat ion I ssues .

Text Books:

1. Sta l l ing , Wi l l i um , "Operat in g Sys tem", Maxw el l M acm i l lan2. Si lv eschatza, Peterson J, "Operat i ng System Concept s", Wi l ley.3 . Tannenbaum , "Operat ing Sys tem Des ign and I m plem entat ion" , PHI .

References Books:1. M i lenekov ie , "Operat ing Sys tem Concept " , McGraw Hi l l .

2. Petersons, "Oper at in g System s", Add is ion W esley.3 . D ie ta l , "An I n t r oduc t ion to Operat ing System" , Add i s ion W esley .4 . Gary N ut t , "Operat ing Sys tem, A Mod ern Perspect ive" , Add is ion W esley .5 . Crow ley , "Operat ing System" , TMH.

L T P

3 1 0


20/21



20

MCA-206 - OBJECT ORIENTED PROGRAMMING

OBJECTIVES:

Java play a predominant role in software development it is felt that the following objectives can be achieved afterstudying this subject.

i) Understand the concepts of Object oriented Programming.

ii) Write simple applications using Java.

iii) Compare and contrast features Java.Prerequisites: Fundamental programming knowledge in C.

Unit I

Object Modeling: Objects and classes, links and association, generalization and inheritance, aggregation, abstract

class, multiple inheritance, meta data, candidate keys, constraints..

Unit IIDynamic Modeling: Events and states, operations, nested state diagrams and concurrency, advanced dynamic

modeling concepts, a sample dynamic model

Functional Modeling: Data flow diagram, specifying operations, constraints, a sample functional model.OMT

(object modeling techniques) methodologies, examples and case studies to demonstrate methodologies, comparisons

of methodologies, SA/SD, JSD.

Unit III

Java Programming: Introduction, Operator, Data types, Variables, Methods & Classes, Multithread Programming,

I/O, Java Applet.

Unit IV

Java Library: String Handling, Input/Output exploring Java.io, Networking, Exception Handling, Event Handling,Introduction to AWT, Working with window, Graphics, AWT Controls, Layout Manager and Menus, Images.

Unit V

Software Development using Java:

Java Swing, Migrating from C++ to java, Application of java, JDBC.

Text Books:

1. Herbert Schieldt, The Complete Reference: Java, TMH, 7th

Edition.

2. E. Balagurusamy, Programming in JAVA, TMH, 4th

Edition.

3. James Rumbaugh etal, Object Oriented Modeling and Design, PHI

References:1. Bjarne Stroustrup, C++ Programming Language, Addison Wesley, 3

rdEdition.

2. E. Balagurusamy, Object Oriented Programming ,TMH, 2008.

3. Sharma, Pant, Vaisla, Object Oriented Systems and C++, Firewall Media, 2008

L T P

3 1 0


21/21



MCA 211 - Data Structure lab

List of Experiment:

1 . M a t r i x Opera t i ons -A dd , M u l t i p l y , Rank , De t .e t c.2 . St a ck & Q u e u e o p er a t i on s u si n g A r r a y s.3 . Se l f- r e f eren t i a l st r uc t u r es & s ing le l i nked l i st opera t i ons .4 . I m p l e m e n t i n g St a ck a n d q u e u es u si n g l i n k ed l i st s.

5 . I m p l e m e n t i n g Po l i sh N o t a t i on s u si n g St a ck s .6 . Ci r c u l ar a n d d o u b l e l i n k ed l i st o p er a t i o n s.7 . I m p l e m e n t i n g p r i o r i t y q u eu e & d e q u eu e u si n g l i st s.8 . E va lu a t in g p o l yn o m i a l o p er a t i o n s u si n g L i n k ed l i st s.9 . I m p l e m e n t i n g se t r el at ed o p er a t i o n s & H a sh i n g .10 . l i near & b ina ry sea rch , bubb le so r t t echn ique .11 . I nser t i on sor t , se lec t i on so r t & m erge so r t t echn iques .12 . Qu ick so r t , coun t i ng so r t and She l l sor t t echn iques .13 . Rad ix ( bucke t ) and add ress cal cu lat i on so r t m e t hods.14 . B ina ry t r ee t r aversal s ( p r eo rde r , i no rd e r , post o rd e r ) .1 5 . H e ap s o r t & A V L t r e e i m p l e m e n t at i o n s.16 . Graph rep resen t a t i on w i t h m a t r i x & ad jacency l i st s .

MCA-212 - Computer Based Numerical & Statistical Techniques Lab

Write Programs in C Language:

1 . T o d ed u c e er r o r e n v o l v ed i n p ol y n o m i a l e q u at i o n .2 . To F ind ou t t he roo t o f t he A lgeb ra i c and T ranscenden t a l equa t i ons us ing B isect i on , Regu la -f al s i ,

New ton Raphson and I te ra t ive M ethods . A lso give the ra te of conver gence o f root s in tabu lar fo rm foreach o f t hese methods .

3 . T o im p l e m e n t N ew t o n s F or w a r d a n d B ac k w a r d I n t er p o l a t i on fo r m u l a .4 . To im p lem en t Gauss Fo rw ard and B ackw ard , B esse l s , St e r l i ng s and E ve r t t s I n t e rpo la t i on f o rm u la5 . T o i m p l em e n t N e w t o n s D i v i d ed D i f f er e n ce an d L a n g r an g es I n t er p o l a ti o n f o r m u l a .6 . T o i m p l em e n t N u m e r i ca l D if fer e n ti at i o ns.7 . T o i m p l e m e n t N u m e r i c al I n t e gr a t i o n u si n g T r a p ez oi d a l, Si m p s o n 1 / 3 a n d Si m p s o n 3 / 8 r u l e .

8 . T o i m p l e m e n t L ea st Sq u ar e M e th o d f or c u r v e f i t t i n g.9 . To d raw f r equency char t l i ke h i st og ram , f r equency cu rv e and p ie -char t e t c.10. To est im ate regression equat ion f r om sampl ed data and eva luate va lues o f standard d ev ia t ion, t -

s ta t ist ics , regression coef f ic ient , va lue o f R2 for a t leas t tw o i ndependent var iab les .

MCA 213 - Object Oriented Programming Using Java Lab

L T P

1. To become familiar with classes that represent entities that can interact with the user.

2. To successfully write simple programs that involve if statements.

3. To gain practice in the use of Boolean operators like && and ||.

4. To construct a class that represents a simple ATM (automatic teller machine).5. Write a new program called Options.java that will request that the user enter an integer and then will

display the message .positive,. .negative,. or zero. if the value that was entered was greater than zero,

less than zero, or equal to zero, respectively.

6. Write a simple program called RandomGeneration.java that will request N, the number of values

desired, and then generate a list of N random double values. Use a ViewFrame for input and output.7. Write program for Java Applets.

8. Use Java Servlets for proxy server.

L T P

0 0 2

L T P0 0 2

L T P

0 0 2

Mca i Year Syllabus 1

Documents

Transcript of Mca i Year Syllabus 1