This action might not be possible to undo. Are you sure you want to continue?
DEPARTMENT OF BCA SYLLABUS FOR BCA February 2009
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
Christ University, Bangalore, India
BCA COURSE STRUCTURE
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
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 .Christ University.
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 .Christ University. Bangalore.
multiplexers and de multiplexers are dealt here. BCA syllabus . BCA 136: Introduction to Programming using C C is a widely used language in systems programming. BCA 132: Mathematical Foundations for Computer Science The subject aims at providing the basic mathematics including Set Theory. The basic working of a transistor is studied in detail. In general the subject equips the students with start-up knowledge of electronics forming up a good base. The design of half adders and full adders are also included as part of this subject. structures and functions. Bangalore. In general. for. 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. energy levels and the classification of solids into conductors. to channel the triggered thoughts into creative expressions. pointers. Advanced features like functions. registers and flags are also dealt with. This subject gives an introduction to programming and basic elements of programming like algorithm. Programming constructs like if. to develop analytical and lateral thinking and to fine tune the presentation skills. The subject starts with an introduction to number systems and its applications in computers. flow chart and Pseudo code. It’s a language with lot of capabilities..Christ University. semiconductors and insulators. Finally the subject concludes with ideas on different logic families. arrays. while and do while are dealt with its syntax and applications. 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. Classification of memory. The applications of diode as a rectifier and Zener diode as voltage regulator also form a part. logic gates and design of different types of flip flops and counters. Differential Calculus and Integral Calculus to help students in effective problem solving. Pointer being an important concept is dealt with respect to arrays. The subject introduces conceptual ideas of atomic structure of an atom. The subject starts with the features of C language and basic elements of the language. The subject exposes the students to basic concepts of flip-flops. Introduction to voltage controlled device like JFETis included. The discussion about working of devices like encoders and decoders. The concept of files and preprocessors are also introduced. the subject concentrates in all the areas of C programming which is very much helpful for a beginner in Computer Programming. BCA 135: Digital Computer Fundamentals This subject deals with the basic concepts of functioning of a computer. structures and unions are also dealt here.
Bangalore. expectations and estimation is dealt along with some important probability distribution. System design. implementation. linear algebra and differential equations are discussed. mathematical logic. the students are given an opportunity to know what happens in software development. The subject deals with all these algorithms. Different CPU scheduling techniques gives a clear picture about how an operating system handles different types of tasks. BCA 236: Data Structures The subject deals with the representation of data inside a computer. The students are also exposed to software development life cycle. it is necessary for an operating system to synchronize the jobs waiting for the devices. BCA 234: System Analysis and Design The students of Computer Science always dream to become software professionals. queues and trees gives an exposure about how operating systems and compilers are handling their data and symbol table. The students are asked to analyze the case studies to under stand the concepts better. The subject deals with some interesting problems like towers of Hanoi. BCA 232: Algebra and Differential Equations Logic is the study and analysis of the nature of the valid argument. which basically deals with requirement collection and analysis. To conclude. Having learnt a programming language. to be able to respond to the business needs of the changing industry. Memory management policies are dealt to give information about how the main memory can be handled by an operating system. study of this subject gives a sound knowledge about the software development process. which is of great help for an operating system designer. The subject concentrates on different data structures and their applications. it is the reasoning tool by which valid inferences are drawn from a given set of facts or premises. Feasibility study and human ware involved in the process. testing and maintenance are also covered here. BCA 235: Operating Systems Operating system is the manager of computer resources. which can be solved using recursion with the help of a stack. BCA syllabus . Case studies about DOS and Windows NT are also dealt as part of this subject. the subject gives an overall view of the concepts of systems programming.Christ University. The students get to know about what is a system and what are its different types. Further. 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. Since the secondary storage devices cannot handle more than one request at a time. There are different types of algorithms. stacks. Overall. The concepts of arrays linked lists. In this subject. random variables. The subject introduces the basic components of an operating system and various types of operating systems. which can be used for the same. The subject also deals with different sorting techniques and their time and space complexities. BCA 233: Statistics for BCA II The use of probability theory.
The actual development process and various levels of testing are discussed with the case studies to make the students to become good software professional. BCA syllabus . It also concentrates on various techniques for database protection and query optimization.Christ University. A brief introduction about network and hierarchical data model gives exposure about how a DBMS can be designed. The aim of this course is to teach the students various modules of graph theory to emerge as efficient network designers and administrators. It also deals the popular relational data model and SQL queries in depth. These data are efficiently handled by a database management system. The subject also deals with distributed databases in brief. BCA 336: OOP using C++ C++ is the first object oriented programming language taught in the course. The concepts of operator overloading and function overloading are discussed to expose the students to the advantages of object oriented programming. Bangalore. The subject starts with the comparison between procedural languages and object oriented languages. BCA 335: Database Management Systems All the computer-based applications require data to operate. BCA 334: Software Engineering Software Engineering is one of the emerging areas in the field of Information Technology. The subject starts with what is software engineering. 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 management of a project and how to ensure the quality of the product is also discussed. This is introduced next to system analysis and design. 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. Advanced topics like inheritance and its various types and virtual functions are taught in depth with its application areas. The subject deals with what is a database and how a database should be designed. Maintenance of software product is included as a last chapter of the subject. 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 steps that are followed here reduce the development cost and time. This is the systematic approach to software development. The concept of classes and objects make it easy to represent real world entities. The various topologies can be analyzed with a sound knowledge in Graph Theory.
Error detection and correction mechanisms are dealt to give an exposure about how actually the network handles the data. Know how to utilize the algorithmic methods of divide and conquer. 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. greedy heuristics. Applets are discussed in detail. BCA syllabus . After this course. BCA 432: Numerical Techniques The objective of this course is to introduce various numerical techniques available in problem solving. backtracking and branch and bound algorithms and Understand fundamental algorithms in sorting. The subject introduces the concept of networks. dynamic programming. 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.Christ University. Advanced topics like different controls and graphics methods are discussed which is of great help for the developers. 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. BCA 434: Computer Networks – I Today. 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. networks of computers are commonly used to share data and resources. Java is basically designed for internet applications. Inheritance. The OSI reference model is dealt to introduce different layers. Other advanced topics like servlets and JDBC are also dealt. Develop recurrence relations. The layers are discussed in detail in later chapters of the subject. Bangalore. 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. summarizing algorithms' complexity. students should be able to Evaluate algorithms based on their complexity and asymptotic growth rate. The basic elements of the language like different data types and programming constructs are discussed. Applets are the programs which can be immediately interpreted by a web browser. interfaces and concept of packages are discussed which are the important concept of basic Java. Solve those recurrence relations using a variety of methods. graphs and heaps. The discussion about routing algorithms gives exposure to the sending of information in a network. different topologies and network devices.
STREAM A : BCA 541A: TCP/IP Introduces TCP/IP (Transmission Control Protocol/Internet Protocol) fundamentals. Line drawing and circle drawing algorithms basically works according to this principle. The file system. BCA syllabus . JSP is also included as part of this subject. Programming is generally done using HTML.Christ University. BCA 533: Computer Graphics Graphics is the familiar to even computer illiterates. transformation and rotation of an object is also included as part of this subject. The subject also concentrates on the recent trends in Information Technology. Thanks to Hollywood movies! The subject starts with an introduction to applications of graphics. FTP. Different topics of HTML are discussed which is helpful for a web page designer. After learning the concepts of an operating system. naming. Graphics mainly works the smallest element called as pixel. The working of different devices is also discussed. Various commands used by UNIX shell is also discussed which makes the users of UNIX comfortable to interact with. Bangalore. The subject deals extensively about the working of World Wide Web. it is appropriate to learn how UNIX implements these concepts. Plotting these pixels in a systematic way makes an object. Concepts of Multimedia and video conferencing are also included. and other aspects of TCP/IP. using the latest tools and techniques. AWK and Sed is also discussed. Bourne shell programming is dealt in depth which can be used to develop applications in UNIX. DNS. networks. It also deals with the programming of internet. BCA 542A: Internet Programming Internet is the buzzword today among the youngsters. email and others. process management and memory management are discussed which makes the students to understand the internals of UNIX. It also aims at their overall soft skills development BCA 532: Unix Operating System Unix is the multi user and multi tasking operating system. Discusses addresses. Scaling. The subject is introduced with the features and basic architecture of UNIX. HTTP. sockets. Overview of internet communication and basic protocols such as: ARP. 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. Three dimensional graphics is included as part of this subject.
The routing principles and how routing takes place is also discussed as part of this subject. India 11 STREAM B : BCA 541B: Computer Networks – II This is offered as continuation of computer networks – I subject. BCA 542B: System Software The subject is introduced to get knowledge about different translators like compiler. Bangalore. BCA syllabus . Topics like macro processors. General machine architecture is also included as part of the subject. interpreter and assembler. Introduction to telnet. The subject introduces the students to local area networks and its benefits. This mainly deals with the techniques used in TCP / IP protocol. loaders and linkers is included to get in depth knowledge about the translation to the machine language. The subject deals different types of assemblers the phases involved in detail. The internet protocol which makes it possible to connect different computers together is dealt in detail.Christ University. FTP and SMTP is also dealt here. Different phases of a compiler are dealt in detail will be of great help for the compiler developers.
The subject deals extensively all the techniques used for simulation. Multi media is one of the great achievements in this cyber era.Christ University. Many areas like nuclear reactors and testing of missiles also makes use of simulation. Case studies are included as part of this subject for better understanding. The third and fourth units deal with algorithms for distributed computing. Bangalore. BCA 642A: Multimedia Computing Multimedia is the latest technology in the field of Information Technology. The study of this subject is really required for the students of computer science to get better opportunities in the IT industry. India 12 SEMESTER – VI BCA 631: System Simulation Simulation plays vital role in all engineering and research fields. The pilots who undergo training first gets expertise using the simulated program. STREAM A: BCA 641A: Distributed Systems Communication has become ever relevant keyword in the field of information technology. The subject deals with the concept of distributed systems focusing on multiprocessors and multi-computers. The languages used for simulation are also discussed as part of this. The last unit discusses about the file systems with reference to distributed systems. The second unit deals with communication in distributed systems with reference to ATM. The subject extensively covers different concepts of multimedia and its application areas. Many of the animation techniques make use of the multimedia features. BCA syllabus .
BCA syllabus . 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.Christ University. The last unit deals with concepts of memory design including characteristics and features of different types of memories. The architecture of 8085. The introduction part deals with what is a microprocessor and what are its application areas. The main concentration is towards Intel 8085. An introduction to Intel 8086 with its various registers and flags are also included as part of this subject. Bangalore. Programming 8085 microprocessor is dealt with the help of small programs. This subject mainly deals with the internals of a microprocessor. 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. Instruction set of 8085 and addressing modes are also included in the subject.
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. in thoughts. The student is guided towards a critical thinking process through these selected pieces.RaviShanker Unit 5: Short story: The Bet by Anton Chekov Both the stories deal with the power of the human mind. 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. If by Rudyard Kipling 2. social responsibilities. Live Blindly and Upon the Hour by Trumbull Stickney 4. 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. Framing questions through a given dialogue BCA syllabus . Stopping by Woods on a Snowy Evening by Robert Frost Module 2 : EXPRESSIONS@OUTPUT Hours : 20 Written Skills 1. Bangalore. not breaths by Philip James Bailey 3. This essay looks at the developments in science from a different angle. which focus on varied issues. not years. current topics. This letter throws light on the ways of the world of technology. Unit 4: Short story: PONNUTHAYI By BAMA Translated by N. letters. Unit 1: A real letter written by an 86 year old woman to her bank manager. essays and short stories. We live in deeds. Classroom interaction and participation on related issues are expected to expand the horizons of the young mind. computer related topics 2. through a few prescribed poems.Christ University. Unit 6: Poetry: 1.
India 15 3. Bangalore. Vocabulary exercises – situational conversations. usage of articles and prepositions Oral skills (evaluation to be taken up and form a part of internal assessment) 1.Christ University. Group discussion / Talk shows on current topics 3. exercises on synonyms Grammar reinforcement: Correction of errors. Script enacting BCA syllabus . Individual presentations 2. editing / abstracting / re -writing skills.
India 16 BCA 132: MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE Total Teaching Hours: 45 UNIT 1: SETS. REFERENCE BOOKS: 1. 2.Publishers. Bangalore. Thomas and Finney : “Calculus with Analytical Geometry”. 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. 3. Erwin Keryzig : “Advanced Engineering Mathematics”. (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. Wiley Eastern Ltd. K. 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.Christ University. McGraw Hill Book Company. S Narayan and T K Manicavachogam Pillai : “Calculus”. inverse functions.Joshi : “Foundations of Discrete Mathematics”. ( 10 Hours) UNIT 2 : MATHEMATICAL LOGIC Propositions and Truth values – Connectives. 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. BCA syllabus . onto.V. 2. Composition of functions – inverse of compositions. (10 Hours) TEXT BOOKS: 1.D. into.
B. Sooryanarayana : “A textbook of probability and statistics” . 2. Daniel and Terrell: “Business Statistics for Management and Economics”. Vinayaka Moorthy and Srimani : “A textbook of probability and statistics”. 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. Levin and Rubin: “Statistics for Management”. 1992. 3. BCA syllabus .Christ University. Chand 2003 2. 1997. Prentice-Hall India. 1996. Bangalore. 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. Subhas Stores REFERENCE BOOKS : 1. (10 Hours) UNIT 2: Concepts of central tendency and dispersion-Mean. (07 Hours) TEXT BOOKS: 1. 7th Edition. Prentice-Hall India. 6th Edition. Berenson and Levine:“Basic Business Statistics”. 6th Edition. (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. S. Prentice-Hall India.
Christ University.C equivalent circuits-load line analysis (07 Hours) UNIT 6 : Field Effect Transistors (FET) Types of FET – Junction field effect transistor(JFET) . 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. Bangalore. 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.Working of JFET – JFET as an amplifier – Difference between JFET and BJT – Metal oxide semiconductor FET(MOSFET) – Working (05 Hours) BCA syllabus .C and A.Diode as rectifier – Resistance of diode – Diode rectifiers (half wave. 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 -.
D C and Gupta. TMH. 7th Edition S. BCA syllabus . 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. Theraja B L: “Basic Electronics solid state”. Mehta V K and Mehta Shalu: “Principles of Electronics”. 2.Christ University. Chand & Company Ltd. REFERENCE BOOKS: 1. Kulshreshtha. S. Chand & Company Ltd. S C: “Basic Electronics and Linear Circuits”. 5th Edition. Bhargava. N N. 1989. Bangalore.
TMH. 3. Timing diagrams. ROM. Malvino. JK flip-flops). Boolean expressions for gate networks (SOP and POS). Basic laws of Boolean algebra. SIPO. 9’s and 10’s complement. Gray code. Bartee. Paul Albert and Leach. Decoder. NOR gate. (03 Hours) TEXT BOOK: 1. Floyd. Basic Components of a Microprocessor (Introductory ideas). Octal. 1’s and 2’s complement. Paul Albert and Leach. TMH. Karnaugh map (SOP and POS) with examples. Donald P: “Digital Computer Fundamentals” 3rd Edition. 1997. BCD numbers. NAND gate. Simplification of Boolean expression. Non-Volatile. Synchronous counter (Four bit synchronous counter.Classification of memory – Volatile.Logic levels and pulse wave forms. PISO. DeMorgan’s theorems. X-OR gate. and PIPO). Look ahead carry adder. 2. 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. Inverter gates. (07 Hours) UNIT 4: Flip-Flops . Modes of operation of registers (SISO. D flip-flops. University Book Stall. Thomas L: “Digital Computer Fundamentals”. E²PROM. REFERENCE BOOKS: 1. Asynchronous counters (Four bit ripple counter.Christ University. De-multiplexer with applications. Parallel binary adders. Floating point numbers. (07 Hours) UNIT 5: Registers and Counters . Encoder. Hexadecimal). 1995. BCA syllabus . (13 Hours) UNIT 3: Combinational Logic . RAM.Adders (half and full). OR gate. Donald P: “Digital Principles and Applications” 4th Edition. Binary. TMH. AND gate. Binary Arithmetic.Latches. 2000. (07 Hours) UNIT 2: Boolean algebra and Gate networks . ASCII code. Malvino. Thomas C: “Digital Computer Fundamentals” 6th Edition. Decade counter). 3rd Edition. The universal property of NAND gate and NOR gate. 1995. EPROM. Multiplexer. Decade counter). X-NOR gate. Different number systems and their conversions (Decimal. Bangalore. Edge triggered flip-flops (SR flip-flops.Buffer registers. (08 Hours) UNIT 6: Memory and Introduction to Microprocessor .
Two dimensional arrays of strings (03 Hours) BCA syllabus .while. Classification of Computers – Analog. initialization. Extern and Static Variables (03 Hours) (02 Hours) (05 Hours) (01 Hour) UNIT 7: Arrays – One dimensional and multidimensional arrays Declaration. Advantages and Disadvantages of Computers. India 21 BCA 136: INTRODUCTION TO PROGRAMMING USING C Total Teaching Hours: 45 UNIT 1: Introduction to Computers Evolution of Computers. for Break statement. Application software and System Software. (03 Hours) UNIT 3: Introduction & The C character set History of C.strlen.Christ University. Personal Computers ( Different Types) and Terminals (Different Types). displaying array contents (03 Hours) UNIT 8 : Strings Basic concepts. go to statement UNIT 6 : Storage classes in C Automatic. standard library string functions. do-while. Algorithms and Flowcharts with Examples. strcat & strrev. Programming Logic. Software. logical operators. strcmp. Bangalore. strcpy. Classification of Software.Super Computers. Structured Programming. relational operators. (04 Hours) UNIT 2 : Introduction to Programming Types of Programming Languages. Register.conditional operator. case control structure. Type conversion in assignment Operators in C. Digital. Mainframe Computers. Characteristics of Computers. Structure of a C program Constants. reading values into an array. Hybrid Computers. Hierarchy of operations Control Instructions UNIT 5: Control Structures Decision control structures. Continue statement. Loop control structures. Block Diagram of a Digital Computer. 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. Generation of Computers. Classification of Computers according to Size.
Balagurusamy. Pointers and strings. declaration. complement. notation. Pointers and functions. Yashavant: “Let Us C”. 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. Byron S: “Programming with C”. array of pointers. BCA syllabus .comparison with functions File Inclusion (02 Hours) TEXT BOOKS: 1. UNIT 11 : Structures and Unions Definition. 1996. India 22 UNIT 9 : Functions Definition. BPB Publications. 2. accessing structure elements Array of structures Pointers and structures Unions – definition. Bangalore. Gottfried. Tata McGraw-Hill 2. accessing union elements typedef statement.Christ University. types of functions. Pointers and arrays. E: “Programming in ANSI C” 2nd Edition. Prentice-Hall. passing arrays to functions I/O functions. declaration. OR. Kanetkar. function definition and prototyping. H M and Deitel P J: “C How to Program”. recursion. passing values to functions.call by value and call by reference. Deitel. 2nd Edition. right shift and left shift operators (02 Hours) UNIT 14: C preprocessor Types of C preprocessor directives Macros. 4th Edition. Tata McGraw-Hill REFERENCE BOOKS: 1.formatted & unformatted console I/O functions (04 Hours) UNIT 10: Pointers Definition. exclusive OR.
Write a program to perform matrix multiplication. Aim: To demonstrate the usage of functions and recursion a. 6. Write a program to check whether a string is a Palindrome. c. 2. Implement modify and search operations. /) based on the symbol entered. Aim: To demonstrate the concept of while. do-while. Aim: To demonstrate the concept of structures and unions a. b. Write a program to print all prime numbers between any 2 given limits. break and continue a. Aim: To demonstrate the concept of switch-case a. *. name. b. Write a program to print all the Armstrong numbers between any 2 given limits. Aim: To demonstrate the concept of arrays and strings a. Write a program to check whether the given number is a Prime number or not. if-else a. Write a program to accept three numbers and find the largest and second largest among them 3. Write a recursive program to find the factorial of a number. Write a program to accept two numbers and perform various arithmetic operations (+. 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. Create an employee structure and display the same. b. Write a program to count the different vowels in a line of text. Write a program to convert Fahrenheit to Celsius. Aim: To demonstrate the usage of if. 7. b. Write a program to print the size of all the data types supported by C and its range. 4. Aim: To demonstrate the usage of operators and data types in C a. Create a student database storing the roll no. Write a program to find the roots of a quadratic equation b. BCA syllabus . b. 5. Bangalore. b. class etc.Christ University. for loops. Write a program to check whether a given matrix is an Identity matrix or not. -.
Write a program to check whether a given number is odd or even using bitwise operators. and delete operations. Aim: To learn about pointers a. b. India 24 8. Write a function to swap two numbers using pointers b. Aim: To learn about Bitwise operators and preprocessors a. BCA syllabus . Perform the different bitwise operations (menu driven program) . 10. Bangalore.The i/p and the o/p should be displayed in Binary form. Write a program to access an array of integers using pointers 9. Create a file and store some records in it. Display the contents of the same. Aim: To learn about Files a.Christ University. Implement search. modify.
Assign a password for the document to protect it from unauthorized access. Select cell B4:D4 and change the horizontal alignment to center and text to 90 degree. The information should be divided in “General” and “Academic” sections. shading and pattern to data in sheet BCA syllabus . etc. 6. In sheet1 write following sales data for Java Coffee bar to show their First 6 months sales. merge and center these cells. ‘2’. The header should contain “BIO-DATA” while the footer should have page numbers in the format Page 1 of 10. The sub areas should be numbered as ‘a’. (At least 5 mathematical symbols should be used). Write a macro that sets margins to your document. 2. Table should be Bordered and Shaded. Write a letter to 10 different IT companies asking them to participate in the seminar using mail merge facility. Use mail merge facility to forward the marks cards to the parents. Prepare a document which contains template of marks card of students.xls. 3. Apply same format to A2:H2. All titles should be in bold Format all cells numbers to currency style and adjust width as necessary. Assign a password for the document to protect it from unauthorized access. Create a Document consisting of Bio-data. Add border to data. Open a new workbook. Prepare a News Paper Layout. Assume that there are 10 students. a font of size and double spaced document. Demonstrate the use of Hyperlink Option. 4.Christ University. The footer for the document should be ‘Christ University Bangalore – 29”. etc while the areas should be numbered as ‘1’. Use the following Features: Three Column and Four Column setting Set One or Two Advertisements Use Bullets and Numbering. Give border. save it as JavaCoffeeBar. 5. Assume that you are coordinating a seminar in your organization. MS-EXCEL 1. Bangalore. A Multilevel list giving your areas of interest and further areas of interest. ‘b’. Select the cell range A1:H1. India 25 BCA 152: PC SOFTWARE LAB MS – Word 1. It includes A table giving your qualification and/or experience of work. Insert appropriate pictures wherever necessary. Prepare a document about any topic in mathematics which uses mathematical symbols. Prepare a document about any tourist destination of your choice with appropriate pictures and editing features.
Telephone Calls Up to 150 calls . For all the above Job ids PF to be deducted is 4%.free BCA syllabus . For the job ids between 1-4 Rs. If Job Id is 4 then DA is 25% of the basic salary and HRA is RS. If Job Id is 3 then DA is 30% of the basic salary.000. From 401 to 449 assign the grade as “B”.Validate the marks. If Job Id is 1 then DA is 40% of the basic salary. 4500.000 with experience greater than 2 yrs. Assign grade ‘A’ if the total marks is above 450. Find the net pay. Designation. 2. 2500. (Max Marks is 100). For all the other Job ids DA is 20% of the basic salary and HRA is Rs. 3500. 4. From 351 to 400 assign the Grade as C.Christ University. Name and marks in 5 subjects. Prepare a pay-bill using a worksheet. Assign the grade according to the following. 1500. Use advance filter to display the details of employees whose designation is “Programmer” and Net Pay is greater than 20. Prepare a worksheet to maintain student information. Sort the employees on the basis of their net pay 3. For the above employee worksheet perform the following operations 1. The work sheet should contain Employee Id. Use filter to display the details of employees whose salary is greater than 10.2500. The work sheet should Contain Roll Number. Calculate the total marks. HRA is Rs. Bangalore. In such cases the grade is “FAIL”. Create a statement of Telephone Bill Charge for a customer. HRA is Rs. Name. From 300 to 350 the grade to be assigned is ‘D’. 5. If Job Id is 2 then DA is 35% of the basic salary. HRA is Rs. For the total marks less than 300 No grade is assigned. A student is eligible to get a grade only when he gets 40 and above in all the subjects. 3. 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. 100 to be deducted as Professional Tax. Experience and Basic Salary and Job ID. (Assume that there are 10 students).
(b)Create a macro to change the name of worksheet as Macro Example. Display the details of members who have not paid the amount. Create a report using Access to display the BCA syllabus . 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. Compute the total sales of all the products in five year.80 per call 501 to 1000 calls . (a) Using Excel write sales data with columns product. Represent annual sales of all products using Bar Chart. Give the options for View. Using Excel project the Product sales for any five products for five years. Show the usage of action buttons. The presentation should have minimum 10 slides. India 27 151 to 500 calls . 2. Author.40 per call 6. Create a database of Employees in an organization. Delete and Edit. 2. Include a table names as Book which contains Accno.0. diagrams and tables. Title.Christ University. Represent annual sale of all the products using Pie-Chart. Insert appropriate images wherever necessary. Display details about books where there is more than 5 copies of the books. Use proper formatting. hyperlinks.1. name. Bangalore. (Choose some latest technologies). and animations. Delete some of the member details.25 per call Above 2000 . telephone no and membership amount paid or not. Assign Accno and member id as primary key. Show the application of Pens. Create a database called as Library.1. Assume that you are going to give a presentation about Information Technology. Write at least 5 records. MS-POWERPOINT 1. Include a table which has the information about the employee’s family.1. Prepare a presentation about any general topic of current relevance (min 10 slides). Label and format the graphs 7.00 per call 1001 to 2000 . MS-ACCESS 1. Include another table named as members which contains member id. Number of Copies and Brief Description about the book. Add. address. Create Pivot Table chart and Report for the data. Compute the total sales of all products for each year. Represent sale of a product for five years using Pie-Chart. month and sales. Compute the total sales of each product in the five years. Display the details about the books written by the particular author. Create User interface using Access to enter and modify the details stored in the employee database.
Create a pay slip for the employees using the access reports. Use the Options for having more E-mail Accounts. Use this to send and Receive mails Create News Groups. India 28 department-wise listing of employees. BCA syllabus . Configuring E-mails using Outlook Express. Bangalore.Outlook Express 1. Create Local Folders.Christ University. MS.
4. Types of Communication. Essay writing – features of a good essay – structure and presentation – exercises on essay – writing on varied topics 2. 3. Extempore talks (10 Hours) REFERENCE BOOKS: 1. Bangalore. Essentials of Business Communication by Rajendra Pal & Korla Halli Business Communication – By Dr. Phonetics – Basics Presentation skills with emphasis on PPTs Mock Interviews Debates. 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.Christ University. Media of Communication. 2. Principles of Communication. India 29 BCA 231: FUNCTIONAL ENGLISH Total Teaching Hours: 45 UNIT 1: Learning skills: What is Communication. The process of Communication. Urmila Rai and S M Rai BCA syllabus . Barriers to Communication (30 Hours) UNIT 2: Written skills: 1. 2. Objectives of Communication. Methods of Communication.
C. Apostol T M : “Introduction to Analytic Number Theory”.Schaum series. TMH. Schaum series. (10 Hours) UNIT 2: THEORY OF NUMBERS Divisibility – Division Algorithm – Greatest Common Divisor – Euclid’s algorithm to find the G. Narayana & T. REFERENCE BOOKS: 1. Narosa Publishing House.D. S V Publishers BCA syllabus . K Manicavachogam : “Algebra”. S. Lagrange’s theorem (Statement only). 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. Frank Ayres J R : “Differential Equations”. K Manicavachogam Pillay : “ Differential Equations” . Bangalore. 2. Herstein I N : “Modern Algebra”. 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. 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. T. TMH. Wilson theorem. SV Publishers 4. Vasishta A R : “Modern Algebra”. Frank Ayres J R : “Matrices”. Eigen vectors and properties – Cayley Hamilton theorem (Statement only). Vasishta A R : “Matrices”. Krishna Prakashan Mandir. 3. (10 Hours) UNIT 3: GROUPS. 3. 4.Christ University. 2.
Bangalore. S. Prentice-Hall India. 2. Walpole: “Probability and Statistcis for Engineers”. Sooryanarayana : “A textbook of probability and statistics” . 2002.Christ University. B. (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. (10 Hours) UNIT 3: Sampling Distribution and Estimation-Definition of a parameter and a StatisticChi-Square. (15 Hours) TEXT BOOKS: 1. Seventh Edition. 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. (10 Hours) UNIT 2: Random variables and distributions-Discrete and continuous random variablesProbability mass and density functions-Expectation-Binomial. 1992. Fifth Edition. Poisson and Normal Distributions. Subhas Stores REFERENCE BOOKS: 1. Fruend : “Mathematical Statistics”. Prentice-Hall India. BCA syllabus . Vinayaka Moorthy and Srimani : “A textbook of probability and statistics” . Chand 2003 2. 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.
categories. Decision Tables. data analysis. Preparing career as a system analyst. Tools. DFD. Definition. data entry.driven methodology. Types of outputs. forms. Expert systems. Technical skills. System users issues for output design. Bangalore. Internal controls for inputs. Media and formats. India 32 BCA 234: SYSTEM ANALYSIS AND DESIGN Total Teaching Hours: 45 UNIT 1 : System concepts and the information systems environment: The systems concept. (05 Hours) BCA syllabus . Introduction to structured design. System analysis and design skills. Multifaceted role of a system Analyst. A CASE tool frame work (05 Hours) UNIT 6 : System Design: Strategies for good system design. JAD participants. Principles of system development. Steps in feasibility analysis.Christ University. (05 Hours) UNIT 2 : Information system development: Definition. major development activities. cost-benefit analysis. logical and physical design. (05 Hours) UNIT 3: Cross life cycle activities: Fact-Finding. Feasibility report. GUI controls for input design.oriented design. The Tools for Structured Analysis. data input Model input methods. Type of interviews and questionnaires. characteristics of a system. on-site observation. procedures. Structured English. Computer Aided System Engineering (CASE). Transaction processing systems. Types of systems. Principles and guidelines for output design.Benefits. Form . the system proposal (05 Hours) UNIT 5: Structured Analysis: Definition. Procedure for cost benefit determination. System user issues for input design. object . Interpersonal skills. Data Dictionary. Batch versus on-line inputs. Decision Trees. Introduction to fundamental information systems. Review of literature. (05 Hours) UNIT 4: Feasibility and Cost-Benefit Analysis: Feasibility considerations. Personal and workgroup information systems. How to plan and conduct AD sessions . System Development Life Cycle. Interviews and questionnaires. files. Management Information systems. trends in automatic data collection technology. personnel allocation and audit considerations (06 Hours) UNIT 7: Input/output forms design: Methods and issues for data capture and input. Research and site visits. joint application development (JAD). Decision support systems. Office information systems.
Reducing maintenance costs (05 Hours) TEXT BOOKS: 1. ISO certification (04 Hours) UNIT 9: Implementation and Software maintenance: Conversion. Galgotia Publication Pvt. Mc-Graw Hill International. James A: “Analysis and Design of Information Systems” Second Edition.Whitten: “System analysis and design methods” Fourth edition. trends. 2. Test plan. procedure. BCA syllabus . different methods.. Primary activities of a maintenance procedure. Post-implementation review. Activity network for conversion. India 33 UNIT 8: System testing and quality assurance: Testing. REFERENCE BOOKS: 1. Awad.Christ University. Bangalore. 1989. Jeffrey L. activity networks for system testing.Ltd. Elias M: “System Analysis and Design” Second Edition. Software maintenance. Nature of test data. Sen. Quality assurance : goals in system development. Mc-Graw Hill International edition.
2001.Disk Structure. Tanenbaum. Readers Writers and Sleeping Barbers Problem – Semaphores – Monitors (05 Hours) UNIT 4: DEADLOCKS: Definition of a Deadlock. 3. Milan Milenkovic. 4. Directory Structure. Disk Scheduling-FCFS-SSTF-SCAN-LOOK-CSCAN and CLOOK.Christ University. H M Deitel. Avoidance. Time sharing. 2nd edition. I/O Interface. McGrow Hill 1987 2. Detection and Recovery (Banker’s Algorithms and Resource Request Algorithm) (05 Hours) UNIT 5: MEMORY MANAGEMENT: Address Mapping. Operating Systems Concepts and Design. 2000. Stalling Williams. Secondary Storage Structure. Access Methods. File System Structure. Management Methods: Single contiguous. PHI. California Peachpit. Types of Operating Systems: Batch. Bangalore. Variable size and Dynamic size. Handling Deadlocks: Prevention. Paging and Segmentation. Free space Management. John Wiley and Sons REFERENCE BOOKS: 1. Operating Systems. Conditions for Deadlock. Operating System Concepts. Operating Systems – Design and Implementation. Abraham and Galvin. Medium term and Long term schedulers – Scheduling Algorithms: FCFS. (05 Hours) UNIT 2: PROCESS MANAGEMENT: Definition of a Process – Process states – Process Control Block – Scheduling Criteria – Schedulers: Short term. PHI. 5th Edition. India 34 BCA 235: OPERATING SYSTEMS Total Teaching Hours: 45 UNIT 1: INTRODUCTION: Definition of Operating Systems. Operating Systems. Real time and Distributed Operating Systems – Spooling – System calls – Operating system Structures. Multiprogrammed. Peter Baer. 2001 BCA syllabus . Functions of Operating Systems. (05 Hours) UNIT 7: I/O SYSTEMS: Overview of I/O Systems. 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. Page Replacement Algorithms: FIFO and LRU (08 Hours) UNIT 6: FILE SYSTEM: File Concept. Protection. Producer Consumer. Services of Operating Systems. Allocation Methods. Multiple Partitioned: Fixed size. Swapping. S Andrew. (07 Hours) TEXT BOOK: 1. Round Robin. Silberschatz.
Concepts. Binary Search Trees – Searching and Inserting in Binary Search Trees.Strings. BCA syllabus . Second Edition. Seymour Lipschultz: “Data Structures”. REFERENCE BOOKS 1. 1998. Complexity . Horowitz: “Fundamentals of Data Structures” Galgotia Publications. Prefix and Postfix expressions and Evaluation of postfix expression using stacks (05 Hours) UNIT 6: Queues. Sparse Matrices (any two representations). Merge sort . Circular queues.Concepts. (06 Hours) TEXT BOOK: 1. Bhagat Singh and Thomas L Naps: “Introduction to Data structures”. Operations.Christ University. -Application of Trees (brief overview) (04 Hours) UNIT 8: Sorting. operations.Towers of Hanoi. Application of stacks. Linear Search and Binary Search (08 Hours) UNIT 4: Linked lists-Linked list. Bangalore. 1995 3. Infix. 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). pre-order). Deletion. Galgotia Publications. and Deque (Introductory concepts)-Application of queues. sequential and linked implementation. Indexing. Operations on data structures. Display)-Applications of linked linear lists (08 Hours) UNIT 5: Stacks. TMH. Ellis. Tremblay J.Storing Strings – Fixed length structures.G: “An Introduction to data structures with applications”. advantages and disadvantages of arrays. (06 Hours) UNIT 7: Trees-Binary trees. Deletion. 1996 2. Quick sort. Traversals on a Binary Tree (In-order. Schaum series TMH. Variable length structures with fixed maximums and linked structures-Primitive Operations on Strings-Substring.Representation of linked lists in memory-Operations on linked list (Insertion. Deletion in a binary search tree. (02 Hours) UNIT 2: String Processing .P and Sorenson P. Insertion sort. sequential and linked implementation. Deletion. (06 Hours) UNIT 3: Arrays. post-order. Linear Queue (FIFO). Selection sort.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).Bubble sort. Display)-Doubly linked linear list (Insertion. Concatenation and Length of the string-Pattern Matching Algorithms – First Pattern Matching Algorithms and Fast Pattern Matching Algorithms. Display)-Circularly linked linear lists (Insertion. Complete Binary tree.Time-Space complexity.
Use And and/or operators c. Write reusable code in sub procedures and sub functions 2. Tool Tips.set break points. 5. tab sequence. Loops. and Printing (02 Hours) a. 6. Text boxes. group boxes. Use online Help Introduce controls and their properties (04 Hours) a. resetting focus c. Use of accumulators and counters e. procedures and functions (04 Hours) a. Send information to the printer Menus. default and cancel buttons. save. Debug tools . radio buttons. Perform calculations using arithmetic operators and order of operations d. Declaration of variables and constants considering data types and scope b. Create menus and submenus for program control b.Christ University. constants and calculations (04 Hours) a. Introduction (05 Hours) a. Define design and development process d. Objects and events c. 8. Create and use list boxes and combo boxes b. run. Use If statements to control the flow of logic b. stepping and observation of intermediate results Arrays (02 Hour) a. and print a project f. Call event procedures d. India 36 BCA 251: VISUAL PROGRAMMING LAB Total Hours: 60 1. Explicit data type conversions c. Write. Identify elements of IDE e. User friendly features: access keys. Store data in multidimensional array Lists. 7. 4. Structure Variables d. picture boxes and naming conventions b. Use formatting functions to format output Decisions and conditions (04 Hours) a. check boxes. Windows Concepts b. 3. Declare arrays and refer to elements using subscripts b. Input validation e. Bangalore. Use For Each/Next statements c. Use Do/Loops and For/Next statements c. Changing properties at run-time d. Concatenate strings Variables. Toolbars and Status bar (03 Hours) BCA syllabus .
15. Overview of MDI b. 10.Christ University. Data reports c. a. OO terminology b. India 37 9. Multi-tier applications c. Writing code to work with toolbars d. Help file c. 11. 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 . Constructors and Destructors e. The data controls (DAO and ADO) e. Create a database in Access Through VB c. MonthCalendar and Date/TimePicker c. Adding panels to the status bar Other controls a. 12. Develop a database application Introduction to Graphics and animation Multiple Document Interface (MDI) a. Adding images to toolbars c. Creating and using a status bar e. Common Dialog (Open/SaveFile) d. Bangalore. 14. Writing code for parent and child forms d. Child window management e. ProgressBar File handling and file controls in VB Database Connectivity a. Classes d. Printing with windows forms b. 16. Creating applications Creating and using reports a. Working with database objects in code g. Creating setup program b. Using Crystal Reports Create Object-Oriented programs a. Data Bound controls f. Data base basics & database engine b. Creating parent and child forms c. Data Manipulation through VB – Forms h. Inheritance Deploying the project a. The nature of a relational databases d. Creating toolbars b. 13. TabControl b.
c. Fibonacci series using recursion. Aim : To learn about binary search trees a. Deletion 2. Bangalore. b. Write a program to implement insertion sort b. d. Aim : To learn about pointers and strings a. 4. Aim : To learn about queues a. 7. b. Write a menu driven program to concatenate two strings and find the length of a string using pointers. Creation of a linked list and insertion. Aim : To learn about one and two dimensional arrays a. b. Write a program to implement merge sort. Aim : To learn about Searching Techniques a. Aim : To learn about various sorting techniques a. 5. 2. BCA syllabus . Write a program to implement different operations on a stack using a linked list. Insertion b. Write a program to implement different operations on a queue using a linked list. Aim : To learn about recursion a. Write a program to create a binary search tree and to perform Insertion and deletion 8. 6. Aim : To learn about singly linked list insertion and deletion a. Write a menu driven program to find the index of a pattern in a given string and to extract a substring using pointers. Towers of Hanoi with 3 pegs and n disks. b. Creation of a linked list and deletion.Christ University. Aim : To learn about stacks a. Write a program to implement different operations on a circular queue using an array. India 38 • • • The output of the programs should be neatly formatted The source code should be indented The programs should be interactive 1. Write a program to implement Binary Search 3. Write a program to implement Linear Search with sentinels b. Write a program to implement heap sort. Write a program to implement quick sort.
Names of countries & nationalities. Introduction of people Grammar – Verb position. Nouns (Article & Plurals) UNIT 5 : Describing one’s profession.Modal verbs & Prepositions TEXT BOOK: Moment Mal !  Publisher – Langenscheidt REFERENCE BOOKS: Sprachkurs Deutsch .Christ University.Definite & Indefinite articles. talking about daily routines Grammar . Bangalore. placing order in a restaurant Grammar – Variations of verbs. expressions of time. India 39 BCA 331: GERMAN LANGUAGE Total Teaching Hours: 45 UNIT 1: Greetings. types of sentences UNIT2: Describing a city. Months. Variations of verbs & Subject. using expresessions of times Grammar . Grammar . Nominativ & Akkusativ cases UNIT 4: Weekdays. about courses. Introduction to “Doch” UNIT 3: Numbers. 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 . giving directions.Breakable Verbs.
pendant vertex – null graph .B & C of digraphs .Directed path and connectedness Euler digraphs .connected graphs .B and C .disconnected graphs . India 40 BCA 332: GRAPH THEORY Total Teaching Hours: 45 UNIT 1: Definition of a graph-finite and infinite graphs .Vertex connectivity – Separable Graphs – Planar Graphs . (10 Hours) TEXT BOOK : Narasingh Deo : “ Graph Theory with Applications to Engineering and Computer Science” .Degree sequence .regular graph-isomorphic graph – sub graphs –walks – paths – circuits .Four Color Problem ( No theorems) Definition of Directed Graphs & Related definitions . (No theorems) (10 Hours) UNIT 2 : Cut sets and Cut vertices – Fundamental circuits and cut sets – Edge Connectivity .incidence and degree .Chromatic Partitioning – Chromatic Polynomial – Coverings .Christ University.Matrices A.Pendant Vertices in a Tree .components of a graph operations on graphs – Euler path & Euler graphs – Hamiltonian Paths & Graphs – Weighted graphs (No Theorems) Definition of Trees – Properties of Trees .Path Matrix – Adjacency Matrix.Kuratowski’s graphs – Different representations of Planar graphs (No Theorems).Arborescence – fundamental circuits in digraphs.Adjacency Matrix of digraphs (No Theorems).isolated vertex . Bangalore.Spanning Trees. of edges (Proof included) .Relationship between A.Distance and centers in a Tree . (15 Hours) UNIT 4 : Graph Theory . Narosa Publishing House BCA syllabus .Trees with directed edges . Incidence Matrix A – Circuit Matrix B – Fundamental Circuit Matrix – Cut Set Matrix C . Chromatic number . (10 Hours) UNIT 3 : Coloring of a Graph .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. PHI-India REFERENCE BOOK: F Harary : “Graph Theory” .sum of degrees equals twice the no.Rooted and Binary Trees .
Bangalore. Himalaya Publishing House 2.Christ University. Ashok Banerjee & K M Bansal : “ Introduction to Accounting” BCA syllabus . B. Raman: “Financial Management”. S. Jain & Narang: “Financial Management”.S. India 41 BCA 333: CORPORATE ACCOUNTANCY Total Teaching Hours: 45 UNIT 1: INTRODUCTION Meaning – accounting Principles. N Maheswary and S. S Grewal : “ Introduction to Accounting” 2. K Gupta “ Introduction to Accounting” 3.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. T. T P Ghosh . United Publication REFERENCE BOOKS: 1.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.
Christ University, Bangalore, India
BCA 334: SOFTWARE ENGINEERING
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.
Christ University, Bangalore, India
BCA 335: DATABASE MANAGEMENT SYSTEMS
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)
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.
keyword. constants. (03 Hours) BCA syllabus .fill(). nested if.setf() and unsetf()-Formatting flags-Manipulators-User defined manipulators. Tokens. (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(). Friendly functions. Bangalore. 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++ . (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. strings and operators. Control Structures-simple if.precision(). (03 Hours) UNIT 6: Function and Operator overloading . switch. Function overloading.Christ University. identifiers.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. while do.Comments-Output operator-Input operator-Cascading of I/O operators. 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. if else. 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.
Bjarne Stroustrup “The C++ Programming Language” Special Edition. Tata McGraw Hill Publication.tellg() and tellp()-Error handling during file operations-Command line arguments. BCA syllabus . Overloading of template functions (03 hours) TEXT BOOK: E Balaguruswamy “Object oriented programming with C++” Fifth Edition. Bangalore. Pearson Education Asia 2001. Pearson Education 3. 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().seekp(). (06 Hours) UNIT 11: Templates – Generic programming. Class templates with multiple parameters. Class templates.Christ University. 2006. K R Venugopal “Mastering C++” Tata McGraw-Hill Publication. 2. Deitel and Deitel “C++ How to program”. Function templates. Third Edition. 2001 REFERENCE BOOKS: 1.
Aim : To learn about copy constructor 8. Aim : To learn about function overloading 2. merge etc. Aim : To learn about default arguments 3. Aim : To learn about dynamic memory allocation and deallocation(new and delete) using constructors and destructors. Aim: To learn about multiple inheritance and hybrid inheritance 16. Aim : To learn about I/O Streams and database file creation and display BCA syllabus . Aim : To learn about subscript operator overloading 13. Aim : To learn about friend functions 10. Aim: To learn about text file creation and manipulation (copy. Aim : To learn about classes and objects 5. Aim : To learn about Binary operator overloading 12. pass by reference and return by reference 4.) 18. Aim : To learn about Unary operator overloading 11. 15. Aim: To learn about simple and multi level inheritance. Aim : To learn about default constructors 6. Aim: To learn about constructor overloading 7. India 47 BCA 351: C++ LAB Guidelines: • The output of the programs should be neatly formatted. Aim : To learn about pass by value. Bangalore.Christ University. • 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 learn about static functions 9. 14. Aim : To learn about virtual functions 17.
d. i. f. The Concatenation Operator Elements of the SQL Query: Arithmetic Column Aliases String Functions Arithmetic Functions Date Functions Mixed Functions Operator precedence 3. d. c. b. India 48 BCA 352: ORACLE LAB Total: 60 Hours 1. d. d. e. c. 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. Filtering Data Using Where a. g. Nesting Different Functions Decode Crosstab Decode with ">". f. e.Christ University. b. b. c. Where Operators Where with Keywords Where and Logical Operators Where and Soundex (04 Hours) BCA syllabus . c. b. Advanced SQL Functions a. SQL Functions a. Bangalore. h. SQL*Plus and SQL a. e. "<" & "=" Select with Minus Union and Intersect Handling NULL (04 Hours) 4. h. g.
c. b. Drop Alter Keywords Tables Column Views Synonyms Sequences Object Alter table (05 Hours) BCA syllabus .Christ University. f. Create. Joining Tables (Equi-Joins) Aliases for Table Names Joining Tables (Non-Equi-Joins) Joining Tables (Outer Joins) Joining Tables (Inner Joins) Virtual table 6. Group Function Examples b. g. c. b. d. b. Group Function with Having 7. Retrieving Data from Multiple Tables a. d. f. d. Group By and Group By Functions a. Sub-Queries Hours) a. Data Definition Language (DDL) a. e. c. Basic Subqueries Multiple Column Subqueries Subqueries with Having Correlated Subqueries (03 Hours) (04 8. e. Bangalore. India 49 (05 Hours) 5. h.
b. b. e. c. e. c. d. Data Security Grant and Revoke Session control statements System control statements (02 Hours) 13. b. e. Integrity Constraints a. Types of Constraint Referential Integrity Defining Constraints Integrity Constraints and Data Dictionary Disabled constraints (03 Hours) 10. c. d. b. d. Data Manipulation Language (DML) a. Rollback and Savepoints) Locking tables (04 Hours) 12.9. Data Control Language (DCL) a. Using SQL*Plus SQL*Plus Command Variables Building SQL*Plus Reports Titles and Headings (02 Hours) . d. Indexes a. c. c. b. f. Introducing SQL*Plus for Reporting a. Insert Update Delete OPS Commands (Commit. Create Index Unique Option When and What to Index Drop Index Validate Index Index Type Overview (02 Hours) 11. d.
Bangalore. c. f. b. h. PL/SQL a. g. e.MPH Christ University. 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 . d. India 51 (14 Hours) 14.
sales letters. The student is trained in all areas of organizational communication. Urmila Rai and S M Rai: “Business Communication” BCA syllabus . bank correspondence. Agenda. (10 Hours) UNIT 3: Preparation of Notice. Technical report. collection letters. UNIT 1: LETTER WRITING All types of Letters – both formal and informal Business Letters – enquiries and replies. circular letters. (25 Hours) UNIT 2: PREPARATION OF REPORTS Technical and Non Technical – Sales report. Newspaper report and Performance report. India 52 BCA 431: TECHNICAL ENGLISH Total Teaching Hours: 45 The syllabus for this semester prepares the student in the application concepts of communication.MPH Christ University. Bangalore. Rajendra Pal and Korla Halli: “Essentials of Business Communication” Dr. complaints and adjustments. credit and status enquiries. 2. Minutes and Resolutions of meetings (10 Hours) REFERENCE BOOKS: 1.
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. BCA syllabus . Sasthry S S : “ Numerical Analysis “ .Matrix inversion method .PHI-India REFERENCE BOOK: 1. Wiley Eastern India Ltd. Bangalore.MPH Christ University. Iyengar & Jain : “ Numerical Methods for Scientific and Engineering Computations “ . Jain .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 . India 53 BCA 432: NUMERICAL TECHNIQUES Total Teaching Hours: 45 UNIT 1: Solution of Algebraic and Transcendental equations .
Dr. Himalaya Publishing House REFERENCE BOOKS: 1. N. K P Rustogi : “Fundamentals of Financial Management ” 3. Bangalore. R K Sharma & S K Gupta : “ Financial Management ” 2. S. (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. Dr.MPH Christ University. S. Maheswari : “ Financial Management “ . Sathyaprasad : “ Financial Management “ . Chand 2. India 54 BCA 433: FINANCIAL MANAGEMENT Total Teaching Hours: 45 UNIT 1: INTRODUCTION Meaning – Objectives of Financial Management – Time Value Money calculation – Financial market. I M Pandey : “ Financial Management ” BCA syllabus .
Architecture. Flow Control. IEEE 802. Modems. India 55 BCA 434: COMPUTER NETWORKS – I Total Teaching Hours: 45 UNIT 1: Introduction to Data Communication – Network Models. Token Ring.Packet Layer Protocol. (08 Hours) UNIT 4: ISDN. “Data Communications and Networking”. Pearson Education Asia. BCA syllabus . (06 Hours) UNIT 7: Network Security Requirements and Attacks. QoS.Connection-Oriented. Circuit Switching. (05 Hours) TEXT BOOK: 1. Message Switching. Routing Algorithms – Distance-vector routing. Frame Relay – Operation. Broadband ISDN. Shay. LANs-Applications.Interface standards.Tannenbaum.MPH Christ University. Second Edition. Sixth Edition. Connectionless. William A. EIA-530. Standards Organizations. Line Configuration. EIA-202 and x. TATA McGrow-Hill publications. “Computer Networks”. Transmission Mode. William Stallings.. Firewalls. Classification of Networks.3 LANs. ISDN Layers. 2003. Packet Switching. 2001. Congestion Control. Connection Management. Andrew S. Connection Oriented and Connectionless Services. Parallel and Serial Transmission DTE/DCE/such as EIA -449. Bangalore. Second Edition. 2001. shortest Path routing. RPC. IDS (Intrusion Detection system). Behrouz A. Transmission Impairment.21 interface . HDLC. Internetworking. Applications (06 Hours) UNIT 5:Principles of Internetworking. (06 Hours) UNIT 3: Multiplexing. Data Compression Techniques. Guided Media.6. Vikas Publishing House. Second Edition. OSI Reference Model (08 Hours) UNIT 2: Analog and Digital Signals. Unguided Media. Performance. 802. Translation. Link state routing. Protocols and Architecture. X. ATM – Goals. Network Devices (06 Hours) UNIT 6: Transport Layer services. LLC. 3. Data Encoding. Public Key Encryption and Digital Signatures. Routing Concepts. Architecture. Forouzan. Tata McGrawHill Publishing Company Limited NewDelhi REFERENCE BOOKS: 1. Error Detection and Correction. Ethernet. Elements of Transport protocols. Session Layer Services. “Data & Computer Communications”. FDDI. Topology. Synchronous and Asynchronous transmission. “Understanding Data Communication and Networks”. Layers. 2.25 Layers .
Performance Analysis – Space complexity and Time complexity (posteriori testing. (06 hours) UNIT 2: Divide and Conquer Algorithms – Introduction to Divide and Conquer Algorithms . pseudo code for insertion sort and analysis of time complexity.Finding the Maximum and Minimum.NQueens Problem. Behrouz A. Forouzan “Data structures A Pseudocode approach with C” BCA syllabus . Third Edition. GAV PAI. Best and Worst case complexity. Quick sort (Derivation of Average case analysis and Worst case analysis). Pearson Education 3. Polynomial vs. “The Art of Computer Programming” Volume 1. Richard F. Average. Bangalore. Minimum cost spanning trees Kruskal’s and Prim’s Algorithms. Knuth. Knuth. “The Art of Computer Programming” Volume 3. “Data structures and Algorithms”. Rajasekaran. fundamental algorithms. Traveling Salesman problem using branch and bound method (07 hours) UNIT 6: Graphs and Heaps – Definitions – Adjacency Matrix. Sorting and Searching. Gilberg. Optimal Merge patterns and Single-Source Shortest Paths (07 hours) UNIT 4: Dynamic Programming – Definition . Sahni. Binary Search (Derivation of average case analysis). Θ). Asymptotic Notations (O. Sum of Subsets problem using Back tracking algorithms.” Galgotia Publications. Ω. Exponential Algorithms. Donald E.Fractional Knapsack problem. India 56 BCA 435: ANALYSIS AND DESIGN OF ALGORITHMS Total Teaching Hours: 45 UNIT 1: Introduction-A simple example of design using insertion sort. Donald E. Pearson Education 2. Traveling salesman problem and optimal parameterization for product of sequence of matrices (06 hours) UNIT 5: Back tracking and Branch and Bound Algorithms – Introduction . Breadth First Search and Traversal. 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. Second Edition.MPH Christ University. 1996 REFERENCE BOOKS 1.All-pairs shortest paths. Tata McGraw Hill 4. and Strassen’s Matrix Multiplication (07 hours) UNIT 3: Greedy Algorithms – Introduction to Greedy Algorithms . Depth First Search and Traversal. Adjacency Lists. “Fundamentals of Computer Algorithms.
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. Packages and Interfaces .MPH Christ University. (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. Multithreaded Programming .Handling events by extending AWT components.Implementing interfaces-Variables in interfacesExtending interfaces. (04 Hours) UNIT 5: Java. Layout Managers and Menus – Control fundamentals-Labels-Buttons-CheckBoxes-CheckBoxGroup-ChoiceControl-ListsScrollBar-TextField-TextArea-LayoutManagers-MenuBars and Menus-DialogBoxesFileDialog. throws and finally-Built-in Exceptions. (04 Hours) UNIT 3: Inheritance .Uncaught Exceptions .throw. Classes and Objects .Types .The Java Thread Model. (08 Hours) BCA syllabus .Thread Priorities.Creating a Multilevel HierarchyOrder of calling constructors-Method Overriding-Dynamic method dispatch-Abstract classes-Using final with Inheritance.Multiple catch Nested Try .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.Super class variable referring to a sub class-Applications of keyword super.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. (08 Hours) UNIT 2: String Handling .Modifying a String.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.String Constructors-String length-String Literals-String Concatenation-String concatenation with other data types-String conversion and toString().String Comparison-Searching Strings.try and catch .Character Extraction.Defining a packageCLASSPATH -Defining an Interface . (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(). (08 Hours) UNIT 4: Exceptions. Boolean logical.Synchronization. Relational and Bitwise operators-Operator Precedence. Bangalore. India 57 BCA 436: PROGRAMMING IN JAVA Total Teaching Hours: 45 UNIT 1: Introduction .Basics-Member Access and Inheritance.Data Conversion and valueOf()-Changing the case of characters-String Buffer.
E. Tata McGraw-Hill Publishing Company Limited: NewDelhi REFERENCE BOOK: 5. “The Complete Reference. “Java Programming”. Deitel and Deitel.Java”. Herbert Schildt. Prentice Hall 6.MPH Christ University. Seventh Edition. Balagurusamy “Programming with JAVA a Primer”. Tata McGrawHill Publishing Company Limited: NewDelhi BCA syllabus . Bangalore. India 58 TEXT BOOK: 1.
Aim: To demonstrate MenuBars and Menus. BCA syllabus . Aim: Demonstrating the use of methods of Math class. Aim : To demonstrate ScrollBars with proper events 17. Aim : To demonstrate FileInputStream and FileOutput Stream Classes 9.MPH Christ University. Aim : To demonstrate inheritance 5. Aim : To demonstrate Lists and TextFields with proper events 16. Aim : To demonstrate super and this 6. India 59 BCA 451: JAVA PROGRAMMING LAB Guidelines: • • • • • • The output of the programs should be neatly formatted. Aim : To Demonstrate the creation of applets and passing parameters to applets 10. Aim: To demonstrate Dialog boxes. 2. Aim: To Demonstrate the creation of a frame. Aim : To demonstrate Checkboxes with proper events 14. Aim : To demonstrate static variables and methods 7. Bangalore. 18. Aim : To demonstrate Exceptions 8. Aim : Programs to implement the methods of String class 3. Aim: To Demonstrate Labels and Buttons with proper events 13. Aim : To Demonstrate interfaces 4. 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 CheckBoxGroups with proper events 15. 12. Aim :To Demonstrate Mouse and Keyboard events in an applet 11.
Students should be divided into batches. 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. Validation 3. Interface Design 2. The practical examination carries 100 marks divided as follows: 1. Viva Voce 20 marks 10 marks 10 marks 10 marks Continuous Internal Assessment 50 marks BCA syllabus . Bangalore. each batch containing not more than four students. Reports/Presentation 4.MPH Christ University.
Proposals . 3rd Edition. Gerson and Steven M. Paul. 1995. Special Notices. User Guides. Sharon J. Context Sensitive Help (15 Hours) UNIT 7: FrameMaker -How to create FrameMaker Documents. Technical Writing Process and Product. Templates . Images. Science and Technical Writing-A manual of style. Browse Sequences. 3 rd edition. Lists . Tables. 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. Header and Footer. Progress Reports . 2nd edition. Help System Components . Philip Rubens. Report Format and Final Packaging. Structured Framemaker . Creating Hypertext and viewonly documents. Graphics. DDLC (05 Hours) UNIT 3: Document Design Book Design . Business Plans . Color Models. Basic Steps in Creating a Help File. Technical Editing . Graphics. Tables. 3. Headings . BCA syllabus . 2. Highlighting and Emphasis. 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 . Instruction Manuals. Adding graphics to paragraph formats.2004. 2004.Page Layout. Creating Table of Contents and Indexes. Inserting Images. Page Design . Linking and Navigation . Types of Help. Technical Writing . Bangalore.A Reader Centered Approach. Gerson. Oral Presentations. REFERENCES: 1.Text-only Pop-ups.Text Formatting. Anderson. Using CSS. Master Pages. Conditional Text.MPH Christ University. Build Tags.V.
mail. (08 Hours) UNIT 3: UNIX PROCESS MANAGEMENT The Structure of Processes: Process States and Transitions .Kernel Data Structures – Introduction to System Calls – Types of System Calls.pipes . 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 . (10 Hours) UNIT 4: UNIX SHELL COMMANDS & Utilities Types of shells – Features of Bourne.Unix Kernel .killing a process . ftp.Write .I/O redirection and piping .Cursor Movement Commands .File creation Creation of special files .File compression .Operating System Services . (10 Hours) BCA syllabus .Miscellaneous Commands .Link and Un link.scheduling of processes.Changing directory and root .nohup command . send.Conversion of a path name to an inode Super block .File related commands Disk related commands .Lseek – Close .stat and fstat .Saving and Exiting . wall.Structure of a regular file – Directories .Inode assignment to a new file . mesg.changing owner and mode .Allocation of disk blocks.Alphabetical List of Keys Communicating with Other Users: who.Edit Commands .Dup . (05 Hours) UNIT 2: THE UNIX FILE SYSTEM Inodes .System Concepts .changing process priorities .Architecture of Unix .Layout of system memory Context of a process. C and Korn shells . System calls for the file System: Open – Read .Creating files and directories Listing files and directories .Removing files and directories . Bangalore.Background processes .Mounting and Un mounting file systems . Process Control: Process Creation – Signals – Process Termination – Invoking other programs – PID & PPID – Shell on a Shell.MPH Christ University. Text Editing with vi Editor: Different Modes .
India 63 UNIT 5: UNIX SHELL PROGRAMMING Shell variables .MPH Christ University.NewDelhi REFERENCE BOOKS: 1.Used defined Functions – System Shell Script files: .NewDelhi Vijay Mukhi.Nested if . NewDelhi.Passing command line arguments . 2.NewDelhi BCA syllabus .Positional parameters . Maurice J Bach.Arithmetic in shell scripts .Read and Echo . “Understanding Unix”. “The Design of Unix Operating System”. Bangalore.while-until –for . Etc.profile. (12 Hours) TEXT BOOKS: 1. “Unix Shell Programming”. Prentice Hall of India Pvt. 1986.break and continue .Case control structure – Loops . .. BPB Publications.Exporting variables .Shell meta characters . Ltd. Yashavant P Kanetkar. “Unix Shells-Bourne-Korn-C”. 2.Shell Keywords .history . BPB Publications.Control Structures .if-then-fi if-then-else-fi . Stan-Kelly-Bootle. BPB Publications.
Harrington Steven.MPH Christ University. . color and intensity. (05 Hours) UNIT 2: Points and lines: DDA and Bresenham’s line drawing algorithm. curved lines and surfaces. REFERENCE BOOKS: 1. display devices random scan and raster scan systems. 1996. Matrix representations and homogeneous co-ordinates. three dimensional and stereoscopic views. Three dimensional display methods: Parallel projection(mathematical expression). (04 Hours) UNIT 6: Polygon surfaces. window to viewport transformation.Blobby objects . W M Newman & Sproul R F. viewport. Midpoint circle and DDA circle algorithm. color CRT. Polygon clipping: Sutherland Hodgeman and Weiler-Atherton polygon clipping Algorithms. Practical applications of computer graphics. spline representations. Bangalore. visible line and surface identification. Principles of Interactive Computer Graphics 2. exploded and cutaway views. line clipping: Cohen Sutherland line clipping. Visible surface detection algorithms. Bezier curves and properties. Flat panel displays Display processors. line styles. rotation and scaling. Text clipping. Prentice Hall of India pvt ltd. Sweep representations. Computer Graphics. surface rendering. (10 Hours) UNIT 5: Three dimensional co-ordinate systems. depth cueing. plane equations. polygon meshes. Computer Graphics. area filling. perspective projection(mathematical expression). BSP trees. : Introduction to graphics. rotation and scaling.A Programmers approach BCA syllabus . Liang barsky line clipping. (08 Hours) UNIT 3: Two dimensional transformations: translation. (5 Hours) TEXT BOOK: D Hearn and Baker M P. Fractals (07 Hours) UNIT 7: Three dimensional transformations: translation. composite transformations (06 Hours) UNIT 4: Concept of a window. India 64 BCA 533: COMPUTER GRAPHICS Total Teaching Hours: 45 UNIT 1. octrees. polygon tables.
SECTION – B 11. delete the file e. 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. Write a Shell Script to print the multiplication table.MPH Christ University. copy the file c. 4. Write a Shell Script to convert a binary number to its decimal equivalent. India 65 BCA 551: UNIX LAB SECTION – A 1. 7. Students marks sheet processing. 13. Write a shell program to convert all lower case into upper case and vice versa in a file using command line arguments. 2. 5. check if the file is ordinary file and is readable c. 15. ask the user to enter a filename b. Write a shell program to remove the files of the same size in the current directory 9. Write a shell program to find the largest of 3 numbers using command line arguments. create a file b. 10. Considering various allowances (TA. Write Shell Scripts to compute the factorial value with and without using recursive functions. exit 12. File handling system. move the file d. Write a Shell Script to prepare and display the Electricity bill with significant considerations. Bangalore. a. Write a shell program to find sum of digits of a given number. 3. 8. display the file if the file is ordinary and readable d. Write a shell program to compare two strings given by the user. DA. Write a shell program to concatenate the contents of two files. Write a menu based program to permit or remove read/write/execute permission of a file. display an error message if the file is not ordinary and/or not readable BCA syllabus . Write a shell program to calculate the net salary of an employee in a particular month. 6. write a shell program which will a.
SECTION-B 14. Animation. Line using (a) DDA algorithm and (b) Bresenham’s algorithm 2. 17. 18. Flood fill algorithm.MPH Christ University. Bezier Curves. 13. Horizontal histogram. Scan-line area filling. cardioid. (b) with respect to X-axis (c) with respect to Y-axis (d) With respect to the line Y=X. Implementation of Sutherland-Hodgeman polygon clipping algorithm. 12. Implementation of Liang Barsky algorithm for line clipping. BCA syllabus . Section-B . Rotation of a triangle: (a) With respect to the origin. 4.Man walking with an umbrella. 7. Shearing of a rectangle (a) With respect to x axis (b) With respect to y axis 8.Programs are for demonstration. Pie-chart. SECTION-A 1. 15. Translation and scaling of a rectangle.Programs are for execution. (b) With respect to a pivot point. Reflection of a circle: (a) With respect to the origin. four leaf and limacon. Circle using (a) DDA algorithm and (b) Midpoint circle algorithm 3. Implementation of Cohen-Sutherland line clipping algorithm. 11. 9. 6. 5. 16. 10. Write a program showing (a) line styles and (b) area filling. Bangalore. Write a program to spiral. India 66 BCA 552: COMPUTER GRAPHICS LAB Section-A . Vertical histogram.
Students should be divided into batches. The practical examination carries 100 marks divided as follows: 1.MPH Christ University. Viva Voce 10 marks Continuous internal assessment 50 marks BCA syllabus . Validation 10 marks 3. Reports/Presentation 10 marks 4. Bangalore. 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. each batch containing not more than four students. Interface Design 20 marks 2.
VLSM. RTT Estimation. Multiplexing. Protocols and Architectures”. Multicasting – IP Multicast Addresses. Richard Stevens. TCP Timers. Demultiplexing & Ports. REFERENCE BOOKS 1. W.Passive and Active Opens. Loopback Interface (06 Hours) UNIT 3: IP Routing Principles. Traceroute program. OSPF. Internet Addresses. TCP . Comer. (08 Hours) UNIT 5: DNS – Basics. DNS Message Format. 4.Subnetting. TCP/IP Layering. (06 Hours) UNIT 7: IPV6 – Features. (05 Hours) UNIT 6: FTP – Protocol. NFS. Use of Multiple Headers. Operations. “Internetworking with TCP/IP Principles. Prentice Hall. (10 Hours) UNIT 4: UDP Header. BGP. Resolution. IPV4 Vs IPV6. Process Model. Behrouz A. Pearson Education. Physical addresses. 2001. TELNET Protocol. “TCP/IP Protocol Suite”. “Computer Networks and Internets with Internet Applications”. Supernetting. Layering of communication process. Kurose and Ross. Comer. First Edition. Sliding Windows. POP. India 68 BCA 541A: TCP/IP Total Teaching Hours: 45 UNIT 1: Evolution of open Networks. Douglas E. Maximum Datagram Size. Douglas E. standardization.MPH Christ University. HELLO. 2002. RARP – Overview. Volume 1. Forouzan. Primary and Backup RARP Servers. Pearson Education Asia. CIDR. “Computer Networking. IGMP. IEEE & MACs. “TCP/IP Illustrated” . TCP Connection Establishment and Termination. MIME. TATA Mc-Grow-Hill publications. Rlogin – Protocol. (07 Hours) UNIT 2: Link Layer Encapsulation. 2003 3. SMTP – Protocol. IMAP. Delayed Acknowledgement and Nagles Algorithm . UDP Checksum. TFTP. Fourth Edition. BCA syllabus . Routing IP Datagrams. Cache & time outs. Caching. Third Edition. Datagram format. 2. Second Edition. Bangalore.A Top-Down Approach”. Pearson Education Asia. Volume 1. ARP – Operations. RIP. (03 Hours) TEXT BOOK 1. 2000. 2001. Internetworking Concept and Architectural Model.
Comer. VLAN. Needs and services of LAN. Storage Area Networks. Bangalore. Fourth Edition.11 (12 Hours) UNIT 4: INTERNET Internet – Introduction. William Stallings. Internet Client & Server. (05 Hours) TEXTBOOKS 1. IMAP. Evaluation of LAN. POP. standardization. FTP – Protocol. TFTP. TCP/IP Layering. NFS. Internet Addresses. IGMP. IEEE 802. Volume 1. 2002. E-Commerce. Thomson Brooks/Cole. 2. SONET. 3. Anonymous FTP. Internet Infrastructure. Computer Communications and Networking Technologies. (12 Hours) UNIT 3: HIGH SPEED NETWORKS The need for High speed networks and quality of service. Internetworking with TCP/IP Principles. Archie. High speed Ethernet. Hand book of LAN technology. Wireless LANS. Jughead. Gopher. 2002. MIME. Paul J Fortier. RARP . Frame Relay. Rlogin – Protocol. 2002. TELNET Protocol. India 71 BCA 541B: COMPUTER NETWORKS . IRC. Harley Hahn. Douglas E. WWW. Physical addresses. SMDS.TCP. Web Security (08 Hours) UNIT 5: NETWORK CONVERGENCE Principles and applications of network convergence. 2. Michael A. 2002. SMTP – Protocol.1992 REFERENCE BOOKS 1. Second Edition. ARP. ATM. IP. First Edition. Application of Internet. Designing a LAN. Usenet. IPV6 – Features IPV4 Vs IPV6. HTTP. Tata McGraw-Hill Publishing Company Limited. Supernetting. Veronica. OSPF. Trace route Program. BCA syllabus . McGraw Hill International Edition. The Internet Complete Reference. (8 Hours) UNIT 2: TCP/IP Evolution of open Networks. DNS. RIP. Second Edition.MPH Christ University. Pearson Education Asia. High Speed networks and Internet. Subnetting. UDP . Gallo. Second Edition. Protocols and Architectures. Pearson Education.II Total Teaching Hours: 45 UNIT 1: LAN Introduction to LAN.
Dhamdere. Donovan.Two-Pass macro processor with flowchart (08 Hours) UNIT 4: Loaders and Linkers: . Storage Assignment Phase. Leland L Beck. General Machine Structure . Sethi & Ullman . Systems Programming. McGraw-Hill Education. Code Generation Phase and Assembly phase. Syntax Phase. (07 Hours) UNIT 2: Assembler . Address modification using instruction as Data and Index registers. Looping. Design of an Absolute Loader (10 Hours) UNIT 5 :Compilers . Features of Macro facility (i) Macro instruction argument (ii) Conditional Macro expansions (iii) Macro call within Macros Implementation. Algorithm (2-pass assembler) in brief with flowchart (10 Hours) UNIT 3: Macro Language and the Macro Processor: Macro instructions.An introduction to systems programming” .Different phases.Lexical Phase.What is System Software? Evolution of Components of a Programming System. 1991 REFERENCE BOOK: 1. 1987 2. Tata McGraw-Hill.Statement of Problem.Memory.M. Overlays. Aho. Linking loaders.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.2002 BCA syllabus . 2. “Introduction to System Software” . Dynamic Binders. Design of Assembler. Registers. Passes of a Compiler with flow chart. (10 Hours) TEXT BOOK: 1. Data Structures. Pearson Education. Assembly Language Program using Literals and pseudo -ops. “System Software. Addison –Wesley. Data and Instructions. Compilers Principles. 3rd Edition. Machine Language . Format of Databases. India 72 BCA 542B: SYSTEM SOFTWARE Total Teaching Hours: 45 UNIT 1: Introduction . D. Bangalore.MPH Christ University. Optimization Phase.General design procedure. John J. Interpretation Phase.No Looping. techniques and tools.
Interactive system real time simulation. Production and management segments. Static and dynamic mathematical models. Narsingh Deo. Jerry Banks: Discrete event System Simulation. 1982. Progress of a simulation study.MPH Christ University.The concept of a system. Case study .Continuous system model. design and postulation. Gathering statistics. System analysis. Distributed lag models. 4. Mc-Graw-Hill. Representation of time. (08 Hours) UNIT 6: Introduction to GPSS: General description. discrete simulation languages. Facilities and storage.Generation of arrival patterns. Bangalore. Simulation of programming tasks.Monte Carlo method. 1990. Experimental nature of simulation. Measuring utilization and Occupancy. Types of models. comparison of simulation and analytical methods. Recording distribution and transient times.Simulation of Inventory system. 2001. (06 Hours) UNIT 2: System Studies: . Academic Press. Payer: Introduction to Simulation. Types of system simulation. (7 Hours) UNIT 3: Techniques of system simulation: . System simulation with Digital Computer. Continuous and discrete systems modeling. Succession of events. 1982 2.Pure Pursuit problem. Sprite: Computer Aided Modeling and Simulation. (12 Hours) UNIT 5: Continuous system simulation: . Waterfall simulation. Numerical computation techniques for continuous and discrete models. principles used in modeling. Choice of paths. Gordon: “System Simulation” 2nd Edition. Prentice Hall. study and use of one simulation language. Hybrid Simulation. (04 Hours) TEXT BOOK: 1. India 73 BCA 631: SYSTEM SIMULATION Total Teaching Hours: 45 UNIT 1: Models: . REFERENCE BOOKS: 1.1999 BCA syllabus . Prentice-Hall of India. System environment. Environment. (08 Hours) UNIT 4: Discrete system simulation: . Telephone system. 3. Stochastic activities.Sub systems. Case study. Conditional transfer program control statement. Gathering Statistics. Types of systems study. Pearson educational International Series.Discrete events.
Reliability. A Ring Algorithm) – Atomic Transactions – (Introduction to Atomic Transactions. Threads Usage. Session layer. Use of Synchronized Clocks) – Mutual Exclusion – (A Centralized Algorithm. Implementing a Threads Package) – System Models – (The Workstation Model. Distributed Deadlock Prevention) (10 Hours) UNIT 4 : Processes and Processors in Distributed Systems: Introduction – Threads – (Introduction to Threads. Buffered versus Unreliable Primitives. Multiprocessor Timesharing Systems) – Design Issues – (Transparency. An Example Client and Server. Parameter Passing. Real-Time Communication. Synchronous versus Asynchronous Systems. Using Idle Workstations. Bus-Based Multicomputers.Clock Synchronization – (Logical Clocks. Switched Multicomputers) – Software Concepts – (Network Operating Systems. Clock Synchronization Algorithms. Agreement in Fault Systems) – Real-Time Distributed Systems – (What is a Real-time System?. Design Issues for Threads Packages. Physical Clocks. Data link layer. Problem Areas) – Group Communication – (Introduction to Group Communication. Disadvantages of Distributed Systems) – Hardware Concepts – (Bus-Based Multiprocessors. Dynamic Binding. Concurrency Control) – Deadlocks in Distributed Systems – (Distributed Deadlock Detection. Design Issues for Processor Allocation Algorithms. Application layer) – Asynchronous Transfer Mode Network – (What is Asynchronous Transfer Mode?. Fault Tolerance Using Active Replication.MPH Christ University. System Failures. A Distributed Algorithm. Switched Multiprocessors. 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. Group Communication is ISIS) (10 Hours) UNIT 3: Synchronization in Distributed Systems: Introduction -. Bangalore. Network layer. Some Implications of ATM for Distributed Systems) – The Client-Server Model – (Client and Servers. A hybrid Model) – Processor Allocation – (Allocation Models. Performance. True Distributed Systems. Block versus Nonblocking Primitives. Flexibility. The Processor Pool Model. Implementation Issues. Addressing. ATN Adaptation Layer. ATM Layer. Implementation Issues for Processor Allocation Algorithms) – Scheduling in Distributed Systems – Fault Tolerance – (Component Fault. Use of Redundancy. A Comparison of the Three Algorithms) – Election Algorithms – (The Bully Algorithm. RPC Semantics in the Presence of Failures. Presentation layer. Design Issues. Advantages of Distributed System over Independent PCs. Implementing the Client-Server Model) – Remote Procedure Call – (Basic RPC Operation. Design Issues. Real-Time Scheduling) (10 Hours) BCA syllabus . A Token Ring Algorithm.Layered Protocols – (Physical layer. ATM Physical Layer. Transport layer. Implementation. the Transaction Model. ATM Switching. Scalability) (08 Hours ) UNIT 2 : Communication in Distributed Systems : Introduction -.
The Directory Server Interface. Prentice Hall of India. Distributed Operating Systems.. Inc. 2001 2. Pearson Eduction Asia. Singhal Mukesh. System Structure. India 75 UNIT 5 : Distributed File Systems :Introduction – Distributed File System Design – (The File Service Interface. Tanenbaum S Andrew. Replication. 2002 REFERENCE BOOKS: 1.MPH Christ University. 2003 BCA syllabus . Mobile Users. Shivaratri G Niranjan. Advanced Concepts In Operating Systems Distributed Data Base. Multimedia) (07 Hours) TEXT BOOK: 1. Caching. Bangalore. Semantics of File Sharing) -Distributed File System Implementation – (File Usage. Fault Tolerance. Lessons Learned) – Trends in Distributed File Systems – (New Hardware. Distributed Systems Principles and Paradigms. Scalability. An Example: Sun’s Network File System. Wide Area Networking. Tanenbaum S Andrew. McGraw-Hill. And Multiprocessor Operating Systems.
“Digital Multimedia”. Digitised Documents. REFERENCE BOOKS: 1. Formatted Text. Pearson Education. 2001. Chapman. Arithmetic Coding. 2. “Multimedia Communications – Applications. Steinmaetz. Fred. Protocols and Standards”. BCA syllabus . (07 Hours) UNIT 3: Image Compression: Graphics Interchange Format (GIF). Audio – PCM Speech. Encoder Design. 2000. Klara. (05 Hours) UNIT 5: Video Compression: Principles. Tagged Image File Format (TIFF).personnel Communication. Lossless and Lossy Compression. Adaptive Predictive Coding and Linear Predictive Coding. Bangalore. Interactive Applications over the Internet. Hyper Text. Video – Broadcast Television. Decoder Design. (06 Hours) UNIT 6: Multimedia Applications: Inter. (05 Hours) TEXT BOOK: 1. Pearson Education. Adaptive Differential PCM (ADPCM).Graphics. MPEG 2 and MPEG 4. Synthesized Audio. Entropy Encoding.MPH Christ University. Digital Video. 2003. JPEG. Networks. Nigel and Chapman. Text Compression – Static and Dynamic Huffman Coding. PC Video. Images. Text – Unformatted Text. Digitised Pictures. Digitization Principles – Analog Signals. Ralf and Nahrstedt. H. Halshall. (07 Hours) UNIT 4: Audio Compression: Differential Pulse Coded Modulation (DPCM). Jenny. MPEG Audio Coding. India 76 BCA 642A: MULTIMEDIA COMPUTING Total Teaching Hours: 45 UNIT 1: Multimedia Information Representation: Introduction. (15 Hours) UNIT 2: Text Compression: Compression Principles – Source Encoder and Destination Decoder. Entertainment Applications and Multimedia Conferencing. MPEG 1. Video Content. Digitised Documents. Source Encoding. CD – Quality Audio. John Wily & Sons. Multimedia : “Comunications and Applications”.261 Video Compression.
BCA syllabus . 5.Tribel “16 Bit Microprocessor. ISBN 81-224-0710-2 REFERENCE BOOKS 1. ALU. Data Bus. McGraw Hill Publishing Company. serial I/O ports (06 Hours) UNIT 2 : Architecture of 8085 MPU – Registers. (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.V. Addressing Modes. Architecture. Externally initiated signals.5. 6. Calculation of execution time for a program with examples (06 Hours) UNIT 4: Introduction to 8085 programming – Instructions – Classification. (05 Hours) TEXT BOOK 1. Software and Interface Techniques”. Bangalore.MPH Christ University. Timing analysis. 1985. Ramesh. Delays. 2.5 – RST. Instruction Decoder. D. India 77 BCA 641B: MICROPROCESSORS Total Teaching Hours: 45 UNIT 1 : Introduction to Microprocessor 8085 –Signals -Address Bus. Ajit Pal “Microprocessor Principles and Applications”. Tata McGraw Hill. Timing and Control Unit. Interrupt Control Unit. Flags.S. (07 Hours) UNIT 6: Interrupts -. PC. Avatar Singh and Walter A. Stack.Introduction – Vectored Interrupts and Locations -. Control & status signals.5. Address/Data Buffers (08 Hours) UNIT 3: 8085 Machine cycles and bus Timings – Opcode Fetch Machine cycle.Hall “Microprocessor and Digital System”. I/ O/Memory Read/Write Machine cycles. TRAP. Power supply and Frequency signals. 3. Programming & Applications With 8085/8080a” – Penram International – 1997. Format. Subroutines.INTR. SIM and RIM instructions. RST 7. Serial I/O Control. 1990. Programming Techniques. 1990. Timing diagram.Goankar “Microprocessor Architecture. PHI.
REFERENCE BOOK 1. P. Tags. (05 Hours) UNIT 2 : Processor Design – CPU Organization – Fundamentals – User and Supervisor Modes – CPU Operation – Instruction Set – Data Representation – Basic Format – (Word length. Williams. (20 Hours) TEXT BOOK 1. Fourth Edition. Carry Look Ahead Adder) – Multiplication – (Two’s Compliment Arithmetic) -.” Microcomputer System. India 78 4. (10 Hours) UNIT 4: Memory Organization – Memory Technology – Memory Device Characteristics – (Memory Types.Division by Repeated Multiplication – ALU Design – (Combinational and Sequential ALU). Prentice Hall.(Basic Formats. 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. Normalization. Hayes. Virtual Memory. & Biasing. “Computer Architecture and Organization” Third Edition – McGraw-Hill. Stalling. Locality of Reference. BCA syllabus . Semiconductor RAM. Optical Memories) – Memory Systems – Multilevel Memories – (General Characteristics. Yu. Access Modes. Performance & Cost. Base Addressing) – Cache – (Main Features. RAM Design. Error Detection & Correction) – Signed Numbers – Exception Conditions – Floating Point Numbers -. 8086/8088 Family”.Cheng Liu & Glenn A Gibson. Address Translation. Bangalore. Memory Retention) – Random Access Memory – (Organization. International Editions.MPH Christ University. Magnetic Disk Memories. Cache Organization. Standards) – Instruction Set -(Instruction Format. Overflow. Relative Addressing) – Instruction Type – (Completeness) – Programming Considerations – (Assembly language) (10 Hours) UNIT 3: Data Path Design – Floating Point Arithmetic – (Adder. Magnetic Surface Recording. John. Subtractor. “Computer Organization and Architecture”. 2nd Edition. Memory Interleaving) – Serial Access Memories – (Access Methods. Memory Organization. Addressing Modes. Cache operation) – Associative Memory—Structure versus Performance. PHI.
any tool available within the college.MPH Christ University. Project can be implemented live but need to be demonstrated at the time of examination. The End semester practical examination carries 100 marks divided as follows: 1. each batch containing not more than two students. Bangalore. Validation 3. India 79 BCA 651: MAIN PROJECT Guidelines: • Students have to develop a project using any package. Interface Design 2. Reports/Presentation 4. 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. Viva Voce 40 marks 20 marks 20 marks 20 marks • • BCA syllabus .
Bangalore. India 80 CERTIFICATE COURSES OFFERED BY DEPT OF BCA BCA syllabus .MPH Christ University.
Error handling 3.3 Request-Response Architecture 3.5 Servlet Resources – Servlet Context and Scope. Sessions with Cookies.2 JAR Files 1.4 Mapping and Running Servlets 3. India 81 CERTIFICATE COURSE ON J2EE Hours: 60 (Theory: 25 + Practical 25 + 10 Project) Credits: 02 Prerequisite: Knowledge of Core Java.MPH Christ University.2 Web Container and Servlet lifecycle 3.1 Architecture and Concepts Basic Servlet Concepts and Examples 3. Java Beans 1. JDBC 2.1 Bean Developer Kit (BDK) 1. Servlets (08 Hours) (06 Hours) (12 Hours) 3.2 Prepared and Callable Statements 2.4 The Java Beans API 2. OO concepts and Knowledge of database.6 Servlet Persistence and Session Tracking – Persistence in a Stateless Architecture. Multithreading Issues. Bangalore. HTTP GET and POST.1 JDBC Basics and Driver Types 2.3 Metadata Classes 2. Introduction to Cookies.4 SQL and Java Data Types 3. 1. Session Tracking API BCA syllabus .3 Developing a Simple Bean Using the BDK 1.
3 XML and the Document Object Model (DOM) 6.5 Custom Tag libs 4.2 EJB Architecture 5.1 Understanding XML and the Java XML APIs 6.6 JSP .1 Architecture and Concepts JSP Concepts and Motivation 4.4 Implicit JSP Objects and Scopes 4.2 JSP Lifecycle 4.Servlet Communication – Communication based on JavaBeans. Java Server Pages (10 Hours) 4. EJBs: Architecture and Concepts 5. Forwarding Requests and Responses 5. Bangalore.1 Enterprise Java Beans 5.MPH Christ University. Java & XML 6. India 82 4.3 EJB Components 5.2 Serial Access with the Simple API for XML (SAX) 6.4 Session and Entity Beans 6.3 JSP Tags and Constructs 4.4 Using XSLT (06 Hours) (18 Hours) BCA syllabus .
3 Gorilla testing 2.3 Why software engineering? 1.9. Software Quality Assurance: An Overview: (02 Hours) 1.4 Criteria of a successful software project 1.8.5 Process oriented software development 1.5 Field trail 2.2 The birth of software engineering 1.1 Black box testing 2.4 Beta testing 2.7. India 83 CERTIFICATE COURSE ON TESTING TOOLS Hours: 60 (Theory: 25 + Practical 25 + 10 Project) Credits: 02 1.7.7 Software development lifecycle models 1.4 Cost of quality 22.214.171.124 The management process a) Metrics in Software Development b) Quality management systems c) Process change management 2.7 Stress testing 2.4 Regression testing 2.9.4 Acceptance testing 2.1 Software Crisis 1.3 Testing team and development team 2.2 Verification and validation 2.9.2 Module testing 2. Bangalore.1 Psychology of testing 2.6 Why testing is difficult? 2.8.5 Characteristics of test engineers 2.9. Software Testing Process (01 Hour) 2.1 Top down approach versus bottom up approach 126.96.36.199.8.3 Integration and system testing 2.8 Testing approaches 2.3 Mutation testing 2.8 Acceptance testing BCA syllabus .2 White box testing 2.7 Levels of testing 2.6 Phases in software development life cycle 1.9 Types of testing 2.7.1 Unit testing 2.6 Performance testing 2.MPH Christ University.9.2 Functional versus Structural testing 2.
6 Data DRIVEN TESTING 4.2 Test management process 5.5 Testing Management tools 3.2 Test planning 188.8.131.52.1 Creating a test case 4.9.2 Classification of defects 3.3.1 Test oracles 2.5.4 Tracking defects BCA syllabus .1 Overview of Win runner 4.11.1 Converting test case to data driven test 4.1 Test director Overview 5. Bangalore.2.3 Managing test process using Test director 5.1 Recording test cases 4.10.3 Functional/Regression testing tools 3.7 How to select a testing tool 4.10.4 GUI MAP File 4.10 Test plan 2.2 Calling test cases using "call "function 4.4 Performance Testing tools 3.2 Synchronizing the Test cases 4.3.11 Criteria for completion of testing 2.3 Test execution 5.2.3 Test plan format 2.8 Mapping custom objects to standard class 4.6.9..2.2 Taxonomy of testing tools 3.1 When is testing complete? 2.2 Creating the test plan 5.1 Checking a single property 4.10.4 Test results analysis 5.5 Synchronization of test cases 4. Software Testing Tools: Overview 3.1 Creating a new project 5.1 Test requirements management 5. Win runner (01 Hour) (16 Hours) 4.3 Test script Language(TSL) 4.1 Need for Automated testing tools 3.2 Checking a single object 4.9 Checking GUI objects 4.MPH Christ University.3. India 84 2.3checking for multiple objects 5 TEST DIRECTOR (10 Hours) 5.2 Test cases 2.9.7 Rapid test script wizard 4.2.3 Running the automated test 184.108.40.206 Testing an application using Win runner 4.6 Source Code Testing tools 3.
2.com www.fsf. mercury interactive.1 Recording test cases 6.MPH Christ University.PRASAD.org www.2.2 Testing database application using synchronization and check points 8.2 Running a test case 8.V.com www.com www.segue.com www.rational.com www.sei.4 Creating Checkpoints (10 Hours) 7.2 Architecture of Silk test 7.1 Creating check points 8.net www. India 85 (10 Hours) 6. The art of software testing. Testing computer software Author: Comdex INTERNET RESOURCES: www. Bangalore.3 Synchronization of test procedures 6.K. pub: dreamtech press 2.3 Testing an application using Silk test 220.127.116.11.5 Checkpoints 7.6 Data driven Test cases 6 .4 Data driven testing 8.1 Recording a test case 8.5 Testing a web application PROJECT WORK TEXT BOOKS: 1.Pressman REFERNCE BOOKS: 1..qajobs.1 Overview of SQA Robot 6.3 Calling the test procedure using "call procedure" function 6.autotester.cmu.1 Overview of silk test 7.1 Overview of QTP 8.3 Synchronization of test cases 8.edu BCA syllabus .3.2 testing an application using SQA Robot 6.SQA ROBOT 7.2 Testing an application using QTP 8.qaforums. SOFTWARE TESTING TOOLS: Author:: Dr.4 The 4test scripting language 7.softwaretestinginstitute.2.Meyer Pub: john wiley &sons 2.2 Running the test procedure 6. Author: G. Software Engineering :A practitioner's approach: Author: Roger. SILK TEST 8 Quick Test Professional (QTP) (10 Hours) 8.com www.S.K.
India 86 CERTIFICATE COURSE ON . Programming in Visual Studio .Net Features of VB.Net 1.Net Interface Event Driven Programming Writing a simple applications using Visual Basic . Writing Procedures Introduction to procedures Types of procedures Calling procedures Argument passing Mechanisms Scope of variables Useful Built-in functions 5.Net Introduction to Visual Basic . Bangalore.Net The Architecture of VB. Introduction to Visual Basic .MPH Christ University.Net Programming in Visual Studio .Net IDE Introduction to windows and web forms Visual Studio.Net Introduction to forms 3.Net Need for visual basic . Programming Concepts Introduction to variables Types of variables Type conversion Constants and enumerations Operators Statements Arrays 4. OOPs in Visual Basic .Net Introduction to object-Oriented Programming Classes and Objects Features of OOPs Creating Classes BCA syllabus .Net framework Features of .Net System requirements and installation 2.Net solutions and projects The Visual Studio . Basics of Database A) Visual Basic .NET TECHNOLOGIES Hours : 60 ( 25 Theory : 25 + Practical 25 + 10 Project ) Credits: 02 Prerequisite: Knowledge of Programming.Net Understanding .
India 87 Creating Fields and Methods of Classes Constructors and Destructors Creating Property Procedures Creating Events Namespaces Imports Keywords 6.NET Introduction to Data Access Overview of ADO.NET Architecture ADO.NET Using Visual Tools for Data Access Data Form Wizard BCA syllabus . Data Access Using ADO. Advanced Windows Applications Advanced controls Creating MDI Applications Graphical Applications Custom Windows Control Delegates 10. Inheritance.MPH Christ University. 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. 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.NET Components Using ADO. Bangalore.NET ADO. polymorphism and Interfaces Inheritance Overriding Methods and Properties MyBase Keyword MyClass Keyword Abstract Base Classes Shared Members Polymorphism Interfaces 7.
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
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
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
Animation and modeling. India 91 UGC approved Job oriented Certificate Course WEB PAGE DESIGNING. 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. Bangalore. DHTML Part B Dream weaver and Asp BCA syllabus .MPH Christ University. 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. The course is divided into 3 modules which covers all the aspect of web page designing.
website content development Project Total 5 5 5 5 5 5 5 5 45 Hours Level I : Part B Hours : 45 BCA syllabus . Selection Tools. Painting and editing Working with quick masks . Vanishing point . color correction . Color palettes . Layers The layer Palette. Layer Effects Filters . Optimizing Images for Web. Photoshop Menus. Lasso . photo manipulation . Touchup .Painting ( Brush. color theory Introduction to Photoshop. layouts. Automation Extract . Layout Preview. Understanding Image Size and Resolution . Changing Image Dimensions. Color. Bitmap and Vector Images . Using predefined Actions. web photo galleries . Saving . Liquefy . Working with 3D layers Animation Panoramic Picture creation Using 3rd party palings Assignment : Black and white to color conversion. Using built in automation Preparing Image For Print and Web Calculating Image size and Resolution . Topic NO 1 Introduction BasicConcepts of Designing Theoritical Concepts og Designing . Resolution .MPH Christ University. Masks . Palettes. Grid and Guide Options. Advertisement . Labels. Grid and Guides Modifying Image Size .Editing( Background . Photoshop color Modes. Actions . Blending Modes. Changing and controlling layer order. Creating and Recording Actions. India 92 Level I : Part A Adobe Photoshop CS3 Sl. File Formats. Magic Wand . Photoshop Tools. Crop tool . Selecting. Greeting card . Color Separation . Filter Gallery . Channel . Color Theory. 3rd party Plug-ins. Bangalore. Creating Posters . Pattern making . Adjustment layers. Editing layers. Selection . Coping Selection And Image. Cleanup). Marquee. Hours : 45 No of hours 5 2 3 4 5 6 7 8 9 Image size. Built in Bitmap Filters . CD covers . Creating WebPages . and its effects ).
incremental save . simple house. dice Asics. extended primitives . subdivision. car paint . Bangalore. fill light. flare . palette. trim. perspective views. spray. cut. break. snap. import . autobackup. crome . Boolean . connect. PFsource (basic) Cloth. map shadow Area light. keing . rigidbody. angle align Scatter. India 93 40 Tools covered Navigation tool. bevel. rendering . Assign : Walking on the stair case Basic material. rim light Sky light . water. mental ray. rope. cannon ball bounce Curve editor . flip Assign : hammer model. 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 . light tracer. hierarchy. Orthographic . 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 . extrude. detach . bridge. outline. file open . loft . linking . attenuation. customizing max. create . refine. spectacle Bone tools. assigning material UVW mapping Unwrapping Uv mapping. input video Parry. Assign : Pen . chamfer. Module Topic No 1 UI User Interface Hrs 2 2 Modeling Geometry creation .superarray. creating user shortcut keys Standard primitives . final gather GI . free form animation and editing them. outline. multiplier . attach. quick slice. shape merge Concepts . normal mapping Creating glass. weld. point to point spring Total Hours Autodesk 3DStudio Max 2008 hours Sl. attach. spline ik skinning skin tools Morpher Auto key. UFO Character Modeling Subobject . constraints: hinge. spline (shape). out of range Basic editing . connect. view port .MPH Christ University. pcloud. Set key Assign : Rubber ball . hi solver. Boolean. divide. HDRI lighting Render tabs Glow.
sound adding sound to button 5 Working with Creating and publishing flash video . customizing the shortcuts. grid . editing timeline effects . slide shows. layer folders 2 Graphic Symbols.MPH Christ University. Motion Shape tweening. adding video . presentation Total Hours 2 2 2 2 2 10 8 45 Hours LEVEL II : Part B Autodesk MAYA Sl. interactive presentation . accessible content . tweening cell animation . encoding video 6 Movieclips Creating complicated animations Creating e-learning contents . non-interactive. edit sound. adding sound to timeline . 9 Scripting Action script (programming ) 10 Project Interactive games . linking pages . importing and video modifying flash video . Photo shows. timeline . 3 Animation Creating animation . creating guide layers . ruler . adding interactivity . frame by frame . text animation. Bangalore. gradient . India 94 40 Hrs 3 3 2 2 2 5 Adobe Flash CS3 with Action Script Programming hours Sl. Shape & Using time line effects . 4 Working with Importing sound . learning tools to draw 2D drawings Time line & Concept of animation . 7 Exercise Creating advertisement. guides context menu . usage of layers . graphics. motion basics . Module Tools covered No 1 Introduction Concepts of 2D animation . working with scene . text. Drawing User Interface Scene. Tool box. adding audio. Topics Hours : 45 Tools covered Hrs BCA syllabus . creating & editing layers layers . motion tweening . movieclips. library Tools & Stage Using and setting stage size . Mobile contents 8 Flash for web Creating Flash websites . quiz. color. buttons Working with color .
designing page layout using tables.NET Introduction Understanding work flow. Adding Images and Multimedia Displaying images . Organizing and Uploading a Project Uploading and sharing a project on the web. adding flash and other multimedia to a web page. Introduction to scripts. Dynamic HTML.MPH Christ University. property box . managing assets using Assets panel. Adding text.. Anchors. Bangalore. Webpage layout with Tables and Frame & DHTML Planning layout. displaying data in tables. BCA syllabus . Hyperlinks. Adding interactivity with behaviors. India 96 Dreamweaver and ASP. tools . reusing elements of a website. Cascading Style Sheets (CSS) . managing and editing a website. and Mailto links. lists. defining and configuring a website. saving method. Data Form & Scripting Creating a form and collecting Data. customizing Dreamweaver. and previewing in browser. sending and receiving to form data. using frame to display multiple web pages. environment. Using library. optimizing and creating images . Layers. Creating image Maps and navigation bars. Creating reusable webpage . site concept.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.