Department of Computer Science
Proposed Syllabus for Bachelor of Computer Applications 2013
Syllabus 2013
BCA
Credit System for BCA Subject
Semesters- No. of hours (credits) I
II
III
IV
V
VI
Hours Credits Marks
Theory Papers
17(12) 17(12) 21(15) 17(12) 18(13)
18(13)
108
77
3100
Practical Papers
08(04) 08(04) 08(04) 12(06) 12(06)
12(06)
60
30
1500
02(01) 02(01) 02(01) 02(01)
08
04
200
01(01) 01(01) 01(01) 01(01)
04
04
-
180
115
4800
Self Study Paper Holistic Education Total Marks
28(18) 28(18) 32(21) 32(20) 30(19) 750
750
850
Christ University, Bangalore, India
850
800
30(19) 800
2
Syllabus 2013
BCA
Semester I Paper Hours per Paper Marks Credits Code Week BCA131 Creative English 03 100 02 BCA132 Algebra 03 100 02 BCA133 Statistics-I for BCA 03 100 02 BCA134 Digital Computer Fundamentals 04 100 03 BCA135 Introduction to Programming 04 100 03 Using C BCA151 C Programming Lab 04 100 02 BCA152 PC Software Lab 04 100 02 BCA171 Hardware Lab (CIA Only) 02 50 01 HED111 Holistic Education 01 01 Total 28 750 18
Semester II Paper Paper Code BCA231 Communicative English BCA232 Calculus BCA233 Statistics-II for BCA BCA234 Operating Systems BCA235 Data Structures BCA251 Data Structures Lab BCA252 Visual Programming Lab BCA271 Case Tools Lab(CIA Only) HED211 Holistic Education Total
Christ University, Bangalore, India
Hours per Marks Credits Week 03 100 02 03 100 02 03 100 02 04 100 03 04 100 03 04 100 02 04 100 02 02 50 01 01 01 28 750 18
3
Syllabus 2013
BCA
Semester III Paper Code BCA331 BCA332 BCA333 BCA334 BCA335 BCA336 BCA351 BCA352 BCA371 HED311 Total
Paper Interpersonal Communication Introductory Graph Theory and Linear programming Financial Accounting Software Engineering Database Management Systems Object Orient Programming Using C++ C++ Lab Oracle Lab Domain Lab (CIA Only) Holistic Education
Semester IV Paper Paper Code BCA431 Professional English BCA432 Numerical Techniques BCA433 Financial Management BCA434 Computer Networks BCA435 Programming in Java BCA451 Java Programming Lab BCA452 DBMS Project Lab BCA453 Web Technology Lab BCA471 Language Lab(CIA Only) HED411 Holistic Education Total
Christ University, Bangalore, India
Hours per Marks Credits Week 03 100 02 03
100
02
03 04 04
100 100 100
02 03 03
04
100
03
04 04 02 01 32
100 100 50 850
02 02 01 01 21
Hours per Marks Credits Week 03 100 02 03 100 02 03 100 02 04 100 03 04 100 03 04 100 02 04 100 02 04 100 02 02 50 01 01 01 32 850 20
4
Syllabus 2013
BCA
Semester V Paper Code BCA541A BCA541B BCA531 BCA532 BCA542A BCA542B BCA542C BCA543A BCA543B BCA543C BCA551 BCA552 BCA553A BCA553B BCA553C Total
Paper Foreign Language-I German Language-I French Language-I Psychology for Professional Development Unix Programming Elective I (Choose any one) OOAD Using UML TCP/IP System Software Elective II (Choose any one) Mobile Applications Graphics and Animation Microprocessor and ALP Unix Lab Web Designing Project Mobile Applications Lab Graphics and Animation Lab Microprocessor and ALP Lab
Semester VI Paper Code BCA641A BCA641B BCA631 BCA632
BCA642A BCA642B BCA642C BCA643A BCA643B BCA643C BCA551 Total
Paper
Foreign Language-II German Language-II French Language-II Cyber Law Design and Analysis of Algorithms Elective I (Choose any one) Client-Server Computing Distributed Systems Computer Architecture Elective II (Choose any one) software Testing Multimedia Applications Embedded systems Major Project
Christ University, Bangalore, India
Hours per Marks Credits Week 03
100
02
03
100
02
04
100
03
04
100
03
04
100
03
04 04
100 100
02 02
04
100
02
30
800
19
Hours per Marks Credits Week 03
100
02
03
100
02
04
100
03
04
100
03
04
100
03
12 30
300 800
06 19
5
Syllabus 2013
BCA
BCA131 Creative English Total teaching Hours/Semester:45
No of Lecture Hours/Week: 03
Introduction: The English syllabus for the first semester of BCA looks at developing the analytical and writing skills of the student who steps into college for a professional course. The syllabus has been divided into two sections, taking into account the intellectual, psychological, social and professional needs of a student. Accordingly, an anthology of short stories, poems and essays/ articles has been compiled keeping in mind the above mentioned needs. The anthology has been named Polymorphic Interface since English Literature and language have an interface which is polymorphic in nature, wherein the learner looks at life from a multidimensional point of view. Polymorphic Interface, the anthology, has two main divisions. The first part takes into account the need for building the Interpersonal and Emotional Intelligence of the student, through a few prescribed poems, speeches, articles, essays and short stories. The student is guided towards a critical thinking process through these selected pieces, which focus on varied issues. Classroom interaction and participation on related issues are expected to expand the horizons of the young mind. The second part aims at reinforcing the written and oral skills of the young mind. The methodology is versatile and need-based. Innovative exercises for every unit are administered in the classroom by the thought-triggering facilitator. Objectives • To train the student in critical and creative thinking • To help the student relate and respond to Literature • To tap the dormant creative skills of the students Learning outcome Upon successful completion of the course the students the student would be able to develop reading and writing skills.
UNIT I. Poetry 1. If : Rudyard Kipling 2. I know why the caged bird sings: Maya Angelou 3. The Hill : Nissim Ezekiel
(8)
UNIT II. Short Stories: 1. The Story of an Hour : Kate Chopin 2. Beyond the Wall : Ambrose Bierce 3. The Mountain Trail : Anil Chandra
(7)
UNIT III. Essays: 1. Earth is only a Front Yard : Arthur Brisbane 2. Three visions of India : A Speech by A PJ Abdul Kalam 3. Facebook – An article from Times of India
(7)
UNIT IV. Writing skills – Grammar Topics:
(8)
Christ University, Bangalore, India
6
Syllabus 2013
BCA
1. Grammar reinforcement: Correction of errors, tense forms, usage of articles and prepositions 2. Framing questions through a given dialogue UNIT VI. Writing Skills: Paragraph Writing
(7)
Paragraph writing – what is a paragraph – the main features of a paragraph – how to write a good paragraph – exercises in paragraph writing to be given – the exercises can be on varied topics like personal experiences, social responsibilities, current topics, computer related topics
UNIT VII. Writing skills: Paraphrasing and Creative writing
(8)
Topics: 1. Paraphrasing, note making, abstracting 2. Creative writing: situational conversations,
Text Book: [1] Polymorphic Interface ( An anthology compiled by the Department of English, Christ University, Bangalore) Reference Book: [1] Readers' Digest. How to Write and Speak Better: Revised ed. Hong Kong: The Readers' Digest Association Limited, 2005
Question Paper Pattern Mid Semester Exam: 1
Sections
A
B
C
2
No. of Questions in each Sections No. of Questions to be answered Marks for each question Maximum marks for each Section Total : 50
5
3
3
4
1
3
5
15
5
20
15
15
3 4 5
End-semester Examination 1
Sections
A
B
C
2
No. of Questions in each Sections No. of Questions to be answered Marks for each question Maximum marks for each Section
6
3
5
4
2
5
5
15
10
20
30
50
3 4 5
Christ University, Bangalore, India
7
Syllabus 2013
Christ University, Bangalore, India
BCA
8
Syllabus 2013
BCA
BCA132 Algebra Total teaching Hours/Semester:45
No of Lecture Hours/Week: 03
Objective To help to gain knowledge about Discrete Mathematics. This includes the topics like Mathematical Logic, Set Theory, Relations, Functions, Matrices and Group theory. To inculcate in students the fundamental mathematical background in computer education. Learning outcome Upon successful completion of the course the students • Understands the basic concepts of Mathematical logic, Matrices, Sets, Relations Functions and Group theory. • Develops ability to think rigorously and analytically to solve real-world problems. UNIT I. (10) MATHEMATICAL LOGIC Propositions and Truth Values, Connectives and their truth tables, Tautology and Contradiction, Logical Equivalence – Standard Theorems, Problems on negation, Converse, inverse and Contra positive of a Proposition, Open Sentences, Quantifiers, Truth sets, Connectives involving quantifiers, Normal forms, Principal normal forms. UNIT II. (13) MATRICES Review of fundamentals, Equivalent matrices, Elementary row (column) operations, Rank of a Matrix by reducing it to echelon from, Rank of a matrix by normal form, Finding the inverse of a matrix, Homogeneous and non – Homogeneous system of equations- Consistency criterion, Characteristic equations – Eigen values, Eigen vectors and properties,Cayley Hamilton theorem (Statement only). UNIT III. (12) SETS , RELATIONS AND FUNCTIONS Definitionof set, Operations on sets, Basic set identities, Principal of Inclusion and Exclusion, De-Morgan’s Laws, Cardinality, Difference, Symmetric difference, Cartesian product, Results related to Cartesian products, Relations – Types of relations –Equivalence relation,Matrix representation of a binary relation, Functions – onto ,one –one , into, inverse functions, Composition of functions – Inverse of compositions. UNIT IV. (10) GROUP THEORY Definition of Group,Semigroup, Subgroup, Results on subgroups, Order of an element, Properties – Cyclic groups and related properties,Coset decomposition, Lagrange’s theorem and its consequences, Group homomorphism.
Christ University, Bangalore, India
9
Syllabus 2013
BCA
Text Books: [1]D.S.Chandrasekharaiah, Discerete Mathematical Structures, 2nd Edition, PRISM Book Pvt Ltd., 2009. [2] Tremblay and Manohar,Discrete Mathematical Structures With Application To Computer Science, McGraw Hill Book Company,2006. [3] A R Vasishta, Matrices, Eighteenth Edition, S K RastogiFor Krishna Prakashan Media(P) Ltd., 2008. [4] I N Herstein, Topics in Algebra, Second Edition, WILEY-INDIA Pvt. Ltd., 2008. Reference Books: [1] K H Rosen,Discrete Mathematics and Its Applications, 7th Edition, McGraw-Hill Education, 2012. [2] G.K.Ranganath & B.Suryanarayana, A Text Book of B.C.A Mathematics Vol – I and II, S Chand and company, 2002.
Question Paper Pattern (ESE) Section
A
B
C
Unit and No. of subdivisions to be set in the Unit Unit I Unit II Unit III Unit IV Unit I Unit II Unit III Unit IV Unit I Unit II Unit III
Christ University, Bangalore, India
3 4 3 2 3 4 2 2 1 1 1
No. of subdivisions to be answered
Marks for each subdivision
Maximum Marks for the Part
10
3
30
9
6
54
2
8
16
Total
100
10
Syllabus 2013
BCA
BCA133 Statistics –I for BCA Total teaching Hours/Semester:45
No of Lecture Hours/Week: 03
Objective To acquaint students with various statistical methods. To cultivate statistical thinking among students. To prepare students for future courses having quantitative components. Learning outcome Upon successful completion of the course one should be able to • Understand and appreciate descriptive statistics. • Understand the concepts of probability and random variables. UNIT I. (10) Introduction Importance of Statistics, Primary and secondary data, data collection methods. Presentation of numerical and categorical data. UNIT II. (12) Concepts of central tendency and dispersion Mean, median, mode and partition values-quartiles for grouped and ungrouped data. Range, quartile deviation, standard deviation and coefficient of variation for grouped data UNIT III. (12) Probability Random Experiment- Sample space and events.Probability.rules.Conditional probability and Bayes theorm. UNIT IV. Random variable Definition, types of random variables, probability functions, expectations and variance.
(06)
UNIT V. (05) Index Number Laspeyres’, Paasches’, Fishers price and quantity index numbers. Time reversal and factor reversal tests. Text Book: [1] Berenson and Levine, Basic Business Statistics, New Jersey, 6th edition, Prentice- Hall India, 1996. Reference Book: [1] D.C. Montogomery and G.C.Runger, Applied Statistics and Probability for engineers, New Jersey,John Wiley and Sons, 3rd edition, 2003.
Christ University, Bangalore, India
11
Syllabus 2013
BCA
BCA134 Digital Computer Fundamentals Total teaching Hours/Semester: 60
No of Lecture Hours/Week: 04
Objective The objective of this subject is to deal with the basic concepts of functioning of a computer. The subject starts with an introduction to number systems and its applications in computers. The subject exposes the students to basic concepts of flip-flops, logic gates and design of different types of flip flops and counters. The discussion about working of devices like encoders and decoders, multiplexers and de multiplexers are dealt. Learning outcome • Ability to use math and Boolean algebra in performing computations in various number systems. • Simplification of Boolean algebraic expressions. • Ability to design efficient combinational and sequential logic circuit implementations from functional description of digital systems. UNIT I. (12) INTRODUCTION TO NUMBER SYSTEM AND CODES Number systems: Decimal numbers , Binary numbers : Counting in binary, The weighted structure of binary numbers, Octal numbers, hexadecimal numbers and their mutual conversions, Binary arithmetic : Addition, subtraction, multiplication and division of binary numbers, 1’s and 2’s complement, signed numbers, arithmetic operations(addition, subtraction) with signed numbers, 9’s and 10’s complement, BCD numbers, BCD addition , BCD subtraction, Gray code: Binary to Gray code conversion, Gray to Binary conversion, Weighted code : 8421 code and Non weighted codes : ASCII and EBCDIC UNIT II. (08) BOOLEAN ALGEBRA Boolean operations and expressions, Laws and rules of boolean algebra, Demorgan’s Theorem, Boolean expressions, Simplification of Boolean expression. UNIT III. (10) LOGIC GATES AND gate, OR gate, NOT gate , NAND gate , NOR gate , X-OR gate , X-NOR gate, The universal property of NAND gate and NOR gate, Realization of basic gates. Boolean expression for logic circuits, Karnaugh map (SOP with examples) UNIT IV. (10) COMBINATIONAL LOGIC Basic Adders : Half adder, Full adder, 4-bit Parallel adders, Subtractor : half subtractor , full subtractor (Implementation using logic gates), Decoders: 4 bit decoder, BCD to decimal decoder, Encoder : Decimal to BCD encoder, Multiplexer – 4 to 1 multiplexer, De-multiplexer : 1 to 4 demultiplexer .
Christ University, Bangalore, India
12
Syllabus 2013
BCA
UNIT V. (10) FLIP-FLOPS Latches : SR latch, Clocked flip-flops :SR flip-flop, D flip-flop, JK flip-flop, Positive edge triggered flip flops, Timing diagrams , Master slave JK flip-flop. UNIT VI. (10) REGISTERS AND COUNTERS Modes of operation of registers (SISO, SIPO, PISO, and PIPO),Asynchronous counters (Four bit ripple counter, Decade counter), Synchronous counter (Four bit synchronous counter, Decade counter). Introduction to RAM (SRAM,DRAM) , ROM,PROM, EPROM, EEPROM Text Book: [1] Floyd, Thomas L: Digital Computer Fundamentals, 10th Edition, Pearson International. 2009. Reference Books: [1] Malvino, Paul Albert , Leach, Donald P,GautamSaha: Digital Principles And Applications, TMH ,7th Edition, 2010. [2] Bartee, Thomas C: Digital Computer Fundamentals, 6th Edition, TMH.2010.
Christ University, Bangalore, India
13
Syllabus 2013
BCA
BCA136 Introduction to Programming Using C Total teaching Hours/Semester: 60
No of Lecture Hours/Week: 04
Objective To study about algorithms, flowcharts and programs. To solve problems through logical thinking. To learn about computer programs using C. Learning outcome • To clearly understand the logic of the problem. • To analyse the given problem and write the algorithm, flowchart. • To write structured C programs, which is the foundation of any programming language.. UNIT I. (08) INTRODUCTION TO COMPUTERS AND PROGRAMMING Evolution of Computers, Generation of Computers, Classification of Computers. Characteristics of Computers. Advantages of Computers. Block Diagram of a Digital Computer. Types of Programming Languages. Structured Programming. Algorithms and Flowcharts with Examples. Programming Logic. UNIT II. (10) INTRODUCTION TO C History of C- Character set - Structure of a C program - constants, variables and keywords. Expressions – Statements – Operators – Arithmetic, Unary, Relational and logical, Assignment, Conditional. Library functions. Data Input and output – Single character input, getchar, getch, getc – Single character output putchar, putc, Formatted I/O (scanf, printf, gets, puts, UNIT III. (11) CONTROL STRUCTURES AND ARRAYS Branching: if, if … else , switch. Looping : while, do…while, for, nested control structures, break, continue statement, goto statement. Arrays: definition, processing, types - One and Two dimensional arrays. String, string operations, arrays of strings. UNIT IV. (11) FUNCTIONS AND POINTERS Functions: Definition, Accessing and prototyping, types of functions, passing arguments to functions, recursion, passing arrays to functions. Pointers: Definition, notation, applications, call by reference. UNIT V. (11) STRUCTURES, UNIONS AND FILES Structures: Definition, Processing , user defined data type (typedef) - Unions – definition, declaration and accessing union elements. Enumerated Data type. Files: File opening in different modes, closing, reading and writing. (fopen, fclose, fprintf, fscanf, getw, putw ) Christ University, Bangalore, India
14
Syllabus 2013
BCA
UNIT VI. (09) LOW LEVEL PROGRAMMING AND C PREPROCESSOR Storage Structures: extern, register, static, auto. Bitwise Operations: AND, OR, exclusive OR, complement, right shift and left shift operators. Preprocessor: Types of C preprocessor directives. Macros- comparison with functions. File Inclusion. Command line Arguments. Text Book: [1] Byron Gottfried, JitenderChhabra ,Programming with C, 3rd Edition. Tata McGraw-Hill, 2010. Reference Books: [1] BalagurusamyE. ,Programming in ANSI C, 4thEdition,Tata McGraw-Hill,2007. [2] Deitel H M and Deitel P J, C - How to Program, 5th Edition,Prentice-Hall,2006. [3] SmarajitGhosh ,All of ‘C’,2nd Edition,2009. [4] M. T. Somashekara, Problem Solving with C, PHI, 2009
Christ University, Bangalore, India
15
Syllabus 2013
BCA
BCA151 C Programming Lab Guidelines: • • • •
Follow Coding standards. The output of the programs should be neatly formatted. The programs should be user friendly and interactive. Use comments wherever necessary.
1. To demonstrate the usage of operators and data types in C a. Write a program to print the size of all the data types with its modifiers supported by C and its range. b. Write a program to convert Fahrenheit to Celsius. 2. To demonstrate the usage of if, if-else a. Write a program to check whether the given number is a Prime number or not. b. Write a program to accept three numbers and find the largest and second largest among them 3. To demonstrate the concept of while, do-while, for loops, break and continue a. 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 given limits. 4. To demonstrate the concept of arrays and strings a. 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 or not. c. Write a program to perform matrix multiplication. 5. To demonstrate the concept of switch-case a. Write a program to count the different vowels in a line of text. b. Write a program to accept two numbers and perform various arithmetic operations (+, -, *, /) based on the symbol entered. 6. To demonstrate the usage of functions and recursion a. Write a program to find the roots of a quadratic equation b. Write a recursive program to find the factorial of a number. 7. To demonstrate the concept of structures and unions a. Create an employee structure and display the same. b. Create a student database storing the roll no, name, class etc. Implement modify and search operations. 8. To demonstrate the concept of a. Write a function to swap two numbers using pointers b. Write a program to access an array of integers using pointers
Christ University, Bangalore, India
16
Syllabus 2013
BCA
9. To demonstrate the concept of File a. Create a file and store some records in it. Display the contents of the same. Implement search, modify, and delete operations. 10. To demonstrate the concept of Bitwise operators and preprocessors a. Perform the different bitwise operations (menu driven program) .The i/p and the o/p should be displayed in Binary form. b. Write a program to include your own header file.
QUESTION PAPER PATTERN Two questions will be selected by the examiners. Students have to write and execute both the programs.
Christ University, Bangalore, India
17
Syllabus 2013
BCA
BCA152 PC Software Lab Algorithm & Flowchart 1. Write an algorithm and draw a flowchart for the following structures. • Sequential structure • Single Selection Structure (if..then..else) • Multiple Selection Structure(nested if..) • Branching Structure(case) •
Looping Structure
• Combination of Structures MS – Word 2. Prepare a News Paper Layout with appropriate pictures and editing features. Use the following Features: • Three Column and Four Column setting • Set One or Two Advertisements • Use Bullets and Numbering. 3. Create a Document consisting of Bio-data. It includes • A table giving your qualification and/or experience of work. Table should be Bordered and Shaded. • A Multilevel list giving your areas of interest and further areas of interest. The sub areas should be numbered as ‘a’, ‘b’, etc while the areas 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 should have page numbers in the format Page 1 of 10. • Assign a password for the document to protect it from unauthorized access 4. Prepare a document which contains template of marks card of students. Assume that there are 10 students. Use mail merge facility to forward the marks cards to the parents. The footer for the document should be ‘Christ University Bangalore – 29”. 5. Prepare a document about any topic in mathematics which uses mathematical symbols. (At least 5 mathematical symbols should be used). Assign a password for the document to protect it from unauthorized access. Demonstrate the use of Hyperlink Option. Write a macro that sets margins to your document, a font of size and double spaced document. 6. Open a new workbook, save it as Aromamora.xls. In sheet1 write following sales data for Aromamora Oil to show their first 6 months sales. • Select cell B4:D4 and change the horizontal alignment to center and text to 90 degree. • 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:G1, merge and center these cells. Apply same format to A2:G2. • Give border, shading and pattern to data in sheet Christ University, Bangalore, India
18
Syllabus 2013
BCA • • •
Apply different font settings for all titles in sheet Apply green color and bold setting to sales above 10000 (use conditional formatting) Rename current worksheet as HalfYearSales
7. Prepare a worksheet to maintain student information. The work sheet should Contain Roll Number, Name and marks in 5 subjects. (Max Marks is 100).Validate the 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 be assigned is ‘D’. For the total marks less than 300 No grade is assigned. A student is eligible to get a grade only when he gets 40 and above in all the subjects. In such cases the grade is “FAIL”. (Assume that there are 10 students). 8. 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 DA is 40% of the basic salary. HRA is Rs. 4500. If Job Id is 2 then DA is 35% of the basic salary. HRA is Rs. 3500. For all the other Job ids DA is 30% of the basic salary and HRA is Rs. 2500. For all the above Job ids PF to be deducted is 4%. For the job ids 1&2 Rs. 100 to be deducted as Professional Tax. • Find the net pay. • Use filter to display the details of employees whose salary is greater than 10,000. • Sort the employees on the basis of their net pay Use advance filter to display the details of employees whose designation is “Programmer” and Net Pay is greater than 20,000 with experience greater than 2 yrs. 9. Create a statement of Telephone Bill Charge for a customer. Telephone Calls Up to 150 calls - free 151 to 500 calls - 0.80 per call 501 to 1000 calls - 1.00 per call 1001 to 2000 - 1.25 per call Above 2000 - 1.40 per call 10. Using Excel project the Product sales for any five products for five years. • Compute the total sales of each product in the five years. Christ University, Bangalore, India
19
Syllabus 2013
BCA
• Compute the total sales of all the products in five year. • Compute the total sales of all products for each year. • Represent annual sale of all the products using Pie-Chart • Represent annual sales of all products using Bar Chart. • Represent sale of a product for five years using Pie-Chart. • Label and format the graphs 11. (a) Using Excel write sales data with columns product, month and sales. Write at least 5 records. Create Pivot Table chart and Report for the data. (b)Create a macro to change the name of worksheet as Macro Example, merge first three columns of first row and write heading as DATA in green color with yellow background (c)Link word document in excel worksheet to show the usage of linking and embedding. MS-POWERPOINT 12. Prepare a presentation about any topic of current relevance in Information Technology. The presentation should have minimum 10 slides. Use proper formatting, diagrams and tables. Show the usage of pen, action buttons, hyperlinks, and animations. MS-ACCESS 13. Create a database of Employees in an organization. Include a table which has the information about the Access to enter and modify the details stored in the employee database. Give the options for View, Add, Delete and Edit. Create a report using Access to display the department-wise listing of employees. Create a pay slip for the employees using the access reports.
QUESTION PAPER PATTERN Two questions will be selected by the examiners. Students have to write and execute both the programs.
Christ University, Bangalore, India
20
Syllabus 2013
BCA
BCA171 Hardware Lab Digital Circuits and Logic design Objective: To understand the working of a computer system, digital circuits and logic design. Outcome: Upon completion of the practical course students will be able to: • Identify the basic components of a PC. • Disassemble and assemble the PC. • Identify the basic components to build the digital circuit. • Construct logic design using the components. Reference: http://deploy.virtual-labs.ac.in/labs/cse15/index.php Reports: Title, Date, Components used, Design procedures, Results and Conclusion of each lab exercise. List of exercise for practice: 1. Experiment with the desktop computers. a. Disassembling the desktop, identification of various components, assembling the system, Installation of Operating system. 2. Experiment with the laptop. a. Identification of various components, Installation of OS, antivirus and other essential software. 3. Verification of the truth tables of AND, OR & NOT gates. 4. Verification of the truth tables of NAND & NOR gates. 5. Verification of the truth table of XOR using NAND gates. 6. Verification of the truth table of half adder circuits using NAND gates. 7. Verification of the truth table of full adder circuits using NAND gates. 8. Verification of the truth table of any one flip flop. 9. Testing the operation of a 3 bit or 4 bit counter.
Christ University, Bangalore, India
21
Syllabus 2013
BCA
BCA231 Communicative English Total teaching Hours/Semester:45
No of Lecture Hours/Week: 03
Objectives • To help the students understand the nuances of communication • To train the young minds to think clearly and communicate effectively • To equip the students with the tools of communication through theoretical concepts along with application based exercises Learning outcome Upon successful completion of the course, the student would be able to communicate in any professional environment. UNIT I.
(7)
What is Communication, The process of Communication, The flow of Communication. UNIT II. The Media – Oral, written The techniques - Verbal, Non verbal The Objectives of communication
(8)
UNIT III. Principles of Communication Barriers to Communication
(7)
UNIT IV. Letter writing, Resume preparation, E-mail composing and Essay writing
(8)
UNIT V. Preparation of Reports and Minutes .
(7)
UNIT VI. Phonetics, presentation skills
(8)
Reference Books: [1] Rajendra Pal & Korla Halli ,Essentials of Business Communication . [2] Dr. Urmila Rai and S M Rai,Business Communication. [3] Kaul, Asha. Business Communication., Prentice-Hall, New Delhi, 2006. [4] Ober, Scot. Contemporary Business Communication, 5th Edition. Biztantra, New Delhi, 2004. [5] Daniel Jones ,Pronouncing Dictionary .
Christ University, Bangalore, India
22
Syllabus 2013
BCA
Question Paper Pattern Mid Semester Exam: 1
Sections
A
B
2
No. of Questions in each Sections No. of Questions to be answered Marks for each question Maximum marks for each Section Total Marks: 50
4
3
5
2
5
15
20
30
3 4 5
End-semester Examination 1
Sections
A
B
C
2
No. of Questions in each Sections No. of Questions to be answered Marks for each question Maximum marks for each Section Total Marks:100
6
3
2
5
3
2
5
15
15
25
45
30
3 4 5
Christ University, Bangalore, India
23
Syllabus 2013
BCA
BCA232 Calculus Total teaching Hours/Semester:45
No of Lecture Hours/Week: 03
Objective This paper aims at enabling the students to know various concepts and principles of differential, integral calculus and differential equations. Learning outcome Upon successful completion of the course, the students will • • •
Evaluate limits using algebraic, analytic techniques. Evaluate derivatives for elementary functions; Evaluate definite and solve first order differential equations.
UNIT I (12) DIFFERENTIAL CALCULUS Introduction, Real valued functions, Limit of a function, Algebra of limits, Continuity of a function, Properties of a continuous functions, Differentiability – Differential coefficients of some elementary functions, Algebra of derivatives, Derivatives of some standard functions. UNIT II (12) DIFFERENTIAL CALCULUS (Cont… ) Mean value theorems – Roll’s theorem, Lagrange’s mean value theorem (with Proofs) Cauchy’s mean value theorem, Maclaurin’s theorem (statements only). Function of two or more variables, Partial Differentiation, Homogenous Functions Euler’s theorem of Homogenous Functions. UNIT III (10) INTEGRAL CALCULUS Definition – Standard results - Methods of integration, Method by substitution – Method by parts. UNIT IV. DIFFERENTIAL EQUATIONS (11) Definition and examples, Order and Degree of differential equations, Solutions of first order first degree differential equations, Variable separable, Equations reducible to variable separable, Linear differential equations, Bernoulli’s Differential equations. Text Books: [1] E Kreyszig, Advanced Engineering Mathematics, 8th Edition New Delhi, India: Wiley India Pvt. Ltd., 2010. [2] S Narayan and P.K.Mittal, Differential Calculus, Reprint. New Delhi: S.Chand & Company Ltd., 2011.
Christ University, Bangalore, India
24
Syllabus 2013
BCA
Reference Books: [1] N. P. Bali, Differential Calculus, New edition. New Delhi, India: Laxmi Publications (P) Ltd ,2011. [2] G K Ranganath, Text book of B.Sc., Mathematics, Revised edition, New Delhi, India: S Chand and Co., 2011. [3] G B Thomas and R L Finney, Calculus and Analytical geometry, 10th ed.: Addison – Wesley, 2000.
Christ University, Bangalore, India
25
Syllabus 2013
BCA
BCA233 Statistics-II for BCA Total teaching Hours/Semester: 45
No of Lecture Hours/Week: 03
Objective To acquaint students with various statistical methods. To cultivate statistical thinking among students. To prepare students for future courses having quantitative components. Learning outcome Upon successful completion of the course one should be able to • Understand and appreciate descriptive statistics. • Understand the concepts of probability and random variables. UNIT I. (10) Correlation and Regression Scatter diagram, Karl Pearson’s and Spearman’s’ correlation coefficient. Regression and properties of regression coefficient UNIT II. (10) Probability distributions Discrete and continuous random variables.Probability mass and density functions.Expectation. Binomial, Poisson and normal distribution UNIT III. (12) Sampling distribution and confidence interval Sampling.distribution and estimation. Parameter and statistic.chisquare t and F distributions( definitions only) Confidence interval Single mean and difference known and unknown variances. Single proportion and difference of proportions. UNIT IV. (13) Testing of Hypothesis Types of hypothesis.Level of significance.Types of errors. Test for single mean and difference of means. Paired t test. Tests for proportions.Chi square test for independence of attributes.
Text Book: [1] Berenson and Levine, Basic Business Statistics, New Jersey, Prentice- Hall India, 6th ed. 1996. Reference Books: [1] C.Montogomery and G.C.Runger, Applied Statistics and Probability for engineers, NewJersey,John Wiley and Sons, 3rd ed. 2003.
Christ University, Bangalore, India
26
Syllabus 2013
BCA
BCA234 Operating Systems Total teaching Hours/Semester: 60
No of Lecture Hours/Week: 04
Objective To acquire the fundamental knowledge of the operating system architecture and components and to know the various operations performed by the operating system. Learning outcome Upon completion of the course students will be able to: • Understand the basic working process of an operating system. • Understand the importance of process and scheduling. • Understand the issues in synchronization and memory management. UNIT I. (10) Introduction and System Structures Operating system definition, computer system organization, architecture, structure and operations, process, memory and storage management. Operating system services, user interface, system calls, system programs, OS design, implementation and structure, system boot. UNIT II. (12) Process Management Process concepts, scheduling, operations on processes, inter process communication, examples of IPC systems. Process Scheduling: Basic concepts, scheduling criteria, scheduling algorithms. UNIT III. (10) Process Synchronization Synchronization: Background, critical section problems, Peterson’s solution, semaphores, classic problems of synchronization, synchronization examples, atomic transaction. UNIT IV. (08) Deadlock Deadlock: System model, deadlock characterization, methods for handling deadlock, deadlock prevention, avoidance and detection, Recovery from deadlock. UNIT V. (08) Memory Management Memory Management Strategies: Background, swapping, Memory allocation, Paging, Structure of the page table, Segmentation. UNIT VI. (12) File and I/O system File system: File system structure, directory structure, allocation methods and free-space management.Overview of mass-storage structure, disk structure, disk scheduling and management.I/O Systems: I/O hardware, Application I/O Interface, Kernel I/O subsystem. Christ University, Bangalore, India
27
Syllabus 2013
BCA
Text Book: [1] A. Silberschatz, P.B. Galvin and G. Gagne, Operating System Concepts.8th Edition, New Delhi : Wiley India, 2011. Reference Books: [1] Stalling William, Operating Systems: Internals and Design Principles. 7th Edition, Prentice Hall, 2011. [2] Dietel et al, Operating System.3rd Edition. Pearson Education, 2004. [3] A.S. Tanenbaum, Modern Operating Systems.3rd Ed, Prentice Hall, 2007.
Christ University, Bangalore, India
28
Syllabus 2013
BCA
BCA235 Data Structures Total teaching Hours/Semester: 60
No of Lecture Hours/Week: 04
Objective Data Structure is considered as one of the fundamental paper towards a more comprehensive understanding of programming and application development. Student is expected to work towards a sound theoretical understanding of Data Structures and also compliment the same with hands on implementing experience. Learning Outcomes • Understand the need for Data Structures when building application. • Appreciate the need for optimized algorithm. • Able to walk through insert and delete for different data structures. • Ability to calculate and measure efficiency of code . • Appreciate some interesting algorithms like Huffman, Quick Sort, and Shortest Path etc. • Able to walkthrough algorithm. • Improve programming skills. UNIT I. (10) Introduction: Overview, Pointers and Dynamic Memory Allocation, Algorithm Specification, Data Abstraction, Performance Analysis, Performance Measurement. Arrays and Structures: Abstract Data Type, Array in C, Dynamically Allocated Arrays, Structures, Unions, Internal Implementation of Structures, Self-Referential Structures, Polynomial Representation, Polynomial Additions. UNIT II. (9) Searching and String: Linear Search, Iterative Binary Search, Recursions, Recursive Binary Search ,String Abstract Data Type, String in C, Pattern Matching . UNIT III. (9) Stacks and Queues : Stack Abstract Data Type, Queue Abstract Data Type, Circular Queue Using Arrays, Mazing Problem, Evaluation of Expressions, Evaluating Postfix Expressions, Infix to Postfix Unit IV. (10) Linked Lists: Pointers, Using Dynamically Allocated Storage, Singly Linked Lists, Dynamically Linked Stacks and Queues, Polynomials, Representing Polynomials as Singly Linked Lists, Adding Polynomials, Erasing Polynomials, Polynomials as Circularly Linked Lists, Doubly Linked Lists UNIT V. (11) Trees :Introduction, Terminology, Representation of Trees, Binary Trees, Abstract Data Type, Properties of Binary Trees, Binary Tree Representations, Binary Tree Traversals Christ University, Bangalore, India
29
Syllabus 2013
BCA
Binary Search Trees: Introduction, Searching a Binary Search Tree, Inserting an Element, Deleting an Element, Height of Binary Search Tree (11) UNIT VI. Sorting :Introduction, Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Performance Analysis, Merge Sort. Text Book: [1] Horowitz Sahni Anderson-Freed, Fundamental of Data Structures in C, Universities Press, Reprint 2009. Reference Books: [1] Yashwant Kanetkar, Data Structures Through C, 9th Edition, BPB Publication 2010. [2] Tremblay J.P and Sorenson P.G: An Introduction to Data Structures with Applications, 2nd Edition, 2002, TMH.
Christ University, Bangalore, India
30
Syllabus 2013
BCA
BCA251 Data Structures Lab 1. Strings a. Write a menu driven program to compare, concatenate, copy strings and find the length of a string. b. Write a menu driven program to find the index of a pattern in a given string and to extract a substring. 2. Two dimensional arrays a. Insertion b. Deletion 3. Searching Techniques a. Write a program to implement Linear Search with sentinels b. Write a program to implement Binary Search 4. Singly linked list insertion and deletion a. Creation of a linked list and insertion. b. Deletion from a linked list. 5. Recursion a. Fibonacci series using recursion. b. Towers of Hanoi with 3 pegs and n disks. 6. Stack a. Write a program to implement different operations on a stack using linked list. 7. Queue a. Write a program to implement different operations on a queue using an array.
8. Binary search trees a. Write a program to create a binary search tree and to perform Insertion and different types of traversal 9. Sorting techniques a. Write a program to implement insertion sort b. Write a program to implement selection sort. c. Write a program to implement quick sort. QUESTION PAPER PATTERN Two questions will be selected by the examiners. Students have to write and execute both the programs.
Christ University, Bangalore, India
31
Syllabus 2013
BCA
BCA252 Visual Programming Lab 1.
2.
3.
4.
5.
6.
7.
8.
Introduction a. Windows Concepts b. Objects and events c. Define design and development process d. Identify elements of IDE e. Write, run, save, and print a project f. Use online Help Introduce controls and their properties a. Text boxes, group boxes, check boxes, radio buttons, picture boxes and naming conventions b. User friendly features: access keys, default and cancel buttons, tab sequence, Tool Tips, resetting focus c. Changing properties at run-time d. Concatenate strings Variables, constants and calculations a. Declaration of variables and constants considering data types and scope b. Explicit data type conversions c. Perform calculations using arithmetic operators and order of operations d. Use of accumulators and counters e. Use formatting functions to format output Decisions and conditions a. Use If statements to control the flow of logic b. Use And and/or operators c. Call event procedures d. Input validation e. Debug tools - set break points, stepping and observation of intermediate results Arrays a. Declare arrays and refer to elements using subscripts b. Use For Each/Next statements c. Structure Variables d. Store data in multidimensional array Lists, Loops, and Printing a. Create and use list boxes and combo boxes b. Use Do/Loops and For/Next statements c. Send information to the printer Menus, procedures and functions a. Create menus and submenus for program control b. Write reusable code in sub procedures and sub functions Toolbars and Status bar a. Creating toolbars b. Adding images to toolbars c. Writing code to work with toolbars d. Creating and using a status bar
Christ University, Bangalore, India
32
Syllabus 2013
9.
10.
11.
12.
13.
14.
BCA
e. Adding panels to the status bar Other controls a. TabControl b. MonthCalendar and Date/TimePicker c. Common Dialog (Open/SaveFile) d. ProgressBar File handling and file controls in VB a. Database Connectivity b. Data base basics & database engine c. Create a database in Access Through VB d. The nature of a relational databases e. The data controls (DAO and ADO) f. Data Bound controls g. Working with database objects in code h. Data Manipulation through VB – Forms i. Develop a database application Multiple Document Interface (MDI) a. Overview of MDI b. Creating parent and child forms c. Writing code for parent and child forms d. Child window management e. Creating applications Creating and using reports a. Printing with windows forms b. Data reports c. Using Crystal Reports Create Object-Oriented programs a. OO terminology b. Multi-tier applications c. Classes d. Constructors and Destructors e. Inheritance Deploying the project a. Creating setup program b. Help file c. Online registration
QUESTION PAPER PATTERN Two questions will be selected by the examiners. Students have to write and execute both the programs.
Christ University, Bangalore, India
33
Syllabus 2013
BCA
BCA271 Case Tools Lab (Technical Concepts and Applications) Objective: To acquire knowledge on the latest trend in the software development field. To nurture the soft skills through knowledge acquisition, technical presentation and demonstration. Outcome: Upon completion of the practical course students will be able to: • Learn to use basic tools and techniques that are essential for their study • Deliver a technical talk Reports: Documentation of evolution of the chosen topic, its current trend, demo tools manual if available, presentation slides, references. List of exercise for practice: 1. 2. 3. 4. 5. 6.
Choose any technical topic for study. Gather information on its evolution and current trend. Develop a report on the same. Installation of any demo tools relevant to the topic chosen. Preparation of PPT. Presentation with demonstration of any technical tools relevant to the topic.
Christ University, Bangalore, India
34
Syllabus 2013
BCA
BCA331 Interpersonal communication Total teaching Hours/Semester:45
No of Lecture Hours/Week: 03
Introduction: The professional course, BCA, aims at refining and reinforcing the skills of students to help them become trained professionals. The changing demands of the globalized work environment demands something more than the ability to communicate well. A true professional of modern times should be people-smart, should be aware of the intricacies of interpersonal communication. This syllabus aims at enlightening the student in mastering the art of interpersonal communication. The Course Structure of this paper has been devised to lay equal stress on the theoretical, functional and professional aspects. Objectives • Honing the interpersonal skills of the student to meet the changing and challenging demands of modern professional environment • Reinforcing the need for developing intrapersonal and interpersonal intelligence • Building a strong base for good interpersonal relationship and communication skills • Training the student to choose relevant communication patterns and programmes of action that is appropriate to everyday interpersonal experiences • Creating awareness about all areas of multiple intelligences Learning outcome The student is trained thoroughly in interpersonal skills through the right approach to interpersonal communication UNIT I. Foundations, The Interpersonal communication process UNIT II. Communication competence , communication and identity
(6)
(6)
UNIT III. Perception, Empathy, Emotional Intelligence
(8)
UNIT IV. Language : Barrier and bridge, Non-verbal Communication
(10)
UNIT V. Listening Skills
(5)
UNIT VI. (10) Communication and Relational Dynamics, Improving communication climates, Conflict management Reference Books: [1] Goleman, Daniel. Emotional Intelligence New York: Bantam Books, 1995. Christ University, Bangalore, India
35
Syllabus 2013
BCA
[2] Singh, Dalip. Emotional Intelligence at Work New Delhi: Response Books, A Division of Sage Publications, 2001. [3] Adler, Ronald, Proctor, Russell. Communication Goals and Approaches, Wadsworth, New Delhi 2007. [4] Devito, Joseph A. The Interpersonal Communication Book, Pearson Education, Boston 2004
Question Paper Pattern Mid Semester Exam: 5
3
4
2
5
15
20
30
End-semester Examination 1 Sections
A
B
C
2
No. of Questions in each Sections
7
5
2
3
No. of Questions to be answered
5
3
2
4
Marks for each question
5
15
15
5
Maximum marks for each Section
25
45
30
No. of Questions in each Sections No. of Questions to be answered Marks for each question Maximum marks for each Section Total Marks:50
Total Marks:100
Christ University, Bangalore, India
36
Syllabus 2013
BCA
BCA332 Introductory Graph Theory and Linear programming Total teaching Hours/Semester: 45
No of Lecture Hours/Week: 03
Objective The aim of this course is to introduce the students to the various basic terminologies in Graph Theory, formulation of Linear Programming Problems (LPP) and solving LPP using graphical method, simplex method. Learning outcome Upon successful completion of the course students understand the • basic numerical terminologies in graph theory. • use of matrices in representing and manipulating the graphs. • aspect of colouring in the graphs. • formulation of linear programming problems and solving them by graphical method, simplex method. UNIT I.
(10)
INTRODUCTION AND BASIC TERMINOLOGY Definition of a graph-finite and infinite graphs - incidence and degree - sum of degrees equals twice the no. of edges (Proof included) - Degree sequence - isolated vertex - pendant vertex – null graph - regular graph-isomorphic graph – sub graphs –walks – paths – circuits - connected graphs - disconnected graphs - components of a graph - operations on graphs – Euler path & Euler graphs – Hamiltonian Paths & Graphs – Weighted graphs (No Theorems). UNIT II.
.
(12)
TREES, CONNECTIVITY AND PLANARITY Definition of Trees – Properties of Trees - Pendant Vertices in a Tree - Distance and centers in a Tree - Rooted and Binary Trees - Spanning Trees. (No theorems). Cut sets and Cut vertices – Fundamental circuits and cut sets – Edge Connectivity - Vertex connectivity – Separable Graphs – Planar Graphs - Kuratowski’s graphs. UNIT III.
(10 )
MATRIX REPRESENTATION AND COLOURING Matrix Representations of Graph: Incidence Matrix A– Circuit MatrixB– Fundamental Circuit Matrix B f – Cut Set Matrix C - Relationship between A,B and C - Adjacency Matrix.Coloring of a Graph,Chromatic number - Chromatic Partitioning – Chromatic Polynomial- Four Color Problem.
Christ University, Bangalore, India
37
Syllabus 2013
BCA
UNIT IV.
(13)
LINEAR PROGRAMMING Definitions of O.R.- Definition of Linear Programming Problem (L.P.P) - Formulation of L.P.P. – Linear Programming in Matrix Notation – Graphical Solution of L.P.P – Simplex Method – Big M Technique. Text Books: 1. N. Deo, Graph Theory with Applications to Engineering and Computer Science, Reprint, India: PHI Learning, 2009. 2. K.Swarup, P. K. Gupta, M. Mohan, Operations Research, Reprint, Sultan Chand & Sons, 2010. Reference Books: 1. J. Clark, D. A. Holton, A first look at Graph Theory, Reprint, World Scientific Publishing Co. Pvt Ltd., 1991. 2. F Harary, Graph Theory ,Reprint, Narosa Publishing House, 2001. 3. Chartrand, Introduction to Graph Theory, Reprint, Tata Mc.Graw Hill. 2007. 4. G.B.DantizigandM.N.Thapa, Linear Programming 1- Introduction, 1st Edition., New Age International, 2010. 5. G.B.Dantizig and M.N.Thapa, Linear Programming 2 – Theory and Extensions, 1st Edition, New Age International, 2010.
Unit and No. of subdivisions Part to be set in the Unit
A
B
C
Unit I
2
Unit II
3
Unit III
4
Unit IV
3
Unit I
2
Unit II
3
Unit III
3
Unit IV
3
Units I
1
Unit II
1
Unit IV
1
Christ University, Bangalore, India
No. of Marks for subdivisions to each be answered subdivision
Maximum Marks for the Part
10
3
30
9
6
54
2
8
16
38
Syllabus 2013
BCA
BCA333 Financial Accounting Total teaching Hours/Semester:45
No of Lecture Hours/Week: 03
Objective To make the learner familiar about the concept of accounting. To impart knowledge about how a business transaction get transformed from the initial entry leading to the preparation of the Final accounts in a business enterprise. Learning outcome Upon successful completion of the course student will be familiarized with the concept of accounting. Student will get an idea about how the final accounts helps to analyze about a company’s financial strength and viability. UNIT I. (12) Introduction Accounting Meaning, Need for accounting, Users of Accounting Information, Meaning of Bookkeeping, Accounting principles, Accounting cycle, Phases of Accounting, Accounting Equation. Double Entry Meaning, Nature and Principles of Double Entry. Journal Meaning and Need, Steps in Journalizing, Exercises of Journal Entry. Subsidiary Books Meaning, Classification and Advantages. UNIT II. (6) Ledger Meaning, Difference between Journal and Ledger, Steps in posting. Problems on Ledger Trial Balance Meaning and Objective of preparing Trial Balance. Comprehensive problems on Journal, Ledger and Trial Balance. UNIT III. (8) Cash Book Meaning, objectives and classifications. Difference between cash and trade discount. Problems on triple column cash book. Bank Reconciliation Statement Meaning, causes for difference between cash and pass book. Problems UNIT IV. Final Accounts (14) Meaning, Need for preparation, Components of Final accounts. Problems with adjustments UNIT V. Depreciation (5 ) Meaning, Need for providing Depreciation. Problems on different methods of Depreciation Christ University, Bangalore, India
39
Syllabus 2013
BCA
Text Book: [1] B.S. Raman: Fundamentals of Accounting- Volume (I and II),4th Edition,2010. Reference Books: [1] S.N. Maheswary & S.K. Gupta Introduction to Accounting,4th Edition,2010. [2] Jain & Narang, Fundamentals of Accounting,4th Edition,2010.
Christ University, Bangalore, India
40
Syllabus 2013
BCA
BCA334 Software Engineering Total teaching Hours/Semester:60
No of Lecture Hours/Week: 04
Objective To provide students an in depth understanding of software engineering principles. To prepare the students to develop the skills necessary to handle software projects. To make the students aware of the importance of software engineering principles in designing software projects. Learning Outcome On completion of the course the student will: • • • •
Understand the importance of the stages in the software life cycle. Understand the various process models. Understand the UML notation. Be able to design software by applying the software engineering principles.
UNIT I. (10) Software and Software Engineering Nature of software- Defining software, Software Application Domains, Legacy Software-, Software Engineering, The software process, Software Engineering practice – The essence of Practice, General Principles -, Software Myths. Process models A generic process model – Defining a framework activity, identifying a Task Set, Process Patterns -, Process Assessment and improvement, Prescriptive Process Models – The waterfall Model, Incremental Model, Evolutionary Process Model, Concurrent Models-, A Final Word on Evolutionary Processes. UNIT II. (10) Understanding Requirements Requirements Engineering, Establishing the groundwork – Identifying Stakeholders, Recognizing multiple viewpoints, Working toward Collaboration, Asking the first questions-, Eliciting requirements – Collaborative requirement gathering, Quality function Deployment, Usage Scenario Elicitation Work Products - , Developing use cases, building the requirements model – Elements of the requirements Model, Analysis pattern -, Negotiating requirements, validating requirements. Requirement Modelling Requirement Analysis, Data modelling concepts, Class-based modelling, Requirement modelling strategies, Flow oriented modeling. UNIT III. (10) Design Concepts The design within the context of Software Engineering, The design process – Software quality guidelines and attributes, The evolution of software design -, Design concepts – Abstraction, Architecture, Patterns, Separation of concerns, Modularity, information hiding, Functional Christ University, Bangalore, India
41
Syllabus 2013
BCA
Independence, refinement, Aspects, Refactoring, Object Oriented design concepts Design classes -, The design Model – Data Design elements, Architectural Design elements, Interface Design Elements, Component-Level Design elements, Deployment level Design elements. User Interface Design The golden rules- Place the User in Control, Reduce the User's Memory load, Make the interface Consistent-, Interface Analysis and Design models, The Process, Interface Analysis User Analysis, Task Analysis, Analysis of Display Content, Analysis of the Work Environment-, Interface design steps – Applying Interface Design steps, User Interface design patterns , Design Issues. UNIT IV. (10) Quality Management Introduction, Software quality, Achieving software quality, Review metrics and their use, Informal reviews, Formal technical reviews, SQA tasks, Goals and metrics, Formal approaches to SQA, Statistical Software quality assurance, Software Reliability, SQA plan. UNIT V. (10) Software Testing A Strategic approach to testing, Test strategies for conventional software, Test strategies for Object Oriented software, Validation testing, White-box testing, Basic path testing, control structure testing, Black-box testing, Object oriented testing methods. UNIT VI. (10) Project Management concepts The management spectrum, Metrics in the process and project domains, software measurement, metrics for software quality, The project planning process, software project estimation, Decomposition techniques, Empirical estimation models, Project scheduling, Risk identification, Risk projection, The RMMM plan. Text Book: [1] Pressman S Roger, Software Engineering A Practitioner’s Approach, McGraw Hill, International Editions, 7th edition, 2010. Reference Books: [1] Sommerville, Ian, Software Engineering, Addison Wesley, 9th Edition, 2010. [2] Rumbaugh, James, Object Oriented Modeling and design, Pearson Education, New Delhi, 2005.
Christ University, Bangalore, India
42
Syllabus 2013
BCA
BCA335 Database Management Systems Total teaching Hours/Semester: 60
No of Lecture Hours/Week: 04
Objective To provide strong foundation of database concepts and develop skills for the design and implementation of a database application with a brief exposure to advanced database concepts. Learning outcome • Understanding the core terms, concepts, and tools of relational database management systems. • Understanding database design and logic development for database programming. UNIT I. (10) Introduction Data, Database, Database management system, Characteristics of the database approach, Role of Database administrators, Role of Database Designers, End Users, Advantages of Using a DBMS and When not to use a DBMS. DBMS Architecture: Data Models – Categories of data models, Schemas, Instances, and Database states. DBMS Architecture and Data Independence – The Three schema architecture, Data independence.DBMS Languages and Interfaces.Classifications of Database Management Systems.
UNIT II. (10) Data Modeling Using Entity-Relationship Model: Using High Level Conceptual Data Models for Database Design, Example Database applications. Entity types, Entity Sets, Attributes and Keys. Relationships, Relationship types, Roles and Structural constraints.Weak Entity Types and Drawing E- R Diagrams. Index Structures for Files: Single Level Ordered Indexes – Primary indexes, Clustering indexes and Secondary indexes. Multi-level indexes, Hashing concepts. UNIT III. (10) Relational Data Model: Relation, Integrity constraints - domain, entity and Referential integrity constraints, Basic Relational Algebra operations, select, project and join operations. Database Design Functional dependencies and Normalization for Relational Databases - Normalization concepts, first,second, third normal forms, Boyce-Codd normal form. UNIT IV. (10) SQL – SQL data definition and data types, specifying constraints in SQL, schema change statements, Basic queries, More Complex SQL queries, INSERT, DELETE and UPDATE statements in SQL, Views – Concept of a view in SQL. Transaction Processing Concepts and Concurrency Control Techniques: Transaction and System concepts – Desirable properties of Transactions – Schedules and Recoverability. LockChrist University, Bangalore, India
43
Syllabus 2013
BCA
Based Protocols – Locks, Granting of Locks, and Two phase locking protocol and implementation of locking UNIT V. (10) Data Base Administration: Introduction to Database security issues, Discretionary Access Control Based on Granting/Revoking of Privileges and Multi-level security Database Recovery : Recovery Concepts: Recovery Outline and Categorization of Recovery Algorithms, Caching (Buffering) of Disk Blocks, Write-Ahead Logging, Steal/No-Steal, and Force/No-Force, Checkpoints in the System log and Fuzzy Check pointing, Transaction Rollback. UNIT VI. (10) Distributed Databases: Distributed database concepts, Data fragmentation, Replication, and Allocation Techniques for Distributed database design, Types of Distributed database systems. Introduction to Advanced Database concepts – Brief introduction to Data warehousing and Data mining.
Text Book: [1] ElmasriRamez and NavatheShamkant B, Fundamentals of Database Systems, AddisonWesley, 6th Edition, 2010. Reference Books: [1] Silberschatz, Korth, Sudarshan, Database System Concepts, 5th Edition, McGraw Hill, 2006. [2] O`neilPatricand O`neil Elizabeth, Database Principles, Programming and Performance, 2nd Edition, Margon Kaufmann Publishers Inc.2008.
Christ University, Bangalore, India
44
Syllabus 2013
BCA
BCA336 Object Oriented Programming Using C++ Total teaching Hours/Semester: 60
No of Lecture Hours/Week: 04
Objectives The concept of classes and objects make it easy to represent real world entities. The subject starts with the comparison between procedural languages and object languages. The concepts of operator overloading and function overloading, files, exceptions are discussed to expose the students to the advantages of object oriented programming. Learning Outcomes • An understanding of the principles behind the object oriented development process. • Competence in the use of object oriented programming language in the development of small to medium sized application programs UNIT I. (10) INTRODUCTION TO OBJECT ORIENTED PROGRAMMING. Origins of C++- Basic Concepts of Object Oriented Programming-Benefits of OOP-Applications of OOP. INTRODUCTION TO C++ Structure of a Simple C++ program-Output operator-Input operator-Cascading of I/O operators. Tokens- keyword, identifiers, constants, strings and operators. Basic data types-User defined data types-Dynamic initialization of variables-Reference variables-Operators in C++-Scope resolution operator-applications-Member dereferencing operators-Memory Management operators-new and delete. Control Structures-simple if, if else, nested if, switch, while do, break and continue statements. Introduction to Functions-Function Prototyping-Call by reference-Return by reference-Inline functions-Default arguments-Const arguments. UNIT II. (11) CLASSES AND OBJECTS Introduction - Defining a class-Class Vs structures-Creating objects-Accessing class membersDefining member functions-Outside the class definition-Inside the class definition-Outside functions as inline-Nesting of member functions-Private member functions-Memory allocation for objects-Array-Declaring an array-accessing elements of an array-Array of objects. Friendly functions. CONSTRUCTORS AND DESTRUCTORS Basic Concepts of constructors-Default constructor-Parameterized constructor-Multiple constructors in a class-Constructor with default arguments-Dynamic initialization of objectsCopy constructor-Dynamic constructors-Destructors. UNIT III. (11) FUNCTION AND OPERATOR OVERLOADING Overloading Concepts Function Overloading: Functions with different sets of parameters, default and constant parameters. Rules for overloading operators-Defining operator overloadingChrist University, Bangalore, India
45
Syllabus 2013
BCA
Overloading Unary operators-Prefix and Postfix operators overloading-Overloading Binary operators-Overloading relational operators-Overloading using friend functions-Overloading subscript operator. Pitfalls of operator overloading, Type conversion-Basic to Class-Class to Basic
UNIT IV. (11) INHERITANCE Introduction-Defining derived classes-Types of 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 of classes. VIRTUAL FUNCTIONS AND RUN TIME POLYMORPHISM-Introduction-Compile time and Runtime polymorphism-Pointers to objects-this pointer-Pointer to derived classes-Virtual functions-Rules for virtual functions-Pure virtual functions. UNIT V. (8) STREAMS C++ stream classes-put() and get() functions-getline() and write() functions-Overloading > operators-Formatted Console I/O operations-ios class functionswidth(),precision(),fill(),setf() and unsetf()-Formatting flags-Manipulators-User defined manipulators. UNIT VI. (9) FILES Introduction-Stream classes for files-Opening files using constructor-Opening files using open()File modes-Detecting end of file-eof()-Sequential input and output-put() and get()-Reading and writing objects-read() and write()-Random Access files-Manipulating file. Text Book: [1] Schildt Herbert, The Complete Reference C++, Tata McGraw Hill, 4th Edition, 2003. Reference Books: [1] Deitel & Deitel, C++ How to program, Pearson Education Asia, 6th Edition, 2008. [2] Bjarne Stroustrup, The C++ Programming Language, Special Edition, Pearson Education, 2004. [3] M. T. Somashekara, D. S. Guru, Object-Oriented Programming with C++, 2nd Edition, PHI, 2012.
Christ University, Bangalore, India
46
Syllabus 2013
BCA
BCA351 C++ LAB Guidelines: • The output of 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 of the program. • Use meaningful variable names. 1. Implementation of function overloading. 2. Implementation of default arguments. 3. Implementation of pass by value, pass by reference and return by reference. 4. Implementation of classes and objects. 5. Implementation of default constructors. 6. Implementation of constructor overloading. 7. Implementation of copy constructor. 8. Implementation of static functions. 9. Implementation of friend functions. 10. Implementation of Unary operator overloading. 11. Implementation of Binary operator overloading. 12. Implementation of subscript operator overloading. 13. Implementation of dynamic memory allocation and de-allocation(new and delete) using constructors and destructors. 14. Implementation of simple and multi level inheritance. 15. Implementation of multiple inheritance and hybrid inheritance. 16. Implementation of virtual functions. 17. To demonstrate conversion from basic to class and class to basic. 18. Implementation of I/O Streams and database file creation and display.
QUESTION PAPER PATTERN Two questions will be selected by the examiners. Students have to write and execute both the programs.
Christ University, Bangalore, India
47
Syllabus 2013
BCA
BCA352 Oracle Lab 1. SQL*Plus and SQL a. b. c. d. e. f. g. h. i.
Introduction Logging on to SQL*Plus and Leaving SQL*Plus Choosing and Describing Tables Elements of the SQL Query Editing SQL Statements The System Dummy Table Selecting Columns Duplicate Information (DISTINCT) Sorting Information
2. SQL Functions a. b. c. d. e. f. g. h.
(04)
The Concatenation Operator Elements of the SQL Query: Arithmetic Column Aliases String Functions Arithmetic Functions Date Functions Mixed Functions Operator precedence
3. Advanced SQL Functions a. b. c. d. e.
(04)
(04)
Nesting Different Functions Decode Crosstab Decode with ">", "
