BANGALORE UNIVERSITY
REGULATIONS, SCHEME AND SYLLABUS
For the course
I to VI Semesters
BACHELOR OF COMPUTER APPLICATIONS
(BCA)
(Choice Based Credit System (Semester Scheme) –Y2K14 Scheme)
Revised w.e.f.
Academic Year 2014-2015 and onwards
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
BCA Curriculum Overview, Summaries of Computer Vision
A comprehensive overview of the bachelor of computer applications (bca) curriculum, including course details, credit hours, and assessment methods. It covers the six semesters of the bca program, outlining the various subjects, their respective codes, titles, hours per week, marks distribution, and credits. The document delves into the syllabus and learning objectives for key courses such as problem solving techniques using c, digital electronics, discrete mathematics, data structures, database management systems, object-oriented programming using c++, operating systems, visual programming, operations research, data communications and networks, software engineering, computer architecture, java programming, and microprocessor and assembly language. This detailed curriculum information can be valuable for bca students, faculty, and administrators in understanding the program's structure, content, and assessment methods.
Typology: Summaries
2021/2022
1 / 38
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download BCA Curriculum Overview and more Summaries Computer Vision in PDF only on Docsity!
BANGALORE UNIVERSITY
REGULATIONS, SCHEME AND SYLLABUS
For the course
I to VI Semesters
BACHELOR OF COMPUTER APPLICATIONS
(BCA )
(Choice Based Credit System (Semester Scheme) – Y2K14 Scheme)
Revised w.e.f.
Academic Year 2014-2015 and onwards
b) A candidate who has passed JODC / Three years Diploma in Engineering of Government of Karnataka or any other examination considered as equivalent thereto shall be eligible for admission. a) Any student who has passed PUC – II Science, Arts or Commerce securing a minimum of 35% OF MARKS OR b) Any student who has passed JODC or Diploma in Engg. (of three year duration of Govt. of Karnataka) with minimum of 35% of marks in aggregate in all the semester /years.
R. 7. Admission Procedure:
a) Through Counseling in respective colleges b) 50% weight age for entrance test in respective colleges c) 50% weight age for performance at qualifying examination. d) Merit list shall be prepared based on item No, 7(b) and 7(c) e) Reservation: As per the notification /Govt. orders form the University /Govt. from time to time. f) Tuition and other fees: As fixed by the University from time to time
R8. The total number of students to be admitted to the course shall be decided by the
University.
R9. Results: Results of candidate shall be declared and the classes awarded as per the
procedure followed by the University for B.Sc. Courses.
R10. POWER TO REMOVE DIFFICULTIES
- If may difficulty arises in giving effect to the provisions of these regulations, the Vice-
Chancellor may be order make such provisions not inconsistent with the Act, Statutes,
Ordinances or other Regulations, as appears to be necessary to expedient to remove the
difficulty.
- Every order made under this shall be subject to rectification by the appropriate
University Authorities.
Title of Papers and Scheme of Study & Examination for BCA (Bachelor of Computer Applications) Under Choice Based Credit System - Semester System (Revised w.e.f. 2014-2015)
Semester Part Paper Code Title of the paper Hours / Week
Marks Credits IA Exam Total Subject Semester
I
Part - 1 BCA101T Indian Language 4 20 80 100 2
BCA102T English 4 20 80 100 2
Part – 2
BCA103T Problem Solving Techniques using C
BCA104T Digital Electronics 4 30 70 100 2 BCA105T Discrete Mathematics 5 50 100 150 3 BCA103P C Programming Lab 3 15 35 50 1 BCA104P Digital Electronics Lab 3 15 35 50 1 Part – 3
- Foundation Course 3 30 70 100 2
- CC & EC 50 50 1
II
Part – 1 BCA201T Indian Language 4 20 80 100 2
BCA202T English 4 20 80 100 2
Part - 2
BCA203T Data structures 4 30 70 100 2 BCA204T Database Management System
BCA205T
Numerical and Statistical Methods
BCA203P Data Structures Lab 3 15 35 50 1 BCA204T DBMS Lab 3 15 35 50 1 Part - 3
- Foundation Course 3 30 70 100 2
- CC & EC - 50 - 50 1
III
Part - 1 BCA301T Indian Language 4 20 80 100 2
BCA302T English 4 20 80 100 2
Part - 2
BCA303T
Object Oriented Programming using C++
BCA304T
Financial Accounting and Management
BCA305T Operating System 5 50 100 150 3 BCA303P C++ Lab 3 15 35 50 1 BCA304T Accounting Package Lab 3 15 35 50 1
Part - 3
- Foundation Course 3 30 70 100 2
- CC & EC - 50 - 50 1
IV
Part - 1 BCA401T Indian Language 4 20 80 100 2
BCA402T English 4 20 80 100 2
Part - 2
BCA403T Visual Programing 4 30 70 100 2 BCA404T Unix Shell programming 4 30 70 100 2 BCA405T Operation Research 5 50 100 150 3 BCA403P Visual Programming Lab 3 15 35 50 1 BCA404T UNIX Lab 3 15 35 50 1
Part - 3
Skill Development Course
CC & EC - 50 - 50 1
FIRST SEMESTER BCA
BCA101T : INDIAN LANGUAGE
Syllabus as per the one prescribed for science courses of Bangalore University.
BCA102T : ENGLISH Syllabus as per the one prescribed for science courses of Bangalore University.
BCA103T : PROBLEM SOLVING TECHNIQUES USING C Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I Introduction to Programming Concepts: Software, Classification of Software, Modular Programming, Structured Programming, Algorithms and Flowcharts with examples. Overview of C Language: History of C, Character set, C tokens, Identifiers, Keywords, Data types, Variables, Constants, Symbolic Constants , Operators in C, Hierarchy of Operators, Expressions, Type Conversions and Library Functions. [12 Hours ] Unit - II Managing Input and Output Operation: Formatted and Unformatted I/O Functions, Decision making, branching and looping: Decision Making Statements - if Statement, if– else statement, nesting of if-else statements, else–if ladder, switch statement,?: operator, Looping - while, do-while, for loop, Nested loop, break, continue, and goto statements. Functions: Function Definition, prototyping, types of functions, passing arguments to functions, Nested Functions, Recursive functions. [12 Hours ] Unit - III Arrays: Declaring and Initializing, One Dimensional Arrays, Two Dimensional Arrays, Multi Dimensional Arrays - Passing arrays to functions. Strings: Declaring and Initializing strings, Operations on strings, Arrays of strings, passing strings to functions. Storage Classes - Automatic, External, Static and Register Variables. [12 Hours ] Unit-IV Structures-Declaring and Initializing, Nested structure, Array of Structure, Passing Structures to functions, Unions, typedef, enum, Bit fields. Pointers – Declarations, Pointer arithmetic, Pointers and functions, Call by value, Call by reference, Pointers and Arrays, Arrays of Pointers, Pointers and Structures. Meaning of static and dynamic memory allocation, Memory allocation functions. [ 12 Hours ] Unit-V Files - File modes, File functions, and File operations, Text and Binary files, Command Line arguments. C Preprocessor directives, Macros – Definition, types of Macros, Creating and implementing user defined header files. [ 12 Hours ] TEXT BOOKS
1. E. Balaguruswamy, “Programming In ANSI C”, 4th edition, TMH Publications, 2007 2. Ashok N. Kamthane, “Programming with ANSI and Turbo C”, Pearson Education, 2006 REFERENCES BOOKS
- Ashok N. Kamthane et. al., “Computer Programming and IT”, Pearson Education, 2011
- Mahapatra, “ Thinking In C ”, PHI Publications, 1998.
- Yashwant Kanetkar, “Let Us C”, 13th^ Edition, PHP, 2013.
BCA104T: DIGITAL ELECTRONICS Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I Introduction to network theorems and AC fundamentals: Ohm’s law: Statement, explanation. Kirchhoff’s law: Statement & explanation of KCL and KVL. Mesh/loop analysis (up to 2 loops) and node voltage method, Numerical problems. Delta/star and star/Delta transformation: No derivation for Interco version equations, introduction of network, port of network (one port network, two port network), unilateral network, bilateral network, linear network. Need for application of network theorems. (DC Circuits only). Superposition theorem: statement, (only with TWO voltage sources) steps to apply the theorem explanation by considering a simple resistive network and problems. Thevenin’s theorem: Statement, (Only with ONE voltage source) Steps to apply the theorem, explanation by considering a simple resistive networking and problems. Norton’s theorem: Statement, (Only with ONE voltage source) steps to apply the theorem, explanation by considering a simple resistive network and problems. Maximum power transfer theorem: Statement, explanation of theorem by considering a simple resisting network, expression for maximum power deliver (P L (max) =Vth2/4Rth) (no derivation), graph of Vs Pl, numerical problems and applications. Reciprocity theorem, Statement, explanation using resistive network with dc source and numerical problems. AC Fundamentals: Representation of ac sine wave, instantaneous value, peak value, peak to peak value, average value, r.m.s value cycle, time period, frequency. (No derivations, only mention the expressions) Representation of non sinusoidal waves. [ 12 Hours ] Unit - II Semiconductor Devices: Introduction, atomic structure, energy level, energy band diagram in solids, classification of conductors, insulators and semiconductors. Semiconductor, properties, crystal structure of semiconductor, types – intrinsic and extrinsic semiconductor. Intrinsic semiconductor: Crystal structure (Ge& Si), thermal generated charges (electron and holes) carriers the effect temp on their motion. Extrinsic semiconductor: Doping, donor acceptor impurities, c-type, p-type semiconductor, majority and minority carriers, their currents, concept of immobile ions. Semiconductor devices : PN junction diode, formation of pn junction layer, potential barrier, energy level diagram of pn junction, Biasing of pn junction, behaviour of pn junction under forward and reverse biasing, break down in pn junction, avalanche and zener break down. Diode characteristics; V-I characteristic, forward and reverse bias, diode parameters, bulk resistance, knee voltage, static and dynamic resistance, PIV. Application of diode; As a rectifier, as logic gate, as a switch, etc. Rectifier, types, Half wave Full wave. Half wave rectifier: Circuit, working, wave forms and expression for ripple factor and efficiency (no derivation), advantages & disadvantages. Bridge wave rectifier: Circuit, working, wave forms and expressions for ripple factor and efficiently (no derivation), advantages & disadvantages. Logic families: Scale of integration, Digital IC’s, classifications, DTL, TTL, ECL, MOS, CMOS, Mention of features: speed of operation, power dissipation, propagation delay, fan-in, fan-out. [ 12 Hours ]
Text Books:
- Thomas L.Floyd ,’’Digital Fundamentals”, Peason Education Inc, New Delhi, 2003 Reference Books:
- Morris Mano, “Digital Design”, 5 Th^ Edition, Prentice Hall, 2013
- R.P.Jain, “Modern Digital Electronics”, 3rd^ Edition, Tata Mc Graw Hill, 2003.
- Bignell and Donovan, “Digital Electronics”, 5th^ Edition, Thomson Publication,
BCA105T: DISCRETE MATHEMATICS Total Teaching Hours: 65 No of Hours / Week: 05 Unit – I Sets, Relations and Functions: Sets, Subsets, Equal Sets, Universal Sets, Finite and Infinite Sets, Operation on Sets, Union, Intersection and Complements of Sets, Cartesian Product, Cardinality of Set, De-mogan’s law, Simple Applications. Relations, Properties of Relations, Equivalence Relation, Function: Domain and Range, Onto, Into, One to One, one to many Functions, Composite and Inverse Functions. Mathematical Logic: Proposition and truth values, Logical Connectives and their truth tables, Converse, Inverse and Contrapositive, Tautology and Contradiction, Logical Equivalence – Standard Theorems, Switching Circuits. [ 13 Hours ] Unit - II Matrices: Review of fundamentals: Definition of matrix, order, Types of matrices: zero, row, column, square, diagonal, scalar, unit, symmetric, skew-symmetric. Determinant: Value of determinant of order 2x2, 3x3, minors, cofactors, adjoint, inverse of a matrix. Solutions of linear equations: Cramers rule and matrix method involving two and three variables. Eigen values and Eigenvectors: Characteristic equation, characteristic roots, characteristic vectors (without any theorems) only 2x2 order. Cayley Hamilton theorem. (Only statement), verification of Cayley Hamilton theorem (only 2x2 matrices), using the same finding the powers of A (A^4 , A^5 , A-1, A-2), Inverse of a Matrix using Cayley- Hamilton theorem. [ 13 Hours ] Unit - III Logarithms: Definition of Logarithm, Indices leading to Logarithms and vice versa, Laws of Logarithms with proofs, Problems, Common Logarithm: Characteristic and Mantissa, Use of Logarithmic Tables, Problems. Permutation and Combination: Fundamental Principle of Counting, Factorial n, Permutations: Definition, Examples, Derivation of Formula nPr, Permutation when all the objects are not distinct, Problems, Combinations: Definition, examples, Proving nCr = nPr r!, nCr = nCn-r, nCr + nCr-1 = n+1Cr , Problems based on above formulae. [ 13 Hours ] Unit - IV Groups: Binary operation, Define of group, properties (only statement), problems (both finite and infinite groups), subgroup, theorems (no proof), problems. Vectors: Definition of vector and scalar, vector addition, dot and cross product, projection of a vector on the other (no geometrical meaning), area of parallelogram, area of a triangle, scalar triple product, volume of parallelepiped, co planarity of three vectors, vector triple product. [ 13 Hours ]
Unit - V Analytical Geometry in Two Dimensions: Coordinates, Distance formula, Section Formula, Area of the Triangle formula (no derivation), Locus of point. Straight Line: Slope of a line and angle between two lines, Various forms of equations of lines – Derivation and Problems. Equation of family of lines passing through the point of intersection of two lines, Distance of a point from line (only problems). [ 13 Hours ] Text Books
- Grewal, B.S.Higher engineering Mathematings, 36th^ Edition Reference Books
- Satyrs S.S, Engineering Mathematics.
- Peter V.O’Neil. Advanced Engineering Mathematics, 5th^ Edition.
BCA103P: C PROGRAMMING LAB PART – A
- Write a C Program to find the roots of the given quadratic equation using if-else if statement.
- Write a menu driven C program using switch-case to find: (a) Sum of the digits of number (b) Factorial of N.
- Write a C program to find cos (x) using series cos(x) = 1 – x^2 /2! + x^4 /4! - ………xn/n! ]
- Write a Program to find whether a given number is prime number are not
- Write a C program to arrange the given set of numbers in ascending and descending order.
- Write a C program to find product of two N x M matrices.
- Write a C program to calculate NCR= N!/ R! * (N-R)! Using function.
- Write a C program to display Fibonacci series using recursive function.
- Write a C program to concatenate two strings using pointers.
- Write a C program to copy content of one file to another file. PART – B During practical examination the External and Internal examiners may prepare exam question paper related to theory syllabus apart from Part-A. (A minimum of 10 Programs has to be prepared). Note : a) The candidate has to write both the programs One from Part-A and other from Part-B and execute one program as of External examiner choice. b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in the Practical Record. c) Scheme of Evaluation is as follows: Writing two programs - 10 Marks Execution of one program - 10 Marks Formatting the Output - 05 Marks Viva - 05 Marks Record - 05 Marks Total - 35 Marks
BCA104P: DIGITAL ELECTRONICS LAB
- Study of Logic Gates–AND, OR, NOT, NAND, NOR XOR (Using respective ICs)
- Realization of AND, OR and NOT gates using Universal Gates.
Matrices and Sparse matrices. [ 12 Hours ] Unit-III Linked list: Definition, Representation of Singly linked list in memory, Traversing a Singly linked list, Searching a Singly linked list, Memory allocation, Garbage collection, Insertion into a singly linked list, Deletion from a singly liked list; Doubly liked list, Header liked list, Circular linked list. [ 12 Hours ] Unit-IV Stacks – Definition, Array representation of stacks, Linked representation of stacks, Stack as ADT, Arithmetic Expressions: Polish Notation, Application of Stacks, Recursion, Towers of Hanoi, Implementation of recursive procedures by stack. Queues
- Definition, Array representation of queue, Linked list representation of queues Types of queue: Simple queue, Circular queue, Double ended queue, Priority queue, Operations on Queues, Applications of queues. [ 12 Hours ] Unit-V Graphs: Graph theory terminology, Sequential representation of Graphs: Adjacency matrix, traversing a Graph. Tree – Definitions, Binary trees, Representing binary trees in memory, Traversing Binary Trees, Binary Search Trees, Searching, Inserting and Deleting in a Binary Search Tree. [ 12 Hours ] TEXT BOOKS 1. Seymour Lipschutz, “Data Structures with C”, Schaum’s outL ines , Tata McGraw-Hill, 2011. REFERENCES BOOKS
- Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition, Pearson Education, 2013.
- Robert Kruse, C.L.Tondo, Bruce Leung, Shashi Mogalla, “Data Structures and Program Design using C”, Pearson Education, 2009.
- Forouzan, “A Structured Programming Approach using C”, 2nd^ Edition, Cengage Learning India, 2008.
BCA204T : DATA BASE MANAGEMENT SYSTEMS Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I Introduction: Database and Database Users, Characteristics of the Database Approach, Different people behind DBMS, Implications of Database Approach, Advantages of using DBMS, When not to use a DBMS. Database System Concepts and architecture: Data Models, Schemas, and Instances. DBMS Architecture and Data Independence., Database languages and interfaces. The database system Environment, Classification of DBMS. [ 12 Hours ] Unit - II Data Modelling Using the Entity-Relationship Model: High level conceptual Data Models for Database Design with and example., Entity types, Entity sets, attributes, and Keys, ER Model Concepts, Notation for ER Diagrams, Proper naming of Schema Constructs, Relationship types of degree higher than two. Record Storage and Primary File Organization: Secondary Storage Devices. Buffering of Blocks. Placing file Records on Disk. Operations on Files, File of unordered Records (Heap files), Files of Ordered
Records (Sorted files), Hashing Techniques, and Other Primary file Organization. [ 12 Hours ] Unit - III Functional Dependencies and Normalization for Relational Database: Informal Design Guidelines for Relational schemas, Functional Dependencies, Normal Forms Based on Primary Keys., General Definitions of Second and Third Normal Forms Based on Primary Keys., General Definitions of Second and Third Normal Forms, Boyce-Codd Normal Form. Relational Data Model and Relational Algebra: Relational Model Concepts., relational Model Constraints and relational Database Schema, defining Relations, Update Operations on Relations., Basic Relational Algebra Operations, Additional Relational Operations., Examples of queries in the Relational Algebra., Relational Database design Using ER-to-Relational Mapping. [ 12 Hours ] Unit – IV Relational Database Language: Data definition in SQL, Queries in SQL, Insert, Delete and Update Statements in SQL, Views in SQL, Specifying General Constraints as Assertions, specifying indexes, Embedded SQL. PL /SQL: Introduction. [ 12 Hours ] Unit - V Transaction Processing Concepts: Introduction, Transaction and System Concepts, Desirable properties of transaction, Schedules and Recoverability, Serializability of Schedules, Transaction Support in SQL, Locking Techniques for Concurrency Control, Concurrency Control based on time stamp ordering. [ 12 Hours ] Text book:
- Remez Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”, 5 th^ Edition, Pearson Education, 2007. References:
- Abrahamsi. Silberschatz, Henry. F. Korth, S. Sudarshan, “Database System Concepts” 6th^ Edition, McGraw Hill, 2012.
- C.J.Date, “Introduction to database systems”, Eight Edition, Addison Wesley,
BCA205: NUMERICAL AND STATISCAL METHODS Total Teaching Hours: 65 No of Hours / Week : 05 Unit - I Floating-point representation and errors-Normalized floating-point forms, Errors in representing numbers, Floating point machine number and machine epsilon, Loss of significance and its avoidance. Roots of equations-locating roots of f(x)=0 Bisection method, Newton’s method, Secant method. [ 13 Hours ] Unit - II Interpolation and numerical differentiation-polynomial interpolation, Lagrange and Newton form of interpolating Polynomial, Divided difference and recursive property, Inverse interpolation, First and Second derivative formulae via interpolation Polynomials. Numerical integration-Trapezoidal, Simpson’s and adaptive Simpson rules. [ 13 Hours ] Unit - III System of linear equations-Gaussian elimination and back substitution-partial and complete pivoting, Doolittle, Cholesky and Crout LU decomposition methods, Jacobi and
a) The candidate has to write two the programs One from Part-A and other from Part-B and execute one program as of External examiner choice. b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in the Practical Record. c) Scheme of Evaluation is as follows: Writing two programs - 10 Marks Execution of one program - 10 Marks Formatting the Output - 05 Marks Viva - 05 Marks Record - 05 Marks Total - 35 Marks
BCA304P: DATABASE MANAGEMENT SYSTEM LAB PART - A
- The STUDENT detail databases has a table with the following attributes. The primary
keys are underlined. STUDENT(regno: int, name: string, dob: date, marks: int)
i) Create the above table.
ii) Remove the existing attributes from the table.
iii) Change the date type of regno from integer to string.
iv) Add a new attribute phoneno to the existing table.
v) Enter five tuples into the table.
vi) Display all the tuples in student table.
- A LIBRARY database has a table with the following attributes.
LIBRARY(bookid:int, title:string, author:string, publication:string, yearpub:int, price:real)
i) Create the above table.
ii) Enter the five tuples into the table
iii) Display all the tuples in student table.
iv) Display the different publishers from the list.
v) Arrange the tuples in the alphabetical order of the book titles.
vi) List the details of all the books whose price ranges between Rs. 100 and Rs. 300
- The SALARY database of an organization has a table with the following attributes.
EMPSALARY(empcod:int, empnamee:string, dob:date, department:string, salary:real)
i) Create the above table.
ii) Enter the five tuples into the table
iii) Display all the number of employees working in each dapartment.
iv) Find the sum of the salaries of all employees.
v) Find the sum and average of the salaries of employees of a particular department.
vi) Find the least and highest salaries that an employee draws.
- Consider the insurance database given below. The primary keys are underlined and
the data types are specified.
PERSON(driver-id-no: string, name: string, address:strong)
CAR(regno: string, model: string, year: int)
ACCIDENT(report-no: int, date: date, location: String)
OWNS(driver-id-no: string, regno: string)
PARTICIPATED(driver-id-no: string, regno: string, report-no: int, damage-amount: int)
i) Create the above tables by properly specifying the primary keys and the foreign keys
ii) Enter atleast five tuples for each relation.
iii) Demonstrate how you
a) Update the damage amount for the car with a specific regno in the accident with report no 12 to 25000. b) Add a new accident to the database.
iv) Find total number of people who owned cars that were involved in accidents in 2002
v) Find the number of accidents in which cars belonging to a specific model were involved
- Consider the following database of students enrollment in courses and books adopted
for each course.
STUDENT(regno: string, name: string, major: strong, bdate: date)
COURSE(course-no: int cname: string, dept: string)
ENROLL(reg-no: string, course-no: int, sem: int, marks: int)
BOOK-ADOPTION(course-no: int, sem: int, book-isbn: int)
TEXT(book-isbn: int, book-title: string, publisher: string, author: string)
i) Create the above tables by properly specifying the primary keys and the foreign keys
ii) Enter atleast five tuples for each relation.
iii) Demonstrate how you add a new text book to the database and make this book be
adopted by some department.
iv) Produce a list of text books (include Course-no, book-isbn, book-title) in the
alphabetical order for courses offered by the ‘Compute Science’ department that use more than two books.
v) List any department that has all its adopted books published by a specific publisher.
- The following tables are maintained by a book dealer
AUTHOR(author-id: int, name: string, city: string, country: string)
PUBLISHER(publisher-id: int name: string, city: string, country: string)
iv) Produce a listing: customer name, no of orders, average order amount v) List the orders that were not shipped within 30 days of ordering PART – B During practical examination the External and Internal examiners may prepare exam question paper related to theory syllabus apart from Part-A. (A minimum of 8 Programs has to be prepared). Note : a) The candidate has to write two the programs One from Part-A and other from Part-B and execute one program as of External examiner choice. b) A minimum of 8 Programs has to be done in Part-B and has to be maintained in the Practical Record. c) Scheme of Evaluation is as follows: Writing two programs - 10 Marks Execution of one program - 10 Marks Formatting the Output - 05 Marks Viva - 05 Marks Record - 05 Marks Total - 35 Marks
THIRD SEMESTER BCA
BCA301T: INDIAN LANGUAGE
Syllabus as per the one prescribed for science courses of Bangalore University.
BCA302T: ENGLISH Syllabus as per the one prescribed for science courses of Bangalore University.
BCA303T: OBJECT ORIENTED PROGRAMMING USING C++ Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I Introduction :Procedure Languages, definition of OOP, Basic concept of OOP, Object Class, Data Abstraction, Data Encapsulation, Data Hiding member functions , Reusability, Inheritance, Creating new Data Types, Polymorphism, Overloading , Dynamic binding and Message passing. C++ Features: The iostream class, C++ Comments, C++ Keywords, Variable declaration, The Const Qualifier. The Endl, Set Waste precision, Manipulators, The scope resolution operator, The new & delete Operations. Functions: Simple Functions, Function declaration, calling the function, function definition, Passing argument to, returning value from function, passing constants, Variables, pass by value , passing structure variables, pass by reference, Default arguments, return statements, return by reference, overloaded functions; Different number of arguments, Different Kinds of argument, inline function. [ 12 Hours ] Unit - II Objects & Classes: Classes & Objects, Class Declaration, Class member; Data Constructions, Destructors, Member functions, Class member visibility, private, public, protected. The scope of the class objects constructions, Default Constructor. Constructor with argument, constructor with default arguments, Dynamic constructor, copy constructor, Overloaded constructor, Objects as arguments returning objects from
functions, class conversion, manipulation private Data members, Destructors classes, object & memory, arrays as class member data: Array of objects, string as class member. [ 12 hours ] Unit - III Operator Overloading : Overloading unary operator: Operator Keyword, Operator arguments, Operator return value, Nameless temporary objects, limitations of increment operator, overloading binary operator, arithmetic operators, comparison operator, arithmetic assignment operator, data conversion; conversion between objects of different classes. Inheritance : Derived Class & Base Class: Specifying the Derived class accessing Base class members, the protected access specifier, Derived class constructor, Overriding member functions, public and private inheritance; Access Combinations, Classes & Structures, Access Specifiers, Level of inheritance; Multilevel inheritance, Hybrid inheritance, Multiple inheritance; member functions in multiple inheritance , constructors in multiple inheritance, Containership; Classes, within classes, Inheritance & Program development. [ 12 Hours ] Unit - IV Virtual functions: Normal member function accessed with pointers, Virtual member functions accessed with pointers, Dynamic binding, pure virtual functions, Friend function; Friends for functional notation, friend classes, the pointer; Accessing Member Data with this, using this for returning values. Templates & Exception Handling: Introduction, Templates, Class Templates, function templates, Member function templates, Template arguments, Exception Handling. [ 12 Hours ] Unit V Streams: The Stream class Hierarchy, Stream classes Header file, string I/O: Writing strings, reading strings, character I/O, Detecting End – of – file. Object I/O; writing an object to disk, reading an object from disk, I/O with multiple objects; the fstream class, The open function, File Pointers; Specifying the position, Specifying the offset. The tellg Function, Disk I/O with Memory Functions; Closing Files, Error Handling, Command Line Arguments. [ 12 Hours ] Text books:
- Lafore Robert, “Object Oriented Programming in Turbo C++”, Galgotia Publications, 2012. Reference:
- Lippman, “C++ Primer”, 3rd^ Edition, Pearson Education, 2010.
- E. Balaguruswamy: Object Oriented Programming with C++, Tata McGraw Hill Publications, 2011.
- Farrell, “Object Oriented Programming Using C++”, 1st^ Edition 2008, Cengage Learning India
BCA304T: ACCOUNTING AND FINANCIAL MANAGEMENT Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I Introduction: History and Development of Accounting – Meaning Objectives and functions of Accounting-Book–keeping V/s Accounting – Users of accounting data – systems of book-keeping and accounting – branches of accounting – advantages and limitations of accounting. Accounting Concepts and conventions: Meaning need and classification, Accounting standards – meaning, need and classification of Indian