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

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.Bachelor of Computer Applications FIFTH SEMESTER EXAMINATION Code No.f.e. **NUES 6 w. session 2005-2006 . Paper BCA 301 Computer Networks BCA 303 .

However. session 2005-2006 . for the award of the degree a student shall be required to earn the minimum of 150 credits. The total number of the credits of the BCA programme = 160. 2.f.e. 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. Each student shall be required to appear for examinations in all courses.Bachelor of Computer Applications SIXTH SEMESTER EXAMINATION Code No. 7 w.

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

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

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

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

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

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

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

The committee may conduct viva-voce at the end for the award of the marks. : 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.f. The performance of the candidates should continuously be evaluated by an internal committee. 15 w. session 2005-2006 .e.Code No.

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

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

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

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

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

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

e. The committee may conduct viva-voce at the end for the award of the marks. session 2005-2006 . 22 w. The performance of the candidates should continuously be evaluated by an internal committee. : 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.f.Code No.

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

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

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

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

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

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

f. The performance of the candidates should continuously be evaluated by an internal committee. 29 w.Code No. session 2005-2006 .e. The committee may conduct viva-voce at the end for the award of the marks. : 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.

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

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

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

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

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

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

: 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 performance of the candidates should continuously be evaluated by an internal committee. session 2005-2006 .e.f. 36 w.Code No. The committee may conduct viva-voce at the end for the award of the marks.

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

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

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

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

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

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

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

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

e. session 2005-2006 .Code No.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. 45 w.

e.Code No. 46 w. session 2005-2006 .f. : 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. : 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. session 2005-2006 .Code No. 47 w.f.

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

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

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

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

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

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

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

55 w.f.e.Code No. session 2005-2006 . : 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