BCA Syllabus 2013

8/13/2019 BCA Syllabus 2013

1/58

Bachelor of Computer Applications

Programme Code: IFT

Duration 3 Years Full Time

Programme Structureand

Curriculum Scheme of !"amination

#$%3

A&ITY '(I)!*SITY +A*YA(A


2/58

PREAMBLE

Amity University aims to achieve academic excellence by providing multi-faceted education tostudents and encourage them to reach the pinnacle of success. The University has designed asystem that would provide rigorous academic programme with necessary skills to enable them toexcel in their careers.

This booklet contains the Programme Structure the !etailed "urriculum and the Scheme of#xamination. The Programme Structure includes the courses $"ore and #lective% arrangedsemester wise. The importance of each course is defined in terms of credits attached to it. Thecredit units attached to each course has been further defined in terms of contact hours i.e. &ecture'ours $&% Tutorial 'ours $T% Practical 'ours $P%. Towards earning credits in terms of contacthours ( &ecture and ( Tutorial per week are rated as ( credit each and ) Practical hours perweek are rated as ( credit. Thus for example an &-T-P structure of *-+-+ will have * credits *-(-+ will have , credits and *-(-) will have credits.

The "urriculum and Scheme of #xamination of each course includes the course ob ectivescourse contents scheme of examination and the list of text and references. The scheme of

examination defines the various components of evaluation and the weightage attached to eachcomponent. The different codes used for the components of evaluation and the weightageattached to them are/

"omponents "odes 0eightage $1%"ase !iscussion2 Presentation2 Analysis " + - (+'ome Assignment ' + - (+Pro ect P + - (+Seminar S + - (+3iva 3 + - (+4ui5 4 + - (+

"lass Test "T (+ - (Attendance A +#nd Semester #xamination ## 6+

7t is hoped that it will help the students study in a planned and a structured manner and promoteeffective learning. 0ishing you an intellectually stimulating stay at Amity University.

8uly )+((


3/58

P*,-*A&&! ST*'CT'*!BCA

FI*ST S!&!ST!* Total Credits %.$Course Course Title /ectures

0/1 +oursPer 2ee

Tutorials0T1 +oursPer 2ee

Practical0P1 +oursPer 2ee

TotalCredits

79T)(+: ;athematics < 7 * ( - ,

79T)(+= !iscrete ;athematical Structures withApplications to "S

* ( - ,

79T)((+ "omputer 9undamentals >Programming "oncepts

) ( - *

79T)((( !igital #lectronic * ( - ,79T)(() " Programming &ab - - , )

,pen !lecti4es 56#?3)( ( #nvironmental Studies@ ) - - )"SS)( ( #ffective &istening@ ( - - (

#')( ( Understanding Self for #ffectiveness@ ( - - (

&A?)( (&A?)( )

&A?)( *&A?)( ,&A?)(&A?)( B

9oreign &anguage < 7@9rench - 7Cerman - 7

Spanish - 78apanese - 7"hinese - 7Portuguese - 7

* - - *

T,TA/ #7

S!C,(D S!&!ST!* 79T))(+ ;athematics - 77 * ( - ,79T))(( !ata > 9ile Structures Using " ) ( - *79T))() "omputer Architecture > Assembly

&anguage* ( - ,

79T))(* Production > Dperations ;anagement ) ( - *79T))(, Systems Analysis > !esign ) - - )79T))( 7nternet 9undamentals ) ( *79T))(B !ata Structures &ab - - ) (

,pen !lecti4es 86"SS)) ( Presentation Skills@ ) - - )

#')) ( Problem Solving > "reative Thinking@ ( - - (

&A?)) (&A?)) )&A?)) *&A?)) ,&A?))&A?)) B

9oreign &anguage < 77@9rench - 77Cerman - 77Spanish - 778apanese - 77"hinese - 77Portuguese -77

* - - *

T,TA/ #5

S'&&!* P*,9!CT I

T+I*D S!&!ST!* 79T)*() "omputer Driented Statistical > Dptimi5ation

;ethods* ( - ,

79T)*(* Db ect Driented Programming "oncepts Using"EE

) ( - *

79T)*(, !atabase ;anagement Systems ) ( - *79T)*( Dperating Systems ) ( - *79T)**) Pro ect - - - *


4/58

79T)*(6 "EE &ab - - ) (79T)*(: ! ;S &ab ) (

Concentration !lecti4es 379T)*+: Accounting > 9inancial ;anagement ) ( - *79T)*+= Advance Technologies in "omputer Science * *79T)** Pro ect$with Presentation and #valuation% *79T)**, Study Abroad$() days% *

,pen !lecti4es 76"SS)* ( Feading > "omprehension@ ( - - (

#')* ( Croup !ynamics and Team uilding@ ( - - (

&A?)* (&A?)* )&A?)* *&A?)* ,&A?)*&A?)* B


) - - )

T,TA/ #8

F,'*T+ S!&!ST!* 79T),() "omputer Driented ?umerical

;ethods* ( - ,

79T),(* "omputer Craphics * ( - ,79T),( Programming in 3isual asic * ( - ,79T),(B !esign > Analysis of Algorithms * ( - ,79T),(6 "omputer Craphics &ab - - ) (79T),(: 3isual asic &ab ) (

Concentration !lecti4es 379T),(= #mbedded Systems ) ( - *79T),)+ #merging Technologies ) ( - *79T),*) Pro ect$with Presentation and

#valuation%- - - *

79T),*( Term Paper #valuation - - - *,pen !lecti4es 76

"SS), ( "orporate "ommunication @ ( - - (#'), ( Stress and "oping Strategies@ ( - - (

&A?), (&A?), )&A?), *&A?), ,&A?),&A?), B


) - - )

T,TA/ #.

S'&&!* P*,9!CT II

FIFT+ S!&!ST!* 79T) (( 8ava Programming * ( - ,79T) () 8ava &ab - - ) (79T) (* Software #ngineering ) ( - *79T) (, 0eb !esigning * ( - ,79T) ( 0eb !esigning &ab - - ) (79T) * Summer Pro ect - - - *

Concentration !lecti4es 779T) (6 Systems Software * ( - ,79T) (: U?7G Dperating System > Shell

Programming) ( - *

79T) (= Unix Programming &ab - - ) (


5/58

79T) *) Pro ect$with Presentation and#valuation%

- - - *

,pen !lecti4es 76"SS) ( #mployability Skills@ ( - - (

#') ( 7ndividual Society and ?ations@ ( - - ( &A?) (&A?) )&A?) *

&A?) ,&A?)&A?) B

9oreign &anguage < 3@9rench- 3Cerman- 3Spanish- 3

8apanese- 3"hinese < 3Portuguese -3

) - - )

T,TA/ #.

SI T+ S!&!ST!* 79T)B+= ;ultimedia > its Applications * - - *79T)B*) Pro ect 0ork - - - B79T)B(( 7ntroduction to Dpen Source

Technologies $P'P ;ySHl%* - - *

79T)B() ;ultimedia &ab - - ) (79T)B(* 7ntroduction to Dpen Source

Technologies $P'P ;ySHl% &ab- - ) (

79T)B(, ;obile "omputing * ( - ,Concentration !lecti4es 7

79T)B( ?etwork Security * ( - ,79T)B(B !ata ;ining * ( - ,79T)B(6 ;arketing ;anagement * - - ,

,pen !lecti4es 76"SS)B ( 0orkspace "ommunication@ ( - - (

#')B ( 7nterpersonal "ommunication andFelationship ;anagement@

( - - (

T,TA/ #8

@is "ompulsory


6/58

Curriculum Scheme of !"amination

&AT+!&ATICS ; I

Course Code: IFT#%$< Credit 'nits: $7

Course ,=>ecti4e:The ob ective of this course is to provide an introduction to the fundamentals and concepts of basic mathematicscovering sets functions differentiation integration differential eHuations vectors and matrices. This course aims toassist the students to develop confidence in handling mathematical concepts and techniHues and to understand the

principles and uses of differential and integral calc*wulus.

Course Contents:

&odule I: SetsSets and subsets finite and infinite sets. Algebra of sets/ Union 7ntersection complementation !emorgan laws"ommon applications of algebra of sets.Functions: 7nterval and sub-intervals. !efinition of function and examples polynomial rational exponentiallogarithmic and trigonometric functions. Craph of some simple functions like polynomial $upto * rd deg% rationaltrigonometric functions modulus function step functions rational functions composite functions &imit of afunction.

&odule II: Differentiation!ifferentiation of function !erivative of some common functions polynomial rational exponential logarithmic

and trigonometric functions.Successive differentiation &eibnit5 theorem.

&odule III: Integration7ntegration as inverse process of differentiation integration of simple functions method of change of variable andsubstitution for integrals definite integrals simple problems of line integral.

&odule I): Differential e?uations!ifferential eHuations of first order !ifferential eHuations of second order with constant coefficients

&odule ): )ectors3ector 3ector Algebra/ addition subtraction Scalar ;ultiplication. ;agnitude 3ector multiplication Simple

application of 3ectors.&atrices: ;atrix Submatrix types of matrices such as symmetric sHuare diagonal matrices singular andnonsingular matrices. Addition Subtraction multiplication of matrices Fank of matrix ;atrix eHuation Solution

by "ramerIs rule and Causs elimination method.

!"amination Scheme:

Components CT% A@C@ Attd !!

eightage 0 1 (+ ( 6+

Te"t *eferences:Text: #ngineering ;athematics #. Jreyig

References: 'igher #ngineering ;athematics . S. Crewal !ifferential "alculus Shanti ?arayan


7/58

DISC*!T! &AT+!&ATICA/ ST*'CT'*!S IT+APP/ICATI,(S T, CS

Course Code: IFT#%$ Credit 'nits: $7

Course ,=>ecti4e:The Db ective of this course is to provide the fundamentals and the concepts of !iscrete ;athematical Structureswith Applications to "omputer Sciences including ;athematical &ogic oolean Algebra and its Applications

Switching circuit > &ogic Cates Craphs and Trees. 7mportant theorems with constructive proofs real life problems> graph theoretic algorithms to be covered with an aim of helping the students to understand the computational andalgorithmic aspects of ;athematical &ogic oolean Algebra Craphs and Trees in the field of "omputer sciencesand its applications.

Course Contents:

&odule I: &athematical /ogicProposition Propositional "alculus- Propositional 3ariables and "ompound Propositions asic &ogical Dperations/-"on unction !is unction ?egation "onditional ioconditional. "ompound Statements #Huivalence !ualityAlgebra of Statements 3alid and 7nvalid Arguments Tautologies "ontradiction "ontingency.

&odule II: Boolean Alge=ra and Applications

oolean Algebra &aws of oolean Algebra asic Theorems.oolean 9unctions < !is unctive ?ormal 9orm "on unctive ?ormal 9orm.!uality Principle.

&odule IIIoolean #xpression - Sum of Products Product of Sum ;interm and ;axterm.

Feducing oolean #xpressions using algebraic laws and Jarnaugh ;ap.Applications of oolean Algebra < Switching "ircuits and &ogic Cates.

&odule I): -raphs Craph 9inite graph 7nfinite graph "onnected graph !isconnected graph ?ull graph. Subgraph 7ncidenceAd acency !egree !irected Craph 0alk Path "ircuit 0heel #ulerian graph 'amiltonian graph Planar graph.

&odule ): Trees Tree Properties of Tree Spanning Tree 9undamental "ircuit "ut-Set "ut-3ertices.7ncidence ;atrix Ad acency ;atrix.

!"amination Scheme:



Te"t *eferences:

Text: #lements of !iscrete ;athematics/ ".&. &iu Craph Theory/ 0ilson Craph Theory with Applications to #ngineering and "omputer Science/ ?. !eo

References: !iscrete ;athematics/ 'arikishan > Shivra Pundir !iscrete ;athematics/ 8.J. Sharma


8/58

C,&P'T!* F'(DA&!(TA/S A(D P*,-*A&&I(- C,(C!PTS

Course Code: IFT#%%$ Credit 'nits: $3

Course ,=>ecti4e:The primary ob ective of this course is to understand all the components of " including the " language the "Preprocessor and the " Standard &ibrary. An understanding of some advanced practical issues including memorymanagement testing and debugging complex declarations and expression evaluation building and using libraries

and evaluating tradeoffs such as si5e vs. speed and speed vs. complexity. The ability to write " code and create andmanipulate linked lists.

Course Contents:

&odule I: Introduction to Computer Fundamentalsasic "omputer Drgani5ation "omputer 'ardware "omponents !isk Primary and Secondary ;emory Jeyboard

;ouse Printer ;onitor "! etc."omputer Software/ 7ntroduction to Application software System Software "ompilers 7nterpreters etc.

asic Dperating System "oncepts 9unctional knowledge of ;S!DS and 07?!D0S. ?umber System- inary 'exadecimal Dctal and !ecimal. "onversion from one number system to another."omputer "odes - AS"77 and # "!7". Fepresentation of 7ntegers 9ixed and 9loating-Point.

&odule II: Introduction to ECE /anguage

"haracter set 3ariables 7dentifiers !ata type Arithmetic operation "onstant operators #xpression Assignments basic input2output statements Simple K". Programs.!ecision making in program Felational &ogical operators if statements if -else nested if-else statements Switchcase loop !o-0hile 0hile for loop and nesting of loop.

&odule III: Arra s and FunctionsDne !imensional Arrays Arrays ;anipulation Sorting Searching Problems solving Top down Approach;odular Programming and functions Passing Arguments call by value and call by references Fecursivefunction .Fecursion

&odule I): PointersPointers/ !eclaration Pointer assignments initiali5ation Pointers and !ynamic ;emory Allocation !iscuss Arrayof Pointers .

&odule ): Structure and 'nion Structure definition !eclaration structure Assignments Arrays in structure Structure Arrays Pointer Structure

?ested Structure Arrays and Arrays of Structure Union and 9ile 'andling

!"amination Scheme:



Te"t *eferences:

Text: Problem Solving through " language #. alagurusamy T;' publication. Peter ?ortons L7ntroduction to "omputersM T;'

References: &et us " Nashwant Janetkar P Publication. P.J. Sinha L"omputer 9undamentalsM P Publications 3. Fa araman L"omputer 9undamentalsM Prentice 'all !romey. C L'ow to Solve it by "omputer Prentice 'all Peter ?ortons L!DS CuideM Prentice 'all Cottfried LProgramming in "M Schaum Tata ;cCraw 'ill N. Janetkar L&et us "M P Publications N. Janetkar LUnderstanding PointersM P Publications


9/58

Schidlt LThe "omplete Feference of "M Tata ;cCraw 'ill

DI-ITA/ !/!CT*,(ICS

Course Code: IFT#%%% Credit 'nits: $7

Course ,=>ecti4e:An entry level course in digital electronics covering number systems binary mathematics digital codes logic gates

oolean algebra Jarnaugh maps and combinational logic. #mphasis will be on circuit logic analysis and design ofdigital circuits. The student will explain the operation of digital logic gates and use oolean algebra and Jarnaughmapping to express logic operations and minimi5e logic circuits in design. The student will construct analy5ecombinational logic circuits > seHuential circuitsO create a truth table for standard digital logic gatesO and addsubtract multiply and divide using the binary numbering system. Student will also be able to understand aboutdigital to analog conversion and vice versa.

Course Contents:

&odule I: (um=er S stem!ecimal inary Dctal 'exadecimal ?umber Systems and "onversion of the bases.Introduction to logic s stemsPositive and negative logic &ogic functions - ?DT A?! DF ?DF #G-DF #G ?DF Truth tables oolean algebra !e ;organKs theorems Standard forms for &ogical #xpressions - Sum of Products Product of SumsSpecification of &ogical functions in terms of ;interms and ;axterms Jarnaugh ;aps Simplification of &ogical functions7ntroduction of donKt care states.

&odule II: Com=inational Building Bloc s;ultiplexers !ecoders #ncodersArithmetic circuits'alf Adders and 9ull Adders G'alf Subtractor and 9ull Subtractor Fepresentation of negative numbers revisited

&odule III: Flip;flopsThe FS latch the clocked FS flip-flop 8J 9lip 9lop the ;aster-Slave 8J flip-flop !elay and Toggle flip-flopsFlip;flops in counter circuitsAsynchronous $ripple% "ounters $UP2!D0?% Synchronous "ounter design $UP2!D0?% ?on SeHuential "ounting

&odule I): Shift *egistersShift registers in general Fing "ounters 8ohnson "ounterIntroduction to &emorPrimary/ FA; Static FA; !ynamic FA; FD; PFD; #APFD; Secondary/ 9loppy !isk 'ard !isk "!FD; &odule ): DACs and ADCs

inary weighted resistor !A" Fesolution linearity and settling time of !A"s Successive approximation A!"

!"amination Scheme:



Te"t *eferences:

Text: F.P 8ain ;ordern !igital #lectronics

References: ;alvino > &each !igital #lectronics 9loyd !igital 9undamentals ;.; ;ano !igital &ogic and "omputer !esign Cothman !igital #lectronics


10/58

C P*,-*A&&I(- /AB

Course Code: IFT#%%# Credit 'nits: $#

C ; P*,-*A&&I(- ASSI-(&!(T

(. 0rite a program to find the area and perimeter of $7% sHuare $ii% rectangle.

). 0rite a Program to find the sum of first n natural numbers.*. 0rite a program to calculate the average of n numbers.,. 0rite a program to check whether the number is even or odd.

. 0rite a program to find largest of three numbers.B. 0rite a program to swap the values of two given variables.6. 0rite a program to find the sHuare of a given number.:. 0rite a program to calculate the roots of a Huadratic eHuation.=. 0rite a program to compute the sum of sHuares of n natural numbers.(+. 0rite a program to reverse a given number and also calculate the number of digits in the number.((. 0rite a program to calculate the sum of digits of a given number.(). 0rite a program to calculate the factorial of a given positive number.(*. 0rite a program to generate fibonaaci series upto n terms.(,. 0rite a program to find the C"! and &"; of two given positive numbers.( . 0rite a program to print first n prime numbers.(B. 0rite a program to print ( if input character is capital ) if input character is a lowercase alphabet * if input

character is a digit and , if some other special character.(6. 0rite a " program to check whether a number is an Armstrong number.(:. 0rite a " program to find the power of a number.(=. 0rite a " program to find the sum of n terms of the series/ n-n@)2)QEn@*2*Q-n@,2,QERRR.)+. 0rite a " program to find the maximum2minimum number in a given array.)(. 0rite a " program to search a number in an array using linear search.)). 0rite a " program to sort a given array using ubble sort.)*. 0rite a " program to concatenate two one-dimensional arrays.),. 0rite a " program to add subtract and multiply two m by n matrices.) . 0rite a " program to detect the occurrence of a character in a given string.)B. 0rite a " program to count the number of characters in a given string with and without using strlen $% function)6. 0rite a " program to copy the contents of one string to another with and without using strcpy $% function.):. 0rite a " program to determine whether the entered character string is palindrome or not.)=. 0rite a " program to enter the marks address of several students and prepare the mark sheet of each student.

Use structures.*+. 0rite a " program to calculate net salary 2 printing of salary statement of an employee. Use Structures.*(. 0rite a " program to calculate the factorial of a number using recursion.*). 0rite a " program to generate a fibonacci series using recursion.

!"amination Scheme:

Components CT% 0/a=1 A@P@C Attd !!0P*1eightage 0 1 (+ ( 6+


11/58

&AT+!&ATICS II

Course Code: IFT##%$ Credit 'nits: $7

Course ,=>ecti4e:The Db ective of this course is to expose the students to the fundamentals and the concepts of ;athematicsincluding Feal ?umber Systems &imits and "ontinuity SeHuences of Feal numbers 7nfinite series and application

of derivatives etc. This course is designed to understand the basic mathematical logic as a foundation of computerscience and applications.

Course Contents:

&odule I: *eal (um=er S stem ?atural number PeanoIs axiom- mathematical induction- well ordering principle The 7ntegers The Fational field

Fational numbers and their main properties/ ordered field-!ensity Archimedean CeometricalFepresentation "ountability The Feal no. system as a complete ordered field neighborhood open setsclosed sets limit points of sets.

&odule II: /imits and Continuit&imits "ontinuity Piecewise "ontinuous 9unctions < discontinuous functions Algebra of "ontinuous function

"ontinuity of "omposite functions "ontinuity on $a b% implying boundedness.

&odule III: Se?uencesSeHuences of Feal numbers ounded SeHuence ;onotone SeHuence &imit of a seHuence $"onvergent SeHuence%&imits Superior and &imits 7nferior "auchy SeHuence.

&odule I): Infinite Series7nfinite series "onvergence of series Series of positive terms "omparison tests !I Alembents ratio test"auchyIs root test FaabeIs test Caussian test.

&odule ): Application of Deri4ati4esFolleIs theorem ;ean value theorem/ &angrangeIs form "auchyIs form.Cenerali5ed ;ean value theorem/ TaylorIs theorem 7ndeterminate form/ TaylorIs infinite series ;aclaurianIs

series Power Series #xpension of some standard functions/ ex

G sin x cos x &og $(Ex% $(Ex%n

etc. ;axima andminima.

!"amination Scheme:



Te"t *eferences:

Text: Shanti ?arayan !ifferential "alculus . S. Crewal 'igher #ngineering ;athematics

References: . S. Crewal 'igher #ngineering ;athematics


12/58

DATA A(D FI/! ST*'CT'*!S 'SI(- C

Course Code: IFT##%% Credit 'nits: $3

Course ,=>ecti4e:This course is an introduction to the use design and analysis of data structures in computer programs. The verycommonly used data structures like arrays stacks Hueues lists trees and graphs will be discussed in detail. Sortingand hashing are important topics in the study of algorithms. They are also closely related to the design of datastructures. Several algorithms to implement these techniHues are included in the syllabus.

Course Contents:

&odule I: Basic concepts of data representationAbstract data types/ 9undamental and derived data types Fepresentation Primitive !ata Structures.

&odule II: Arra sFepresentation of arrays single and multi dimensional arrays. Address calculation using column and rows ma orordering. 3arious operations on arrays 3ector Application of arrays/ matrix multi multiplication sparse polynomialand addition.

&odule III: Stac s and ueuesFepresentation of stacks and Hueues using arrays and linked list. "ircular Hueues priority Hueue and !-Hueue.Application of stacks/ conversion from infix to postfix expression #valuation of postfix expression using stacks.

&odule I): /in ed /istSingly linked listO operations on list. &inked stacks and Hueue. Polynomial representations and manipulation usinglinked lists doubly linked list addition of two polynomial list.

&odule ): Treesinary trees traversal method/ preorder in-order post-ordered traversal. Fecursive and non-recursive algorithm for

above mentioned Traversal methods. Fepresentation of trees and its application/ inary tree representation of a treeinary search tree/ height balanced $A3&% tree

&odule )I: SearchingG sorting and comple"itSearching/ SeHuential and binary search indexed search Sorting/ insertion selection bubble Huick merge heapsort.

&odule )II: -raphsCraph representation/ ad acency list ad acency multicasts ad acency lists. Traversal scheme/ !epth first search

readth first search. Spanning tree/ definition minimal spanning tree algorithms.

!"amination Scheme:



Te"t *eferences:

Text: T. &angsam ;.8 Augenstein and A.;. Tanenbaum L!ata structure using " and "EE Second edition )+++

Prentice 'all of 7ndia. F.Jruse C.&. Tonodo and . &eung M !ata structures and program design in "M Second #dition (==6

Pearson education. S. "hottopadhayay !. Choshdastidar > ;. "hottopadhayay. !ata structures through languageM 9irst edition

)++( P Publication.

References: C.&. 'eileman !ata structures Algorithms and ob ect oriented programming M 9irst #dition )++) Tata

;cCraw 'ill. #. 'orowit5 Sahni and !. ;ehta M 9undamentals of data structures in "EE M)++ Calgotia Publication


13/58

C,&P'T!* A*C+IT!CT'*! A(D ASS!&B/Y /A(-'A-!

Course Code: IFT##%# Credit 'nits: $3

Course ,=>ecti4e:The student will develop an understanding of the underlying operation of a modern digital computer identify andunderstand the various building blocks from which a modern computer is constructed. The student will learn todevelop simple assembly language programs and understand the underlying operations of more complex programs

using 7ntelIs :+: ;icroprocessor.

Course Contents:

&odule I: -eneral Computer Architecturelock !iagram of typical "omputer ;emory Section 7nput2Dutput Section "PU Fegisters Arithmetic Unit

7nstruction handling Areas Stacks&icro operations: Fegister Transfer us and ;emory Transfer Arithmetic ;icro operations &ogic ;icrooperations Shift ;icro operations Arithmetic &ogic Shit Unit &odule II: Basic Computer ,rganiHation and Design7nstruction "odes Dperation code Timing and "ontrol 7nstruction "ycle ;emory Feference 7nstructions 7nputDutput 7nstructions and 7nterrupts

Control &emor : "ontrol 0ord ;icroinstruction ;icroprogramming "ontrol ;emory 'ardwired&odule III: Central Processing 'nitCeneral Fegister Drgani5ation Stack Drgani5ation 7nstruction 9ormats Addressing ;odes F7S" "7S"Pipelining and )ector Processing: Parallel Processing Pipelining Arithmetic Pipeline 7nstruction Pipeline3ector Processing Array Processors

&odule I): Input ,utput ,rganiHation72D 7nterface Asynchronous !ata Transfer ;odes of Transfer Priority 7nterrupt !;A 7DP Serial"ommunication&emor ,rganiHation: Associative ;emory "ache ;emory 3irtual ;emory

&odule ): Introduction to &icroprocessor;achine &anguage Assembly &anguage Assembler 'igh &evel &anguage "ompiler 7nterpreter 7nternalArchitecture:+: .

!"amination Scheme:



Te"t *eferences:

Text: "omputer System Architecture ;.;. ;ano Pearson #ducation.

References: "omputer Architecture and Drgani5ation 8.P 'ayes T?'. &ance A &eventhal 7ntroduction to ;icroprocessors/ Software 'ardware Programming 'wang and riggs "omputer Architecture and Parallel Processing 'ayes "omputer Architecture and Drgani5ation Tannenbaum Structured "omputer Drgani5ation aky "omputer Drgani5ation 0illiam Stallings "omputer Drgani5ation and Architecture "arpinelli "omputer Systems Drgani5ation and Architecture 'ennesy > Patterson "omputer Architecture


14/58

P*,D'CTI,( A(D ,P!*ATI,(S &A(A-!&!(T

Course Code: IFT##%3 Credit 'nits: $3

Course ,=>ecti4e:The ob ective of the course is to obtain a general understanding of operations management environment forecastingdemand and factor supply. 7n order to improve the competitiveness and productivity of an organi5ation use of &inearProgramming model 7mplementing decisions related to product and service design capacity planning processselection and facility layout location planning ;FP and 7nventory. Fole of 4uality and its implementation inDrgani5ations

Course Contents:

&odule I: Introduction7ntroduction to Dperations systems Production systems definition Dperations ;anagement !efinition difference'istorical #volution of operations ;anagement

&odule II: (e2 Product De4elopmentStages of ?ew Product !evelopment Product !esign and Service !esign "apacity Planning !ecisions its needand strategies for modifying capacity "onceptual definition of 9acility &ocation

&odule III: /a out and Aggregate Planning Concepts&ayout concepts !eveloping the Process &ayout/ ;odels and ehaviour Production Planning and "ontrol its need"ategories Aggregate Planning Process/ its concept and goals

&odule I): &aterial *e?uirement Planning S stems7ntroduction to ;aterials ;anagement ;aterial FeHuirements Planning Systems.Applications of 87T.

&odule ): ualit Assurance and its Control4uality Assurance Statistical 4uality "ontrol Acceptance Sampling > Total 4uality ;anagement

!"amination Scheme:



Te"t *eferences:

Text: Adam > #bert Production > Dperations ;anagement.

References: uffa > Sarin ;odern Production 2 operations ;anagement. "hase > AHuilano Production > Dperations ;anagement. Fender > 'ei5er Principles of Dperations ;anagement.


15/58

SYST!&S A(A/YSIS A(D D!SI-(

Course Code: IFT##%7 Credit 'nits: $#

Course ,=>ecti4e:This course addresses both what is reHuired of an 7nformation System and how this can be achieved. Studying the

practices processes activities and technologies involved in the development of an 7nformation system provide anexcellent insight to develop skills for employment > professional life. Students are involved in activities rangingfrom the front-end of reHuirements analysis and system design to the development of User 7nterfaces and testing >maintenance of software. The course eHuips the student to carve a niche in the growing portfolio of 7nformationsystems careers or go in for higher studies e.g. ;"A ; A > other ;asterIs level programmers.

Course Contents:

&odule I: S stem Concepts and the Information S stems !n4ironment0hat is SystemV 7mportant System "haracteristic usiness Systems usiness 7nformation Systems "ategories of7nformation Systems Transaction Processing System ;7S !SS and Scope of 7nformation system.The Fole of System Analyst/ Dverview of System Analysis and !esign ;ultifaceted role of System analyst/Analytical Skill Technical Skills and 7nterpersonal Skills.

&odule II: S stem De4elopment /ife C cleThe System !evelopment &ife "ycle Structured Analysis !evelopment ;ethod and Systems Prototype ;ethod.System planning and 7nitial 7nvestigation/ System Planning/ 7nformation System "ommittee ;ethod User Croup"ommittee ;ethod 7nitial 7nvestigation 9easibility Study/ Dperational Technical and #conomical 9easibility "ost

enefit Analysis/ !ata Analysis "ost enefit Analysis The system proposal.

&odule III: Determining S stem *e?uirementsPerforming FeHuirements !etermination Traditional ;ethod ;odernI ;ethods and Fadical ;ethods. The Toolsof Structured Analysis/ Process ;odeling/ !9! &ogical ;odeling/ Structured #nglish !ecision Trees and !ata;odeling/ #F !iagram

&odule I): Process and Stages of S stem DesignThe process of design/ logical design physical design Structured !esign 9unctional !ecomposition and Structured0alkthrough. 7nput2Dutput and 9orms !esign/ 7nput design output design forms design types of forms, layoutconsiderations and forms control.

&odule ): File organiHation and Data=ase Design9ile structure file organi5ation -ob ectives of database data structure normali5ation the role of databaseadministrator. Automated Tools for Systems !evelopment/ "AS# Tools

!"amination Scheme:



Te"t *eferences:

P-analysis > !esign of 7nformation Systems 8ames A. Senn ;odern System Analysis > !esign/ 8effery A. 'offer 8oey 9. Ceorge 8oseph S. 3alacich

#lements of System Analysis > !esign/ #lias Awad.


16/58

I(T!*(!T F'(DA&!(TA/S

Course Code: IFT##%. Credit 'nits: $3

Course ,=>ecti4e:The course provides introduction to internet and a deep insight into the basics of internet world wide web security

risks over internet basics of various languages used over internet. 0ith this course students would be able to knowthe basics of each and every introductory internet and computer features which would prove to be very helpfulthroughout their degree and would prove helpful in understanding other related sub ects also.

Course Contents:

&odule %: Internet Basics7ntroduction to 7nternet 'istory of 7nternet 7nternet 0orking ;odes of "onnecting to 7nternet 7nternet ServiceProviders$7SPs% !ifferentiate between 7nternet 7ntranet and #xtranet Protocol 7nternet address 7P addressingstandard address domain name !?S internet tool T"P27P and U!P DS7 reference model.

&odule #: !lectronic &ail7ntroduction to #-mail advantages and disadvantages of e-mails structure of an e-mail address messagecomponents message composition mailer features 7nternal working of #-mail #-mail management ;7;#types ?ewsgroups mailing lists chat rooms secure-mails S;TP PDP P7"D Pine Copher.

&odule 3: orld ide e=7ntroduction to www ;iscellaneous 0eb rowser details searching www/ Search engines and meta searchengines search fundamentals search strategies working of search engines Telnet 9TP 'TTP 7ntroduction to

rowser "oast-to-coast surfing 'T;& 0eb page installation and setup asics of 'T;& formatting >hyperlink creation. Using and installing Plug-ins.

&odule 7: Introduction to /anguages and Ser4ers

asics of ava script language "lient2Server Side Programming in ava script Using 9orms and data entry using ava script G;& and !'T;& basics "reating Static and dynamic web pages.0eb Servers/ P0S 77S Apache Advantages and limitations of using these servers.

&odule .: Pri4ac and securit7ntroduction to security over internet ?etwork Attacks security and privacy levels security policy virus wormsandd Tro5an horses "ryptography/ #ncryptionand !ecryption techniHues Secure0eb document !igitalSignatures 9irewalls and its types 7!S.

!"amination Scheme:

Te"t *eferences:Te"t: 9undamentals of the 7nternet and the 0orld 0ide 0eb Faymond Creenlaw and #llen 'epp < )++( T;' 7nternet > 0orld 0ide Programming !eitel !eitel > ?ieto )+++ Pearson #ducation

*eferences: "omplete idiots guide to ava script . Aron 0eiss 4U# (==6 Atul Jahate L"ryptography and ?etwork SecurityM Tata ;cCraw-'ill )++*


17/58

DATA ST*'CT'*!S A(D &IC*,P*,C!SS,*S /AB

Course Code: IFT##%8 Credit 'nits: $%

/ist of Data Structure Programs

(. 0rite a program to generate 9ibonacci Series using recursion.

). 0rite a program to calculate 9actorial of nth number using recursion.*. 0rite a program to implement Tower of 'anoi using recursion.,. 0rite a program to calculate C"! of two numbers using recursion.

. 0rite a program to calculate power of a number using recursion.B. 0rite a program to reverse a given string using recursion.6. 0rite a program to swap two elements without using third variable.:. 0rite a program to remove all the duplicate elements present in the given array.=. 0rite a program to search an element using &inear Search.(+. 0rite a program to search an element using inary Search.((. 0rite a program to sort the given array using ubble Sort.(). 0rite a program to sort the given array using Selection Sort.(*. 0rite a program to sort the given array using 7nsertion Sort.(,. 0rite a program to insert a new element in the given unsorted array at k th position.

( . 0rite a program to insert a new element in the given sorted array at proper place.(B. 0rite a program to delete an element from the k th position of the given unsorted array.(6. 0rite a program to delete an element from given sorted array.(:. 0rite a program to merge to given sorted arrays.(=. 0rite a program to perform addition of two matrices.)+. 0rite a program to perform multiplication of two matrices.)(. 0rite a program to check whether given matrix is diagonal matrix upper triangular matrix lower triangular

matrix.)). 0rite a program to find out transpose of a given matrix.)*. 0rite a program using array of pointers sort the given array of strings using bubble sort.),. 0rite a program to implement Stack using array also show overflow and underflow in respective push and pop

operations.) . 0rite a program to implement 4ueue using array which shows insertion and deletion operations.)B. 0rite a program to implement "ircular 4ueue using array which shows insertion and deletion operations.)6. 0rite a program to implement &inear &inked &ist showing all the operations like creation display insertion

deletion and searching.):. 0rite a program to implement Stack using &inked &ist. 7mplement Push Pop and display operations.)=. 0rite a program to implement 4ueue using &inked &ist. 7mplement 7nsertion deletion and display operations.*+. 0rite a program to count the number of times an item is present in a linked list.*(. 0rite a program to increment the data part of every node present in a linked list by (+. !isplay the data both

before incrimination and after.*). 0rite a program to implement !oubly &inked &ist showing all the operations like creation display insertion

deletion and searching.**. 0rite a program to create a inary Search Tree and display its contents using preorder postorder and inorder

traversal.*,. 0rite a program to implement insert delete and search operations in a inary Search Tree

!"amination Scheme:

Components CT% 0/a=1 A@P@C Attd !!0P*1eightage 0 1 (+ ( 6+


18/58

C,&P'T!* ,*I!(T!D STATISTICA/ A(D,PTI&I ATI,( &!T+,DS

Course Code: IFT#3%# Credit 'nits: $7

Course ,=>ecti4e:The ob ective of this course is to expose students to the fundamentals and concepts of statistical and optimi5ationmethods in particular with reference to freHuency distribution and measures of central tendency measures of

dispersion skew ness and kurtosis theory of probability linear programming problems transportation assignmentand game problems. This course is designed with an aim of helping the students to understand important theoremsdifferent formulae and practical applications of these statistical and optimi5ation methods in the field of "omputerSciences and Applications.

Course Contents:

&odule I"ollection of !ata Sampling and Sampling !esigns "lassification and Tabulation of !ata Craphicalrepresentation of !ata ;easures of "entral 3alue ;easures of !ispersion. ;oments Skewness Jurtosis"orrelation and Fegression.

&odule II: Pro=a=ilit

"lassical !efinition of Probability Algebra of #vents Probability Axoims "onditional Probability.Pro=a=ilit Distri=utions: !iscrete and "ontinuous !istributions inomial !istribution Poisson distribution ?ormal !istribution.

&odule III: /inear Programming;athematical 9ormulation of &inear Programming models and its Craphical Solutions Simplex ;ethod "harneIs

ig ; method Two Phase ;ethod.

&odule I): Transportation Pro=lemCeneral Transportation model Starting basic Solutions/-?orth west "orner ;ethod &east "ost ;ethod 3ogelIsApproximation ;ethod Test of optimality unbalanced Problem.Assignment Pro=lems

&odule ): -ame TheorTwo-Person ero Sum Cames ;aximin-;inimax Principal Pure Strategies ;ixed Strategies #xpected Pay off"oncept of !ominence Craphical Solution of m ) and ) n Cames.

!"amination Scheme:



Te"t *eferences:

Text: P.J. Cupta > ;anmohan &inear Programming and Theory of Cames. S." Cupta > 3.J. Japoor 9undamentals of ;athematical Statistics.

References: 'ogg Probability and Statistical 7nference. Alexander. ;. ;ood 7ntroduction to the Theory of Statistics 9ranklin. A. Craybill !ane. ". oes Taha 'andy A Dperations Fesearch C. 'adley &inear Programming.


19/58

,B9!CT ,*I!(T!D P*,-*A&&I(- C,(C!PTS 'SI(- CJJ

Course Code: IFT#3%3 Credit 'nits: $3

Course ,=>ecti4e:"EE is one of the most widely used programming languages for solving problems. The ob ective of this course is to

provide ob ect oriented programming fundamentals using "EE. Topics to be covered include fundamentals of syntax> semantics of "EE loops > decisions functions classes and structures and features of classes such as overloadingand inheritance files streams pointers etc.

Course Contents:

&odule I: ,4er4ie2 of CJJ0hat is Db ect Driented Programming "haracteristics of DDP !ifference between " and "EE.

asics/-7nput2Dutput in "EE using cin2cout Preprocessor !irectives !ata Types-7nteger 9loat character#numerated data types library functions comments storage classes manipulators type conversion arithmeticoperators arrays and strings

&odule II: Classes and o=>ects9unctions/ Simple functions passing arguments to functions returning values from functions reference argumentsreturning by reference Dverloaded functions 7nline functions Structures defining the structure variable assessingmembers of structure structure within structure assessing structure members using pointers"lasses and ob ects/ A simple class "EE ob ects as physical ob ects ob ects as function arguments returningob ects from functions static class data array as class data member array of ob ects.

&odule III: Inheritance7nheritance Types of 7nheritance access modes < public private > protected Abstract "lasses Ambiguityresolution using scope resolution operator and 3irtual base class "onstructors Types of constructors !estructors

&odule I): Pol morphismPolymorphism Type of Polymorphism < "ompile time and runtime 9unction Dverloading Dperator Dverloading$Unary and inary% Polymorphism by parameter Pointer to ob ects this pointer 3irtual 9unctions pure virtualfunctions.&odule ): Files and !"ception +andling and I@,9iles and Streams/ streams string 72D character 72D file pointer error handling command line arguments.formatted and Unformatted 7nput output 7ntroduction of #xception handling.

!"amination Scheme:

Components CT% CT# A@C@ Attd !!eightage 0 1 (+ (+ + 6+

Te"t *eferences:

Programming with "EE Favi "handran ;astering "EE 3enugopal Programming in "EE S"'AU;Is series The complete reference "EE 'erbert Schildt Turbo "EE Fobert &afore


20/58

DATABAS! &A(A-!&!(T SYST!&S


Course ,=>ecti4e:The ob ective of this course is to expose the students to the fundamentals > basic concepts in !ata ase;anagement Systems. This course discusses architecture of !atabase Systems with concept of relational model >#F model. This course explains techniHues for database design ?ormali5ation and database recovery and

protection.

Course Contents:

&odule I: Introduction to DB&S!efinition of ! ;S !ata 7ndependence ! ;S Architecture &evels !atabase Administrator 9ile SystemApproach 3s ! ;S Approach Advantages of Using a ! ;S !ata ;odels Schemas and 7nstances.

&odule II: *elational Data=ase !* &odelFelational System "oddIs Fule Felational ;odel Dptimi5ation Tables and 3iews #ntity Types of #ntity 0eak#ntity Attributes #ntity sets #ntity < Felationship !iagrams.

&odule III: *elational &odel ,=>ects!omains and Felations Felations and predicates Felational !ata 7ntegrityO Primary Jey "andidate Jey 9oreignJey and their rulesO Felational operators Felational Algebra Felational "alculus S4& &anguage !ata definition!ata retrieval and update operations.

&odule I): Data=ase Design!efinition Df 9unctional !ependencies Process Df ?ormali5ation 9irst ?ormal 9orm Second ?ormal 9orm Third

?ormal 9orm. oycee "odd ?ormal 9orm 9ourth ?ormal 9orm 9ifth ?ormal 9orm.

&odule ): Data *eco4er ProtectionFecovery- Transaction recovery System recovery ;edia Fecovery "oncurrency "ontrol TechniHues &ocking!ead &ock Seriali5abilityO Security- 7ntroduction.

!"amination Scheme:



Te"t *eferences:

#lmasari ?avathe L9undamentals of !atabase SystemsM Addision 0esley . Jorth Silbert5 Sudarshan L!atabase "onceptsM. ;cCraw 'ill. ;a umdar > hattacharya L!atabase ;anagement SystemM Tata ;cCraw 'i ll. !ate " 8.M An 7ntroduction to !atabase SystemsM Addision 0esley.


21/58

,P!*ATI(- SYST!&S

Course Code: IFT#3%. Credit 'nits: $3

Course ,=>ecti4e:The ob ective of this course is to provide a clear description of the concepts that underlie operating systems. 7t tellsabout fundamental concepts that are applicable to a variety of systems. 0e present a large number of examples that

pertains particularly to U?7G and to other popular operating systems. This course basically revolves around processand it tells about every thing about a process.

Course Contents:

&odule I: ,perating S stem as a *esource &anagerDperating System "lassifications;onitor ;ultiprogramming Time Sharing Feal Time Systems;ultiprocessor Systems and Dperating System Services.

&odule II: CP' Schedulingasic Scheduling "oncepts Process Dverviews Process States ;ultiprogramming

Scheduler and Scheduling Algorithms ;ultiple Processor Scheduling

&odule III: &emor &anagementare ;achine Fesident ;onitor Partition Paging and Segmentation 3irtual ;emory and !emand PagingFeplacement Policies "ache ;emory

&odule I): File S stems9ile Support Access ;ethodsAllocation ;ethods- "ontiguous &inked and 7ndex AllocationDirector S stemsSingle &evel Tree Structured Acyclic Craph and Ceneral Craph !irectory 9ile ProtectionDeadloc !eadlock "haracteri5ation !eadlock Prevention !eadlock Avoidance and !eadlock Fecovery

&odule ): Securit and ProtectionSecurity Policies and ;echanismProtection and Access "ontrol-Access ;atrix ;odel of Protection Access 'ierarchies Access &ist "apabilities,4er4ie2 of '(I ,perating S stem"ommand-&anguage UserIs 3iew of Unix 7mplementation of Unix Unix Summary #tc.

!"amination Scheme:



Te"t *eferences:

Text: Peterson and Silberschat5 Dperating System "oncepts

References: Tannenbaum A.S. ;odern Dperating System "rowly "harrles Dperating System- A design Approach !ietel '.;. Dperating Systems


22/58

P*,9!CT

Course Code: IFT#33# Credit 'nits: $3

Course ,=>ecti4e:The ob ective of pro ect work is to provide students exposure about the technology they have learnt in previous andcurrent semesters and their applications in real time situations. Appropriate application software as assigned by the

pro ect guide to be developed individually or in-groups.

They are supposed to follow the following technologies/""EE! ;S

-uidelines:There are certain phases of every 7nternIs professional development that cannot be effectively taught in theacademic environment. These facets can only be learned through direct on-the- ob experience working withsuccessful professionals and experts in the field. The internship program can best be described as an attempt toinstitutionali5e efforts to bridge the gap between the professional world and the academic institutions. #ntire effortin internship is in terms of extending the program of education and evaluation beyond the classroom of a universityor institution. The educational process in the internship course seeks out and focuses attention on many latentattributes which do not surface in the normal classroom situations. These attributes are intellectual ability

professional udgment and decision-making ability inter-disciplinary approach skills for data handling ability inwritten and oral presentation sense of responsibility etc.

7n order to achieve these ob ectives each student will maintain a file $ Internship File %. The 7nternship 9ile aims toencourage students to keep a personal record of their learning and achievement throughout the Programme. 7t can beused as the basis for lifelong learning and for ob applications. 7tems can be drawn from activities completed in thecourse modules and from the workplace to demonstrate learning and personal development.

The 9ile will assess the studentIs analytical skills and ability to present supportive evidence whilst demonstratingunderstanding of their organi5ation its needs and their own personal contribution to the organi5ation.

The la out guidelines for the Pro ect > Seminar Feport/

%K File should =e in the follo2ing specificationW A, si5e paper W 9ont/ Arial $(+ points% or Times ?ew Foman $() points%W &ine spacing/ (.W Top > bottom margins/ ( inch2 ). cmW &eft > right margins/ (.) inches2 * cm

#K *eport /a out: The report should contain the following components9ront PageTable of "ontentAcknowledgementStudent "ertificate"ompany Profile $optional%

7ntroduction;ain odyFeferences 2 ibliography

The 9ile will include five sections in the order described below. The content and comprehensiveness of the main body and appendices of the report should include the following/

(. The Title Page --Title - An 7nternship #xperience Feport 9or $Nour ?ame% name of internship organi5ationname of the Supervisor2Cuide and his2her designation date started and completed and number of credits for whichthe report is submitted.). Ta=le of Content --an outline of the contents by topics and subtopics with the page number and location of eachsection.


23/58

*. Introduction --short but should include how and why you obtained the internship experience position and therelationship it has to your professional and career goals.,. &ain Bod --should include but not be limited to daily tasks performed. ;a or pro ects contributed to dateshours on task observations and feelings meetings attended and their purposes listing of tools and materials andtheir suppliers and photographs if possible of pro ects buildings and co-workers.

. *eferences @ Bi=liograph --This should include papers and books referred to in the body of the report. Theseshould be ordered alphabetically on the authorKs surname. The titles of ournals preferably should not beabbreviatedO if they are abbreviations must comply with an internationally recognised system

ASS!SS&!(T ,F T+! I(T!*(S+IP FI/!

The student will be provided with the Student Assessment Fecord $SAF% to be placed in front of the 7nternship 9ile.#ach item in the SAF is ticked off when it is completed successfully. The faculty will also assess each item as it iscompleted. The SAF will be signed by the student and by the faculty to indicate that the 9ile is the studentIs ownwork. 7t will also ensure regularity and meeting the delaines.

ST'D!(T ASS!SS&!(T *!C,*D 0SA* %

%K *ange of *esearch &ethods used to o=tain information

#K !"ecution of *esearch

3K Data Anal sis Analyse 4uantitative2 4ualitative information "ontrol 4uality

7K Dra2 Conclusions

!"amination Scheme:

Components ) S * FPeightage 0 1 )+ )+ )+ ,+

3 < 3iva S < Synopsis 9P < 9inal Presentation F - Feport


24/58

CJJ /AB

Course Code: IFT#3%5 Credit 'nits: $%

/ist of CJJ Programmes:

(. 0AP to find greatest of three numbers.). 0AP to calculate factorial of a number.*. 0AP to print 9ibonacci series of XnI numbers where n is given by the programmer ,. 0AP to check whether a number is prime or not.

. 0AP to find the number of characters and words in a string.B. 0AP to read a set of numbers in an array > to find the largest of them.6. 0AP to implement bubble sort using arrays.:. 0AP to read a set of numbers from keyboard > to find sum of all elements of the given array using a function.=. 0AP to exchange contents of two variables using call by value.(+. 0AP to exchange contents of two variables using call by reference.((. 0AP to find the sum of three numbers using pointer to function method.(). 0AP to display content of an array using pointer arithmetic.(*. "alculate area of different geometrical figures $circle rectangle sHuare triangle% using function overloading.

(,. 0AP a program ro maintain the student record containing roll number ?ame marks( marks) marks* as datamember and getdata$% display$% and setdata$% as member functions$use array of ob ect%( . 0AP to increment the employee salaries on the basis of there designation $;anager- +++ Ceneral ;anager-

(++++ "#D-)++++ worker-)+++%. Use employee name id designation salary as data member and incYsal asmember function $Use array of ob ect%.

(B. 0rite a class bank containing data member/ ?ame of !epositor A2c type Type of A2c alance amount.;ember function/ To assign initial value To deposit an amount to withdraw an amount after checking the

balance $which should be greater than Fs. ++% To display name > balance.(6. 0AP to define nested class XstudentYinfoI which contains data members such as name roll number and sex and

also consists of one more class XdateI whose data members are day month and year. The data is to be read fromthe keyboard > displayed on the screen.

(:. 0AP to generate a series of 9ibonacci numbers using copy constructor where it is defined outside the classusing scope resolution operator.

(=. 0rite a program to add two complex numbers using friend function.)+. 0rite a class string to compare two strings overload $Z Z% operator.)(. 0rite a class to concatenate two strings overload $E% operator.)). "reate a class item having two data members x > y overload X-X$unary operator% to change the sign of x and y.)*. "reate a class #mployee. !erive * classes from this class namely Programmer Analyst > Pro ect &eader. Take

attributes and operations on your own. 0rite a program to implement this with array of pointers.),. "reate two classes namely #mployee and 4ualification. Using multiple inheritance derive two classes Scientist

and ;anager. Take suitable attributes > operations. 0rite a program to implement this class hierarchy.) . 0rite a program to read data from keyboard > write it to the file. After writing is)B. "ompleted the file is closed. The program again opens the same file reads


25/58

DB&S /AB

Course Code: IFT#3%< Credit 'nits: $%

(. Civen the table STU!#?T/

Student ?o. "lass ?ame CA;# Crade( SUP0 Crade)(+ 6 Sameer "ricket Photography A(( : Su it Tennis A Cardening "() 6 Jamal Swimming Photography(* 6 3eena Tennis " "ooking A(, = Archana asket all A &iterature A( (+ Arpit "ricket A Cardening "

$i% !isplay the names of the students who are getting a grade " in either CA;# or SUP0.$ii% !isplay the number of students getting grade A in cricket.$iii% !isplay the different games offered in the school.$iv% !isplay the SUP0 taken by the students whose name starts with XAI.$v% Add a new column named X;arksI.$vi% Assign a value )++ for ;arks for all those who are getting grade or above in CA;#.$vii% Arrange the whole table in the alphabetical order to SUP0.

). Civen the table SPDFTS/Student ?o. "lass ?ame CA;#( Crade( CA;#) Crade)(+ 6 Sameer "ricket Swimming A(( : Su it Tennis A Skating "() 6 Jamal Swimming 9ootball(* 6 3eena Tennis " Tennis A(, = Archana asket all A "ricket A( (+ Arpit "ricket A Athletics "

$i% !isplay the names of the students who are getting a grade " in either CA;#( or CA;#).$ii% !isplay the number of students getting grade A in cricket.$iii% !isplay the names of the students who have same game for both CA;#( and CA;#).$iv% !isplay the games taken by the students whose name starts with XAI.$v% Add a new column named X;arksI.$vi% Assign a value )++ for ;arks for all those who are getting grade or above in CA;#.$vii% Arrange the whole table in the alphabetical order of ?ame.

*. Civen the table STU!#?T/Student ?o. ?ame Stipend Stream Avg;arks Crade "lass( Jaran ,++.++ ;edical 6:. ()) !ivakar , +.++ "ommerce :=.) A (("* !ivya *++.++ "ommerce B:.B " ()", Arun * +.++ 'umanities 6*.( ()"

Sabina ++.++ ?onmedical =+.B A ((AB 8ohn ,++.++ ;edical 6 ., ()

6 Fobert ) +.++ 'umaities B,., " ((A: Fubina , +.++ ?onmedical ::. A ()A= 3ikas ++.++ ?onmedical =).+ A ()A(+ ;ohan *++.++ "ommerce B6. " ()"

$i% Select all the ?onmedical stream students from STU!#?T.


26/58

$ii% &ist the names of those students who are in class () sorted by Stipend.$iii% &ist all students sorted by Avg;arks in descending order.$iv% !isplay a report listing ?ame Stipend Stream and amount of Stipend received in a year assuming

that the stipend is paid every month.$v% "ount the number of students with Crade XAI.$vi% 7nsert a new student in the STU!#?T table and fill all the columns with some values.$vii% Cive the output of the following S4& statements/

$a% Select ;7?$Avg;arks% from STU!#?T where Avg;arks [ 6 O$b% Select SU;$Stipend% from STU!#?T where Crade Z X IO$c% Select A3C$Stipend% from STU!#?T where "lass Z X()AIO$d% Select "DU?T$!7ST7?"T%O

,. 0rite S4& statement to create #;P&DN## relation which contain #mp?o ?ame Skill PayFate.

. "reate a table with the under-mentioned structure $Table name is #mp%#mp?o ?U; #F$,%!ept?o ?U; #F$)%#mp?ame "'AF$(+%8ob "'AF$(+%;anager ?U; #F$,%'ire!ate !AT#Salary ?U; #F$6 )%"ommission ?U; #F $6 )%

B. 9ind out the number of employees having manager as ob.

6. !isplay only the obs with maximum salary greater than or eHual to *+++.

:. 9ind all those employees whose ob does not start with X;I.

=. &ist the minimum and maximum salary of each ob type.

(+. 9ind all the employees who have no manager.

((. "reate a table with the under-mentioned structure $Table name is !ept%!ept?o ?U; #F$)%

!ept?ame "'AF$()%&ocation "'AF$()%

(). "reate a table with the under-mentioned structure $Table name is PFD8#"T%Pro 7d ?U; #F$,%Pro !esig "'AF$)+%Pro Start!T !AT#Pro #nd!T !AT#

udgetAmount ?U; #F$6%;ax?oStaff ?U; #F$)%

(*. "reate a table with the under-mentioned structure $Table name is SalCrade%&owSal ?U; #F$6 )%

'ighSal ?U; #F$6 )%Crade ?U; #F$)%

0here &owSal is the lowest salary limit in the grade and 'ighSal is the highest salary limit in the grade.

(,. 0rite S4& statements to list all employees in the following format/#;P&DN## 0DFJS 7? !#PAFT;#?T !ept. ?oS;7T' 0DFJS 7? !#PAFT;#?T )+SU!'7F 0DFJS 7? !#PAFT;#?T )+FA80DFJS 7? !#PAFT;#?T (+S;7T'S 0DFJS 7? !#PAFT;#?T *+SA?TDS' 0DFJS 7? !#PAFT;#?T *+


27/58

( . Civen the table ;D3/ ?o. Title Type Fating Stars 4ty Price( Cone with the

0ind!rama C Cable , *=.=

) 9riday the (* th 'orror F 8ason ) B=.=* Top Cun !rama PC "ruise 6 ,=.=, Splash "omedy PC(* 'anks * )=.=

7ndependence !ay !rama F Turner * (=.=B Fisky usiness "omedy F "ruise ) ,,.=

6 "ocoon Scifi PC Ameche ) *(.=: "rocodile !undee "omedy PC(* 'arris ) B=.== (+( !almations "omedy C * =.=(+ Tootsie "omedy PC 'offman ( )=.=

9ind the total value of the movie cassettes available 7 the library.!isplay a list of all movies with Price over )+ and sorted by Price.!isplay all the movies sorted by 4ty in descending order.!isplay a report listing a movie number current value and replacement value for each movie in the above table."alculate the replacement value for all movies as 4ty @ Price @ (.( .

"ount the number of movies where rating is not XCI.7nsert a new movie in the ;D3 table. 9ill all the columns with some values.Cive the output of the following S4& statements/Select A3C $Price% from ;D3 where Price \ *+OSelect ;AG $Price% from ;D3 where Price [ *+OSelect SU; $Price @ 4ty% from ;D3 where 4ty \ ,OSelect "DU?T $!7ST7?"T%O

!"amination Scheme:

Components CT%

A@P@C Attd !!0P*1



28/58

ACC,'(TI(- A(D FI(A(CIA/ &A(A-!&!(T

Course Code: IFT #3$< Credit 'nits: $3

Course ,=>ecti4e:The ob ective of this course is to provide to students of 79T and 7;"A with an introduction to fundamentalsconcepts and principles 2 practices of Accounting and 9inancial ;anagement. The topics covered including basicaccounting preparation of Trial alance Profit and &oss Account and alance Sheet Account as applied to ankingincluding ank Feconciliation Statement !efinition and Principles of 0orking "apital ;anagement "apital

udgeting and Analysis of 9inancial Statements .

Course Contents:

&odule I: Accounting!efinition of Accounting 7ts Db ectives Advantages and &imitation. Principles "oncepts and "onventions of

Accounting !ouble entry system Fecording of Transactions in subsidiary ooks < 8ournal "ash ook sales ookPurchase ook and Feturn ook. Posting into &edger accounts.

&odule II: Final AccountsPreparation of Trial balance 9inal Accounts including ad ustments Trading account Profit and &oss account

alance Sheet.

&odule III: Ban ingDpening of different types of anks Accounts "heHue ook Pass ook !eposit slips ank FeconciliationStatements.

&odule I): or ing Capital &anagement

!efinition of working "apital Types of 0orking "apital !eterminants of working "apital "ash ;anagement andFeceivables ;anagement."apital udgeting/ Principles and TechniHues.

&odule ): Anal sis of Financial statementsFatio Analysis/ ;eaning Advantages limitations types of ratios and their usefulness Statements of charges in the9inancial Position on "ash basis.

!"amination Scheme:



Te"t *eferences:

T.S Crewal ook keeping Prasamna "handra 9inancial ;anagement. 7; Pandey 9inancial ;anagement. F.P. Fustagi 9inancial ;anagement.


29/58

C,&P'T!* ,*I!(T!D ('&!*ICA/ &!T+,DS

Course Code: IFT#7%# Credit 'nits: $7

Course ,=>ecti4e:The ob ective of this course is to provide conceptual understanding of various numerical methods in particular withreference to numerical solution of non linear eHuations and system of linear eHuations interpolation numerical

differentiation and integration and numerical solution of ordinary differential eHuations. 7mportant theorems anddifferent formulae for various numerical methods to be covered with an aim of helping the students to understandthe fundamentals concepts and practical use of these methods in the field of computer sciences and applications.

Course Contents:

&odule I: (umeric Computation"omputer Arithmatic ; 9loating point numbers-operations ?ormali5ation and their "onseHuences AbsoluteFelative and Percent #rror.7terative ;ethods/- eros of a single Transacendental eHuations and eros of Polynomial #Huations using isection

9alse Position ?ewton-Faphson ;ethods "onvergence of Solution.

&odule II: Simultaneous /inear !?uations

Solution of Simultaneous &inear #Huations. !irect ;ethods/- Causs elimination method Pivoting Causs-8ordan;ethod. 7terative methods/-8acobiIs ;ethods Causs-Seidal ;ethod.

&odule III: Pol nomial Interpolation ?ewtons divided difference 9orward and backward difference 9ormulae !ifference Tables &agrangeIs ;ethod.

&odule I): (umerical Differentiation and Integration9ormula for first and second order derivatives using newtonIs- 9orward and ackward formula ?umerical7ntegartion ?ewton-"otes 9ormula/ Trapi5oidal rule SimpsonIs (2* rd rule SimpsonIs *2: th rule 0eddleIs rule.

&odule ): (umerical Solution of Differential !?uationsasic Terminology of !ifferential #Huations PicardIs ;ethod #ulerIs method TaylorIs Series method Funge-

Jutta ;ethods Predictor


30/58

C,&P'T!* -*AP+ICS


Course ,=>ecti4e:The ob ective of this course is to present the basic principles for the design use and understanding of computergraphics systems. oth hardware and software components of graphics systems are discussed here. This course alsoteaches the students about different algorithms for creating and manipulating graphics displays. 3arieties ofmathematical methods are used in various computer graphics algorithm.

Course Contents:

&odule I: Introduction of -raphics!evelopment of "omputer Craphics asic Craphics System and Standards.-raphics De4ices:Faster and Fandom Scan !evices "ontinual Fefresh and Storage !isplays !isplay Processor "olor !isplayTechniHues 9rame uffer "oncepts in Faster Craphics.

&odule II: -raphics Primiti4esPoints Pixels Scan "onversion &ine !rawing Algorithms "ircle !rawing Algorithms Anti-aliasing TechniHue"haracter generator Pol gonPolygon representation Polygon 9illing 7nside2Dutside Testing

&odule III: TransformationScaling Translation Fotation "oordinate Axis Fotation Feflection Shears "omposite Transformation ;odelingand "oordinate Transformation)ie2ing: Two < !imensional 3iewing 3iewing transformation 7nteractive Picture "onstruction TechniHues7nteractive 7nput2Dutput !evices

&odule I): SegmentSegment Table "reating !eleting and Fenaming a Segment 3isibility and 7mage Transformation

indo2ing and Clipping: 0indow 3iew-port &ine clipping polygon clipping ;ultiple 0indowing

&odule ): Three Dimensional Concepts*-! Fepresentation and Transformation *-! 3iewing Algorithm for *-! 3olumes 7ntroduction to Spline "urvesand Surfaces

!"amination Scheme:



Te"t *eferences:

Text: "omputer Craphics y !onald 'earn And Pauline aker 'arringtonIs L"omputer Craphics L A Programming Approach

References: Principle of 7nteractive "omputer Craphics y ?ew 0. ;. And Spraull 9oley L"omputer CraphicsM Addission 0esley FogersI LProcedural #lements Df "omputer Craphics L ;c-Crawhilll


31/58

P*,-*A&&I(- I( )IS'A/ BASIC

Course Code: IFT#7%. Credit 'nits: $7

Course ,=>ecti4e:This course is aimed to provide a fundamental understanding of 3isual Programming #nvironment for the studentsin their early stages of academic career. 3arious concepts regarding CU7 such as ;anipulating CU7 Tools like"ommand uttons "heckboxes "ombo boxes etc. through Programming in a 3isual #nvironment will beintroduced for students to develop a 'ealthy Programming attitude towards new and emerging Technologies in thefield of 3isual Programming. After this course you will be able to understand fundamental concepts of 3isualProgramming and development of various CU7 applications.

Course Contents:

&odule I: Introduction to )isual Basic7ntroduction "U7 CU7 0hy 3isual Programming !ifferent 3isual Programming &anguages 7nitial Screens!ifferent applications Starting a new pro ect ;!7 and S!7 3ariables and constants !ata Types Scope ofvariables Dperators 9orms asic "ontrols $Text box &abels "ommand buttons 7mage "ontrol Picture box%Properties ;ethods and #vents ;essage ox 7nput ox

&odule II: Controlling Program Flo2!eterminate and 7ndeterminate &oops ;aking !ecisions Select "ase ?ested 7f-Then Co to.

&odule III: Some &ore ControlsDption utton "heck oxes &ist and "ombo and oxes Timers Scroll bars.

&odule I): Arra sG Function and ProcedureArrays "ontrol arrays Sub procedure 9unctions uilt in functions.

&odule ): &enus and dialog =o"es;enus Toolbars 7mage list control Status bar control.

&odule )I: Additional Controls9ile &ist ox !irectory &ist ox !rive &ist ox.

&odule )II: File +andling9ile "ommands SeHuential 9iles Fandom Access 9iles inary 9iles.

&odule )III: Introduction to Data=ase handling7ntroduction !atabase access methods !AD A!D F!D !atabase handing through A!D S4&. A!D!""ontrol Fole of A!D!# in database accessing.

!"amination Scheme:



Te"t *eferences:Text: 3isual asic B from Cround Up Cary "ornell T;' Publication.

References: ;astering 3isual asic P'7.


32/58

D!SI-( A(D A(A/YSIS ,F A/-,*IT+&S


Course ,=>ecti4e:The ob ective of the course is to provide the fundamentals and the concepts of !esign > analysis of Algorithmsincluding ;athematical foundations Sorting > Drder Statistics !ata Structures Advanced !esign > AnalysistechniHues such as !ivide > "onHuer greedy method > !ynamic Programming approaches.

Course Contents:&odule I: IntroductionAlgorithms Analy5ing algorithms !esigning algorithms.&athematical Foundations: Crowth of 9unctions-Asymptotic natation FecurrenceThe substitution ;ethod Fecursion tree method ;aster ;ethod.

&odule II: Sorting and ,rder statistics!ivide > "onHuer Strategy 'eap Sort 4uick Sort 3. stressen ;atrix ;ultiplication Sorting in &inear time.Data Structures / #lementary data structures hash tables inary search trees.

&odule III: Ad4anced Design and Anal sis Techni?ues!ynamic programming- #lements of dynamic programming "hain-matrix multiplication All pair shortest path $9layed -algorithm% Dptimal inarySearch. Tree.-reed algorlthms - #lements of the greedy strategy 'uffman codes S7ngle-source shortest path in a directedgraph Jnapsack problem ;inimun Spmming trees- The Algorithm of Jruskals and Prims.

&odule I): -raph Algorithms#lementary graphs Algorithms ;inimum spanning Trees Single source Shortest paths All Pair Shortest Paths.Selected Topics / Sorting ?etworks Algorithms for Parallel "omputers.

&odule )Polynomials and tile 99T String ;atching ?P-"ompleteness Approximation Algorithms.

!"amination Scheme:



Te"t *eferences:

Text: "oreman Fivest &isserson Algorithms P'7

References: 'orowit5 > Sahni 9undamental of "omputer Algorithm Calgotia. Aho 'opcropt Ullman !ata Structure > Algoritlull Addision 0esley.


33/58

C,&P'T!* -*AP+ICS /AB

Course Code: IFT#7%5 Credit 'nits: $%

Computer -raphics Programmes

(% 0rite a program to change the working mode from text to graphics and plot a pixel.)% 0rite a program to draw a line of same dimension in three different graphics mode.*% 0rite a program to display line rectangle circle and polyline using graphics command.,% 0rite a program to draw a line of slope between + and ( using !!A algorithm.

% 0rite a program to draw a line of slope between ( and using !!A algorithm.B% 0rite a program to draw a line of slope between + and ( using midpoint algorithm.6% 0rite a program to draw a line of slope between ( and using midpoint algorithm:% 0rite a program to draw a dashed line of slope ( using any line algorithm=% 0rite a program to draw a dotted line of slope ( using !!A algorithm(+% 0rite a program to draw a line of slope between + and -( using midpoint algorithm.((% 0rite a program to draw a line of slope between -( and - using midpoint algorithm.()% 0rite a program to draw an octant of a circle with itIs center at point $+ +% a using midpoint circle drawing.(*% 0rite a program to draw a circle with its center at point $+ +% and radius r using midpoint circle drawing.(,% 0rite a program to draw an octant of a circle with itIs center at point $a b% and radius r using midpoint circle

drawing.

( % 0rite a program to a circle with itIs center at point $a b% and radius r using midpoint circle drawing.(B% 0rite a program to fill a polygon using flood-fill method.(6% 0rite a program to fill a polygon using boundary-fill method.(:% 0rite a program to reflect a point in G and N-axis both.(=% 0rite a program to rotate a point $(++ +% about origin in anti-clock wise direction.)+% 0rite a program to rotate a point $(++ ( +% about point $*+ ,+% in clock wise direction..

!"amination Scheme:

Components CT%

A@P@C Attd !!0P*1



34/58

)IS'A/ BASIC /AB

Course Code: IFT#7%< Credit 'nits: $%

)isual Basic Programmes

$(% "reate a pro ect that allows the user to input information and then display the lines of output for a mailing label.9ields to be input by the user reHuires text boxes where information to be displayed belongs in label. Use text

boxes for ( st name last name street no. city state 5ip code. Provide tool tips use command buttons fordisplay clear print and exit. ;ake the display button as default button and clear as cancel button.

$)% !esign and code a pro ect that has shipping information. Use text boxes with labels attached for catalog code page no. part no.. Use two group of option button on the form enclosed each group in the frame. The ( st frameshould have caption of shipping and contain button for express and ground. 9or ) nd frame use a caption of

payment type and include buttons for check money order or credit card. Use a check box for new customer.Add command buttons for print clear and exit. ;ake the clear button the cancel button and add tool tips.

$*% "reate a pro ect for book sales. ;ake text boxes for Huantity title and price with labels. "alculate total pricediscount $( 1% and discounted price. ;ake command buttons for calculate clear and exit.

$,% "reate a pro ect for the local car rental agency that calculates rental charges. The agency charge ]( per day E

]+. + per km. use text boxes for customer name address city state 5ip code beginning and ending audiometerreading and no. of days the car was used. Use labels to display the miles given and the total charges. ;akecommand buttons for clear exit and calculate.

$ % "reate a pro ect that will input an employee salary. "alculate a gross salary deduction and net salary. #achemployee will receive a basic pay of ]=++ E sales commission of B1 of sales. After calculating the net paidcalculate the budget amount of each category based on the 1 given.

ank pays ]=++"ommission B1 of salesCross pay asic pay E "ommission!eduction (:1 of gross pay

?et pay Cross pay - deduction

udeget /-'ousing *+1 of net pay9ood and clothing ( 1 of net pay#ntertainment +1 of net pay;iscellaneous 1 of net pay

Use text boxes to input the employee name amount of sales. Use labels to display the result and thecalculation. Use calculates clear and exit command buttons.

$B% ;aintain a list of types of ice creams. Use a drop down combo box to hold the ice-cream type and usecommand button to add remove clear display and exit. !onIt allow a blank type to be added to the list.!isplay an error message if the user select remove without first selecting an ice-cream type. efore clearing thelist display a message to confirm the operation.

$6% "reate a pro ect that contains a form for entering book information from controls. Text boxes for author and title. Dption button for type fiction or non-fiction. !ropdown list for sub ect that will include bestseller fantasy religion romance humor science

fiction business philosophy education self-help and mystery. &ist box for shelf no. containing F"-((( F"-(() F"-((* and F"-((,. Use command buttons display clear and exit. Use labels to display information.

$:% "reate a list box which contains names of all cinema halls of ?"F. 7f you choose name of cinema hall labeldisplay information regarding all movies running in the cinema halls.

$=% "reate a pro ect that contains studentIs information Text boxes to display name and courses. Dption buttons for semester2 year.


35/58


36/58

!&!*-I(- T!C+(,/,-I!S

Course Code: IFT#7#$ Credit 'nits: $3

Course ,=>ecti4e:The course ob ective is to learn the latest and emerging technologies in the 7nformation Technology 9ield. 'erestudents will learn the new technologies like A8AG 3"S CF7! computing etc which will help further in researchand development of Software 7ndustry

Course Contents:

&odule I: )ersion Control S stem7ntroduction ?eed of 3ersion "ontrol System asic Setup asic Actions 3ersioning ;odels/ Problem of filesharing &ock- ;odify- unlock solutions "opy- ;odify- ;erge solution.

Module II: Emerging approach to web Application: AJAX 7ntroduction 0orking G;& 'TTP reHuest/ G'F create ob ect G'F reHuest G'F response C#T and PDST

G'F ready state.

Module III: ew trend in etwor!ing: "rid #omputing 7ntroduction "omparison of grids and conventional supercomputers Crid computing &exicon Sharing Fesources3arious "oncerns about Crid "omputing Crid "omputing Applications.

Module I$: ext generation Testing Fisk based testing Penetration Testing Smoke Testing !! $ usiness !riven !evelopment% based Testing 0eb

based Testing "lient- Server based Testing #T&$#xtract-Transform-&oad% based Testing

Module $: Introduction to #loud #omputing 7ntroduction "haracteristics of "loud "omputing Architecture Service ;odels/ 7aaS PaaS SaaS ?aaS "loud

"lients !eployment ;odels/ Public "louds "ommunity "louds 'ybrid "loud Private "loud 7ssues in "loud

"omputing Applications.

Module $I: Emerging Technolog%: &ata Mining Dverview Scope of !ata ;ining TechniHues of !ata ;ining/ Association "lassification Prediction. SeHuentialPatterns "lustering Dverview of "lustering TechniHues/ 'ierarchical "entroid ased !ensity ased Crid asedtechniHues Application of !ata ;ining

!"amination Scheme:

Components CT% A@C@ Attd !!eightage 0 1 (+ ( 6+

Te"t *eferences /

!ata ;ining/ "oncepts and TechniHues by Jiawei Han and Micheline Kamber, ;organ Jaufmann
http://www.albionresearch.com/ibook/1558604898http://www.albionresearch.com/ibook/1558604898


37/58


38/58

9A)A P*,-*A&&I(- /AB

Course Code: IFT#.%# Credit 'nits: $%

Soft2are *e?uired: 8!J(.*

Assignments 2ill =e pro4ided for the follo2ing:

8ava programs using classes > ob ects and various control constructs such as loops etc and data structures suchas arrays structures and functions

8ava programs for creating Applets for display of images and texts. Programs related to 7nterfaces > Packages. 7nput2Dutput and random files programs in 8ava. 8ava programs using #vent driven concept. Programs related to network programming.

!"amination Scheme:

IA !!A P* /* ) P* )

(+ (+ * * ?ote/ 7A


39/58

S,FT A*! !(-I(!!*I(-

Course Code: IFT#.%3 Credit 'nits: $3Course ,=>ecti4e:

The purpose of this course is to acHuaint students with the concepts and methods available for software developmentin industrial environments. Students will be exposed to a variety of topics such as design notations costing

techniHues and testing methods as well as to the tools which are available to support softwarespecification design testing and maintenance.

Course Contents:

&odule I: Soft2are De4elopment /ife C cle#volution of Software #ngineering Software Problems 7ssues 7nvolved in Software #ngineering 9undamental4ualities of a Software Product Approaches to Software #ngineering Planning the development Process!evelopment2Product &ife-"ycle ;odel Jinds of Software &ife-"ycle ;odel.

&odule II: Pro>ect &anagementPro ect ;anagement "oncepts Pro ect ;anagement Activities Si5e ;etrics. Software FeHuirement analysis andSpecification "ost ;odels.

&odule III: S stem Design!esign Db ectives !esign Principles #ffective ;odular !esign $9unctional 7ndependence "oupling and"ohesion% !esign Tools and TechniHues Prototyping Structured Programming.

&odule I): CodingProgramming Practices 3erification ;onitoring and "ontrol.

&odule ): Soft2are TestingTesting 9undamentals Test case design 9unctional Testing Structural Testing Test Plan Activities during testingUnit System 7ntegration Testing Software ;aintenance.

&odule )I: Soft2are *elia=ilit"oncept of Software Feliability Software Fepair and Availability Software #rrors 9ailure and 9aults.

!"amination Scheme:



Te"t *eferences:

Text: Software #ngineering A PractitionerIs Approach - Foger S. Pressman.

References: An 7ntegrated Approach to Software #ngineering Panka 8alote. Software #ngineering "oncepts Fichard 9airley.


40/58

!B D!SI-(I(-

Course Code: IFT#.%7 Credit 'nits: $7

Course ,=>ecti4e:This course is aimed to provide a fundamental understanding of web site creation. 'T;& is the language used for

designing most basic web pages. Syllabus include basic and advanced features of 'T;& which includes images

links tables frames and forms etc. 7t also gives an overview of G;&.

Course Contents:

&odule I: Introduction to html programming'istory of 'T;& Structure of 'T;& Adding "omments 9ormatting Text "reating &ist "reating !efinition &ist"reating 'yper Text &inks "reating &ink &ists 7nserting 7nline 7mages "reating 7mage &inks 'ori5ontal FulesAddress Tag 0orking with Text"hanging font Si5es and "olors Using ackground 7mage ;arHuee Tag.

&odule IITables and frames "reating Tables Table #lement Adding order Adding "olumn 'eadings Adding

Spacing and Padding Adding a "aption Setting the table 0idth and 'eight Add Fow 'eadingsAligning "ell contents Setting "olumn 0idth "entering a Table 7nserting and 7mage Spannig"olumns Spanning Fows Assigning ackgroung "olors 9rame #lements "reation of 9rame

ased Pages ?oframes #lement.

&odule III9orms and 8ava Script 7ntroduction to 9orms 9orm #lements 9ront level validations using 8avaScript

&odule I)"ascading style sheets Dverview of style sheets !ifferent ways to use style sheets Selectors !73 and

SPA? #lements Adding style to a !ocument Use id "lasses and 7ds Style Sheet Properties.

&odule ): &/7ntroduction to G;& G;& asics G;& Structure !eveloping a !T! from G;& code 3iewing G;& 3iewingG;& using the G;& !ata Source Db ect 3iewing G;& using Style Sheets.

!"amination Scheme:

Components CT% P*K ATTDK !!


Te"t *eferences:

Text: 'T;& !'T;& 8avaScript Perl "C7 7van ayross P Publication.

References: 'T;& "omplete Feference P Publication. 7nternet for everyone Alexis &eon and ;athew &eon &eon Tech world.


41/58

!B D!SI-(I(- /AB

Course Code: IFT#.%. Credit 'nits: $%

Course Contents:

4( !evelop static web pages of online book store

4) Use tables to lay-out a pageThe title of this webpage is LUsing 9ormsM. This should be shown in the title bar.The header LUser 7nformationM is a type ( headerO use the \h([ tag.The textarea for the address has , rows and )+ columns.The textbox for the password is a password textbox.The radiobutton for the ;ale gender is initially checkedThe radiobutton for Part-time status is initially checked.The checkboxes for sub ects 7"S )( 7"S)) and 7"S*, are initially checked.The drow-down dialogue box for year and course should contain S"S-( S"S-) S"S-* and S"S-,

but S"S-) should be initially chosen.Save this file as htmlex,.html.

4* 3alidate the Fegistration using 8ava script

4, "reate a basic web page following a set pattern

Nour page should have the following elements/ Nour name as a level one header About me as a level two header A short paragraph describing something interesting about yourself A level two heading saying something like ;y 9avorite things on the 7nternet A paragraph describing the things you like to do on the 7nternet

4 0rite down the "SS that would set the default color to blue for &evel ) headings $i.e. \h)[ elements% in a

document.

4B. Nou are reHuired to use div elements and "SS to achieve the layout. "reate each page with the following layout

?ote/ Nou must not use a table or frames for layout of the pages

4 6. "reate G;& document for user information


42/58

4 :. 0rite a !T! for an G;& document type that should store the marks attained by each student on each modulethey take. #ach student has a title $;r ;rs ;s or ;iss% a name and an email address $which is guaranteed to beuniHue%. 9or each mark it is sufficient to associate it with a module code $e.g. "")(*% it is not necessary to give anyfurther details of the module.

4=. !esign and sketch a web-based input form that would allow an administrator to input and edit the marks that a student has attained on each module $assume that the administrator has alreadylogged in to the system%.

4(+ !escribe the basic syntax of "SS with the aid of an example that would set the default color to red for normal paragraph text.

4 (( "reate a "SS file to render your G;& data and an G;& file linking to it. "all it filenameYcss.xml andfilename.css

4(). Civen that the \pre[ tag in 'T;& is used to present text such as program code explain the following "SSdeclaration and Suggest a likely purpose for it/

pre.codebox _border/ solidOpadding/ +. emO`

4(*. #xplain the various parts of the following 'T;& document including the definition and usage of the8avaScript code and describe the appearance of the web page it creates $the line numbers are for you to refer to andare not part of the 'T;&%.

\html[) \head[* \script typeZ text2 avascript [\Q--, messages Z 'ello CIday Dla on our O

function hello$%_B var rand Z ;ath.floor$messages.length@;ath.random$%%O6 document.write$messages rand %O: `= 22 --

BCA Syllabus 2013

Documents

Transcript of BCA Syllabus 2013