13.07.2015 Views

Bachelor of Computer Applications (BCA) - Christ University

Bachelor of Computer Applications (BCA) - Christ University

Bachelor of Computer Applications (BCA) - Christ University

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

HOSUR ROAD, BANGALORE – 560029DEPARTMENT OF <strong>BCA</strong>SYLLABUS FOR <strong>BCA</strong>February 2009


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


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 5Semester 6Paper Code Paper Hours Marks CreditsperWeek<strong>BCA</strong> 631 System Simulation 03 100 02<strong>BCA</strong> 651 Main Project 16 200 08Electives(Choose the same 03+03 100+100 02+02stream as Semester 5)Stream A (Two Papers)<strong>BCA</strong> 641A Distributed Systems<strong>BCA</strong> 642A Multimedia ComputingStream B (Two Papers)<strong>BCA</strong> 641B<strong>BCA</strong> 642BMicroprocessors<strong>Computer</strong> ArchitectureTotal 25 500 14Grand Total –Credits 100 creditsMarks 4600∗∗Seminar (<strong>BCA</strong> 271 & <strong>BCA</strong> 471) – No End Semester ExaminationHolistic Education – 12 hours <strong>of</strong> teaching in each semester<strong>BCA</strong> syllabus


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 7SEMESTER – II<strong>BCA</strong> 231: Functional EnglishThe objective <strong>of</strong> this course is to fine-tune the students’ communication (oral and written)and presentation skills, to be able to respond to the business needs <strong>of</strong> the changingindustry.<strong>BCA</strong> 232: Algebra and Differential EquationsLogic is the study and analysis <strong>of</strong> the nature <strong>of</strong> the valid argument. Further, it is thereasoning tool by which valid inferences are drawn from a given set <strong>of</strong> facts or premises.In this subject, mathematical logic, linear algebra and differential equations are discussed.<strong>BCA</strong> 233: Statistics for <strong>BCA</strong> IIThe use <strong>of</strong> probability theory, random variables, expectations and estimation is dealtalong with some important probability distribution.<strong>BCA</strong> 234: System Analysis and DesignThe students <strong>of</strong> <strong>Computer</strong> Science always dream to become s<strong>of</strong>tware pr<strong>of</strong>essionals.Having learnt a programming language, the students are given an opportunity to knowwhat happens in s<strong>of</strong>tware development. The students get to know about what is a systemand what are its different types. The students are also exposed to s<strong>of</strong>tware developmentlife cycle, which basically deals with requirement collection and analysis, Feasibilitystudy and human ware involved in the process. System design, implementation, testingand maintenance are also covered here. The students are asked to analyze the case studiesto under stand the concepts better. Overall, study <strong>of</strong> this subject gives a sound knowledgeabout the s<strong>of</strong>tware development process.<strong>BCA</strong> 235: Operating SystemsOperating system is the manager <strong>of</strong> computer resources. The subject introduces the basiccomponents <strong>of</strong> an operating system and various types <strong>of</strong> operating systems. DifferentCPU scheduling techniques gives a clear picture about how an operating system handlesdifferent types <strong>of</strong> tasks. Memory management policies are dealt to give information abouthow the main memory can be handled by an operating system. Since the secondarystorage devices cannot handle more than one request at a time, it is necessary for anoperating system to synchronize the jobs waiting for the devices. There are different types<strong>of</strong> algorithms, which can be used for the same. The subject deals with all thesealgorithms, which is <strong>of</strong> great help for an operating system designer. Case studies aboutDOS and Windows NT are also dealt as part <strong>of</strong> this subject.<strong>BCA</strong> 236: Data StructuresThe subject deals with the representation <strong>of</strong> data inside a computer. The subjectconcentrates on different data structures and their applications. The concepts <strong>of</strong> arrayslinked lists, stacks, queues and trees gives an exposure about how operating systems andcompilers are handling their data and symbol table. The subject also deals with differentsorting techniques and their time and space complexities. The subject deals with someinteresting problems like towers <strong>of</strong> Hanoi, which can be solved using recursion with thehelp <strong>of</strong> a stack. To conclude, the subject gives an overall view <strong>of</strong> the concepts <strong>of</strong> systemsprogramming.<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 8SEMESTER – III<strong>BCA</strong> 331: German LanguageThe objective <strong>of</strong> this course is to provide an introductory knowledge on GermanLanguage as it is one <strong>of</strong> the most common European languages applied in IT industry<strong>BCA</strong> 332: Graph TheoryConcepts <strong>of</strong> Graph Theory are very useful in design <strong>of</strong> <strong>Computer</strong> Networks. The varioustopologies can be analyzed with a sound knowledge in Graph Theory. The aim <strong>of</strong> thiscourse is to teach the students various modules <strong>of</strong> graph theory to emerge as efficientnetwork designers and administrators.<strong>BCA</strong> 333: Corporate AccountancyThe objective <strong>of</strong> this course is to introduce concepts <strong>of</strong> accounting to students to applythem effectively in projects <strong>of</strong> business domain.<strong>BCA</strong> 334: S<strong>of</strong>tware EngineeringS<strong>of</strong>tware Engineering is one <strong>of</strong> the emerging areas in the field <strong>of</strong> InformationTechnology. This is the systematic approach to s<strong>of</strong>tware development. The steps that arefollowed here reduce the development cost and time. This is introduced next to systemanalysis and design. The subject starts with what is s<strong>of</strong>tware engineering. Themanagement <strong>of</strong> a project and how to ensure the quality <strong>of</strong> the product is also discussed.The actual development process and various levels <strong>of</strong> testing are discussed with the casestudies to make the students to become good s<strong>of</strong>tware pr<strong>of</strong>essional. Maintenance <strong>of</strong>s<strong>of</strong>tware product is included as a last chapter <strong>of</strong> the subject.<strong>BCA</strong> 335: Database Management SystemsAll the computer-based applications require data to operate. These data are efficientlyhandled by a database management system. The subject deals with what is a database andhow a database should be designed. It also deals the popular relational data model andSQL queries in depth. It also concentrates on various techniques for database protectionand query optimization. A brief introduction about network and hierarchical data modelgives exposure about how a DBMS can be designed. The subject also deals withdistributed databases in brief.<strong>BCA</strong> 336: OOP using C++C++ is the first object oriented programming language taught in the course. The concept<strong>of</strong> classes and objects make it easy to represent real world entities. The subject starts withthe comparison between procedural languages and object oriented languages. Theconcepts <strong>of</strong> operator overloading and function overloading are discussed to expose thestudents to the advantages <strong>of</strong> object oriented programming. Advanced topics likeinheritance and its various types and virtual functions are taught in depth with itsapplication areas. The concept files and exceptions are introduced as the last few topicswhich make a developer to get the knowledge about the storage <strong>of</strong> files and errorhandling.<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 9SEMESTER – IV<strong>BCA</strong> 431: Technical EnglishThe objective <strong>of</strong> this course is to apprise the students <strong>of</strong> the special needs <strong>of</strong> interactingthrough letters and reports for every day needs.<strong>BCA</strong> 432: Numerical TechniquesThe objective <strong>of</strong> this course is to introduce various numerical techniques available inproblem solving.<strong>BCA</strong> 433: Financial ManagementThe objective <strong>of</strong> this course is to introduce concepts <strong>of</strong> Financial Management to studentsto apply them effectively in projects <strong>of</strong> business domain.<strong>BCA</strong> 434: <strong>Computer</strong> Networks – IToday, networks <strong>of</strong> computers are commonly used to share data and resources. Thesubject introduces the concept <strong>of</strong> networks, different topologies and network devices. TheOSI reference model is dealt to introduce different layers. The layers are discussed indetail in later chapters <strong>of</strong> the subject. Error detection and correction mechanisms are dealtto give an exposure about how actually the network handles the data. The discussionabout routing algorithms gives exposure to the sending <strong>of</strong> information in a network.Congestion handling is also dealt in the subject.<strong>BCA</strong> 435: Analysis and Design <strong>of</strong> AlgorithmThe goal <strong>of</strong> this course is to facilitate the students developing a well-organizedunderstanding <strong>of</strong> the analysis and design <strong>of</strong> algorithms. After this course, students shouldbe able to Evaluate algorithms based on their complexity and asymptotic growth rate,Develop recurrence relations, summarizing algorithms' complexity, Solve thoserecurrence relations using a variety <strong>of</strong> methods, Know how to utilize the algorithmicmethods <strong>of</strong> divide and conquer, dynamic programming, greedy heuristics, backtrackingand branch and bound algorithms and Understand fundamental algorithms in sorting,graphs and heaps, and classification <strong>of</strong> algorithms based on Polynomial (P) and Non-Polynomial (NP) algorithms<strong>BCA</strong> 436: Programming in JavaJava is popular because <strong>of</strong> its platform independent nature. As a graduate <strong>of</strong> <strong>Computer</strong>Science it is necessary to get expertise in this language which is used in manyapplications. The basic elements <strong>of</strong> the language like different data types andprogramming constructs are discussed. Inheritance, interfaces and concept <strong>of</strong> packagesare discussed which are the important concept <strong>of</strong> basic Java. Advanced topics likedifferent controls and graphics methods are discussed which is <strong>of</strong> great help for thedevelopers. Java is basically designed for internet applications. Applets are the programswhich can be immediately interpreted by a web browser. Applets are discussed in detail.Other advanced topics like servlets and JDBC are also dealt.<strong>BCA</strong> syllabus


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 11STREAM B :<strong>BCA</strong> 541B: <strong>Computer</strong> Networks – IIThis is <strong>of</strong>fered as continuation <strong>of</strong> computer networks – I subject. This mainly deals withthe techniques used in TCP / IP protocol. The subject introduces the students to local areanetworks and its benefits. The internet protocol which makes it possible to connectdifferent computers together is dealt in detail. The routing principles and how routingtakes place is also discussed as part <strong>of</strong> this subject. Introduction to telnet, FTP and SMTPis also dealt here.<strong>BCA</strong> 542B: System S<strong>of</strong>twareThe subject is introduced to get knowledge about different translators like compiler,interpreter and assembler. The subject deals different types <strong>of</strong> assemblers the phasesinvolved in detail. General machine architecture is also included as part <strong>of</strong> the subject.Topics like macro processors, loaders and linkers is included to get in depth knowledgeabout the translation to the machine language. Different phases <strong>of</strong> a compiler are dealt indetail will be <strong>of</strong> great help for the compiler developers.<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 12SEMESTER – VI<strong>BCA</strong> 631: System SimulationSimulation plays vital role in all engineering and research fields. The pilots who undergotraining first gets expertise using the simulated program. Many areas like nuclear reactorsand testing <strong>of</strong> missiles also makes use <strong>of</strong> simulation. The subject deals extensively all thetechniques used for simulation. Case studies are included as part <strong>of</strong> this subject for betterunderstanding. The languages used for simulation are also discussed as part <strong>of</strong> this.STREAM A:<strong>BCA</strong> 641A: Distributed SystemsCommunication has become ever relevant keyword in the field <strong>of</strong> informationtechnology. The subject deals with the concept <strong>of</strong> distributed systems focusing onmultiprocessors and multi-computers. The second unit deals with communication indistributed systems with reference to ATM. The third and fourth units deal withalgorithms for distributed computing. The last unit discusses about the file systems withreference to distributed systems.<strong>BCA</strong> 642A: Multimedia ComputingMultimedia is the latest technology in the field <strong>of</strong> Information Technology. Multi mediais one <strong>of</strong> the great achievements in this cyber era. Many <strong>of</strong> the animation techniques makeuse <strong>of</strong> the multimedia features. The study <strong>of</strong> this subject is really required for the students<strong>of</strong> computer science to get better opportunities in the IT industry. The subject extensivelycovers different concepts <strong>of</strong> multimedia and its application areas.<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 13STREAM B:<strong>BCA</strong> 641B: MicroprocessorsA microprocessor is the heart <strong>of</strong> a computer. This subject mainly deals with the internals<strong>of</strong> a microprocessor. The introduction part deals with what is a microprocessor and whatare its application areas. The main concentration is towards Intel 8085. The in and out <strong>of</strong>Intel 8085 is discussed. The architecture <strong>of</strong> 8085, different registers and flags arediscussed as part <strong>of</strong> this. Instruction set <strong>of</strong> 8085 and addressing modes are also includedin the subject. Programming 8085 microprocessor is dealt with the help <strong>of</strong> smallprograms. An introduction to Intel 8086 with its various registers and flags are alsoincluded as part <strong>of</strong> this subject.<strong>BCA</strong> 642B: <strong>Computer</strong> ArchitectureThe subject deals with basic model <strong>of</strong> a computer with the concepts on processor designin which data representation and instruction basics are discussed. The third unit deals withthe basics <strong>of</strong> design <strong>of</strong> an ALU. The last unit deals with concepts <strong>of</strong> memory designincluding characteristics and features <strong>of</strong> different types <strong>of</strong> memories.<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 14<strong>BCA</strong> 131: GENERAL ENGLISHTotal Teaching Hours: 45Module 1: INSIGHT@INPUT Hours: 25INPUT takes into account the need for building the Emotional Intelligence <strong>of</strong> the student,through a few prescribed poems, letters, essays and short stories. The student is guidedtowards a critical thinking process through these selected pieces, which focus on variedissues. Classroom interaction and participation on related issues are expected to expandthe horizons <strong>of</strong> the young mind.Unit 1: A real letter written by an 86 year old woman to her bank manager. This letterthrows light on the ways <strong>of</strong> the world <strong>of</strong> technology, where the consumer is relegated tothe background. This letter was published in The New York TimesUnit 2: An essay by Subroto Bagchi in India Today on The Five Minds <strong>of</strong> FutureUnit 3: Seven Wonders by Lewis Thomas. This essay looks at the developments inscience from a different angle.Unit 4: Short story: PONNUTHAYIBy BAMATranslated by N.RaviShankerUnit 5: Short story: The Bet by Anton ChekovBoth the stories deal with the power <strong>of</strong> the human mind.Unit 6: Poetry:1. If by Rudyard Kipling2. We live in deeds, not years; in thoughts, not breathsby Philip James Bailey3. Live Blindly and Upon the Hourby Trumbull Stickney4. Stopping by Woods on a Snowy Eveningby Robert FrostModule 2 : EXPRESSIONS@OUTPUT Hours : 20Written Skills1. Paragraph writing – what is a paragraph – the main features <strong>of</strong> a paragraph – how towrite a good paragraph – exercises in paragraph writing to be given – the exercisescan be on varied topics like personal experiences, social responsibilities, currenttopics, computer related topics2. Framing questions through a given dialogue<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 153. Vocabulary exercises – situational conversations, editing / abstracting / re -writingskills, exercises on synonymsGrammar reinforcement: Correction <strong>of</strong> errors, usage <strong>of</strong> articles and prepositionsOral skills (evaluation to be taken up and form a part <strong>of</strong> internal assessment)1. Individual presentations2. Group discussion / Talk shows on current topics3. Script enacting<strong>BCA</strong> syllabus


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


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 18<strong>BCA</strong> 134: BASIC ELECTRONICSTotal Teaching Hours: 45UNIT I : IntroductionAtomic structure – The energy <strong>of</strong> an electron – Valence electrons – Free electrons –Energy levels – Energy bands – Important energy bands in solids – Classification <strong>of</strong>solids (04 Hours)UNIT 2 : Semiconductor PhysicsBonds in semiconductors – Commonly used semiconductors – Effect <strong>of</strong> temperature onsemiconductors – Intrinsic and extrinsic semiconductors – n type and p typesemiconductors – Majority and minority carriers – pn junction – Characteristics <strong>of</strong>forward & reverse biased pn junction (09 Hours)UNIT 3: Semiconductor DiodeDiode – Different types <strong>of</strong> Diodes -- Diode as rectifier – Resistance <strong>of</strong> diode – Dioderectifiers (half wave, full wave and bridge rectifiers) – Efficiency <strong>of</strong> rectifiers – Ripplefactor – Filter circuits – Zener diode as a regulator (07 Hours)UNIT 4: TransistorTransistors – Characteristics <strong>of</strong> Common base, Common emitter and Common collectorconfiguration – Comparison – Transistor as an amplifier(CE) – Performance <strong>of</strong> transistoramplifier – Cut <strong>of</strong>f – Saturation points – D C load line – Voltage gain (10 Hours)UNIT 5 : Transistor Biasing and <strong>Applications</strong>Transistor biasing methods – Base resistor methods – Resistor voltage divider biasmethod – Single stage transistor amplifier-practical circuit <strong>of</strong> transistor amplifier-D.C andA.C equivalent circuits-load line analysis (07 Hours)UNIT 6 : Field Effect Transistors (FET)Types <strong>of</strong> FET – Junction field effect transistor(JFET) - Working <strong>of</strong> JFET – JFET as anamplifier – Difference between JFET and BJT – Metal oxide semiconductorFET(MOSFET) – Working (05 Hours)<strong>BCA</strong> syllabus


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


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 21<strong>BCA</strong> 136: INTRODUCTION TO PROGRAMMING USING CTotal Teaching Hours: 45UNIT 1: Introduction to <strong>Computer</strong>sEvolution <strong>of</strong> <strong>Computer</strong>s, Generation <strong>of</strong> <strong>Computer</strong>s, Classification <strong>of</strong> <strong>Computer</strong>s –Analog, Digital, Hybrid <strong>Computer</strong>s. Classification <strong>of</strong> <strong>Computer</strong>s according to Size- Super<strong>Computer</strong>s, Mainframe <strong>Computer</strong>s, Personal <strong>Computer</strong>s ( Different Types) andTerminals (Different Types), Characteristics <strong>of</strong> <strong>Computer</strong>s, Advantages andDisadvantages <strong>of</strong> <strong>Computer</strong>s, Block Diagram <strong>of</strong> a Digital <strong>Computer</strong>. (04 Hours)UNIT 2 : Introduction to ProgrammingTypes <strong>of</strong> Programming Languages, S<strong>of</strong>tware, Classification <strong>of</strong> S<strong>of</strong>tware, <strong>Applications</strong><strong>of</strong>tware and System S<strong>of</strong>tware, Structured Programming, Algorithms and Flowcharts withExamples, Programming Logic. (03 Hours)UNIT 3: Introduction & The C character setHistory <strong>of</strong> C, Structure <strong>of</strong> a C program (03 Hours)Constants, variables and keywordsTypes <strong>of</strong> C constants and variablesRules for constructing variable namesUNIT 4 : C InstructionsType declaration and arithmetic instructionsInteger and float conversions, Type conversion in assignmentOperators in C, Hierarchy <strong>of</strong> operationsControl Instructions (02 Hours)UNIT 5: Control StructuresDecision control structures,logical operators,conditional operator, relational operators.Loop control structures- while, do-while, forBreak statement, Continue statement, case control structure, go to statement (05 Hours)UNIT 6 : Storage classes in CAutomatic, Register, Extern and Static Variables (01 Hour)UNIT 7: Arrays – One dimensional and multidimensional arraysDeclaration, initialization, reading values into an array, displaying array contents(03 Hours)UNIT 8 : StringsBasic concepts, standard library string functions- strlen, strcpy, strcmp, strcat & strrev.Two dimensional arrays <strong>of</strong> strings (03 Hours)<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 22UNIT 9 : FunctionsDefinition, function definition and prototyping, types <strong>of</strong> functions, passing values t<strong>of</strong>unctions, recursion, passing arrays to functionsI/O functions- formatted & unformatted console I/O functions (04 Hours)UNIT 10: PointersDefinition, notation.Pointers and arrays, array <strong>of</strong> pointers.Pointers and functions- call by value and call by reference.Pointers and strings. (04 Hours)UNIT 11 : Structures and UnionsDefinition, declaration, accessing structure elementsArray <strong>of</strong> structuresPointers and structuresUnions – definition, declaration, accessing union elementstypedef statement. (04 Hours)UNIT 12 : FilesFile opening modesString I/O in filesFormatted disk I/O functionsText mode and Binary modeRecord I/O in files (05 Hours)UNIT 13 : Bitwise operatorsBitwise AND, OR, exclusive OR, complement, right shift and left shift operators(02 Hours)UNIT 14: C preprocessorTypes <strong>of</strong> C preprocessor directivesMacros- comparison with functionsFile Inclusion (02 Hours)TEXT BOOKS:1. Kanetkar, Yashavant: “Let Us C”, 4 th Edition. BPB Publications.2. Gottfried, Byron S: “Programming with C”, 1996. Tata McGraw-HillREFERENCE BOOKS:1. Balagurusamy, E: “Programming in ANSI C” 2 nd Edition. Tata McGraw-Hill2. Deitel, H M and Deitel P J: “C How to Program”, 2 nd Edition. Prentice-Hall.<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 23Guidelines:<strong>BCA</strong> 151: C PROGRAMMING LAB• Follow Coding standards• The output <strong>of</strong> the programs should be neatly formatted• The programs should be user friendly and interactive• Use comment wherever necessary1. Aim: To demonstrate the usage <strong>of</strong> operators and data types in Ca. Write a program to print the size <strong>of</strong> all the data types supported by C andits range.b. Write a program to convert Fahrenheit to Celsius.2. Aim: To demonstrate the usage <strong>of</strong> if, if-elsea. Write a program to check whether the given number is a Prime number ornot.b. Write a program to accept three numbers and find the largest and secondlargest among them3. Aim: To demonstrate the concept <strong>of</strong> while, do-while, for loops, break andcontinuea. Write a program to print all prime numbers between any 2 given limits.b. Write a program to print all the Armstrong numbers between any 2 givenlimits.4. Aim: To demonstrate the concept <strong>of</strong> arrays and stringsa. Write a program to check whether a string is a Palindrome.b. Write a program to check whether a given matrix is an Identity matrix ornot.c. Write a program to perform matrix multiplication.5. Aim: To demonstrate the concept <strong>of</strong> switch-casea. Write a program to count the different vowels in a line <strong>of</strong> text.b. Write a program to accept two numbers and perform various arithmeticoperations (+, -, *, /) based on the symbol entered.6. Aim: To demonstrate the usage <strong>of</strong> functions and recursiona. Write a program to find the roots <strong>of</strong> a quadratic equationb. Write a recursive program to find the factorial <strong>of</strong> a number.7. Aim: To demonstrate the concept <strong>of</strong> structures and unionsa. Create an employee structure and display the same.b. Create a student database storing the roll no, name, class etc. Implementmodify and search operations.<strong>BCA</strong> syllabus


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


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 26Apply different font settings for all titles in sheetApply green color and bold setting to sales above 10000 (use conditionalformatting)Rename current worksheet as FirstHalfSales2. Prepare a worksheet to maintain student information. The work sheet shouldContain Roll Number, Name and marks in 5 subjects. (Max Marks is 100).Validatethe marks. Calculate the total marks. Assign the grade according to the following.Assign grade ‘A’ if the total marks is above 450. From 401 to 449 assign the grade as“B”. From 351 to 400 assign the Grade as C. From 300 to 350 the grade to beassigned is ‘D’. For the total marks less than 300 No grade is assigned. A student iseligible to get a grade only when he gets 40 and above in all the subjects. In suchcases the grade is “FAIL”. (Assume that there are 10 students).3. Prepare a pay-bill using a worksheet. The work sheet should contain Employee Id,Name, Designation, Experience and Basic Salary and Job ID. If Job Id is 1 then DAis 40% <strong>of</strong> the basic salary. HRA is Rs. 4500. If Job Id is 2 then DA is 35% <strong>of</strong> thebasic salary. HRA is Rs. 3500. If Job Id is 3 then DA is 30% <strong>of</strong> the basic salary.HRA is Rs. 2500. If Job Id is 4 then DA is 25% <strong>of</strong> the basic salary and HRA isRS.2500. For all the other Job ids DA is 20% <strong>of</strong> the basic salary and HRA is Rs.1500. For all the above Job ids PF to be deducted is 4%. For the job ids between 1-4Rs. 100 to be deducted as Pr<strong>of</strong>essional Tax. Find the net pay.4. For the above employee worksheet perform the following operations1. Use filter to display the details <strong>of</strong> employees whose salary is greater than10,000.2. Sort the employees on the basis <strong>of</strong> their net pay3. Use advance filter to display the details <strong>of</strong> employees whose designation is“Programmer” and Net Pay is greater than 20,000 with experience greaterthan 2 yrs.5. Create a statement <strong>of</strong> Telephone Bill Charge for a customer.Telephone CallsUp to 150 calls - free<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 27151 to 500 calls - 0.80 per call501 to 1000 calls - 1.00 per call1001 to 2000 - 1.25 per callAbove 2000 - 1.40 per call6. Using Excel project the Product sales for any five products for five years. Compute the total sales <strong>of</strong> each product in the five years. Compute the total sales <strong>of</strong> all the products in five year. Compute the total sales <strong>of</strong> all products for each year. Represent annual sale <strong>of</strong> all the products using Pie-Chart. Represent annual sales <strong>of</strong> all products using Bar Chart. Represent sale <strong>of</strong> a product for five years using Pie-Chart. Label and format the graphs7. (a) Using Excel write sales data with columns product, month and sales. Writeat least 5 records. Create Pivot Table chart and Report for the data.(b)Create a macro to change the name <strong>of</strong> worksheet as Macro Example, mergefirst three columns <strong>of</strong> first row and write heading as DATA in green color withyellow background(c)Link word document in excel worksheet to show the usage <strong>of</strong> linking andembedding.MS-POWERPOINT1. Assume that you are going to give a presentation about Information Technology.(Choose some latest technologies). The presentation should have minimum 10slides. Insert appropriate images wherever necessary. Use proper formatting,diagrams and tables. Show the application <strong>of</strong> Pens.2. Prepare a presentation about any general topic <strong>of</strong> current relevance (min 10slides). Show the usage <strong>of</strong> action buttons, hyperlinks, and animations.MS-ACCESS1. Create a database called as Library. Include a table names as Book whichcontains Accno, Title, Author, Number <strong>of</strong> Copies and Brief Description aboutthe book. Include another table named as members which contains member id,name, address, telephone no and membership amount paid or not. Assign Accnoand member id as primary key. Display the details about the books written by theparticular author. Display details about books where there is more than 5 copies<strong>of</strong> the books. Display the details <strong>of</strong> members who have not paid the amount.Delete some <strong>of</strong> the member details.2. Create a database <strong>of</strong> Employees in an organization. Include a table which has theinformation about the employee’s family. Create User interface using Access toenter and modify the details stored in the employee database. Give the optionsfor View, Add, Delete and Edit. Create a report using Access to display the<strong>BCA</strong> syllabus


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 29Total Teaching Hours: 45<strong>BCA</strong> 231: FUNCTIONAL ENGLISHUNIT 1: Learning skills:What is Communication, The process <strong>of</strong> Communication, Methods <strong>of</strong> Communication,Media <strong>of</strong> Communication, Types <strong>of</strong> Communication, Objectives <strong>of</strong> Communication,Principles <strong>of</strong> Communication, Barriers to Communication(30 Hours)UNIT 2: Written skills:1. Essay writing – features <strong>of</strong> a good essay – structure and presentation – exercises onessay – writing on varied topics2. Resume preparation – the difference between an application letter and a CV – how toprepare a good CV – exercises on CV preparationUNIT 3: Oral skills:1. Phonetics – Basics2. Presentation skills with emphasis on PPTs3. Mock Interviews4. Debates, Extempore talksREFERENCE BOOKS:(05 Hours)(10 Hours)1. Essentials <strong>of</strong> Business Communication by Rajendra Pal & Korla Halli2. Business Communication – By Dr. Urmila Rai and S M Rai<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 30<strong>BCA</strong> 232: ALGEBRA AND DIFFERENTIAL EQUATIONSTotal Teaching Hours: 45UNIT 1: MATRICESReview <strong>of</strong> fundamentals – Equivalent matrices – Elementary row (column)operations – Rank <strong>of</strong> a Matrix by reducing it to echelon from – Rank <strong>of</strong> a matrix bynormal form – Finding the inverse <strong>of</strong> a matrix – Homogeneous and non – Homogeneoussystem <strong>of</strong> equations – Consistency criterion – Characteristic equations – Eigen values,Eigen vectors and properties – Cayley Hamilton theorem (Statement only). (10 Hours)UNIT 2: THEORY OF NUMBERSDivisibility – Division Algorithm – Greatest Common Divisor – Euclid’salgorithm to find the G.C.D. <strong>of</strong> two non – zero integers – Prime and Composite numbers– Unique Factorization theorem – Division <strong>of</strong> a given number – Euler’s Ø Function –Congruence – Solution <strong>of</strong> linear congruence – Fermat’s theorem, Wilson theorem,Lagrange’s theorem (Statement only). (10 Hours)UNIT 3: GROUPS, RINGS AND FIELDSDefinition <strong>of</strong> Group – Semigroup – Subgroup – Results on subgroups – Order <strong>of</strong>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 <strong>of</strong>homomorphism – Isomorphism and related results – Rings – Types <strong>of</strong> Rings – Fields –Examples <strong>of</strong> Fields (15 Hours)UNIT 4: DIFFERENTIAL EQUATIONSDefinition and examples – Order and Degree – Solutions <strong>of</strong> first order first degreedifferential equations – Variable separable – Equations reducible to variable separable –Linear differential equations – Bernoulli’s Differential equations (10 Hours)TEXT BOOKS:1. Vasishta A R : “Matrices”, Krishna Prakashan Mandir.2. Apostol T M : “Introduction to Analytic Number Theory”, NarosaPublishing House.3. Herstein I N : “Modern Algebra”.4. Frank Ayres J R : “Differential Equations”, Schaum series, TMH.REFERENCE BOOKS:1. Frank Ayres J R : “Matrices”,Schaum series, TMH.2. Vasishta A R : “Modern Algebra”.3. S. Narayana & T. K Manicavachogam Pillay : “ DifferentialEquations” , SV Publishers4. T. K Manicavachogam : “Algebra”, S V Publishers<strong>BCA</strong> syllabus


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


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 33UNIT 8: System testing and quality assurance: Testing, different methods, Nature<strong>of</strong> test data, Test plan, activity networks for system testing, Quality assurance : goalsin system development, trends, procedure, ISO certification (04 Hours)UNIT 9: Implementation and S<strong>of</strong>tware maintenance: Conversion, Activitynetwork for conversion, Post-implementation review, S<strong>of</strong>tware maintenance, Primaryactivities <strong>of</strong> a maintenance procedure, Reducing maintenance costs(05 Hours)TEXT BOOKS:1. Awad, Elias M: “System Analysis and Design” Second Edition. GalgotiaPublication Pvt.Ltd.REFERENCE BOOKS:1. Sen, James A: “Analysis and Design <strong>of</strong> Information Systems” Second Edition.Mc-Graw Hill International edition, 1989.2. Jeffrey L.Whitten: “System analysis and design methods” Fourth edition.Mc-Graw Hill International..<strong>BCA</strong> syllabus


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


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 36<strong>BCA</strong> 251: VISUAL PROGRAMMING LABTotal Hours: 601. Introduction (05 Hours)a. Windows Conceptsb. Objects and eventsc. Define design and development processd. Identify elements <strong>of</strong> IDEe. Write, run, save, and print a projectf. Use online Help2. Introduce controls and their properties (04 Hours)a. Text boxes, group boxes, check boxes, radio buttons, picture boxes andnaming conventionsb. User friendly features: access keys, default and cancel buttons, tabsequence, Tool Tips, resetting focusc. Changing properties at run-timed. Concatenate strings3. Variables, constants and calculations (04 Hours)a. Declaration <strong>of</strong> variables and constants considering data types and scopeb. Explicit data type conversionsc. Perform calculations using arithmetic operators and order <strong>of</strong> operationsd. Use <strong>of</strong> accumulators and counterse. Use formatting functions to format output4. Decisions and conditions (04 Hours)a. Use If statements to control the flow <strong>of</strong> logicb. Use And and/or operatorsc. Call event proceduresd. Input validatione. Debug tools - set break points, stepping and observation <strong>of</strong> intermediateresults5. Arrays (02 Hour)a. Declare arrays and refer to elements using subscriptsb. Use For Each/Next statementsc. Structure Variablesd. Store data in multidimensional array6. Lists, Loops, and Printing (02 Hours)a. Create and use list boxes and combo boxesb. Use Do/Loops and For/Next statementsc. Send information to the printer7. Menus, procedures and functions (04 Hours)a. Create menus and submenus for program controlb. Write reusable code in sub procedures and sub functions8. Toolbars and Status bar (03 Hours)<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 37a. Creating toolbarsb. Adding images to toolbarsc. Writing code to work with toolbarsd. Creating and using a status bare. Adding panels to the status bar9. Other controls (03 Hours)a. TabControlb. MonthCalendar and Date/TimePickerc. Common Dialog (Open/SaveFile)d. ProgressBar10. File handling and file controls in VB (04 Hours)11. Database Connectivity (12 Hours)a. Data base basics & database engineb. Create a database in Access Through VBc. The nature <strong>of</strong> a relational databasesd. The data controls (DAO and ADO)e. Data Bound controlsf. Working with database objects in codeg. Data Manipulation through VB – Formsh. Develop a database application12. Introduction to Graphics and animation (03 Hours)13. Multiple Document Interface (MDI) (02 Hours)a. Overview <strong>of</strong> MDIb. Creating parent and child formsc. Writing code for parent and child formsd. Child window managemente. Creating applications14. Creating and using reports (04 Hours)a. Printing with windows formsb. Data reportsc. Using Crystal Reports15. Create Object-Oriented programs (02 Hours)a. OO terminologyb. Multi-tier applicationsc. Classesd. Constructors and Destructorse. Inheritance16. Deploying the project (02 Hours)a. Creating setup programb. Help filec. Online registrationGuidelines<strong>BCA</strong> 252: DATA STRUCTURES LAB<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 38• The output <strong>of</strong> the programs should be neatly formatted• The source code should be indented• The programs should be interactive1. Aim : To learn about pointers and stringsa. Write a menu driven program to concatenate two strings and find the length<strong>of</strong> a string using pointers.b. Write a menu driven program to find the index <strong>of</strong> a pattern in a given stringand to extract a substring using pointers.2. Aim : To learn about one and two dimensional arraysa. Insertionb. Deletion2. Aim : To learn about Searching Techniquesa. Write a program to implement Linear Search with sentinelsb. Write a program to implement Binary Search3. Aim : To learn about singly linked list insertion and deletiona. Creation <strong>of</strong> a linked list and insertion.b. Creation <strong>of</strong> a linked list and deletion.4. Aim : To learn about recursiona. Towers <strong>of</strong> Hanoi with 3 pegs and n disks.b. Fibonacci series using recursion.5. Aim : To learn about stacksa. Write a program to implement different operations on a stack using a linkedlist.6. Aim : To learn about queuesa. Write a program to implement different operations on a queue using a linkedlist.b. Write a program to implement different operations on a circular queue usingan array.7. Aim : To learn about binary search treesa. Write a program to create a binary search tree and to perform Insertion anddeletion8. Aim : To learn about various sorting techniquesa. Write a program to implement insertion sortb. Write a program to implement merge sort.c. Write a program to implement quick sort.d. Write a program to implement heap sort.<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 39Total Teaching Hours: 45<strong>BCA</strong> 331: GERMAN LANGUAGEUNIT 1: (08 Hours)Greetings, Names <strong>of</strong> countries & nationalities, Introduction <strong>of</strong> peopleGrammar – Verb position, Variations <strong>of</strong> verbs & Subject, types <strong>of</strong> sentencesUNIT2: (09 Hours)Describing a city, giving directions, placing order in a restaurantGrammar – Variations <strong>of</strong> verbs, Introduction to “Doch”UNIT 3: (09 Hours)Numbers, Months, using expresessions <strong>of</strong> timesGrammar - Definite & Indefinite articles, Nominativ & Akkusativ casesUNIT 4:(09 Hours)Weekdays, expressions <strong>of</strong> time, talking about daily routinesGrammar - Breakable Verbs, Nouns (Article & Plurals)UNIT 5 : (10 Hours)Describing one’s pr<strong>of</strong>ession, about courses.Grammar - Modal verbs & PrepositionsTEXT BOOK:Moment Mal ! [1] Publisher – LangenscheidtREFERENCE BOOKS:Sprachkurs Deutsch [1], Grundkurs DeutschExam Portions:Grammer – Fill in the blanksComprehensionDictation/ Hearing ComprehensionPassage writing/ Letter writingViva<strong>BCA</strong> syllabus


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 41<strong>BCA</strong> 333: CORPORATE ACCOUNTANCYTotal Teaching Hours: 45UNIT 1: INTRODUCTIONMeaning – accounting Principles- double entry system <strong>of</strong> accounting – Journal –Subsidiary books – Four phases <strong>of</strong> Accounting(05 Hours)UNIT 2: LEDGERINGLedger – Posting – Trial Balance(05 Hours)UNIT 3: CASH BOOKThree Columns <strong>of</strong> Cash Book – Bank reconciliation- Purpose <strong>of</strong> Bank reconciliation(10 Hours)UNIT 4: DEPRECIATION ACCOUNTINGMeaning <strong>of</strong> depreciation – depreciation methods – straight line method – reducingBalance method – depreciation fund – Annuity method(10 Hours)UNIT 5: FINAL ACCOUNTSMeaning – Trading account – Pr<strong>of</strong>it 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. Jain & Narang: “Financial Management”, Himalaya Publishing House2. B.S. Raman: “Financial Management”, United PublicationREFERENCE BOOKS:1. T. S Grewal : “ Introduction to Accounting”2. S. N Maheswary and S. K Gupta “ Introduction to Accounting”3. T P Ghosh , Ashok Banerjee & K M Bansal : “ Introduction to Accounting”<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 42Total Teaching Hours: 45<strong>BCA</strong> 334: SOFTWARE ENGINEERINGUNIT 1: The Product: - Evolution <strong>of</strong> s<strong>of</strong>tware, Characteristics <strong>of</strong> s<strong>of</strong>tware, s<strong>of</strong>twareapplications Components <strong>of</strong> s<strong>of</strong>tware, S<strong>of</strong>tware myths, S<strong>of</strong>tware problems, S<strong>of</strong>twarereuse. (03 Hours)UNIT 2: The Process: - Definition <strong>of</strong> S<strong>of</strong>tware engineering, S<strong>of</strong>tware engineeringmodels: Waterfall, Prototyping, Spiral, RAD and 4GT. (Latest life cycle models can bediscussed) (06 Hours)UNIT 3: Project Management and Planning:Management Spectrum – People, Product, Process and Project. Metrics: Measures,Metrics and indicators. Types <strong>of</strong> metrics: Size oriented, Function-oriented metrics andmetrics for s<strong>of</strong>tware quality. Resources: Human, Hardware and s<strong>of</strong>tware resources.S<strong>of</strong>tware Project Estimation: – Decomposition technique: LOC based Estimation,Empirical Estimation: COCOMO model. Risk Management: – Risk Identification, RiskAnalysis, Risk Projection, Risk assessment and Risk Prioritization, Risk Resolution, Riskmonitoring and Control. Project Scheduling: Work tasks, Time line charts and CPM.S<strong>of</strong>tware Quality Assurance: Quality, Formal Technical review and S<strong>of</strong>tware Reliability.S<strong>of</strong>tware Configuration Management: Baselines, SCM items and the SCM process.(15 Hours)UNIT 4: Analysis concepts and principles: - Analysis principles, Prototyping, S<strong>of</strong>twareRequirement Specification (SRS). (04 Hours)UNIT 5: Analysis Modeling: - Data modeling, Data flow diagram (DFD) and StructuredAnalysis. (04 Hours)UNIT 6: Design concepts and principles: - Design process, Design principles, Designconcepts and effective modular design. Design steps: Data design, Architectural design,Interface design and procedural design. (08 Hours)UNIT 7: S<strong>of</strong>tware testing: - Unit testing, Integration testing, System testing, acceptancetesting. Black box and White box testing. (05 Hours)TEXT BOOK:1. Roger S Pressman: “S<strong>of</strong>tware Engineering”, 4 th editionREFERENCE BOOKS:1. Ian Sommerville:“S<strong>of</strong>tware Engineering”, Pearson Education Asia, 6 th Edition,2002.2. Pankaj Jalote, Narosa:“An Intergrated Approach to S<strong>of</strong>tware Engineering” Pub19953. Carlo Ghezzi, Mehdi Jazeryeri and Dino Mandrioli: Fundamentals <strong>of</strong>S<strong>of</strong>twareEng.<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 43<strong>BCA</strong> 335: DATABASE MANAGEMENT SYSTEMSTotal Teaching Hours: 451. Introduction: Data, Database, Database management system, Characteristics <strong>of</strong> thedatabase approach, Role <strong>of</strong> Database administrators, Role <strong>of</strong> Database Designers, EndUsers, Advantages <strong>of</strong> Using a DBMS and When not to use a DBMS.(04 hours)2. DBMS Architecture: Data Models – Categories <strong>of</strong> data models, Schemas, Instances,and Database state. DBMS Architecture and Data Independence – The Three schemaarchitecture, Data independence. DBMS Languages and Interfaces. Classifications<strong>of</strong> Database Management Systems.(04 hours)3. Data Modeling Using Entity-Relationship Model: Using High Level ConceptualData Models for Database Design, Example Database applications. Entity types,Entity Sets, Attributes and Keys. Relationships, Relationship types, Roles andStructural 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 Multilevelindexes using B-trees (Introductory concepts). Hashing concepts.(06 hours)5. Relational Data Model: Relation, Integrity constraints - domain, entity andReferential integrity constraints, Basic Relational Algebra operations, select, projectand join operations. Functional dependencies and Normalization for RelationalDatabases - Normalization concepts, first, second, third normal forms, Boyce-Coddnormal form.(09 hours)6. SQL: Queries, sub queries, correlated sub query, views, updation <strong>of</strong> a databasethrough views, Update, Delete.(03 hours)7. Transaction Processing Concepts and Concurrency Control Techniques:Transaction and System concepts – Desirable properties <strong>of</strong> Transactions – Schedulesand Recoverability. Lock-Based Protocols – Locks, Granting <strong>of</strong> Locks, and Twophase locking protocol and implementation <strong>of</strong> locking(05 hours)8. Data Base Administration: Introduction to Database security issues, DiscretionaryAccess Control Based on Granting/Revoking <strong>of</strong> Privileges and Multi-level security.(04 hours)9. Distributed Databases: Distributed database concepts, Data fragmentation,Replication, and Allocation Techniques for Distributed database design, Types <strong>of</strong>Distributed database systems. Introduction to Advanced Database concepts – Briefintroduction to Data warehousing and Data mining.(06 Hours)<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 44TEXT BOOKS:1. Elmasri & Navathe, Fundamentals <strong>of</strong> Database Systems,2 nd Edition, Addison –Wesley2. Silberschatz, Korth, Sudarshan, “Database System Concepts”, 4 th Edition, Mc GrawHillREFERENCE BOOKS:1. O`neil Patric & O`neil Elizabeth, Database Principles, Programming andPerformance, 2 nd Edition, Margon Kaufmann Publishers Inc.<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 45<strong>BCA</strong> 336: OBJECT ORIENTED PROGRAMMING USING C++Total Teaching Hours: 45UNIT 1: Introduction to Object Oriented Programming-Features <strong>of</strong> Procedureoriented programming-Basic Concepts <strong>of</strong> Object Oriented Programming-Benefits <strong>of</strong>OOP-<strong>Applications</strong> <strong>of</strong> OOP (02 Hours)UNIT 2: Introduction to C++ - Comments-Output operator-Input operator-Cascading <strong>of</strong>I/O operators. Tokens- keyword, identifiers, constants, strings and operators. Basic datatypes-User defined data types-Dynamic initialization <strong>of</strong> variables-Reference variables-Operators in C++-Scope resolution operators-applications-Member dereferencingoperators-Memory Management operators-new and delete. Control Structures-simple if,if else, nested if, switch, while do, break and continue statements(07 Hours)UNIT 3: Functions-Introduction-Function Prototyping-Call by reference-Return byreference-Inline functions-Default arguments-Const arguments(02 Hours)UNIT 4: Classes and Objects-Introduction-Limitations <strong>of</strong> C structures-Defining a class-Class Vs structures-Creating objects-Accessing class members-Defining memberfunctions-Outside the class definition-Inside the class definition-Outside functions asinline-Nesting <strong>of</strong> member functions-Private member functions-Memory allocation forobjects-Array <strong>of</strong> objects. Friendly functions.(04 Hours)UNIT 5: Constructors and Destructors-Basic Concepts <strong>of</strong> constructors-Defaultconstructor-Parameterized constructor-Multiple constructors in a class-Constructor withdefault arguments-Dynamic initialization <strong>of</strong> objects-Copy constructor-Dynamicconstructors-Destructors.(03 Hours)UNIT 6: Function and Operator overloading - Introduction-Rules for overloadingoperators-Defining operator overloading-Overloading Unary operators-Prefix and Postfixoperators overloading-Overloading Binary operators-Overloading relational operators-Overloading using friend functions-Overloading subscript operator. Functionoverloading.(06 Hours)UNIT 7: Inheritance-Introduction-Defining derived classes-Types <strong>of</strong> inheritances-Single-Making a private member inheritable-Multilevel inheritance-Multiple inheritance-Hierarchical inheritance-Hybrid inheritance-Virtual base classes-Abstract classes-Constructors in derived classes-Nesting <strong>of</strong> classes-Containership(05 Hours)UNIT 8: Virtual functions and Run time polymorphism-Introduction-Compile timeand Runtime polymorphism-Pointers to objects-this pointer-Pointer to derived classes-Virtual 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 > operators-Formatted Console I/O operations-ios classfunctions-width(),precision(),fill(),setf() and unsetf()-Formatting flags-Manipulators-Userdefined manipulators.(03 Hours)<strong>BCA</strong> syllabus


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


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 47<strong>BCA</strong> 351: C++ LABGuidelines:• The output <strong>of</strong> the programs should be neatly formatted.• 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 <strong>of</strong> the program• Use meaningful variable names1. Aim : To learn about function overloading2. Aim : To learn about default arguments3. Aim : To learn about pass by value, pass by reference and return by reference4. Aim : To learn about classes and objects5. Aim : To learn about default constructors6. Aim: To learn about constructor overloading7. Aim : To learn about copy constructor8. Aim : To learn about static functions9. Aim : To learn about friend functions10. Aim : To learn about Unary operator overloading11. Aim : To learn about Binary operator overloading12. Aim : To learn about subscript operator overloading13. Aim : To learn about dynamic memory allocation and deallocation(new and delete)using constructors and destructors.14. Aim: To learn about simple and multi level inheritance.15. Aim: To learn about multiple inheritance and hybrid inheritance16. Aim : To learn about virtual functions17. Aim: To learn about text file creation and manipulation (copy, merge etc.)18. Aim : To learn about I/O Streams and database file creation and display<strong>BCA</strong> syllabus


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 48<strong>BCA</strong> 352: ORACLE LABTotal: 60 Hours1. SQL*Plus and SQL (04 Hours)a. Introductionb. Logging on to SQL*Plus and Leaving SQL*Plusc. Choosing and Describing Tablesd. Elements <strong>of</strong> the SQL Querye. Editing SQL Statementsf. The System Dummy Tableg. Selecting Columnsh. Duplicate Information (DISTINCT)i. Sorting Information2. SQL Functions (04 Hours)a. The Concatenation Operatorb. Elements <strong>of</strong> the SQL Query: Arithmeticc. Column Aliasesd. String Functionse. Arithmetic Functionsf. Date Functionsg. Mixed Functionsh. Operator precedence3. Advanced SQL Functions (04 Hours)a. Nesting Different Functionsb. Decode Crosstabc. Decode with ">", "


<strong>Christ</strong> <strong>University</strong>, Bangalore, India 495. Retrieving Data from Multiple Tables (05 Hours)a. Joining Tables (Equi-Joins)b. Aliases for Table Namesc. Joining Tables (Non-Equi-Joins)d. Joining Tables (Outer Joins)e. Joining Tables (Inner Joins)f. Virtual table6. Group By and Group By Functions (03 Hours)a. Group Function Examplesb. Group Function with Having7. Sub-Queries (04Hours)a. Basic Subqueriesb. Multiple Column Subqueriesc. Subqueries with Havingd. Correlated Subqueries8. Data Definition Language (DDL) (05 Hours)a. Create, Drop Alter Keywordsb. Tablesc. Columnd. Viewse. Synonymsf. Sequencesg. Objecth. Alter table<strong>BCA</strong> syllabus


9. Integrity Constraints (03 Hours)a. Types <strong>of</strong> Constraintb. Referential Integrityc. Defining Constraintsd. Integrity Constraints and Data Dictionarye. Disabled constraints10. Indexes (02 Hours)a. Create Indexb. Unique Optionc. When and What to Indexd. Drop Indexe. Validate Indexf. Index Type Overview11. Data Manipulation Language (DML) (04 Hours)a. Insertb. Updatec. Deleted. OPS Commands (Commit, Rollback and Savepoints)e. Locking tables12. Data Control Language (DCL) (02 Hours)a. Data Securityb. Grant and Revokec. Session control statementsd. System control statements13. Introducing SQL*Plus for Reporting (02 Hours)a. Using SQL*Plusb. SQL*Plus Command Variablesc. Building SQL*Plus Reportsd. Titles and Headings


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India5114. PL/SQL (14 Hours)a. Variables and type declarationsb. Loop structurec. PL/SQL language commandsd. PL/SQL Blockse. Cursor/ cursor loopsf. PL/SQL tablesg. Types <strong>of</strong> stored PL/SQL Blocksh. Exceptions<strong>BCA</strong> syllabus


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


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


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India54<strong>BCA</strong> 433: FINANCIAL MANAGEMENTTotal Teaching Hours: 45UNIT 1: INTRODUCTIONMeaning – Objectives <strong>of</strong> Financial Management – Time Value Money calculation –Financial market. (05 Hours)UNIT 2: CAPITAL BUDGETINGMeaning – Importance – Process – Methods <strong>of</strong> Capital Budgeting – Payback Period –Accounting rate <strong>of</strong> return – Net Present Value – Internal Rate <strong>of</strong> Return – Pr<strong>of</strong>itabilityindex – Capital rationing(10 Hours)UNIT 3: FINANCIAL STATEMENT ANALYSISComparative statement analysis – Ratio analysis – Meaning – Types <strong>of</strong> ratio’s – Liquidityratio’s – Solvency ratio’s – Activity ratio’s – Pr<strong>of</strong>itability ratio’s (10 Hours)UNIT 4: FUND FLOW AND CASH FLOW ANALYSISMeaning – Schedule <strong>of</strong> changes in working capital – Fund from operation – Statement <strong>of</strong>sources and <strong>Applications</strong> <strong>of</strong> fund – Cash from operation – Statement <strong>of</strong> sources andapplications <strong>of</strong> cash (15 Hours)UNIT 5: COST VOLUME PROFIT ANALYSISMarginal costing – B E P point – P / V ratio – Margin <strong>of</strong> safety – calculations(05 Hours)TEXT BOOK:1. Dr. S. N. Maheswari : “ Financial Management “ , S. Chand2. Dr. Sathyaprasad : “ Financial Management “ , Himalaya Publishing HouseREFERENCE BOOKS:1. R K Sharma & S K Gupta : “ Financial Management ”2. K P Rustogi : “Fundamentals <strong>of</strong> Financial Management ”3. I M Pandey : “ Financial Management ”<strong>BCA</strong> syllabus


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


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India56<strong>BCA</strong> 435: ANALYSIS AND DESIGN OF ALGORITHMSTotal Teaching Hours: 45UNIT 1: Introduction-A simple example <strong>of</strong> design using insertion sort, pseudo code forinsertion sort and analysis <strong>of</strong> time complexity. Performance Analysis – Space complexityand Time complexity (posteriori testing, and apriori approach), Asymptotic Notations (O,Ω, Θ). Polynomial vs. Exponential Algorithms. Average, Best and Worst casecomplexity.(06 hours)UNIT 2: Divide and Conquer Algorithms – Introduction to Divide and ConquerAlgorithms - Finding the Maximum and Minimum, Quick sort (Derivation <strong>of</strong> Averagecase analysis and Worst case analysis), Binary Search (Derivation <strong>of</strong> average caseanalysis), and Strassen’s Matrix Multiplication(07 hours)UNIT 3: Greedy Algorithms – Introduction to Greedy Algorithms - FractionalKnapsack problem, Minimum cost spanning trees Kruskal’s and Prim’s Algorithms,Optimal Merge patterns and Single-Source Shortest Paths(07 hours)UNIT 4: Dynamic Programming – Definition - All-pairs shortest paths, Travelingsalesman problem and optimal parameterization for product <strong>of</strong> sequence <strong>of</strong> matrices(06 hours)UNIT 5: Back tracking and Branch and Bound Algorithms – Introduction - N-Queens Problem, Sum <strong>of</strong> Subsets problem using Back tracking algorithms. TravelingSalesman problem using branch and bound method(07 hours)UNIT 6: Graphs and Heaps – Definitions – Adjacency Matrix, Adjacency Lists.Breadth First Search and Traversal, Depth First Search and Traversal. Priority Queuesusing Heap and Design <strong>of</strong> Heap sort using Priority Queues(08 hours)UNIT 7: Lower bound Theory – A brief introduction to comparison trees and NP hardand NP complete problems(04 hours)TEXT BOOK:Horowitz, Sahni, Rajasekaran, “Fundamentals <strong>of</strong> <strong>Computer</strong> Algorithms.” GalgotiaPublications, 1996REFERENCE BOOKS1. Donald E. Knuth, “The Art <strong>of</strong> <strong>Computer</strong> Programming” Volume 3, Sorting andSearching, Second Edition, Pearson Education2. Donald E. Knuth, “The Art <strong>of</strong> <strong>Computer</strong> Programming” Volume 1, fundamentalalgorithms, Third Edition, Pearson Education3. GAV PAI, “Data structures and Algorithms”, Tata McGraw Hill4. Richard F. Gilberg, Behrouz A, Forouzan “Data structures A Pseudocode approachwith C”<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India<strong>BCA</strong> 436: PROGRAMMING IN JAVA57Total Teaching Hours: 45UNIT 1: Introduction - History-Java and the Internet-Java Applets and <strong>Applications</strong>-Features <strong>of</strong> Java-Datatypes-Literals-Variables-Type conversion and casting-Arrays-oneand Multi dimensional arrays-Operators-Arithmetic, Boolean logical, Relational andBitwise operators-Operator Precedence. Classes and Objects - General form <strong>of</strong> a class-Creating objects-Constructors-Parameterized constructors-Defining methods-Overloadingmethods-Returning a value-Returning an object-Recursion-Access control-Garbagecollection-finalize() method-this keyword and instance variable hiding-Static variablesand methods-Defining constants using final. (08 Hours)UNIT 2: String Handling - String Constructors-String length-String Literals-StringConcatenation-String concatenation with other data types-String conversion andtoString()- Character Extraction- String Comparison-Searching Strings- Modifying aString- Data Conversion and valueOf()-Changing the case <strong>of</strong> characters-String Buffer.(04 Hours)UNIT 3: Inheritance - Basics-Member Access and Inheritance- Super class variablereferring to a sub class-<strong>Applications</strong> <strong>of</strong> keyword super- Creating a Multilevel Hierarchy-Order <strong>of</strong> calling constructors-Method Overriding-Dynamic method dispatch-Abstractclasses-Using final with Inheritance. Packages and Interfaces - Defining a package-CLASSPATH -Defining an Interface - Implementing interfaces-Variables in interfaces-Extending interfaces.(08 Hours)UNIT 4: Exceptions- Types - Uncaught Exceptions - try and catch - Multiple catch -Nested Try - throw, throws and finally-Built-in Exceptions. MultithreadedProgramming - The Java Thread Model- Thread Priorities- Synchronization. (04 Hours)UNIT 5: Java.io Package-I/O Basics-Reading console Input-Writing console output-PrintWriter class-Reading and Writing files-Java I/O classes and interfaces-File class-Stream classes-Byte Streams-Character Streams. (05 Hours)UNIT 6: Applets-Applet basics-Applet Architecture-Applet life cycle-Applet displaymethods-Repaint-Status window-passing parameters to applets-getDocumentBase() andgetCodeBase()-AppletContext and showDocument().Event Handling-Event handlingmechanisms-Delegation Event Model-Event classes-Sources <strong>of</strong> events-Event listenerinterfaces-Handling mouse and keyboard events-Adapter classes-Inner classes.(08 Hours)UNIT 7: AWT-AWT classes-Window fundamentals-working with frame windows-Creating a frame window in an applet-Creating a windowed program-Displayinginformation within a window AWT Controls, Layout Managers and Menus – Controlfundamentals-Labels-Buttons-CheckBoxes-CheckBoxGroup-ChoiceControl-Lists-ScrollBar-TextField-TextArea-LayoutManagers-MenuBars and Menus-DialogBoxes-FileDialog- Handling events by extending AWT components. (08 Hours)<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India58TEXT BOOK:1. Herbert Schildt, “The Complete Reference- Java”, Seventh Edition, TataMcGraw-Hill Publishing Company Limited: NewDelhiREFERENCE BOOK:5. Deitel and Deitel, “Java Programming”, Prentice Hall6. E. Balagurusamy “Programming with JAVA a Primer”, Tata McGraw-Hill Publishing Company Limited: NewDelhi<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India59<strong>BCA</strong> 451: JAVA PROGRAMMING LABGuidelines:• The output <strong>of</strong> the programs should be neatly formatted.• 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 <strong>of</strong> the program• Use meaningful variable names1. Aim: Demonstrating the use <strong>of</strong> methods <strong>of</strong> Math class.2. Aim : Programs to implement the methods <strong>of</strong> String class3. Aim : To Demonstrate interfaces4. Aim : To demonstrate inheritance5. Aim : To demonstrate super and this6. Aim : To demonstrate static variables and methods7. Aim : To demonstrate Exceptions8. Aim : To demonstrate FileInputStream and FileOutput Stream Classes9. Aim : To Demonstrate the creation <strong>of</strong> applets and passing parameters to applets10. Aim :To Demonstrate Mouse and Keyboard events in an applet11. Aim: To Demonstrate the creation <strong>of</strong> a frame.12. Aim: To Demonstrate Labels and Buttons with proper events13. Aim : To demonstrate Checkboxes with proper events14. Aim : To demonstrate CheckBoxGroups with proper events15. Aim : To demonstrate Lists and TextFields with proper events16. Aim : To demonstrate ScrollBars with proper events17. Aim: To demonstrate MenuBars and Menus.18. Aim: To demonstrate Dialog boxes.<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India60<strong>BCA</strong> 452: DBMS PROJECT LABGuidelines:• Students have to develop a mini project using Oracle as back end and any frontend tool.• Students should be divided into batches, each batch containing not more than fourstudents.• The practical examination carries 100 marks divided as follows:1. Interface Design 20 marks2. Validation 10 marks3. Reports/Presentation 10 marks4. Viva Voce 10 marksContinuous Internal Assessment 50 marks<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India61<strong>BCA</strong> 531: PROFESSIONAL ENGLISHTotal Teaching Hours: 45UNIT 1: An Introduction to Technical Writing(01 Hours)UNIT 2: <strong>Applications</strong> <strong>of</strong> Technical WritingTechnical Reports , Technical Editing , Business Plans , Proposals , Progress Reports ,Instruction Manuals, User Guides, Oral Presentations, DDLC(05 Hours)UNIT 3: Document DesignBook Design , Page Design , Headings , Lists , Special Notices, Graphics, Tables, ReportFormat and Final Packaging, Highlighting and Emphasis, Indexing(10 Hours)UNIT 4: Audience analyses and Document planningUNIT 5: Principles <strong>of</strong> Technical writing(02 Hours)(02 Hours)UNIT 6: RoboHELP -Introduction to RoboHELP : Help Basics, Types <strong>of</strong> Help, HelpSystem Components , Basic Steps in Creating a Help File, Using CSS, BrowseSequences, Linking and Navigation ,Text-only Pop-ups, Build Tags, Images, ContextSensitive Help(15 Hours)UNIT 7: FrameMaker -How to create FrameMaker Documents, Templates ,PageLayout,Text Formatting, Adding graphics to paragraph formats, Graphics, Creating Table<strong>of</strong> Contents and Indexes, Tables, Inserting Images, Master Pages, Header and Footer,Structured Framemaker , Color Models, Conditional Text, Creating Hypertext and viewonlydocuments.REFERENCES:1. Sharon J. Gerson and Steven M. Gerson; Technical Writing Process and Product;3 rd Edition,2004.2. Philip Rubens; Science and Technical Writing-A manual <strong>of</strong> style; 2 nd edition,2004.3. Paul.V. Anderson; Technical Writing - A Reader Centered Approach; 3 rd edition,1995.<strong>BCA</strong> syllabus


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


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India63UNIT 5: UNIX SHELL PROGRAMMINGShell variables - Shell Keywords - Positional parameters - Passing command linearguments - Arithmetic in shell scripts - Read and Echo - Control Structures - if-then-fi -if-then-else-fi - Nested if - Case control structure – Loops - while-until –for - break andcontinue - Shell meta characters - Exporting variables - Used defined Functions – SystemShell Script files: .pr<strong>of</strong>ile, .history .. Etc.(12 Hours)TEXT BOOKS:1. Maurice J Bach, “The Design <strong>of</strong> Unix Operating System”,Prentice Hall <strong>of</strong> India Pvt. Ltd, NewDelhi, 1986.2. Yashavant P Kanetkar, “Unix Shell Programming”, BPB Publications,NewDelhiREFERENCE BOOKS:1. Stan-Kelly-Bootle, “Understanding Unix”, BPB Publications,NewDelhi2. Vijay Mukhi, “Unix Shells-Bourne-Korn-C”, BPB Publications,NewDelhi<strong>BCA</strong> syllabus


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


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India65<strong>BCA</strong> 551: UNIX LABSECTION – A1. Write a shell program to find the largest <strong>of</strong> 3 numbers using command linearguments.2. Write a shell program to compare two strings given by the user.3. Write a shell program to concatenate the contents <strong>of</strong> two files.4. Write a shell program to find sum <strong>of</strong> digits <strong>of</strong> a given number.5. Write a Shell Script to convert a binary number to its decimal equivalent.6. Write a Shell Script to print the multiplication table.7. Write Shell Scripts to compute the factorial value with and without usingrecursive functions.8. Write a shell program to remove the files <strong>of</strong> the same size in the current directory9. Write a shell program to convert all lower case into upper case and vice versa in afile using command line arguments.10. Write a Shell Script to prepare and display the Electricity bill with significantconsiderations.SECTION – B11. File handling system.a. create a fileb. copy the filec. move the filed. delete the filee. exit12. Write a menu based program to permit or remove read/write/execute permission<strong>of</strong> a file.13. Write a shell program to calculate the net salary <strong>of</strong> an employee in a particularmonth. Considering various allowances (TA, DA, and HRA) and deductions(income tax) as:TA = 15 % <strong>of</strong> Basic salaryDA = 2 % <strong>of</strong> Basic salaryHRA = 10 % <strong>of</strong> Basic salaryIncome tax = 5% <strong>of</strong> salaryPF = 10 % <strong>of</strong> salary14. Students marks sheet processing.15. write a shell program which willa. ask the user to enter a filenameb. check if the file is ordinary file and is readablec. display the file if the file is ordinary and readabled. display an error message if the file is not ordinary and/or not readable<strong>BCA</strong> syllabus


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


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India<strong>BCA</strong> 553: SPECIALIZATION PROJECT67Guidelines:• Students have to develop a mini project related to the stream opted using suitableback end and any front end tool.• Students should be divided into batches, each batch containing not more than fourstudents.• The practical examination carries 100 marks divided as follows:1. Interface Design 20 marks2. Validation 10 marks3. Reports/Presentation 10 marks4. Viva Voce 10 marksContinuous internal assessment 50 marks<strong>BCA</strong> syllabus


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


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


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India70TEXT BOOKS:1. Thomas A. Powell, HTML 4.0, The Complete Reference, Tata McGraw-HilllPublications, 1998.2. Michele Petrovsky, Dynamic HTML in Action, Tata McGraw-Hilll Publications.3. Don Gosselin, Comprehensive Java Script , Web Warrior Series, CourseTechnologies Inc,4. Phil Hanna, JSP 2.0, The Complete Reference, by, Tata McGraw-Hill Publications.REFERENCE BOOKS:1. David Flanagan, JavaScript The Definitive Guide, O’Reilly & Associates 19972. Madhushree Ganguli, JSP – A Beginner’s Guide, Wiley Dreamtech India (P) Ltd.2002<strong>BCA</strong> syllabus


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


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India72<strong>BCA</strong> 542B: SYSTEM SOFTWARETotal Teaching Hours: 45UNIT 1: Introduction - What is System S<strong>of</strong>tware? Evolution <strong>of</strong> Components <strong>of</strong> aProgramming System, General Machine Structure - Memory, Registers, Data andInstructions. Machine Language - No Looping, Address modification using instructionas Data and Index registers, Looping. Assembly Language Program using Literals andpseudo -ops.(07 Hours)UNIT 2: Assembler - General design procedure, Design <strong>of</strong> Assembler- Statement <strong>of</strong>Problem, Data Structures, Format <strong>of</strong> Databases, Algorithm (2-pass assembler) in briefwith flowchart(10 Hours)UNIT 3: Macro Language and the Macro Processor: Macro instructions, Features<strong>of</strong> Macro facility(i) Macro instruction argument(ii) Conditional Macro expansions(iii) Macro call within MacrosImplementation- Two-Pass macro processor with flowchart (08 Hours)UNIT 4: Loaders and Linkers: - 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, Linking loaders, Overlays, Dynamic Binders.Design <strong>of</strong> an Absolute Loader (10 Hours)UNIT 5 :Compilers - Different phases- Lexical Phase, Syntax Phase, InterpretationPhase, Optimization Phase, Storage Assignment Phase, Code Generation Phase andAssembly phase. Passes <strong>of</strong> a Compiler with flow chart. (10 Hours)TEXT BOOK:1. Leland L Beck, “System S<strong>of</strong>tware- An introduction to systems programming” ,3 rd Edition, Addison –Wesley.2. Donovan, John J, Systems Programming, Tata McGraw-Hill, 1991REFERENCE BOOK:1. D.M.Dhamdere, “Introduction to System S<strong>of</strong>tware” , McGraw-Hill Education,19872. Aho, Sethi & Ullman , Compilers Principles, techniques and tools, PearsonEducation,2002<strong>BCA</strong> syllabus


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


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


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


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


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


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


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India79<strong>BCA</strong> 651: MAIN PROJECTGuidelines:• Students have to develop a project using any package, any tool available withinthe college. Project can be implemented live but need to be demonstrated at thetime <strong>of</strong> examination. The CIA marks can be awarded by the guide by evaluatingthe performance <strong>of</strong> the student during the course <strong>of</strong> the project work• Students should be divided into batches, each batch containing not more than twostudents.• The End semester practical examination carries 100 marks divided as follows:1. Interface Design 40 marks2. Validation 20 marks3. Reports/Presentation 20 marks4. Viva Voce 20 marks<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India80CERTIFICATE COURSESOFFERED BYDEPT OF <strong>BCA</strong><strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India81CERTIFICATE COURSE ON J2EEHours: 60 (Theory: 25 + Practical 25 + 10 Project)Credits: 02Prerequisite: Knowledge <strong>of</strong> Core Java, OO concepts and Knowledge <strong>of</strong> database.1. Java Beans (08 Hours)1.1 Bean Developer Kit (BDK)1.2 JAR Files1.3 Developing a Simple Bean Using the BDK1.4 The Java Beans API2. JDBC (06 Hours)2.1 JDBC Basics and Driver Types2.2 Prepared and Callable Statements2.3 Metadata Classes2.4 SQL and Java Data Types3. Servlets (12 Hours)3.1 Architecture and Concepts Basic Servlet Concepts and Examples3.2 Web Container and Servlet lifecycle3.3 Request-Response Architecture3.4 Mapping and Running Servlets3.5 Servlet Resources – Servlet Context and Scope, HTTP GET andPOST, Multithreading Issues, Error handling3.6 Servlet Persistence and Session Tracking – Persistence in a StatelessArchitecture, Introduction to Cookies, Sessions with Cookies, SessionTracking API<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India824. Java Server Pages (10 Hours)4.1 Architecture and Concepts JSP Concepts and Motivation4.2 JSP Lifecycle4.3 JSP Tags and Constructs4.4 Implicit JSP Objects and Scopes4.5 Custom Tag libs4.6 JSP - Servlet Communication – Communication based on JavaBeans,Forwarding Requests and Responses5. EJBs: Architecture and Concepts (18 Hours)5.1 Enterprise Java Beans5.2 EJB Architecture5.3 EJB Components5.4 Session and Entity Beans6. Java & XML (06 Hours)6.1 Understanding XML and the Java XML APIs6.2 Serial Access with the Simple API for XML (SAX)6.3 XML and the Document Object Model (DOM)6.4 Using XSLT<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India83CERTIFICATE COURSE ON TESTING TOOLSHours: 60 (Theory: 25 + Practical 25 + 10 Project)Credits: 021. S<strong>of</strong>tware Quality Assurance: An Overview: (02 Hours)1.1 S<strong>of</strong>tware Crisis1.2 The birth <strong>of</strong> s<strong>of</strong>tware engineering1.3 Why s<strong>of</strong>tware engineering?1.4 Criteria <strong>of</strong> a successful s<strong>of</strong>tware project1.5 Process oriented s<strong>of</strong>tware development1.6 Phases in s<strong>of</strong>tware development life cycle1.7 S<strong>of</strong>tware development lifecycle models1.8 The management processa) Metrics in S<strong>of</strong>tware Developmentb) Quality management systemsc) Process change management2. S<strong>of</strong>tware Testing Process (01 Hour)2.1 Psychology <strong>of</strong> testing2.2 Verification and validation2.3 Testing team and development team2.4 Cost <strong>of</strong> quality2.5 Characteristics <strong>of</strong> test engineers2.6 Why testing is difficult?2.7 Levels <strong>of</strong> testing2.7.1 Unit testing2.7.2 Module testing2.7.3 Integration and system testing2.7.4 Acceptance testing2.8 Testing approaches2.8.1 Top down approach versus bottom up approach2.8.2 Functional versus Structural testing2.8.3 Mutation testing2.8.4 Regression testing2.9 Types <strong>of</strong> testing2.9.1 Black box testing2.9.2 White box testing2.9.3 Gorilla testing2.9.4 Beta testing2.9.5 Field trail2.9.6 Performance testing2.9.7 Stress testing2.9.8 Acceptance testing<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India842.10 Test plan2.10.1 Test oracles2.10.2 Test cases2.10.3 Test plan format2.11 Criteria for completion <strong>of</strong> testing2.11.1 When is testing complete?2.11.2 Classification <strong>of</strong> defects3. S<strong>of</strong>tware Testing Tools: Overview (01 Hour)3.1 Need for Automated testing tools3.2 Taxonomy <strong>of</strong> testing tools3.3 Functional/Regression testing tools3.4 Performance Testing tools3.5 Testing Management tools3.6 Source Code Testing tools3.7 How to select a testing tool4. Win runner (16 Hours)4.1 Overview <strong>of</strong> Win runner4.2 Testing an application using Win runner4.2.1 Recording test cases4.2.2 Calling test cases using "call "function4.3 Test script Language(TSL)4.4 GUI MAP File4.5 Synchronization <strong>of</strong> test cases4.5.1 Creating a test case4.5.2 Synchronizing the Test cases4.6 Data DRIVEN TESTING4.6.1 Converting test case to data driven test4.7 Rapid test script wizard4..8 Mapping custom objects to standard class4.9 Checking GUI objects4.9.1 Checking a single property4.9.2 Checking a single object4.9.3checking for multiple objects5 TEST DIRECTOR (10 Hours)5.1 Test director Overview5.2 Test management process5.2.1 Test requirements management5.2.2 Test planning5.2.3 Test execution5.2.4 Test results analysis5.3 Managing test process using Test director5.3.1 Creating a new project5.3.2 Creating the test plan5.3.3 Running the automated test5.3.4 Tracking defects<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India856 .SQA ROBOT (10 Hours)6.1 Overview <strong>of</strong> SQA Robot6.2 testing an application using SQA Robot6.2.1 Recording test cases6.2.2 Running the test procedure6.2.3 Calling the test procedure using "call procedure" function6.3 Synchronization <strong>of</strong> test procedures6.4 Creating Checkpoints7. SILK TEST (10 Hours)7.1 Overview <strong>of</strong> silk test7.2 Architecture <strong>of</strong> Silk test7.3 Testing an application using Silk test7.4 The 4test scripting language7.5 Checkpoints7.6 Data driven Test cases8 Quick Test Pr<strong>of</strong>essional (QTP) (10 Hours)8.1 Overview <strong>of</strong> QTP8.2 Testing an application using QTP8.2.1 Recording a test case8.2.2 Running a test case8.3 Synchronization <strong>of</strong> test cases8.3.1 Creating check points8.3.2 Testing database application usingsynchronization and check pointsPROJECT WORK8.4 Data driven testing8.5 Testing a web applicationTEXT BOOKS:1. SOFTWARE TESTING TOOLS: Author:: Dr.K.V.K.PRASAD, pub:dreamtech press2. S<strong>of</strong>tware Engineering :A practitioner's approach: Author:Roger.S.PressmanREFERNCE BOOKS:1. The art <strong>of</strong> s<strong>of</strong>tware testing.. Author: G.Meyer Pub: john wiley &sons2. Testing computer s<strong>of</strong>tware Author: ComdexINTERNET RESOURCES:www. mercury interactive.comwww.autotester.comwww.fsf.orgwww.qaforums.comwww.qajobs.netwww.rational.comwww.segue.comwww.s<strong>of</strong>twaretestinginstitute.comwww.sei.cmu.edu<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India86CERTIFICATE COURSE ON .NET TECHNOLOGIESHours : 60 ( 25 Theory : 25 + Practical 25 + 10 Project )Credits: 02Prerequisite: Knowledge <strong>of</strong> Programming, Basics <strong>of</strong> DatabaseA) Visual Basic .Net1. Introduction to Visual Basic .NetIntroduction to Visual Basic .NetNeed for visual basic .NetUnderstanding .Net frameworkFeatures <strong>of</strong> .NetFeatures <strong>of</strong> VB.NetThe Architecture <strong>of</strong> VB.NetSystem requirements and installation2. Programming in Visual Studio .NetProgramming in Visual Studio .Net IDEIntroduction to windows and web formsVisual Studio.Net solutions and projectsThe Visual Studio .Net InterfaceEvent Driven ProgrammingWriting a simple applications using Visual Basic .NetIntroduction to forms3. Programming ConceptsIntroduction to variablesTypes <strong>of</strong> variablesType conversionConstants and enumerationsOperatorsStatementsArrays4. Writing ProceduresIntroduction to proceduresTypes <strong>of</strong> proceduresCalling proceduresArgument passing MechanismsScope <strong>of</strong> variablesUseful Built-in functions5. OOPs in Visual Basic .NetIntroduction to object-Oriented ProgrammingClasses and ObjectsFeatures <strong>of</strong> OOPsCreating Classes<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India87Creating Fields and Methods <strong>of</strong> ClassesConstructors and DestructorsCreating Property ProceduresCreating EventsNamespacesImports Keywords6. Inheritance, polymorphism and InterfacesInheritanceOverriding Methods and PropertiesMyBase KeywordMyClass KeywordAbstract Base ClassesShared MembersPolymorphismInterfaces7. Exception HandlingIntroduction to ExceptionsUnstructured error handling using On error StatementErr ObjectStructured Exception Handling Using Try Catch Finally StatementsUser Defined Exceptions8. Working with FormsInheritance in Windows FormsLoading and showing FormsVisual InheritanceAdding ControlsLayout Enhancement properties <strong>of</strong> controlsWorking with simple controlsAdding MenusContext Menus9. Advanced Windows <strong>Applications</strong>Advanced controlsCreating MDI <strong>Applications</strong>Graphical <strong>Applications</strong>Custom Windows ControlDelegates10. Data Access Using ADO.NETIntroduction to Data AccessOverview <strong>of</strong> ADO.NETADO.NET ArchitectureADO.NET ComponentsUsing ADO.NETUsing Visual Tools for Data AccessData Form Wizard<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India8811. Components and InteroperabilityIntroduction to componentsCreating ComponentsCross-Language interoperabilityCOM interoperabilityPROJECT WORKB) ASP.NET1. Getting Started with ASP.NETIntroduction to ASP.NETASP.NET and The .NET FrameworkCharacteristics <strong>of</strong> ASP.NETComparison <strong>of</strong> ASP and ASP.NET2. ASP.NET PagesA simple ASP.NET applicationWeb formscode declaration blockcode render blockpage directivesview statewriting ASP.NET and HTML codeCommon Language Runtime and ASP.NETIntermediate LanguageExecutionProcessingAssembliesSide-by-side execution3. Working with basic web controlsWorking with basic web controlsWorking with basic label controlsWorking with basic TextBox controlsWorking with basic button controlsPage NavigationWorking with Radio button, checkbox controlsDropdown list , image controlControlling visibility <strong>of</strong> contentFormatting Web ControlsApplying CSS to WEB Controls4. Advanced ASP.NET ControlsControls- panel , Place Holder, AdRotator, calendarValidating client dataASP.NET Validation ControlsDisabling validations<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India895. Runtime Programming with ControlsMultiple FormsAdding Controls at runtimeDynamicallyGenerating FormsDynamically Generating List items6. Data AccessOverview <strong>of</strong> ADO.NETCommon database tasksBinding data –Repeater ControlList ControlMiscellaneous ControlsAdvanced Data ControlsBinding Data to Datalist ControlBinding Data to a Datagrid Control7. Advanced Data AccessIntroduction to DatasetsElements <strong>of</strong> DatasetsUsing a Dataset in an ASP.NET PageUpdating Records in a Data TableWorking with DataViewsCaching DataSetsUsing .NET XML Classes in ASP.NET8. ASP.NET <strong>Applications</strong>Introduction to ASP.NET <strong>Applications</strong>Using Global Application FileConfiguring ASP.NET <strong>Applications</strong>Overview <strong>of</strong> Web.Config FileHTTP Handlers and ModulesDeploying ASP.NET <strong>Applications</strong>9. ASP.NET SessionsWeb Forms State ManagementCookiesSession StateSession EventsCookies less Sessions10. Securing <strong>Applications</strong>IntroductionAuthentication ServicesForms AuthenticationWindows AuthenticationConfiguring IISConfiguring Windows Security<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India9011. WEB ServicesIntroduction to Web ServicesArchitectureFeatures and BenefitsWeb Services ContractsCreating a Web ServiceCreating a client web applicationData-driven web servicesInteracting with a web site12. Custom ControlsNeed for Custom controlsCreating a simple custom controlsControl class HierarchyAdding properties and methodsControl eventsHandling postbacksComposite controlsPROJECT WORK<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, IndiaUGC approved Job oriented Certificate CourseWEB PAGE DESIGNING, MULTIMEIDA & 3DANIMATION91Industry standard Pr<strong>of</strong>essional Certificate courses on multimedia packageswhich prepares the student to handle the industry requirements and get agood job and knowledge which they can incorporate in his/her academicprojects also.The course is divided into 3 modules which covers all the aspect <strong>of</strong> web pagedesigning, Animation and modeling.Level I :Part A Adobe Photoshop CS3Part B Autodesk 3DStudio Max 2008Level II :Part A Adobe Flash CS3 with Action Script ProgrammingPart B Autodesk MAYALevel III :Part A Basics <strong>of</strong> Internet and HTML, DHTMLPart B Dream weaver and Asp<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India92Level I : Part A Hours : 45Adobe Photoshop CS3Sl.NOTopicNo <strong>of</strong>hours1 IntroductionBasicConcepts <strong>of</strong> DesigningTheoritical Concepts og Designing . layouts, color theoryIntroduction to Photoshop, Bitmap and Vector Images ,Understanding Image Size and Resolution , Photoshop Menus,Palettes, Color Theory, Photoshop color Modes, Photoshop Tools.2 Image size, Selection , Grid and Guides5Modifying Image Size , Resolution , Marquee, Lasso , Magic Wand ,Selection Tools, Selecting, Saving , Crop tool , Coping Selection AndImage, Grid and Guide Options.3 Masks , Channel , Painting and editing5Working with quick masks ,Painting ( Brush, and its effects ),Blending Modes, Color palettes ,Editing( Background , Color,Touchup , Cleanup),4 Layers5The layer Palette, Changing and controlling layer order, Editinglayers, Adjustment layers, Layer Effects5 Filters , Actions , Automation5Extract , Filter Gallery , Liquefy , Pattern making , Vanishing point ,Built in Bitmap Filters , 3 rd party Plug-ins, Using predefined Actions,Creating and Recording Actions. Using built in automation6 Preparing Image For Print and Web5Calculating Image size and Resolution , Changing Image Dimensions,Layout Preview, Color Separation , Optimizing Images for Web,File Formats. Creating WebPages , web photo galleries .7 Working with 3D layers5AnimationPanoramic Picture creationUsing 3 rd party palings8 Assignment :5Black and white to color conversion, color correction , CreatingPosters , Advertisement , Labels. CD covers ,Greeting card , photo manipulation , website content development9 Project 5Total 45 Hours5Level I : Part B Hours : 45<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India93Autodesk 3DStudio Max 2008 40hoursSl. Module Topic Tools covered HrsNo1 UI User Interface Navigation tool, view port , Orthographic ,perspective views, file open , import , incrementalsave , autobackup, customizing max, creating usershortcut keys2Geometrycreation ,Translation & toolsStandard primitives , extended primitives , spline(shape), hierarchy, palette, linking , snap, anglealignCompound objects Scatter, connect, Boolean , l<strong>of</strong>t , shape merge 22 Modeling Poly modeling Concepts , create , attach, detach , quick slice, cut,subdivision, bevel, extrude, outline, bridge, flipAssign : hammer model, simple house, UFO2Spline3 Rigging Foot ikQuadruped rigSkinningVechile rigFacial rig4 Animation AutomatedBall bouncingWalk cycleRun cycle5 Character BipedCharacter Modeling 2Subobject , attach, break, Boolean, trim, weld, 2connect, refine, outline, chamfer, divide,Assign : Pen , spectacleBone tools, hi solver, spline ik skinning skin tools 2Morpher 2Auto key, Set key2Assign : Rubber ball , cannon ball bounceCurve editor , out <strong>of</strong> range 2Basic editing , free form animation and editingstudiothem, keing . Assign : Walking on the stair case6 Texturing Material Basic material, assigning material UVW mappingUnwrapping Uv mapping, normal mappingCreating glass, crome , car paint , dice7 Lighting Lights & camera Asics, multiplier , attenuation, map shadow 23 point lighting Area light, fill light, rim light 2interior basicExterior basic , Sky light , light tracer, mental ray, final gather 2interior advanceExterior advance GI , HDRI lighting 28 Rendering Render tabs 2Video post Glow, flare , rendering , input video 29 Dynamics Particle Parry, pcloud,superarray, spray, PFsource (basic) 2ReactorCloth, rigidbody, rope, water, constraints: hinge, 2point to point spring10 Project 5Total Hours 45 Hours222Level II : Part A Hours : 45<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India94Adobe Flash CS3 with Action Script Programming 40hoursSl. Module Tools covered HrsNo1 Introduction Concepts <strong>of</strong> 2D animation , Drawing3User Interface Scene, Tool box, timeline , libraryTools & Stage Using and setting stage size . color, ruler , grid , guides 3context menu , customizing the shortcuts, learning tools todraw 2D drawingsTime line & Concept <strong>of</strong> animation , usage <strong>of</strong> layers , creating & editing 2layers layers , layer folders2 Graphic Symbols, graphics, movieclips, buttons 2Working with color , gradient , text, 23 Animation Creating animation , motion basics , frame by frame ,5Shape &MotiontweeningUsing time line effects , editing timeline effects ,Shape tweening, motion tweening , creating guide layers ,cell animation , text animation.4 Working with Importing sound , adding sound to timeline , edit sound, 2sound adding sound to button5 Working with Creating and publishing flash video , importing and2video modifying flash video , encoding video6 Movieclips Creating complicated animations2Creating e-learning contents , accessible content , workingwith scene ,7 Exercise Creating advertisement, non-interactive, interactive2presentation , quiz, slide shows. Photo shows. Mobilecontents8 Flash for web Creating Flash websites , linking pages , adding video , 2adding audio, adding interactivity ,9 Scripting Action script (programming ) 1010 Project Interactive games , presentation 8Total Hours 45 HoursLEVEL II : Part B Hours : 45Autodesk MAYASl. Topics Tools covered Hrs<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India95No1 Introduction anduser interface2 Working with 3Dspace3 Polygon modelingtools4 Polygon modeling(organic)5 NURBS modelingtools6 NURBS modeling(inorganic)Customizing maya interface , toolbox, shelf and shelfeditor , playback controls channel box, attributeeditor, command line , help line, editing preferences3D primitives and their components ( vertex , face,control vertex, isoparm, null) perspective andorthographic views, transformation tools,construction historyCreate polygon tool, extrude face, extrude edge,extrude vertex, bevel edge, combine, separate,smooth, smooth proxy, merger verticies, duplicateface, extract, fill hole.Modeling a cartoon character, Booleans, sculptpolygon tool, mirror geometry, and merge multipleedgesCV curves and EP curves , revolve , l<strong>of</strong>t, extrude,bevel, bevel plus, working with text, attach, anddetach , curves, attach and detach surfaces, open andclose curves.Modeling a bike, duplicating surface curve, round tool,circular fillet, trim tool. Intersect surface, project curves onsurface7 Hypershade Surface normals, Creating a new material (lambert,blinn and phong), applying a file texture to amaterial. Texturing mapping (planar, spherical andcylindrical), raytracing reflections8 Lighting , Camera ,renderingIntroduction to digital lights, depth map shadows andray trace shadow, three point light setup, creating acamera, adjusting render quality and resolution,rendering from a specific camera, batch render setup.9 Render engine Overview <strong>of</strong> S<strong>of</strong>tware, hardware, and vector engine. 210 Character setup Animation constraints (point, orient and pole vector),deformers (clusters and blend shapes), joints and IKhandle, Rigging a cartoon character( classic reversefoot, simple spine and arm setup, basic face rigsetup)211 Animation &Dynamics12ProjectKeyframe animation, motion path animation,animating a camera along a pathSpecial effects with dynamics , creating cinematiceffects, water falls , flower pots , crackers, fire ,smoke insects etcModeling a bottle, rocket and landscape usingparticle systems to animate. Walkthroughs <strong>of</strong> house& architectural buildingsTotal 45LEVEL III : Part A Hours : 45Concepts <strong>of</strong> Internet( HTML, DHTML, JavaScript )LEVEL III : Part A Hours : 452228282285hours<strong>BCA</strong> syllabus


MPH<strong>Christ</strong> <strong>University</strong>, Bangalore, India96Dreamweaver and ASP.NETIntroductionUnderstanding work flow, tools , property box , environment, site concept, savingmethod,. Adding text, lists, and previewing in browser, defining and configuring awebsite.Hyperlinks, Anchors, and Mailto links.Adding Images and MultimediaDisplaying images , optimizing and creating images , Creating image Maps andnavigation bars, adding flash and other multimedia to a web page, managingassets using Assets panel.Webpage layout with Tables and Frame & DHTMLPlanning layout, designing page layout using tables, displaying data in tables,using frame to display multiple web pages, Dynamic HTML, Layers, CascadingStyle Sheets (CSS) , Adding interactivity with behaviors.Data Form & ScriptingCreating a form and collecting Data, Introduction to scripts, sending and receivingto form data.Organizing and Uploading a ProjectUploading and sharing a project on the web, managing and editing a website,customizing Dreamweaver, Using library, reusing elements <strong>of</strong> a website, Creatingreusable webpage .<strong>BCA</strong> syllabus

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!