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.

. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. 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.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). 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 .e. W.Bachelor of Computer Applications THIRD SEMESTER EXAMINATION Code No.f.Net BCA 207 Principles of Accounting BCA 209 Object Oriented Programming using C++. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.

Viva-Voce will be conducted in fifth semester. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011. Syllabus of Bachelor of Computer Applications (BCA).e.Bachelor of Computer Applications FOURTH SEMESTER EXAMINATION Code No.f. . academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. 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. W.

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). . academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. W. approved by BCA Coordination Committee on 26 th July 2011 & SubCommittee Academic Council held 28 th July 2011.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.e.

However. for the award of the degree a student shall be required to earn the minimum of 150 credits.f. 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. 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. The total number of the credits of the BCA programme = 160. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course.Bachelor of Computer Applications SIXTH SEMESTER EXAMINATION Code No.e. 2. Syllabus of Bachelor of Computer Applications (BCA). W. 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

D. Sultan Chand &Sons. Sultan Chand & Sons [T3] Vohra.e. [T4] Gupta.Rardin. 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. Quantitative Techniques in Management 2003.L.Phillips.Racindran. John Wiley.[T2] Gupta. D. Syllabus of Bachelor of Computer Applications (BCA). and Gupta.P. [R2] A.P.K. Statistical Methods. S.S. Optimization in Operations Research.f. W. Natarajan.. Quantitative Techniques and Operations Research. Tamilarasi.T. S. Pearson 2005 REFERENCE BOOKS [R1] R.Solberg. Second edition. . P Balasubramani A. Operations Research.2004 [T5] A.. N. M. J. Prentice Hall. P.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Integrity. Teardrop attacks. 2. This question should have objective or short answer type questions. Application Level Gateway or Proxy. Trojan Horses. Logic Bomb.  Students will gain the knowledge. Each question should be 12. Threats & Vulnerabilities: Unauthorized Access. Basic Port Scans. Availability. 1. Question No. IP security Architecture: Overview. Impersonation. Encapsulating Security Pay Load.e. T[2] Unit-III Network Security Network Attacks: Buffer Overflow. rest of the paper shall consist of four units as per the syllabus. T[1]. TCP Session Hijacking. Cipher Text.SNMPV1. student may be asked to attempt only 1 question from each unit. T[2] 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. Public Key Infrastructure: Digital Signatures. Network Management Security: Overview of SNMP Architecture. DES. Block and Stream ciphers. Objectives  The course covers a broad range of security related concepts and issues that face industries today. Sequence Guessing. Malicious Software. Algorithms: RSA.f.5 marks Unit I Information security Attributes of Information Security: Confidentiality. Encryption Algorithm. Denial of Service Attacks: SYN Flood. Viruses. T[2] Unit – IV Web Security Requirements. Types of Firewalls: Packet Filtering Router. IP Spoofing. MD5. T[1]. Trap Doors. It should be of 25 marks. combining Security Associations. Authentication header. Key Management. Decryption Algorithm. Firewall Characteristics & Design Principles. Content Filters. academic session 2011-12 Note : A Minimum of 40 Lectures is mandatory for each course. TCP sweeps. However. T[2] Unit – II Public Key Infrastructure &. . W. and Secure Electronic Transactions. Symmetric vs Asymmetric. Bastion Host. INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75 1. SHA1. Digital Certificates. Cryptography Basics: Plain Text. Worms & Bacteria. Smurf Attacks. Message Authentication: One way Hash Functions: Message Digest. Certificate Authorities. Every unit should have two questions. Secure Socket Layer. land.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. Network Scanning: ICMP. SNMPV3. Requirements for Cryptography. Apart from Question No. T[1]. Message Authentication Public Key Cryptography Principles & Applications. 1 should be compulsory and cover the entire 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. Virtual Private Network Technology: Tunneling using IPSEC. skills and abilities to incorporate good information security practice in any organization. T[1]. Denial of Service.

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

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

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

Sign up to vote on this title
UsefulNot useful