Christ University, Bangalore, India


BCA COURSE STRUCTURE.........................................................................................................................3 BCA SYLLABUS DESCRIPTION..................................................................................................................6 FIRST SEMESTER..........................................................................................................................................6 BCA 131: GENERAL ENGLISH...................................................................................................................14 BCA 132: MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE........................................16 BCA 133: STATISTICS FOR BCA 1............................................................................................................17 BCA 134: BASIC ELECTRONICS................................................................................................................18 BCA 135: DIGITAL COMPUTER FUNDAMENTALS...............................................................................20 BCA 136: INTRODUCTION TO PROGRAMMING USING C...................................................................21 BCA 151: C PROGRAMMING LAB............................................................................................................23 BCA 152: PC SOFTWARE LAB...................................................................................................................25 BCA 231: FUNCTIONAL ENGLISH............................................................................................................29 BCA 232: ALGEBRA AND DIFFERENTIAL EQUATIONS......................................................................30 BCA 233: STATISTICS FOR BCA – II.........................................................................................................31 BCA 234: SYSTEM ANALYSIS AND DESIGN..........................................................................................32 BCA 235: OPERATING SYSTEMS..............................................................................................................34 BCA 236: DATA STRUCTURES..................................................................................................................35 BCA 251: VISUAL PROGRAMMING LAB...............................................................................................36 BCA 252: DATA STRUCTURES LAB.........................................................................................................37 BCA 331: GERMAN LANGUAGE...............................................................................................................39 BCA 332: GRAPH THEORY.........................................................................................................................40 BCA 333: CORPORATE ACCOUNTANCY...............................................................................................41 BCA 334: SOFTWARE ENGINEERING......................................................................................................42 BCA 335: DATABASE MANAGEMENT SYSTEMS................................................................................43 BCA 336: OBJECT ORIENTED PROGRAMMING USING C++...............................................................45 BCA 351: C++ LAB.......................................................................................................................................47 BCA 352: ORACLE LAB..............................................................................................................................48 BCA 431: TECHNICAL ENGLISH...............................................................................................................52 BCA 432: NUMERICAL TECHNIQUES......................................................................................................53 BCA 433: FINANCIAL MANAGEMENT....................................................................................................54 BCA 434: COMPUTER NETWORKS – I.....................................................................................................55 BCA 435: ANALYSIS AND DESIGN OF ALGORITHMS.........................................................................56 BCA 436: PROGRAMMING IN JAVA.........................................................................................................57 BCA 451: JAVA PROGRAMMING LAB.....................................................................................................59 BCA 452: DBMS PROJECT LAB.................................................................................................................60 BCA 531: PROFESSIONAL ENGLISH........................................................................................................61 BCA 532: UNIX OPERATING SYSTEM.....................................................................................................62 BCA 533: COMPUTER GRAPHICS.............................................................................................................64 BCA 551: UNIX LAB....................................................................................................................................65 BCA 552: COMPUTER GRAPHICS LAB....................................................................................................66 BCA 553: SPECIALIZATION PROJECT.....................................................................................................67 BCA 541A: TCP/IP.........................................................................................................................................68 BCA 542A: INTERNET PROGRAMMING..................................................................................................69 BCA 541B: COMPUTER NETWORKS - II..................................................................................................71 BCA 542B: SYSTEM SOFTWARE..............................................................................................................72 BCA 631: SYSTEM SIMULATION..............................................................................................................73 BCA 641A: DISTRIBUTED SYSTEMS.......................................................................................................74 BCA 642A: MULTIMEDIA COMPUTING..................................................................................................76 BCA 641B: MICROPROCESSORS...............................................................................................................77 BCA 642B: COMPUTER ARCHITECTURE................................................................................................78 BCA 651: MAIN PROJECT...........................................................................................................................79 DEPT OF BCA...............................................................................................................................................80 CERTIFICATE COURSE ON J2EE..............................................................................................................81 CERTIFICATE COURSE ON TESTING TOOLS........................................................................................83 CERTIFICATE COURSE ON .NET TECHNOLOGIES............................................................86

BCA syllabus

Christ University, Bangalore, India


Semester 1 Paper Code BCA 131 BCA 132 BCA 133 BCA 134 BCA 135 BCA 136 BCA 151 BCA 152 BCA 111 Semester 2 Paper Code BCA 231 BCA 232 BCA 233 BCA 234 BCA 235 BCA 236 BCA 251 BCA 252 BCA 271 BCA 211 Semester 3 Paper Code BCA 331 BCA 332 BCA 333 BCA 334 BCA 335 BCA 336 BCA 351 BCA 352 BCA 311 Paper General English Mathematical Foundations for Computer Science Statistics for BCA I Basic Electronics Digital Computer Fundamentals Introduction to Programming Using C C Programming Lab PC Software Lab Holistic Education Total Paper Functional English Algebra and Differential Equations Statistics for BCA II System Analysis and Design Operating Systems Data Structures Visual Programming Lab Data Structures Lab Seminar * Holistic Education Total Paper German Language Graph Theory Corporate Accountancy Software Engineering Database Management Systems Object Orient Programming Using C++ C++ Lab Oracle Lab Holistic Education Total Hours per Week 03 03 03 03 03 03 04 04 * 26 Hours per Week 03 03 03 03 03 03 04 04 02 * 28 Hours per Week 03 03 03 03 03 03 04 04 * 26 Marks 100 100 100 100 100 100 100 100 800 Marks 100 100 100 100 100 100 100 100 50 850 Marks 100 100 100 100 100 100 100 100 800 Credits 02 02 02 02 02 02 02 02 01 17 Credits 02 02 02 02 02 02 02 02 01 01 18 Credits 02 02 02 02 02 02 02 02 01 17

BCA syllabus

Christ University. Bangalore. India 4 Hours per Week 03 03 03 03 03 03 04 04 02 * 28 Marks 100 100 100 100 100 100 100 100 50 850 Credits 02 02 02 02 02 02 02 02 01 01 18 Semester 4 Paper Code BCA 431 BCA 432 BCA 433 BCA 434 BCA 435 BCA 436 BCA 451 BCA 452 BCA 471 BCA 411 Paper Technical English Numerical Techniques Financial Management Computer Networks I Analysis and Design of Algorithms Programming in Java Java Programming Lab DBMS Project Lab Seminar * Holistic Education Total Semester 5 Paper Code BCA 531 BCA 532 BCA 533 BCA 551 BCA 552 BCA 553 Paper Professional English Unix Operating System Computer Graphics Unix Lab Computer Graphics Lab Specialization Project Electives(Choose any one Stream) Stream A (Two Papers) TCP/IP Internet Programming Stream B (Two Papers) Computer Networks –II System Software Total Hours per Week 03 03 03 04 04 04 03+03 Marks 100 100 100 100 100 100 100+100 Credits 02 02 02 02 02 02 02+02 BCA 541A BCA 542A BCA 541B BCA 542B 27 800 16 BCA syllabus .

India 5 Hours per Week 03 16 03+03 Marks 100 200 100+100 Credits 02 08 02+02 Semester 6 Paper Code BCA 631 BCA 651 Paper System Simulation Main Project Electives(Choose the same stream as Semester 5) Stream A (Two Papers) Distributed Systems Multimedia Computing Stream B (Two Papers) Microprocessors Computer Architecture Total BCA 641A BCA 642A BCA 641B BCA 642B 25 500 14 Grand Total – Credits Marks  ∗ ∗ 100 credits 4600 Seminar (BCA 271 & BCA 471) – No End Semester Examination Holistic Education – 12 hours of teaching in each semester BCA syllabus . Bangalore.Christ University.

This subject gives an introduction to programming and basic elements of programming like algorithm. It’s a language with lot of capabilities. Advanced features like functions. Differential Calculus and Integral Calculus to help students in effective problem solving. to channel the triggered thoughts into creative expressions. structures and unions are also dealt here. The concept of files and preprocessors are also introduced. The applications of diode as a rectifier and Zener diode as voltage regulator also form a part. registers and flags are also dealt with. Bangalore. flow chart and Pseudo code. The design of half adders and full adders are also included as part of this subject. BCA 136: Introduction to Programming using C C is a widely used language in systems programming. BCA 133: Statistics for BCA I This paper introduces the basic concepts of statistics and explains the various methods of descriptive data collection and analysis BCA 134: Basic Electronics The subject deals with the basic concepts of some of the electronic devices used with relation to the wide fields of computer science. The subject starts with the features of C language and basic elements of the language. arrays. Pointer being an important concept is dealt with respect to arrays. The discussion about working of devices like encoders and decoders. BCA syllabus . In general. The subject starts with an introduction to number systems and its applications in computers. while and do while are dealt with its syntax and applications. BCA 135: Digital Computer Fundamentals This subject deals with the basic concepts of functioning of a computer.. Introduction to voltage controlled device like JFETis included. semiconductors and insulators. logic gates and design of different types of flip flops and counters. energy levels and the classification of solids into conductors. The subject exposes the students to basic concepts of flip-flops. In general the subject equips the students with start-up knowledge of electronics forming up a good base.Christ University. India 6 BCA SYLLABUS DESCRIPTION FIRST SEMESTER BCA 131: General English The objectives of this course are to train the student to trigger his/her thought process. Programming constructs like if. for. structures and functions. the subject concentrates in all the areas of C programming which is very much helpful for a beginner in Computer Programming. BCA 132: Mathematical Foundations for Computer Science The subject aims at providing the basic mathematics including Set Theory. Classification of memory. to develop analytical and lateral thinking and to fine tune the presentation skills. multiplexers and de multiplexers are dealt here. pointers. The subject introduces conceptual ideas of atomic structure of an atom. Finally the subject concludes with ideas on different logic families. The basic working of a transistor is studied in detail.

BCA syllabus . queues and trees gives an exposure about how operating systems and compilers are handling their data and symbol table. BCA 232: Algebra and Differential Equations Logic is the study and analysis of the nature of the valid argument. The subject deals with all these algorithms. mathematical logic. Memory management policies are dealt to give information about how the main memory can be handled by an operating system. testing and maintenance are also covered here. India 7 SEMESTER – II BCA 231: Functional English The objective of this course is to fine-tune the students’ communication (oral and written) and presentation skills. There are different types of algorithms. implementation. BCA 235: Operating Systems Operating system is the manager of computer resources. The subject concentrates on different data structures and their applications. The concepts of arrays linked lists. BCA 236: Data Structures The subject deals with the representation of data inside a computer. stacks. The students are asked to analyze the case studies to under stand the concepts better. which can be solved using recursion with the help of a stack. The students are also exposed to software development life cycle. study of this subject gives a sound knowledge about the software development process. Further. Having learnt a programming language. which can be used for the same. BCA 234: System Analysis and Design The students of Computer Science always dream to become software professionals. linear algebra and differential equations are discussed. To conclude. The subject deals with some interesting problems like towers of Hanoi. Feasibility study and human ware involved in the process. it is necessary for an operating system to synchronize the jobs waiting for the devices.Christ University. which basically deals with requirement collection and analysis. In this subject. Different CPU scheduling techniques gives a clear picture about how an operating system handles different types of tasks. the students are given an opportunity to know what happens in software development. BCA 233: Statistics for BCA II The use of probability theory. it is the reasoning tool by which valid inferences are drawn from a given set of facts or premises. Overall. the subject gives an overall view of the concepts of systems programming. Since the secondary storage devices cannot handle more than one request at a time. The students get to know about what is a system and what are its different types. Bangalore. System design. The subject introduces the basic components of an operating system and various types of operating systems. Case studies about DOS and Windows NT are also dealt as part of this subject. random variables. The subject also deals with different sorting techniques and their time and space complexities. to be able to respond to the business needs of the changing industry. which is of great help for an operating system designer. expectations and estimation is dealt along with some important probability distribution.

India 8 SEMESTER – III BCA 331: German Language The objective of this course is to provide an introductory knowledge on German Language as it is one of the most common European languages applied in IT industry BCA 332: Graph Theory Concepts of Graph Theory are very useful in design of Computer Networks. The various topologies can be analyzed with a sound knowledge in Graph Theory. BCA 333: Corporate Accountancy The objective of this course is to introduce concepts of accounting to students to apply them effectively in projects of business domain. BCA 335: Database Management Systems All the computer-based applications require data to operate. BCA syllabus . This is the systematic approach to software development. Maintenance of software product is included as a last chapter of the subject. The concepts of operator overloading and function overloading are discussed to expose the students to the advantages of object oriented programming. The concept of classes and objects make it easy to represent real world entities. The subject starts with what is software engineering. The aim of this course is to teach the students various modules of graph theory to emerge as efficient network designers and administrators. A brief introduction about network and hierarchical data model gives exposure about how a DBMS can be designed. The concept files and exceptions are introduced as the last few topics which make a developer to get the knowledge about the storage of files and error handling. The subject also deals with distributed databases in brief. These data are efficiently handled by a database management system.Christ University. BCA 334: Software Engineering Software Engineering is one of the emerging areas in the field of Information Technology. Advanced topics like inheritance and its various types and virtual functions are taught in depth with its application areas. The management of a project and how to ensure the quality of the product is also discussed. It also concentrates on various techniques for database protection and query optimization. It also deals the popular relational data model and SQL queries in depth. The subject deals with what is a database and how a database should be designed. This is introduced next to system analysis and design. The actual development process and various levels of testing are discussed with the case studies to make the students to become good software professional. Bangalore. BCA 336: OOP using C++ C++ is the first object oriented programming language taught in the course. The steps that are followed here reduce the development cost and time. The subject starts with the comparison between procedural languages and object oriented languages.

Error detection and correction mechanisms are dealt to give an exposure about how actually the network handles the data. and classification of algorithms based on Polynomial (P) and NonPolynomial (NP) algorithms BCA 436: Programming in Java Java is popular because of its platform independent nature. summarizing algorithms' complexity. BCA syllabus . After this course. India 9 SEMESTER – IV BCA 431: Technical English The objective of this course is to apprise the students of the special needs of interacting through letters and reports for every day needs. The basic elements of the language like different data types and programming constructs are discussed. graphs and heaps. backtracking and branch and bound algorithms and Understand fundamental algorithms in sorting. Java is basically designed for internet applications. networks of computers are commonly used to share data and resources. greedy heuristics. dynamic programming.Christ University. Applets are discussed in detail. Develop recurrence relations. BCA 432: Numerical Techniques The objective of this course is to introduce various numerical techniques available in problem solving. BCA 433: Financial Management The objective of this course is to introduce concepts of Financial Management to students to apply them effectively in projects of business domain. Solve those recurrence relations using a variety of methods. Bangalore. BCA 434: Computer Networks – I Today. Inheritance. The OSI reference model is dealt to introduce different layers. different topologies and network devices. students should be able to Evaluate algorithms based on their complexity and asymptotic growth rate. Congestion handling is also dealt in the subject. As a graduate of Computer Science it is necessary to get expertise in this language which is used in many applications. interfaces and concept of packages are discussed which are the important concept of basic Java. Applets are the programs which can be immediately interpreted by a web browser. Advanced topics like different controls and graphics methods are discussed which is of great help for the developers. The subject introduces the concept of networks. Other advanced topics like servlets and JDBC are also dealt. BCA 435: Analysis and Design of Algorithm The goal of this course is to facilitate the students developing a well-organized understanding of the analysis and design of algorithms. The discussion about routing algorithms gives exposure to the sending of information in a network. The layers are discussed in detail in later chapters of the subject. Know how to utilize the algorithmic methods of divide and conquer.

transformation and rotation of an object is also included as part of this subject. Scaling. It also aims at their overall soft skills development BCA 532: Unix Operating System Unix is the multi user and multi tasking operating system. HTTP. It also deals with the programming of internet. BCA 533: Computer Graphics Graphics is the familiar to even computer illiterates. DNS.Christ University. Bangalore. JSP is also included as part of this subject. Graphics mainly works the smallest element called as pixel. process management and memory management are discussed which makes the students to understand the internals of UNIX. Programming is generally done using HTML. Discusses addresses. networks. FTP. BCA 542A: Internet Programming Internet is the buzzword today among the youngsters. AWK and Sed is also discussed. Different topics of HTML are discussed which is helpful for a web page designer. Line drawing and circle drawing algorithms basically works according to this principle. The subject deals extensively about the working of World Wide Web. Three dimensional graphics is included as part of this subject. Bourne shell programming is dealt in depth which can be used to develop applications in UNIX. naming. BCA syllabus . After learning the concepts of an operating system. The working of different devices is also discussed. using the latest tools and techniques. The file system. email and others. The subject also concentrates on the recent trends in Information Technology. STREAM A : BCA 541A: TCP/IP Introduces TCP/IP (Transmission Control Protocol/Internet Protocol) fundamentals. and other aspects of TCP/IP. Thanks to Hollywood movies! The subject starts with an introduction to applications of graphics. Various commands used by UNIX shell is also discussed which makes the users of UNIX comfortable to interact with. sockets. The subject is introduced with the features and basic architecture of UNIX. Plotting these pixels in a systematic way makes an object. Overview of internet communication and basic protocols such as: ARP. it is appropriate to learn how UNIX implements these concepts. Concepts of Multimedia and video conferencing are also included. India 10 SEMESTER – V BCA 531: Professional English The objective of this course is to train the students to communicate effectively in the professional world.

The internet protocol which makes it possible to connect different computers together is dealt in detail. Different phases of a compiler are dealt in detail will be of great help for the compiler developers. interpreter and assembler. The subject deals different types of assemblers the phases involved in detail. BCA syllabus . India 11 STREAM B : BCA 541B: Computer Networks – II This is offered as continuation of computer networks – I subject. Topics like macro processors. BCA 542B: System Software The subject is introduced to get knowledge about different translators like compiler. The routing principles and how routing takes place is also discussed as part of this subject.Christ University. General machine architecture is also included as part of the subject. The subject introduces the students to local area networks and its benefits. This mainly deals with the techniques used in TCP / IP protocol. FTP and SMTP is also dealt here. Introduction to telnet. loaders and linkers is included to get in depth knowledge about the translation to the machine language. Bangalore.

BCA 642A: Multimedia Computing Multimedia is the latest technology in the field of Information Technology. The subject extensively covers different concepts of multimedia and its application areas. The study of this subject is really required for the students of computer science to get better opportunities in the IT industry. Bangalore. The second unit deals with communication in distributed systems with reference to ATM. The languages used for simulation are also discussed as part of this. Many areas like nuclear reactors and testing of missiles also makes use of simulation. STREAM A: BCA 641A: Distributed Systems Communication has become ever relevant keyword in the field of information technology. The pilots who undergo training first gets expertise using the simulated program. Many of the animation techniques make use of the multimedia features. The subject deals with the concept of distributed systems focusing on multiprocessors and multi-computers. BCA syllabus . India 12 SEMESTER – VI BCA 631: System Simulation Simulation plays vital role in all engineering and research fields. The last unit discusses about the file systems with reference to distributed systems.Christ University. The third and fourth units deal with algorithms for distributed computing. Case studies are included as part of this subject for better understanding. Multi media is one of the great achievements in this cyber era. The subject deals extensively all the techniques used for simulation.

An introduction to Intel 8086 with its various registers and flags are also included as part of this subject. This subject mainly deals with the internals of a microprocessor.Christ University. The introduction part deals with what is a microprocessor and what are its application areas. The architecture of 8085. The last unit deals with concepts of memory design including characteristics and features of different types of memories. BCA syllabus . Instruction set of 8085 and addressing modes are also included in the subject. Programming 8085 microprocessor is dealt with the help of small programs. The main concentration is towards Intel 8085. Bangalore. The third unit deals with the basics of design of an ALU. India 13 STREAM B: BCA 641B: Microprocessors A microprocessor is the heart of a computer. The in and out of Intel 8085 is discussed. different registers and flags are discussed as part of this. BCA 642B: Computer Architecture The subject deals with basic model of a computer with the concepts on processor design in which data representation and instruction basics are discussed.

RaviShanker Unit 5: Short story: The Bet by Anton Chekov Both the stories deal with the power of the human mind. Stopping by Woods on a Snowy Evening by Robert Frost Module 2 : EXPRESSIONS@OUTPUT Hours : 20 Written Skills 1. through a few prescribed poems. We live in deeds. This essay looks at the developments in science from a different angle. If by Rudyard Kipling 2. not breaths by Philip James Bailey 3. Live Blindly and Upon the Hour by Trumbull Stickney 4. Paragraph writing – what is a paragraph – the main features of a paragraph – how to write a good paragraph – exercises in paragraph writing to be given – the exercises can be on varied topics like personal experiences. The student is guided towards a critical thinking process through these selected pieces. in thoughts. This letter throws light on the ways of the world of technology. Unit 6: Poetry: 1. social responsibilities. India 14 BCA 131: GENERAL ENGLISH Total Teaching Hours: 45 Module 1: INSIGHT@INPUT Hours: 25 INPUT takes into account the need for building the Emotional Intelligence of the student. where the consumer is relegated to the background. This letter was published in The New York Times Unit 2: An essay by Subroto Bagchi in India Today on The Five Minds of Future Unit 3: Seven Wonders by Lewis Thomas. which focus on varied issues. letters. Framing questions through a given dialogue BCA syllabus . essays and short stories. Unit 4: Short story: PONNUTHAYI By BAMA Translated by N.Christ University. computer related topics 2. not years. Bangalore. Classroom interaction and participation on related issues are expected to expand the horizons of the young mind. current topics. Unit 1: A real letter written by an 86 year old woman to her bank manager.

Christ University. usage of articles and prepositions Oral skills (evaluation to be taken up and form a part of internal assessment) 1. Vocabulary exercises – situational conversations. India 15 3. Script enacting BCA syllabus . Individual presentations 2. exercises on synonyms Grammar reinforcement: Correction of errors. Bangalore. Group discussion / Talk shows on current topics 3. editing / abstracting / re -writing skills.

McGraw Hill Book Company. Composition of functions – inverse of compositions. RELATIONS AND FUNCTIONS Definition of a set – Operations on sets – Basic set identities – Principal of inclusion and Exclusion – De-Morgan’s Laws – Cardinality – Difference – Symmetric difference – Cartesian Product – Results related to Cartesian products – Relations – Types of relations – Equivalence relation – Equivalence classes – Partition of a set – Matrix representation of a binary relation – Functions – on – to – one. Erwin Keryzig : “Advanced Engineering Mathematics”. inverse functions. K.Joshi : “Foundations of Discrete Mathematics”. S Narayan and T K Manicavachogam Pillai : “Calculus”. Tremblay and Manohar : “Discrete Mathematical Structures with Application to Computer Science” . their truth tables – Tautology and contradiction – Logical equivalence – Standard Theorems – Problems on Negation – Converse. Inverse and Contrapositive of a Proposition – Open sentences – Quantifiers – Truth sets – Connectives involving quantifiers – Normal forms – Principal normal forms – Examples from Switching Circuits. Vol I and Vol II S. Bangalore.Publishers. ( 10 Hours) UNIT 2 : MATHEMATICAL LOGIC Propositions and Truth values – Connectives. 2. onto. BCA syllabus . 3. India 16 BCA 132: MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE Total Teaching Hours: 45 UNIT 1: SETS. (10 Hours) UNIT 3 : DIFFERENTIAL CALCULUS Introduction – Real valued functions – Limit of a function – Algebra of limits Continuity of a function – Properties of a continuous function – Differentiability – Differential coefficients of some elementary functions – Algebra of derivatives – Derivatives of composite functions – Euler’s theorem of homogeneous functions – Mean value theorems – Roll’s theorem ( with proof ) – Lagrange’s mean value theorem ( with proof ) – Cauchy’s mean value theorem ( statement only ) – Taylor’s theorem ( statement only ) – Maclaurin’s Theorem ( statement only ) (15 Hours) UNIT 4: INTEGRAL CALCULUS Definition – Standard Results – Methods of integration – Method by Substitution – Method by Parts – Definite Integrals.V. into.Christ University. Wiley Eastern Ltd.D. 2. REFERENCE BOOKS: 1. (10 Hours) TEXT BOOKS: 1. Thomas and Finney : “Calculus with Analytical Geometry”.

Prentice-Hall India. Vinayaka Moorthy and Srimani : “A textbook of probability and statistics”. Prentice-Hall India. median and mode-Partition values-Quartiles for grouped and ungrouped data-Range-Quartile deviation-Standard deviation and coefficient of variation for grouped and ungrouped data.Christ University. 1997. 7th Edition. India 17 BCA 133: STATISTICS FOR BCA 1 Total Teaching Hours: 45 UNIT 1: Importance of Statistics-Primary and secondary data-Data collection methodsPresentation of numerical and categorical data. S. Subhas Stores REFERENCE BOOKS : 1. 6th Edition. Bangalore. (10 Hours) UNIT 2: Concepts of central tendency and dispersion-Mean. 3. BCA syllabus . B. Berenson and Levine:“Basic Business Statistics”. Daniel and Terrell: “Business Statistics for Management and Economics”. Levin and Rubin: “Statistics for Management”. 1992. Prentice-Hall India. Sooryanarayana : “A textbook of probability and statistics” . (07 Hours) TEXT BOOKS: 1. Chand 2003 2. 1996. 2. (10 Hours) UNIT 3: Skew ness-Karl Pearson’s and Bowley’s measure of skew ness-kurtosis (03 Hours) UNIT 4: Correlation-scatter diagram-Karl Pearson’s and Spearman’s correlation coefficient-Regression-Properties of regression coefficient (10 Hours) UNIT 5: Index numbers-Laspeyere-Passche-Fisher’s price and quantity index numbersTime reversal and factor reversal tests (05 Hours) UNIT 6: Time series-Different components-Trend analysis by moving average and Least squares method-Measurement of Cyclical variation by residual method-Measurement of seasonal variation by simple average and ratio to moving average method-Irregular variation. 6th Edition.

Common emitter and Common collector configuration – Comparison – Transistor as an amplifier(CE) – Performance of transistor amplifier – Cut off – Saturation points – D C load line – Voltage gain (10 Hours) UNIT 5 : Transistor Biasing and Applications Transistor biasing methods – Base resistor methods – Resistor voltage divider bias method – Single stage transistor amplifier-practical circuit of transistor amplifier-D.Diode as rectifier – Resistance of diode – Diode rectifiers (half wave. full wave and bridge rectifiers) – Efficiency of rectifiers – Ripple factor – Filter circuits – Zener diode as a regulator (07 Hours) UNIT 4: Transistor Transistors – Characteristics of Common base. India 18 BCA 134: BASIC ELECTRONICS Total Teaching Hours: 45 UNIT I : Introduction Atomic structure – The energy of an electron – Valence electrons – Free electrons – Energy levels – Energy bands – Important energy bands in solids – Classification of solids (04 Hours) UNIT 2 : Semiconductor Physics Bonds in semiconductors – Commonly used semiconductors – Effect of temperature on semiconductors – Intrinsic and extrinsic semiconductors – n type and p type semiconductors – Majority and minority carriers – pn junction – Characteristics of forward & reverse biased pn junction (09 Hours) UNIT 3: Semiconductor Diode Diode – Different types of Diodes -. Bangalore.C and A.Working of JFET – JFET as an amplifier – Difference between JFET and BJT – Metal oxide semiconductor FET(MOSFET) – Working (05 Hours) BCA syllabus .Christ University.C equivalent circuits-load line analysis (07 Hours) UNIT 6 : Field Effect Transistors (FET) Types of FET – Junction field effect transistor(JFET) .

Mehta V K and Mehta Shalu: “Principles of Electronics”. Chand & Company Ltd. Theraja B L: “Basic Electronics solid state”. D C and Gupta. N N. Bhargava. S C: “Basic Electronics and Linear Circuits”. REFERENCE BOOKS: 1. Bangalore. Chand & Company Ltd.Christ University. 7th Edition S. Kulshreshtha. 1989. S. BCA syllabus . 5th Edition. 2. India 19 UNIT 7: Logic Families RTL – DTL – TTL – ECL – Integrated Injection Logic (I²L) – Complementary Metal Oxide Semiconductor (CMOS) (03 Hours) TEXT BOOK: 1. TMH.

JK flip-flops).Logic levels and pulse wave forms. Basic laws of Boolean algebra. Donald P: “Digital Computer Fundamentals” 3rd Edition. 3. ROM. Karnaugh map (SOP and POS) with examples. Inverter gates. 9’s and 10’s complement. 1’s and 2’s complement. 2. 3rd Edition. TMH. 1995.Christ University. Hexadecimal). X-NOR gate. Decade counter). NAND gate. AND gate. NOR gate. Look ahead carry adder. Non-Volatile. and PIPO). BCD numbers.Adders (half and full). Paul Albert and Leach. Binary. Floyd. X-OR gate. Encoder. ASCII code. E²PROM. Donald P: “Digital Principles and Applications” 4th Edition. Binary Arithmetic. D flip-flops. Malvino. 1997. (07 Hours) UNIT 4: Flip-Flops . PISO. EPROM. Thomas L: “Digital Computer Fundamentals”. (07 Hours) UNIT 2: Boolean algebra and Gate networks . Bartee. Octal. TMH. (08 Hours) UNIT 6: Memory and Introduction to Microprocessor . (07 Hours) UNIT 5: Registers and Counters . Boolean expressions for gate networks (SOP and POS). Thomas C: “Digital Computer Fundamentals” 6th Edition. Decade counter). Malvino. Edge triggered flip-flops (SR flip-flops. TMH. (13 Hours) UNIT 3: Combinational Logic . Modes of operation of registers (SISO. Gray code. (03 Hours) TEXT BOOK: 1. 1995. 2000. Timing diagrams. Paul Albert and Leach. Bangalore. Pulse triggered flip-flops (Master slave JK flip-flop). India 20 BCA 135: DIGITAL COMPUTER FUNDAMENTALS Total Teaching Hours: 45 UNIT 1: Introduction to Number system and Codes .Fundamental concepts of Boolean algebra. BCA syllabus . RAM. Asynchronous counters (Four bit ripple counter. OR gate. Multiplexer.Latches. Floating point numbers.Classification of memory – Volatile. SIPO. Synchronous counter (Four bit synchronous counter. University Book Stall.Buffer registers. REFERENCE BOOKS: 1. Decoder. Basic Components of a Microprocessor (Introductory ideas). Simplification of Boolean expression. DeMorgan’s theorems. Different number systems and their conversions (Decimal. The universal property of NAND gate and NOR gate. Parallel binary adders. De-multiplexer with applications.

Two dimensional arrays of strings (03 Hours) BCA syllabus . strcat & strrev. Register. initialization.conditional operator. India 21 BCA 136: INTRODUCTION TO PROGRAMMING USING C Total Teaching Hours: 45 UNIT 1: Introduction to Computers Evolution of Computers. strcpy. strcmp. Advantages and Disadvantages of Computers. Generation of Computers. Algorithms and Flowcharts with Examples. do-while. for Break statement. Structure of a C program Constants. logical operators. Structured Programming. Application software and System Software. Digital. case control structure. Characteristics of Computers. Loop control structures.while. relational operators. Continue statement. Classification of Software. Classification of Computers according to Size. (04 Hours) UNIT 2 : Introduction to Programming Types of Programming Languages. Software. Hybrid Computers. variables and keywords Types of C constants and variables Rules for constructing variable names UNIT 4 : C Instructions Type declaration and arithmetic instructions Integer and float conversions. Block Diagram of a Digital Computer. displaying array contents (03 Hours) UNIT 8 : Strings Basic concepts. go to statement UNIT 6 : Storage classes in C Automatic.Super Computers. Classification of Computers – Analog.strlen. Personal Computers ( Different Types) and Terminals (Different Types). Mainframe Computers. Bangalore. (03 Hours) UNIT 3: Introduction & The C character set History of C. Type conversion in assignment Operators in C. Hierarchy of operations Control Instructions UNIT 5: Control Structures Decision control structures. standard library string functions.Christ University. Extern and Static Variables (03 Hours) (02 Hours) (05 Hours) (01 Hour) UNIT 7: Arrays – One dimensional and multidimensional arrays Declaration. reading values into an array. Programming Logic.

H M and Deitel P J: “C How to Program”. Pointers and functions. exclusive OR. Pointers and arrays. notation. declaration. Kanetkar. passing values to functions. E: “Programming in ANSI C” 2nd Edition. Bangalore. recursion. 2nd Edition. right shift and left shift operators (02 Hours) UNIT 14: C preprocessor Types of C preprocessor directives Macros. Tata McGraw-Hill REFERENCE BOOKS: 1. BCA syllabus .formatted & unformatted console I/O functions (04 Hours) UNIT 10: Pointers Definition. India 22 UNIT 9 : Functions Definition. OR. Balagurusamy. 2. Pointers and strings. Byron S: “Programming with C”. function definition and prototyping. types of functions.comparison with functions File Inclusion (02 Hours) TEXT BOOKS: 1. Prentice-Hall. array of pointers. complement. Gottfried. UNIT 12 : Files File opening modes String I/O in files Formatted disk I/O functions Text mode and Binary mode Record I/O in files (04 Hours) (04 Hours) (05 Hours) UNIT 13 : Bitwise operators Bitwise AND. Deitel. Tata McGraw-Hill 2.call by value and call by reference. accessing structure elements Array of structures Pointers and structures Unions – definition. declaration. passing arrays to functions I/O functions.Christ University. 1996. UNIT 11 : Structures and Unions Definition. accessing union elements typedef statement. 4th Edition. BPB Publications. Yashavant: “Let Us C”.

/) based on the symbol entered. Write a program to perform matrix multiplication. Write a program to check whether a string is a Palindrome. 2. Implement modify and search operations. 7. Write a program to convert Fahrenheit to Celsius. for loops. Aim: To demonstrate the concept of arrays and strings a. class etc. Write a program to find the roots of a quadratic equation b.Christ University. Write a program to check whether a given matrix is an Identity matrix or not. b. Write a program to check whether the given number is a Prime number or not. Write a program to count the different vowels in a line of text. Aim: To demonstrate the usage of if. Write a program to accept two numbers and perform various arithmetic operations (+. name. Write a program to print all the Armstrong numbers between any 2 given limits. India 23 BCA 151: C PROGRAMMING LAB Guidelines: • • • • Follow Coding standards The output of the programs should be neatly formatted The programs should be user friendly and interactive Use comment wherever necessary 1. c. *. Create a student database storing the roll no. Aim: To demonstrate the usage of operators and data types in C a. Write a program to print the size of all the data types supported by C and its range. break and continue a. -. 5. b. Aim: To demonstrate the concept of switch-case a. b. Aim: To demonstrate the concept of structures and unions a. b. b. Write a program to print all prime numbers between any 2 given limits. Aim: To demonstrate the usage of functions and recursion a. Aim: To demonstrate the concept of while. Write a program to accept three numbers and find the largest and second largest among them 3. if-else a. BCA syllabus . Bangalore. do-while. b. 6. 4. Create an employee structure and display the same. Write a recursive program to find the factorial of a number.

Christ University. Bangalore. Perform the different bitwise operations (menu driven program) . Write a program to access an array of integers using pointers 9. modify. BCA syllabus . Aim: To learn about pointers a. Write a function to swap two numbers using pointers b.The i/p and the o/p should be displayed in Binary form. b. and delete operations. 10. Aim: To learn about Files a. Display the contents of the same. India 24 8. Aim: To learn about Bitwise operators and preprocessors a. Create a file and store some records in it. Write a program to check whether a given number is odd or even using bitwise operators. Implement search.

Apply same format to A2:H2. 5. 2. 3. MS-EXCEL 1.Christ University. Prepare a document about any tourist destination of your choice with appropriate pictures and editing features. The footer for the document should be ‘Christ University Bangalore – 29”. shading and pattern to data in sheet BCA syllabus .  Give border. Use the following Features:  Three Column and Four Column setting  Set One or Two Advertisements  Use Bullets and Numbering. Insert appropriate pictures wherever necessary. India 25 BCA 152: PC SOFTWARE LAB MS – Word 1.  Select cell B4:D4 and change the horizontal alignment to center and text to 90 degree. ‘2’. Prepare a document which contains template of marks card of students.  A Multilevel list giving your areas of interest and further areas of interest.  All titles should be in bold  Format all cells numbers to currency style and adjust width as necessary. The sub areas should be numbered as ‘a’.xls. Open a new workbook. Bangalore. etc.  Add border to data. Prepare a News Paper Layout. (At least 5 mathematical symbols should be used). ‘b’.  The information should be divided in “General” and “Academic” sections. save it as JavaCoffeeBar.  Assign a password for the document to protect it from unauthorized access. Table should be Bordered and Shaded. Prepare a document about any topic in mathematics which uses mathematical symbols. Demonstrate the use of Hyperlink Option. Assume that there are 10 students. Write a letter to 10 different IT companies asking them to participate in the seminar using mail merge facility. It includes  A table giving your qualification and/or experience of work. Write a macro that sets margins to your document. Assume that you are coordinating a seminar in your organization. merge and center these cells. Use mail merge facility to forward the marks cards to the parents. 6. a font of size and double spaced document. etc while the areas should be numbered as ‘1’.  Select the cell range A1:H1.  The header should contain “BIO-DATA” while the footer should have page numbers in the format Page 1 of 10. 4. In sheet1 write following sales data for Java Coffee bar to show their First 6 months sales. Assign a password for the document to protect it from unauthorized access. Create a Document consisting of Bio-data.

Sort the employees on the basis of their net pay 3. If Job Id is 4 then DA is 25% of the basic salary and HRA is RS. In such cases the grade is “FAIL”.Validate the marks. For the above employee worksheet perform the following operations 1. From 300 to 350 the grade to be assigned is ‘D’. (Max Marks is 100).free BCA syllabus . From 401 to 449 assign the grade as “B”. Name and marks in 5 subjects. From 351 to 400 assign the Grade as C. 5.2500. Name. Designation. 1500.000 with experience greater than 2 yrs. Prepare a pay-bill using a worksheet. 3. For all the above Job ids PF to be deducted is 4%. The work sheet should Contain Roll Number. Experience and Basic Salary and Job ID. If Job Id is 1 then DA is 40% of the basic salary. 2. HRA is Rs. 2500. Find the net pay. If Job Id is 2 then DA is 35% of the basic salary. For all the other Job ids DA is 20% of the basic salary and HRA is Rs. India 26  Apply different font settings for all titles in sheet  Apply green color and bold setting to sales above 10000 (use conditional formatting)  Rename current worksheet as FirstHalfSales 2. Bangalore. 4500. (Assume that there are 10 students). Assign grade ‘A’ if the total marks is above 450.000. 100 to be deducted as Professional Tax. Prepare a worksheet to maintain student information. HRA is Rs. A student is eligible to get a grade only when he gets 40 and above in all the subjects. HRA is Rs.Christ University. Assign the grade according to the following. Use filter to display the details of employees whose salary is greater than 10. Telephone Calls Up to 150 calls . The work sheet should contain Employee Id. For the job ids between 1-4 Rs. Create a statement of Telephone Bill Charge for a customer. 3500. Use advance filter to display the details of employees whose designation is “Programmer” and Net Pay is greater than 20. 4. For the total marks less than 300 No grade is assigned. Calculate the total marks. If Job Id is 3 then DA is 30% of the basic salary.

hyperlinks. Give the options for View. Title. MS-POWERPOINT 1. Bangalore. Show the usage of action buttons. Display details about books where there is more than 5 copies of the books. Prepare a presentation about any general topic of current relevance (min 10 slides).  Represent sale of a product for five years using Pie-Chart. Create Pivot Table chart and Report for the data. address.25 per call Above 2000 . Create User interface using Access to enter and modify the details stored in the employee database.1. Insert appropriate images wherever necessary. Include a table which has the information about the employee’s family. Create a database called as Library. Show the application of Pens. The presentation should have minimum 10 slides. MS-ACCESS 1. Assume that you are going to give a presentation about Information Technology. (b)Create a macro to change the name of worksheet as Macro Example. Display the details of members who have not paid the amount. 2.  Represent annual sales of all products using Bar Chart. merge first three columns of first row and write heading as DATA in green color with yellow background (c)Link word document in excel worksheet to show the usage of linking and embedding. Delete some of the member details.0.  Compute the total sales of each product in the five years.1. Use proper formatting.80 per call 501 to 1000 calls . Author. month and sales. Delete and Edit. Number of Copies and Brief Description about the book. name. and animations. 2. India 27 151 to 500 calls . Create a report using Access to display the BCA syllabus .  Compute the total sales of all the products in five year. Include another table named as members which contains member id. Create a database of Employees in an organization.40 per call 6. (Choose some latest technologies). Add.Christ University. diagrams and tables.  Compute the total sales of all products for each year. Assign Accno and member id as primary key. Display the details about the books written by the particular author. Write at least 5 records. telephone no and membership amount paid or not.  Represent annual sale of all the products using Pie-Chart. Include a table names as Book which contains Accno.1. Using Excel project the Product sales for any five products for five years.00 per call 1001 to 2000 . (a) Using Excel write sales data with columns product.  Label and format the graphs 7.

BCA syllabus . India 28 department-wise listing of employees.Outlook Express 1. Configuring E-mails using Outlook Express. Create a pay slip for the employees using the access reports. MS.Christ University. Use the Options for having more E-mail Accounts. Use this to send and Receive mails Create News Groups. Bangalore.     Create Local Folders.

Types of Communication.Christ University. Methods of Communication. Extempore talks (10 Hours) REFERENCE BOOKS: 1. Objectives of Communication. Urmila Rai and S M Rai BCA syllabus . 3. 2. The process of Communication. Media of Communication. Resume preparation – the difference between an application letter and a CV – how to prepare a good CV – exercises on CV preparation (05 Hours) UNIT 3: Oral skills: 1. Phonetics – Basics Presentation skills with emphasis on PPTs Mock Interviews Debates. Barriers to Communication (30 Hours) UNIT 2: Written skills: 1. Essay writing – features of a good essay – structure and presentation – exercises on essay – writing on varied topics 2. India 29 BCA 231: FUNCTIONAL ENGLISH Total Teaching Hours: 45 UNIT 1: Learning skills: What is Communication. 2. 4. Essentials of Business Communication by Rajendra Pal & Korla Halli Business Communication – By Dr. Principles of Communication. Bangalore.

3. Vasishta A R : “Modern Algebra”. REFERENCE BOOKS: 1. Schaum series. K Manicavachogam : “Algebra”. Wilson theorem. S. TMH.D.Schaum series. Narayana & T. RINGS AND FIELDS Definition of Group – Semigroup – Subgroup – Results on subgroups – Order of an element – Properties – Cyclic groups and related properties – Coset decomposition – Lagranges theorem and its consequences – Normal subgroups and related results – Quotient group – Group homomorphism – Elementary properties – Kernel of homomorphism – Isomorphism and related results – Rings – Types of Rings – Fields – Examples of Fields (15 Hours) UNIT 4: DIFFERENTIAL EQUATIONS Definition and examples – Order and Degree – Solutions of first order first degree differential equations – Variable separable – Equations reducible to variable separable – Linear differential equations – Bernoulli’s Differential equations (10 Hours) TEXT BOOKS: 1. Lagrange’s theorem (Statement only). Bangalore. Krishna Prakashan Mandir. Frank Ayres J R : “Differential Equations”. 3. 2. Apostol T M : “Introduction to Analytic Number Theory”. K Manicavachogam Pillay : “ Differential Equations” . T. Herstein I N : “Modern Algebra”.Christ University.C. S V Publishers BCA syllabus . 2. Frank Ayres J R : “Matrices”. SV Publishers 4. Narosa Publishing House. of two non – zero integers – Prime and Composite numbers – Unique Factorization theorem – Division of a given number – Euler’s Ø Function – Congruence – Solution of linear congruence – Fermat’s theorem. (10 Hours) UNIT 3: GROUPS. 4. Eigen vectors and properties – Cayley Hamilton theorem (Statement only). India 30 BCA 232: ALGEBRA AND DIFFERENTIAL EQUATIONS Total Teaching Hours: 45 UNIT 1: MATRICES Review of fundamentals – Equivalent matrices – Elementary row (column) operations – Rank of a Matrix by reducing it to echelon from – Rank of a matrix by normal form – Finding the inverse of a matrix – Homogeneous and non – Homogeneous system of equations – Consistency criterion – Characteristic equations – Eigen values. Vasishta A R : “Matrices”. (10 Hours) UNIT 2: THEORY OF NUMBERS Divisibility – Division Algorithm – Greatest Common Divisor – Euclid’s algorithm to find the G. TMH.

BCA syllabus . Prentice-Hall India. Prentice-Hall India.Christ University. B. India 31 BCA 233: STATISTICS FOR BCA – II Total Teaching Hours: 45 UNIT 1 : Random Experiment-Sample space and events-definitions of probabilityAddition and Multiplication of probability-conditional probability and baye’s theorem. 2002. (10 Hours) UNIT 2: Random variables and distributions-Discrete and continuous random variablesProbability mass and density functions-Expectation-Binomial. Poisson and Normal Distributions. Walpole: “Probability and Statistcis for Engineers”. Fruend : “Mathematical Statistics”. Bangalore. 2. (10 Hours) UNIT 3: Sampling Distribution and Estimation-Definition of a parameter and a StatisticChi-Square. Chand 2003 2. (15 Hours) TEXT BOOKS: 1. (10 Hours) UNIT 4: Hypothesis testing-Statistical Hypothesis-Null and Alternative-Level of significance-Type I and Type II Errors and Power of a test-Test for single mean and difference between two variances (Known and Unknown variances)-Paired t Tests-Test for single proportions-Difference between two proportions-Chi-square tests for Independence of attributes. Vinayaka Moorthy and Srimani : “A textbook of probability and statistics” . Fifth Edition. Subhas Stores REFERENCE BOOKS: 1. t and f distributions (Definitions only)-Confidence Intervals-Single mean and difference between two variances (Known and Unknown variances)-Single proportion and difference between two proportions. S. Seventh Edition. 1992. Sooryanarayana : “A textbook of probability and statistics” .

object . Introduction to structured design. procedures. Feasibility report.driven methodology. Definition. major development activities. Internal controls for inputs. DFD. Steps in feasibility analysis. System analysis and design skills. Computer Aided System Engineering (CASE). Data Dictionary.Christ University. Bangalore. Multifaceted role of a system Analyst. Tools. Decision Tables. data input Model input methods. System Development Life Cycle. India 32 BCA 234: SYSTEM ANALYSIS AND DESIGN Total Teaching Hours: 45 UNIT 1 : System concepts and the information systems environment: The systems concept.Benefits. joint application development (JAD). Interviews and questionnaires.oriented design. cost-benefit analysis. Form . System users issues for output design. Technical skills. Management Information systems. Expert systems. (05 Hours) UNIT 3: Cross life cycle activities: Fact-Finding. The Tools for Structured Analysis. Decision support systems. Decision Trees. Types of systems. the system proposal (05 Hours) UNIT 5: Structured Analysis: Definition. Structured English. files. Office information systems. (05 Hours) UNIT 2 : Information system development: Definition. Media and formats. Review of literature. A CASE tool frame work (05 Hours) UNIT 6 : System Design: Strategies for good system design. Research and site visits. personnel allocation and audit considerations (06 Hours) UNIT 7: Input/output forms design: Methods and issues for data capture and input. (05 Hours) BCA syllabus . JAD participants. Principles of system development. Principles and guidelines for output design. Personal and workgroup information systems. Procedure for cost benefit determination. Type of interviews and questionnaires. How to plan and conduct AD sessions . categories. characteristics of a system. Interpersonal skills. Types of outputs. on-site observation. Preparing career as a system analyst. trends in automatic data collection technology. data analysis. Batch versus on-line inputs. data entry. logical and physical design. System user issues for input design. forms. Transaction processing systems. Introduction to fundamental information systems. GUI controls for input design. (05 Hours) UNIT 4: Feasibility and Cost-Benefit Analysis: Feasibility considerations.

Whitten: “System analysis and design methods” Fourth edition. India 33 UNIT 8: System testing and quality assurance: Testing. ISO certification (04 Hours) UNIT 9: Implementation and Software maintenance: Conversion. trends. Jeffrey L. Nature of test data. Post-implementation review.Ltd. different methods. Mc-Graw Hill International edition. procedure. Elias M: “System Analysis and Design” Second Edition. Quality assurance : goals in system development. Awad. Bangalore. Primary activities of a maintenance procedure. 1989.. Sen. Software maintenance. 2. Activity network for conversion. REFERENCE BOOKS: 1. Mc-Graw Hill International. activity networks for system testing. Galgotia Publication Pvt. James A: “Analysis and Design of Information Systems” Second Edition. BCA syllabus . Reducing maintenance costs (05 Hours) TEXT BOOKS: 1. Test plan.Christ University.

Silberschatz.Christ University. Disk Scheduling-FCFS-SSTF-SCAN-LOOK-CSCAN and CLOOK. Types of Operating Systems: Batch. Allocation Methods. PHI. 4. 2nd edition. Access Methods. India 34 BCA 235: OPERATING SYSTEMS Total Teaching Hours: 45 UNIT 1: INTRODUCTION: Definition of Operating Systems. (07 Hours) TEXT BOOK: 1. S Andrew. Secondary Storage Structure. (05 Hours) UNIT 2: PROCESS MANAGEMENT: Definition of a Process – Process states – Process Control Block – Scheduling Criteria – Schedulers: Short term. Detection and Recovery (Banker’s Algorithms and Resource Request Algorithm) (05 Hours) UNIT 5: MEMORY MANAGEMENT: Address Mapping. Operating Systems Concepts and Design. Multiprogrammed. Conditions for Deadlock. SJF and Priority Algorithms (preemptive and non preemptive) – Inter process Communication (10 Hours) UNIT 3: PROCESS SYNCHRONIZATION: Critical Section Problem – Classical Problems of Synchronization: Dining Philosophers.Disk Structure. 3. Readers Writers and Sleeping Barbers Problem – Semaphores – Monitors (05 Hours) UNIT 4: DEADLOCKS: Definition of a Deadlock. 2000. Protection. Page Replacement Algorithms: FIFO and LRU (08 Hours) UNIT 6: FILE SYSTEM: File Concept. Round Robin. Free space Management. Abraham and Galvin. Multiple Partitioned: Fixed size. Operating Systems – Design and Implementation. Paging and Segmentation. Stalling Williams. Swapping. Operating System Concepts. Services of Operating Systems. 2001 BCA syllabus . Producer Consumer. Medium term and Long term schedulers – Scheduling Algorithms: FCFS. File System Structure. Operating Systems. Avoidance. I/O Interface. Directory Structure. H M Deitel. Bangalore. Tanenbaum. Handling Deadlocks: Prevention. Milan Milenkovic. California Peachpit. 2001. 5th Edition. John Wiley and Sons REFERENCE BOOKS: 1. (05 Hours) UNIT 7: I/O SYSTEMS: Overview of I/O Systems. Functions of Operating Systems. PHI. Peter Baer. Variable size and Dynamic size. McGrow Hill 1987 2. Real time and Distributed Operating Systems – Spooling – System calls – Operating system Structures. Operating Systems. Management Methods: Single contiguous. Time sharing.

Deletion. Insertion sort. Quick sort.G: “An Introduction to data structures with applications”. REFERENCE BOOKS 1. Linear Search and Binary Search (08 Hours) UNIT 4: Linked lists-Linked list. Display)-Doubly linked linear list (Insertion. Tremblay J. Binary Search Trees – Searching and Inserting in Binary Search Trees. Traversals on a Binary Tree (In-order. Deletion. advantages and disadvantages of arrays.Concepts.Strings. Merge sort .Storing Strings – Fixed length structures. Complete Binary tree. Infix.Bubble sort. Complexity . and Deque (Introductory concepts)-Application of queues. sequential and linked implementation. BCA syllabus . pre-order). Deletion.Concepts. Galgotia Publications. Operations on data structures. 1996 2. -Application of Trees (brief overview) (04 Hours) UNIT 8: Sorting. Deletion in a binary search tree. Variable length structures with fixed maximums and linked structures-Primitive Operations on Strings-Substring. Bhagat Singh and Thomas L Naps: “Introduction to Data structures”.Time-Space complexity. Prefix and Postfix expressions and Evaluation of postfix expression using stacks (05 Hours) UNIT 6: Queues. Second Edition. Seymour Lipschultz: “Data Structures”. Circular queues. Ellis.Definition – Representation of Linear arrays in memory (Both Single and Two Dimensional arrays)-Algorithm for Insertion and Deletion in one dimensional arrays (ordered and unordered arrays). Sparse Matrices (any two representations). Concatenation and Length of the string-Pattern Matching Algorithms – First Pattern Matching Algorithms and Fast Pattern Matching Algorithms. Selection sort.Towers of Hanoi. Operations. sequential and linked implementation. (06 Hours) UNIT 7: Trees-Binary trees. operations. 1998.P and Sorenson P. (06 Hours) UNIT 3: Arrays. post-order. (02 Hours) UNIT 2: String Processing . (06 Hours) TEXT BOOK: 1. Horowitz: “Fundamentals of Data Structures” Galgotia Publications. Schaum series TMH. Bangalore. 1995 3. Display)-Circularly linked linear lists (Insertion. Display)-Applications of linked linear lists (08 Hours) UNIT 5: Stacks.Representation of linked lists in memory-Operations on linked list (Insertion. Indexing. Application of stacks.Christ University. India 35 BCA 236: DATA STRUCTURES Total Teaching Hours: 45 UNIT 1: Introduction to data structures-Definition-Classification of data structures (Linear and Non-Linear). TMH. Linear Queue (FIFO).

and print a project f. Text boxes. radio buttons. Create menus and submenus for program control b.set break points. 3. Use Do/Loops and For/Next statements c. Use For Each/Next statements c. Define design and development process d. Use online Help Introduce controls and their properties (04 Hours) a. Declare arrays and refer to elements using subscripts b. Write. and Printing (02 Hours) a.Christ University. Changing properties at run-time d. Use formatting functions to format output Decisions and conditions (04 Hours) a. save. 4. Use If statements to control the flow of logic b. Explicit data type conversions c. 5. Windows Concepts b. Use And and/or operators c. Perform calculations using arithmetic operators and order of operations d. run. India 36 BCA 251: VISUAL PROGRAMMING LAB Total Hours: 60 1. Introduction (05 Hours) a. Use of accumulators and counters e. picture boxes and naming conventions b. User friendly features: access keys. check boxes. constants and calculations (04 Hours) a. Loops. resetting focus c. Toolbars and Status bar (03 Hours) BCA syllabus . procedures and functions (04 Hours) a. 6. Concatenate strings Variables. Call event procedures d. group boxes. Create and use list boxes and combo boxes b. Send information to the printer Menus. Objects and events c. 8. Tool Tips. Bangalore. 7. Debug tools . Structure Variables d. default and cancel buttons. Declaration of variables and constants considering data types and scope b. tab sequence. Input validation e. Store data in multidimensional array Lists. stepping and observation of intermediate results Arrays (02 Hour) a. Write reusable code in sub procedures and sub functions 2. Identify elements of IDE e.

Adding images to toolbars c. Printing with windows forms b. OO terminology b. The nature of a relational databases d. Overview of MDI b. Child window management e. Creating applications Creating and using reports a. Using Crystal Reports Create Object-Oriented programs a. ProgressBar File handling and file controls in VB Database Connectivity a. The data controls (DAO and ADO) e. Data Manipulation through VB – Forms h. Adding panels to the status bar Other controls a.Christ University. Classes d. Constructors and Destructors e. Inheritance Deploying the project a. Writing code to work with toolbars d. TabControl b. a. Creating toolbars b. 11. Working with database objects in code g. Develop a database application Introduction to Graphics and animation Multiple Document Interface (MDI) a. 14. India 37 9. Help file c. Creating parent and child forms c. Data base basics & database engine b. MonthCalendar and Date/TimePicker c. Common Dialog (Open/SaveFile) d. 16. 15. Online registration (03 Hours) (04 Hours) (12 Hours) (03 Hours) (02 Hours) (04 Hours) (02 Hours) (02 Hours) BCA 252: DATA STRUCTURES LAB Guidelines BCA syllabus . Creating setup program b. Data Bound controls f. Creating and using a status bar e. Bangalore. Multi-tier applications c. 10. Data reports c. Create a database in Access Through VB c. 12. Writing code for parent and child forms d. 13.

Aim : To learn about binary search trees a. Write a program to implement different operations on a stack using a linked list. Creation of a linked list and deletion. Aim : To learn about recursion a.Christ University. Aim : To learn about pointers and strings a. Write a program to implement heap sort. Write a program to implement Linear Search with sentinels b. Aim : To learn about Searching Techniques a. d. Aim : To learn about various sorting techniques a. Write a program to implement different operations on a queue using a linked list. b. Write a program to implement merge sort. Write a program to implement quick sort. Fibonacci series using recursion. b. Aim : To learn about one and two dimensional arrays a. India 38 • • • The output of the programs should be neatly formatted The source code should be indented The programs should be interactive 1. 6. BCA syllabus . Aim : To learn about singly linked list insertion and deletion a. 4. Towers of Hanoi with 3 pegs and n disks. 7. Creation of a linked list and insertion. b. b. c. Write a program to implement different operations on a circular queue using an array. Write a menu driven program to find the index of a pattern in a given string and to extract a substring using pointers. 5. Aim : To learn about queues a. Aim : To learn about stacks a. Write a program to implement Binary Search 3. Deletion 2. Insertion b. Write a menu driven program to concatenate two strings and find the length of a string using pointers. Write a program to create a binary search tree and to perform Insertion and deletion 8. Bangalore. 2. Write a program to implement insertion sort b.

Definite & Indefinite articles. expressions of time. using expresessions of times Grammar . talking about daily routines Grammar . Introduction of people Grammar – Verb position. Names of countries & nationalities. about courses. Nominativ & Akkusativ cases UNIT 4: Weekdays. Bangalore. types of sentences UNIT2: Describing a city. Variations of verbs & Subject. Nouns (Article & Plurals) UNIT 5 : Describing one’s profession.Christ University. Grammar . giving directions. Months.Breakable Verbs. placing order in a restaurant Grammar – Variations of verbs. Grundkurs Deutsch Exam Portions: Grammer – Fill in the blanks Comprehension Dictation/ Hearing Comprehension Passage writing/ Letter writing Viva (10 Hours) (09 Hours) (09 Hours) (09 Hours) (08 Hours) BCA syllabus . India 39 BCA 331: GERMAN LANGUAGE Total Teaching Hours: 45 UNIT 1: Greetings.Modal verbs & Prepositions TEXT BOOK: Moment Mal ! [1] Publisher – Langenscheidt REFERENCE BOOKS: Sprachkurs Deutsch [1]. Introduction to “Doch” UNIT 3: Numbers.

Degree sequence .Four Color Problem ( No theorems) Definition of Directed Graphs & Related definitions .Adjacency Matrix of digraphs (No Theorems). (No theorems) (10 Hours) UNIT 2 : Cut sets and Cut vertices – Fundamental circuits and cut sets – Edge Connectivity . Chromatic number . Bangalore.Directed path and connectedness Euler digraphs .Chromatic Partitioning – Chromatic Polynomial – Coverings .components of a graph operations on graphs – Euler path & Euler graphs – Hamiltonian Paths & Graphs – Weighted graphs (No Theorems) Definition of Trees – Properties of Trees .Arborescence – fundamental circuits in digraphs.connected graphs . (15 Hours) UNIT 4 : Graph Theory .B and C .Trees with directed edges . of edges (Proof included) .regular graph-isomorphic graph – sub graphs –walks – paths – circuits .Christ University.Vertex connectivity – Separable Graphs – Planar Graphs .B & C of digraphs .Kuratowski’s graphs – Different representations of Planar graphs (No Theorems). (10 Hours) TEXT BOOK : Narasingh Deo : “ Graph Theory with Applications to Engineering and Computer Science” . PHI-India REFERENCE BOOK: F Harary : “Graph Theory” .an Algorithmic approach – Detecting a Spanning Tree Detecting cut vertices and separability – Detecting a shortest path from a specified vertex to another specified vertex – Detecting a shortest path between all pairs of vertices – Planarity testing.Spanning Trees.incidence and degree . Narosa Publishing House BCA syllabus . (10 Hours) UNIT 3 : Coloring of a Graph .Distance and centers in a Tree .Relationship between A.isolated vertex .Rooted and Binary Trees .Pendant Vertices in a Tree . India 40 BCA 332: GRAPH THEORY Total Teaching Hours: 45 UNIT 1: Definition of a graph-finite and infinite graphs .Path Matrix – Adjacency Matrix.Matrices A. Incidence Matrix A – Circuit Matrix B – Fundamental Circuit Matrix – Cut Set Matrix C .disconnected graphs .pendant vertex – null graph .sum of degrees equals twice the no.

S. S. India 41 BCA 333: CORPORATE ACCOUNTANCY Total Teaching Hours: 45 UNIT 1: INTRODUCTION Meaning – accounting Principles. Himalaya Publishing House 2.double entry system of accounting – Journal – Subsidiary books – Four phases of Accounting (05 Hours) UNIT 2: LEDGERING Ledger – Posting – Trial Balance (05 Hours) UNIT 3: CASH BOOK Three Columns of Cash Book – Bank reconciliation. Raman: “Financial Management”. Ashok Banerjee & K M Bansal : “ Introduction to Accounting” BCA syllabus . T P Ghosh . T. S Grewal : “ Introduction to Accounting” 2. K Gupta “ Introduction to Accounting” 3. B. Jain & Narang: “Financial Management”.Purpose of Bank reconciliation (10 Hours) UNIT 4: DEPRECIATION ACCOUNTING Meaning of depreciation – depreciation methods – straight line method – reducing Balance method – depreciation fund – Annuity method (10 Hours) UNIT 5: FINAL ACCOUNTS Meaning – Trading account – Profit and Loss Account – Balance Sheets – Adjustments – Prepaid Expenses – Outstanding expense & income – Income received in advance – depreciation – bad debts – reserve for bad debts – reserve for discounts on debtors – reserve for discount on creditors – Interest on capital and drawing (15 Hours) TEXT BOOK: 1. United Publication REFERENCE BOOKS: 1.Christ University. Bangalore. N Maheswary and S.

Christ University, Bangalore, India


Total Teaching Hours: 45 UNIT 1: The Product: - Evolution of software, Characteristics of software, software applications Components of software, Software myths, Software problems, Software reuse. (03 Hours) UNIT 2: The Process: - Definition of Software engineering, Software engineering models: Waterfall, Prototyping, Spiral, RAD and 4GT. (Latest life cycle models can be discussed) (06 Hours) UNIT 3: Project Management and Planning: Management Spectrum – People, Product, Process and Project. Metrics: Measures, Metrics and indicators. Types of metrics: Size oriented, Function-oriented metrics and metrics for software quality. Resources: Human, Hardware and software resources. Software Project Estimation: – Decomposition technique: LOC based Estimation, Empirical Estimation: COCOMO model. Risk Management: – Risk Identification, Risk Analysis, Risk Projection, Risk assessment and Risk Prioritization, Risk Resolution, Risk monitoring and Control. Project Scheduling: Work tasks, Time line charts and CPM. Software Quality Assurance: Quality, Formal Technical review and Software Reliability. Software Configuration Management: Baselines, SCM items and the SCM process. (15 Hours) UNIT 4: Analysis concepts and principles: - Analysis principles, Prototyping, Software Requirement Specification (SRS). (04 Hours) UNIT 5: Analysis Modeling: - Data modeling, Data flow diagram (DFD) and Structured Analysis. (04 Hours) UNIT 6: Design concepts and principles: - Design process, Design principles, Design concepts and effective modular design. Design steps: Data design, Architectural design, Interface design and procedural design. (08 Hours) UNIT 7: Software testing: - Unit testing, Integration testing, System testing, acceptance testing. Black box and White box testing. (05 Hours) TEXT BOOK: 1. Roger S Pressman: “Software Engineering”, 4th edition REFERENCE BOOKS: 1. Ian Sommerville:“Software Engineering”, Pearson Education Asia, 6th Edition, 2002. 2. Pankaj Jalote, Narosa:“An Intergrated Approach to Software Engineering” Pub 1995 3. Carlo Ghezzi, Mehdi Jazeryeri and Dino Mandrioli: Fundamentals of SoftwareEng.
BCA syllabus

Christ University, Bangalore, India


Total Teaching Hours: 45 1. Introduction: Data, Database, Database management system, Characteristics of the database approach, Role of Database administrators, Role of Database Designers, End Users, Advantages of Using a DBMS and When not to use a DBMS. (04 hours) 2. DBMS Architecture: Data Models – Categories of data models, Schemas, Instances, and Database state. DBMS Architecture and Data Independence – The Three schema architecture, Data independence. DBMS Languages and Interfaces. Classifications of Database Management Systems. (04 hours) 3. Data Modeling Using Entity-Relationship Model: Using High Level Conceptual Data Models for Database Design, Example Database applications. Entity types, Entity Sets, Attributes and Keys. Relationships, Relationship types, Roles and Structural constraints. Weak Entity Types and Drawing E- R Diagrams. (04 hours) 4. Index Structures for Files: Single Level Ordered Indexes – Primary indexes, Clustering indexes and Secondary indexes. Multi-level indexes, Dynamic Multilevel indexes using B-trees (Introductory concepts). Hashing concepts. (06 hours) 5. Relational Data Model: Relation, Integrity constraints - domain, entity and Referential integrity constraints, Basic Relational Algebra operations, select, project and join operations. Functional dependencies and Normalization for Relational Databases - Normalization concepts, first, second, third normal forms, Boyce-Codd normal form. (09 hours) 6. SQL: Queries, sub queries, correlated sub query, views, updation of a database through views, Update, Delete. (03 hours) 7. Transaction Processing Concepts and Concurrency Control Techniques: Transaction and System concepts – Desirable properties of Transactions – Schedules and Recoverability. Lock-Based Protocols – Locks, Granting of Locks, and Two phase locking protocol and implementation of locking (05 hours) 8. Data Base Administration: Introduction to Database security issues, Discretionary Access Control Based on Granting/Revoking of Privileges and Multi-level security. (04 hours) 9. Distributed Databases: Distributed database concepts, Data fragmentation, Replication, and Allocation Techniques for Distributed database design, Types of Distributed database systems. Introduction to Advanced Database concepts – Brief introduction to Data warehousing and Data mining. (06 Hours)

BCA syllabus

Christ University, Bangalore, India


TEXT BOOKS: 1. Elmasri & Navathe, Fundamentals of Database Systems,2nd Edition, Addison – Wesley 2. Silberschatz, Korth, Sudarshan, “Database System Concepts”, 4th Edition, Mc Graw Hill REFERENCE BOOKS: 1. O`neil Patric & O`neil Elizabeth, Database Principles, Programming and Performance, 2nd Edition, Margon Kaufmann Publishers Inc.

BCA syllabus

precision(). (04 Hours) UNIT 5: Constructors and Destructors-Basic Concepts of constructors-Default constructor-Parameterized constructor-Multiple constructors in a class-Constructor with default arguments-Dynamic initialization of objects-Copy constructor-Dynamic constructors-Destructors.fill(). switch. identifiers. Function overloading. India 45 BCA 336: OBJECT ORIENTED PROGRAMMING USING C++ Total Teaching Hours: 45 UNIT 1: Introduction to Object Oriented Programming-Features of Procedure oriented programming-Basic Concepts of Object Oriented Programming-Benefits of OOP-Applications of OOP (02 Hours) UNIT 2: Introduction to C++ . nested if. constants. break and continue statements (07 Hours) UNIT 3: Functions-Introduction-Function Prototyping-Call by reference-Return by reference-Inline functions-Default arguments-Const arguments (02 Hours) UNIT 4: Classes and Objects-Introduction-Limitations of C structures-Defining a classClass Vs structures-Creating objects-Accessing class members-Defining member functions-Outside the class definition-Inside the class definition-Outside functions as inline-Nesting of member functions-Private member functions-Memory allocation for objects-Array of objects.keyword. if else. strings and operators. Bangalore. while do. (03 Hours) BCA syllabus . Tokens. (03 Hours) UNIT 6: Function and Operator overloading . (06 Hours) UNIT 7: Inheritance-Introduction-Defining derived classes-Types of inheritancesSingle-Making a private member inheritable-Multilevel inheritance-Multiple inheritanceHierarchical inheritance-Hybrid inheritance-Virtual base classes-Abstract classesConstructors in derived classes-Nesting of classes-Containership (05 Hours) UNIT 8: Virtual functions and Run time polymorphism-Introduction-Compile time and Runtime polymorphism-Pointers to objects-this pointer-Pointer to derived classesVirtual functions-Rules for virtual functions-Pure virtual functions (04 Hours) UNIT 9: Streams-C++ stream classes-put() and get() functions-getline() and write() functions-Overloading << and >> operators-Formatted Console I/O operations-ios class functions-width(). Basic data types-User defined data types-Dynamic initialization of variables-Reference variablesOperators in C++-Scope resolution operators-applications-Member dereferencing operators-Memory Management operators-new and delete.Comments-Output operator-Input operator-Cascading of I/O operators. Control Structures-simple if.Christ University. Friendly functions.Introduction-Rules for overloading operators-Defining operator overloading-Overloading Unary operators-Prefix and Postfix operators overloading-Overloading Binary operators-Overloading relational operatorsOverloading using friend functions-Overloading subscript operator.setf() and unsetf()-Formatting flags-Manipulators-User defined manipulators.

Pearson Education 3.Christ University. Bangalore. Function templates. BCA syllabus . Deitel and Deitel “C++ How to program”. Pearson Education Asia 2001. K R Venugopal “Mastering C++” Tata McGraw-Hill Publication. Bjarne Stroustrup “The C++ Programming Language” Special Edition.tellg() and tellp()-Error handling during file operations-Command line arguments. 2. Tata McGraw Hill Publication. (06 Hours) UNIT 11: Templates – Generic programming. Class templates. 2001 REFERENCE BOOKS: 1. Class templates with multiple parameters. 2006. Overloading of template functions (03 hours) TEXT BOOK: E Balaguruswamy “Object oriented programming with C++” Fifth Edition.seekp(). India 46 UNIT 10: Files-Introduction-Stream classes for files-Opening files using constructorOpening files using open()-File modes-Detecting end of file-eof()-Sequential input and output-put() and get()-Reading and writing objects-read() and write()-Random Access files-Manipulating file pointers-seekg(). Third Edition.

Aim : To learn about default arguments 3. Aim: To learn about constructor overloading 7. 15. Aim : To learn about Unary operator overloading 11. India 47 BCA 351: C++ LAB Guidelines: • The output of the programs should be neatly formatted. Aim : To learn about pass by value. Aim : To learn about Binary operator overloading 12. Aim : To learn about copy constructor 8. Aim : To learn about I/O Streams and database file creation and display BCA syllabus . Aim : To learn about classes and objects 5.) 18. Bangalore. • The source code should be indented • The programs need to be interactive • Data validations can be done wherever applicable • Include comments to improve the readability of the program • Use meaningful variable names 1. pass by reference and return by reference 4.Christ University. Aim: To learn about text file creation and manipulation (copy. Aim: To learn about multiple inheritance and hybrid inheritance 16. Aim : To learn about function overloading 2. Aim : To learn about dynamic memory allocation and deallocation(new and delete) using constructors and destructors. Aim : To learn about virtual functions 17. Aim : To learn about friend functions 10. Aim: To learn about simple and multi level inheritance. Aim : To learn about default constructors 6. merge etc. Aim : To learn about static functions 9. Aim : To learn about subscript operator overloading 13. 14.

b. g. Bangalore. f. c. c. SQL Functions a. c. Filtering Data Using Where a. SQL*Plus and SQL a. "<" & "=" Select with Minus Union and Intersect Handling NULL (04 Hours) 4. g.Christ University. India 48 BCA 352: ORACLE LAB Total: 60 Hours 1. e. Nesting Different Functions Decode Crosstab Decode with ">". e. h. d. b. The Concatenation Operator Elements of the SQL Query: Arithmetic Column Aliases String Functions Arithmetic Functions Date Functions Mixed Functions Operator precedence 3. Introduction Logging on to SQL*Plus and Leaving SQL*Plus Choosing and Describing Tables Elements of the SQL Query Editing SQL Statements The System Dummy Table Selecting Columns Duplicate Information (DISTINCT) Sorting Information (04 Hours) (04 Hours) 2. b. i. d. h. d. d. Advanced SQL Functions a. e. c. b. f. Where Operators Where with Keywords Where and Logical Operators Where and Soundex (04 Hours) BCA syllabus .

Retrieving Data from Multiple Tables a. d. c. d. f. Data Definition Language (DDL) a. Drop Alter Keywords Tables Column Views Synonyms Sequences Object Alter table (05 Hours) BCA syllabus . b. Sub-Queries Hours) a. e. Group By and Group By Functions a. f. Group Function with Having 7. c. Bangalore. Create. g. Group Function Examples b. h. India 49 (05 Hours) 5. b. Basic Subqueries Multiple Column Subqueries Subqueries with Having Correlated Subqueries (03 Hours) (04 8. d. e. b. Joining Tables (Equi-Joins) Aliases for Table Names Joining Tables (Non-Equi-Joins) Joining Tables (Outer Joins) Joining Tables (Inner Joins) Virtual table 6. c.Christ University.

Rollback and Savepoints) Locking tables (04 Hours) 12. c. f. d. Data Security Grant and Revoke Session control statements System control statements (02 Hours) 13. Introducing SQL*Plus for Reporting a. d. Using SQL*Plus SQL*Plus Command Variables Building SQL*Plus Reports Titles and Headings (02 Hours) . b. b. d. b. Indexes a. c.9. Create Index Unique Option When and What to Index Drop Index Validate Index Index Type Overview (02 Hours) 11. e. d. c. Types of Constraint Referential Integrity Defining Constraints Integrity Constraints and Data Dictionary Disabled constraints (03 Hours) 10. Data Manipulation Language (DML) a. e. Data Control Language (DCL) a. e. Insert Update Delete OPS Commands (Commit. c. b. b. d. Integrity Constraints a. c.

Bangalore. India 51 (14 Hours) 14. d.MPH Christ University. PL/SQL a. e. g. f. c. h. Variables and type declarations Loop structure PL/SQL language commands PL/SQL Blocks Cursor/ cursor loops PL/SQL tables Types of stored PL/SQL Blocks Exceptions BCA syllabus . b.

credit and status enquiries. Technical report. 2. Rajendra Pal and Korla Halli: “Essentials of Business Communication” Dr. sales letters. The student is trained in all areas of organizational communication. Urmila Rai and S M Rai: “Business Communication” BCA syllabus . UNIT 1: LETTER WRITING All types of Letters – both formal and informal Business Letters – enquiries and replies. Newspaper report and Performance report. Minutes and Resolutions of meetings (10 Hours) REFERENCE BOOKS: 1. complaints and adjustments. Bangalore. (25 Hours) UNIT 2: PREPARATION OF REPORTS Technical and Non Technical – Sales report.MPH Christ University. circular letters. India 52 BCA 431: TECHNICAL ENGLISH Total Teaching Hours: 45 The syllabus for this semester prepares the student in the application concepts of communication. collection letters. Agenda. (10 Hours) UNIT 3: Preparation of Notice. bank correspondence.

Sasthry S S : “ Numerical Analysis “ . India 53 BCA 432: NUMERICAL TECHNIQUES Total Teaching Hours: 45 UNIT 1: Solution of Algebraic and Transcendental equations .Bisection Method – Iteration Method – Method of False Position – Newton Raphson Method (10 Hours) UNIT 2: Finite Differences (Forward and Backward) – Newton’s Formulae for Interpolation – Lagrange’s Interpolation Formula – Numerical Differentiations & numerical integrations – Trapezoidal and Simpson’s rules (10 Hours) UNIT 3: Solution of Linear System of equations . Bangalore. BCA syllabus .Gauss Elimination Method – Modification of Gauss Method to compute the inverse – Iterative Methods (15 Hours) UNIT 4: Numerical Solution of ordinary differential equations – Taylor’s series – Picard’s method – Euler’s method – Modified Euler’s method – Runge Kutta Method (10 Hours) TEXT BOOK: 1.Matrix inversion method .PHI-India REFERENCE BOOK: 1. Iyengar & Jain : “ Numerical Methods for Scientific and Engineering Computations “ . Wiley Eastern India Ltd.MPH Christ University. Jain .

Himalaya Publishing House REFERENCE BOOKS: 1. I M Pandey : “ Financial Management ” BCA syllabus . Dr. Maheswari : “ Financial Management “ .MPH Christ University. (05 Hours) UNIT 2: CAPITAL BUDGETING Meaning – Importance – Process – Methods of Capital Budgeting – Payback Period – Accounting rate of return – Net Present Value – Internal Rate of Return – Profitability index – Capital rationing (10 Hours) UNIT 3: FINANCIAL STATEMENT ANALYSIS Comparative statement analysis – Ratio analysis – Meaning – Types of ratio’s – Liquidity ratio’s – Solvency ratio’s – Activity ratio’s – Profitability ratio’s (10 Hours) UNIT 4: FUND FLOW AND CASH FLOW ANALYSIS Meaning – Schedule of changes in working capital – Fund from operation – Statement of sources and Applications of fund – Cash from operation – Statement of sources and applications of cash (15 Hours) UNIT 5: COST VOLUME PROFIT ANALYSIS Marginal costing – B E P point – P / V ratio – Margin of safety – calculations (05 Hours) TEXT BOOK: 1. Sathyaprasad : “ Financial Management “ . S. K P Rustogi : “Fundamentals of Financial Management ” 3. Chand 2. N. Dr. India 54 BCA 433: FINANCIAL MANAGEMENT Total Teaching Hours: 45 UNIT 1: INTRODUCTION Meaning – Objectives of Financial Management – Time Value Money calculation – Financial market. R K Sharma & S K Gupta : “ Financial Management ” 2. Bangalore. S.

OSI Reference Model (08 Hours) UNIT 2: Analog and Digital Signals. Forouzan.21 interface .3 LANs. X. Data Encoding. EIA-202 and x. Sixth Edition.Connection-Oriented. LLC. Applications (06 Hours) UNIT 5:Principles of Internetworking. (06 Hours) UNIT 3: Multiplexing. “Data Communications and Networking”. Flow Control. Transmission Mode. Vikas Publishing House. QoS. 2. Layers. Architecture. 802. Andrew S. 2003. Link state routing. Classification of Networks. Message Switching. Network Devices (06 Hours) UNIT 6: Transport Layer services.Packet Layer Protocol. Frame Relay – Operation. TATA McGrow-Hill publications. RPC. Circuit Switching. William Stallings. Topology. IDS (Intrusion Detection system). (05 Hours) TEXT BOOK: 1. Token Ring. Second Edition. Shay. Session Layer Services. William A. Pearson Education Asia. “Computer Networks”. Error Detection and Correction. India 55 BCA 434: COMPUTER NETWORKS – I Total Teaching Hours: 45 UNIT 1: Introduction to Data Communication – Network Models. Firewalls.Tannenbaum. 2001. Packet Switching. Connectionless. (08 Hours) UNIT 4: ISDN. Standards Organizations. Ethernet. BCA syllabus .25 Layers . “Understanding Data Communication and Networks”.. LANs-Applications. Architecture. 2001. IEEE 802. Congestion Control. Internetworking. Broadband ISDN. Synchronous and Asynchronous transmission. Parallel and Serial Transmission DTE/DCE/such as EIA -449. Modems. Line Configuration. Guided Media. ISDN Layers. Performance. EIA-530. Second Edition. Routing Concepts. Tata McGrawHill Publishing Company Limited NewDelhi REFERENCE BOOKS: 1. Elements of Transport protocols. Connection Oriented and Connectionless Services. 3. Second Edition. Protocols and Architecture. (06 Hours) UNIT 7: Network Security Requirements and Attacks. “Data & Computer Communications”. ATM – Goals. Transmission Impairment. Unguided Media.MPH Christ University. Bangalore. Connection Management. Public Key Encryption and Digital Signatures. Behrouz A.6. Translation. Data Compression Techniques. HDLC. shortest Path routing. Routing Algorithms – Distance-vector routing.Interface standards. FDDI.

Breadth First Search and Traversal. Donald E. Average. Second Edition. pseudo code for insertion sort and analysis of time complexity. Pearson Education 2. Sum of Subsets problem using Back tracking algorithms. Behrouz A. India 56 BCA 435: ANALYSIS AND DESIGN OF ALGORITHMS Total Teaching Hours: 45 UNIT 1: Introduction-A simple example of design using insertion sort. and Strassen’s Matrix Multiplication (07 hours) UNIT 3: Greedy Algorithms – Introduction to Greedy Algorithms .MPH Christ University. Pearson Education 3. Best and Worst case complexity. Quick sort (Derivation of Average case analysis and Worst case analysis).Fractional Knapsack problem. “Data structures and Algorithms”. “The Art of Computer Programming” Volume 3. Performance Analysis – Space complexity and Time complexity (posteriori testing. Richard F. Binary Search (Derivation of average case analysis). Optimal Merge patterns and Single-Source Shortest Paths (07 hours) UNIT 4: Dynamic Programming – Definition . Gilberg. Traveling salesman problem and optimal parameterization for product of sequence of matrices (06 hours) UNIT 5: Back tracking and Branch and Bound Algorithms – Introduction . Sahni. Ω. Adjacency Lists. (06 hours) UNIT 2: Divide and Conquer Algorithms – Introduction to Divide and Conquer Algorithms . 1996 REFERENCE BOOKS 1. Θ). and apriori approach). Priority Queues using Heap and Design of Heap sort using Priority Queues (08 hours) UNIT 7: Lower bound Theory – A brief introduction to comparison trees and NP hard and NP complete problems (04 hours) TEXT BOOK: Horowitz. Minimum cost spanning trees Kruskal’s and Prim’s Algorithms. Donald E. Depth First Search and Traversal. Bangalore. Asymptotic Notations (O. Knuth. “Fundamentals of Computer Algorithms. Exponential Algorithms.NQueens Problem. Tata McGraw Hill 4. Knuth. “The Art of Computer Programming” Volume 1. Sorting and Searching. Rajasekaran. Polynomial vs. Forouzan “Data structures A Pseudocode approach with C” BCA syllabus . Third Edition.” Galgotia Publications. Traveling Salesman problem using branch and bound method (07 hours) UNIT 6: Graphs and Heaps – Definitions – Adjacency Matrix. fundamental algorithms. GAV PAI.Finding the Maximum and Minimum.All-pairs shortest paths.

(05 Hours) UNIT 6: Applets-Applet basics-Applet Architecture-Applet life cycle-Applet display methods-Repaint-Status window-passing parameters to applets-getDocumentBase() and getCodeBase()-AppletContext and showDocument(). Layout Managers and Menus – Control fundamentals-Labels-Buttons-CheckBoxes-CheckBoxGroup-ChoiceControl-ListsScrollBar-TextField-TextArea-LayoutManagers-MenuBars and Menus-DialogBoxesFileDialog.Creating a Multilevel HierarchyOrder of calling constructors-Method Overriding-Dynamic method dispatch-Abstract classes-Using final with Inheritance.Super class variable referring to a sub class-Applications of keyword super.History-Java and the Internet-Java Applets and ApplicationsFeatures of Java-Datatypes-Literals-Variables-Type conversion and casting-Arrays-one and Multi dimensional arrays-Operators-Arithmetic.Basics-Member Access and Inheritance.String Constructors-String length-String Literals-String Concatenation-String concatenation with other data types-String conversion and toString().String Comparison-Searching Strings. (04 Hours) UNIT 3: Inheritance . (08 Hours) UNIT 7: AWT-AWT classes-Window fundamentals-working with frame windowsCreating a frame window in an applet-Creating a windowed program-Displaying information within a window AWT Controls.Uncaught Exceptions .Event Handling-Event handling mechanisms-Delegation Event Model-Event classes-Sources of events-Event listener interfaces-Handling mouse and keyboard events-Adapter classes-Inner classes.Synchronization.Data Conversion and valueOf()-Changing the case of characters-String Buffer.Defining a packageCLASSPATH -Defining an Interface .io Package-I/O Basics-Reading console Input-Writing console outputPrintWriter class-Reading and Writing files-Java I/O classes and interfaces-File classStream classes-Byte Streams-Character Streams.Modifying a String.Handling events by extending AWT components.Multiple catch Nested Try . Multithreaded Programming . (04 Hours) UNIT 5: Java.MPH Christ University. India 57 BCA 436: PROGRAMMING IN JAVA Total Teaching Hours: 45 UNIT 1: Introduction . Classes and Objects .try and catch . (08 Hours) UNIT 4: Exceptions. throws and finally-Built-in Exceptions.The Java Thread Model. Packages and Interfaces .General form of a classCreating objects-Constructors-Parameterized constructors-Defining methods-Overloading methods-Returning a value-Returning an object-Recursion-Access control-Garbage collection-finalize() method-this keyword and instance variable hiding-Static variables and methods-Defining constants using final.Types .Implementing interfaces-Variables in interfacesExtending interfaces.throw.Character Extraction. Boolean logical.Thread Priorities. (08 Hours) UNIT 2: String Handling . Relational and Bitwise operators-Operator Precedence. Bangalore. (08 Hours) BCA syllabus .

“The Complete Reference. Herbert Schildt. India 58 TEXT BOOK: 1. Balagurusamy “Programming with JAVA a Primer”. Seventh Edition. E. Deitel and Deitel. Bangalore. “Java Programming”. Tata McGraw-Hill Publishing Company Limited: NewDelhi REFERENCE BOOK: 5.Java”. Prentice Hall 6. Tata McGrawHill Publishing Company Limited: NewDelhi BCA syllabus .MPH Christ University.

Aim: To Demonstrate Labels and Buttons with proper events 13. Aim : To demonstrate Lists and TextFields with proper events 16. Aim : To demonstrate Checkboxes with proper events 14. 2. BCA syllabus . Aim : To Demonstrate interfaces 4. Aim : To demonstrate inheritance 5. 18. Aim: Demonstrating the use of methods of Math class. Aim: To demonstrate Dialog boxes. 12.MPH Christ University. Aim : To demonstrate super and this 6. Aim : Programs to implement the methods of String class 3. Aim: To demonstrate MenuBars and Menus. Aim : To Demonstrate the creation of applets and passing parameters to applets 10. The source code should be indented The programs need to be interactive Data validations can be done wherever applicable Include comments to improve the readability of the program Use meaningful variable names 1. Aim : To demonstrate ScrollBars with proper events 17. Aim : To demonstrate CheckBoxGroups with proper events 15. Bangalore. Aim: To Demonstrate the creation of a frame. Aim : To demonstrate static variables and methods 7. Aim :To Demonstrate Mouse and Keyboard events in an applet 11. Aim : To demonstrate FileInputStream and FileOutput Stream Classes 9. Aim : To demonstrate Exceptions 8. India 59 BCA 451: JAVA PROGRAMMING LAB Guidelines: • • • • • • The output of the programs should be neatly formatted.

Bangalore. Students should be divided into batches.MPH Christ University. The practical examination carries 100 marks divided as follows: 1. Validation 3. Viva Voce 20 marks 10 marks 10 marks 10 marks Continuous Internal Assessment 50 marks BCA syllabus . India 60 BCA 452: DBMS PROJECT LAB Guidelines: • • • Students have to develop a mini project using Oracle as back end and any front end tool. Interface Design 2. Reports/Presentation 4. each batch containing not more than four students.

Gerson and Steven M. Types of Help. 3 rd edition. Adding graphics to paragraph formats. Graphics. Creating Hypertext and viewonly documents. Indexing (10 Hours) UNIT 4: Audience analyses and Document planning (02 Hours) UNIT 5: Principles of Technical writing (02 Hours) UNIT 6: RoboHELP -Introduction to RoboHELP : Help Basics. Using CSS. Linking and Navigation . Conditional Text. Anderson. Gerson. Header and Footer. Graphics.MPH Christ University. Science and Technical Writing-A manual of style. REFERENCES: 1. Master Pages. Technical Writing Process and Product. Browse Sequences. DDLC (05 Hours) UNIT 3: Document Design Book Design . 3. Color Models. Instruction Manuals. Build Tags. Highlighting and Emphasis. Templates . 2nd edition. 1995. Images. Technical Editing . Help System Components . Progress Reports . Oral Presentations.Text Formatting. Bangalore. Tables. 3rd Edition. Technical Writing .A Reader Centered Approach. Tables. Headings . Sharon J. Structured Framemaker . Proposals . Lists .2004.V. Creating Table of Contents and Indexes. BCA syllabus . Page Design . Report Format and Final Packaging. Context Sensitive Help (15 Hours) UNIT 7: FrameMaker -How to create FrameMaker Documents.Page Layout. 2. Business Plans . Special Notices.Text-only Pop-ups. India 61 BCA 531: PROFESSIONAL ENGLISH Total Teaching Hours: 45 UNIT 1: An Introduction to Technical Writing (01 Hours) UNIT 2: Applications of Technical Writing Technical Reports . 2004. Basic Steps in Creating a Help File. Inserting Images. Paul. User Guides. Philip Rubens.

Structure of a regular file – Directories .Creating files and directories Listing files and directories .Mounting and Un mounting file systems .File related commands Disk related commands .Changing directory and root .killing a process . C and Korn shells .MPH Christ University.Kernel Data Structures – Introduction to System Calls – Types of System Calls.Saving and Exiting .Dup .Removing files and directories . send. Text Editing with vi Editor: Different Modes .Background processes . mesg.changing process priorities .pipes . ftp.Cursor Movement Commands .Alphabetical List of Keys Communicating with Other Users: who.Operating System Services .Conversion of a path name to an inode Super block .Architecture of Unix .Edit Commands .File creation Creation of special files . (10 Hours) UNIT 4: UNIX SHELL COMMANDS & Utilities Types of shells – Features of Bourne.System Concepts .Allocation of disk blocks. Process Control: Process Creation – Signals – Process Termination – Invoking other programs – PID & PPID – Shell on a Shell.Inode assignment to a new file .Lseek – Close .scheduling of processes. mail. wall. (05 Hours) UNIT 2: THE UNIX FILE SYSTEM Inodes .I/O redirection and piping . System calls for the file System: Open – Read .stat and fstat . Bangalore. (10 Hours) BCA syllabus . India 62 BCA 532: UNIX OPERATING SYSTEM Total Teaching Hours: 45 UNIT 1: INTRODUCTION TO UNIX Evolution of UNIX – UNIX System Structure – Features of Unix .nohup command .Miscellaneous Commands .Unix Kernel .changing owner and mode .Link and Un link.File compression .Write .Layout of system memory Context of a process. (08 Hours) UNIT 3: UNIX PROCESS MANAGEMENT The Structure of Processes: Process States and Transitions .

NewDelhi.Used defined Functions – System Shell Script files: .Read and Echo .Exporting variables .NewDelhi BCA syllabus . “Unix Shells-Bourne-Korn-C”. Maurice J Bach.Positional parameters .Control Structures . 2.break and continue .history . BPB Publications. 1986.Passing command line arguments . Ltd. Yashavant P Kanetkar. (12 Hours) TEXT BOOKS: 1.Nested if .NewDelhi Vijay Mukhi.Case control structure – Loops . Etc. Bangalore.Arithmetic in shell scripts . 2. “Understanding Unix”. Stan-Kelly-Bootle. Prentice Hall of India Pvt.NewDelhi REFERENCE BOOKS: 1. BPB Publications.. “Unix Shell Programming”. India 63 UNIT 5: UNIX SHELL PROGRAMMING Shell variables . .Shell meta characters .Shell Keywords .profile.MPH Christ University. “The Design of Unix Operating System”.while-until –for .if-then-fi if-then-else-fi . BPB Publications.

area filling. Midpoint circle and DDA circle algorithm. line clipping: Cohen Sutherland line clipping. Liang barsky line clipping. display devices random scan and raster scan systems. India 64 BCA 533: COMPUTER GRAPHICS Total Teaching Hours: 45 UNIT 1. viewport. Fractals (07 Hours) UNIT 7: Three dimensional transformations: translation. polygon tables. Three dimensional display methods: Parallel projection(mathematical expression). Computer Graphics. 1996. three dimensional and stereoscopic views.A Programmers approach BCA syllabus . (04 Hours) UNIT 6: Polygon surfaces. rotation and scaling. octrees. surface rendering. Text clipping. color and intensity. window to viewport transformation. Bezier curves and properties. (08 Hours) UNIT 3: Two dimensional transformations: translation. Sweep representations. Practical applications of computer graphics. Matrix representations and homogeneous co-ordinates. polygon meshes. spline representations. Prentice Hall of India pvt ltd. (5 Hours) TEXT BOOK: D Hearn and Baker M P.MPH Christ University. BSP trees. plane equations. . rotation and scaling. Flat panel displays Display processors. Polygon clipping: Sutherland Hodgeman and Weiler-Atherton polygon clipping Algorithms. REFERENCE BOOKS: 1. visible line and surface identification. Computer Graphics. (10 Hours) UNIT 5: Three dimensional co-ordinate systems. composite transformations (06 Hours) UNIT 4: Concept of a window. Visible surface detection algorithms. Bangalore.Blobby objects . Principles of Interactive Computer Graphics 2. Harrington Steven. color CRT. line styles. W M Newman & Sproul R F. curved lines and surfaces. : Introduction to graphics. depth cueing. exploded and cutaway views. (05 Hours) UNIT 2: Points and lines: DDA and Bresenham’s line drawing algorithm. perspective projection(mathematical expression).

write a shell program which will a. Considering various allowances (TA. copy the file c. 3. 6. 2. 13. SECTION – B 11. Write a menu based program to permit or remove read/write/execute permission of a file. 10. Write Shell Scripts to compute the factorial value with and without using recursive functions. Write a Shell Script to convert a binary number to its decimal equivalent. check if the file is ordinary file and is readable c. display the file if the file is ordinary and readable d. Write a shell program to calculate the net salary of an employee in a particular month. delete the file e. a. exit 12. display an error message if the file is not ordinary and/or not readable BCA syllabus . File handling system. Write a shell program to find the largest of 3 numbers using command line arguments. Write a shell program to find sum of digits of a given number.MPH Christ University. Write a shell program to concatenate the contents of two files. Write a Shell Script to print the multiplication table. and HRA) and deductions (income tax) as: TA = 15 % of Basic salary DA = 2 % of Basic salary HRA = 10 % of Basic salary Income tax = 5% of salary PF = 10 % of salary 14. 4. Write a Shell Script to prepare and display the Electricity bill with significant considerations. 7. Write a shell program to remove the files of the same size in the current directory 9. Write a shell program to convert all lower case into upper case and vice versa in a file using command line arguments. 5. create a file b. 8. ask the user to enter a filename b. move the file d. 15. Bangalore. Students marks sheet processing. DA. Write a shell program to compare two strings given by the user. India 65 BCA 551: UNIX LAB SECTION – A 1.

Rotation of a triangle: (a) With respect to the origin. Horizontal histogram. Translation and scaling of a rectangle. Write a program to spiral. Circle using (a) DDA algorithm and (b) Midpoint circle algorithm 3.Man walking with an umbrella. Reflection of a circle: (a) With respect to the origin. Bangalore. 12. 6. 4. Shearing of a rectangle (a) With respect to x axis (b) With respect to y axis 8. Line using (a) DDA algorithm and (b) Bresenham’s algorithm 2. (b) With respect to a pivot point. SECTION-B 14. Implementation of Liang Barsky algorithm for line clipping.MPH Christ University. 11. Section-B . 9. 18. 7. Pie-chart. Bezier Curves. BCA syllabus . 16. India 66 BCA 552: COMPUTER GRAPHICS LAB Section-A . 15. (b) with respect to X-axis (c) with respect to Y-axis (d) With respect to the line Y=X. 10. 17. Animation. Scan-line area filling. cardioid. 13. SECTION-A 1. Implementation of Sutherland-Hodgeman polygon clipping algorithm.Programs are for execution. Write a program showing (a) line styles and (b) area filling. Flood fill algorithm. Vertical histogram. 5. Implementation of Cohen-Sutherland line clipping algorithm.Programs are for demonstration. four leaf and limacon.

Students should be divided into batches. Viva Voce 10 marks Continuous internal assessment 50 marks BCA syllabus . each batch containing not more than four students. Validation 10 marks 3. Interface Design 20 marks 2. Reports/Presentation 10 marks 4. The practical examination carries 100 marks divided as follows: 1.MPH Christ University. India 67 BCA 553: SPECIALIZATION PROJECT Guidelines: • • • Students have to develop a mini project related to the stream opted using suitable back end and any front end tool. Bangalore.

“Computer Networking. Primary and Backup RARP Servers. Resolution. MIME. “Computer Networks and Internets with Internet Applications”. (03 Hours) TEXT BOOK 1. OSPF. Fourth Edition. (08 Hours) UNIT 5: DNS – Basics. Cache & time outs. 2003 3. TFTP. “TCP/IP Illustrated” . Demultiplexing & Ports. 2000. Kurose and Ross. TELNET Protocol. Layering of communication process.A Top-Down Approach”. Operations. India 68 BCA 541A: TCP/IP Total Teaching Hours: 45 UNIT 1: Evolution of open Networks. Traceroute program. standardization. (07 Hours) UNIT 2: Link Layer Encapsulation. BCA syllabus . Pearson Education Asia. RTT Estimation. Comer. Process Model. VLSM. IMAP. SMTP – Protocol. 2002. TCP/IP Layering.MPH Christ University. Caching. Second Edition. Internet Addresses. (05 Hours) UNIT 6: FTP – Protocol. Third Edition. TCP Timers. 2001. REFERENCE BOOKS 1. Rlogin – Protocol. Volume 1. “Internetworking with TCP/IP Principles. Douglas E. Multicasting – IP Multicast Addresses. Protocols and Architectures”. Behrouz A. Datagram format. Routing IP Datagrams. TCP Connection Establishment and Termination. Sliding Windows. 2. DNS Message Format. Volume 1. “TCP/IP Protocol Suite”. TCP . IGMP. Pearson Education. IEEE & MACs. 4. Multiplexing. ARP – Operations. TATA Mc-Grow-Hill publications.Subnetting. Supernetting. Prentice Hall. Pearson Education Asia. Delayed Acknowledgement and Nagles Algorithm . NFS. First Edition. Loopback Interface (06 Hours) UNIT 3: IP Routing Principles. Richard Stevens. POP. 2001. RARP – Overview. HELLO. Forouzan. W. Comer. Maximum Datagram Size.Passive and Active Opens. Use of Multiple Headers. Douglas E. Bangalore. Physical addresses. Internetworking Concept and Architectural Model. (10 Hours) UNIT 4: UDP Header. IPV4 Vs IPV6. CIDR. RIP. (06 Hours) UNIT 7: IPV6 – Features. UDP Checksum. BGP.

and Java Script Events. linking and Addressing – URLs and Relative URLs. IRC (chat). JSP Scripting Elements: Expressions. else if. Tag Libraries and Predefined Variables..MPH Christ University. Scriptlets. Miscellaneous: Databases in JSP – JSP and SQL. Adding Depth and Texture. JSP Request Model. Selectors and Classes. VRML. Adding Intelligence to Clients Display. Web publishing. While loop. and Image Object. JSP Directives: JSP Page Directive and JSP Include Directive. (15 Hours) BCA syllabus . URLs. CGI. for. and W3C. Web Sites. and Declarations. FTP. (08 Hours) UNIT 5: Java Server Pages (JSP): Why JSP? JSP Architecture. (10 Hours) UNIT 3 : Introduction to Scripting Languages: Introduction to VBScript. HTML rules. Programming Language. Syntax Summary and Setting up a JSP Environment. Animation. Web Hosting and DNS. Windows and Frames – Java Script Objet Model. Domain Names. and Redirecting to an External Page. Common Tags. switch. BUTTON Element and Other Form Attributes. Form Controls – Text Controls. in loop.. Embedding Images and other Media Types in HTML. SGML. Java Script and HTML – The <SCRIPT> tag. Servers. Moving Elements – Determining Position and Positioning at Run-time. Protocols: TCP/IP. and XHTML HTML: Introduction to HTML.. <INPUT> tag. do. DHTML and Multimedia – Incorporating Images and Sound in Web Pages. Parents and Children. UML. Object-like Element <MARQUEE>. & HTTP (05 Hours) UNIT 2 : Introduction to Markup Languages: Markup Language vs. Tables. Bangalore. linking with <LINK> Element. Style Sheets. Browsers. JSP Actions: Beans. The Structure of HTML Document. Continue. Initializing a bean. and Python. and Search Engines. Web Pages. JSP tags. Sessions and Forms Processing – Loading a Bean. Frames and frame formatting. Cascading Style Sheets (CSS). GML. Functions and Java Script Objects. Control Structures – if. Variables. (07 Hours) UNIT 4: DHTML: Introduction to Dynamic HTML. XML. Scope of Bean. Java Script: Java Script’s role on the Web. Data Types and Operators. Displaying Dynamic Content. India 69 BCA 542A: INTERNET PROGRAMMING Total Teaching Hours: 45 UNIT 1 : Introduction to Internet: Internet and WWW. Java Script with CSS. With. Fonts. while loop. Window Object and its Methods. Embedding Binary Formats. JavaScript.. for loop. Introduction to HTML. Frames and Layers. Advanced Layouts – Text alignment. E-mail. Sending Email from JSP and Writing Comments in JSP. PERL.

4. 2002 BCA syllabus . India 70 TEXT BOOKS: 1. JavaScript The Definitive Guide. 2. by. Course Technologies Inc. Madhushree Ganguli.0. O’Reilly & Associates 1997 2. Tata McGraw-Hill Publications. Wiley Dreamtech India (P) Ltd.MPH Christ University. Tata McGraw-Hilll Publications. Tata McGraw-Hilll Publications. REFERENCE BOOKS: 1. Comprehensive Java Script . The Complete Reference. Bangalore. Web Warrior Series. David Flanagan. Thomas A. Powell. Dynamic HTML in Action. The Complete Reference. Michele Petrovsky.0. 1998. 3. JSP 2. HTML 4. Phil Hanna. JSP – A Beginner’s Guide. Don Gosselin.

Pearson Education Asia. FTP – Protocol. E-Commerce. IP. SMDS. Bangalore. HTTP. Archie. First Edition. TCP/IP Layering.TCP. 2. Second Edition. Comer. Gallo. High speed Ethernet. Harley Hahn. Needs and services of LAN. McGraw Hill International Edition. Gopher. ATM.MPH Christ University. TELNET Protocol. (12 Hours) UNIT 3: HIGH SPEED NETWORKS The need for High speed networks and quality of service. Physical addresses. Wireless LANS. Hand book of LAN technology. Rlogin – Protocol. Second Edition. Frame Relay. IMAP. 2002.1992 REFERENCE BOOKS 1. SONET. BCA syllabus . Application of Internet. Internet Infrastructure. 2. MIME. Designing a LAN. (8 Hours) UNIT 2: TCP/IP Evolution of open Networks. IPV6 – Features IPV4 Vs IPV6. India 71 BCA 541B: COMPUTER NETWORKS . ARP. The Internet Complete Reference. DNS. William Stallings. NFS. POP. TFTP. Storage Area Networks. Volume 1. Usenet. Internetworking with TCP/IP Principles. (05 Hours) TEXTBOOKS 1. IRC.11 (12 Hours) UNIT 4: INTERNET Internet – Introduction. OSPF. standardization. Douglas E. Second Edition. Internet Client & Server. 2002. VLAN. Protocols and Architectures. RARP . 2002. Pearson Education. Anonymous FTP. Subnetting. Paul J Fortier. High Speed networks and Internet. 2002. 3. Veronica. SMTP – Protocol. WWW. Thomson Brooks/Cole. Supernetting. IGMP. IEEE 802.II Total Teaching Hours: 45 UNIT 1: LAN Introduction to LAN. Evaluation of LAN. UDP . Trace route Program. Jughead. Internet Addresses. Michael A. Computer Communications and Networking Technologies. Web Security (08 Hours) UNIT 5: NETWORK CONVERGENCE Principles and applications of network convergence. Fourth Edition. RIP. Tata McGraw-Hill Publishing Company Limited.

Machine Language .Lexical Phase. “Introduction to System Software” . Overlays. Format of Databases.M. Tata McGraw-Hill.Dhamdere. Interpretation Phase. Addison –Wesley. General Machine Structure . Data Structures. Compilers Principles. Looping. 2. Systems Programming. “System Software. 1987 2. Design of Assembler. techniques and tools.Different phases. Assembly Language Program using Literals and pseudo -ops. Address modification using instruction as Data and Index registers. Data and Instructions. India 72 BCA 542B: SYSTEM SOFTWARE Total Teaching Hours: 45 UNIT 1: Introduction . Donovan.MPH Christ University. 1991 REFERENCE BOOK: 1. Algorithm (2-pass assembler) in brief with flowchart (10 Hours) UNIT 3: Macro Language and the Macro Processor: Macro instructions.Two-Pass macro processor with flowchart (08 Hours) UNIT 4: Loaders and Linkers: . Linking loaders. Syntax Phase.An introduction to systems programming” . McGraw-Hill Education. Pearson Education.Statement of Problem. Dynamic Binders. Optimization Phase. Code Generation Phase and Assembly phase. Bangalore. Leland L Beck. (07 Hours) UNIT 2: Assembler .General design procedure. D. Design of an Absolute Loader (10 Hours) UNIT 5 :Compilers . Passes of a Compiler with flow chart. Aho. Sethi & Ullman .Loader Schemes (i) Compile and Go Loader (ii) General Loader scheme (iii) Absolute Loaders (iv) Subroutine Linkages (v) Relocating Loaders (vi) Direct-Linking Loaders (vii) Binders. John J. 3rd Edition. Registers.2002 BCA syllabus .Memory. Storage Assignment Phase.What is System Software? Evolution of Components of a Programming System. (10 Hours) TEXT BOOK: 1. Features of Macro facility (i) Macro instruction argument (ii) Conditional Macro expansions (iii) Macro call within Macros Implementation.No Looping.

Types of systems study. Conditional transfer program control statement. India 73 BCA 631: SYSTEM SIMULATION Total Teaching Hours: 45 UNIT 1: Models: . Succession of events. Case study.1999 BCA syllabus . Sprite: Computer Aided Modeling and Simulation. Types of models. Gordon: “System Simulation” 2nd Edition. 2001. (12 Hours) UNIT 5: Continuous system simulation: . Simulation of programming tasks. Static and dynamic mathematical models. Measuring utilization and Occupancy. REFERENCE BOOKS: 1. Continuous and discrete systems modeling. 1982. Types of system simulation. 4. Stochastic activities. 3. System environment. Mc-Graw-Hill. Narsingh Deo. Numerical computation techniques for continuous and discrete models. Gathering statistics.Pure Pursuit problem. Bangalore.The concept of a system.MPH Christ University. Environment. Hybrid Simulation. Recording distribution and transient times. Gathering Statistics. Progress of a simulation study. (04 Hours) TEXT BOOK: 1. Interactive system real time simulation.Simulation of Inventory system. Experimental nature of simulation.Monte Carlo method. Choice of paths.Generation of arrival patterns.Continuous system model. (7 Hours) UNIT 3: Techniques of system simulation: . Jerry Banks: Discrete event System Simulation. Prentice-Hall of India. System simulation with Digital Computer. Payer: Introduction to Simulation. (08 Hours) UNIT 6: Introduction to GPSS: General description. Telephone system. design and postulation. Pearson educational International Series. comparison of simulation and analytical methods.Sub systems. (08 Hours) UNIT 4: Discrete system simulation: . Distributed lag models. Representation of time. (06 Hours) UNIT 2: System Studies: . study and use of one simulation language. Case study . 1982 2. discrete simulation languages. Academic Press. Waterfall simulation. Production and management segments.Discrete events. Facilities and storage. principles used in modeling. System analysis. 1990. Prentice Hall.

Switched Multiprocessors. Buffered versus Unreliable Primitives. Session layer. True Distributed Systems. Distributed Deadlock Prevention) (10 Hours) UNIT 4 : Processes and Processors in Distributed Systems: Introduction – Threads – (Introduction to Threads. Some Implications of ATM for Distributed Systems) – The Client-Server Model – (Client and Servers. Synchronous versus Asynchronous Systems. Transport layer. Real-Time Scheduling) (10 Hours) BCA syllabus .Layered Protocols – (Physical layer. Design Issues for Threads Packages. Network layer. Implementing the Client-Server Model) – Remote Procedure Call – (Basic RPC Operation. Implementing a Threads Package) – System Models – (The Workstation Model. A Token Ring Algorithm.Clock Synchronization – (Logical Clocks. An Example Client and Server. Real-Time Communication. Use of Synchronized Clocks) – Mutual Exclusion – (A Centralized Algorithm. ATM Switching. Concurrency Control) – Deadlocks in Distributed Systems – (Distributed Deadlock Detection.MPH Christ University. System Failures. India 74 BCA 641A: DISTRIBUTED SYSTEMS Total Teaching Hours: 45 UNIT 1: Introduction to Distributed Systems: Introduction – What is a Distributed System? – Goals – (Advantages of Distributed Systems over Centralized Systems. Reliability. Disadvantages of Distributed Systems) – Hardware Concepts – (Bus-Based Multiprocessors. Problem Areas) – Group Communication – (Introduction to Group Communication. Parameter Passing. A Distributed Algorithm. The Processor Pool Model. Multiprocessor Timesharing Systems) – Design Issues – (Transparency. Block versus Nonblocking Primitives. Design Issues. Use of Redundancy. Implementation Issues. Design Issues. A hybrid Model) – Processor Allocation – (Allocation Models. Threads Usage. A Comparison of the Three Algorithms) – Election Algorithms – (The Bully Algorithm. Presentation layer. Addressing. Data link layer. A Ring Algorithm) – Atomic Transactions – (Introduction to Atomic Transactions. Implementation Issues for Processor Allocation Algorithms) – Scheduling in Distributed Systems – Fault Tolerance – (Component Fault. ATM Layer. Advantages of Distributed System over Independent PCs. Fault Tolerance Using Active Replication. Clock Synchronization Algorithms. Using Idle Workstations. Flexibility. ATN Adaptation Layer. Physical Clocks. Application layer) – Asynchronous Transfer Mode Network – (What is Asynchronous Transfer Mode?. Design Issues for Processor Allocation Algorithms. Dynamic Binding. the Transaction Model. Bus-Based Multicomputers. Agreement in Fault Systems) – Real-Time Distributed Systems – (What is a Real-time System?. ATM Physical Layer. Performance. Group Communication is ISIS) (10 Hours) UNIT 3: Synchronization in Distributed Systems: Introduction -. RPC Semantics in the Presence of Failures. Implementation. Bangalore. Scalability) (08 Hours ) UNIT 2 : Communication in Distributed Systems : Introduction -. Switched Multicomputers) – Software Concepts – (Network Operating Systems.

. Multimedia) (07 Hours) TEXT BOOK: 1. The Directory Server Interface. 2001 2. Lessons Learned) – Trends in Distributed File Systems – (New Hardware. 2003 BCA syllabus . System Structure. Pearson Eduction Asia. Inc. And Multiprocessor Operating Systems. 2002 REFERENCE BOOKS: 1. Shivaratri G Niranjan. Bangalore. An Example: Sun’s Network File System. Semantics of File Sharing) -Distributed File System Implementation – (File Usage. Distributed Systems Principles and Paradigms. Replication. Scalability. Wide Area Networking. India 75 UNIT 5 : Distributed File Systems :Introduction – Distributed File System Design – (The File Service Interface. Fault Tolerance. Caching. Distributed Operating Systems. Advanced Concepts In Operating Systems Distributed Data Base. Prentice Hall of India.MPH Christ University. Tanenbaum S Andrew. Mobile Users. Singhal Mukesh. McGraw-Hill. Tanenbaum S Andrew.

Graphics. Text Compression – Static and Dynamic Huffman Coding. Hyper Text. BCA syllabus . Pearson Education.MPH Christ University. Fred. Tagged Image File Format (TIFF). Lossless and Lossy Compression. (05 Hours) UNIT 5: Video Compression: Principles. John Wily & Sons.personnel Communication. REFERENCE BOOKS: 1. Steinmaetz.261 Video Compression. Video – Broadcast Television. 2. Video Content. India 76 BCA 642A: MULTIMEDIA COMPUTING Total Teaching Hours: 45 UNIT 1: Multimedia Information Representation: Introduction. Digital Video. Digitised Pictures. 2001. “Digital Multimedia”. Entropy Encoding. Entertainment Applications and Multimedia Conferencing. JPEG. “Multimedia Communications – Applications. 2003. Pearson Education. Adaptive Predictive Coding and Linear Predictive Coding. PC Video. Text – Unformatted Text. Networks. Ralf and Nahrstedt. Bangalore. (07 Hours) UNIT 3: Image Compression: Graphics Interchange Format (GIF). MPEG 1. Digitised Documents. Chapman. Nigel and Chapman. (15 Hours) UNIT 2: Text Compression: Compression Principles – Source Encoder and Destination Decoder. Synthesized Audio. (05 Hours) TEXT BOOK: 1. Digitised Documents. H. CD – Quality Audio. MPEG Audio Coding. Halshall. Jenny. Arithmetic Coding. Source Encoding. Digitization Principles – Analog Signals. Interactive Applications over the Internet. Klara. Decoder Design. Encoder Design. Protocols and Standards”. Images. (06 Hours) UNIT 6: Multimedia Applications: Inter. Audio – PCM Speech. MPEG 2 and MPEG 4. 2000. Adaptive Differential PCM (ADPCM). Formatted Text. (07 Hours) UNIT 4: Audio Compression: Differential Pulse Coded Modulation (DPCM). Multimedia : “Comunications and Applications”.

1990. Calculation of execution time for a program with examples (06 Hours) UNIT 4: Introduction to 8085 programming – Instructions – Classification. Stack.5.Hall “Microprocessor and Digital System”. PC. Ramesh. Architecture. Address/Data Buffers (08 Hours) UNIT 3: 8085 Machine cycles and bus Timings – Opcode Fetch Machine cycle. SIM and RIM instructions. 6. 1990.Goankar “Microprocessor Architecture. PHI. D. Software and Interface Techniques”. Timing analysis. Timing diagram. Serial I/O Control. Externally initiated signals. Bangalore. McGraw Hill Publishing Company. Control & status signals. RST 7.5 – RST. Power supply and Frequency signals. ISBN 81-224-0710-2 REFERENCE BOOKS 1. Programming Techniques. Tata McGraw Hill. 2. Interrupt Control Unit. (13 Hours) UNIT 5: Sample Programs – Add/Sub of 8 bit data – Hex-BCD conversion – Interchanging a block of data – Largest of N numbers – Number of One’s& Zero’s in a 8-bit data – Look-up Table – Sum of Odd and Even Terms – Displaying BCA. Avatar Singh and Walter A. 5. Addressing Modes. TRAP. Subroutines. Ajit Pal “Microprocessor Principles and Applications”. Programming & Applications With 8085/8080a” – Penram International – 1997.Introduction – Vectored Interrupts and Locations -.Tribel “16 Bit Microprocessor. (07 Hours) UNIT 6: Interrupts -. Instruction Decoder. Timing and Control Unit.MPH Christ University. Format. BCA syllabus . Flags.5. 1985. Delays. ALU. I/ O/Memory Read/Write Machine cycles.V. Data Bus.INTR. India 77 BCA 641B: MICROPROCESSORS Total Teaching Hours: 45 UNIT 1 : Introduction to Microprocessor 8085 –Signals -Address Bus. serial I/O ports (06 Hours) UNIT 2 : Architecture of 8085 MPU – Registers. (05 Hours) TEXT BOOK 1.S. 3.

Cache operation) – Associative Memory—Structure versus Performance. Bangalore. BCA syllabus . (20 Hours) TEXT BOOK 1. Prentice Hall. Fourth Edition. P. Memory Interleaving) – Serial Access Memories – (Access Methods. Memory Retention) – Random Access Memory – (Organization. RAM Design. 1986 BCA 642B: COMPUTER ARCHITECTURE Total Teaching Hours: 45 UNIT 1: Introduction – Basic Model of a Computer – Computer Components – Computer Function – Cycles – (Fetch & Execute Cycles) – Example of Program Execution. Semiconductor RAM. Access Modes. Base Addressing) – Cache – (Main Features. (10 Hours) UNIT 4: Memory Organization – Memory Technology – Memory Device Characteristics – (Memory Types. Yu. Performance & Cost. Memory Organization.Division by Repeated Multiplication – ALU Design – (Combinational and Sequential ALU). Address Translation. Stalling. Hayes. Addressing Modes. John.” Microcomputer System. Williams. & Biasing. Normalization. Error Detection & Correction) – Signed Numbers – Exception Conditions – Floating Point Numbers -. International Editions. “Computer Organization and Architecture”. Locality of Reference. Optical Memories) – Memory Systems – Multilevel Memories – (General Characteristics. Cache Organization. India 78 4. Tags. 2nd Edition. 8086/8088 Family”. Magnetic Surface Recording. Overflow. Standards) – Instruction Set -(Instruction Format.Cheng Liu & Glenn A Gibson.MPH Christ University. Virtual Memory. PHI. Relative Addressing) – Instruction Type – (Completeness) – Programming Considerations – (Assembly language) (10 Hours) UNIT 3: Data Path Design – Floating Point Arithmetic – (Adder.(Basic Formats. (05 Hours) UNIT 2 : Processor Design – CPU Organization – Fundamentals – User and Supervisor Modes – CPU Operation – Instruction Set – Data Representation – Basic Format – (Word length. Subtractor. Magnetic Disk Memories. REFERENCE BOOK 1. Carry Look Ahead Adder) – Multiplication – (Two’s Compliment Arithmetic) -. “Computer Architecture and Organization” Third Edition – McGraw-Hill.

Validation 3. Bangalore. any tool available within the college. Reports/Presentation 4. each batch containing not more than two students. India 79 BCA 651: MAIN PROJECT Guidelines: • Students have to develop a project using any package. Viva Voce 40 marks 20 marks 20 marks 20 marks • • BCA syllabus . The CIA marks can be awarded by the guide by evaluating the performance of the student during the course of the project work Students should be divided into batches. Project can be implemented live but need to be demonstrated at the time of examination. Interface Design 2.MPH Christ University. The End semester practical examination carries 100 marks divided as follows: 1.

MPH Christ University. India 80 CERTIFICATE COURSES OFFERED BY DEPT OF BCA BCA syllabus . Bangalore.

3 Request-Response Architecture 3.1 Bean Developer Kit (BDK) 1. Servlets (08 Hours) (06 Hours) (12 Hours) 3.6 Servlet Persistence and Session Tracking – Persistence in a Stateless Architecture. Multithreading Issues.MPH Christ University. JDBC 2. OO concepts and Knowledge of database. India 81 CERTIFICATE COURSE ON J2EE Hours: 60 (Theory: 25 + Practical 25 + 10 Project) Credits: 02 Prerequisite: Knowledge of Core Java.4 The Java Beans API 2.2 Web Container and Servlet lifecycle 3. Bangalore.1 Architecture and Concepts Basic Servlet Concepts and Examples 3.1 JDBC Basics and Driver Types 2. Session Tracking API BCA syllabus .3 Metadata Classes 2. HTTP GET and POST. 1. Error handling 3. Introduction to Cookies. Sessions with Cookies.2 Prepared and Callable Statements 2.5 Servlet Resources – Servlet Context and Scope.3 Developing a Simple Bean Using the BDK 1.4 SQL and Java Data Types 3.2 JAR Files 1.4 Mapping and Running Servlets 3. Java Beans 1.

2 EJB Architecture 5. India 82 4.5 Custom Tag libs 4.4 Implicit JSP Objects and Scopes 4. Java & XML 6. Java Server Pages (10 Hours) 4.1 Understanding XML and the Java XML APIs 6.2 JSP Lifecycle 4.3 XML and the Document Object Model (DOM) 6.6 JSP .MPH Christ University. Forwarding Requests and Responses 5.4 Using XSLT (06 Hours) (18 Hours) BCA syllabus .3 EJB Components 5. Bangalore.1 Architecture and Concepts JSP Concepts and Motivation 4. EJBs: Architecture and Concepts 5.Servlet Communication – Communication based on JavaBeans.1 Enterprise Java Beans 5.3 JSP Tags and Constructs 4.2 Serial Access with the Simple API for XML (SAX) 6.4 Session and Entity Beans 6.

8 The management process a) Metrics in Software Development b) Quality management systems c) Process change management 2.9.6 Phases in software development life cycle 1.MPH Christ University.8.8.1 Top down approach versus bottom up approach 2.2 The birth of software engineering 1. Bangalore.9 Types of testing 2.4 Beta testing 2.1 Unit testing 2.6 Performance testing Levels of testing 2.4 Criteria of a successful software project 1.5 Field trail 2.9.4 Regression testing 2.9.8 Acceptance testing BCA syllabus .7.4 Cost of quality 2.2 White box testing 2.3 Why software engineering? 1.4 Acceptance testing 2.7.7 Software development lifecycle models 1.5 Characteristics of test engineers 2. Software Quality Assurance: An Overview: (02 Hours) 1.6 Why testing is difficult? Stress testing 2.2 Functional versus Structural testing 2.3 Mutation testing 2.3 Gorilla testing 2.1 Black box testing 2.2 Verification and validation 2.8 Testing approaches 2. Software Testing Process (01 Hour) 2.1 Software Crisis 1.9.5 Process oriented software development 1.9.3 Integration and system testing 2.7. India 83 CERTIFICATE COURSE ON TESTING TOOLS Hours: 60 (Theory: 25 + Practical 25 + 10 Project) Credits: 02 1.3 Testing team and development team 2.2 Module testing 2.9.1 Psychology of testing 2. Synchronizing the Test cases 4.3 Test plan format 2.3.1 Need for Automated testing tools Test execution 5.3. Software Testing Tools: Overview 3.11 Criteria for completion of testing 2.5 Synchronization of test cases 4.1 Overview of Win runner 4.1 When is testing complete? 2.2 Test planning 5.7 How to select a testing tool 4.1 Converting test case to data driven test GUI MAP File 4.10 Test plan 2.5 Testing Management tools 3. Bangalore.11.9 Checking GUI objects 4.3 Managing test process using Test director 5.2 Checking a single object 4.2 Calling test cases using "call "function 4.4 Test results analysis 5.3 Test script Language(TSL) 4..2 Classification of defects 3. Win runner (01 Hour) (16 Hours) 4.MPH Christ University.1 Creating a new project 5. India 84 2.4 Tracking defects BCA syllabus .2 Taxonomy of testing tools 3.2 Test management process 5.2.1 Creating a test case 4.3checking for multiple objects 5 TEST DIRECTOR (10 Hours) 5.6 Source Code Testing tools 3.6 Data DRIVEN TESTING 4.2 Testing an application using Win runner Test cases 2.1 Test director Overview 5.4 Performance Testing tools Rapid test script wizard 4.1 Test requirements management 5.9.1 Checking a single property 4.2 Creating the test plan 5.1 Test oracles 2.3 Running the automated test 5.8 Mapping custom objects to standard class 4.5.3 Functional/Regression testing tools 3.1 Recording test cases 4.

3.org www.S.autotester.V. Testing computer software Author: Comdex INTERNET RESOURCES: www.5 Checkpoints 7. SOFTWARE TESTING TOOLS: Author:: Dr.2 Testing database application using synchronization and check points 8.Pressman REFERNCE BOOKS: 1.qajobs. SILK TEST 8 Quick Test Professional (QTP) (10 Hours) 8.fsf.com www.1 Recording test cases 6.3 Testing an application using Silk test 7.com www.1 Overview of QTP 8.1 Overview of SQA Robot 6.com www.4 The 4test scripting language 7.com www.softwaretestinginstitute. India 85 (10 Hours) 6.4 Data driven testing 8.1 Creating check points 8.MPH Christ University.2 Testing an application using QTP 8. mercury interactive.2 Running a test case 8.2.2 Architecture of Silk test 7.3 Synchronization of test procedures 6.rational.4 Creating Checkpoints (10 Hours) 7. Software Engineering :A practitioner's approach: Author: Roger.2.K. The art of software testing.2.2.com www.SQA ROBOT 7.1 Recording a test case 8. pub: dreamtech press 2.PRASAD.sei.2 testing an application using SQA Robot 6.6 Data driven Test cases 6 ..2 Running the test procedure 6.2.5 Testing a web application PROJECT WORK TEXT BOOKS: 1.1 Overview of silk test 7. Author: G.3 Calling the test procedure using "call procedure" function 6.qaforums.Meyer Pub: john wiley &sons 2.net www.com www.K. Bangalore.cmu.3 Synchronization of test cases 8.edu BCA syllabus .3.segue.

Net Need for visual basic . India 86 CERTIFICATE COURSE ON .Net Introduction to Visual Basic . Introduction to Visual Basic . Bangalore.MPH Christ University. Programming in Visual Studio . OOPs in Visual Basic .Net System requirements and installation 2.Net Understanding .Net Introduction to object-Oriented Programming Classes and Objects Features of OOPs Creating Classes BCA syllabus .Net IDE Introduction to windows and web forms Visual Studio.Net Introduction to forms 3.Net 1.Net Interface Event Driven Programming Writing a simple applications using Visual Basic .Net Programming in Visual Studio .NET TECHNOLOGIES Hours : 60 ( 25 Theory : 25 + Practical 25 + 10 Project ) Credits: 02 Prerequisite: Knowledge of Programming. Basics of Database A) Visual Basic .Net The Architecture of VB. Writing Procedures Introduction to procedures Types of procedures Calling procedures Argument passing Mechanisms Scope of variables Useful Built-in functions 5.Net solutions and projects The Visual Studio .Net Features of VB. Programming Concepts Introduction to variables Types of variables Type conversion Constants and enumerations Operators Statements Arrays 4.Net framework Features of .

NET Introduction to Data Access Overview of ADO. Exception Handling Introduction to Exceptions Unstructured error handling using On error Statement Err Object Structured Exception Handling Using Try Catch Finally Statements User Defined Exceptions 8.MPH Christ University. India 87 Creating Fields and Methods of Classes Constructors and Destructors Creating Property Procedures Creating Events Namespaces Imports Keywords 6.NET Using Visual Tools for Data Access Data Form Wizard BCA syllabus . Working with Forms Inheritance in Windows Forms Loading and showing Forms Visual Inheritance Adding Controls Layout Enhancement properties of controls Working with simple controls Adding Menus Context Menus 9. polymorphism and Interfaces Inheritance Overriding Methods and Properties MyBase Keyword MyClass Keyword Abstract Base Classes Shared Members Polymorphism Interfaces 7.NET Architecture ADO. Advanced Windows Applications Advanced controls Creating MDI Applications Graphical Applications Custom Windows Control Delegates 10.NET ADO. Bangalore. Inheritance. Data Access Using ADO.NET Components Using ADO.

Christ University, Bangalore, India


11. Components and Interoperability Introduction to components Creating Components Cross-Language interoperability COM interoperability PROJECT WORK

1. Getting Started with ASP.NET Introduction to ASP.NET ASP.NET and The .NET Framework Characteristics of ASP.NET Comparison of ASP and ASP.NET 2. ASP.NET Pages A simple ASP.NET application Web forms code declaration block code render block page directives view state writing ASP.NET and HTML code Common Language Runtime and ASP.NET Intermediate Language Execution Processing Assemblies Side-by-side execution 3. Working with basic web controls Working with basic web controls Working with basic label controls Working with basic TextBox controls Working with basic button controls Page Navigation Working with Radio button, checkbox controls Dropdown list , image control Controlling visibility of content Formatting Web Controls Applying CSS to WEB Controls 4. Advanced ASP.NET Controls Controls- panel , Place Holder, AdRotator, calendar Validating client data ASP.NET Validation Controls Disabling validations

BCA syllabus

Christ University, Bangalore, India


5. Runtime Programming with Controls Multiple Forms Adding Controls at runtime Dynamically Generating Forms Dynamically Generating List items 6. Data Access Overview of ADO.NET Common database tasks Binding data – Repeater Control List Control Miscellaneous Controls Advanced Data Controls Binding Data to Datalist Control Binding Data to a Datagrid Control 7. Advanced Data Access Introduction to Datasets Elements of Datasets Using a Dataset in an ASP.NET Page Updating Records in a Data Table Working with DataViews Caching DataSets Using .NET XML Classes in ASP.NET 8. ASP.NET Applications Introduction to ASP.NET Applications Using Global Application File Configuring ASP.NET Applications Overview of Web.Config File HTTP Handlers and Modules Deploying ASP.NET Applications 9. ASP.NET Sessions Web Forms State Management Cookies Session State Session Events Cookies less Sessions 10. Securing Applications Introduction Authentication Services Forms Authentication Windows Authentication Configuring IIS Configuring Windows Security

BCA syllabus

Christ University, Bangalore, India


11. WEB Services Introduction to Web Services Architecture Features and Benefits Web Services Contracts Creating a Web Service Creating a client web application Data-driven web services Interacting with a web site 12. Custom Controls Need for Custom controls Creating a simple custom controls Control class Hierarchy Adding properties and methods Control events Handling postbacks Composite controls PROJECT WORK

BCA syllabus

DHTML Part B  Dream weaver and Asp BCA syllabus . Animation and modeling. India 91 UGC approved Job oriented Certificate Course WEB PAGE DESIGNING. MULTIMEIDA & 3D ANIMATION Industry standard Professional Certificate courses on multimedia packages which prepares the student to handle the industry requirements and get a good job and knowledge which they can incorporate in his/her academic projects also.MPH Christ University. The course is divided into 3 modules which covers all the aspect of web page designing. Bangalore. Level I : Part A  Adobe Photoshop CS3 Part B  Autodesk 3DStudio Max 2008 Level II : Part A  Adobe Flash CS3 with Action Script Programming Part B  Autodesk MAYA Level III : Part A  Basics of Internet and HTML.

Painting ( Brush. Optimizing Images for Web. Creating and Recording Actions. File Formats. Color. Cleanup). Selection . Layout Preview. color correction . Palettes. Masks . Bangalore. Touchup . Saving . Labels. 3rd party Plug-ins. Vanishing point . Topic NO 1 Introduction BasicConcepts of Designing Theoritical Concepts og Designing . Blending Modes. website content development Project Total 5 5 5 5 5 5 5 5 45 Hours Level I : Part B Hours : 45 BCA syllabus . Creating Posters . Filter Gallery . Using predefined Actions. Built in Bitmap Filters . Marquee. Liquefy . Understanding Image Size and Resolution . Coping Selection And Image.Editing( Background . Editing layers. color theory Introduction to Photoshop. Crop tool . Channel . Color Separation . Photoshop Menus. Resolution . Advertisement . and its effects ). Working with 3D layers Animation Panoramic Picture creation Using 3rd party palings Assignment : Black and white to color conversion. Color palettes . India 92 Level I : Part A Adobe Photoshop CS3 Sl. Painting and editing Working with quick masks . Automation Extract . Adjustment layers. Actions . Greeting card . Selection Tools. Grid and Guide Options. web photo galleries . CD covers . Using built in automation Preparing Image For Print and Web Calculating Image size and Resolution . Lasso . Grid and Guides Modifying Image Size . Selecting. Bitmap and Vector Images . Pattern making . Photoshop Tools. Magic Wand . photo manipulation . Color Theory. layouts. Changing Image Dimensions. Hours : 45 No of hours 5 2 3 4 5 6 7 8 9 Image size. Changing and controlling layer order. Creating WebPages . Layers The layer Palette. Layer Effects Filters .MPH Christ University. Photoshop color Modes.

bevel. creating user shortcut keys Standard primitives . constraints: hinge. dice Asics. keing . subdivision. spline ik skinning skin tools Morpher Auto key. spectacle Bone tools. rope. weld. import . bridge. connect. spline (shape). flip Assign : hammer model. outline. create . attach. interior advance Exterior advance Video post Particle Reactor Project 4 5 6 7 8 9 10 Rendering Dynamics Level II : Part A Hours : 45 BCA syllabus . India 93 40 Tools covered Navigation tool. hi solver. Boolean . angle align Scatter. chamfer. loft . out of range Basic editing . refine. cannon ball bounce Curve editor . shape merge Concepts . water. attach. point to point spring Total Hours Autodesk 3DStudio Max 2008 hours Sl. Assign : Pen . HDRI lighting Render tabs Glow. Set key Assign : Rubber ball . linking . car paint . Translation & tools Compound objects Poly modeling 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 5 45 Hours Spline 3 Rigging Foot ik Quadruped rig Skinning Vechile rig Facial rig Animation Automated Ball bouncing Walk cycle Run cycle Character Biped studio Texturing Material Lighting Lights & camera 3 point lighting interior basic Exterior basic . customizing max. rendering . outline. Assign : Walking on the stair case Basic material. Bangalore. spray. Module Topic No 1 UI User Interface Hrs 2 2 Modeling Geometry creation . quick slice. snap. UFO Character Modeling Subobject . break. pcloud. rim light Sky light . light tracer. rigidbody. map shadow Area light. extended primitives . cut. file open . trim. input video Parry. incremental save . hierarchy. attenuation.MPH Christ University. Boolean. Orthographic . final gather GI . fill light. divide. flare . free form animation and editing them. perspective views. detach . simple house. view port .superarray. multiplier . extrude. assigning material UVW mapping Unwrapping Uv mapping. crome . PFsource (basic) Cloth. palette. autobackup. normal mapping Creating glass. mental ray. connect.

quiz. creating & editing layers layers . guides context menu . slide shows. buttons Working with color . customizing the shortcuts. motion tweening . adding interactivity . Bangalore. 3 Animation Creating animation . linking pages . edit sound. interactive presentation . tweening cell animation . editing timeline effects . adding audio. motion basics . accessible content . color. usage of layers . text. Topics Hours : 45 Tools covered Hrs BCA syllabus . Module Tools covered No 1 Introduction Concepts of 2D animation . grid . learning tools to draw 2D drawings Time line & Concept of animation . adding video .MPH Christ University. importing and video modifying flash video . layer folders 2 Graphic Symbols. 9 Scripting Action script (programming ) 10 Project Interactive games . Tool box. graphics. frame by frame . 7 Exercise Creating advertisement. text animation. sound adding sound to button 5 Working with Creating and publishing flash video . gradient . timeline . Photo shows. presentation Total Hours 2 2 2 2 2 10 8 45 Hours LEVEL II : Part B Autodesk MAYA Sl. creating guide layers . encoding video 6 Movieclips Creating complicated animations Creating e-learning contents . ruler . Motion Shape tweening. Shape & Using time line effects . working with scene . non-interactive. library Tools & Stage Using and setting stage size . movieclips. adding sound to timeline . 4 Working with Importing sound . Mobile contents 8 Flash for web Creating Flash websites . India 94 40 Hrs 3 3 2 2 2 5 Adobe Flash CS3 with Action Script Programming hours Sl. Drawing User Interface Scene.

water falls . creating a camera. 2 deformers (clusters and blend shapes). extrude vertex. duplicate face. motion path animation. command line . Modeling a cartoon character. attach. smooth. batch render setup. extrude face. rocket and landscape using 5 particle systems to animate. Overview of Software. merger verticies. help line. control vertex. Walkthroughs of house hours & architectural buildings Total 45 Hours : 45 Hours : 45 . duplicating surface curve. Intersect surface. null) perspective and orthographic views. rendering from a specific camera. smoke insects etc Modeling a bottle. DHTML. and vector engine. fill hole. India 95 No 1 Introduction and user interface 2 Working with 3D space Polygon modeling tools Polygon modeling (organic) NURBS modeling tools NURBS modeling (inorganic) Hypershade 3 4 5 Customizing maya interface . creating cinematic effects. sculpt polygon tool. extrude . extract. mirror geometry. toolbox. face. bevel plus. loft. fire . 2 Animation constraints (point. JavaScript ) LEVEL III : Part A BCA syllabus Surface normals. smooth proxy. attribute editor. Texturing mapping (planar. applying a file texture to a material. 8 animating a camera along a path Special effects with dynamics . orient and pole vector). Bangalore. open and close curves. shelf and shelf editor . and merge multiple edges CV curves and EP curves . circular fillet. revolve . separate. construction history Create polygon tool. attach and detach surfaces. Creating a new material (lambert. basic face rig setup) Keyframe animation. three point light setup. rendering Render engine Character setup 9 10 11 Animation & Dynamics 12 Project LEVEL III : Part A Concepts of Internet ( HTML. Rigging a cartoon character( classic reverse foot. joints and IK handle. Modeling a bike. Booleans. trim tool. flower pots .bevel. isoparm. working with text. transformation tools. and detach .MPH Christ University. curves. Camera . combine. spherical and cylindrical). bevel edge. raytracing reflections Introduction to digital lights. project curves on surface 2 2 2 8 2 6 7 8 8 Lighting . depth map shadows and 2 ray trace shadow. editing preferences 3D primitives and their components ( vertex . adjusting render quality and resolution. simple spine and arm setup. extrude edge. round tool. crackers. hardware. 2 blinn and phong). playback controls channel box.

customizing Dreamweaver. and Mailto links. property box . Creating reusable webpage . Dynamic HTML. Data Form & Scripting Creating a form and collecting Data. adding flash and other multimedia to a web page. Bangalore. Hyperlinks. Adding Images and Multimedia Displaying images .MPH Christ University. sending and receiving to form data. Anchors. using frame to display multiple web pages. defining and configuring a website..NET Introduction Understanding work flow. lists. displaying data in tables. Layers. designing page layout using tables. environment. Organizing and Uploading a Project Uploading and sharing a project on the web. Using library. Adding interactivity with behaviors. Cascading Style Sheets (CSS) . BCA syllabus . Creating image Maps and navigation bars. reusing elements of a website. saving method. and previewing in browser. Introduction to scripts. Adding text. tools . India 96 Dreamweaver and ASP. Webpage layout with Tables and Frame & DHTML Planning layout. managing assets using Assets panel. optimizing and creating images . site concept. managing and editing a website.

Sign up to vote on this title
UsefulNot useful