SCHEME OF EXAMINATION & DETAILED SYLLABUS For

BACHELOR OF COMPUTER APPLICATIONS (BCA) DEGREE

INDRAPRASTHA UNIVERSITY
SECTOR-16C, DWARKA, DELHI
Note : A Minimum of 40 Lectures is mandatory for each course.

GURU GOBIND SINGH

Syllabus of Bachelor of Computer Applications (BCA), approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. W.e.f. academic session 2011-12

Bachelor of Computer Applications
FIRST SEMESTER EXAMINATION
Code No. Paper L T/P Credits Marks Internal Marks External

THEROY PAPERS

BCA 101 Mathematics – I BCA 103 Technical Communication BCA 105 Introduction to Programming Language using C BCA 107 Introduction to Computers & IT BCA 109 Physics
PRACTICALS

3 3 3 3 3

1 0 1 1 1

4 3 4 4 4

25 25 25 25 25

75 75 75 75 75

BCA 151 Practical – I C Prog. Lab BCA 153 Practical – II IT Lab BCA Communication Skills 155* Total
*NUES TOTAL MARKS : 800

0 0 2 17

6 6 0 16

3 3 2 27

40 40 100 305

60 60 -----495

Syllabus of Bachelor of Computer Applications (BCA), approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. W.e.f. academic session 2011-12

Note : A Minimum of 40 Lectures is mandatory for each course.

Bachelor of Computer Applications
SECOND SEMESTER EXAMINATION
Code No. Paper L T/P Credits Marks Internal Marks External

THEROY PAPERS

BCA 102 Mathematics – II BCA 104 Principles of Management BCA 106 Digital Electronics BCA 110 Database Management System
PRACTICALS

3 3 3 3

1 0 1 1 1

4 3 4 4 4

25 25 25 25 25

75 75 75 75 75

BCA 108 Data Structure Using C 3

BCA 152 Practical – III DS Lab BCA 154 Practical – IV DBMS Lab BCA Cyber Ethics 156* Total
*NUES TOTAL MARKS: 800

0 0 2 17

6 6 0 16

3 3 2 27

40 40 100 305

60 60 -----495

Syllabus of Bachelor of Computer Applications (BCA), approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. W.e.f. academic session 2011-12

Note : A Minimum of 40 Lectures is mandatory for each course.

Net BCA 207 Principles of Accounting BCA 209 Object Oriented Programming using C++. Paper L T/P Credits Marks Internal Marks External THEROY PAPERS BCA 201 Mathematics – III BCA 203 Computer Architecture BCA 205 Front End Design Tool VB.e. PRACTICALS 3 3 3 3 3 1 1 1 0 1 4 4 4 3 4 25 25 25 25 25 75 75 75 75 75 BCA 251 BCA 253 BCA 255* Practical – V . approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. W.NET Lab Practical – VI C++ Lab Software Development Skills Total 0 0 2 17 6 6 0 16 3 3 2 27 40 40 100 305 60 60 -----495 *NUES TOTAL MARKS: 800 Syllabus of Bachelor of Computer Applications (BCA). .f.Bachelor of Computer Applications THIRD SEMESTER EXAMINATION Code No. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.

W.Bachelor of Computer Applications FOURTH SEMESTER EXAMINATION Code No. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.f. . approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.e. Viva-Voce will be conducted in fifth semester. Syllabus of Bachelor of Computer Applications (BCA). Paper L T/P Credits Marks Internal Marks External THEROY PAPERS BCA 202 Mathematics – IV BCA 204 Web Technologies BCA 206 Java Programming BCA 208 Software Engineering BCA 210 Computer Networks PRACTICALS 3 3 3 3 3 1 1 1 1 1 4 4 4 4 4 25 25 25 25 25 75 75 75 75 75 BCA 252 Practical – VII Java Lab BCA 254 Practical – VIII Web Tech Lab BCA Personality 256* Development Skills Total 0 0 2 17 6 6 0 13 3 3 2 28 40 40 100 305 60 60 -----495 *NUES TOTAL MARKS: 800 Summer Training will be held for 4 weeks after the end of fourth semester.

academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.e. .f. *** Any Elective Subject will be offered if minimum 1/3 rd of the total strength of students in the class will opt for it.Commerce ***ELECTIVES (Select any One) 3 3 3 1 1 1 4 4 4 25 25 25 75 75 75 BCA 307 Software Testing BCA 309 Microprocessor BCA 311 Advance Computer Networks BCA 313 Web Based Programming BCA 315 Business Economics PRACTICALS 3 3 3 3 3 1 1 1 1 1 4 4 4 4 4 25 25 25 25 25 75 75 75 75 75 BCA 351 BCA 355* BCA 357 Practical – IX CG Lab Summer Project/ Training Minor Project Total 0 0 --12 8 0 8 20 4 2 4 26 40 100 40 280 60 -----60 420 *Evaluation will be based on Summer Training held after fourth semester and will be conducted by the college committee only. Paper L T/P Credits Marks Internal Marks External THEROY PAPERS BCA 301 Operating System BCA 303 Computer Graphics BCA 305 E.Bachelor of Computer Applications FIFTH SEMESTER EXAMINATION Code No. **NUES TOTAL MARKS: 700 Syllabus of Bachelor of Computer Applications (BCA). W.

academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. W. However.e. Total Marks : 700 *** Any Elective Subject will be offered if minimum 1/3 rd of the total strength of students in the class will opt for it.f. for the award of the degree a student shall be required to earn the minimum of 150 credits. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Each student shall be required to appear for examinations in all courses. . The total number of the credits of the BCA programme = 160. Paper L T/P Credits Marks Internal Marks External THEROY PAPERS BCA 302 Data Ware Housing & Data Mining BCA 304 Mobile Computing BCA 306 Linux Environment ***ELECTIVES (Select any One) 3 3 3 1 1 1 4 4 4 25 25 25 75 75 75 BCA 308 Multimedia & Its Applications BCA 310 Bio Informatics BCA 312 Artificial Intelligence BCA 314 Network Security BCA 316 Network Programming PRACTICALS 3 3 3 3 3 0 ---2 14 1 1 1 1 1 4 10 0 18 4 4 4 4 4 2 5 2 25 25 25 25 25 25 40 40 100 280 75 75 75 75 75 60 60 420 BCA 352 Practical – X Linux Lab BCA 356 Major Project BCA Seminar 358** Total Note: 1. Syllabus of Bachelor of Computer Applications (BCA).Bachelor of Computer Applications SIXTH SEMESTER EXAMINATION Code No. 2.

5 marks UNIT . approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. [T3] Apostol Tom M. John Wiley & Sons. Chain Rule. [No. 1. Grewal. It should be of 25 marks. Chand & Company. 9th Revised Edition. W. Vol I and II John Wiley (2003). 1998. Intermediate Value Theorem. . Inverse. 2. [No.S. Integration of Algebraic and transcedental Functions. rest of the paper shall consist of four units as per the syllabus. of Hrs: 12] UNIT – IV INTEGRATION: Integral as Limit of Sum. Derivatives of Composite Functions. [No. S. Indefinite Integrals. Addition. Logarithmic Differentiation. Pearson Education. 1 should be compulsory and cover the entire syllabus. Partial Fractions. Objectives  To get the knowledge about the matrices. S. Gamma and Beta Functions. Computation of Limits of Various Types of Functions. Calculus. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. of Hrs: 10] UNIT-III DIFFERENTIATION: Derivative. Fundamental Theorem of Calculus. 5th Edition. Successive Differentiation & Liebnitz Theorem. Dass. Cramers Rule. “Differential Calculas”. Question No. Eigen Vectors of a Matrix. “Advanced Engineering Mathematics”.  To study the basics of differential and integral calculus L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. Product & quotients.f. Properties of Determinants. of Hrs: 12] UNIT – II LIMITS & CONTINUITY: Limit at a Point. REFERENCE BOOKS: [R1] B. 2001. [R2] H. Riemann Sum. Differences.. L’ Hospitals Rule.Paper Code: BCA 101 Paper ID: 20101 Paper: Mathematics – I Aim: To understand the basic concepts of mathematics. However. Expansion of Functions (Maclaurin’s & Taylor’s).1999. MATRICES: Definition.e. “Elementary Engineering Mathematics”. Every unit should have two questions. Continuity at a Point. Asymptote. Minors. Types of Matrices.K. [R3] Shanti Narayan. Reduction Formulae for Trigonometric Functions. Adjoint. Cofactors. “Engineering Mathematics”. [T2] Babu Ram. Type of Discontinuities. 1998 Syllabus of Bachelor of Computer Applications (BCA). Apart from Question No. Derivatives of Sum. Indeterminate Forms. Each question should be 12. Rolle’s Theorem. “Advanced Engineering Mathematics”. of Hrs: 10] TEXT BOOKS: [T1] Kresyig E. determinants and limits.Chand & Company. Subtraction.. 34th Ed. Maxima & Minima. Scalar Multiplication and Multiplication of Matrices.I DETERMINANTS: Definition. Caley-Hamilton Theorem (without proof) [No. Properties of Limit. Methods of Integration Substitution. Continuity Over an Interval. This question should have objective or short answer type questions. Rank of Matrix Dependence of Vectors. By Parts. student may be asked to attempt only 1 question from each unit. Mean Value Theorem.

To improve oral as well as written communication skills. The Role of Technical Writing. Basic Principles of Technical Writing. Form & Content of an application. T3. Styles in Technical Writing. Disadvantages of oral communication. types. Merits and demerits of written communication. Each question should be 12. Maximum Marks: 75 INSTRUCTIONS TO PAPER SETTERS: 1.T3. drafting the application.[T1. Media of oral communication. W. [T1.] [No. Job Application: Types of application. 2. Format of report. 1. Writing Proposals. T4] [No.e. Persuasive letters. Letter styles/ layout. Report Writing: Meaning & Definition. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Preparation of resume. Office memorandum. Importance of communication. Layout of the report. Question No.Paper Code: BCA 103 Paper Id: 20103 Paper: Technical Communication Pre-requisites: None L 3 T 0 C 3 Aim : To Understand the correct use of English Language and improve the Communication Skills of the students. Overview of Technical Research and Report Writing : Definition and Nature of Technical Writing. Writing Letters: Business letters. Verbal and Non-Verbal communication. Properties/features and process of Technical Writing. However. Sales letters. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Types of report (Business report & Academic report). and aids to communication. 1 should be compulsory and cover the entire syllabus. End-products of Technical Writing. UNIT-I Concepts and Fundamentals: Introduction to Technical Communication. of Hrs: 11] UNIT-III Oral Communication: Principles of effective oral communication. Essential requirement of good report writing. The Wholistic Guide of Technical Writing . Persuasive writing. student may be asked to attempt only 1 question from each unit. T2. . Planning and preparing of effective business messages. of Hrs: 11] UNIT-II Written Communication: Objectives of written communication.f. Objectives   To have basic understanding of the correct use of English Language. Channels of communication. Syllabus of Bachelor of Computer Applications (BCA). This question should have objective or short answer type questions. Factors responsible for growing importance of communication. Apart from Question No. Process of communication. Formal and Informal communication. Styles of oral communication. It should be of 25 marks. Communication models and theories. Media of written communication. rest of the paper shall consist of four units as per the syllabus.5 marks. Good news and bad news letters. meaning of communication. Barriers of. Drafting the report. Every unit should have two questions. Communication scope. Advantages of oral communication.T2. Essentials of good communication .The seven Cs of communication.

W.S.e. process. Types of interview. Project Presentations: Advantages & Disadvantages. Himalaya Publishing House. of Hrs: 11] TEXTBOOKS: [T1] Kavita Tyagi and Padma Misra .Communication”. [R4] Herta A Murphy. Principles of good listening.A self study reference and practice book for elementary students of English” . second edition. of Hrs: 11] UNIT-IV Soft Skills: Non Verbal communication. PHI. proposals. Common problems with verbs. “Business Communication – Concepts. bargaining. adjectives. adverbs. “Business Communication”. Pearson. seventh edition. [T3.T2. second edition. Guidelines for interviewee. interpersonal skills. Cases and Applications”. 2011 [T2] P. Negotiation process (preparation. questions & answers. “Effective Business Communication”. nature. “Advanced Technical Communication”. Guidelines for Interviewer. “Basic Technical Communication”. R3] [No. idiomatic use of prepositions. (2007). R1. “C. Electronic media (power-point presentation). Charts. Listening Skills: Good listening for improved communications. V. Syllabus of Bachelor of Computer Applications (BCA). ECC Graphics.Chaturvedi and Mukesh Chaturvedi. 1994.Business Etiquettes [T1. Interview styles. Corporate communication skills . summing up). academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Distribution of time (presentation. Herbert W Hildebrandt and Jane P Thomas. [T4] Asha Kaul .T4] [No. suffix.D. speaking and listening skills. implementation). Quezon City.T4] Language Skills: Improving command in English. Planning and organization of meetings. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. [R2] Manalo. Art of listening. prefix. parlanguage. Kind of meetings. types and importance of listening. agreement. Cambridge University Press. McGraw Hill. Meaning.T2. [T1. Sentences and paragraph construction. Barriers in listening Negotiation Skills : Definition of negotiation. T3. Executive Summary. Structure. Factors that can influence negotiation. Technical and Report Writing. improve spellings. discussions. punctuations. Strategies to. . PHI. E. [R3] Kavita Tyagi and Padma Misra . Art of interviewing. & Fermin. improving vocabulary. Visual presentation. pronouns. 2011. presentation. PHI. “Essential English Grammar.Interviews: Meaning & Purpose. Meetings: Definition. conjunctions. what skills do we need to negotiate. second edition. Guidelines for using visual aids.f. [T3] Rayudu. REFERENCES: [R1] Raymond Murphy. choice of words.kinesics & Proxemics. tenses. improve oral. Essential Features. introduction to Business English. Advantages and disadvantages of meetings/ committees.

Storage Classes: automatic.f. continue operator. conio.h. W. if….. external (global).h. definition & scope. variables and arrays. nested control statement.while statement.[T1.5 marks. Data types. conditional operators. This question should have objective or short answer type questions.else statement. macro’s with arguments. rest of the paper shall consist of four units as per the syllabus.h. of Hrs: 11] UNIT – III Structures: Structures.T2. Identifiers and keywords. C constructs: If statement. dynamic memory allocation. comma operator. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. constants. relational and logical operators. It should be of 25 marks. array of pointers. Syllabus of Bachelor of Computer Applications (BCA). array & pointer relationship. Preprocessor directives: #include. Apart from Question No.T3] [No. if…. pointers to functions. pointer arithmetic. for statement. symbolic constants. of Hrs: 11] UNIT – IV String manipulation functions and other standard library functions from stdio. break operator. the operators # and ##.h. Arrays: Arrays. student may be asked to attempt only 1 question from each unit. . do….T2. file handling [text (ASCII).else if…. binary] [T1. stdlib. pointer to arrays. call by reference. array of pointers to functions. static & registers. Question No.Paper Code: BCA 105 Paper Id: 20105 Paper: Introduction to Programming Language using C Pre-requisites: None L 3 T 1 C 4 Aim : To Understand the Programming Fundamentals and the basics of the ‘C’ Programming Language. However. 1 should be compulsory and cover the entire syllabus. unions. [T1.h. passing structure to functions. bit operators. process.h. switch statement.T3] [No. expressions statements. Maximum Marks: 75 INSTRUCTIONS TO PAPER SETTERS: 1.T2. UNIT I C basics: C character set.else statement. Each question should be 12. while statement. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. arithmetic operators. . conditional compilations. unary operators. of Hrs: 11] UNIT – II C Functions: Functions: declaration.e. math. Every unit should have two questions. 1. goto statement. string. pointers.T3] [No. bit fields. compound statements. Objectives:   To be able to build own logic for a given problem and finally develop one’s own programs To understand the syntax and the semantics of C programming language.h. recursion. declarations. assignment operators. 2. ctype. #define. call by value.

“C The Complete Reference” Fourth Edition. 2000. BalaGuruswamy. “Computer Basics and C Programming”. [R2]Yashwant Kanetkar. “Computer Basics and C Programming”. T3] [No. PHI. 2001. [T3]V Rajaraman. Syllabus of Bachelor of Computer Applications (BCA). REFERENCES: [R1]Herbert Schildt. . T2. 2008. [T2]E. [R5]Schaum’s Outline Series.f. [R3]Kernighan and d.e. of Hrs: 11] TEXTBOOKS: [T1]Ashok N. “Let us C” eighth edition. “Programming with C”. 2002. W. 2000. “The ANSI C Programming Language”. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Ritchie. 1996. [T1. Kamthane. [R4]Stephenn Prata. “Programming in ANSI C”. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Pearson Education. “C Primer Plus” Fourth Edition.Usage of command line arguments. 2nd Edition.

Apart from Question No. Every unit should have two questions. data. Upon completion of this course the student should be able to:  Discuss the evolution of computers in different generations. [T1][T2][R3] [No. Use of complements to represent negative numbers. MS Powerpoint. Parallel Computers.5 marks. It should be of 25 marks.Conversion: Decimal to all other number systems. Each question should be 12. Serial Access Memory. of Hrs: 12] UNIT – III Computer Number System: Decimal. 1. flow chart.  Classify computers in different categories based on their capabilities. Hexa-decimal.  Describe the major components of computers and information technology applications: Hardware. Binary to octal and hexa decimal. Unicodes. [T1][R1] [No. The paper setters are required to restrict upto the overview of the concepts. Memory Organization. Output Units. rest of the paper shall consist of four units as per the syllabus. interpreters.f. Gray codes. EBCDIC codes. linkers Elementary Operating System concepts. Binary Coded Decimal(BCD). Read Only Memory. Distributed Computer System. Octal. . software. pseudo code. Computer Hardware: Major Components of a digital computer. Low level languages and introduction to high level languages.  Demonstrate an understanding of the importance of algorithms in the development of IT applications. W. floppy Disk Drives. ASCII Codes. Description of Computer Input Units. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. decision tables. assemblers. Objectives This is an elementary course in computers and information technology. of Hrs: 10] Syllabus of Bachelor of Computer Applications (BCA). CPU. Mainframe and super computers. Application Software: Introduction to MS Office (MS-Word. Magnetic Hard disk. UNIT – I Introduction to Computers: The evolution of computers: Computer Generation from First Generation to Fifth Generation. Binary subtraction. Mini. different types of operating systems. of Hrs: 12] UNIT – II Interaction With Computers: Computer Software: System software. 2. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. Conversion of a binary fraction to a decimal fraction and decimal to binary fraction. Computer Memory: Memory Cell. MS-Excel) Computer Programming and Languages: Algorithms. Block Diagram of a computer Input-output devices.Paper Code:BCA 107 L T C Paper ID: 20107 3 1 4 Paper: Introduction to Computers and IT Pre-requisites:None Aim:To provide the students Basic knowledge of computers and information technology. Binary.1 should be compulsory and cover the entire syllabus. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Question No. 3. student may be asked to attempt only 1 question from each unit.[T1][R1] [No. However. computer networks and people. This question should have objective or short answer type questions. Addition of binary numbers. processes. Magnetic Tape Drives. Classifications of Computers: Micro.e. compilers. Physical Devices Used to construct Memories. Compact Disk Read Only Memory.

Client and Servers . 2004. 4th Ed. 1992.New Age Intl. Data Transmission speed. Intranet. Chat . approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Wiley Dreamtech. URL. Network topologies. BPB Publications. Digital and Analog Transmission. K. WAN and MAN).e. [T2] Anita Goel “Computer Fundamentals”. W. Instant Messaging. REFERENCE BOOKS [R1] B. Telnet. Data transmission media. [R2] Alex Leon & Mathews Leon. Data transmission modes. “Comdex Computer Kit”. “Introduction to Computers”.f. Domain name. [R3] Norton Peter. [T1][T2][R1][R2] [No. [R4] Vikas Gupta. 2001. TMH. World Wide Web. Sinha & Priti Sinha .UNIT – IV Computer Network & Internet Basic elements of a communication system. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. “Introduction to computers”. Overview of various services on Internet: E-mail. Delhi. Syllabus of Bachelor of Computer Applications (BCA). Vikas Publishing .. Internet: Terminologies related to Internet: Protocol.Ram Computer fundamentals Architecture and Organization. . of Hrs: 10] TEXT BOOKS [T1] P. Network Types (LAN. “Computer Fundamentals”. IP address. Pearson. FTP. Extranet.

Grouping of resistance. Types of friction. Vol1. Postulates of Bohr’s Model. “Modern ABC of Physics”. velocity of vehicle on curved leveled and banked road. Centripetal and centrifugal force. insulators and semi conductors. Frictional electricity. State & Proof of Gauss’s theorem. Energy & Power: Work. Inelastic collision in 1D. elastic collision in 1D & 2D.K. Current carriers in semiconductors. Electrostatics: Line integral of electric field. Current Electricity: Current. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Integrated Circuit. into K. work. Biasing of p-n junction. Light emitting diode. Transistors: Action of n-p-n & p-n-p transistors. Law of inertia or Newton’s first law of motion. Conservative force. Rest of the paper shall contain two questions from each unit. Advantages of transistors. Rutherford’s alpha scattering experiment and atomic model. [T1] [T2] [No.[T3] [T4] [No. Potential Energy. Power. Perfectly inelastic collision in 1D. Electrostatic potential. Wheatstone bridge. Grouping of capacitors and their capacitance. of Hrs: 11] UNIT – IV: Structure of Atom: Thomson’s atomic model. semiconductors and devices. Krichoff’s rule.E. Semiconductors: Energy bands in solids. UNIT – I Law of Motion: Force and Inertia. 2. Basic forces in nature. of Hrs: 11] UNIT – II Work. Laws of friction. . of spring.5 marks. W.E. Question No. power and energy  To study the electrostatics. Coulomb’s Law. Intrinsic semiconductor. Extrinsic semiconductors. Lemi’s Theorem Friction: Cause of friction. Difference between metals. Work energy theorem. It should be of 25 marks and it may contain objective or short type question.f. Equilibrium of concurrent forces. Effect of dielectric in capacitors. Electric field intensity. Properties of electric charge. Slide Wire Bridge. Newton’s Second law of motion. Modern Publishers. Angle of friction and repose. Newton’s third law of motion and it’s applications. Capacitance: Principal of Capacitor. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.e. INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Superposition Principle. Doping. Weight of body in lift. Syllabus of Bachelor of Computer Applications (BCA). Ohm’s Law. Gupta. 1 should be compulsory and over the entire syllabus. However students will attempt only one question from each unit. of Hrs: 11] TEXTBOOKS: [T1]: S. Resistance. Electric Lines of forces. [T3] [T4] [No. Kinetic Energy. Parallel and spherical capacitors. Conservation of gravitational P. Collisions: Types of collision. [T1] [T2] [No.Paper Code : BCA 109 L T C Paper ID: 20109 3 1 4 Paper : Physics Aim: To know the fundamentals of Physics Objectives  To get the knowledge about the basic laws of nature such as motion.E. Electron theory of electrification. Formation of p-n junction. P. of Hrs: 11] UNIT – III Electricity & electromagnetism: Electric charge. Each question should be 12..

. Gupta. Class XII.f. W. [T4]: Pradeep. “Fundamental Physics”. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Class XI. “Fundamental Physics”. Vol2. “Modern ABC of Physics”.e. Pradeep Publications. [T3]: S. Pradeep Publications. Syllabus of Bachelor of Computer Applications (BCA). approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Modern Publishers.K.[T2]: Pradeep.

Hashing functions. 2. Representation of POSETS using Hasse diagram. Apart from Question No. Composite and Inverse Functions. “Discrete Mathematics”. Chains.H. 2000. Principle of Duality. cut-edges & cut vertices. K. Recursive function. Intersection and Complements of Sets. Basic logical operation. predicates. Simple Applications. Basic Properties. Union. Sublattices. “Discrete Maths”. However. student may be asked to attempt only 1 question from each unit..K. W. lub. [T1[T2] [No. Busby and Ross.Paper Code: BCA 102 Paper ID: 20102 Paper: Mathematics – II L 3 T 1 C 4 Aim: To understand the basics concepts of Discrete Mathematical Structures. Into and One to One Functions. Algebra of Proposition. Maximal and Minimal Point. tautologies. adjacent and incidence matrices. “Discrete Mathematical Structure”. graph colouring. Pearson Education REFERENCE BOOKS: [T1]S. of Hrs: 10] UNIT-III Graphs: types and operations(bipartite graph. First order logic. Finite and Infinite Sets. Discrete Mathematics and its Applications. [T1][T2] [No. of Hrs: 12] UNIT – IV Propositional Logic: Proposition. . This question should have objective or short answer type questions. Operation on Sets. 1 should be compulsory and cover the entire syllabus. of Hrs: 11] TEXT BOOKS: [T1]Rosen.  To study the basics of lattices and graphs. Chand & Co. Every unit should have two questions. hamiltonian graph. Cardinality of Set. 1. Distributed & Complemented Lattices. contradictions. path circuit(Floyd’s and Warshall algorithms). Lattices & Algebric Systems.. (2006) 6th ed.e.f. rest of the paper shall consist of four units as per the syllabus. S. [T1][T2] [No. Sarkar. degree of graphs. Onto. Equal Sets Universal Sets. Subsets. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Cartesian Product. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. Equivalence Relation. Objectives  To get the Knowledge about sets.5 marks UNIT I SETS: Sets. Universal and existential quantifiers. Each question should be 12. Subgraph. McGraw Hill. 1996. isomorphic and homomorphic graphs). distance of a graph. logical equivalence. [T2]Kolman. RELATIONS AND FUNCTIONS: Properties of Relations. PHI. Glb. It should be of 25 marks. truth tables.  To get familiar with propositional logic. Syllabus of Bachelor of Computer Applications (BCA). of Hrs: 11] UNIT – II PARTIAL ORDER RELATIONS AND LATTICES: Partial Order Sets. [T3]Babu Ram. logical implications. [T1][T2] [No. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Partial Order Relation Function: Domain and Range. relations and functions. Question No.

J. W. Tata McGraw Hill. (2007). R.. .[T2]Tremblay. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. and Manohar. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.e. Discrete Mathematical Structures with Applications to Computer Science.P. Syllabus of Bachelor of Computer Applications (BCA).f.

Systems & Contingency) [Elementary][T1. Staffing: Nature & Importance. Neo classical. Objectives  To get the knowledge about the important management concepts & their application. Herzberg Two factor. student may be asked to attempt only 1 question from each unit. This question should have objective or short answer type questions.Chand & Sons. Controlling: Nature.-12] UNIT – II : Planning: Meaning.Paper Code: BCA – 104 Paper ID: 20104 Paper: Principles of Management Pre-requisites: None L T 3 0 C 3 Aim: To understand the function of management and their application in the corporate world.R1] [No. Decentralization. Roles & skills of a manager. Decision making: Concept & process. REFERENCE BOOKS [R1] Stoner. Behavioral. Pearson International.R1] [No. of hrs. Need of understanding human behavior in organization.f. Management process (in brief). Each question should be 12. 1. Perception & Attitude Building. “Management” 6th Edition. 1 should be compulsory and cover the entire syllabus. Models of OB. Every unit should have two questions. However.Meaning. of hrs.[T1. 2009.Personality. UNIT – I Management: Meaning & concept. Directing: Motivation: concept & theories (Maslow’s. Purpose & process. significance & Process of control. Leadership: Concepts & styles.  To make students well versed with programming in java.e. Importance. Managerial levels. Learning.-10] TEXT BOOKS [T1] Dr. Major concepts in OB (elementary). INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1.Freeman & Gilbert. C. Management principles (Fayol & Taylor). 2. It should be of 25 marks. Question No. Authority & Responsibility relationships. of hrs. Apart from Question No.R1] [No.-12] UNIT – IV Managing People . academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.R2.  To have an insight of various functional departments in an organization. [T1.5 marks. Syllabus of Bachelor of Computer Applications (BCA). . nature & importance of staffing.-10] UNIT-III Staffing: Concept.B Gupta “Management concepts & practices” S. R3] [No. [T1. Management Theories (Classical. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. rest of the paper shall consist of four units as per the syllabus. Organizing: Process. W. McGregor’s theory X & Y) . of hrs. Departmentation.

[R2] [R3] Ankur Chhabra. Stephen P.f. Sun India Publications. “Organisational Behaviour”. . 2010 Syllabus of Bachelor of Computer Applications (BCA). 2009 Robbins. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.e. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. “Organisational Behaviour”. W. PHI.

Fanin. EX-OR and EX-NOR gates. Modulo Counters. Shift Registers Serial-in-serial-out. Ring Counter.T2. Hexadecimal). Octal. Every unit should have two questions. .Paper Code: BCA . academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.DTL. 2. Logic Gates. However. decoders.5 marks.f. This question should have objective or short answer type questions.CMOS – (Main features only . Bi-directional shift register. UNIT-I Logic gates NOT . Combinational Circuits Multiplexers. Diode and Transistor as a switch Logic Families-RTL. T. student may be asked to attempt only 1 question from each unit. 1. Objectives  To learn about the design principles of different digital electronic circuits  To study the applications of above circuits INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Gray codes and Excess – 3 codes and their application (without design of code convertors) Parity generation and Checking. parallel-in-serial-out and parallel-in-parallel-out. Parallel binary adder/Subtractor. binary multiplier and dibvider. W. D. of Hrs: 11] UNIT-II Review of various number systems (Binary. Race around condition.ECL. De-Multiplexers.R3] [No. Universal gates. NOR. [T1..T2.NAND . noise margin.without details of circuit connections and working). 1 should be compulsory and cover the entire syllabus. Simplifications of Boolean equations using K-maps. Fan-out Boolean Algebra Basics Laws of Boolean Algebra.TTL.106 Paper: Digital electronics Paper Id 20106 Pre-requisite :  Physics Aim  L 3 T/P 1 C 4 To understand various digital systems and their applications. encoders. Definition of. Arithmetic Circuits Adder. J-K. OR.[T1. Question No.R3] [No.current and voltage parameters.T2. Twisted Ring Syllabus of Bachelor of Computer Applications (BCA). of Hrs: 11] UNIT-III Flip-flops S-R. Apart from Question No. Subtractor. It should be of 25 marks. Clocked Flip-flop.T3] [No. serial-in-parallel-out. Master slave Flip-Flop. Each question should be 12.e. Realisation of one flip-flop using other flip-flop. AND.[T1. Synchronous Counter. of Hrs: 11] UNIT-IV Counters Ripple counter. rest of the paper shall consist of four units as per the syllabus. Definition of BCD . approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.

Salivahanan & S. Principles and Applications”.Tokheim. R.T3. “Digital Systems “ . “Modern Digital Electronics”.f. W.R3] [No. [R3]. 2003.T2. Pearson . [T2]. . TMH. PHI. Arivyhgan. 2002. of Hrs: 11] TEXT BOOKS [T1]. 3rd Edition.RAM. [T3]. “Digital electronics”. Jain. TMH. Malvino Leach. PHI Publications. Raj Kamal. 2001. Syllabus of Bachelor of Computer Applications (BCA). PAL & PLA [T1. 1999. ROM.L. [R4]. “Digital Logic and Computer Design”. R. Vikas Publication. [R2]. "Digital Principles and Application". REFERENCES: [R1]. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.Counter. Principles and Design. Moris Mano. S.2011. Tata McGraw Hill. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. “Digital circuits and design”.Gothman.e. P. W. “Digital Electronics. Memory Devices . 1999.

Paper Code: BCA 108 Paper ID: 20108 Paper : Data Structures Using C Pre-requisites: BCA 105

L 3

T 1

C 4

Aim : To Understand the use of the basic data structures along with their applications. Objectives   Understand the use and working of the various data structures. Learn to be able to build own algorithms and pseudocodes for the various applications of the basic data structures. Maximum Marks: 75

INSTRUCTIONS TO PAPER SETTERS:

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be 12.5 marks. UNIT-I Introduction to Data Structures : Basic Terminology, Elementary Data Organizations, Classification of data structures and its operations. Arrays: Representation of single and multidimensional arrays (up to three dimensions) ; sparse arrays - lower and upper triangular matrices and Tri-diagonal matrices; addition and subtraction of two sparse arrays. (Multidimensional, and, sparse arrays, to be given elementary treatment.) Stacks and Queues: Introduction and primitive operations on stack; Stack application: Polish Notations; Evaluation of postfix expression; Conversion from infix to postfix; Introduction and primitive operations on queues; D-queues and priority queues.[T1,T2,T3] [No. of Hrs: 11] UNIT-II Lists: Introduction to linked lists; Sequential and linked lists, operations such as traversal, insertion, deletion, searching, Two way lists and Use of headers Trees: Introduction and terminology; Traversal of binary trees; Recursive algorithms for tree operations such as traversal, insertion and deletion; [T1, T2, T3] [No. of Hrs: 11] UNIT-III Introduction to and creation of AVL trees and m-way search trees - (elementary treatment to be given); Multilevel indexing and B-Trees: Introduction; Indexing with binary search trees; Multilevel indexing, a better approach to tree indexes; Example for creating a B-tree. [T1, T2, T3] [No. of Hrs: 11] UNIT-IV Sorting Techniques: Insertion sort, selection sort and merge sort. Searching Techniques: linear search, binary search and hashing. (Complexities NOT to be discussed for sorting and searching) [T1, T2, T3] [No. of Hrs: 11]
Note : A Minimum of 40 Lectures is mandatory for each course.

Syllabus of Bachelor of Computer Applications (BCA), approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. W.e.f. academic session 2011-12

TEXTBOOKS: [T1] Ashok N. Kamthane, “Introduction to Data Structures in C”, Pearson Edu. [T2] Y. Langsam, Tananbaum, et. al., “Data Structures using C and C++”, PHI, 1999. [T3] Schaum’s outline series, “Data Structure”, TMH, 2002 REFERENCES: [R1] Yashwant Kanetkar, “Data Structures Through C”,BPB Publications, 2008 [R2] A.K. Sharma, “ Data Structure Using C”, Pearson [R3] P. S. Deshpande and O.G. Kakde, “C & Data Structure”, Wiley Dreamtech, 1st Edition, 2003. [R4] Richard F. Gilberg & Behrouz A. Forouzan, “ Data Structures – A Pseudocode Approach with C”, second edition, COURSE TECHNOLOGY, CENGAGE Learning [R5] E. Horowitz and S. Sahani, “Fundamentals of Data Structures”, Galgotia Booksource Pvt. Ltd, 2003

Syllabus of Bachelor of Computer Applications (BCA), approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. W.e.f. academic session 2011-12

Note : A Minimum of 40 Lectures is mandatory for each course.

Paper Code: BCA 110 Paper ID: 20110 Paper: Database Management System Pre-requisites:  Basic knowledge of data storage and file management system

L 3

T 1

C 4

Aim: To introduce the concept of Back end, data storage in computers, design of a DBMS, Queries to construct database, store and retrieve data from the database Objectives:  To understand difference between storing data in FMS and DBMS and advantages of DBMS.    To understand conceptual and physical design of a database. To understand RDBMS and queries to design database and manipulate data in it. To know basic database backup and recovery. Maximum Marks: 75

INSTRUCTIONS TO PAPER SETTERS:

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be 12.5 marks. 3. Only basic level E-R diagram must be asked and complete scenario must be provided. UNIT-I Introduction: An overview of database management system, database system Vs file system, Characteristics of database approach, DBMS architecture , data models, schema and instances, data independence. Data Modeling using Entity Relationship Model: Entity, Entity types, entity set, notation for ER diagram, attributes and keys, Concepts of composite,derived and multivalued attributes, Super Key, candidate key, primary key, relationships, relation types, weak entities, enhanced E-R and object modeling, Sub Classes:, Super classes, inheritance, specialization and generalization.[T1],T2][T3][R1] [No. of Hrs.: 10] UNIT – II Introduction to SQL: Overview , Characteristics of SQL. Advantage of SQL, SQL data types and literals. Types of SQL commands: DDL, DML, DCL. Basic SQL Queries. Logical operators :BETWEEN, IN, AND, OR and NOT Null Values: Disallowing Null Values, Comparisons Using Null Values Integrity constraints: Primary Key, Not NULL, Unique, Check, Referential key Introduction to Nested Queries, Correlated Nested Queries, Set-Comparison Operators, Aggregate Operators: The GROUP BY and HAVING Clauses, Joins: Inner joins, Outer Joins, Left outer, Right outer, full outer joins. Overview of views and indexes. [T1],[R2] [No. of Hrs.: 12]
Syllabus of Bachelor of Computer Applications (BCA), approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. W.e.f. academic session 2011-12

Note : A Minimum of 40 Lectures is mandatory for each course.

“Fundamentals of Database Systems”. Galgotia Publications. “Understanding the new SQL: A complete Guide”. Morgan Kaufmann Publishers.UNIT – III Relational Data Model: Relational model terminology domains. characteristics of relations. [T2] Singh S. key constraints and constraints on null. 1996. design and application”.5 th Ed. set difference and division.T2][T3][R1] [No..2PL. [T1]. validation Elementary concepts of Database security: system failure. “Database Management Systems”. Desirable ACID properties. W. Elmarsi and SB Navathe. Battacharya.T2][T3] [No. Join operations: Inner . REFERENCE BOOKS: [R1]Abraham Silberschatz. “Database Systems Concepts”. Backup and Recovery Techniques. [R4]Bipin Desai. Normal form up to 3rd normal form. Relations. serializable and non serializable transactions Concurrency Control: Definition of concurrency. TMH. relational constraints domain constraints. of Hrs. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Sudarshan. relational DB schema. of Hrs. Data Normalization: Functional dependencies. lost update. [T1]. Syllabus of Bachelor of Computer Applications (BCA). Majumdar. TMH.Left outer. overview of serializability. Set Theoretic operations Union. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. 1991. Pearson Education [T3] Ramakrishnan and Gherke.e.: 12] UNIT – IV Transaction processing and Concurrency Control: Definition of Transaction. McGraw Hill.Codd’s Rules Relational algebra: Basic operations selection and projection. authorization and authentication. P. multiversioning. “An Introduction to database Systems”. Alan Simon.Timstamp ordering. Intersection. 1997. . Right outer and full outer join. “Database System Concepts. Henry Korth. K. 1993. Armstrong’s inference rule. Tuples. Outer . Attributes. Pearson. “Data Base Management Systems’.K. ER to relational Mapping: Data base design using ER to relational language. S.: 10] TEXT BOOKS: [T1] R. 4 th Edition. dirty read and incorrect summary problems due to concurrency Concurrency Control Techniques: Overview of Locking. [R2]Jim Melton.f. [R3]A.

real world application using IT tools [No. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. maximization in an assignment. Every unit should have two questions. usage & application in business decision making. of Hrs: 11] UNIT – III Linear Programming & Queuing Concept a assumptions usage in business decision making linear programming problem: formulation. Histogram. methods of solving: graphical and simplex. 1. Apart from Question No. significance.f. Measures of variation – range. However. Graphic presentation of frequency distribution – graphics. coefficients of determination and correlation. Pitfalls and limitations associated with regression and correlation analysis. of Hrs: 11] UNIT – II Correlation/Regression Correlation Coefficient. W. IQR. student may be asked to attempt only 1 question from each unit. Spearman’s rank correlation. Birth-Death queuing models and its steady state solution.e. Importance & Limitation. median and mode. Macmillan India Syllabus of Bachelor of Computer Applications (BCA).CPM [No. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. Question No. Maximization of transportation problem. Operations Research: problems & solutions. measurement of correlation. Measures of central tendency – mean. unbalanced assignment problem. It should be of 25 marks. [No. 2. Objectives : To get the knowledge about the important mathematical concepts & their application. .Paper Code: BCA 201 Paper: Mathematics – III Paper ID 20201 Pre-requisites: Mathematics I and Mathematics II L 3 T 1 C 4 Aim : To Understand the use of the basic data structures along with their applications. Collection of data and formation of frequency distribution.K. solution methods of assignment problem. transportation problem.5 marks. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.Karl Person’s Methods. of Hrs: 11] UNIT – IV Transportation & Assignment Problem General structure of transportation problem. concept. problems with mixed constraints: duality. Bars. Diagrammatic. quartile. Queuing Models: Basic structure of queuing models. PERT. Assignment problem approach of the assignment model. concurrent deviation the correlation coefficient. M/M/1 and M/M/C models with infinite/finite waiting space. UNIT – I Measures of Central Tendency & Dispersion Definition. Each question should be 12. of Hrs: 11] TEXT BOOKS [T1] Sharma.. Assumptions of correlation analysis. deciles and percentiles. methods for finding initial solution. deciles and percentiles. restriction on assignment. rest of the paper shall consist of four units as per the syllabus. This question should have objective or short answer type questions. solution procedure for transportation problem. test for optimality. partition values – quartiles. 1 should be compulsory and cover the entire syllabus. J. [No.

Quantitative Techniques in Management 2003.Phillips. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.2004 [T5] A..L.P. Tamilarasi.Racindran.S.. [R2] A. Pearson 2005 REFERENCE BOOKS [R1] R.P.[T2] Gupta. M. P Balasubramani A. D. Quantitative Techniques and Operations Research. Prentice Hall. Operations Research. Second edition.Rardin. John Wiley. Statistical Methods.K. and Gupta. S. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. P. Sultan Chand &Sons. [T4] Gupta. J. N. Optimization in Operations Research. W. S.D.Solberg. Syllabus of Bachelor of Computer Applications (BCA). Sultan Chand & Sons [T3] Vohra. .f. Natarajan.T.e.

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75 1. Computer System Architecture. Timing and Control. Logic Micro-operations. Auxiliary Memory. Vector operations.e. Apart from Question No. Cache Memory. Prentice Hall of India Private Limited. of Hrs: 11] UNIT-II Design of Microprogrammed Control Unit Central Processing Unit: Introduction. 1 should be compulsory and cover the entire syllabus. Associative Memory. Computer Registers. Virtual Memory.Output Instructions.[T1. W. Matrix Multiplication. rest of the paper shall consist of four units as per the syllabus.R2] [No. Input . Memory Management Hardware[T1] [No. 3rd Edition. Computer Organization and Architecture. Prentice-Hall of India Private Limited. of Hrs: 11] UNIT-III Computer Arithmetic: Introduction. input –ouput organization of a typical computer  To learn the concepts of pipelining and vector processing. Register reference instructions. memory interleaving. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.5 marks. General Register Organization. Design of Accumulator Logic [T1] [No. Memory-Reference Instructions. Input-Output Interfaces. Instruction Cycle. It should be of 25 marks.Paper Code: BCA-203 Paper: Computer Architecture Paper ID : 20203 Pre-requisite :  BCA 106 Digital Electronics L 3 T/P 1 C 4 AimTo understand the concepts in modern computer architecture Objectives  To learn the design of Control Unit and ALU of a typical computer  To learn about the memory. Arithmetic Micro-operations.[T1. student may be asked to attempt only 1 question from each unit.f. Multiplication Algorithms. UNIT-I Register Transfer and Micro-operations:Register Transfer Language. Difference between RISC and CISC . for fixed point-members. Bus and Memory Transfers. Main Memory. REFERENCE BOOKS: [R1]. Pipeline and Vector Processing: Arithmetic and Instruction pipeline. Arithmetic logic shift unit Basic Computer Organizations and Design: Instruction Codes. Division Algorithms. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. 2001 Syllabus of Bachelor of Computer Applications (BCA). 1. Question No. Morris Mano. This question should have objective or short answer type questions. Computer Instructions. Stack Organization. Asynchronous Data Transfer. 4th Edition. Direct Memory Access (DMA)[T1] [No. Modes of Transfer. 2. Register Transfer. . of Hrs: 11] TEXT BOOKS : [T1]. Addressing Modes.R2] Input-Output Organization: Peripheral Devices. Each question should be 12. Priority Interrupt. Instruction Formats. of Hrs: 11] UNIT-IV Memory Organization: Memory Hierarchy. WIliam Stallings. Every unit should have two questions. 1999. Shift Microoperations. However.

Syllabus of Bachelor of Computer Applications (BCA). Malvino. W. . approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.f.e.” Computer Architecture and Organization” . “Digital Computer Electronics: An Introduction to Microcomputers”. Subrata Ghosal.[R2]. Pearson 2011 [R3]. McGraw Hill.

properties window. Question No. R1] Object Oriented Features: Classes and Objects. 1. [T1. student may be asked to attempt only 1 question from each unit.Net. ListView. 2. However. Constructors. Timer.Net. Checkbox. Status Bar. Loops. Two tier and Three tier client server model. Enumerations. Array Lists. W. Every unit should have two questions. Exploring and coding a project. rest of the paper shall consist of four units as per the syllabus. Creating Menus. scroll bar. Status Bar. Objectives  To get the Knowledge about different Object Oriented Features. Overriding.R2] [No. of Hrs: 11] Syllabus of Bachelor of Computer Applications (BCA).  To understand disconnected architecture of . Advantages of . Radio Button. Access Specifiers: Private. Properties. 1 should be compulsory and cover the entire syllabus.Paper Code: BCA 205 Paper ID: 20205 Paper: Front End Design Tool VB. Creating and Using MDI applications. This question should have objective or short answer type questions. Comments. CLR. TreeView. T2. Dialog Controls. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. argument passing mechanisms. Solution explorer.e.f. .Net IDE: Creating a project.Net Architecture. Working with Data Structures – Arrays. Memory management issues – Garbage Collector and collection process.5 marks UNIT I Introduction: Introduction to . Using Form – Common Controls. Features of . . Assemblies. Code Access Security. Label. Introduction to procedures. Toolbar. R1] [No. Creating and Using Namespaces. Constants. Output window.Net L 3 T 1 C 4 Pre-requisite:  Basic Programming Constructs  Object Oriented Concepts Aim To understand Object Oriented and Object based programming paradigm in event based programming environment. CLS.Net.Net Framework. Public and Protected. CTS. Overloading. calling procedures. Structures. Combobox. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1.R2] [No. Types of project in . Exception Handling. [T1. Each question should be 12. toolbox. Methods and Events. [T1. Listbox. Control Flow Statements – conditional statement. Apart from Question No. It should be of 25 marks. .Net Programming Language: Similarities and Differences with Visual Basic. toolbar. Creating custom controls.Net.Net. of Hrs: 11] UNIT – II Introduction to Visual Basic. Variables. Building Classes. [T2.Textbox. Data Types. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. T2] VB. Object Browser. of Hrs: 11] UNIT-III GUI Programming: Introduction to Window Applications. Nesting of Loops. [T1. scope of variable. Button. Picture Box. Inheritance. Panel. MsgBox and Input Box. Reusability. Interacting with controls .

Formatting Fields. Data Adapter. W.UNIT – IV Introduction to ADO: ADO vs ADO. Michael Halvorson.. Building Report. Command. Data Reader and Data Set with OLEDB and SQLDB. Data Binding. R1. Evangelos Petroutsos. [T2] [No. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Wiley India [T2]Visual Basic 2010 Step By Step.e. PHI . [T1. Creating Connection. Queries. Modifying Report. ADO. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. .Net. Accessing data from Server Explorer.Net Object Model. ADO.f. by Kogent Learning Solutions. Wiley Publications [R2] Beginning Visual Basic 2010 (Wrox) Syllabus of Bachelor of Computer Applications (BCA). Publishing and exporting reports. Table. REFERENCE BOOKS [R1] Mastering Microsoft Visual Basic 2010.Net data namespaces. of Hrs: 11] TEXT BOOKS [T1]Visual Basic 2010 programming Black Book. R2] Crystal Report : Connection to Database.

Objectives of Inventory Valuation. Concept of Deprecation. [No. Mayur Paperbacks.Paper Code: BCA 207 Paper ID: 20207 Paper: Principles of Accounting Pre-requisites: None L 3 T 0 C 3 Aim: To understand the basics of accounting and its application in general business environment Objectives  To get the Knowledge about the important concepts and characteristics of accounting. REFERENCE BOOKS [R1] Gupta R.K. Question No. Petty Cash Book. P.. This question should have objective or short answer type questions. 1 should be compulsory and cover the entire syllabus.. [R3] Raja Sekaran/Lalitha. Sales Journal. However. 2010.C. Causes of Depreciation. Syllabus of Bachelor of Computer Applications (BCA). of Hrs: 11] UNIT-III Preparation of Final Accounts. Branches of Accounting. Sub Division of Journal: Cash Journal. It should be of 20 marks.e. Accounting standards in India. academic session 2011-12 . Apart from Question No. Method of Recording Depreciation. Sultan Chand & Sons. L.f. Ledger. and Maheshwari. Pearsons . Methods of Valuation of Inventories-FIFO. Pearson Education. Sales Return Journal. Balance Sheet-Without adjustments and with adjustments. [No. K. rest of the paper shall consist of four units as per the syllabus. of Hrs: 11] UNIT – IV Meaning of Inventory. [No. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. Note : A Minimum of 40 Lectures is mandatory for each course. (2009) An Introduction to Accountancy. Each question should be 10 marks UNIT I Meaning and nature of accounting. Eighth Edition.. [R2] Monga J R. Trial Balance [No. Rules of Debit and Credit. Accounting concepts and convention. 1. 1999. “Financial Accounting”. Vikas Publishing House. of Hrs: 11] UNIT – II Journal. Every unit should have two questions. LIFO and Weighted Average Method.. S. Interrelationship of Accounting with other disciplines. Purchase Journal. Profit & Loss Account. of Hrs: 11] TEXT BOOKS [T1] Maheshwari. Methods of Providing Depreciation.N. Scope of financial accounting. Meaning of Depreciation Accounting. W. & Gupta V. Inventory Systems. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.  To study the application of accounting in the general business environment. 2. 2nd edition. S. “Principles & Practice of Accounting”. (2009) Financial Accountancy. Purchase Return. “Introduction to Financial Accounting”. student may be asked to attempt only 1 question from each unit. [T2] Tulsian.

C++ class declaration. Relating to other paradigms (functional. private & protected. of Hrs: 10] UNIT – IV Generic Programming – Introduction. Testing the C++ program in Turbo C++/Borland C++/MicroSoft VC++/GNU C++ compiler. Operator overloading. cin. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Polymorphism and Dynamic Binding. Inheritance. Applications of OOP. 2. 1. C++ standard libraries. the language and the C++ language standards. Difference between C and C++. Features of Procedure oriented programming. Constructors and destructors. [T1][T2][T3] [No. references. Aggregation. Question No. dynamic memory allocation. W. Basic Concepts of Object Oriented Programming. Class.Paper Code: BCA 209 Paper ID: 20209 Paper: Object Oriented Programming using C++ Pre-requisites:  BCA-105(Introduction to Programming using ‘C’)  Data Structure Concepts L 3 T 1 C 4 Aim: To understand the basics of Object Oriented Programming and their applications. Data Abstraction. Parametric polymorphism. templates. information hiding. abstract data types. This question should have objective or short answer type questions. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Method polymorphism. new.  To know about constructing programs using Bottom-up design approach. Object & classes. However.f. Class hierarchy. Polymorphism by parameter. It should be of 20 marks. Every unit should have two questions. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1.[T1][T2] [No. 12] UNIT – III Inheritance and Polymorphism: Inheritance. C++ Environment: Program development environment. attributes. Early v/s Late Binding. Objectives:  To gain knowledge of objects. . Syllabus of Bachelor of Computer Applications (BCA). rest of the paper shall consist of four units as per the syllabus. cout. data decomposition). Overriding inheritance methods. methods. composition v/s classification hierarchies. this pointer.[T1][R2] [No. derivation – public. Categorization of polymorphism techniques. Each question should be 10 marks UNIT – I Introduction: Introducing Object-Oriented Approach. of Hrs: 12] UNIT – II Classes and Objects: Encapsulation. Function Overloading. of Hrs. template functions. 1 should be compulsory and cover the entire syllabus. Introduction to various C++ compilers. student may be asked to attempt only 1 question from each unit. Overloading of template functions. C++ garbage collection. Apart from Question No. Encapsulation. Polymorphism.e. delete operators. Virtual Function. instantiation of objects. Default parameter value. Meta class/abstract classes. C++ standard libraries. Benefits of OOP.

approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. “Object Oriented Programming with C++”. W. Ravishanker “Mastering C++”. [R2] D . 1997. 1999. Types of Exception. Vikas Publication. “The Art of Programming Computer Science with C++”. BPB Publication. Catching and Handling Exceptions. 4th Ed. Pearson Education. 2004. Parasons. The basic stream classes: C++ predefined streams. “Object Oriented Programming with C++”. T. Lawlor. Tata McGraw Hill. “Object-Oriented Programming With Ansi And Turbo C++”.e. “C++ ”. [R3]Steven C.Venugopal. Streams and files. [T3] E. [R4] Schildt Herbert. [T2] A. . Error handling during file operations. “C++: The Complete Reference”.. Pearson Education. Balguruswamy. REFERENCE BOOKS [R1] Mahesh Bhave.R. Syllabus of Bachelor of Computer Applications (BCA). Galgotia Publications. TMH.[T1][T3] [No. Rajkumar. Kamthane. “Object Oriented Programming using C++”. Command Line Arguments.Files and Exception Handling: Persistant objects. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.f. TMH Publication ISBN 0-07-462038-x . Namespaces. [R5] R. Lafore. of Hrs: 10] TEXT BOOKS [T1] Ashok N.

Moments. and. [No. Mathematical Expectation. 1 should be compulsory and cover the entire syllabus. “ Numerical Analysis”. Numerical Methods for Mathematics.L. Newton – Raphson Method for Solving Equation Involving One Variable only.H. student may be asked to attempt only 1 question from each unit. [T2] Meyer. Binomial Theorem. False Position Method. [No. 2. of Hrs: 10] UNIT-III INTERPOLATION: Operators: Shift.f. Conditional Probability. Baye’s Theorem. Science and Engineering. [R2]Walpole. Pearson Education (2007) 8th ed. Binomial. . 1998. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Sharon L. Ronald E. Myers. Backward and Divided Difference Formulae: Lagrange’s Formula. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. However. Backward Difference Operators and their Inter-relation. It should be of 25 marks. Question No. REFERENCE BOOKS: [R1] Mathew. NUMERICAL DIFFERENTIATION.. Moment Generating Functions. Trapezoidal Rule.  To get familiar with various numerical techniques.. Apart from Question No. Every unit should have two questions. PROBABILITY: Definition of Probability. of Hrs: 11] UNIT – II PROBABILITY DISTRIBUTIONS: Review of Mean & Standard Deviation. Keying Ye.J (2002). Numerical Integration. of Hrs: 11] TEXT BOOKS: [T1] S. Each question should be 12.. Forward Difference. J. Interpolation Formulae-Newton’s Forward. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. This question should have objective or short answer type questions. R. Miller. [No. Introductory Probability and Statistical Applications. Raymond H.Jacobi and Gauss-Seidel Method. Pearson Education(2005) 7th ed. Objectives:  To get the Knowledge about mathematical probability.e.First and Second Order Derivatives at Tabular and Non-Tabular Points. W. Myers. Repetition and Constrained Repetition. rest of the paper shall consist of four units as per the syllabus.. Oxford (1970) 2 nd ed.. Binomial Coefficients. of Hrs: 12] UNIT – IV SOLUTION OF LINEAR SIMULTANEOUS EQUATIONS: Gaussian Elimination Method with and without Row Interchange: LU Decomposition: Gauss . Gauss – Jordan Method and to find Inverse of a Matrix by this Method. Simpsons 1/3 Rule: Error in Each Formula (without proof). Probability and Statistics for Engineers and Scientists. and Freunds. Poisson and Normal Distributions. [No.Paper Code: BCA 202 Paper ID: 20202 Paper: Mathematics – IV L 3 T 1 C 4 Aim: To understand the basics concepts of probability and numerical analysis.5 marks UNIT-I COMBINATORICS: Permutation and Combination. Prentice Hall Inc. Prentice Hall of India.. Miller and Freund’s “Probability and Statistics for Engineers. 1. Sastry. I.S. SOLUTION OF NON LINEAR EQUATION: Bisection Method. P. [T3] Johnson. J. Syllabus of Bachelor of Computer Applications (BCA).

Dynamically change style to HTML Documents. It should be of 25 marks. DTD’s Using XML with HTML and CSS [No.  Students should be able to develop simple back-end database to support a website. However. 1. anchor tag. 1 should be compulsory and cover the entire syllabus. Difference between HTML & XML Components of XML. operators. E-mail and its Protocols. of Hrs: 11] Syllabus of Bachelor of Computer Applications (BCA). lists types of lists. forms. student may be asked to attempt only 1 question from each unit. Every unit should have two questions. Apart from Question No. inline and External style sheets. URLs. of Hrs: 11] UNIT – III DHTML : Introduction to DHTML. [No.  Students should be able to implement different navigation strategies. web sites. Built in and User Defined Functions. Search Engines.e. W. of Hrs: 11] UNIT – IV Introduction to WYSIWYG Design tools. of Hrs: 11] UNIT – II Introduction to Java Script: Data Types. Portals. Control Statements. Web Hosting and Publishing Concepts. Image maps. Text formatting. XML Naming rules. XML: Introduction to XML-Mark up languages.  Students should be able to use client-side technologies (XHTML. Domain names. creating styles. Static Web Development: HTML .f.Introduction to HTML. [No. tables. Browsers and their versions. rest of the paper shall consist of four units as per the syllabus. XML Parser. Handling Events. JavaScript & DHTML. Objects in Java Script. . Introduction to Dreamweaver. DHTML Events. HTML comments.Paper Code: BCA-204 L T C Paper ID: 20204 3 1 4 Paper: Web Technologies Pre-requisite : Basic Programming Concepts Aim : To highlight the features of different technologies involved in Web Development Objectives  Students should be able to design and implement a basic website. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. News-group. Cascading Style Sheet: Types of Style Sheets – Internal. adding images and Sound. Building block of XML Document. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. Features of Mark up languages. Developing Forms. frames and floating frames.5 marks UNIT – I History of the Internet and World Wide Web. Question No. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. CSS. Web Portal. inserting special characters. [No. Each question should be 12. Document Object Model. Filters and Transitions. JavaScript). Its functions. Website Creation and maintenance. HTML Document structure tags. This question should have objective or short answer type questions. link tag. 2.  Students should be able to recognize and evaluate website organizational structure and design elements.

BPB Publication. Pearson. Wiley Dreamtech.f. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.0 by Deborah S. “Web Technologies : A Computer Science Perspective”. by Thomas A powell. [T3] Internet and World Wide Web Deitel HM. W. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. 2001. Ray. [R2]Rajkamal. [R3] Jeffrey C. .TEXT BOOKS [T1] The complete reference HTML. Syllabus of Bachelor of Computer Applications (BCA). [R4]XML How to Program by Deitel Deitel Nieto.e. Jackson. Deitel . [T2] Mastering HTML 4. TMH publication. Third Edition REFERNCES [R1] HTML Black Book .Goldberg . Tata McGraw-Hill. Ray and Erich J. Stephen Holzner. “Web Technology”.

Java Library: String handling (only main functions). method overriding. 1 should be compulsory and cover the entire syllabus. Adapter classes. InetAddress JDBC: JDBC Architecture. acces specifiers.out. operators. arrays. reading from a file and writing in a file.Interfaces and classes in javax. Choice lists. It should be of 25 marks.Paper Code: BCA 206 L T Paper ID: 20206 3 1 Paper: Java Programming Pre-requisites: Object Oriented Concepts Aim: To understand the use of object oriented features along with their applications Objectives  To make students well versed with programming in java. finally. use of final. [T1. packages. throw.: 12] UNIT – IV Networking Basics: Socket (datagram and TCP/IP based client and server socket). Event classes and listeners. [T1. [T1.in and Sysem.Thread class and runnable interface. Swings: Introduction and comparison with AWT controls. Every unit should have two questions. methods. thread priorities. R1] [No. R1] [No. However. R1] [No. creation and implementation. Data types. UNIT-I Java Programming: Introduction.TextField.: 10] UNIT – II Exception Handling: Exception Class. R1. life cycle. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. of Hrs. control statements. objects. Polymorphism: Method overloading. Each question should be 12. This question should have objective or short answer type questions. factory methods. throws. catch. JDBC Drivers. interface. String Buffer class. scrollbars. 1. Connecting to the Database Introduction to Java Servlets: Life cycle. list. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. use of try. check boxes. creation of single and multiple threads. 2. of Hrs.f.this and super operator. AWT controls: Button. overview of Synchronization.e.servlet package(only description) Creating a simple servlet[T1. constructor overloading.constructors.5 marks. print and println. student may be asked to attempt only 1 question from each unit. Inner classes. R2] Syllabus of Bachelor of Computer Applications (BCA). C 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. Layout managers. Question No.sub class. W. Elementary concepts of Input/Output :byte and character streams.: 12] UNIT – III Software Development using Java: Applets :Introduction. System. Multi threaded programming: Overview. Elementary concepts of Event Handling :Delegation Event Model. TextArea. rest of the paper shall consist of four units as per the syllabus. Label. of Hrs. built in checked and unchecked exceptions. Life cycle. . Classes: Fundamentals. T2. Inheritance: Super class. Apart from Question No. user defined exceptions. abstract class. comparison with multiprocessing .

William Crawford and Kris Magnusson. New Age Intl. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Syllabus of Bachelor of Computer Applications (BCA). “Introduction to Java Programming. “Java-2 The Complete Reference”. “Java Enterprise in a Nutshell”.”Internet and Java Programming”. W. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.f.: 10] TEXT BOOKS: [T1] Patrick Naughton and Herbert Schildt. 7/e” Pearson. REFERENCE BOOKS: [R1] Krishnamoorthy R. [T2] Y. TMH.[No. Jim Farley. Comprehensive Version.e. of Hrs. . O’Reilly. Prabhu S . [R2] David Flanagan. Daniel Liang.

Maintenance and debugging.IV Software Testing: Code Review.Paper Code: BCA 208 Paper ID: 20208 Paper: Software Engineering Pre-requisite :  None Aim  L 3 1 T 4 C To understand the importance. The People. Software Project Planning: Size Estimation like lines of Code & Function Count. Data dictionaries & ER Diagrams. of Hrs. Layered arrangement of modules. 1. Configuration Management. requirement elicitation techniques like FAST. Nature of SRS.[T1][T2][T3] [No. Token Count. of Hrs. The Problem. Risk Management. Object Oriented Design[T1][T2] Software Metrics: Software measurements: What & Why.: 12] UNIT – II Software Project Management Concepts: The Management spectrum.  To gain knowledge of various software design activities. Requirements documentation. rest of the paper shall consist of four units as per the syllabus. Integration Testing and System Testing(Performance Testing and Error Seeding). However. Test Activities. Unit Testing. Halstead Software Science Measures.e.: 12] Syllabus of Bachelor of Computer Applications (BCA). It should be of 25 marks. Each question should be 12. This question should have objective or short answer type questions. Classification of Cohesiveness & Coupling. 1 should be compulsory and cover the entire syllabus. Question No. Characteristics & organization of SRS. W. Function Oriented Design. .  To learn cost estimation. 2. Types of Testing. Documentation.: 10] UNIT . The Process. Waterfall. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. The Project. Data Structure Metrics. COCOMO. QFD. Software Re-engineering. Maintenance Process. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Design Metrics. [T1][T2][R1] Software Maintenance: Management of Maintenance. Prototype. Evolutionary and Spiral Models Software Requirements analysis & specifications: Requirement engineering. Every unit should have two questions. Testing Process. student may be asked to attempt only 1 question from each unit. limitations and challenges of processes involved in software development.[T1][T2] [No. software testing. Cost Estimation Models. of Hrs. Software life cycle models. Objectives  To gain knowledge of various software models.[T1][T2] [T3] [No. Apart from Question No. Software Processes & Characteristics.5 marks.III Software Design: Cohesion & Coupling. Debugging Activities. of Hrs. UNIT – I Introduction: Software Crisis.f. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Reverse Engineering. Structural Testing.[T1][T3] [No. Functional Testing. Requirements analysis using DFD(with case studies).: 10] UNIT .

Aggarwal & Yogesh Singh. Sommerville.. Syllabus of Bachelor of Computer Applications (BCA). John Wiley & Sons. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.TEXT Books: [T1] K. [T2] Rajib Mall. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.e. “Software Engineering”. “Software Engineering – A practitioner’s approach”. W. REFERENCE: [R1] Jibitesh Mishra and Ashok Mohanty. 3 rd Edition. “Software Engineering”. S. Pedrycz. 5th Ed. Pearson Edu. 9th Edition. Pearson [R2] R. Ed. “Software Engineering”. 2nd Ed. K. PHI Learning Private Limited [T3] I. W. 2001.. McGraw Hill Int. “Software Engineering: An Engineering Approach”. [R3] James Peter. 2005. “Fundamental of Software Engineering”. Pressman.. .f. New Age International.

However. FDM. Layers.Distance Vector Protocol. It should be of 25 marks. Line configuration. Ethernet and WLAN  Details of IP operations in the Internet and associated routing principles INSTRUCTIONS TO PAPER SETTERS: 1. TCP/IP suite. Each question should be 12. ISDN. and broadband ISDN. TDM. transmission mode. flow control. synchronous and asynchronous protocols overview. error control. routers. fibre optics and wirelessmedia  Categories and topologies of networks (LAN and WAN) and TCP/IP) and protocol suites  Channel error detection and correction. the Internet. Every unit should have two questions. one to many. Objectives  The students will be exposed different types of media. modems. student may be asked to attempt only 1 question from each unit. packet switching and message switching. Attenuation. distributed processing. switched networks. historical outline. noise.Paper Code: BCA 210 Paper ID: 20210 Paper :Computer Networks Pre-requisites: None L 3 T 1 C 4 Aim: The aim of this course is to allow students to develop background knowledge as well as core expertise in networking technologies. MAC protocols.f. 1 should be compulsory and cover the entire syllabus. Hierarchical Routing).Routing Methods (Static and dynamic routing. bridges. . distortion. wavelength. OSI and TCP/IP Models: Layers and their functions. T[2] Unit – II Telephony: Multiplexing. The Network Layer. T[1]. rest of the paper shall consist of four units as per the syllabus. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Maximum Marks : 75 Question No. error detection and correction: Many to one.I Basic Concepts: Components of data communication. and categories of networks. Unit . 2. WDM. cable modems. circuit switching. gateways. subscriber’s access.  Various transmission media. 1. ISDN: Services. Apart from Question No. This question should have objective or short answer type questions. Data Link control protocols: Line discipline. T[1]. comparison of models. T[2] Unit-III Devices: Repeaters. Transmission Media: Guided and unguided.5 marks. propagation speed and time. Filtering Function). Digital Transmission: Interfaces and Modems: DTE-DCE Interface. Network Layer Addressing and Routing concepts (Forwarding Function. which one of the fastest growing industries is in today’s world.e.T[1]. throughput. T[2] Syllabus of Bachelor of Computer Applications (BCA). multiplexing. fibre-optic communications and the state-of-art networking applications. their comparative study. Distributed routing. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. W. Design Issues. Link State protocol. topology. Shannon Capacity.

.e. T[2] Text Books T[1]. “Data and computer communications”. D. Presentation layer. W. R[2]. . 4th Ed. Pearson Education Asia. Tata Mc Graw Hill. connection management. and Application layer. “Data Communication and Networking”. Behrouz A. Reference Books R[1]. Tenanbaum. Syllabus of Bachelor of Computer Applications (BCA). A. Pearson education Asia. 2003. “Computer Networks”. T[1]. E.f. Comer. Functions of session layers. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. “Internetworking with TCP/IP”. 7th Ed. 2001. 2nd edition. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. S. T[2].Unit – IV Transport and upper layers in OSI Model: Transport layer functions.. Pearson Education Asia. 2002. Forouzan. William Stallings..

Logical versus Physical Address space. However. student may be asked to attempt only 1 question from each unit. Process Scheduling. Deadlock Avoidance. Synchronization Hardware. Each question should be 12. Page Replacement. Storage Devices. Deadlock Characterization. Distributed Systems. W.: 12] UNIT – II Processes: Process Concept. Shared Devices. Apart from Question No. Other Considerations [No. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. Deadlock Prevention. Virtual Devices. SecondaryStorage Structure: Disk Structure. Paging. of Hrs. 1. Recovery from Deadlock Device Management: Techniques for Device Management. rest of the paper shall consist of four units as per the syllabus. Parallel systems. Segmentation Virtual Memory: Demand Paging. Dedicated Devices.5 marks UNIT – I Introduction: What is an Operating System. Disk Management. It should be of 25 marks. Contiguous allocation. Deadlock Detection. 2. Disk Reliability [No. Allocation of Frames. Performance of Demand Paging. of Hrs.Paper Code: BCA-301 Paper: Operating System Pre-requisite: None L 3 T/P 1 C 4 Aim: To introduce an operation System and describe the functionalities of Operating System.e. Time-Sharing Systems. Every unit should have two questions. Simple Batch Systems. swapping. Thrashing. Question No. of Hrs. Methods for Handling Deadlocks. Real-Time Systems Memory Management: Background. Personal-computer systems. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.: 10] Syllabus of Bachelor of Computer Applications (BCA). Buffering.f. This question should have objective or short answer type questions. . Operation on Processes CPU Scheduling: Basic Concepts. Semaphores. 1 should be compulsory and cover the entire syllabus. Page-replacement Algorithms.: 10] UNIT – III Deadlocks: System Model. Process Synchronization: Background. Scheduling Criteria. Objectives • To Understand the services provided by an operating system. Disk Scheduling. Multiprogrammed Batches systems. Input or Output Devices. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Swap-Space Management. Scheduling Algorithms. Classical Problems of Synchronization [No. The Critical-Section Problem. MultipleProcessor Scheduling.

2001 [R2] Tannenbaum. Encryption. General Model of a File System.f. Consistency Semantics Security: Authentication. REFERENCES: [R1] Madnick E. Protection: Goals of protection. Types of File System File-System Interface: File Concept. 2000 [R3] An Introduction to Operating Systems: Concepts & Practice. . Access rights. “Operating System Concepts”. PHI Syllabus of Bachelor of Computer Applications (BCA). 4th Edition. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Bhatt.e. W. Domain of protection. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. “Operating Systems”. Tata McGraw Hill. System threats. Pearson Edu. 2005 [T2] Haldar/Aravind.: 12] TEXT: [T1] Silbersachatz and Galvin. Directory Structure. Donovan J. John Wiley & Sons.UNIT – IV Information Management: Introduction. Access Methods. “Operating Systems”. Program threats. of Hrs. PHI. A Simple File System. “Operating System”.. 7th Ed.. [No.

Parametric Cubic Curves Solid Modeling Representing Solids. Clipping Cohen. Oblique Projections.e. Comparison of Representations. [T1][T2] [No. Homogeneous Coordinates and Matrix Representation of 2D Transformations. Sweep Representations. Three dimensional clipping.Paper Code: BCA 303 Paper ID: 20303 Paper: Computer Graphics Pre-requisites: None Aim: To understand the graphics applications and its use. Parallel projections: Orthographic Projections. Each question should be 12. Antialiasing. 2.: 10] UNIT – III Representing Curves & Surfaces Polygon Meshes. Development of Hardware and Software for Computer Graphics. Composition of 2D Transformations. Projections.: 12] UNIT – II Geometrical Transformations 2D Transformations. Constructive Solid Geometry. L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. of Hrs.[T1][T2][R3] [No. student may be asked to attempt only 1 question from each unit. Raster-Scan Display Systems. 1. Midpoint Subdivision algorithm. Three-dimensional Cohen-Sutherland clipping algorithm. Scan Converting Circles. of Hrs. Primitive Instancing. Input Devices for Operator Interaction. Every unit should have two questions. [T1][T2] [No. Overview. of Hrs. Perspective Projection. Representation of Three-dimensional objects. Transformations as a Change in Coordinate System. Graphics Hardware Hardcopy Technologies. The Video Controller. The Window-to-Viewport Transformation. Image Scanners. This question should have objective or short answer type questions. However. Spatial Partitioning Representations. Cyrus-Beck Algorithm. Classification of Applications. Representative Uses of Computer Graphics. Boundary Representations. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. It should be of 25 marks. Question No. Scan Converting Ellipses. rest of the paper shall consist of four units as per the syllabus. Random-Scan Display Processor.5 marks. Efficiency. Matrix Representation of 3D Transformations. 1 should be compulsory and cover the entire syllabus. Depth-sorting Method(Painter’s algorithm)[T1][T2] Syllabus of Bachelor of Computer Applications (BCA). Hidden Surface Removal: Depth-Buffer(z-buffer) method. W. User Interfaces for Solid Modeling. . UNIT – I Introduction: The Advantages of Interactive Graphics. Display Technologies.Sutherland Algorithm. Conceptual Framework for Interactive Graphics. Regularized Boolean Set Operations.: 10] UNIT – IV Three Dimensional Viewing: Introduction.f. Apart from Question No. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Scan Converting Lines.

& Van Dam. Limited REFERENCES BOOKS: [R1] D. A: Fundamentals of Interactive Computer Graphics. J. Hearn & Baker: Computer Graphics with OpenGL. Feiner. Hughes. Pearson Education.[No. W. Alavla “Computer Graphics”. 2000. 2009. “Mathematical Elements for Computer Graphics”. Third Edition. McGraw Hill. . Pearson [T2] Chennakesava R. PHI Learning Pvt. Van Dam. Syllabus of Bachelor of Computer Applications (BCA).e.D.f. 1989. [R2] Foley. [R3] Rogers & Adams.: 12] TEXT BOOKS: [T1] Foley. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Computer Graphics Principles & Practice. of Hrs. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.

Electronic Data Interchange (EDI): Definition. 2. 1 should be compulsory and cover the entire syllabus. It should be of 25 marks. 1. of Hrs: 12] UNIT – II Intranet. This question should have objective or short answer type questions. Electronic Payment Systems: E-cash: Purchasing & using of e-cash. Process of EDI Message Exchange. rest of the paper shall consist of four units as per the syllabus. UNEDIFACT Standards & Message Structure. . INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. Web Traffic Analysis: Various measures. Considerations in Intranet Deployment. [No. Website hosting considerations-own versus rented server. Functions of E-commerce. web authoring tools. Website development-client & server side tools. Marketing site. Choosing the right format of website: Characteristics of PR site.User authentication & Data Security. Extranet and VPN: Architecture of Intranet. student may be asked to attempt only 1 question from each unit. Electronic Purses their loading with cash and use. Issues & Challenges in E-commerce . UN ‘Model Interchange Agreement’ for international commercial use of EDI. Tools & Technologies for E-commerce. Website Maintenance Online Promotion tools & techniques: Getting links to your site. EDI Layered Architecture. Applications of E-commerce in business functions. EDI enabled procurement process. Intranet Application Case Studies. EDI Implementation. Applications of Intranets. banner advertisements & measuring advertisement effectiveness. Search Engine optimization techniques. Problems with Manual Systems. EDI in India. W. Steps in setting up business on Internet: Selection & registration of domain name.f. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Components of EDI. Apart from Question No. VPN Security.Types of E-commerce. E-cheque payment system.5 marks. Payment Gateways for online payment. Extranet Products & Services. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Aims of E-commerce. Concept & Evolution of EDI. catalogue & web store tools. Sales site/web-store and vertical & horizontal portals. Definitions of E-commerce & E-business & their difference. Each question should be 12.Paper Code: BCA 305 L T C Paper Id: 20305 3 1 4 Paper: E-commerce Pre-requisites: None Aim: To understand the process of Electronic commerce and Business strategy involved in it. Traditional versus EDI enabled system for document exchange. Business Models of Extranet Applications. However. Question No. Security of transactions on Web: Selling through Secure Servers. UNIT-I An Overview of E-Commerce: Trade Process & Trade Cycles their linkages with information exchange. structure of log file data at server side & its analysis for promotion and tools for analysis. Online Third Party Verified Payment Syllabus of Bachelor of Computer Applications (BCA). Virtual Private Network (VPN): Architecture of VPN service provider dependent & service provider independent configurations. Intranet Software. The architecture of Extranets. Every unit should have two questions. use of digital certificates and international standards.e.Operational & Strategic benefits of E-commerce. Web based E-Commerce: Need for web based business. Applications of Extranets.

Role of governments & regulatory bodies. Supply Chain & Supply Chain Management: Definition & flows in a supply chain. Public-Private Key Cryptography.f. Technologies and Applications. REFERENCES: [R1] The Complete Reference: Internet. Patents. W. Application servers & middle ware. [No. Components (Telephony. Strategies. 2. Desktop applications). Privacy. Models. Customs & Taxation laws. Tata McGraw Hill.e. ATM based cash disbursement system. Jurisdiction issues. SSL and SET. Impact of IT Enabled Systems on Value Chain . mode of operations. Case studies & applications of e-commerce in Retailing. Intranet & Extranet. of Hrs: 10] TEXT BOOKS: [T1] e-commerce: Strategy. Addison-Wesley (An Imprint of Pearson Education) [R4] Network Security Essentials: Applications & Standards. Syllabus of Bachelor of Computer Applications (BCA). [No. Applications of E-Commerce & Case Studies: 1.System through Credit & Debit Cards & encryption mechanism. Trademarks & Domain Names). Evolution of supply chain-JIT & Quick Response Retailing. Cyber Crimes. of Hrs: 12] UNIT – III Business Strategy in an Electronic Age: Impact of Internet on Competition . Security E-Commerce Transactions: Security issues: confidentiality. Pull and Built-to-order model of supply chains. [R3] Frontiers of Electronic Commerce. Cryptography & Digital Signatures: Symmetric & asymmetric cryptography. Ravi Kalakota & Andrew B. technical standards & spectrum management. Customer Relationship Management (CRM). Tata McGraw Hill [T2] E-Commerce: The Cutting Edge of Business. Himalayas Publishing House. Inter bank clearing system. Legal Issues: Uniform Commercial code for E-commerce (‘Model Law on Electronic Commerce’ by United Nations Commission on International Trade Law. authentication. Expansion of Internet: 128 bit IP addressing issue. E-commerce enabled supply chain management using Internet. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Business Process Management: Concepts of Business Process Management & Business Process Reengineering. Digital signatures & their use. interoperability. Note : A Minimum of 40 Lectures is mandatory for each course. Push. Web. Legal issues in cryptography [No. Call Centre operations: Purpose & functions. Public Key Infrastructure (Digital Certificate. IT Act 2000 by Govt of India). Margaret Levine Young. CSV Murthy. [R2] e-Commerce: Concepts. 6. Intellectual Property Protection (Copyrights. Manufacturing. David Whiteley. Electronic Bill Payment System. Wilson. Security (storage of electronic messages & their evidence value). Banking. Key Repository). Airlines & Railway reservation & e-governance.Porter’s Value Chain Model. non-repudiation & access control their objectives & techniques. Pearson Education.Porter’s Five Forces Model & Business Strategies in Digital Economy. bandwidth issues. McGraw Hill. Registration Authority. integrity. academic session 2011-12 . Certification Authority. Types of security attacks. William Stallings. KK Bajaj & Debjani Nag. of Hrs: 10] UNIT – IV Technology & Legal Issues in E-Commerce: Technological Issues: Availability of telecom infrastructure.

. Question No. 1. Extreme Testing [T1. Decision Table Based Testing. Equivalence Class Testing. “Software Testing. challenges and strategies of testing internet applications. Introduction to Software Testing. This question should have objective or short answer type questions.R2. Class Testing.5 marks. Regression Testing. Each question should be 12. System Testing. Integration Testing. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Cause Effect Graphing Technique. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. However. GUI Testing. R8] [No.R8] [No. UNIT -I Introduction: What is software testing and why it is so hard? Psychology and economics of software testing. R1] [No. Principles of Software Testing . of Hrs: 11] UNIT-IV Object Oriented Testing: Issues in Object Oriented Testing.A Craftsman’s Approach”.Paper Code: BCA-307 Paper: Software Testing Paper ID 20307 Pre-requisite :  BCA 204 Software Engineering  Aim  L 3 T/P 1 C 4 Knowledge and skills of at least one programming language To understand the importance.T2. ISBN 0-52188-038-1. Test Cases. REFERENCES: [R1]Paul Ammann and Jeff Offutt. Graph Metrics. Cambridge University Press. Cambridge. desk checking. 2008. CRC Press. . Testing Internet applications: Overview. Syllabus of Bachelor of Computer Applications (BCA).e. Object Oriented Integration and System Testing. Objectives  To gain knowledge of various functional and structural testing techniques  To gain knowledge of various activities and levels of testing  To learn the issues in testing of object oriented and internet based applications INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. [T1. Second Edition. Error and Fault Taxonomies. Limitations of Testing. UK. 2008 [T2]Glenford Myers. Every unit should have two questions.T2. Debugging. It should be of 25 marks. group walkthroughs and peer reviews. rest of the paper shall consist of four units as per the syllabus. DD-Paths. “The Art of Software Testing”. John Wiley & Sons Inc. limitations and challenges of testing process. Fault. Incident. of Hrs: 11] UNIT-III Testing Activities: Unit Testing.f. [T1. Overview of Graph Theory for testers. 1979. Slice based testing [T1. 2. New York. of Hrs: 11] UNIT-II Functional Testing: Boundary Value Analysis. Levels of Testing. Data Flow Testing. student may be asked to attempt only 1 question from each unit. Cyclomatic Complexity. Apart from Question No. W. Code inspections .T2] [No. 1 should be compulsory and cover the entire syllabus. Error. Structural Testing: Path testing. Jorgensen. Failure. of Hrs: 11] TEXTBOOKS: [T1]Paul C.

“Effective Methods for Software Testing”. New York. Second Volume. New Delhi. Syllabus of Bachelor of Computer Applications (BCA). [R4]. William Perry. 1995. New Delhi. Van Nostrand Reinhold.e. Second Edition.Wiley India . New Age International Publishers. [R8]. New York. [R6]. 2003. “Testing Computer Software”. Van Nostrand Reinhold. Louise Tamres. “Software Engineering”. “Software Testing Techniques”. Principles and Techniques”. K. McGraw-Hill International Edition. . 2008 [R3]. 1993. Cem Kaner. Fifth Edition. Michal Young. 2001. Aggarwal & Yogesh Singh. John Wiley & Sons. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. “Software Testing and Analysis: Process. Jack Falk. 1990. Pressman. 2002 [R7]. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Boris Beizer. Second Edition. “Software Engineering – A Practitioner’s Approach”.f. W.K. Nguyen Quoc.[R2] Mauro Pezze. Roger S. [R5]. Pearson Education Asia. New York. “Software Testing”.

rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. This question should have objective or short answer type questions. Serial I/O lines. of Hrs: 11] UNIT . Penram Int. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. segmented memory. of Hrs: 11] UNIT – IV Introduction to 8086/8088 microprocessors.” The X86 Microprocessors” . BCD Arithmetic.8253 programmable interval timer. 2. logic . Gaonkar. Comparison of 8085. indexing. 1. addressing modes and programming of a typical 8-bit microprocessor  To learn architecture and programming of typical 16-bit microprocessors  To learn microprocessor interfacing and applications INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. 1 should be compulsory and cover the entire syllabus. architecture. branch instructions. 8259. Each question should be 12.looping. Software development systems and assemblers. 8088 microprocessors [T2] [No. 8086. pin-out.Paper Code: BCA-309 L T/P Paper: Microprocessor 3 1 Paper ID 20309 Pre-requisite :  BCA 106 Digital Electronics and BCA 203 Computer Architecture C 4 Aim  To understand the architecture.RS-232C standard. interfacing memory. [T2]. Study of 8085 8 bit Microprocessor. Apart from Question No. W. programming techniques. writing complete programs for 8085. stacks and subroutines. Das. [T1] [No. instruction set. its internal architecture. UNIT – I Introduction to Microprocessors . Lyla B.5 marks. Arithmetic. It should be of 25 marks. of Hrs: 11] UNIT . counting. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. [T1] [No. student may be asked to attempt only 1 question from each unit. programming and interfacing of microprocessors and their applications Objectives  To learn architecture . serial I/O and data communication.8257 DMA controller. interfacing keyboards and output displays . 8085 Microprocessor complete instruction set and timing. memory mapped and isolated I/O. addressing modes. Interrupts and their processing. . code conversion. 8251A Programmable communications interface. Question No. of Hrs: 11] TEXT BOOKS: [T1] Microprocessor Architecture. Basic interfacing concepts. Programming & Application with 8085. timing diagrams.II Counters and time delays using programming. Interrupt interface circuits using 8259. pin-out. addressing modes.f.III General purpose programmable peripheral devices-8255.Pearson 2011 REFERENCE BOOK: Syllabus of Bachelor of Computer Applications (BCA).[T1] [No.e. microcontrollers and microcomputers. publication 2000. However.

A. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Hall.V.[R1].f. [R2]4. 1991. [R3]D. A.e. “Microprocessor Systems: The 8086/8088 family Architecture. 2000. TMH. Y. K. 2nd Ed. Liu and G. Gibson. “Advanced Microprocessors and Peripherals”. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. TMH. Syllabus of Bachelor of Computer Applications (BCA). “Microprocessors and Interfacing”. Ray and K M Bhurchandi. PHI.-C. . W. Programming & Design”. 2000.

1. and no repudiation. PGP. RPC. Routing. Basic Internetworking. Syllabus of Bachelor of Computer Applications (BCA).Multimedia Networking: Multimedia networking applications.f. Networks Security Essentials: Application & Standards. integrity. REFERENCE BOOKS: [R1] Computer Networking: A Top Down Approach (Fifth Edition). of Hrs: 11] TEXT BOOKS: [T1] Computer Networks. Quality of Service. R1.323. SSL. RTSP. Symmetric Key Encryption. Kurose. 2000. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. 1 should be compulsory and cover the entire syllabus. [T1. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Question No. . This question should have objective or short answer type questions. [R2] W. It should be of 25 marks. TLS. Firewalls.Paper Code: BCA-311 Paper ID: 20311 L T C Paper: Advance Computer Networks 3 1 4 Pre-requisite : Familiar with Computer Network Concepts Aim: To equip students with good knowledge on the selected advanced research topics in networking Objectives  To understand three basic security concepts important to information on the Internet: confidentiality. SIP. James F.e. Performance. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. authentication protocols. .[T1] [No. H. Apart from Question No. TCP Congestion Control Avoidance mechanisms. Reliable Byte Stream (TCP). Each question should be 12. R1] [No. Pearson Education. RTP [T1] [No. Queuing Disciplines. Ethernet &MAC Internetworking: Switching & Bridging. and availability. Fifth Edition: A Systems Approach (The Morgan Kauf Man Series). framing error detection. End to End Protocols: Simple Demultiplexer. W. of Hrs: 11] UNIT – IV Network Security: Cryptographic Building Blocks. of Hrs: 11] UNIT – II Advance Internetworking: The global Internet. Stallings. links. Multicast.I Foundation: Building a Network. Getting Connected: encoding. reliable transmission. rest of the paper shall consist of four units as per the syllabus. Routing among mobile devices. Every unit should have two questions. RTCP. Implementation. Intrusion Detection [T1. 2. R2] [No. However.5 marks UNIT . student may be asked to attempt only 1 question from each unit. Public Key Encryption.  To understand the Concepts relating to the people who use that information: authentication. authorization. MPLS. of Hrs: 11] UNIT – III Congestion Control & Resource Allocation: Issues.

Rasmus Lerdorf. Iterating through an array. Parsing of the query results. HTML form controls and PHP. Installing Web servers. Every unit should have two questions. Constants. student may be asked to attempt only 1 question from each unit. of Hrs: 11] UNIT – IV PHP Database Connectivity: Introduction to MYSQL. operators and Expressions. [No. for. ISBN 1565926102). printing data on PHP page. ISBN 0130463469). Apart from Question No. of Hrs: 11] TEXT BOOKS: [T1] Programming PHP. Sending query to database. of Hrs: 11] UNIT – III Working with Forms: Get and Post Methods.5 marks UNIT – I Introduction to web applications. ISBN: 1-893115-51-8 Syllabus of Bachelor of Computer Applications (BCA). Kevin Tatroe. Sessions. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Question No. (O'Reilly. W. 1 should be compulsory and cover the entire syllabus. Use a particular database. Querystrings. and JavaScript: A Step-By-Step Guide to Creating Dynamic Websites by Robin Nixon O'Reilly Media. Passing by Value and passing By references. This question should have objective or short answer type questions. Start and End Tags of PHP. Control statements – if. Internet Information Server (IIS) and Personal Web Server (PWS). 1 edition REFERNCE BOOKS: [R1] Core PHP Programming. Apress. Web Servers : Local Servers and Remote Servers. Reading and Writing to Files. do while. Each question should be 12. [R2] Beginning PHP5 and MySQL: From Novice to Professional. Leon Atkinson (Prentice Hall. Arrays: Initialization of an array. Working With Files: Opening and Closing Files. Array Functions. switch case.  Students should be able to develop simple back-end database to support a website. Maintaining User State: Cookies.  Students should be able to implement different navigation strategies. while. Checking data errors. Creating database and other operations on database. Variables. [T2] PHP. Static website vs Dynamic website development. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. W. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. HTML. [No. Jason Gilmore.Paper Code: BCA-313 L T C Paper ID: 20313 3 1 4 Paper: Web Based Programming (PHP) Pre-requisite : Basic Programming Concepts & BCA 204 Aim : To highlight the features of different technologies involved in Web Development Objectives  Students should be able to design and implement a basic website. However. 1. Data types in PHP.  Students should be able to recognize and evaluate website organizational structure and design elements. . of Hrs: 11] UNIT – II Introduction to PHP. 2004. It should be of 25 marks. 2. [No. Sorting arrays. connecting to a database. MySQL. Functions: Defining and Calling Functions. Getting Information on Files [No.f. Inbuilt Functions.e. Client Side Scripting Vs Server Side Scripting. Application State. rest of the paper shall consist of four units as per the syllabus.

Unemployment. Rothschild. Pearsons [T5] Nellis. [No. Output Determination Under Perfect Competition. Monopolistic Competition & Oligopoly. Globalisation. Every unit should have two questions. Asia.R. S. “The Essence of Business Economics”. The Production Process: Output decisions – Revenues. [No. MNCs.e. New Delhi. Apart from Question No. Hampshire. “Micro Economics”.Paper Code: BCA 315 Paper Id: 20315 Paper: Business Economics Pre-requisite : None Aim : To Understand the concepts of Economics. This question should have objective or short answer type questions.Millan..: 12] UNIT III Macro Economic Concerns: Inflation. Monopoly. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.5 marks UNIT I The Scope and Method of Economics. Measuring National Income and Output. Joseph. Groups of Twenty (G-20). Monetary Policy. Question No. Fair. Government in the Macro Economy: Fiscal Policy. of Hrs. Export.f. 1. Trade-Cycles: Circular Flow upto Four Sector Economy. Prentice Hall. 1 should be compulsory and cover the entire syllabus. 2000 [T3] Ferfuson P. Parker David. 2nd edition. Case & Ray C. of Hrs.: 10] TEXT BOOKS: [T1] Ahuja H. The Economic Problem: Scarcity & Choice. 2001 [T2] Karl E. rest of the paper shall consist of four units as per the syllabus. Costs and Profit Maximisation Laws of Returns & Returns to Scale. [T4] D N Dwivedi. Issues of Dumping. Outsourcing. It should be of 25 marks. The Price Mechanism. R and Ferguson G. [No.: 12] UNIT II Market Structure: Equilibrium of a Firm and Price.. “Business Economics”. L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. However. [No. 1992. Pearson Education.: 10] UNIT IV The World Economy – WTO.. Mac. New Delhi. Syllabus of Bachelor of Computer Applications (BCA). “Principles of Economics”.Import Policy 2004-2009. of Hrs. Each question should be 12. W. “Business Economics”. Economies and Diseconomies of Scale. student may be asked to attempt only 1 question from each unit. . Foreign Capital in India. Demand & Supply Equilibrium: The concept of Elasticity and its Applications. Trips.L. 2. Chand & Co. of Hrs. 1993.J. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.

mining world wide web. [No. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. association and correlation. This question should have objective or short answer type questions. This course also provides the basic conceptual background necessary to design and develop data ware house applications. Each question should be 12. data descretization and concept hierarchy generation. mining spatial database. evaluating the accuracy of a classifier or predictor. Data mining – on what kind of data. 2003. data reduction. OLAM Mining frequent patterns. lazy learners. classification by back propagation. data mining functionalities – what kind of patterns to be mined. Hartcourt India P. efficient and scalable frequent itemset mining methods. rule based classification. data mining task primitives. Applications and trends in data mining: Data mining applications. a categorization of major clustering methods.5 marks UNIT – I Data mining: Inttroduction. A multidimensional data model. other classification methods. Data preprocessing: Descriptive data summarization. [No. It should be of 25 marks. of Hrs: 11] UNIT – III Classification and prediction: Introduction. Question No. [T2] Paul Raj Poonia. of Hrs: 11] UNIT – II Data warehouse and OLAP technology: What is data warehouse. data mining system products and research prototypes. Note : A Minimum of 40 Lectures is mandatory for each course. data cleaning. integration of a data mining systems with a database or data warehouse systems. data integration and transformation. major issues in data mining.2001. However. trends in data mining.. of Hrs: 11] UNIT – IV Mining complex types of data: Multidimensional analysis and descriptive mining of complex data objects. 2. partitioning methods. 1 should be compulsory and cover the entire syllabus.f. John Wiley & Sons. student may be asked to attempt only 1 question from each unit. Every unit should have two questions. [No.e. classification by decision tree induction. data warehouse architecture. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. multimedia database. rest of the paper shall consist of four units as per the syllabus. Apart from Question No. Prediction: accuracy and error measures. data warehouse usage.Paper Code: BCA 302 Paper ID: 20302 Paper: Data warehouse and data mining Pre-requisites: • Information System Concepts L 3 T 1 C 4 Objectives: This course is an attempt to provide you with the basic information about data ware house and their development. “Data Mining Concepts and Techniques”. Classification of data mining systems. From association mining to correlation analysis. Ltd. W. issues. Syllabus of Bachelor of Computer Applications (BCA). social impact of data mining. data warehouse implementation. Cluster Analysis: Types of data in cluster analysis. [No. OLAP. “Fundamentals of Data Warehousing”. 1. of Hrs: 11] TEXT BOOKS: [T1] Kamber and Han. academic session 2011-12 .

M. Saleh A. “ Data Mining: Introductory and Advanced Topics. [R3] W. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Cengage Learning. Pearson [R2] G. John Wiley. W. . Wasimi. H. “Data Mining Methods and Techniques”. “Building the Operational Data Store”.REFERENCE BOOKS: [R1] Margaret Dunham. 1999 [R4] B. K.2nd Ed. “Introduction to Data Mining with Case Studies”. Inmon. 2006. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.f. Gupta. 1/e”.. 2009 Syllabus of Bachelor of Computer Applications (BCA).e. PHI. Shawkat Ali.

Computer Networks and Programming Concepts Aim To provide basic knowledge on Wireless Communications. Market of Mobile Communications. 1. Carrier sense multiple access. Advanced Phase Shift Keying. Introduction to SDMA. LEO. Signal Propagation: Path Loss of Radio Signals. FDMA. Additional Signal Propagation Effects. Basics: GEO. Spread Aloha multiple access. Every unit should have two questions. However. Each question should be 12. Antennas. DECT: System architecture. [T1] Elementary Knowledge on Wireless Transmission: Frequency of Radio Transmission. of Hrs: 11] UNIT – III Syllabus of Bachelor of Computer Applications (BCA). Question No. TDMA: Fixed TDM. CDMA. Reservation TDMA. Multicarrier Modulation.[T1] Elementary Knowledge on Satellite systems: History. Multiplexing: Space Division Multiplexing. W. It should be of 25 marks. Protocols. Near and far terminals. • To build working knowledge on various telephone and satellite networks. Slotted Aloha. Handover. Mobile communications. . [T1] [No. Routing. student may be asked to attempt only 1 question from each unit. of Hrs: 11] UNIT – II Elementary Knowledge on Medium Access Control: Motivation for a specialized MAC. Demand assigned multiple access.e. Frequency Hopping Spread Spectrum. Applications. Signals.5 marks UNIT .I Introduction to wireless communications: Applications. 1 should be compulsory and cover the entire syllabus.f. This question should have objective or short answer type questions. Frequency Shift Keying. Apart from Question No. • To build skills in working with Wireless application Protocols to develop mobile content applications • To build practical knowledge on WML and WML Script INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. Localization and calling. Cellular Systems.Paper Code: BCA 304 L T C Paper ID: 20304 3 1 4 Paper: Mobile Computing Pre-requisites: Knowledge of Digital Electronics(BCA 106). Security. Hidden and exposed terminals. Localization. Classical Aloha. Short History of Wireless Communications. Protocol architecture. Frequency Division Multiplexing. Objectives • To learn the basics of Wireless voice and data communications technologies. Comparison of S/T/F/CDMA. Polling. Mobile Internet and Mobile Content Services. PRMA packet reservation multiple access. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. System architecture. Modulation: Amplitude Shift Keying. Multipath Propagation. rest of the paper shall consist of four units as per the syllabus. Radio interface. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. [T1] Elementary Knowledge on Telecommunications Systems: GSM: Mobile services. Inhibit sense multiple access. Phase Shift Keying. [T1] [No. MEO. Spread Spectrum: Direct Sequence Spread Spectrum. New data services. 2. Multiple access with collision avoidance. Code Division Multiplexing. Handover. Time Division Multiplexing. Advanced Frequency Shift Keying.

2002 [R2] Theodore S Rappaport. <optgroup>. Calling WMLScript from WML. “Wireless Communication Principles and Practice”. Dialogs [T2. Comparison Operators. Business opportunities. “Mobile Communications”.URL . Second Edition. Elements: <input> . Martin Frost. Returning from a Function. Making the Internet Mobile: Challenges and Pitfalls. Interaction in WAP. Elementry Knowledge on Libraries: Lang . String . The Conditional Operator. Other Statements. The meta Pragma. WMLScript Statements: Expressions as Statements. Logical Operators. Arithmetic Operators. The tabindex Attribute. <do> .Mobile Internet: Introducing the Mobile Internet. PHI/Pearson Education. Loops. “Wireless Communications and Networks”. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. T3] [No. 2000 [T3] Learning WML. Pearson Education. Float . Browser Contexts. 2nd Ed. Writing Applications for Mobile Internet”. “The Wireless Application Protocol. W. Assignment Operators. Conditions. and Cards: Elements: <wml>. <template>. of Hrs: 11] TEXT BOOKS [T1] Jochen Schiller. Shift Operators. Precedence and Associativity. WML Text and Text Formatting. <head>. WML Timers. Blocks of Statements. Operators and Expressions: Operand Conversions. <card> . Overview of the Wireless Application Protocol [T2] Implementing WAP Services: WML Script: Datatypes. [T2. McGraw Hill. WMLScript Functions: Function Declarations. [T2] Sandeep Singhal. and Conversions. Setting Variables. <select> .e. Publisher: O'Reilly 2000 REFERENCE BOOKS [R1] William Stallings. WML User Interaction: Problems with Web Interaction. 2002 [R3] C. Services for the mobile Internet. . Lee and William. “Mobile Cellular Telecommunications”. <br>. Type Operators. Increment and Decrement Operators. <anchor> . approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Y. Bitwise Operators. <access>.f. 2001 Syllabus of Bachelor of Computer Applications (BCA). and WMLScript. Variables. WMLBrowser . Programming the Wireless Web. Function Calls. Character Formatting. WML Tasks and Events. 2nd Ed. WML Images: <img> Element. The WBMP Image Format. <meta> . Pearson Education.<option> . PHI/Pearson Education. 2003. Calls to Other Script Units. <a> .[T2] Implementing WAP Services: WML: WML Variables and Contexts: Variable Substitution. Templates. WML Decks. The Comma Operator. Tables. Elements <p>. WMLScript Pragmas: The access Pragma. Standard Libraries. T3] [No. of Hrs: 11] UNIT – IV WAP: the Mobile Internet Standard.

R1] [No.uname.symbolic links and hard links. “Your Unix The Ultimate Guide”. 2.mv and inodes rm and inodes. cut.T2. examining permissions.T2.using patches. of Hrs: 11] UNIT – III Enivironment variables(HOME. rest of the paper shall consist of four units as per the syllabus.SHELL.whoami. installing the kernel source. creating archives. UNIT – I UNIX & LINUX:. permission types. TMH Syllabus of Bachelor of Computer Applications (BCA). of Hrs: 11] UNIT – IV Process related commands(ps. sed.gzip.hostname.command. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. However. renice).Getting help in Linux with –help.GPL. the Linux scheduling algorithm. ext4. bc .rm. “Linux Kernel Development”. storing the process descriptor.sgid for a directory. L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1.GNU Project/FSF. awk(basic usage) [T1. allocating the process descriptor. It should be of 25 marks. top. building the kernel process management(process descriptor and the task structure.and su. wc. concept of /etc/passwd.LANG.mount and umount command.bzip2. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Pearson Education [T3] Sumitabha Das. process state. /etc/group. 1 should be compulsory and cover the entire syllabus. 1.sticky bit for a directory) tail. . pstree.e. nice. runlevel (importance of /etc/inittab)[T1. Apart from Question No. of Hrs: 11] UNIT – II Standard Input and Output.Paper Code: BCA 306 Paper ID: 20306 Paper: Linux Environment Pre-requisites: Operating Systems Aim: To understand Linux Operating System and its security.f. simple commands like date.concept of inodes. This question should have objective or short answer type questions. Redirecting input and Output.USER. diff.bunzip2(basic usage of these commands)[T1. basic shell scripts grep. tee command. uniq. sort.default permissions and umask Vi editor basics. concept of aliases etcLinux filesystem types ext2. Each question should be 12. student may be asked to attempt only 1 question from each unit.cp and inodes .sgid for an executable. copy. w. Using Pipes to connect processes.R1] [No. mv.whatis. Linux File Security.gunzip. info command.Local variables.man command. of Hrs: 11] TEXT BOOKS: [T1] Sumitabha Das. overview of system calls.DISPLAY. /etc/shadow. TMH [T2] Robert Love. Every unit should have two questions. less command. W. “Unix Concepts and Application”.cat command .Overview of UNIX and LINUX Architectures.inodes and directories.Intoduction to kernel debuggers(in windows and linux)[T2] [No. manipulating the current process state.Basic linux directory structure and the functions of different directories basic directory navigation commands like cd. UNIX Principles. getting started with the kernel(obtaining the kernel source. the kernel source tree. tar. the process family tree.T2. tr.VISUAL). ext3. Question No. who.R1] [No. three modes of vi editor. special permissions(suid for an executable. aspell. Introduction to the linux Kernel. cal.5 marks. changing permissions(symbolic method numeric method).. process context.

W.REFERENCE BOOKS: [R1] Sivaselvan.e. Inc. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. .f. Marco Cesati. Bovet. 2005 Syllabus of Bachelor of Computer Applications (BCA). “A Beginner’s Guide to UNIX”. O'Reilly Media. PHI [R3] Understanding the Linux Kernel Daniel P. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. PHI Learning [R2] The Unix Programming Environment by Brian W. Gopalan. Kernighan and Rob Pike.

of Hrs: 11] UNIT-II Multimedia building blocks Creating & Editing Media elements: Text. Media Consumption.Media Communication. Difference of lossless/lossy compression techniques.R1] [No. Question No. Multimedia applications Uses of Multimedia. Introduction to making multimedia . production process. Interactive Television. Brief overview to different compression algorithms concern to text.e. Delivering.R2] Syllabus of Bachelor of Computer Applications (BCA).R2] [No. Objectives  To get the Knowledge about the basics concepts of multimedia and its applications. Multimedia Conferencing.The Stages of project. However. Need. video and images etc .  To get the knowledge of its relevance with internet and its future aspects.Web Servers. Plug-Ins and Delivery Vehicles. image. making instant multimedia.5 marks UNIT I Introductory Concepts: Multimedia . CD-i – Overview – Media Types Technology.[T1. Media software . Multimedia skills and training . Sound.Paper Code: BCA 308 Paper ID: 20308 Paper: Multimedia & Its Applications Pre-requisite: Computer Graphics L 3 T 1 C 4 Aim: To understand the basics of software testing. 1 should be compulsory and cover the entire syllabus. audio. content and talent. Each question should be 12. 2. This question should have objective or short answer type questions. CD-ROM: The CD family.T2. It should be of 25 marks. W. Media Entertainment.[T2.[T2. Basic properties and medium types. Media games. The World Wide Web. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. . Memory and storage devices. Hardware peripherals . Connections. Tools for the WWW . Multimedia software and Authoring tools. Virtual Reality. Every unit should have two questions. [T1.(Temporal and non temporal) .R3] [No. Designing and Producing. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Internet Services.Basic tools. Web Browsers. Production Standards. animation Analog/ digital video Data Compression: Introduction.T2. its need and implications on software development and its overall effect on software quality. the requirements to make good multimedia.Definitions. student may be asked to attempt only 1 question from each unit. Assembling and delivering a Multimedia project-planning and costing. 1. rest of the paper shall consist of four units as per the syllabus. Internet working. HTML. Digital Camera. Apart from Question No. Digital Radio. Digital Broadcasting. Designing for the WWW -Working on the Web.Macintosh and Windows production Platforms. Web page makers and editors.Connections. of Hrs: 11] UNIT-IV Multimedia-looking towards Future: Digital Communication and New Media. Multimedia-Hardware and Software: Multimedia Hardware . approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. of Hrs: 11] UNIT-III Multimedia and the Internet: History. Multimedia Applications .f.

2001. 1999. [R4] Steve Rimmer. [T2] Ralf Steinmetz and Klara Naharstedt. PHI. MHI. “Multimedia Handbook”. “Multimedia: Computing.TEXTBOOKS: [T1] Tay Vaughan. TMH. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Andleigh and K. “Multimedia System Design”. W. “Advanced Multimedia Programming”. . TMH.e. “Multimedia & Communication Systems”. Communications Applications”. UK. 1999.Pearson. “Multimedia: Making it work”. Thakkar. 2000. 2000. of Hrs: 11] REFERENCES: [R1] Keyes. Focal Press. 2000. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. PTR. [No. [R3] K.f. Syllabus of Bachelor of Computer Applications (BCA). [R2] Steve Heath.

of Hrs: 11] UNIT-IV UNIX COMMANDS: Advanced Unix commands-Introduction-ls-cat-more-. SCOPE AND IMPORTANCE: Important contributions . Introduction to Bioinformatics. Arrays-Using standard Perl modules-Perl regular expressions I. First Indian Reprint 2005.Paper Code:BCA 310 L T C Paper ID:20310 3 1 4 Paper: BioInformatics Pre-requisites:None Aim: Aims at providing an elementary knowledge of Bioinformatics.Computers and programs – internet .applications of Bioinformatics . Databases and Algorithms.. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1.It aims at introduction of PERL as PERL is one of the important programming languages for Bioinformatics Objectives 1.world wide web – browsers . Narosa Publishing House. 2003. D J parry-Smith.. S. Ignacimuthu.protein sequence data bases . Syllabus of Bachelor of Computer Applications (BCA). To understand Scope of Bioinformatics 2. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. [T2] S. 2. Basic Bioinformatics. rest of the paper shall consist of four units as per the syllabus.nucleic acid sequence databases . An Introduction to Bioinformatics Algorithms. 1995. Jones and Pavel A. 1. [T4] Harshawardhan P BAL. Advanced Unix commands-grep. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Perl Programming for Bioinformatics. Advanced Unix commands-mv-rm-rmdir-uniq-sort. To understand Types of Databases and their use. of Hrs: 11] UNIT-III INTRODUCTION TO BIOINFORMATICS ALGORITHMS: Algorithms and ComplexityBiological algorithms versus computer algorithms – The change problem –Correct versus Incorrect Algorithms – Recursive Algorithms – Iterative versus Recursive Algorithms – Big-O Notations – Algorithm Design Techniques. . 1st Edition.To understand the basic commands in Unix and PERL. BIOPERL: Installation and usage of bioperl modules [No.EMB net – NCBI. [T3] Neil C. [No.aims and tasks of Bioinformatics . W. 3. To understand Notation and different types of Algorithms 4. Every unit should have two questions. MIT Press. of Hrs: 11] UNIT-II DATABASES .5 marks UNIT-I HISTORY. Pearson Education. However. 11th Reprint 2005. Each question should be 12.f.specialized analysis packages [No.sequencing development . [No. 1 should be compulsory and cover the entire syllabus. Apart from Question No. It should be of 25 marks.e. of Hrs: 11] TEXTBOOKS [T1] T K Attwood.challenges and opportunities .structure databases .bibliographic databases and virtual library .TOOLS AND THEIR USES: Importance of databases . Tata McGraw Hill. Pevzner. Question No.J. student may be asked to attempt only 1 question from each unit. PERL: Introduction to Perl-scalars. This question should have objective or short answer type questions.

First Indian Reprint 2004.e. Algorithms in Bioinformatics.f. Lukas K. 2003. [R2] Hooman H. Bioinformatics. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. [R4] ary Benson Roderic page (Eds). . Syllabus of Bachelor of Computer Applications (BCA). W. [R3] C S V Murthy. Springer International Edition. CRC press.REFERENCES BOOKS: [R1] Stephen A. O’Reilly. 2005. 1st Edition 2003. David D. Buehler. Himalaya Publishing House. 2003. Mastering Perl for Bioinformatics. Humana Press. Bioinformatics Basics-Applications in Biological Science and Medicine. Rashidi. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Womble. Introduction To Bioinformatics A Theoretical and Practical Approach. [R5] James Tisdall. Krawetz.

PHI. Knight. LISP and other AI Programming Language [No.I: Introduction to AI. Importance of AI. "Artificial intelligence"."Artificial Intelligence -A new Synthesis" 2nd Edition (2000). REFERENCE: [R1] D. rest of the paper shall consist of four units as per the syllabus. learning in problem solving. Harcourt Asia Ltd. "Introduction to AI and Expert Systems". Logic. Each question should be 12. Computable function and predicate. Discourse and pragmatic processing.II Knowledge representation: Definition and importance of knowledge. Expert system shells. TMH. AI techniques. problem space and search: Defining the problem as a state space search. 2. [No. of Hrs. Issues in knowledge representation. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. 2nd ed. student may be asked to attempt only 1 question from each unit. Using Predicate Logic: Represent ting Simple Facts in logic. Production system and its characteristics.III Natural language processing: Introduction syntactic processing. constraint satisfaction. However. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Knowledge Representation. of Hrs. various approaches used in knowledge representation. Rote learning. Every unit should have two questions.e. Knowledge representation.: 10] TEXTBOOKS: [T1] E. It should be of 25 marks. best first search technique. AI and its related field. 1.IV Expert System: Introduction. of Hrs.: 11] UNIT . Issues in the design of the search problem. 1999 [R2] Nils J Nilsson.Paper Code: BCA 312 Paper Id: 20312 L 3 T 1 C 4 Paper: Artificial Intelligence Aim: To understand the concept of Artificial Intelligence.I Overview of A. 1 should be compulsory and cover the entire syllabus. Learning by taking advice. Semantic processing. [No. [No. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Representing instances and is-a relationship. Learning from example-induction. Patterson. UNIT . Question No. Apart from Question No. Problems. of Hrs. Explanation based learning. Learning: Introduction learning. Representing using domain specific knowledge.W. . NLP and Learning.f.: 11] UNIT . problem reduction. This question should have objective or short answer type questions. Heuristic search techniques: Generate and test. Criteria for success. W.: 12] UNIT . hill climbing. Rich and K.5 marks.. 1999. Syllabus of Bachelor of Computer Applications (BCA).

Smurf Attacks. Decryption Algorithm.  Students will gain the knowledge.5 marks Unit I Information security Attributes of Information Security: Confidentiality. Each question should be 12. 1 should be compulsory and cover the entire syllabus. Logic Bomb. Apart from Question No. skills and abilities to incorporate good information security practice in any organization. SHA1. Integrity. It should be of 25 marks. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. W. However. T[2] Syllabus of Bachelor of Computer Applications (BCA). Block and Stream ciphers. TCP Session Hijacking. 1. T[1]. Key Management. combining Security Associations. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. and Secure Electronic Transactions. Impersonation. SNMPV3. Bastion Host. Certificate Authorities. Encryption Algorithm. Malicious Software. T[2] Unit-III Network Security Network Attacks: Buffer Overflow. Viruses. Requirements for Cryptography. Sequence Guessing. Trojan Horses.SNMPV1. Every unit should have two questions. Secure Socket Layer. T[1]. Cipher Text. Worms & Bacteria. DES. Types of Firewalls: Packet Filtering Router. Message Authentication Public Key Cryptography Principles & Applications.Paper Code: BCA 314 Paper Id: 20314 Paper: Computer Network & Information Security L 3 T 1 C 4 Pre-requisite:Basic knowledge of Computer networks and various network protocols Aim: The aim of this course is to provide an overview of information security and network security and management. TCP sweeps. T[2] Unit – II Public Key Infrastructure &. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Authentication header. Encapsulating Security Pay Load. Algorithms: RSA. Cryptography Basics: Plain Text. Denial of Service. rest of the paper shall consist of four units as per the syllabus.  The course will also examine the practical aspects of the issues involved in secure systems and networks and industry practices being adopted to protect information systems. Message Authentication: One way Hash Functions: Message Digest. T[1]. Basic Port Scans. IP Spoofing. Question No. Virtual Private Network Technology: Tunneling using IPSEC. Denial of Service Attacks: SYN Flood. Network Management Security: Overview of SNMP Architecture. 2. Public Key Infrastructure: Digital Signatures. This question should have objective or short answer type questions. T[1]. . Threats & Vulnerabilities: Unauthorized Access. Digital Certificates. Application Level Gateway or Proxy. Objectives  The course covers a broad range of security related concepts and issues that face industries today. land. Symmetric vs Asymmetric. Trap Doors. Teardrop attacks. Availability. MD5. T[2] Unit – IV Web Security Requirements. Network Scanning: ICMP.e. IP security Architecture: Overview. student may be asked to attempt only 1 question from each unit. Content Filters.f. Firewall Characteristics & Design Principles.

Stallings. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Tata Mc Graw Hill. 2000. Pearson Education. W. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Principles and Practice.e. Stallings. Pearson Education.TEXTBOOKS: [T1] W. . REFERENCE BOOKS: [R1] W. Syllabus of Bachelor of Computer Applications (BCA). Cryptography and Network Security. 2000 [T2] TCP/IP Protocol Suite . Networks Security Essentials: Application & Standards. “Data Communication and Networking”.f. Behrouz A. Forouzan.

I/O Multiplexing and socket options: I/O Models. However. bind. W. TCP Echo server. TCP and UDP & TCP connection establishment and Format. poll function. fork and exec function. standard internet services. listen.5 marks UNIT-I Introduction to Network Programming: OSI model.f. It should be of 25 marks. concurrent servers. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. select function. Socket states.: 11] UNIT-II Sockets : Address structures. 2. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75 1. Each question should be 12. Crashing and Rebooting of server host shutdown of server host. connect. [No. To learn about raw sockets. Close function and related function.: 11] Syllabus of Bachelor of Computer Applications (BCA). Generic socket option. Byte ordering and manipulation function and related functions Elementary TCP sockets – Socket. To learn basics of UDP sockets. student may be asked to attempt only 1 question from each unit. Normal startup. Question No. value – result arguments. Protocol usage by common internet application.Paper Code : BCA 316 Paper Id: 20316 Paper: Network Programming L 3 T 1 C 4 Pre-requisite: Knowledge of Basic Networking/ Networking Protocols Aim: To enable the students to develop the necessary skills for developing robust & scalable network applications and to build necessary basic knowledge for managing networks Objective      To learn the basics of socket programming using TCP Sockets. of Hrs. Batch input. To understand simple network management protocols & practical issues. getsockopt and setsockopt functions. . [No. of Hrs. of Hrs. 1. terminate and signal handling server process termination. Apart from Question No. accept. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Unix standards.e. [No. rest of the paper shall consist of four units as per the syllabus. This question should have objective or short answer type questions. To develop knowledge of threads for developing high performance scalable applications. TCP Echo server functions. 1 should be compulsory and cover the entire syllabus. shutdown function. Buffer sizes and limitation. Every unit should have two questions.: 11] UNIT-III TCP client server : Introduction.

Pearson Edn. [No.f. determining outgoing interface with UDP. . I. .UNIT-IV Elementary UDP sockets: Introduction UDP Echo server function. 1st Edition. Pearson Education Syllabus of Bachelor of Computer Applications (BCA). T CHAN. J. Elementary name and Address conversions: DNS. of Hrs.W. [T2] UNIX Network Programming. PHI. .Richard Stevens. lost datagram.e. summary of UDP example. [R2] UNIX for Programmers and Users. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. W. Lack of flow control with UDP. 3rd Edition Graham GLASS. ROCHKIND. Resolver option. REFERENCES: [R1] UNIX Systems Programming using C++.: 11] TEXT BOOKS: [T1] UNIX Network Programming. PHI. King abls. Pearson Education [R3] Advanced UNIX Programming 2nd Edition M. gethost by Name function. Asia. 2nd Edition. Sockets API.Richard Stevens. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. Vol.W.

Sign up to vote on this title
UsefulNot useful