MCA Syllabus 2011

8/10/2019 MCA Syllabus 2011

1/39

I SEMESTER

Accounting & Financial Management

Subject Code: MCA110 CIE: 50

Hour!"ee#: Teac$ing % SEE: 100

Total Teac$ing Hour: %5 Eam Hour: '

(nit I ) Hour

Financial Accounting: An Overview Accounting concepts, Principles & Standards,

Journals, Ledger posting, Trial Balance.

(nit II ) Hour

Final Account: Trading Account, Profit & Loss Account and Balance Sheet Si!ple

Pro"le!s#.

(nit III ) Hour

Fundamental o* Cot Accounting: $ature of cost accounting, O"%ectives, Advantages of

cost accounting, ethods of costing, T'pes of costing, (le!ents of cost fi)ed, varia"le &

!i)ed cost, *ost sheet or cost state!ent & "udgetar' control, *lassification of "udgets, +i)ed

& fle)i"le "udgets.

(nit I+ ) Hour

"or#ing Ca,ital Management: eaning, eter!inants of wor-ing capital, esti!ating the

wor-ing capital, cash flow & funds flow state!ents.

(nit + ) Hour

Ca,ital -udgeting: $ature of invest!ent decisions, nvest!ent evaluation criteria, *apital

Budgeting Process, (valuation Techni/ues, PBP, $P0.

Tet -oo#:

1. Jawahar Lal, Accounting for anage!ent, 2i!ala'a Pu"lishing, 3 th edition, 4556*hapters 1, 4, 7, 3, 8, 6, 9, 15, 11, 14, 17, 43, 48, 49#

4. Pande', +inancial anage!ent, 0i-as Pu"lishing, :thedition, 4558 *hapters ;,

48, 49#

Re*erence -oo#:

1. A $ aheshwari, +inancial & anage!ent Accounting, Sultan *hand & Sons, 4558.

4.


2/39

I SEMESTER

.icrete Mat$ematic

Subject Code: MCA1/0 CIE: 50



(nit I 5 Hour

Set T$eor: Sets and Su"sets, Set Operations and the Laws of Set Theor', *ounting and

0enn iagra!s, A +irst =ord on Pro"a"ilit', *ounta"le and ?ncounta"le Sets

(nit II 1/ Hour

Fundamental o* ogic: Basic *onnectives and Truth Ta"les, Logic (/uivalence The Laws

of Logic, Logical !plication


3/39

I SEMESTER

Fundamental o* Com,uter 6rgani7ation

Subject Code: MCA1'0 CIE: 50

Hour!"ee#: Teac$ing % ab / SEE: 100


(nit I ) Hour

8umber Stem and ogic 4ate: *ounting in eci!al and Binar', Place 0alue, Binar' to

eci!al *onversion, eci!al to Binar' *onversion, 2e)adeci!al $u!"ers, Octal $u!"ers,

Bits, B'tes, $i""les, and =ord SiGe, The A$ >ate, The O< gate, The inverter and Buffer,

The $A$ gate, the $O< >ate, The e)clusive O< gate, The ()clusive $O< >ates, The

$A$ >ate as an universal >ate, >ates with ore than two inputs, ?sing nverters to

convert gates.

Combining ogic 4ate and Arit$metic Circuit: *onstructing *ircuits fro! Boolean()pression, rawing a circuit fro! a a)ter! Boolean ()pression, Truth Ta"les and

Boolean ()pressions, Sa!ple Pro"le! Si!plif'ing Boolean()pression, Carnaugh aps,

Carnaugh aps with three varia"les, Carnaugh aps with four varia"les, !ore Carnaugh

aps, using e!organEs Theore!, Binar' Addition, 2alf Adders, +ull Adders, Three Bit

Adders, Binar' Su"traction, Parallel Su"tractors, * Adders, Binar' ultiplication, Binar'

ultipliers, 4s *o!ple!ent $otation, Addition and Su"traction, 4s *o!ple!ent

addersHsu"tractor

(nit II ) Hour

-aic Structure o* Com,uter: *o!puter T'pes, +unctional ?nits, Basic Operational*oncepts, Bus structures, Perfor!ance, e!or' Location and Addresses

Mac$ine Intruction and 3rogram: e!or' Operations, nstructions & nstruction

Se/uencing, Addressing odes, Asse!"le Language, Basic nputHOutput Operations

(nit III ) Hour

In,ut!6ut,ut 6rgani7ation: Accessing HO evices, nterrupts, irect e!or' Accesses,

Buses, nterface *ircuits

(nit I+ ) Hour

Memor Stem: So!e Basics concepts, Se!iconductors


4/39

Tet -oo#:

1. To-hei!F igital (lectronics Principles and Applications, c>raw 2ill, 6th(dition,

4553.

*haptersF 4.1 to 4.3, 4.6 to 4.;, 7.1 to 7.15, 3.1 to 3.:, 3.16, 15.1 to 15.11#

4. *arl 2a!acher, D 0arnesic and S Da-'F *o!puter OrganiGation, 8th(dition, c>raw

2ill, 4554. *haptersF 1.1 to 1.3, 1.6, 4.4 to 4.9, 3.1, 3.4, 3.3 to 3.6, 8.1 to 8.8, 8.9,

6.1 to 6.9#

Re*erence -oo#:

1. orris anoF igital Logic and *o!puter esign, 15th (dition, Pearson

(ducation, 455;.

4. orris ano, and *harles < Ci!eF Logic and *o!puter esign +unda!entals, 4nd

(dition, Pearson (ducation, 4551.

3


5/39

I SEMESTER

IT and .igital Electronic aborator

3ART 9 A

Eercie on 6**ice Tool

8ote: Eercie on t$e *olloing to,ic to be conducted in t$e laborator uing an o*

t$e ;er idel ued current o*tare ,ac#age

"ord 3roceing

*reation of word docu!ent, for!atting and editing te)t, inserting headers and footers, ?se of

ail!erge facilit'

S,read9$eet

Building and editing spreadsheet, for!atting spreadsheet, wor-ing with for!ulas and

functions, sort or filter spreadsheet, wor-ing with charts, and auto!ating spreadsheet tas-s

with !acros

Com,uter 3reentation

Learning co!!ands, Preparation of slides, inserting te)ts, graphs, etc., color changing,

auto!atic presentation of slides, changing ti!e settings, o"%ect lin-ing and e!"edding, etc

3ART 9 -

Eercie on .igital Electronic

1.


6/39

I SEMESTER

3roblem Sol;ing (ing C

Subject Code: MCA1%0 CIE: 50



(nit I < Hour

Algorit$m and Floc$art: The !eaning of algorith!s, +lowcharts and their need, =riting

algorith!s and drawing flowcharts for si!ple e)ercises li-e finding "iggest of three nu!"ers,

to find roots of given /uadratic e/uation, to find the "iggest and s!allest of given set of

nu!"ers and such other si!ple e)a!ples

Contant +ariable and .ata T,e: *haracter set, * to-ens, -e'words & identifiers,

structure of * progra!, e)ecuting a * progra!. *onstants, varia"les, data t'pes, declaration

of varia"les, declaration of storage classes, assigning values to varia"les defining s'!"olic

constants, declaring a varia"le as constant, declaring a varia"le as volatile, overflow andunderflow of data.

6,erator and E,reion: Arith!etic operators, relational operators, logical operators,

assign!ent operator, incre!ent and decre!ent operator, conditional operator, "itwise

operators, co!!a operator, special operators, arith!etic e)pressions, evaluation of

e)pressions, precedence of arith!etic operators, t'pe conversions in e)pressions, operator

precedence and associativel', !athe!atical functions

Managing In,ut and 6ut,ut 6,eration: Thescanf() & printf()functions for input and

output operations, reading a character, writing a character, the getchar() & putchar()

functions# , the address operator, for!atted input and output using for!at specifiers,=riting si!ple co!plete * progra!s.

Control Statement: ecision !a-ing with if state!ent, si!ple if state!ent, the if..else

state!ent, nesting of if..else state!ents, the else..if ladder, the switch state!ent, the ?:

operator, thegotostate!ent, the "rea- state!ent, progra!!ing e)a!ples

(nit II 1/ Hour

oo, Control Structure: The while state!ent, the doMwhile state!ent, the for state!ent,

nested loops, %u!ps in loops, the continue state!ent, progra!!ing e)a!ples

Arra: The !eaning of an arra', one di!ensional and two di!ensional arra's, declarationand initialiGation of arra's, reading , writing and !anipulation of a"ove t'pes of arra's,

!ultidi!ensional arra's, d'na!ic arra's, progra!!ing e)a!ples.

C$aracter Arra and String: eclaring and initialing string varia"les, reading string fro!

ter!inal, writing string to screen, arith!etic operations on characters, putting strings together,

co!parison of two strings, string handling functions, ta"le of strings, other features of strings,

progra!!ing e)a!ples.

(nit III < Hour

(er .e*ined Function: $eed for user defined functions, a !ulti function progra!,

ele!ents of ?ser defined functions, defining functions, return values and their t'pes, function

6


7/39

calls, function declaration, categor' of functions, no argu!ents and no return values,

argu!ents "ut no return values, argu!ents with return values, no argu!ents with return value,

functions that return !ultiple values, nesting of functions, recursion, passing arra's to

functions, passing string to functions, progra!!ing e)a!ples.

Structure and (nion: efining a structure, declaring structure varia"les, accessing

structure !e!"ers, structure initialiGation, cop'ing and co!paring structure varia"les,

operations on individual !e!"ers, arra' of structures, structures within structures, structures

and functions, ?nions, siGe of structures, "it fields, progra!!ing e)a!ples

(nit I+ < Hour

3ointer: ?nderstanding pointers, accessing the address space of a varia"le, declaring and

initialiGation pointer varia"les, accessing a varia"le through its pointer, chain of pointers,

pointer e)pressions, pointers and arra's, pointer and character strings, arra' of pointers,

pointer as function argu!ents, functions returning pointers, pointers to functions, pointers and

structures, progra!!ing e)a!ples

(nit + ) Hour

File Management in C: efining and opening a file, closing a file, inputHoutput operations

on files, error handling during HO operations, rando! access files, co!!and line argu!ents,

progra!!ing e)a!ples.

.namic Memor Allocation: 'na!ic !e!or' allocation, allocating a "loc- of !e!or'F

!alloc,allocating !ultiple "loc-s of !e!or'F calloc, releasing the used spaceFFree, altering

the siGe of a "loc-F realloc, progra!!ing e)a!ples

T$e 3re,roceor: ntroduction, !acro su"stitution, files inclusion, co!piler controldirectives, A$S additions, progra!!ing e)ercises.

Tet -oo#:

1. Balagurusa!'F Progra!!ing in A$S *, 3th(dition, Tata c>raw 2ill, 455;.

*haptersF 4, 7, 3, 8, 6, 9, ;, :, 15, 11, 14, 17.117.6 & 13#

4. 0 raw 2ill, 4556.

9


8/39

I SEMESTER

C 3rogramming aborator

3art A

1. a. =rite a progra! to find the area of a triangle >iven the three sides#.

". =rite a progra! to find the area of a circle >iven the radius#.

4. =rite a progra! to find the Si!ple interest, given the principle, ti!e and rate of

interest with appropriate validations.

7. =rite a progra! to find out whether a given 'ear is a leap 'ear or not.

3. =rite a progra! to find the roots of a /uadratic e/uation with appropriate error

!essages.

8. =rite a progra! to displa' the following files of current director'.

i#=(I( files ii# =BAT files iii#=OBJ files iv# =BAC files.B' using s'ste! OS co!!and.

6. =rite a progra! to find >* and L* of given two nu!"ers.

9. =rite a progra! to find the value of Sin )# using the series.

Sin )# K ) )7H7N )8H8N )9H9N MMMMM.

;. =rite a progra! to print all pri!e nu!"ers "etween ! and n.

.

:. =rite a progra! to reverse a nu!"er and chec- whether it is palindro!e or $ot.

15. =rite a progra! to generate and print first n +i"onacci nu!"ers using function.

11. =rite a progra! to find a factorial of a given nu!"er using recursive function.

14. =rite a progra! to convert ?PP(


9/39

7. =rite a progra! to input $ nu!"ers integers or real# and store the! in an arra'.

*onduct a Linear search for a given -e' nu!"er and report success or failure in the

for! of a suita"le !essage.

3. =rite a progra! to sort $ nu!"ers in ascending or descending order using "u""le

sort.

8. =rite a progra! to accept $ nu!"ers sorted in ascending order and search for a

given nu!"er using "inar' search.


10/39

I SEMESTER

Introduction to (8I>

Subject Code: MCA150 CIE: 50



(nit I 10 Hour

4eneral 3ur,oe (tilitie:"anner, cal, date, calendar, who, printf, tt', stt', una!e, passwd,

loc-, echo, tput, "c, script, spell and ispell.

8a;igating t$e File Stem:The file, whatEs in a filena!eQ the parentchild relationship,

pwd, the 2o!e director', A"solute pathna!es, using a"solute pathna!es for a co!!and, cd,

!-dir, r!dir,


11/39

(nit + ? Hour

Eential Stem Adminitration: root, ad!inistartorEs privileges, startup & Shutdown,

!anaging dis- space, cpio, tar

a#9Ad;anced Filter:Si!ple aw- +iltering, Splitting a Line in to +ields, printf, the Logical

and $ and

($ Positional Para!eters, get line, Builtin varia"les, Arra's, +unctions, nterface with the

Shell, *ontrol +low.

Ad;anced S$ell 3rogramming: The sh co!!and, e)port, cd, the *o!!and, e)pr,

*onditional Para!eter Su"stitution, erging Strea!s, Shell +unctions, eval, ()ec State!ent.

Tet -oo#:

1. Su!ita"ha asF ?$I *oncepts and Applications, 3 th(dition, Tata c>raw 2ill,

4556.

*haptersF 1, 4, 7, 3, 8, 6, 9, ;, :, 15, 11, 14, 17, 13, 18, 41#4. BehrouG A +orouGan and il"ergF ?$I and Shell Progra!!ing, *engage

Learning, 4558. *hapterF 3#

Re*erence -oo#:

1. Cenneth


12/39

I SEMESTER

(8I> 3rogramming aborator

1. a. =rite a nonrecursive shell script which accepts an' nu!"er of argu!ents and prints

the! in the reverse order +or e)a!ple, if the script is na!ed rags, then e)ecuting

args A B * should produce * B A on the standard output#.

". =rite a shell script that accepts two file na!es as argu!ents, chec-s if the

per!issions for these files are identical and if the per!issions are identical, output

co!!on per!issions and otherwise output each file na!e followed "' its

per!issions.

4. a =rite a shell script that ta-es a valid director' na!e as an argu!ent

and recursivel' descend all the su"directories, finds the !a)i!u! length of an' file

in that hierarch' and writes this !a)i!u! value to the standard output.

". =rite a shell script that accepts a path na!e and creates all the co!ponents in that

path na!e as directories. +or e)a!ple, if the script is na!ed !pc, then the co!!and

!pc aH"HcHd should create directories a, aH", aH"Hc, aH"HcHd.

7. a. =rite a shell script which accepts valid login na!es as argu!ents and prints their

corresponding ho!e directories, if no argu!ents are specified, print a suita"le error

!essage.

". =rite shell script to i!ple!ent ter!inal loc-ing si!ilar to the loc- co!!and#. t

should pro!pt the user for a password. After accepting the password entered "' the

user, it !ust pro!pt again for the !atching password as confir!ation and if !atch

occurs, it !ust loc- the -e'word until a !atching password is entered again "' the

user, $ote that the script !ust "e written to disregard B


13/39

". =rite a shell script that delete all lines containing a specific word in one or !ore file

supplied as argu!ent to it.

:. a. =rite a shell script that gets e)ecuted displa's the !essage either V>ood orningW or

V>ood AfternoonW or V>ood (veningW depending upon ti!e at which the user logs in.

". =rite a shell script that accept a list of filena!es as its argu!ent, count and report

occurrence of each word that is present in the first argu!ent file on other argu!ent

files.

15. a. =rite a shell script that deter!ine the period for which a specified

user is wor-ing on s'ste!.

". =rite a shell script that reports the logging in of a specified user within one !inute

after heHshe log in. The script auto!aticall' ter!inate if specified user does not log in

during a specified period of ti!e.

11. a. =rite a shell script that accepts two integers as its argu!ent and co!pute the value of

first nu!"er raised to the power of second nu!"er.

". =rite a shell script that accept the file na!e, starting and ending line nu!"er as anargu!ent and displa' all the lines "etween the given line nu!"er.

14. a. =rite a shell script that folds long lines into 35 colu!ns. Thus an'

line that e)ceeds 35 characters !ust "e "ro-en after 35 th, a VXW is to "e appended as

the indication of folding and the processing is to "e continued with the residue. The

input is to "e supplied through a te)t file created "' the user.

". =rite an aw- script that accepts date argu!ent in the for! of !!dd'' and displa's

it in the for! if da', !onth, and 'ear. The script should chec- the validit' of the

argu!ent and in the case of error, displa' a suita"le !essage.

17. a. =rite an aw- script to delete duplicated line fro! a te)t file. The order of the original

lines !ust re!ain unchanged.". =rite an aw- script to find out total nu!"er of "oo-s sold in each discipline as well

as total "oo- sold using associate arra' down ta"le as given "elow.

i. (lectrical 73

ii. echanical 69

iii. (lectrical ;5

iv. *o!puter Science 37

v. echanical 68

vi. *ivil 1:;

vii. *o!puter Science 63

13. =rite an aw- script to co!pute gross salar' of an e!plo'ee accordingl' to rule given

"elow.f "asic salar' is 15555 then 2


14/39

II SEMESTER

-uine .ata 3roceing it$ C6-6

Subject Code: MCA/10 CIE: 50



(nit I ) Hour

T$e -aic: An introduction to structured progra! design in *OBOLF The nature of

*OBOL, A histor' of *OBOL and their A$S versions.

The dentification and (nviron!ent ivisionsF Basic Structure of a *OBOL progra!, coding

re/uire!ents of the dentification ivision, the Sections of the (nviron!ent ivision,

Assigning files to evices in the (nviron!ent ivision.

The ata divisionF +or!ing datana!es, the file section of the data division, T'pes of data,

the wor-ingstorage section of the data division.

*oding co!plete *OBOL progra!sF The for!at of the procedure division, State!ents

t'picall' coded in the !ain !odule of "atch progra!s, State!ent t'picall' coded in full'

interactive progra!s, State!ent t'picall' coded for processing "atch files.

(nit II ) Hour

.eigning Structured ,rogram: oving data, Printing infor!ation and displa'ing output

interactivel'F The instruction for!ats of the O0( state!ents, $u!eric O0(, $on

nu!eric or Alphanu!eric nu!eric O0( , Other options of the O0( state!ents,

producing printed output and screen displa's, ispla'ing output interactivel' using screen

input and output, iscussion of an interactive solution to progra!!ing assign!ents.

*o!puting in *OBOLF The "asic arith!etic ver"s, options availa"le with arith!etic ver"s,

the co!pute state!ents, ?se of signed nu!"ers in arith!etic operations, intrinsic functions

ecision !a-ing using the + and (0AL?AT( state!entsF Selection using a si!ple +

state!ent, selection using other options of the + state!ents, using + state!ents to deter!ine

leap 'ears, *ondition na!es, (0AL?AT( state!ents.

(nit III ) Hour

"riting Hig$ e;el C6-6 3rogramF terationF the si!ple P(


15/39

updating, Se/uential +ile updatingreviewing records on dis-, The


16/39

II SEMESTER

C6-6 3rogramming aborator

1. =rite a progra! for the followingF

a. (valuate the following e/uation using *OP?T( ver".

DKA B# *

". To +ind the su! of individual digits in the given YnE digit deci!al nu!"er.

4. =rite a progra! for the followingF

a. >enerating odd and even nu!"ers "etween the given li!its "' using P(


17/39

II SEMESTER

6bject 6riented 3rogramming it$ C@@

Subject Code: MCA//0 CIE: 50



(nit I ) Hour

IntroductionF Overview of *, Sa!ple * progra!, ifferent data t'pes, operators,

e)pressions, and state!ents, arra's and strings, pointers & userdefined t'pes, +unction

*o!ponents, argu!ent passing, inline functions, function overloading, recursive functions

(nit II ) Hour

Clae & 6bject: *lass Specification, *lass O"%ects, Scope resolution operator, Access

!e!"ers, efining !e!"er functions, ata hiding, *onstructors, estructors, Para!eteriGed

constructors, Static data !e!"ers, +unctions@ +riend functions, Passing o"%ects as argu!ents,eneric functions and classes, Applications, Operator overloading using friend functions such

as , , preincre!ent, postincre!ent, R etc., overloading , UU.

(nit III ) Hour

In$eritance: Base *lass, nheritance and protected !e!"ers, Protected "ase class

inheritance, nheriting !ultiple "ase classes@ *onstructors, estructors and nheritance,

Passing para!eters to "ase class constructors, >ranting access, 0irtual "ase classes

(nit I+ ) Hour

+irtual *unction 3olmor,$imF 0irtual function, calling a 0irtual function through a "ase

class reference, 0irtual attri"ute is inherited, 0irtual functions are hierarchical, Pure virtual

functions, A"stract classes, ?sing virtual functions, (arl' and late "inding.

(nit + ) Hour

I!6 Stem -aic File I!0: * strea! classes, +or!atted HO, HO !anipulators, fstrea!

and the +ile classes, +ile operations

Ece,tion Handling ST: ()ception handling funda!entals, ()ception handling options,

STLF An overview, containers, vectors, lists, !aps.

Tet -oo#:

1. 2er"ert Schildt, The *o!plete raw 2ill, 4557.

Re*erence -oo#:

1. Stanle' B.Lipp!ann, Josee La%oreF * Pri!er, 3th(dition, Pearson (ducation, 4558.

4. Paul J eitel, 2arve' eitelF * for Progra!!ers, Pearson (ducation, 455:.

7. C < 0enugopal,


18/39

II SEMESTER

C@@ aborator

1. >iven that an (PLO(( class contains the following !e!"ersF

a. ata e!"ersF (!plo'eeZ$u!"er, (!plo'eeZ$a!e, Basic, A, T, $etZSal

". e!"er +unctionsF to read data, to calculate $etZSal and to print data

!e!"ers

4. =rite a * progra! to read data on $ e!plo'ees and co!pute the $etZSal of each

e!plo'ee A K 84 of Basic and nco!e Ta) K 75 of the gross salar'#

7. efine a ST?($T class with ?S$, $a!e, and ar-s in 7 tests of a su"%ect.

eclare an arra' of 15 ST?($T o"%ects. ?sing appropriate functions, find the

average of the two "etter !ar-s for each student. Print the ?S$, $a!e and the

average !ar-s of all the students.

3. =rite a * progra! to create a class called *OPL(I and i!ple!ent the

following overloading functions A that return a co!ple) nu!"erFa. Aa, s4# where YaE is an integer real part# and s4 is a co!ple) nu!"er

". As1, s4# where s1 and s4 are co!ple) nu!"ers

4. =rite a * progra! to create a class called LST lin-ed list# with !e!"er

functions to insert an ele!ent at the front as well as to delete an ele!ent fro! the

front of the list. e!onstrate all the functions after creating a list o"%ect.

7. =rite a * progra! to create a te!plate function for uic-sort and de!onstrate

sorting of integers and dou"les.

3. =rite a * progra! to create a class called STA*C using an arra' of integers.

!ple!ent the following operations "' overloading the operators YE and YYFa. s1 K s1 ele!ent@ where s1 is an o"%ect of the class STA*C and ele!ent is an

integer to "e pushed on the top of the stac-

". s1 K s1 @ where s1 is an o"%ect of the class STA*C. YY operator pops the

ele!ent.

2andle the STA*C e!pt' and full conditions. Also displa' the contents of the stac-

after each operation, "' overloading the operator.

8. =rite a * progra! to create a class called AT(. Accept two valid dates in the

for! ddH!!H''. !ple!ent the following operations "' overloading the operators YE

and YY. After ever' operation displa' the results "' overloading the operator .

a. noZofZda's K d1 d4@ where d1 and d4 are AT( o"%ects, and noZofZda's is an

integer". d4 K d1 noZofZda's@ where d1 is a AT( o"%ect and noZofZda's is an integer

6. *reate a class called AT


19/39

". int ' K h -@ where h is an O*TAL o"%ect and - is an integer

ispla' the O*TAL result "' overloading the operator . Also displa' the

values of h and '.

;. =rite a * progra! to create a class called ?(?( with !e!"er functions to add

an ele!ent and to delete an ele!ent fro! the /ueue. ?sing the !e!"er functions,

i!ple!ent a /ueue of integers and dou"le. e!onstrate the operations "' displa'ing

the contents of the /ueue after ever' operation.

:. =rite a * progra! to create a class called LST dou"l' Lin-ed List# with

!e!"er functions to insert a node at a specified position and delete a node fro! a

specified position of the list. e!onstrate the operations "' displa'ing the content of

the list after ever' operation.

15. =rite a * progra! to create a class called ST?($T with data !e!"ers ?S$,

$a!e and Age. ?sing inheritance, create the classes ?>ST?($T and

P>ST?($T having fields as Se!ester, +ees and Stipend. (nter the data for at least

8 students. +ind the se!esterwise average age for all ?> and P> students separatel'.

11. =rite a * progra! to create a class called ST and i!ple!ent the following

operations. ispla' the results after ever' operation "' overloading the operator .

a. ST s1 K V0T?W

". ST s4 K VB(L>A?W

c. ST s7 K s1 s4 ?se cop' constructor#

14. =rite a * progra! to create a class called B$ZT


20/39

II SEMESTER

.ata Structure uing C

Subject Code: MCA/'0 CIE: 50



(nit I ) Hour

-ASIC C68CE3TS: Pointers and 'na!ic e!or' Allocation, Algorith! Specification,

ata A"straction, Perfor!ance Anal'sis, Perfor!ance easure!ent

ARRAS and STR(CT(RES: Arra's, 'na!icall' Allocated Arra's, Structures and

?nions, Pol'no!ials, Sparse atrices,


21/39

II SEMESTER

.ata Structure aborator

1. =rite a * Progra! to construct a stac- of integers and to perfor! the following

operations on itF

a. Push

". Pop

c. ispla'

The progra! should print appropriate !essages for stac- overflow, stac- underflow, and

stac- e!pt'.

4. =rite a * Progra! to convert and print a given valid parenthesiGed infi) arith!etic

e)pression to postfi) e)pression. The e)pression consists of single character operands

and the "inar' operators plus#, !inus#, !ultipl'# and H divide#.

7. =rite a * Progra! to evaluate a valid suffi)Hpostfi) e)pression using stac-. Assu!e that

the suffi)Hpostfi) e)pression is read as a single line consisting of nonnegative single digit

operands and "inar' arith!etic operators. The arith!etic operators are add#, su"tract#, !ultipl'# and H divide#.

3. =rite a * progra! using recursive function for the followingF

a. To calculate >* and L* of 4 integer nu!"ers.

". To solve Towers of 2anoi pro"le!.

c. To search an ele!ent in a list using "inar' search

8. =rite a * Progra! to si!ulate the wor-ing of a /ueue of integers using an arra'.

Provide the following operationsF

a. nsert

". elete

c. ispla'

6. =rite a * Progra! to si!ulate the wor-ing of a circular /ueue of integers using an arra'.

Provide the following operationsF

a. nsert

". elete

c. ispla'

9. =rite a progra! to design a priorit' /ueue which is !aintained as a set of /ueues

assu!e a !a)i!u! of 7 /ueues#. The ele!ents are inserted "ased upon the given

priorit'. The deletion of an ele!ent is to "e done starting fro! the 1 st/ueue, if it is not

e!pt'. f it is e!pt', the ele!ents fro! the 4nd/ueue will "e deleted and so on.

;. =rite a * Progra! using d'na!ic varia"les and pointers, to construct a singl' lin-ed list

consisting of the following infor!ation in each nodeF student id integer#, student na!e

character string# and se!ester integer#. The operations to "e supported areF

a. The insertion operation

i. At the front of a list

ii. At the "ac- of the list

iii. At an' position in the list

". eleting a node "ased on student id. f the specified node is not present in the list an

error !essage should "e displa'ed. Both the options should "e de!onstrated.

c. Searching a node "ased on student id and update the infor!ation content. f the

specified node is not present in the list an error !essage should "e displa'ed. Both

situations should "e displa'ed.

d. ispla'ing all the nodes in the list.

41


22/39

:. =rite a * Progra! using d'na!ic varia"les and pointers, to construct an ordered

ascending# singl' lin-ed list "ased on the ran- of the student, where each node consists

of the following infor!ation F student id integer#, student na!e character string# and

ran- integer#.

15. =rite a * Progra! using d'na!ic varia"les and pointers to construct a stac- of integers

using singl' lin-ed list and to perfor! the following operationsF

a. Push

". Pop

c. ispla'

The progra! should print appropriate !essages for stac- overflow and stac- e!pt'.

11. =rite a * Progra! to support the following operations on a dou"l' lin-ed list where each

node consists of integersF

a. *reate a dou"l' lin-ed list "' adding each node at the front.

". nsert a new node to the left of the node whose -e' value is read as an input.

c. elete the node of a given data, if it is found, otherwise displa' appropriate !essage.d. ispla' the contents of the list.

14. =rite a * Progra!

a. To construct a "inar' search tree of integers.

". To traverse the tree using inorder, preorder & postorder !ethods.

c. To displa' the ele!ents in the tree.

17. =rite a * Progra!s for searching an ele!ent on a given list of integers using the

a. Binar' Search.

". Linear search

13. =rite a * progra! to sort a list of $ integers using the /uic- sort algorith!.

18. =rite a * progra! to traverse the nodes in a graph using Breadth +irst Search.

44


23/39

II SEMESTER

Management In*ormation Stem

Subject Code: MCA/%0 CIE: 50



(nit I ) Hour

Stem Engineering: S'ste! concepts, s'ste! control, t'pes of s'ste!s, handling s'ste!

co!ple)it', *lasses of s'ste!s, >eneral !odel of S, $eed for s'ste! anal'sis, S'ste!

anal'sis for e)isting s'ste! & new re/uire!ent, s'ste! develop!ent !odel, S & s'ste!

anal'sis

In*ormation and Bnoledge: nfor!ation concepts, classification of infor!ation, !ethods

of data and infor!ation collection, value of infor!ation, infor!ationF A /ualit' product,

>eneral !odel of a hu!an as infor!ation processor, Cnowledge

(nit II ) Hour

Introduction o* MIS: SF *oncept, efinition,


24/39

.ata reource Management: anaging data sources, +oundation concepts of data, t'pes of

data"ases, traditional file processing, BS approach, ata"ase structure, ata"ase

develop!ent

Electronic -uine tem: (nterprise "usiness s'ste! ntroduction, crossfunctional

enterprise applications, real world case, +unctional "usiness s'ste!, ntroduction, !ar-eting

s'ste!s, sales force auto!ation, *, 2


25/39

II SEMESTER

6,eration Reearc$


Hour!"ee#: Teac$ing % Tutorial / SEE: 100


(nit I ) Hour

Introduction and 6;er;ie o* t$e 6R Modeling A,,roac$: The origin of Oraphical solution, the LP odel, Special cases of >raphical !ethod, assu!ptions

of Linear Progra!!ing LP#, additional e)a!ple

(nit II ) Hour

Sol;ing 33 9 t$e Sim,le Met$od: The essence of the si!ple) !ethod, setting up the

si!ple) !ethod, alge"ra of the si!ple) !ethod, the si!ple) !ethod in ta"ular for!, special

cases in the si!ple) !ethod, tie "rea-ing in the si!ple) !ethod, adopting to other !odel

for!s Two Phase !ethod, Big !ethod#, post opti!alit' anal'sis.

(nit III ) Hour

T$eor o* t$e Sim,le Met$od: +oundation of the si!ple) !ethod, the revised si!ple)

!ethod, a funda!ental insight

.ualit T$eor and Seniti;it Anali: The essence of dualit' theor', econo!ic

interpretation of dualit', pri!al dual relationship, adapting to other pri!al for!s, the role of

dualit' in sensitive anal'sis, the dual si!ple) !ethod

(nit I+ ) Hour

Tran,ortation and Aignment 3roblem: The transportation pro"le!, a strea! line

si!ple) !ethod for the transportation pro"le!, the assign!ent pro"le!, a special algorith!

for the assign!ent pro"le!

(nit + ) Hour

Meta$euritic: The nature of etaheuristics, Ta"u Search, Si!ulated Annealing, >enerating

Algorith!s

4ame T$eor: The for!ulation of two persons, Gero su! ga!es, solving si!ple ga!es a

protot'pe e)a!ple, ga!es with !i)ed strategies, graphical solution procedure, solving "'

linear progra!!ing, e)tensions

Tet -oo#:

1. +rederic- S.2illier & >erald J.Lie"er!anF ntroduction to Operations raw 2ill, 4556.

*hapters 1.1, 1.4, 1.7, 4.1, 4.4, 4.7, 4.3, 4.8, 4.6, 7.4, 7.7, 7.3, 3.1, 3.4, 3.7, 3.3, 3.8, 3.6,

3.9, 8.1, 8.4, 8.7, 6.1, 6.4, 6.7,6.3, 6.8, 6.6, 6.9, 9.1, ;.1, ;.4, ;.7, ;.3, 17.1, 17.4, 17.7,

17.3, 13.1, 13.4, 13.7, 13.3, 13.8, 13.6#

48


26/39

Re*erence -oo#:

1. =a'ne L. =instonF Operations


27/39

II SEMESTER

3ro*eional Communication and Et$ic




(nit I ) Hour

3ro*eional ! Tec$nical Communication: -aic o* Tec$nical Communication:

ntroduction, Process of *o!!unication, Language as a Tool, Levels of *o!!unication,

Levels of *o!!unication, *o!!unication $etwor-s, !portance of Technical

*o!!unication

-arrier to Communication: efinition of $oise, *lassification of Barriers

Tec$nolog in Communication: !pact of Technolog', Software for *reating essages,

Software for =riting ocu!ents, Software for Presenting ocu!ents, Trans!ittingocu!ents, (ffective use of Availa"le Technolog'

(nit II ) Hour

Acti;e itening: ntroduction, T'pes of Listening, Traits of good Listener, Active versus

passive listening, i!plications of effective listening

E**ecti;e 3reentation Strategie: ntroduction, efining purpose, Anal'Ging Audience and

Locale, OrganiGing *ontents, preparing outline, 0isual Aids, ?nderstanding $uances of

eliver', Cinesics, Pro)e!ics, ParalinguisticEs, *hrone!ics, Sa!ple speech, +acing

nterviews.

(nit III ) Hour

4rou, Communication: ntroduction, >roup iscussion, OrganiGational >roup discussion,

>roup discussion as part of selection process eetings, conferences.

-aic o* Re,ort "riting:efining reports, eter!ining the purpose H factors, >athering

infor!ation, organiGing the report, writing the report,


28/39

Em,loer!Em,loee Iue: ?se of $ontraditional wor-ers, =histle Blowing

Introduction to Intellectual 3ro,ert a & Indian Cber a: ntellectual propert' law

"asics, T'pes of ntellectual propert', Agencies responsi"le for ntellectual propert'

registration, nternational organiGations, Agencies and Treaties, the increasing i!portance of

ntellectual propert' rights, ntroduction to *'"er LawF =hat is *'"er LawQ, $eed for *'"er

Law, Jurisprudence of ndian *'"er Law, (volution of Ce' Ter!s and *oncepts, (volution of

*'"er *ri!e

Cae Studie and .icuion

Tet -oo#:

1. eena-shi


29/39

III SEMESTER

Stem So*tare

Subject Code: MCA'10 CIE: 50



(nit I ) Hour

Mac$ine Arc$itecture D ntroduction, S'ste! Software and achine Architecture,

Si!plified nstructional *o!puter S*# S* achine Architecture, S*HI( achine

Architecture, S* Progra!!ing ()a!ples.

(nit9 II ) Hour

Aembler D Basic Asse!"ler +unction A Si!ple S* Asse!"ler, Asse!"ler Algorith!

and ata Structures, achine ependent Asse!"ler +eatures nstruction +or!ats &

Addressing odes, Progra! ra!!ars, ParserLe)er *o!!unication, The Parts of Speech Le)er, A acc

Parser, The


30/39

TE>T -66BS:

1. Leland. L.Bec-F S'ste! Software, 7rd(dition, Addison=esle', 1::9. *hapters 1.1 to

1.7, 4 e)cept 4.8.4 and 4.8.7#, 7 e)cept 7.8.4 and 7.8.7#, 3 e)cept 3.3.7##

4. John.raw 2ill, 1:::.

75


31/39

III SEMESTER

Stem 3rogramming aborator

3ART9 A

.emontrate t$e *olloing uing e:

1. *ount the nu!"er of vowels, consonants, digits and spaces in a given string

4. *ount the nu!"er of characters, words, spaces, lines

7. *ount the nu!"er of ntegers, floating point nu!"ers "oth positive and negative#

3. *hec- the entered da' is a wee- da' or wee- end.

8. *hec- the given date falls under which /uarter of the 'ear.

.emontrate t$e *olloing uing e and *ile $andling tec$niue:

6. *ount the nu!"er of co!!ent lines in a given * progra! and eli!inate the

co!!ents and cop' that progra! into a new file.9. *ount the nu!"er of YscanfE and YprintfE state!ents in a * progra!.


32/39

III SEMESTER

Com,uter 8etor#

Subject Code: MCA'/0 CIE: 50

Hour!"ee#: Teac$ing % Tutorial / SEE: 100


(nit I ) Hour

+oundationF Building a $etwor-@ Applications@ arcia and ndra =id%a%aF *o!!unication $etwor-s +unda!ental

*oncepts and Ce' architectures, 4nd(dition Tata c>raw2ill, 4553.

74


33/39

III SEMESTER

Anali & .eign o* Algorit$m

Subject Code: MCA''0 CIE: 50



(nit I ) Hour

ntroduction and the funda!entals of the Anal'sis of Algorith! (fficienc'@ $otion of

Algorith!, +unda!entals of Algorith!ic Pro"le! Solving, !portant Pro"le! T'pes,

+unda!ental data Structures. Anal'sis +ra!ewor-, As'!ptotic $otations and Basic

efficienc' classes, athe!atical anal'sis of enerating *o!"inatorial O"%ects.

Presorting, Balanced Search Trees, 2eaps and 2eap sort, Pro"le!


34/39

III SEMESTER

.eign and Anali o* Algorit$m aborator

Implementation and test the following algorithms:

1. Quick Sort2. Merge Sort3. (a) Topological Sorting (b) Warshall4. Knapsack Proble!. "i#kstra$s %lgorith&. Kruskal %lgorith'. (a) "S an (b) *S+. Subset Proble,. Tra-elling Salesan Proble1. Pris %lgorith11. lo/s %lgorith

12. +0Queens Proble

73


35/39

III SEMESTER

3rogramming it$ a;a

Subject Code: MCA'%0 CIE: 50



(nit I ) Hour

ntroduction to Java Java and Java applications@ Java evelop!ent Cit JC#@ Java is

interpreted, B'te *ode, J0@ O"%ectoriented progra!!ing@ Si!ple Java progra!s@ ata

t'pes and other to-ensF Boolean varia"les, int, long, char, operators, arra's, white spaces,

literals, assigning values@ *reating and destro'ing o"%ects@ Access specifiers, Static e!"ers.

Operators and ()pressionsF Arith!etic Operators, Bitwise operators,


36/39

(nit + ) Hour

Servlets@ Bac-ground@ The Life *'cle of a Servlet@ ?sing To!cat for Servlet evelop!ent@ A

si!ple Servlet@ The Servlet AP@ The Java).servlet Pac-age@


37/39

III SEMESTER

a;a & /EE aborator

Implementation and test the following:1. Progra!s using Arra's and Strings

4. Progra!s to de!onstrate Access !odifiers and T'pe casting

7. Progra!s on nheritanceF si!ple, !ultilevel and !ultiple inheritance

3. Progra!s to de!onstrate ()ception handling

8. Progra!s on Applets to de!onstrateF repaint#, getocu!entBase# , get*odeBase#

and passing para!eters to Applets

6. Progra!s on Thread creation "' using Thread class and


38/39

III SEMESTER

6,erating Stem

Subject Code: MCA'50 CIE: 50



(nit I ) Hour

Introduction to 6,erating Stem Stem tructure: =hat operating s'ste!s do@

*o!puter S'ste! organiGation@ *o!puter S'ste! architecture@ Operating S'ste! structure@

Operating S'ste! operations@ Process !anage!ent@ e!or' !anage!ent@ Storage

!anage!ent@ Protection and securit'@ istri"uted s'ste!@ Specialpurpose s'ste!s@

*o!puting environ!ents. Operating S'ste! Services@ ?ser Operating S'ste! interface@

S'ste! calls@ T'pes of s'ste! calls@ S'ste! progra!s@ Operating S'ste! design and

i!ple!entation@ Operating S'ste! structure@ 0irtual !achines@ Operating S'ste! generation@

S'ste! "oot.

(nit II ) Hour

3roce Management: Process concept@ Process scheduling@ Operations on processes@ nter

process co!!unication. ultiThreaded Progra!!ingF Overview@ ultithreading !odels@

Thread Li"raries@ Threading issues. Process SchedulingF Basic concepts@ Scheduling criteria@

Scheduling algorith!s@ ultipleProcessor scheduling@ Thread scheduling.

(nit III ) Hour

3roce Snc$roni7ation: S'nchroniGationF The *ritical section pro"le!@ PetersonEs

solution@ S'nchroniGation hardware@ Se!aphores@ *lassical pro"le!s of s'nchroniGation@

onitors.

.eadloc#: eadloc-sF S'ste! !odel@ eadloc- characteriGation@ ethods for handling

deadloc-s@ eadloc- prevention@ eadloc- avoidance@ eadloc- detection and recover' fro!

deadloc-.

(nit I+ ) Hour

Memor Management: e!or' anage!ent StrategiesF Bac-ground@ Swapping@

*ontiguous !e!or' allocation@ Paging@ Structure of page ta"le@ Seg!entation. 0irtual

e!or' anage!entF Bac-ground@ e!and paging@ *op'onwrite@ Page replace!ent@

Allocation of fra!es@ Thrashing.

(nit + ) Hour

File Stem Im,lementation o* File Stem: +ile S'ste!F+ile concept@ Access !ethods@

irector' structure@ +ile s'ste! !ounting@ +ile sharing@ Protection. !ple!enting +ile

S'ste!F +ile s'ste! structure@ +ile s'ste! i!ple!entation@ irector' i!ple!entation@

Allocation !ethods@ +ree space !anage!ent.

Secondar Storage Structure 3rotection: ass storage structures@ is- structure@ is-

attach!ent@ is- scheduling@ is- !anage!ent@ Swap space !anage!ent. ProtectionF >oals

of protection, Principles of protection, o!ain of protection, access !atri) , !ple!entationof access !atri), Access control,


39/39

Tet -oo#F

1. A"raha! Sil"erschatG, Peter Baer >alvin , >reg >agneF 6,erating Stem 3rinci,le,

9th edition, =ile'ndia, 4556.

Re*erence -oo#:

1. . ha!dhereF Operating s'ste!s A conce,t baed A,,roac$, 4nd(dition, Tata

c>raw 2ill, 4554.

4. P.*.P. BhattF 6,erating Stem, 4nd(dition, P2, 4556.

7. 2arve' eitalF 6,erating tem, 7rd(dition, Addison =esle', 1::5.

MCA Syllabus 2011

Documents

Transcript of MCA Syllabus 2011