SCHEME OF EXAMINATION

&

DETAILED SYLLABUS

for

BACHELOR OF COMPUTER APPLICATIONS (BCA) DEGREE

GURU GOBIND SINGH
INDRAPRASTHA UNIVERSITY KASHMERE GATE, DELHI

1

w.e.f. session 2005-2006

Bachelor of Computer Applications
FIRST SEMESTER EXAMINATION
Code No. BCA 101 BCA 103 BCA 105 BCA 107 Paper Mathematics – I Business Communication Programming with C Fundamentals of Information Technology BCA 109 Basics of Physics PRACTICALS BCA 151 Practical – I BCA 153* General Proficiency – I Total
*NUES

L 3 3 3 3 3 0 2 17

T/P 1 0 1 1 1 12 0 16

Credits 4 3 4 4 4 6 2 27

2

w.e.f. session 2005-2006

Bachelor of Computer Applications
SECOND SEMESTER EXAMINATION
Code No. BCA 102 BCA 104 Paper Mathematics – II Business Organization & Management BCA 106 Digital Electronics BCA 108 Data Structures using C BCA 110 Database Management Systems PRACTICALS BCA 152 Practical – II BCA 154* General Proficiency – II Total L 3 3 3 3 3 T/P 1 0 1 1 1 Credits 4 3 4 4 4

0 2 17

12 0 16

6 2 27

*NUES

3

w.e.f. session 2005-2006

Bachelor of Computer Applications
THIRD SEMESTER EXAMINATION
Code No. Paper BCA 201 Mathematics – III BCA 203 Computer Architecture BCA 205 Front End Design Tools BCA 207 Financial Accounting BCA 209 Object Oriented Programming PRACTICALS BCA 251 Practical – III BCA 253* General Proficiency – III Total
*NUES

L 3 3 3 3 3 0 2 17

T/P 1 1 1 0 1 12 0 16

Credits 4 4 4 3 4 6 2 27

4

w.e.f. session 2005-2006

Bachelor of Computer Applications
FOURTH SEMESTER EXAMINATION
Code No. BCA 202 BCA 204 BCA 206 Paper Mathematics – IV Software Engineering Java Programming & Website Design BCA 208 Operating Systems BCA 210 Business Economics PRACTICALS BCA 252 Practical – IV BCA 254* General Proficiency – IV Total
*NUES

L 3 3 3 3 3 0 2 17

T/P 1 1 1 1 1 8 0 13

Credits 4 4 4 4 4 4 2 26

Summer Training will be held for 4 weeks after the end of fourth semester. Viva-Voce will be conducted in fifth semester.

5

w.e.f. session 2005-2006

Bachelor of Computer Applications FIFTH SEMESTER EXAMINATION Code No. Paper BCA 301 Computer Networks BCA 303 . **NUES 6 w.net Programming BCA 305 Linux Environment ELECTIVES (select any One) BCA 307 E-Commerce BCA 309 Design and Analysis of Algorithms BCA 311 Computer network Security PRACTICALS BCA 351 Practical –V BCA 353* Summer Project/Training BCA 355 Minor Project BCA 357** Seminar Total L 3 3 3 3 3 3 0 0 2 14 T/P 1 1 1 1 1 1 8 0 8 0 20 Credit 4 4 4 4 4 4 4 2 4 2 28 *Evaluation will be based on Summer Training held after fourth semester and will be conducted by the college committee only.f. session 2005-2006 .e.

However. Each student shall be required to appear for examinations in all courses. 2. BCA 302 Paper Management Information Systems BCA 304 Mobile Computing BCA 306 Computer Graphics & Multimedia Applications ELECTIVES (select any One) BCA 308 Internet Programming BCA 310 Knowledge Management &New Economy BCA 312 Artificial Intelligence PRACTICALS L 3 3 3 T/P 1 1 1 Credits 4 4 4 3 3 3 0 12 1 1 1 8 10 22 4 4 4 4 5 25 BCA 352 BCA 354 Practical –VI Major Project TOTAL Note: 1.Bachelor of Computer Applications SIXTH SEMESTER EXAMINATION Code No. session 2005-2006 . The total number of the credits of the BCA programme = 160. for the award of the degree a student shall be required to earn the minimum of 150 credits.e. 7 w.f.

However. Reduction Formulae for Trigonometric Functions. 5th Edition. Minors. “Elementary Engineering Mathematics”. Type of Discontinuities [No. Derivatives of Sum. Chain Rule. Fundamental Theorem of Calculus.. 1. Caley-Hamilton Theorem (without proof) [No. [No. L’ Hospitals Rule. Apart from Question No.e. Shanti Narayan. Logarithmic Differentiation. Addition.S. It should be of 25 marks. Adjoint. L 3 T 1 C 4 Question No. Cramers Rule. Gamma and Beta Functions. H.. Grewal. UNIT I DETERMINANTS: Definition. Maxima & Minima. Expansion of Functions (Maclaurin’s & Taylor’s). By Parts. 2. Continuity Over an Interval.Chand & Company. Properties of Determinants MATRICES: Definition. of Hrs: 11] Text Books: 1. Types of Matrices. Product & Quotients. Rank of Matrix Dependence of Vectors. 1998 8 w. Kresyig E. Differences. Intermediate Value Theorem. 1998. 34th Ed. Integration of Algebraic and Transcedental Functions. of Hrs: 11] UNIT III DIFFERENTIATION: Derivative.Code No. 1999. Cofactors. Successive Differentiation & Liebnitz Theorem. 9 Revised Edition. “Integral Calculus”.f. 2001. Curve Tracing. John Wiley & Sons. “Advanced Engineering Mathematics”. of Hrs: 11] UNIT IV INTEGRATION: Integral as Limit of Sum. Mean Value Theorem. 1999 4. session 2005-2006 . Derivatives of Composite Functions. Chand & Company. Double and Triple Scalar and Vector Product and their Applications. Inverse. Partial Fractions. Singular Points. Dass. Every unit should have two questions. Riemann Sum. Rolle’s Theorem. of Hrs: 1 1] UNIT II LIMITS & CONTINUITY: Limit at a Point.K. “Differential Caluculs”. S. Concavity. 3. Properties of Limit. B. student may be asked to attempt only 1 question from each unit. Shanti Narayan.. Reference Books: 1. S. “Advanced Engineering Mathematics”. th 2. S. Chand & Company. This question should have objective or short answer type questions. VECTOR ALGEBRA: Definition of a vector in 2 and 3 Dimensions. rest of the paper shall consist of four units as per the syllabus. Computation of Limits of Various Types of Functions. Eigen Vectors of a Matrix. Methods of Integration Substitution. Each question should be 12. Scalar Multiplication and Multiplication of Matrices.5 marks. 1 should be compulsory and cover the entire syllabus. Asymptote. Subtraction. [No. Indefinite Integrals. Indeterminate Forms. Continuity at a Point.: BCA 101 Paper: Mathematics -1 INSTRUCTIONS TO PAPER SETTERS: 1.

L 3 T 0 C 3 Question No. Choice of words. drafting the application. Disadvantages of oral communication. conjunctions. of Hrs: 12] UNIT-II Written Communication: Objectives of written Communication. “C. However.: BCA 103 Paper: Business Communication INSTRUCTIONS TO PAPER SETTERS: 1. discussions. Apart from Question No. Barriers of communication [No. Format of report. of Hrs: 10] UNIT-IV Business Negotiation: Definition of negotiation. 1 should be compulsory and cover the entire syllabus. Arts of Listening: Good listening for improved communications. Persuasive letters. Rayudu. Styles of oral communication. Guide lines for interviewee. prefix.Code No. Common problems with verbs. summing up). Guidelines for Interviewer.f. Layout of the report. Guidelines for using visual aids. Importance of communication. nature and importance of listening. Media of written communication. It should be of 25 marks. Executive Summary. student may be asked to attempt only 1 question from each unit. session 2005-2006 . 1994. rest of the paper shall consist of four units as per the syllabus. punctuation. Language Skills: Improving command in English. Planning business messages. Letter styles/ layout.The seven Cs of communication. bargaining. Media of oral communication. agreement. Channels of communication. Office memorandum. Negotiation process (preparation. Advantages and disadvantages of meetings/ committees. Art of listening. UNIT-I Concepts and Fundamentals: Meaning of communication. Essentials of good communication . pronouns. Every unit should have two questions.S. E ach question should be 12. Project Presentations: Advantages & Disadvantages. implementation). Kind of meetings. [No. This question should have objective or short answer type questions. Essential Features. Meaning. questions & answers. of Hrs: 10] TEXT BOOK: 1. Report Writing: Meaning & Definition. Good news and bad news letters. Form & Content of an application. Advantages of oral communication. Sales letters. Factors that can influence negotiation. proposals. Communication models and theories. 1. Charts. Distribution of time (presentation. Writing Letters: Business letters. Electronic media (power-point presentation). Factors responsible for growing importance of communication. Process of communication. Himalaya Publishing House. Planning and organization of meetings. suffix etc. what skills do we need to negotiate. adverbs. Structure. Visual presentation. Types of interview. Merits and demerits of written communication.Communication”. Interview styles. Formal and Informal communication. Communication scope. Job Application: Types of application. Art of interviewing. Principles of good listening. Interviews: Meaning & Purpose. 9 w.e. Verbal and Non-Verbal communication. Types of report (Business report & Academic report). of Hrs: 12] UNIT-III Oral Communication: Principles of effective oral communication. Essential requirement of good report writing. Meetings: Definition. 2. Drafting the report.5 marks. adjectives. [No. Preparation of resume. Barriers in listening [No.

.REFERENCE BOOKS: 1. 2003 4. Reuben Ray.S Korlahalli. Malra Treece. 1997. Himalaya Publication House. Rajendra Pal and J. 3. “Communication Today: Understanding Creative Skill”. 1988. 6.e. Sinha. Sultan Chand and sons. 2003 10 w. Prentice Hall. K. 2001 2. Galgotia. 1997. “Essential of Business Communication”. 5. Bovee & Thill. session 2005-2006 . McGraw Hill. 5th Ed. “Business Communication”.f. “Effective of Business Communication”. “Business Communication Today”. Murphy and Hildebrandt. K. New York McGraw. “Successful Communication for Business and Management”.

of Hrs :12] UNIT – III Structures:Structures. Storage Classes: automatic. array of pointers to functions. 2000. bit operators. if…. continue operator. rest of the paper shall consist of four units as per the syllabus. macro’s with arguments. if…. #define. math. structure passing to functions. declarations. of Hrs :12] UNIT – II C Functions:Function: declaration. conditional compilations.Code No. nested control statement. ctype. pointers. “Programming in ANSI C”. Arrays: Arrays. C constructs: If statement. unions. Kernighan and D. E. expressions statements. TMH. [No. conditional operators.e. 1.else statement. 1 should be compulsory and cover the entire syllabus. call by u reference. array of pointers. array & pointer relationship.h. variables and arrays.5 marks.). relational and logical operators. static & registers. session 2005-2006 . symbolic constants. However. 1999. stdlib. definition & scope. compound statements. Apart from Question No. Each t question should be 12. of Hrs : 10] TEXT: 1. [No. goto statement. “The ANSI C Programming Language”. constants. 2. the operators # and ##. Al Kelly and Ira Pohl.h [No.else statement. pointers to functions. multiple file programming. [No. recursion. while statement. Addison Wesley. process. 11 w. conio. BPB Publications.h. string. comma operator. call by val e. pointer to arrays. This question should have objective or short answer type questions. PHI. break operator. Ritchie. B. Identifiers and keywords.h. L 3 T 1 C 4 Question No.. 1999. Yashwant Kanetkar. external (global).while statement. Data types. assignment operators. file handling [text (ascii). Preprocessor directives: #include. switch statement. do…. Every unit should have two questions.f. 3..h. It should be of 25 marks.h.else if…. “Let us C”. 2002 REFERENCES: 1. UNIT I C basics: C character set.: BCA 105 Paper: Programming with C INSTRUCTIONS TO PAPER SETTERS: 1. unary operators. “A Book on C”. pointer arithmetic. of Hrs : 10] UNIT – IV Standard library functions from stdio. (4th Ed. sudent may be asked to attempt only 1 question from each unit. for statement. 2. arithmetic operators. binary]. BalaGuruswamy. bit fields.h. dynamic memory allocation.

Vikas Gupta. Physical Devices Used to construct Memories. 3. 12 w. Leon REFERENCES: 1. Data transmission media. Hypertext. Classification of computers. 2. Block Diagram: Input-output devices. The Generation. software software concepts: system & application software packages. Delhi. Description of Computer Input Units. L 3 T 1 C 4 Question No. flow charting. Sinha & Priti Sinha . [No. WAN and MAN). Vikas Publishing House. interpreters. different types of Database Management System. 1999. 1998. Distributed Computer System. Apart from Question No. floppy Disk Drives. “Introduction to Computers”. linkers. Alex Leon & Mathews Leon. UNIT . Computer Memory: Memory Cel. P. File Systems and Database Management Systems. of Hrs: 10] UNIT . Web Search Engine. Every unit should have two questions. K. Web Browsers. Classification of Computers. Internet Requirements. Data Processing. working with Windows. algorithms. Internet Security. of Hrs: 12] UNIT – IV Basic elements of a communication system. Net Surfing. of Hrs: 10] UNIT . 1 should be compulsory and cover the entire syllabus. “Fundamentals of Information Technology”. Client and Servers. Intranet. 2004 3. Memory Organization.Code No. Internet Services Providers. and Computer Output Units. Magnetic Tape Drives. The Second Generation.f. student may be asked to attempt only 1 question from each unit. Network topologies. 2001. Alex Leon & Mathews Leon. decision tables. The Fifth Generation. 1992. [No. Magnetic Hard disk.III Operating System concepts. “Computer Fundamentals”. Compact Disk Read Only Memory. structure of operating system.5 marks. Internet: Network. [No.: BCA 107 Paper: Fundamentals of Information Technology INSTRUCTIONS TO PAPER SETTERS: 1. However. Techworld. TCP/IP. of Hrs: 12] TEXT: 1. Each question should be 12. This question should have objective or short answer type questions. DOS/UNIX/LINUX commands.II Low level and high level languages. It should be of 25 marks. 4th Ed. Parallel Computers. PHI. Windows 9x/NT/XP. Host & Terminals. Digital and Analog Transmission. [No. Domain Name. Network Types (LAN. session 2005-2006 . Read Only Memory.e. different types of operating systems.. Data transmission modes. compilers. Other Input Methods. 2. Internet Services. V. World Wide Web.I What are computers? The evolution of computers. “Introduction to Computers”. assemblers. The fourth Generation. Data Transmission speed. Serial Access l Memory. “Comdex Computer Kit”. BPB Publications. Computer Generation & Classifications: First Generation of Computers. rest of the paper shall consist of four units as per the syllabus. 1999. Wiley Dreamtech. 1. “Introduction to computers”. Uniform Resource Locator. TMH. Norton Peter. pseudo code. Raja Raman. 2. OSI & TCP/IP Model. IP Address.

S.5 marks.: BCA 109 Paper: Basics of Physics INSTRUCTIONS TO PAPER SETTERS: 1. Chemical effects. voltage. Magnetic field due to current forces on current and the lorentz force. Electromagnetic Induction: Faraday’s experiments. 2. Published by Nageen Publications. conservation of Energy [No. Electromagnetic induction and Lorentz force. Friction. Meerut. ohm’s law and resistivity of materials. Different Forms of Energy. 2. effect of dielectrics in capacitors. electrostatics of conductors. Class XI.II”.III Electricity and Electromagnetism: Electric Forces. conductors and insulators. resistance. Each question should be 12. applications . Energy & Power: Work. capacitors and capacitance. Kinetic Energy. “Fundamental Physics”. of Hrs: 11] UNIT – IV Thermal and Chemical effects of current: Heating effects. XII. 1 should be compulsory and cover the entire syllabus. 2002. Oersted’s discovery. Meerut. Potential Energy. Part – I”. Electrostatics: Gauss’s theorem. Power. charges & Fields: Frictional electricity. potential energy. Newton’s Second law of Motion.Code No. Part . This question should have objective or short answer type questions. Every unit should have two questions. “Physics. “Physics. Thermo Electricity. By Nageen Publications. coulomb’s law. I & II. It should be of 25 marks. K. currents and resistance [No. The law of inertia or Newton’s first law of motion. Apart from Question No. electrical circuits & Kirchhoff’s rule. session 2005-2006 . Pradeep.f. Solenoid. 2000. electrostatic potential. 1. 2. UNIT . [No.I Law of Motion: Force and Inertia. Lubrication [No. Magnetic effects of currents. Lenz’s Law and conservation of energy. measurement of voltages. Semiconductors and their property. 13 w. properties of electric charge. REFERENCE BOOKS: 1. student may be asked to attempt only 1 question from each unit. L 3 T 1 C 4 Question No. rest of the paper shall consist of four units as per the syllabus. Newton’s third law of Motion Equilibrium of concurrent forces. Faradays Law. Published. of Hrs: 11] TEXT BOOK: 1. Kumar Mittal. discussion of Faraday’s Law. Ampere’s circulate law.e. Modern Publishers. of Hrs: 11] UNIT . Current Electricity: Current. Gupta. Kumar Mittal. “Modern ABC of Physics”. Vol. electric field . lines of force. Collisions. However. of Hrs: 11] UNIT – II Work.

f.e. : BCA 151 Paper: Practical – I Practical will be based on following Papers: 1. Fundamentals of Information Technology L 0 P 12 C 6 14 w. session 2005-2006 . Programming with C 2.Code No.

e.f. : BCA 153* Paper: General Proficiency – I L 2 T 0 C 2 *Non University Examination Scheme (NUES) There will not be any external examination of the university. session 2005-2006 .Code No. The committee may conduct viva-voce at the end for the award of the marks. The performance of the candidates should continuously be evaluated by an internal committee. 15 w.

UNIT-I SETS: Sets. Busby and Ross. Logarithmic and Exponential Functions. S. Sarkar. L 3 T 1 C 4 Question No. Basic Properties. 3D COORDINATE GEOMETRY: Review of 2D Coordinate Geometry: Equations of Straight Lines. [No. Partial Order Relation Function: Domain and Range. Straight Lines. H. lub. Principle of Duality. S. [No. Parabola. Cartesian Product. Apart from Question No. 1. REFERENCE BOOKS: 1. 1996.e. Tangent plane at a point on the sphere. “Discrete Mathematical Structure”. Representation of POSETS using Hasse diagram. Chains. of Hrs: 12] TEXT BOOKS: 1. Shortest Distance Between Two Lines. It should be of 25 marks.5 marks. Equations of Ellipsoid. This question should have objective or short answer type questions. Euler’s Theorem. Cardinality of Set. PHI. 2. Circle. [No. Finite and Infinite Sets. 1 should be compulsory and cover the entire syllabus. Projection of Join of Two Points on a Plane. Equations of Sphere.Chand & Co. Maximal and Minimal Point.. Into and One to One Functions. of Hrs: 10] UNIT-IV MULTIPLE INTEGRATION: Double Integral in Cartesian and Polar Coordinates to find Area. Composite and Inverse Functions.K. 2. Operation on Sets. However.. 3D Coordinate Geometry: Coordinates in Space.K. Chain Rule. rest of the paper shall consist of four units as per the syllabus. “Advanced Engineering Mathematics”. [No. Angle Between Two Lines. Subsets. Hyperbolid and Cylinder in Cartesian coordinate. Every unit should have two questions. Distributed & Complemented Lattics. of Hrs: 11] UNIT-III FUNCTIONS OF SEVERAL VARIABLES: Partial Differentiation. Equivalence Relation. Change of Variables. Simple Applications. Change of Order of Integration. Conditions for Two Lines to be Coplanar. Equations of Plane. Extrema of Functions of 2 Variables. student may be asked to attempt only 1 question from each unit. Hyprbola. Equal Sets Universal Sets. “Discrete Maths”. Conditions for a line to lie on a plane. Onto. Chand & Co. of Hrs: 11] UNIT-II PARTIAL ORDER RELATIONS AND LATTICES: Partial Order Sets.. Kolman. Lattices & Algebric Systems.Code No. Paraboloid. Direction Cosines. RELATIONS AND FUNCTIONS: Properties of Relations. Triple Integral to Find Volume of Simple Shapes in Cartesian Coordinates.f. session 2005-2006 . 9th Revised Ed. 2001. Dass. Ellipse. 2000 16 w. Intersection and Complements of Sets. S. Union. Introduction of Trignometric. Each question should be 12. Glb.: BCA 102 Paper: Mathematics II INSTRUCTIONS TO PAPER SETTERS: 1. Sublattices.

K. PHI-1999 5. Singh B. Sales Promotions (including Salesmanship) [No. Marketing Management”.Basic Concepts of marketing.N and Maheshwari S. of Hrs. Challenges and opportunities for OB. Career Planning & Development. session 2005-2006 .Basic Concepts. 10th Ed. 8th Ed. However.:12] UNIT III Managing Personnel.e.A global perspective”. Users. Meaning.5 marks. Kotler. Maheshwari S. merits & demerits). Contributing disciplines to the field of OB. [No. Maheshwari S. John W. rest of the paper shall consist of four units as per the syllabus..:12] UNIT IV Managing Production. of Hrs. of Hrs. 9th Ed. “Philip. Business as a system. Planning and Control. 6. 1998. Each question should be 12. “Financial Management – Principles and Practice”. 6 revised Ed. REFERENCE BOOKS: 1. Henry Fayol’s principles of management.. Managing Sales and Marketing. L 3 T 0 C 3 Question No. It should be of 25 marks. 17 w.. Newstrom and Keith Davis.. [No. Chadha N. Business and Legal and Economic Environment.Issues. 1 should be compulsory and cover the entire syllabus.: 09] TEXT BOOKS: 1. Chand & Sons.N. UNIT I Business –Meaning and Contents. 2.Need of Understanding human behavior in organizations. Dhanpat Rai & Co. “An introduction to Accountancy”. 2000 2. Stephen P. Role of Manager. 2000 th 2.P.K.N. Type of Budgets. Manpower Planning.. 10th Ed. Every unit should have two questions. Robbins. Prentice Hall of India.Meaning and Functions.. Prentice Hall of India. student may be asked to attempt only 1 question from each unit. Elements of Productions. Vikas publishing house Panneerselvam.:11] UNIT II Management. Managing Finance-Concept of Fixed and Working Capital.f. 1992. 2000. “Human Resource Management.Code No.HRM.. “Organisational Behaviour”. Production and Operations Managmenet. “Organisational Behaviour–Human Behaviour at work”. of Hrs.. Objectives. Accounting: Meaning. Budgeting. Main Sources of Finance. 5th Ed. 1997. Apart from Question No. 1. 4. Koontz and Weihrich. Basic Functions (in short). 1993. “Management . Training. This question should have objective or short answer type questions.Management Principles. Conceptual Models of OB. McGraw Hill International Ed.. Job Analysis and Design. Motivation. Business Organisation and Management Functions. Forms of Business Organization (meaning. Nature and Process. & Chabbra T. Taylor’s Scientific Management.: BCA 104 Paper: Business Organization & Management INSTRUCTIONS TO PAPER SETTERS: 1.Meaning. Management Process. S. 3. Compensation Management. Case Studies & Experimental Exercises”. [No. Organizational Behavior.

PHI. However. 3rd Edition. 2002 2. R. R. UNIT-I Boolean Algebra Basics Laws of Boolean Algebra. Race around condition. “Digital Logic and Computer Design”. Subtractor. (Binary. Vikas Publication. PHI Publications. of Hrs: 11] UNIT-III Flip-flops S-R. 2003. PAL & PLA TEXT BOOKS 1.Code No. Tata McGraw Hill.RAM. 1 should be compulsory and cover the entire syllabus. Overview of Gray codes and Excess – 3 codes. encoders. student may be asked to attempt only 1 question from each unit. Every unit should have two questions. Apart from Question No. "Digital Principles and Application". [No. Clocked Flip-flop. J-K. TMH. Principles and Applications”. Code Conversion. S.Gothman.5 marks. decoders. session 2005-2006 . W. Twisted Ring Counter. 1. Design of code converters. T. L 3 T 1 C 4 Question No. D. [No. Bi-directional shift register. Each question should be 12. Moris Mano. It should be of 25 marks. This question should have objective or short answer type questions. “Modern Digital Electronics”.L. 2001 4. Jain. Logic Gates. of Hrs: 11] Memory Devices .e.Tokheim. “Digital circuits and design”. of Hrs: 11] UNIT-IV Counters Ripple counter. Shift Registers Serial-in-serial out.f. Combinational Circuits Multiplexers. Realisation of one flip-flop using other flip-flop. Master slave Flip-Flop. Modulo Counters. “Digital Electronics. ROM. Parallel binary adder/Subtractor. Arivyhgan. Simplifications of Boolean equations using K-maps. 3. [No. serial-in-parallel out. Salivahanan & S. REFERENCES: 1. binary multiplier and dibvider. Synchronous Counter. “Digital electronics”. rest of the paper shall consist of four units as per the syllabus. parallel-in-serial out and parallel-in-parallel-out. 1999. 2. of Hrs: 11] UNIT-II Arithmetic Circuits Adder. Malvino Leach. [No. 2. De-Multiplexers. Hexadecimal). 18 w. Ring Counter. Octal. TMH. 1999.: BCA 106 Paper: Digital Electronics INSTRUCTIONS TO PAPER SETTERS: 1. P.

deletion. Galgotia Booksource Pvt. insertion. S.e.f. Each question should be 12. L 3 T 1 C 4 Question No. R. deletion. B-trees: working up from the bottom. 2. E. (P) Ltd. “C & Data Structure”. Ltd. Sequential and linked lists. 2002. operations such as traversal.5 marks. “Fundamentals of Data Structures”.Code No. [No.: BCA 108 Paper: Data Structures Using C INSTRUCTIONS TO PAPER SETTERS: 1. 1 should be compulsory and cover the entire syllabus. “Data Structure & Algorithms”. However. searching. insertion. Every unit should have two questions. “Data Structures using C and C++”. D-queues and priority queues. selection sort. 1. Statement of the problem. Searching Techniques: linear search. Salaria. 2002 19 w. of Hrs: 08] TEXT: 1. P. This question should have objective or short answer type questions. Apart from Question No. session 2005-2006 .lower and upper triangular matrices and Tri-diagonal matrices Stacks and Queues: Introduction and primitive operations on stack. 3. Indexing with binary search trees.. Schaum’s outline series. REFERENCES: 1. Traversal of binary trees. TMH. sparse arrays . postfix. Horowitz and S. 2. of Hrs: 13] UNIT-II Lists: Introduction to linked lists. Recursive algorithms for tree operations such as traversal. Wiley Dreamtech.G. UNIT-I Arrays: Representation of single and multidimensional arrays. heap sort. of Hrs: 13] UNIT-III Multilevel indexing and B-Trees: Introduction: The invention of the B-tree. “Data Structure”. Stack application: Infix. 2003 2. binary search and hashing [No. Khanna Book Publishing Co. Multilevel indexing. Evaluation of postfix expression. PHI. prefix expressions.. [No. 1st Edition. Sahani.Introduction and primitive operation on queues. Kakde. Y. 2003. of Hrs: 10] UNIT-IV Sorting Techniques: Insertion sort. [No. rest of the paper shall consist of four units as per the syllabus. It should be of 25 marks. 1999. Example for creating a B-tree. Langsam et. Deshpande and O. S. a better approach to tree indexes. student may be asked to attempt only 1 question from each unit. Two way lists and Use of headers Trees: Introduction and terminology. merge sort. Conversion from infix to postfix. al.

1997. Bipin Desai. However. specialization and generalization. Elmarsi and SB Navathe. of Hrs.: 10] UNIT – IV Data Normalization: Functional dependencies. Recovery Techniques. UNIT – I Introduction: Characteristics of database approach. Database Security [No. session 2005-2006 . E-R Modeling: Entity types. K. locking techniques and associated.e. security and authorization. [No. 1991. inheritance. Galgotia Publications.: 10] UNIT – III Relational Data Model: Relational model concepts. 1. data models. Addison Wesley. It should be of 25 marks. L 3 T 1 C 4 Question No. A. 2. Henry Korth.Code No. “Data Base Management Systems’.. “An Introduction to database Systems”. of Hrs. weak entities. Sub Classes:. Battacharya. P. dynamic hashing approachimplementation and performance.f. hashing. 1996. roles and structural constraints. extendible hashing. relational algebra.5 marks. 3. 4. entity set. Every unit should have two questions. Super classes. database recovery. This question should have objective or short answer type questions. Sudarshan. 4th Ed. implementation using B++ trees. relation types. programming using SQL EER and ER to relational Mapping: Data base design using EER to relational language. [No. relationships. TMH. enhanced E-R and object modeling. student may be asked to attempt only 1 question from each unit. “Understanding the new SQL: A complete Guide”. McGraw Hill. 2004 REFERENCE BOOKS: 1. attribute and key.: 12] UNIT – II File Organization: Indexed sequential access files. DBMS architecture and data independence. of Hrs. Morgan Kaufmann Publishers. collision resolution. 1 should be compulsory and cover the entire syllabus. hashing functions. “Database Systems Concepts”. Apart from Question No. 4th Edition. 1993. Concurrency Control: Transaction processing. rest of the paper shall consist of four units as per the syllabus. Abraham Silberschatz.: 12] TEXT BOOKS: 1 R. Majumdar. S. [No. Jim Melton. relational constraints. “Fundamentals of Database Systems”. Alan Simon. Each question should be 12. Normal form up to 3rd normal form. 20 w. 2. of Hrs.: BCA 110 Paper: Database management System INSTRUCTIONS TO PAPER SETTERS: 1. SQL: SQL queries.

Data Structure with C 2. : BCA 152 Paper: Practical – II Practical will be based on following Papers: 1.Code No.e.f. session 2005-2006 . Database Management System L 0 P 12 C 6 21 w.

e.Code No. session 2005-2006 . The committee may conduct viva-voce at the end for the award of the marks. : BCA 154* Paper: General Proficiency – II L 2 T 0 C 2 *Non University Examination Scheme (NUES) There will not be any external examination of the university. The performance of the candidates should continuously be evaluated by an internal committee.f. 22 w.

Cauchy’s Integral Test (without proof) [No. Apart from Question No. Logarithmic Test. Each question should be 12. ORDINARY DIFFERENTIAL EQUATIONS OF SECOND ORDER: Homogenous Differential Equations with Constant Coefficients. Scalar and Vector Fields. Linear Differential Equations. 1 should be compulsory and cover the entire syllabus. Differential Equations of First Order and First Degree by Integrating Factor. Fourier Series of Even and Odd Functions.: BCA 201 Paper: Mathematics . Khanna Publishers.III INSTRUCTIONS TO PAPER SETTERS: 1. Every unit should have two questions. Differential Operator. Jaggi. SERIES AND CONVERGENCE: Sequence. Powers and Roots.e. Ltd. SEQUENCE. Functions of Complex Variables. session 2005-2006 . Convergence of a Sequence. K. It should be of 25 marks. Bounded Sequence. Partial Sums. H. Limit of a Sequence. 1999. of Hrs: 9] UNIT IV ORDINARY DIFFERENTIAL EQUATIONS OF FIRST ORDER: Variable. UNIT-I COMPLEX VARIABLES: Complex Number System. Cauchy Differential Equations. [No. Half Range Series. (only Real and Distinct Roots) Operator Method for Finding Particular Integrals. (Direct Formulae). Cases of Complex Roots and Repeated Roots.5 marks. “Advanced Engineering Mathematics”. Bernoulli’s Differential Equations. Exact Differential Equations. [No.P. Convergent Series. Dirichlet Condition. R. Solution by Undetermined Coefficients. 1. General Power of Functions. S. 23 w. Leibnitz Test. Gradient. Chand & Co. 2. REFERENCE BOOKS: 1. of Hrs: 13] TEXT BOOKS: 1. Solutions by Methods of Direct Formulae for Particular Integrals. New Age International Pvt. Polar Form. [No. However. Monotonic Sequence. Finite and Infinite Sequences. 1999. SRK Iyengar.B.Separable Method. “Advanced Engineering Mathematics”. This question should have objective or short answer type questions. Homogeneous Differential Equations. A. student may be asked to attempt only 1 question from each unit.Code No. Line Integral and Green’s Theorem. Algebra of Complex Numbers. Theorems on Convergence of Series. “Numerical Methods for Scientific & Engineering Computation”.f.. L 3 T 1 C 4 Question No. Inverse Trignometric and Hyprerbolic Functions. Mathur and V.K. Ratio Test. rest of the paper shall consist of four units as per the syllabus. of Hrs: 13] UNIT II VECTOR CALCULUS: Differentiation of Vectors.. Dass. Comparison Test. Series. of Hrs: 9] UNIT III FOURIER SERIES: Periodic Functions.. Raabe’s Test. Convergence of Binomial and Logarithmic Series. Divergence and Curl and their Physical Meaning. 2. Jain. 3rd Edition. 2001. 9th Revised Ed. Directional Derivatives. Cauchy’s Root Test. Fourier Series. Elementary Functions.

Shift Microoperations. Direct Memory Access (DMA) [No. 2.e. Associative Memory. 1. Input-Output Interfaces. Prentice Hall of India Private Limited. Cache Memory. Prentice-Hall of India Private Limited. However. Virtual Memory.Output Instructions. of Hrs: 11] UNIT-IV Memory Organization: Memory Hierarchy. 1 should be compulsory and cover the entire syllabus. Auxiliary Memory. This question should have objective or short answer type questions. Malvino. rest of the paper shall consist of four units as per the syllabus. Computer System Architecture. 2000.5 marks. of Hrs: 11] TEXT BOOKS : 1. Timing and Control. 4th Edition.Code No. Delhi. Morris Mano. Logic Micro-operations. student may be asked to attempt only 1 question from e unit. [No. Computer Systems Design & Architecture. Register reference instructions. McGraw Hill. Memory Management Hardware [No. of Hrs: 11] UNIT-II Basic Computer Organizations and Design: Instruction Cycle. for fixed point-members. Modes of Transfer. Input . Bus and Memory Transfers.f. Computer Organization and Architecture. 1993. Input-Output Organization: Peripheral Devices. 1999. session 2005-2006 . Every unit should have two questions. “Digital Computer Electronics: An Introduction to Microcomputers”. Arithmetic Micro-operations. of Hrs: 1 1] UNIT-III Computer Arithmetic: Introduction. Asynchronous Data Transfer. [No. General Register Organization. Design of Accumulator Logic Shift Unit Central Processing Unit: Introduction. Division Algorithms. WIliam Stallings. Stack Organization. Addison Wesley. Memory-Reference Instructions. UNIT-I Register Transfer and Micro-operations:Register Transfer Language. Apart from Question No. Each ach question should be 12. Addressing Modes. Multiplication Algorithms. Main Memory. 3. 3rd Edition. REFERENCE BOOKS: 1. Arithmetic logic shift unit Basic Computer Organizations and Design: Instruction Computer Instructions. L 3 T 1 C 4 Question No. Codes. 2001 2. 24 w. Register Transfer. Harry & Jordan. Instruction Formats. It should be of 25 marks. Priority Interrupt. Computer Registers.: BCA 203 Paper: Computer Architecture INSTRUCTIONS TO PAPER SETTERS: 1.

rest of the paper shall consist of four units as per the syllabus. Subroutine and functions. Perry. Techmedia. Files System Orbit Object. MAPI interface. procedure/Public.5 marks. Active X Data controls. “Peter Norton’s Guide to Visual Basic 6”. Classes.: 11] TEXT: 1. Overview of COM/DCOM using Windows API Functions. of Hrs. Greg. Assignment. Petroutsos. RDO Data view Window. Petroutsos. Labeling the topics. variable declaration. 1 should be compulsory and cover the entire syllabus. Pass Engine.next. Interfacing [No. arrays. Data Types. Every unit should have two questions. E. UNIT-I Visual Basic: Variable Names. MS-Common Controls. System. MDI. Properties and events. Norton Peter. Backend Stored procedure Usage. Code Module. However. of Hrs. through ODBC. 25 w. Scale Modes. Crystal Using Visual Basic (VB) for Transaction Management. If-then-else. If-then. MS-Jet Data bound controls.: 11] UNIT-IV Help Writing: Building a help. L 3 T 1 C 4 Question No.Code No. help file. Adding Multimedia. REFERENCES: 1. expression. of Hrs. controls. built-in & User defined types. [No.: BCA 205 Paper: Front End Design Tools INSTRUCTIONS TO PAPER SETTERS: 1. 1. send keys.0”. [No. primary & secondary help window. “Mastering Database Programming with Visual Basic 6”. setting Fonts. VB Script. recordsets. Using HTML help workshop. This question should have objective or short answer type questions. linking to internet. content sensitive help. 1998.f. Common dialog Boxes. ADO. Databases.e. “Teach Yourself Visual Basic 6 in 21 Days”. Creating a help project. Building & Topics File. while-wend. 2. Printer Object (Printing text. 2. For. BPB Publications. graphics). 2000 2.: 11] UNIT-II Structure of VB program. Techmedia. Arithmetic Operator. SDI. 1998.: 11] UNIT-III Database Interface: Review of ANSI SQL. Boolean Operators. Each question should be 12. Data Environment Designer. It should be of 25 marks. with RDBMS. Control Arrays. File Handling – Text and Binary Files. Visual source safe. do loop. 1998. Apart from Question No. picture controls. student may be asked to attempt only 1 question from each unit. Workspaces. Forms & built in controls. ActiveX Report and Data Report Utility Concurrency Control. Microsoft Transaction Server. Private and Static & Dim Statement. DB-Engine. of Hrs. [No. ODBC. Error Handling. print statement. image-controls. DAO. BPB Publications. if then-elseifelse.. E. “Mastering Visual Basic 6. session 2005-2006 .

introduction. preparation of cash flow statement. Preparation of funds flow statement. Concepts. of Hrs. Cash Book. inventory accounting and control. “Principals of Management Accounting”. Sultan Chand & Sons.Code No. simple problem. L. N. uses. “Financial Accounting” 3.: 09] TEXT BOOKS: 1.: BCA 207 Paper: Financial Accounting INSTRUCTIONS TO PAPER SETTERS: 1. of Hrs. [No. Sultan Chand & Sons. 2001. Sultan Chand & Sons. “Advanced Accounts”. uses. rest of the paper shall consist of four units as per the syllabus. Introduction to trial balance. 2003 REFERENCES BOOKS: 1. Financial Accounting & Management Accounting.: 08] UNIT – III Financial statement analysis: Ratio analysis. Concept of cost of capital. Application of computers in accounting. Khan & Jain. “Principles & Practice of Accountancy”. Journal and bank account. Cash flow analysis. [No. Funds flow analysis.. 14th Edition.5 marks. 11th Edition.: 08] UNIT – II Basis of accounting-cash & accrual. Gupta V. Measurement of cost of capital. Introduction to Ledger posting and trial balance. Each question should be 12. Apart from Question No. of Hrs. Accounting procedure used for recording cash. student may be asked to attempt only 1 question from each unit. Scope of Financial Accounting. 4. Journalizing transaction. 1. 1 should be compulsory and cover the entire syllabus.. Theory of working capital: Nature and concepts [No. cost of debt. K. “An Introduction to Accountancy”.e. 2. Valuation of inventory on balance sheet date. 8th Edition. Vikas Publishing House. Bank and journal transactions using appreciate vouchers. L 3 T 0 C 3 Question No. Accounting concepts & convention. 2. It should be of 25 marks. Profit and Loss account and balance sheet. importance. concepts. Maheshwari S. UNIT – I Meaning and Nature of Financial Accounting. Introduction to FIFO. Introduction to stocks & shares. simple problem. session 2005-2006 . Break-even analysis. explicit & implicit cost. Maheshwari & Maheshwari. Capital and revenue items.f. LIFO & Weighted Average method of inventory valuation. However. This question should have objective or short answer type questions.. [No. 26 w. 1999. of Hrs. Introduction to ledger accounting. Accounting standards in India.: 08] UNIT – IV Inventory valuation: Objectives. Every unit should have two questions. Shukla and Grewal. Gupta R.

[No. 2. R.Venugopal.Code No. object types. 4th Ed. Streams and files. Tony Gaddis.. Polymorphism. Lawlor. “Object Oriented Programming with C++”. Aggregation. 3rd Edition. Rajkumar. of Hrs: 12] UNIT – II Classes and Objects: Encapsulation. data decomposition). REFERENCE: 1. 5. S. 1. Polymorphism by parameter. Overriding inheritance methods. derivation – public.e. TMH. Relating to other paradigms (functional. composition vs classification hierarchies. State identity and behavior of an object. 3. Encapsulation. “C++ Primer”. C++ garbage collection. Class hierarchy. Parasons. 1 should be compulsory and cover the entire syllabus. Difference between C and C++ . of Hrs. 2. 1999. Apart from Question No. information hiding. Steven C. Files and Exception Handling: Persistant objects. D . dynamic memory allocation. Operator overloading. Method polymorphism. Lippman & J.: BCA 209 Paper: Object Oriented Programming INSTRUCTIONS TO PAPER SETTERS: 1. Generic Classes [No. UNIT – I Introduction: Introducing Object-Oriented Approach. “C++: The Complete Reference”. 3rd Ed. Ravishanker “Mastering C++”. “The Art of Programming Computer Science with C++”. attributes.5 marks. 2. “Object-Oriented Programming in C++”. session 2005-2006 . function name overloading. of Hrs: 10] TEXT: 1. 2004.cin.. private & protected. Exception handling. Parametric polymorphism. student may be asked to attempt only 1 question from each unit. [No. 2004. This question should have objective or short answer type questions. Run time polymorphism. A. Vikas Publication. Inheritance. Each question should be 12. Categorization of polymorphism techniques. Watters. cout. Constructors and destructors.f. BPB Publication. 4. Every unit should have two questions. T. rest of the paper shall consist of four units as per the syllabus. “Object Oriented Programming using C++”. Namespaces. Metaclass/abstract classes. Addison Wesley. methods. Wiley Dreamtech. Default parameter value. delete operators. B. 1997. L 3 T 1 C 4 Question No. Tata McGraw Hill. Basic terms and ideas: Abstraction. [No. 2000. new. Lafore.R. abstract data types. 27 w. instantiation of objects. Lajoie. Muganda. Object & classes. Review of C. However. It should be of 25 marks. Galgotia Publications. of Hrs: 10] UNIT – IV Generic function – template function. C++ class declaration. 12] UNIT – III Inheritance and Polymorphism: Inheritance. Polymorphism. Schildt Herbert. Multiple Inheritance.

e.f. Object Oriented Programming L 0 P 12 C 6 28 w. session 2005-2006 . : BCA 251 Paper: Practical – III Practicals will be based on following Papers: 1.Code No. Front End Design Tools 2.

The committee may conduct viva-voce at the end for the award of the marks. The performance of the candidates should continuously be evaluated by an internal committee.Code No. : BCA 253* Paper: General Proficiency – III L 2 T 0 C 2 *Non University Examination Scheme (NUES) There will not be any external examination of the university.f. session 2005-2006 . 29 w.e.

PROBABILITY: Definition of Probability. Newton – Raphson Method for Solving Equation Involving One Variable only. student may be asked to attempt only 1 question from each unit. H. Every unit should have two questions. Each question should be 12.e. of Hrs: 12] UNIT IV SOLUTION OF LINEAR SIMULTANEOUS EQUATIONS: Gaussian Elimination Method with and without Row Interchange: LU Decomposition: Gauss .f.: BCA 202 Paper: Mathematics IV INSTRUCTIONS TO PAPER SETTERS: 1.K. It should be of 25 marks. “Discrete Mathematics”. Backward Difference Operators and their Inter-relation. This question should have objective or short answer type questions. Chand & Co. S. Repetition and Constrained Repetition. L 3 T 1 C 4 Question No. S. 3. [No.S. Parabola and Exponential Curves: Regression Analysis. 2. Moment Generating Functions. Prentice Hall of India. Trapezoidal Rule. False Position Method. Conditional Probability. 1998.5 marks. 9th Revised Edition. Mathematical Expectation. Interpolation Formulae-Newton’s Forward. Apart from Question No. Spearman’s Rank Correlation. Dass. Numerical Integration..Jacobi and Gauss-Seidel Method. Baye’s Theorem [No. SOLUTION OF NON LINEAR EQUATION: Bisection Method. Poisson and Normal Distributions. Gauss – Jordan Method and to find Inverse of a Matrix by this Method. Sarkar. CORRELATION: Karl Person Coefficient of Correlation. UNIT-I STATISTICS COMBINATORICS: Permutation and Combination.Chand & Co. Forward Difference. Least Square Method: Straight Line. Backward and Divided Difference Formulae: Lagrange’s Formula. Binomial Coefficients. Binomial. 2. “ Numerical Analysis”.First and Second Order Derivatives at Tabular and Non-Tabular Points. NUMERICAL DIFFERENTIATION.K. S. 2001. Moments. 1. [No. of Hrs: 10] UNIT II PROBABILIT Y DISTRUBUTIONS: Review of Mean & Standard Deviation. of Hrs: 12] TEXT BOOKS: 1. [No. S. 30 w.Code No. Simpsons 1/3 Rule: Error in Each Formula (without proof). However. “Advanced Engineering Mathematics”. 1 should be compulsory and cover the entire syllabus. 2000. of Hrs: 10] UNIT III INTERPOLATION: Operators: Shift. session 2005-2006 . rest of the paper shall consist of four units as per the syllabus. Binomial Theorem.. Sastry.

Data Structure Metrics. UNIT – I Introduction: Software Crisis. Waterfall. Sommerville. IRWIN.. Aggarwal & Yogesh Singh. The Process. 1996.IV Software Testing: Testing Process. Functional Testing. “Software Engineering”. [No. 2005. of Hrs. Configuration Management. Classification of Cohesiveness & Coupling. Unit Testing.: 10] UNIT . Evolutionary and Spiral Models Software Requirements analysis & specifications: Requirement engineering. Types of Testing. [No. Nature of SRS.: 10] UNIT . I. However. requirements analysis using DFD. Design of Test Cases. “Classical & Object Oriented Software Engineering”. Each question should be 12.III Software Design: Cohesion & Coupling. 2nd Ed. Software Re-engineering. Cost Estimation Models. Software Processes & Characteristics. Debugging Activities Software Maintenance: Management of Maintenance. requirement elicitation techniques like FAST. Software life cycle models. 2001. [No. Pedrycz. Object Oriented Design Software Metrics: Software measurements: What & Why. Maintenance Process. K.: 12] UNIT – II Software Project Management Concepts: The Management spectrum. Prototype. Every unit s should have two questions. Apart from Question No.f. 31 w. K.: 12] TEXT: 1. Reverse Engineering.: BCA 204 Paper: Software Engineering INSTRUCTIONS TO PAPER SETTERS: 1. This question should have objective or short answer type questions.5 marks. Halstead Software Science Measures. [No. New Age International. of Hrs. COCOMO. Stephen R. REFERENCE: 1. Risk Management.. student may be asked to attempt only 1 question from each unit. 2. The People The Problem. of Hrs. John Wiley & Sons. James Peter. Ed. 2002. Function Oriented Design. of Hrs. McGraw Hill Int. Characteristics & organization of SRS. Structural Testing.. “Software Engineering – A practitioner’s approach”. L 3 T 1 C 4 Question No. R. S. Pressman. Design Metrics. Addison Wesley. Integration Testing and System Testing. 5th Ed. QFD. rest of the paper shall consist of four units a per the syllabus.Code No. W.e. Requirements documentation. 2. Token Count. 1 should be compulsory and cover the entire syllabus. Schach. It should be of 25 marks. “Software Engineering”. 1. “Software Engineering: An Engineering Approach”. 2. 3. session 2005-2006 . Test Activities. Documentation. Data dictionaries & ER Diagrams. The Project Software Project Planning: Size Estimation like lines of Code & Function Count.

student may be asked to attempt only 1 question from each unit.Schildt. rest of the paper shall consist of four units as per the syllabus. <FRAMESET> tags. of Hrs. 1998.: 10] UNIT – III Networking (datagram socket and TCP/IP based server socket).IV HTML: use of commenting. H.Code No. L 3 T 1 C 4 Question No.. Drivers in java. T. horizontal rules. table. list and other Listeners. arrays. menu bar). 2000. session 2005-2006 . layout manager. However. 2000. classes (inheritance.: 12] UNIT . H.: BCA 206 Paper: Java programming and website design INSTRUCTIONS TO PAPER SETTERS: 1.J. [No. [No. strings. It should be of 25 marks. control structured. Combo box. of Hrs. Internet and world wide web – how to program.R. Labels. images. Shelley Powers. [No.: 12] UNIT – II Java applets. exception handling). 1 should be compulsory and cover the entire syllabus. P.M. Techmedia Publication. file formats including image formats. ODBC connectivity (database connectivity) [No. 2. text styling. 1998. Each question should be 12. image maps. TMH 2. Apart from Question No. forms. line breaks.5 marks. 2nd Ed.Dietel. of Hrs. Rick Dranell. headers.f. “The complete Java 2 reference”.Dietel. of Hrs. Techmedia. AWT controls (Button. “Dynamic Web Publishing”.e. TMH. This question should have objective or short answer type questions. UNIT-I Java Programming: Data types. 3. REFERENCE BOOKS: 1. and vector. 2.: 10] TEXT BOOKS: 1. Every unit should have two questions. JDBC.Neito. 1999. packages. formatting text with <FONT>. multithreaded programming. string handling (only main functions). Patrick Naughton and Herbertz Schildt. 1. <META> tags. special characters. event handling. 32 w. Addison Wiley. “Java-2 The Complete Reference”. “HTML 4 unleashed”.

Logical File System. Contiguous allocation. Deadlock Prevention. Disk Scheduling. Dedicated Devices. Deadlock Characterization. Directory Structure. Synchronization Hardware. 2. Symbolic File System. This question should have objective or short answer type questions. Paging.. Page Replacement. Personal-computer systems. Every unit should have two questions. 2001 REFERENCES: 1. Recovery from Deadlock Device Management: Techniques for Device Management. Physical File System File-System Interface: File Concept. 5th Ed. of Hrs. A Simple File System. Silbersachatz and Galvin. Input or Output Devices. Deadlock Avoidance. Tannenbaum.: BCA 208 Paper: Operating System INSTRUCTIONS TO PAPER SETTERS: 1. Access Control Verification. Time-Sharing Systems. Virtual Devices. Protection.f. Disk Reliability [No. It should be of 25 marks. “Operating Systems”. Apart from Question No. Real-Time Systems Memory Management: Background. “Operating Systems”. Logical versus Physical Address space. Allocation of Frames. Methods for Handling Deadlocks. PHI. Donovan J. UNIT – I Introduction. 4th Edition.5 marks. rest of the paper shall consist of four units as per the syllabus. 1. Tata McGraw Hill. Process Scheduling. of Hrs. Disk Management. 2000 33 w. session 2005-2006 . of Hrs. Scheduling Criteria. Parallel systems. Deadlock Detection. Madnick E. Performance of Demand Paging. Distributed Systems. student may be asked to attempt only 1 question from each unit. Multiprogrammed Batches systems. Semaphores. Shared Devices. Access Methods.: 10] UNIT – III Deadlocks: System Model.Code No. Pearson. 1 should be compulsory and cover the entire syllabus. Process Synchronization: Background. SecondaryStorage Structure: Disk Structure.. swapping. Free-Space Management [No.: 10] UNIT – IV Information Management: Introduction. However. What is an Operating System. Simple Batch Systems. The Critical-Section Problem.e. Page-replacement Algorithms. Swap-Space Management. “Operating System Concepts”. Scheduling Algorithms. Operation on Processes CPU Scheduling: Basic Concepts. Allocation Methods. Other Considerations [No. Storage Devices. Classical Problems of Synchronization [No. Segmentation Virtual Memory: Demand Paging.. MultipleProcessor Scheduling. 2001 2. Buffering. Basic File System. Each question should be 12.: 12] TEXT: 1.: 12] UNIT – II Processes: Process Concept. L 3 T 1 C 4 Question No. of Hrs. Consistency Semantics File -System Implementation: FileSystem Structure. General Model of a File System. Thrashing.

Import Policy 2004-2009. 1. Ferfuson P. [No. Output Determination Under Perfect Competition. [No. Outsourcing. R and Ferguson G. 1992. rest of the paper shall consist of four units as per the syllabus. New Delhi. However.. session 2005-2006 . Monetary Policy. Issues of Dumping. 3. This question should have objective or short answer type questions. Joseph.: 10] TEXT BOOKS: 1. of Hrs. Government in the Macro Economy: Fiscal Policy. Demand & Supply Equilibrium: The concept of Elasticity and its Applications. Measuring National Income and Output.e. Karl E. MNCs. Fair.J. Mac. of Hrs. Foreign Capital in India. “Business Economics”. 1 should be compulsory and cover the entire syllabus.: BCA 210 Paper: Business Economics INSTRUCTIONS TO PAPER SETTERS: 1. Ahuja H. of Hrs. Economies and Diseconomies of Scale.f. Unemployment. The Economic Problem: Scarcity & Choice. Costs and Profit Maximisation Laws of Returns & Returns to Scale. It should be of 25 marks.. [No.: 10] UNIT IV The World Economy – WTO. Apart from Question No. Prentice Hall. “Business Economics”. Every unit should have two questions. [No.Millan. Groups of Twenty (G-20). S. Monopolistic Competition & Oligopoly.5 marks.: 12] UNIT II Market Structure: Equilibrium of a Firm and Price. Trips. Rothschild. 34 w.L. student may be asked to attempt only 1 question from each unit.R. Hampshire.. The Price Mechanism. 1993. 2. Case & Ray C. Pearson Education. Export. Nellis.Code No. Trade-Cycles: Circular Flow upto Four Sector Economy.: 12] UNIT III Macro Economic Concerns: Inflation. UNIT I The Scope and Method of Economics. 2001 2. “The Essence of Business Economics”. Globalisation. New Delhi. The Production Process: Output decisions – Revenues. Monopoly. 2000 4. Parker David. “Principles of Economics”. Chand & Co. of Hrs. Asia. L 3 T 1 C 4 Question No. Each question should be 12.

: BCA 252 Paper: Practical – IV Practical will be based on following Paper: 1.e. Java Programming & Website Design L 0 P 8 C 4 35 w.f.Code No. session 2005-2006 .

e.Code No.f. The performance of the candidates should continuously be evaluated by an internal committee. 36 w. : BCA 254* Paper: General Proficiency – IV L 2 P 0 C 2 *Non University Examination Scheme (NUES) There will not be any external examination of the university. The committee may conduct viva-voce at the end for the award of the marks. session 2005-2006 .

[No. 2001 2. comparison of models. of Hrs.f. distributed processing. E. Transmission Media: Guided and unguided. packet switching and message switching. A. synchronous and asynchronous protocols. The Network Layer. “Data and computer communications”. Pearson education Asia. NCP. and categories of networks. Link access procedures. Behrouz A. standards and organizations. S.. Tata Mc Graw Hill. Attenuation. Pearson Education Asia. noise. Digital Transmission: Interfaces and Modems: DTE-DCE Interface. Apart from Question No. wavelength. 3rd edition. distortion. Quality of Service. Functions of session layers. L 3 T 1 C 4 Question No. flow control. [No. REFERENCES: 1. transmission mode. connection management. ISDN: Services. of Hrs. modems. 1 should be compulsory and cover the entire syllabus. LCP. This question should have objective or short answer type questions. UNIT – 1 Basic Concepts: Components of data communication. TDM. Comer. bridges. student may be asked to attempt only 1 question from each unit. 2. 37 w. 4th Ed. [No. PPP layers. of Hrs. It should be of 25 marks. Point to point protocols: Transmission states. throughput. topology. subscriber’s access. routers. Each question should be 12. gateways. Line configuration. Pearson Education Asia. Presentation layer.: 12] UNIT – II Telephony: Multiplexing.: BCA 301 Paper: Computer Networks INSTRUCTIONS TO PAPER SETTERS: 1. Layers. Design Issues. “Internetworking with TCP/IP”. historical outline. FDM. Internetworking. Authentication.Code No. “Data Communication and Networking”. error control. However. of Hrs. William Stallings. NetworkLayer in the Internet. OSI and TCP/IP Models: Layers and their functions. Data Link control protocols: Line discipline. [No. Every unit should have two questions. Routing Algorithms. Shannon Capacity. rest of the paper shall consist of four units as per the syllabus. Forouzan. D. propagation speed and time.. 7th Ed. circuit switching. cable modems.: 10] TEXT BOOKS: 1.e. and broadband ISDN. 2002. character and bit oriented protocols.5 marks. comparison of media. 1. ISDN. Congestion Control Algorithms. WDM. and Application layer. error detection and correction: Many to one. session 2005-2006 . Tanenbaum. 2004.: 12] UNIT – III Devices: Repeaters. 2003. 2. one to many. “Computer Networks”.: 10] UNIT – IV Transport and upper layers in OSI Model: Transport layer functions.

Apart from Question No. session 2005-2006 .5 marks. of Hrs. Wiley Dream Tech. student may be asked to attempt only 1 question from each unit. 2002 2.NET Enterprise”. “Beginning ASP. Wrox/SPD. code access security. windows focus.Net architecture.: BCA 303 Paper: . rest of the paper shall consist of four units as per the syllabus.net 1.NET with Visual #. of Hrs. database interface.1 with VB. 2. Reynolds et. menus. al. XML. This question should have objective or short answer type questions. 3rd Edition.NET Similarities & differences with Visual Basic. M. Namespheres. 2003 3. It should be of 25 marks. UNIT – I . Richard Blaur & Mathew Reynolds. “.Code No.e. Structured exception handling. [No.net 2003”. 2003 2. “Beginning ASP. ADO.net 2003”. Wiley Dream Teach. [No. Wiley Dream Tech.NET 2003”. [No... Each question should be 12. “Beginning VB.NET Similarities & difference with ASP. Every unit should have two questions. A.NET. validation. L 3 T 1 C 4 Question No. al. transaction in .. Creating components. memory management. Chakraborti et. web-form. 1 should be compulsory and cover the entire syllabus.NET Similarities & differences with C/C++.net programming INSTRUCTIONS TO PAPER SETTERS: 1. [No. 2002 REFERENCES: 1. Chris Ullman. 2003 38 w. 1. window four. “Microsoft . interoperation with IOM. working with databases.: 11] UNIT – III ASP. object oriented features. John Kauffman. PHI. object oriented features. of Hrs. development. However.NET framework”. Chris Willman. of Hrs.: 11] TEXT: 1. Architecture.: 11] UNIT – II VB.: 11] UNIT – IV C++ .f. John Kauffman. Assemblies.NET. databases interface.

B.: 11] UNIT-II Inter Process Communication:.5 marks.Data structures in LINUX kernel. Addison Wesley. block devices.Representation of file system in the kernel. 2000 2. 1997 39 w. [No. 3rd Edition.: BCA 305 Paper: Linux Environment INSTRUCTIONS TO PAPER SETTERS: 1. of Hrs. Every unit should have two questions. symmetric multiprocessing. However.: 11] UNIT-III LINUX File System: . “Beginning Linux Programming”. Changes with respect to kernel initialization. Modules: . of Hrs. Silberschatz. 2. virtual address space for a process. caching. [No. system V IPC. John Wiley & Sons (Asia) Pte. P. M. W. and sockets. 2000 2. Richard Stones.Multiprocessing. Pike. pipes. Neil Mathew.e. It should be of 25 marks. LINUX Internals: Introduction: . debugging. of Hrs. process management. session 2005-2006 . “The UNIX Programming Environment”. 2005 REFERENCES: 1. Prentice Hall of India. spooling. Kernighan & R. Apart from Question No. B. systems calls Memory Management:.: 11] TEXT BOOKS: 1. paging under LINUX. “Operating System Concepts”. “Red Hat Linux Administrator’s Guide”. student may be asked to attempt only 1 question from each unit..f. 2001 3. 1. UNIT-I UNIX & LINUX:. This question should have objective or short answer type questions. Galvin. [No. Wiley Dream Tech. message exchange between processes.: 11] UNIT-IV Multiprocessing: . shell scripts. Proc and Ext2 file system. communication via files. ptrace. Cox K.Overview of UNIX and LINUX Architectures editors and commands.Modules in LINUX.Architecture independent memory model. L 3 T 1 C 4 Question No. Beck.Code No. system administration. of Hrs.Synchronization in kernel. Each question should be 12. Ltd. A. 1 should be compulsory and cover the entire syllabus. “LINUX Kernel Internals”. PHI. res t of the paper shall consist of four units as per the syllabus. interrupt handling [No.

Selling on the Web. Consumer & Seller Protection in EC. Impacts on Industry Structure.: 12] UNIT – II Business-to-Business Electronic Commerce: Characteristics of B2B EC. First Mover Advantage. EDI & Business. Electronic Check Systems. Managerial Issues. Public Policy: From Legal Issues to Privacy: EC-Related Legal Incidents. Competitive Strategy. Porter’s Model. Ethical & Other Public Policy Issues. Gambling & More. E-Commerce Evaluation. Intermediary-Oriented Marketplace. Analyzing Web Visits. rest of the paper shall consist of four units as per the syllabus. [No. Applications of Intranets.f. Electronic Commerce and the Trade Cycle. Strategic Implications of IT. Internet Security. L 3 T 1 C 4 Question No. Solutions of B2B EC. Prospect of Electronic Payment Systems. Business Models of Extranet Applications. Security Schemes in Electronic Payment Systems. The Role of Software Agents for B2B EC. It should be of 25 marks. and Extranet. chatting on the Web. Considerations in Intranet Deployment.: 12] UNIT – III Electronic Payment Systems: Is SET a Failure. This question should have objective or short answer type questions. Business Strategy in an Electronic Age: Supply Chains. Architecture of the Internet. Other Legal Issues: Contracts. 2. Legal. Business Strategy. Managerial Issues. Introduction to Business Strategy. Porter’s Value Chain Model.5 marks. Each question should be 12. EDI: The Nuts and Bolts. Internet Indecency & Censorship. Electronic Marketing in B2B.: 10] UNIT – IV Infrastructure for EC: It takes more than Technology. Procurement Management Using the Buyer’s Internal Marketplace. Technology. Intermediaries. Applications of Extranets. 1 should be compulsory and cover the entire syllabus. of Hrs. The Largest Extranet. Multimedia delivery. Web-Based client/ Server. [No. A Network of Networks. Competitive Advantage using E-Commerce. Electronic Data Interchange (EDI). Definition of Electronic Commerce. Electronic Credit Card System on the Internet. Managerial Issues. of Hrs. Every unit should have two questions. Internet Protocols. Business Capability. Models of B2B EC. Extranet Products & Services. [No. Strategy Formulation & Implementation Planning. However. Internet Commerce. Integration with Back-end Information Systems. The Structure of Extranets. Global & Other Issues in EC: Competition in Marketspace. Other B2B Models. Protecting Privacy. Existing Business Strategy. Inter Organizational Value Chains. session 2005-2006 .Code No. The Extranets. Auctions and Services from Traditional to Internet-Based EDI. Intranet Application Case Studies. Electronic Markets. E-Commerce Implementation. Supplier-Oriented Marketplace. Stored-Valued Cards and E-Cash. Electronic Fund Transfer and Debit Cards on the Internet.: BCA 307 Paper: E-commerce INSTRUCTIONS TO PAPER SETTERS: 1. Protecting Intellectual Property. of Hrs. Apart from Question No. Managerial issues. Intranet Software. Business Environment. Economics. Taxation & Encryption Policies. Electronic Payments & Protocols. UNIT-I Introduction to E-Commerce: The Scope of Electronic Commerce. Just-in-Time Delivery. student may be asked to attempt only 1 question from each unit. Intranet and Extranet: Automotive Network Exchange. Intranet. 1. Sustainable Competitive Advantage.e. and 40 w. Free Speech. Electronic Data Interchange. E-Commerce in Perspective. Some Issues in Digital Economy and Success Factors.

Michale Chung. Eframi Turban. Pearson Education. The Future of EC [No. session 2005-2006 .: 10] TEXT BOOKS: 1.e. Jae Lee.f. “E-Commerce”. “Electronic Commerce”. Research in EC. 2000 2. Electronic Commerce in Small companies. of Hrs. David King. K. David Whiteley. Global Electronic Commerce. virtual Communities. Tata McGraw Hill.Others. 2000 41 w.

Code No. binomial heap. However. UNIT – I Mathematical Preliminaries: Review of growth functions. rest of the paper shall consist of four units as per the syllabus. 2nd Ed. Knuth. accounting. E. D. 2. Aho. and potential methods. Naïve String Matching. C. Huffman coding. Galgotia Publications. It should be of 25 marks.: 11] TEXT: 1. E. “Introduction to Algorithms”. Amortized Analysis Aggregate. session 2005-2006 .: BCA 309 Paper: Design and Analysis of Algorithms INSTRUCTIONS TO PAPER SETTERS: 1. median and order statistics. dynamic set operation. “Computer Algorithms”.. T. Rabin karp and KMP algorithms. This question should have objective or short answer type questions. of Hrs. 1998. Clifford Stein. J. “The Design and Analysis of Computer Algorithms”. 2. Addison Wesley. 3.5 marks. Hopcroft.: 11] UNIT – II Advanced Data Structures Review of binary search trees. radix sort. Ellis Horowitz and Sartaz Sahani. Addition Wesley. Dynamic Programming Matrix multiplications. Every unit should have two questions. 1 should be compulsory and cover the entire syllabus. of Hrs. “The Art of Computer Programming”. and task scheduling problem. A. L. 1. Solution of difference equations. 2004. 1999. Rivest. 2nd Ed. Sorting and Order Statistics Merge sort. L 3 T 1 C 4 Question No. H. Leiserson. bucket sort. Ullman.: 11] UNIT – III Greedy Algorithms: Activity selection. [No. [No. student may be asked to attempt only 1 question from each unit. 1998 42 w. [No. Cormen. Each question should be 12.: 11] UNIT – IV String Matching. V. Heap sort.e.. Quick sort. REFERENCES: 1. E. of Hrs. [No. Apart from Question No.f. PHI. red black trees. R. of Hrs. longest common subsequence and optimal polygon triangulation problems. D. J.

e. of Hrs. and Secure Electronic Transactions. of Hrs. Viruses and Related Threats. L 3 T 1 C 4 Question No. Key. Transport Layer Security. SNMPV3. Services and Mechanism.I Introduction: Attacks. Model for Internetwork Security. [No. Cryptography: Notion of Plain Text.5 marks. [No. X. It should be of 25 marks. UNIT . Public Key Encryption. Encryption. of Hrs. Networks Security Essentials: Application & Standards. Cipher Text. Principles and Practice. Stallings. S/ Mime. Directory Authentication Service.: 10] TEXT BOOKS: 1. Authentication header. Cryptography and Network Security. However. Encapsulating Security Pay Load.: BCA 311 Paper: Computer Network Security INSTRUCTIONS TO PAPER SETTERS: 1.Code No. of Hrs. Stallings. Apart from Question No. Every u nit should have two questions. This question should have objective or short answer type questions. W. Each question should be 12. combining Security Associations. [No.509. 43 w. Web Security: Requirements. Pearson Education. [No.f. Decryption and cryptanalysis. digital Signatures and Authentication. Key Management.: 10] UNIT – IV Network Management Security: Communication Facility. student may be asked to attempt only 1 question from each unit. 2000. session 2005-2006 .: 12] UNIT – II Net Work Security : Authentication Application: Kerveros. Overview of SNMP Architecture-SMMPVI1 System Security: Intruders. W. 1. 1 should be compulsory and cover the entire syllabus. 2000 2. 2. Firewall Design Principles. Pearson Education. Secure Socket Layer. Pretty Good Privacy. rest of the paper shall consist of four units as per the syllabus.: 12] UNIT – III IP security Architecture: Overview.

Linux Environment L 0 P 8 C 4 44 w. session 2005-2006 .net Programming 2. .f.e.Code No. : BCA 351 Paper: Practical – V Practicals will be based on following Papers: 1.

45 w.Code No. session 2005-2006 .e.f. : BCA 353 Paper: Summer Project / Training C 2 The viva will be conducted based on summer training of four weeks after the end of fourth semester.

Code No. session 2005-2006 . 46 w. : BCA 355 Paper: Minor Project L 0 P 8 C 4 Evaluation will be based on Summer Training held after fourth semester and will be conducted by the college committee only.e.f.

session 2005-2006 .e.f. 47 w.Code No. : BCA 357* Paper: Seminar L 2 P 0 C 2 *Non University Examination Scheme (NUES) An internal committee of the college will evaluate student & award the marks.

prepare the conceptual design report. soft spots in planning. Decision support systems. design problems. TMH. train and operating personnel. Strategic and project planning for MIS: General business planning. MIS as a technique for making programmed decisions. R.: BCA 302 Paper: Management Information Systems INSTRUCTIONS TO PAPER SETTERS: 1. determine information sources. 48 w.e.: 12] Text book: 1. student may be asked to attempt only 1 question from each unit. PHI – 1994. Clagget. acquire floor space and plan space layouts. [No. management and organizational behavior. cut over. Murdick. “Management Information System: Strategy & Action”. 2. Apart from Question No. of Hrs. Basic Information Systems. the systems view of business. control and maintain the system.f. of Hrs. Ross and J. information. Parker. L 3 T 1 C 4 Question No. appropriate MIS response. 2.: 11] UNIT – II Information Systems for decision making: Evolution of an information system. Management Organizational theory and the systems approach: Development of organization theory. 1993. session 2005-2006 .Code No. develop alternative conceptual designs and select one. Each question should be 12. decision assisting information systems.5 marks. Charles Case. establish system constraints. develop the files. decision making and MIS.: 11] UNIT – III Conceptual system design: Define the problems. Thomas. MIS planning – details. [No. of Hrs. E. This question should have objective or short answer type questions. 1 should be compulsory and cover the entire syllabus. and the systems approach. systems approach. MIS Organization within the company. evaluate the MIS. implementation: The TAR PIT. rest of the paper shall consist of four units as per the syllabus. dissemination. However. develop forms for data collection and information. develop procedures for implementation. It should be of 25 marks. management. computer related acquisitions. evaluation and maintenance of the MIS: Plan the implementation. of Hrs. 1. G. document the system. test the system. set system objectives. organize for implementation. 3rd Edition by. [No. Every unit should have two questions. document the system concept. MIS planning – general.: 10] UNIT – IV Implementation. Pitfalls in MIS development: Fundamental weaknesses. “Information Systems for Modern Management”. [No. UNIT – I The meaning and role of MIS: What is MIS?. 2nd Edition. R. J. determine information needs.

of Hrs. session 2005-2006 . Sandeep Singhal. UNIT 1: Introducing the Mobile Internet: The Mobile Internet is here.:10] UNIT 2: WAP: the Mobile Internet Standard: Making the Internet Mobile: Challenges and Pitfalls. User Interface Design: Marking Wireless Applications Easy to Use. Apart from Question No. Question No.Code No.e.f. Where Next: The Mobile Internet Future [No. Overview of the Wireless Application Protocol [No. Each question should be 12. “The Wireless Application Protocol. student may be asked to attempt only 1 question from each unit. The Rise of Mobile data. Key Services for the mobile Internet. of Hrs. [No.5 marks. Push Messaging. Writing Applications for Mobile Internet”. Enhanced WML: WML Script and WTAI. Wireless Telephony Applications. Every unit should have two questions.:12] UNIT 4: Advanced WAP: Tailoring Content to the Client. This question should have objective or short answer type questions. Business opportunities.:11] TEXT BOOK: 1. rest of the paper shall consist of four units as per the syllabus. 1 should be compulsory and cover the entire syllabus. of Hrs. [No. Building and Deploying End-to-End WAP Services. 1.: BCA 304 Paper: Mobile Computing L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: 1. 2000 49 w. Pearson Education.:11] UNIT 3: Implementing WAP Services: The Wireless Markup Language. It should be of 25 marks. of Hrs. How ever. 2.

Defintion. Prentice Hall of India. Scan Converting Ellipses. Feiner. Working exposure on graphics tools like Dream Weaver. Raster-Scan Display Systems. TMH. Parametric Cubic Curves. “Mathematical Elements for Computer Graphics”. of Hrs. Tay Vaughan. Scan Converting Lines. rest of the paper shall consist of four units as per the syllabus. 5. 2. [No. Communications and Applications”. L 3 T 1 C 4 Question No.J. Computer Graphics Principles & Practice. 2000. Harn & Baker: Computer Graphics. Introduction to making multimedia – The stages of Project.: BCA 306 Paper: Computer Graphics & Multimedia Applications INSTRUCTIONS TO PAPER SETTERS: 1. 2001 REFERENCES BOOKS: 1. Multimedia skills and training. Overvie w. Sweep Representations. Random-Scan Display Processor. of Hrs. Graphics Hardware Hardcopy Technologies. 1989.D. Tsichritzis: Multimedia Programming Object. Boundary Representations. the hardware & software requirements to make good multimedia. Solid Modeling Representing Solids. student may be asked to attempt only 1 question from each unit. 4. [No. Display Technologies. Ralf Skinmetz and Klana Naharstedt. 2. Matrix Representation of 3D Transformations. Regularized Boolean Set Operations. Image Scanners. 50 w. Quadric Surfaces. 2000 3. Primitive Instancing. Training Opportunities in Multimedia. CD-ROM and the multimedia highway. 3D Effects etc. Classification of Applications. Every unit should have two questions. The Window-to-Viewport Transformation.f. It should be of 25 marks. Hughes. 2. of Hrs. Input Devices for Operator Interaction. Apart from Question No. Uses of Multimedia.: 10] UNIT – III Representing Curves & Surfaces Polygon Meshes. Spatial Partitioning Representations. Constructive Solid Geometry. Efficiency.: 10] UNIT – IV Introductory Concepts: Multimedia.: 12] UNIT – II Geometrical Transformations 2D Transformations. Each question should be 12. McGraw Hill. Representative Uses of Computer Graphics.5 marks. Rogers & Adams. “Multimedia: Making it Work”. Clipping Southland-Cohen Algorithm. “Multimedia: Computing. 1. 2000. The Video Controller. Motivation for Multimedia usage [No. Conceptual Framework for Interactive Graphics. of Hrs. session 2005-2006 . However. Foley. User Interfaces for Solid Modeling. Midpoint Subdivision Algorithm [No. Cyrus-Beck Algorithm. J. & Van Dam.: 12] TEXT BOOKS: 1. Composition of 2D Transformations. This question should have objective or short answer type questions.Code No. D. A: Fundamentals of Interactive Computer Graphics. Development of Hardware and Software for Computer Graphics. Transformations as a Change in Coordinate System. Foley. Scan Converting Circles.e. UNIT – I Introduction: The Advantages of Interactive Graphics. Environment & Framework. Pearson.C. Comparison of Representations. 1 should be compulsory and cover the entire syllabus. Van Dam. Gibbs & D. Homogeneous Coordinates and Matrix Representation of 2D Transformations. D. 1986.

1.: BCA 308 Paper: Internet Programming INSTRUCTIONS TO PAPER SETTERS: 1. publishing information. of Hrs. Every unit should have two questions. of Hrs. [No. XML parsers. Servlets.Dietel.Neito. event model. [No.Code No.: 12] UNIT – IV XML-Structuring data. 2. and information server. It should be of 25 marks. client side and server side programming.. 2.Dietel. Each question should be 12. Object Model collection. Data types. database.Schildt.PWS set up. UNIT – I Microsoft Visual InterDev: Web servers. session 2005-2006 . rest of the paper shall consist of four units as per the syllabus. The complete Java2 reference. 1 should be compulsory and cover the entire syllabus. of Hrs. Control structures. [No.: 11] TEXT BOOKS: 1. L 3 T 1 C 4 Question No. Arrays. TMH.5 marks. and Objects. filter and transitions. Apart from Question No. data binding with tabular data control.f. publishing Internet [No. 2000. Database: registering ODBC.e.M. Functions. DTD’s using XML with HTML and CSS. of Hrs. Addison Wiley.: 10] UNIT – III Web servers.R. ADO (active X data objects) ASP-Active server pages. T. student may be asked to attempt only 1 question from each unit. Toolbox window. H. 51 w. Use of project Explorer. VB script and its utility functions.J.: 11] UNIT – II DHTML: CSS. However. Site design Java Script. Creating a project. P. “Internet and worldwide web – how to program”. H. 1998. This question should have objective or short answer type questions.

session 2005-2006 . “Data Mining Harcourt India. Han. 52 w. [No.f. of Hrs. Data Marts. Tools for data warehousing. This question should have objective or short answer type questions. Data mining and knowledge discovery. rest of the paper shall consist of four units as per the syllabus. H. Wiley. 2000 2. Data Mining of Advance Databases. Every unit should have two questions.Code No. Data mining and Techniques. of Hrs. Michelinal. [No. Kamber.: 11] TEXT BOOKS: 1.: BCA 310 Paper: Knowledge Management & New Economy INSTRUCTIONS TO PAPER SETTERS: 1.: 11] UNIT – II Executive Information and support Systems. 2. [No. Data Warehouse architecture. techniques of knowledge management appreciation & limitation. Group decision support and Groupware Technologies. Each question should be 12. Inmon. 1.: 11] UNIT – IV Knowledge Management Systems: Concept and Structure KM systems. EIS. It should be of 25 marks. Business Expert System and AI. 3. Jiawei. student may be asked to attempt only 1 question from each unit.e. of Hrs. Decision support systems. 2001 Concepts & Techniques”. W. However.: 11] UNIT – III Multi-dimensional analysis.. of Hrs.. Modelling Decision Processes. L 3 T 1 C 4 Question No.. 1998. “Building Data Warehousing”. Decision support system. UNIT – I Business Intelligence and Business Decisions. Apart from Question No. Data Warehousing. [No. OLTO & OLAP. 1 should be compulsory and cover the entire syllabus.5 marks.

II Knowledge representation: Definition and importance of knowledge. 1999 2. AI techniques. student may be asked to attempt only 1 question from each unit.W.I Overview of A. rest of the paper shall consist of four units as per the syllabus. D. Learning from example-induction."Artificial Intelligence -A new Synthesis" 2nd Edition (2000). of Hrs. UNIT . problem space and search: Defining the problem as a state space search. of Hrs.Code No. AI and its related field. constraint satisfaction [No. Each question should be 12. 53 w. Nils J Nilsson . Question No.5 marks.: 12] UNIT . 1 should be compulsory and cover the entire syllabus. 2. E. 2nd ed. "Artificial intelligence".e. of Hrs. Repsenting instances and isa relationship. session 2005-2006 .IV Expert System: Introduction. Rich and K. Issues in the design of the search problem Heuristic search techniques :Generate and test. Computable function and predicate. Importance of AI. hill climbing. 1. Learning by taking advice. Semantic processing. Knight.f. Knowledge representation.: BCA 312 Paper: Artificial Intelligence L 3 T 1 C 4 INSTRUCTIONS TO PAPER SETTERS: 1. This question should have objective or short answer type questions. PHI.: 10] Text Book: 1.I: Introduction to AI. 1999. LISP and other AI Programming Language [No. Criteria for success. Various approaches used in knowledge representation.III Natural language processing :Introduction syntactic processing.: 11] UNIT . of Hrs. "Introduction to AI and Expert Systems". [No. Discourse and pragmatic processing Learning: Introduction learning. Harcourt Asia Ltd.: 11] UNIT . However. Reference: 1. Rote learning. Every unit should have two questions. TMH. Learning in problem solving. Patterson.. Issues in knowledge representation Using Predicate Logic :Represent ting Simple Facts in logic. problem reduction. Production system and its characteristics. best first search technique. It should be of 25 marks. Explanation based learning [No.Expert system shells. Problems. Apart from Question No.Repsenting using domain specific knowledge.

f. session 2005-2006 . Electives (if required) L 0 P 8 C 4 54 w.e. Computer Graphics & Multimedia Applications 2. : BCA 352 Paper: Practical – VI Practical will be based on following Paper: 1.Code No.

session 2005-2006 .e.Code No.f. 55 w. : BCA 354* Paper: Major Project / Seminar L 0 P 10 C 5 Evaluation will be based on Summer Training held after fourth semester and will be conducted by the college committee only.

Sign up to vote on this title
UsefulNot useful