University of Mysore – BCA Revised Syllabus – Bala Krishna. M.,M.C.A
UNIVERSITY OF MYSORE
PROPOSED REGULATIONS AND SCHEME OF STUDY FOR BACHELOR OF COMPUTER APPLICATIONS [BCA]
Semester - I
Subject code / Title / Teaching Dept. / TeachingHrs./Week / Dura. of Exam (Hrs.) / Marks
IA Max. / Th/Pr Max. / Total / Th/Pr Min. / Min. for Pass
Th. / Pr.
1BCA1 / Kannada / Other Language - I / Kannada/ Concerned Dept. / 04 / - / 03 / 20 / 80 / 100 / 28 / 40
1BCA2 / General English / English / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
1BCA3 / Analog & Digital Electronics / CS/Elec. / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
1BCA4 / Mathematics / Math. / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
1BCA5 / Fundamentals of Information Technology / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
1BCA6 / Problem Solving & Programming in C / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
1BCA7 / Information Technology & Digital Electronics Lab / CS/Elec. / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
1BCA8 / C Programming Lab / CS / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
Total / 19 / 12 / 800
Departments Abbreviations
CS - Computer Science DepartmentElec. - Electronics Department
Phy. – Physics DepartmentMath. – Mathematics Department
Com. – Commerce Department
Semester - II
Subject code / Title / Teaching Dept. / TeachingHrs./Week / Dura. of Exam (Hrs.) / Marks
IA Max. / Th/Pr Max. / Total / Th/Pr Min. / Min. for Pass
Th. / Pr.
2BCA1 / Kannada / Other Language - II / Kannada/ Concerned Dept. / 04 / - / 03 / 20 / 80 / 100 / 28 / 40
2BCA2 / Technical English & Business Communication / English / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
2BCA3 / Data Structures and Algorithms / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
2BCA4 / Discrete Mathematics / Math. / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
2BCA5 / Computer Organization / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
2BCA6 / Accounting & Financial Management / Com. / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
2BCA7 / Data Structures Lab / CS / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
2BCA8 / Accountancy Lab / Com. / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
Total / 19 / 12 / 800
Semester - III
Subject code / Title / Teaching Dept. / TeachingHrs./Week / Dura. of Exam (Hrs.) / Marks
IA Max. / Th/Pr Max. / Total / Th/Pr Min. / Min. for Pass
Th. / Pr.
3BCA1 / Kannada / Other Language-III / Kannada/ Concerned Dept. / 04 / - / 03 / 20 / 80 / 100 / 28 / 40
3BCA2 / E-Governance / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
3BCA3 / Operating Systems / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
3BCA4 / System Analysis & Design / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
3BCA5 / Microprocessors / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
3BCA6 / Object Oriented Programming with C++ / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
3BCA7 / Microprocessor Lab / CS / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
3BCA8 / Object Oriented Programming Lab / CS / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
Total / 19 / 12 / 800
Semester - IV
Subject code / Title / Teaching Dept. / TeachingHrs./Week / Dura. of Exam (Hrs.) / Marks
IA Max. / Th/Pr Max. / Total / Th/Pr Min. / Min. for Pass
Th. / Pr.
4BCA1 / Kannada / Other Languages-IV / Kannada/ Concerned Dept. / 04 / - / 03 / 20 / 80 / 100 / 28 / 40
4BCA2 / Computer Graphics & Multimedia / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
4BCA3 / Numerical Analysis and Statistics / CS/Math. / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
4BCA4 / Database Management Systems / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
4BCA5 / Computer Networks / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
4BCA6 / Visual Programming with Visual Basic 6.0 / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
4BCA7 / Numerical Analysis and Statistics Lab / CS / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
4BCA8 / Database & Visual Basic Lab / CS / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
Total / 19 / 12 / 800
Semester - V
Subject code / Title / Teaching Dept. / TeachingHrs./Week / Dura. of Exam (Hrs.) / Marks
IA Max. / Th/Pr Max. / Total / Th/Pr Min. / Min. for Pass
Th. / Pr.
5BCA1 / Constitution of India * / Concerned Dept. / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
5BCA2 / Environmental Studies * / Concerned Dept. / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
5BCA3 / Software Engineering / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
5BCA4 / Java, Internet & Web Designing / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
5BCA5 / Elective – I / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
5BCA6 / Elective – II / CS / 03 / - / 03 / 20 / 80 / 100 / 28 / 40
5BCA7 / Web Designing Lab / CS / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
5BCA8 / Elective Lab / CS / - / 06 / 03 / 20 / 80 / 100 / 28 / 40
Total / 18 / 12 / *800/ 600
* Marks secured in the subject ‘Constitution of India’and ‘Environmental Studies’ will not be considered for awarding class.
Elective – I / Elective – II5BCA51: System Software / 5BCA61: Multimedia Computing.
5BCA52: Data Mining & Warehousing / 5BCA62: Software Testing & Quality Assurance.
5BCA53: Enterprise Resource Planning (ERP). / 5BCA63: Mobile Communication.
5BCA54: Operation Research.
Semester – VI
Subject code / Title / Teaching Dept. / TeachingHrs./Week / Dura. of Exam (Hrs.) / Marks
IA Max. / Dissertation / Viva / Proj. Min. / Min. for Pass
Th. / Pr.
6BCA1 / Project Work / CS / - / 24 / 03 / 40 / 120 / 40 / 56 / 80
Total / - / 24 / 200
Pattern of Question paper for Theory Exam
The Question paper will be of the following form:
Max.Marks:80Duration:03 hours.
Part-A:
Answer 10 questions out of 12 questions.Marks:2 X 10 = 20
Part-B:
Answer six questions out of 9 questions.Marks:10 X 6=60
[A question may have internal splitting]
Pattern of question paper for Practical Exam.
Max marks: 80Duration: 3 Hrs
A student has to analyse and develop the solving procedure/algorithm for the questions assigned.
Component / Developing algorithm / Implementation / Results / Sub TotalQuestion1 / 10 / 10 / 10 / 30
Question 2 / 10 / 10 / 10 / 30
viva / --- / ----- / ---- / 20
Bachelor of Computer Applications (BCA)
I SEMESTER
1BCA1:ªÉÆzÀ®£ÉAiÀÄ ¸É«Ä¸ÀÖgï
¥ÀwæPÉ 1: ¸À«¸ÀÛgÀ – C«¸ÀÛgÀ ¥ÀoÀåUÀ¼ÀÄ ªÀÄvÀÄÛ DqÀ½vÀ PÀ£ÀßqÀ – 1
(ªÁgÀPÉÌ 4 UÀAmÉUÀ¼À ¥ÁoÀ, 3 UÀAmÉUÀ¼À ¥ÀjÃPÉë, ¥ÀjÃPÁë CAPÀUÀ¼ÀÄ 80, DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À CAPÀUÀ¼ÀÄ 20)
¸Á»vÀå WÀlPÀ: ¸À«¸ÀÛgÀ ¥ÀoÀå: ªÁgÀPÉÌ 2 UÀAmÉUÀ¼À ¥ÁoÀ: 40 CAPÀUÀ¼ÀÄ
¥ÀoÀå 1: ºÉƸÀUÀ£ÀßqÀ PÁªÀå: (ªÁgÀPÉÌ 2 UÀAmÉUÀ¼ÀAvÉ ¸É«Ä¸ÀÖgïUÉ 20 UÀAmÉUÀ¼À ¥ÁoÀ)
¸Á»vÀå ¨sÀÆ«ÄPÉ – 2 : ªÉÄʸÀÆgÀÄ «±Àé«zÁ央AiÀÄ ¥ÀæPÀluÉ
¤UÀ¢vÀ 10 PÀªÀ£ÀUÀ¼ÀÄ
- PÀÄgÀÄqÀÄ PÁAZÁuÁ – zÀ.gÁ.¨ÉÃAzÉæ
- ¨Á½£À ºÀA§®Ä - ¥ÀÄ.w.£ÀgÀ¹AºÁZÁgï
- UÁߣÀzï ¢Ã¥À – f.¦.gÁdgÀvÀßA
- ¸ÀªÀiÁd ¨sÉÊgÀªÀ – JA.UÉÆÃ¥Á®PÀȵÀÚ CrUÀ
- dqÉ – f.J¸ï.²ªÀgÀÄzÀæ¥Àà
- ¥sÉ樀 – UÀAUÁzsÀgÀ avÁÛ®
- ªÀiÁ¹Û – PÉ.J¸ï. ¤¸Ágï CºÀªÀÄzï
- PÀÄAwAiÀÄ ¨É¼ÀUÀÄ – «dAiÀiÁ zÀ¨Éâ
- UÀįÁªÀÄVÃvÉ - §gÀUÀÆgÀÄ gÁªÀÄZÀAzÀæ¥Àà
- CªÀé – J¯ï ºÀ£ÀÄAvÀAiÀÄå
¸Á»vÀå WÀlPÀ: C«¸ÀÛgÀ ¥ÀoÀå: ªÁgÀPÉÌ 1 UÀAmÉ ¥ÁoÀ: 20 CAPÀUÀ¼ÀÄ
¥ÀoÀå: 2 - ¥Àæ§AzsÀ (ªÁgÀPÉÌ 1 UÀAmÉAiÀÄAvÉ ¸É«Ä¸ÀÖgïUÉ 10 UÀAmÉUÀ¼À ¥ÁoÀ)
¸Á»vÀå ¨sÀÆ«ÄPÉ – 2: ªÉÄʸÀÆgÀÄ «±Àé«zÁ央AiÀÄ ¥ÀæPÀluÉ
¤UÀ¢vÀ 4 ¥Àæ§AzsÀUÀ¼ÀÄ
- ¥ÀgÉÆÃ¥ÀPÁgÀ °«ÄmÉqï - ²ªÀgÁªÀÄ PÁgÀAvÀ
- gÉÆÃUÀ – C.£À.PÀȵÀÚgÁAiÀÄ
- j¥ÉÃj - ºÀA¥À £ÁUÀgÁdAiÀÄå
- ¸ÀÄR – JZï.f. ¸ÀtÚUÀÄqÀØAiÀÄå
¨sÁµÁ WÀlPÀ: DqÀ½vÀ PÀ£ÀßqÀ – 1: (ªÁgÀPÉÌ 1 UÀAmÉAiÀÄAvÉ ¸É«ÄlÖgïUÉ 10 UÀAmÉUÀ¼À ¥ÁoÀ, 20 CAPÀUÀ¼ÀÄ)
- DqÀ½vÀ ¨sÁµÉAiÀiÁV PÀ£ÀßqÀ, ¸ÀégÀÆ¥À , ®PÀët (2 UÀAmÉ)
- DqÀ½vÀ PÀ£ÀßqÀ ¨É¼ÉzÀÄ §AzÀ zÁj (3 UÀAmÉ)
- ¸ÀPÁðj ¥ÀvÀæ ªÀåªÀºÁgÀ: C¢üPÀÈvÀ ¥ÀvÀæ, CgÉC¢üPÀÈvÀ ¥ÀvÀæ, C¢üPÀÈvÀ eÁÕ¥À£À, ¸ÀÄvÉÆÛÃ¯É (5 UÀAmÉ)
1BCA3: Analog and Digital Electronics
Unit-I:
Introduction to Electronics: (15 hrs)
Atomic structure, Energy of an electron, Valence Electrons, Voltage source.
Semiconductor Materials:
Definition of a semiconductor. Types of semiconductors-Intrinsic and Extrinsic . P-type, N-type, P-N junction, Band Theory of solids.
Transistor-Definition, Types-Grown Junction, Alloy type, Diffused junction, Epitraxial planar, Misc, Transistor characteristics (configurations)-common base, common collector, common emitter. NPN transistor as a voltage amplifier. Transistor parameters, Relationship between transistor parameters.
Unit-II
Transistors: (15 hrs)
Naming the transistor terminal, construction working of a transistor. Different mode of operation, Relationship between Alpha and Beta, Transistor as an Amplifier, Biasing of a Transistor-Voltage Divider Method, Single and Multistage Amplifier.
Integrated Circuits: Integrated Circuits classification, Types of Integrated Circuits.
Boolean algebra:
Basic laws, Demorgan’s theorem, duality theorem, sum of product method and products of sum method. Karnaugh map.
Unit-III
Fundamentals of Gates: Basic gates and Universal gates, combinational logic circuits, Half adder, Full adder, Half subtractor and Full subtractor. (15 hrs)
Flip-Flops: SR, D, JK AND T Flip-Flops.
Decoders: 3 to 8 lines
Encoders:Octal to Binary
Multiplexers:4 to 1 line
Counters: 3 bit binary ripple counter
3 bit synchronous binary counter
Shift registers:Serial-in-parallel out and parallel in Serial out registers.
Text Books:
1.Malvino Leach, digital principles and application(4th edition)
2.Morris Mano, Computer System Architecture(3rd edition)PHI
3. Principles of Electronics-V.K.Mehtha.
4.Digital fundamentals-Thomas.D.Floyd.
5. Basic Electronics – G.K.Mithal
1BCA4: Mathematics
UNIT-1
Algebra (10 Hours)
Introduction, partial fraction, logarithms, mathematical induction, summation of finite series, theory of equations, binomial theorem.
Trigonometry (12 Hours)
Radian, trigonometric functions, heights and distances, allied angles, graphs of trigonometric functions Complex numbers.
UNIT-II
Analytical geometry (12 hours)
Points, straight lines, pair of lines, Circle and conics, Elements of 3D analytical geometry.
UNIT-III
Calculus and graph theory (12 Hours)
Limits and continuity, Differentiation, Differential equations, Integration, applications.
Text Books
- Theory and Problems in Mathematics – I by BOSCO Publications 2004.
- Theory and Problems in Mathematics - II by BOSCO Publications 2005
- Engineering Mathematics, Volumes I-IV by S Chandrasekhar.
1BCA5:Fundamentals of Information Technology
UNIT-1
Computer (4 Hours)
Computer as multipurpose tool -Overview of the Computer system — looking inside the machine - Software brings machine to life - shapes of Computer today.
Processing Data (4 Hours)
Transforming data into information - How a Computer processes data - factors affecting processing speed - CPU's used in personal Computers.
Interacting with Computer (5 Hours)
The Keyboard - the mouse - other input devices - The monitor - Printers - Sound systems - Connecting I/O devices to the Computer.
Storing information in a Computer (5 Hours)
Types of storage devices - Magnetic storage devices, Optical Storage devices, measuring device performance.
UNIT-II
Operating System and the user interface (4 Hours)
What is an Operating System - the use interface - running programs - managing files - managing hardware - Enhancing the operating system with utility Software - typical operating systems in use.
Word Processing and Desktop publishing (4 Hours)
The many uses of word processing Software - Entering text -Editing text - Formatting text - advanced word processing-feature - desktop publishing Software.
UNIT-III
Spread Sheets (4 Hours)
Uses of Spread sheets - creating a worksheet - creating formulas - Editing, the worksheet - Adding charts -Analyzing the data - additional tools.
Database Management systems (5 Hours)
Data and Information - the database - DBMS relationship-working with a database - creating tables - Editing records -querying database - generating report.
Computers in Business (5 Hours)
Why businesses need information — types of business Software - Evolution of business computing - building flexible systems for the user — corporate culture shock.
Information System (5 Hours)
What is an information System - types of information Systems — System development life cycle.
Text Books
1. Peter Norton's 'Introduction to Computers', Second edition, TMH.
Reference Books
1. Computer Fundamentals - P K Sinha,BPB
2. Introduction to Computers - N Subramanian,TMH
3. Understanding Computers - R Rajagopalan. TMH
4. Computers Today - Donald Sanders, MGH
5. Computers Today - Suresh K Basandra, Galgotia
1BCA6: Problem solving and programming in ‘C’
UNIT-1
Overview of C (3 Hours)
Importance of C, Sample C programs, Basic structure of C Programs, Programming style, executing a C Program.
Constants, Variables, and Data Types (3Hours)
Character set, C tokens, Keywords and identifiers, Constants, Variables, Data types, Declaration of variables, Assigning values to variables ,Defining symbolic constants
Operators and Expression (6Hours)
Arithmetic of Operators, Relational operators, Logical operators Assignment operators, Increment and decrement operators, Conditional operator, Bit wise operators, Special operators, Arithmetic expressions, Evaluation of expressions, Precedence of arithmetic operators, Type conversions in expressions, Operator precedence and associatively, Mathematical functions.
Managing Input and Output Operations (3Hours)
Reading a character, writing a character, formatted input, formatted output
Unit-II
Decision Making and Branching (3Hours)
Decision making with IF statement, Simple IF statement, The IF ELSE statement, Nesting of IF ... ELSE statements, The ELSE IF ladder, the switch statement, the ?: Operator, The GOTO statement.
Decision Making and Looping (3Hours)
The WHILE statement, The DO statement, The FOR statement, Jumps in loops
Arrays (3Hours)
One-dimensional arrays, Two-dimensional arrays, Initializing two-dimensional arrays.
Handling of character strings (4Hours)
Declaring and initializing string variables, Reading strings from terminal, Writing strings to screen, Arithmetic operations on characters, Putting strings together Comparison of two strings, String-handling functions, Table of strings
User-Defined Functions (5Hours)
Need for user-defined functions, multi-function program, The form of C functions Return values and their types, Calling a function Category of functions, Handling of non-integer functions, Nesting of functions, Recursion, Functions with arrays, The scope and lifetimeof variables in functions.
UNIT-III
Structures and Unions (6Hours)
Structure definition, giving values to members, Structure initialization Comparison of structure variables, Unions, Size of structures
Pointers and File Handling (6Hours)
Understanding pointers. Accessing the address of a variable, Declaring and initializing pointers, Accessing a variable through its pointer, Introduction to File Processing, I/O operations.
Text Books
1. Programming in ANSI C 2nd Edition by E Balagurusawmi Published by Tata McGraw Hill.
Reference Books
1. Computer Programming in C by V Rajaraman, PHI, NewDelhi, 1995.
2. Programming in C by Hutchison.R, McGraw Hill, New York, 1990.
3. Application program in C by Johnsonburgh, R and Kalin,M.
1BCA7: Information Technology and Digital Electronics Lab
Exercises should be based on IBCA3 & IBCA5.
1BCA8: ‘C ‘ Programming Lab.
Exercises should be based on IBCA6.
II SEMESTER
2BCA1:JgÀqÀ£ÉAiÀÄ ¸É«Ä¸ÀÖgï
¥ÀwæPÉ 2: ¸À«¸ÀÛgÀ – C«¸ÀÛgÀ ¥ÀoÀåUÀ¼ÀÄ ªÀÄvÀÄÛ DqÀ½vÀ PÀ£ÀßqÀ – 2
(ªÁgÀPÉÌ 4 UÀAmÉUÀ¼À ¥ÁoÀ, 3 UÀAmÉUÀ¼À ¥ÀjÃPÉë, ¥ÀjÃPÁë CAPÀUÀ¼ÀÄ 80, DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À CAPÀUÀ¼ÀÄ 20)
¸Á»vÀå WÀlPÀ: ¸À«¸ÀÛgÀ ¥ÀoÀå: ªÁgÀPÉÌ 2 UÀAmÉUÀ¼À ¥ÁoÀ: 40 CAPÀUÀ¼ÀÄ
¥ÀoÀå 1: £ÁlPÀ (ªÁgÀPÉÌ 2 UÀAmÉUÀ¼ÀAvÉ ¸É«Ä¸ÀÖgïUÉ 20 UÀAmÉUÀ¼À ¥ÁoÀ)
©A§: ZÀzÀÄgÀAUÀ
¥Àæ: £ÁUÉÃAzÀæ ¥ÀæPÁ±À£À, ªÉÄʸÀÆgÀÄ
¸Á»vÀå WÀlPÀ: C«¸ÀÛgÀ ¥ÀoÀå: ªÁgÀPÉÌ 1 UÀAmÉ ¥ÁoÀ: 20 CAPÀUÀ¼ÀÄ
¥ÀoÀå: 2 –PÁzÀA§j / ªÉÊZÁjPÀ §gÀºÀ
(ªÁgÀPÉÌ 1 UÀAmÉAiÀÄAvÉ ¸É«Ä¸ÀÖgïUÉ 10 UÀAmÉUÀ¼À ¥ÁoÀ)
PÁqÀÄ: ²æà PÀȵÀÚ D®£ÀºÀ½î
¥Àæ: £É®ªÀÄ£É ¥ÀæPÁ±À£À, ªÉÄʸÀÆgÀÄ
¨sÁµÁWÀlPÀ: DqÀ½vÀ PÀ£ÀßqÀ – 2: (ªÁgÀPÉÌ 1 UÀAmÉAiÀÄAvÉ ¸É«ÄlÖgïUÉ 10 UÀAmÉUÀ¼À ¥ÁoÀ, 20 CAPÀUÀ¼ÀÄ)
- ««zsÀ jÃwAiÀÄ (2 UÀAmÉUÀ¼ÀÄ)
- PÀqÀvÀ (¥sÉÊ®Ä) – PÀbÉÃj n¥ÀàtÂUÀ¼ÀÄ (5 UÀAmÉUÀ¼ÀÄ)
- ¥ÀæPÀluÉ – eÁ»gÁvÀÄ (3 UÀAmÉUÀ¼ÀÄ)
2BCA3:Data Structure and Algorithms
UNIT-1
Linear Data Structure and their sequential storage representation
(20 Hours)
Algorithmic notation, Concept and terminology for non-primitive Data structures, Storage structures for arrays, Structures and arrays of structures, Stacks, Definitions and Concepts, Operations on stacks, Applications of stacks, Recursion, Infix to postfix, Evaluating postfix expressions, Queues, Priority Queues
Linear Data Structure and their Linked storage representation
Pointers and Linked Allocation, Linked linear lists, Operations on Linear lists using singly linked storage structures, Circularly linked linear lists, Doubly linked linear lists
UNIT-2
Nonlinear Data Structures (13 Hours)
Trees - Definition and concepts, Operations on Binary Trees, Linked Storage Representations of Binary Trees, Tree creation and Traversal
UNIT-4
Sorting and searching (12 Hours)
Sorting, Selection sort, Bubble sort, Merge sort, Quick sort, Radix sort, Searching, Sequential searching, Binary searching, Search Tree
Text Books
1. An Introduction to Data Structures with Applications 2nd edition - J.P.Trembly and Sorenson, McGraw Hill 2001.
Reference Books
1. Data structures using C & C++ by Yedidyah Langsun, Moshe J Augenstein, Teneinbaum published by Prentice Hall of India Ltd.
2. Algorithms + Data Structures = Programs by Niklaus Wirth Prentice Hall 1976.
3. Data structures and algorithms by Aho, A.V.,Hopcroft and Ullman,J.E., Addison Wesley, 1980.
4. Fundamentals of data structures by Horowitze,E and Sahni,S., Galgotia bookstore.
5. Data structures and program design by Robert,L.Krunse, PHI.
6. Data and File structures by Mary Lunis, PHI.
7. Theory and problems of Data structures by Seymour Lipshutz, McGraw Hill.
2BCA4: Discrete Mathematics
UNIT-1
Basics of Set Theory (15 Hours)
Notation, Inclusion and Equality of sets, The power set, Operations on sets, Venn diagram, Set identities, Ordered pairs and n-tuples, Cartesian Products
Relations and Ordering – Properties of binary relations in a Set, Relation Matrix and the Graph of a Relation, Equivalence Relations, Compatibility Relations, Composition of Binary Relation, Partial Ordering and Partially Ordered Set
Graph Theory
Basic Definitions, Paths, Reach ability and Connectedness, Matrix Representation of Graphs, Trees
UNIT-2
Functions (15 Hours)
Definition and Introduction, Composition of Functions, Inverse Functions, Binary and n-ary Operations, Characteristic Function of a Set, Hashing Functions.
UNIT-3
Mathematical Logic (15 Hours)
Statements and Notation, Connectives, Negation, Conjunction, Disjunction, Statement Formulas and Truth Tables, Logical Capabilities of Programming Languages, Conditional and Biconditional, Well-formed Formulas, Tautologies, Equivalence of Formulas, Duality Law, Tautological Implications.
Text Books
1.Discrete Mathematical Structures with Applications to Computer Science by J.P. Tremblay, R Manohar 3rd edition – Tata McGraw Hill
Reference Books
1.Discrete mathematical structures by B.Kolman, R.C.Busby and S.Ross, 3rd edition.
2.Introduction to discrete mathematics by Liu, C.L.,McGraw Hill, 2nd edition,1985.
3.Discrete mathematics by S.A.Witala, McGraw Hill, 1987.
2BCA7: Data Structure Lab
Exercises should be based on 2BCA3.
2BCA8: Accountancy Lab
Exercises should be based on 2BCA6.
III SEMESTER
3BCA1:ªÀÄÆgÀ£ÉAiÀÄ ¸É«Ä¸ÀÖgï
¥ÀwæPÉ 3: ¸À«¸ÀÛgÀ – C«¸ÀÛgÀ ¥ÀoÀåUÀ¼ÀÄ ªÀÄvÀÄÛ ªÁtÂdå PÀ£ÀßqÀ – 1
(ªÁgÀPÉÌ 4 UÀAmÉUÀ¼À ¥ÁoÀ, 3 UÀAmÉUÀ¼À ¥ÀjÃPÉë, ¥ÀjÃPÁë CAPÀUÀ¼ÀÄ 80, DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À CAPÀUÀ¼ÀÄ 20)
¸Á»vÀå WÀlPÀ: ¸À«¸ÀÛgÀ ¥ÀoÀå: ªÁgÀPÉÌ 2 UÀAmÉUÀ¼À ¥ÁoÀ: 40 CAPÀUÀ¼ÀÄ
¥ÀoÀå 1: ºÀ¼ÀUÀ£ÀßqÀ - £ÀqÀÄUÀ£ÀßqÀ PÁªÀå: (ªÁgÀPÉÌ 2 UÀAmÉUÀ¼ÀAvÉ ¸É«Ä¸ÀÖgïUÉ 20 UÀAmÉUÀ¼À ¥ÁoÀ)
PÁªÀå ¸ÀAZÀAiÀÄ 5: ªÉÄʸÀÆgÀÄ «±Àé«zÁ央AiÀÄ - ¥ÀæPÀluÉ
¤UÀ¢vÀ 5 ¨sÁUÀUÀ¼ÀÄ
- ªÀĺÁ¥ÀÄgÀĵÀgï CjAiÀÄzÀÄzÀ – PÀ«gÁdªÀiÁUÀð – 1
- «µÀÄÚªÀ¢üðµÀÄÚªÁzÀj - £ÉëÄZÀAzÀæ
- gÁd¤Ãw - £ÀAdÄAqÀ
- ªÀZÀ£ÀUÀ¼ÀÄ - ¸Á¹ªÉAiÀĵÀÄÖ ¸ÀÄRPÉÌ – C®èªÀÄ¥Àæ¨sÀÄ
- £É¯ÉʼÀUÁzÀÄzÀÄ – aPÀÌZÉêÀgÁd
¸Á»vÀå WÀlPÀ: C«¸ÀÛgÀ ¥ÀoÀå: ªÁgÀPÉÌ 1 UÀAmÉ ¥ÁoÀ: 20 CAPÀUÀ¼ÀÄ
¥ÀoÀå: 2 - ¥ÀæªÁ¸À ¸Á»vÀå / fêÀ£À ZÀjvÉæ / ¸ÀAQæÃtð §gÀºÀ / DvÀäPÀxÉ
(ªÁgÀPÉÌ 1 UÀAmÉAiÀÄAvÉ ¸É«Ä¸ÀÖgïUÉ 10 UÀAmÉUÀ¼À ¥ÁoÀ)
PÀÄPÀÌgÀºÀ½î: ²ªÀgÁªÀÄÄPÁqÀ£ÀPÀÄ¥Éà
¥Àæ: ¨sÁgÀwà ¥ÀæPÁ±À£À, ¸ÀgÀ¸Àéw¥ÀÄgÀA, ªÉÄʸÀÆgÀÄ
¨sÁµÁWÀlPÀ: ªÁtÂdå PÀ£ÀßqÀ – 1: (ªÁgÀPÉÌ 1 UÀAmÉAiÀÄAvÉ ¸É«ÄlÖgïUÉ 10 UÀAmÉUÀ¼À ¥ÁoÀ, 20 CAPÀUÀ¼ÀÄ)
- ªÁtÂdå PÀ£ÀßqÀ - ¸ÀégÀÆ¥À, ®PÀëëtUÀ¼ÀÄ
- ªÁtÂdå ¥ÀvÀæzÀ ««zsÀ CAUÀUÀ¼ÀÄ
- «ZÁgÀuÁ ¥ÀvÀæ – GvÀÛgÀ ¥ÀvÀæ, C£ÀÄUÀvÀ ¥ÀvÀæ, DzÉñÀ ¥ÀvÀæ
- GzÀj, ¥ÀgÁªÀıÀð£À ªÀÄvÀÄÛ ¥ÀjZÀAiÀÄ ¥ÀvÀæ
- ªÀ¸ÀÆ° ¥ÀvÀæ
3BCA2: E-Governance
UNIT-1 15 hrs
E-government: Need of e-governance, e-assistance, e-democracy, e-administration, citizen services, e-procurement, Mobile government, Law and policies, IT Act, Right for Information Act, Introduction to various TAX Payable, Purchase & Tender procedures and E-filing of Information.
UNIT-2 15 hrs
E-governance implementations: Software and Hardware required for E-governance, Implementation, E-governance in a Small Office, Web Portal for E-governance , E- governance for Public utilities,
UNIT-3 15 hrs
E-governance in a Medium Enterprise, E-governance & Finance, E-Tender & Web E-governance, Efforts of State Governments , State Govt Models, National and Inter national Models.
Reference Books:
1. Professional Office Procedure by Susan H Cooperman, Prentice Hall
Information Technology: Principles ,
2. Public Information Technology and E-Governance: Managing the Virtual State (Paperback) by G. David Garson
3BCA3: OPERATING SYSTEMS
UNIT-1
Introduction (15 Hours)
Operating System, Simple Batch Systems, Multi programmed Batched Systems, Time-Sharing Systems, Real-Time Systems, System Components, Operating system services
File System
File concept, Access Methods, Directory Structure, File-System Structure, Allocation Methods, Free-Space Management, and Protection of file system.
Process
Process Concept, Process Scheduling, Cooperating process, Threads
CPU Scheduling
Basic concepts, Scheduling criteria, Scheduling algorithms
UNIT-II
Process Synchronization (15 Hours)
The Critical section problem,Synchronization Hardware, Semaphores, Classical Problems of Synchronization
Deadlocks
Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection , Recovery from Deadlock
UNIT-III
Memory Management (15 Hours)
Logical versus physical address space, Swapping, Contiguous Allocation, Paging, Segmentation
Virtual Memory
Demand Paging, Page Replacement, Page-Replacement Algorithms, Allocation of Frames
Text Books
1.Operating System Concepts – 5th edition by Abraham Silberschartz and Peter Galvin, McGraw Hill, 2000
Reference Books
1. Operating System Design and Implementation by Andrew S Tanenbaum - Prentice Hall India, 1990.
2. Operating system principles by Brinch Hansen. P., PHI.
3.Operating systems by Milan Milenkovic., McGraw Hill.
4.Logical design of operating systems by Show.A., PHI.
Text Books:
- Object Oriented Programming with C++ - E. Balagurusamy.
Reference Books:
- OOPS and C++ by Robert Lafore.
- C++ by Stephen Prata.
- Teach yourself c++ by Al Stevens.
- C++ Primer by Stanley B Lippman.
3BCA7: Microprocessor Lab.
Exercises should be based on 3BCA5.
3BCA8: Object Oriented Programming Lab with C++
Exercises should be based on 3BCA6.
IV SEMESTER
4BCA1:£Á®Ì£ÉÃAiÀÄ ¸É«Ä¸ÀÖgï
¥ÀwæPÉ 4: ¸À«¸ÀÛgÀ – C«¸ÀÛgÀ ¥ÀoÀåUÀ¼ÀÄ ªÀÄvÀÄÛ ªÁtÂdå PÀ£ÀßqÀ – 2
(ªÁgÀPÉÌ 4 UÀAmÉUÀ¼À ¥ÁoÀ, 3 UÀAmÉUÀ¼À ¥ÀjÃPÉë, ¥ÀjÃPÁë CAPÀUÀ¼ÀÄ 80, DAvÀjPÀ ªÀiË®åªÀiÁ¥À£À CAPÀUÀ¼ÀÄ 20)
¸Á»vÀå WÀlPÀ: ¸À«¸ÀÛgÀ ¥ÀoÀå: ªÁgÀPÉÌ 2 UÀAmÉUÀ¼À ¥ÁoÀ: 40 CAPÀUÀ¼ÀÄ
¥ÀoÀå 1: PÀxÀPÀªÀ£À: (ªÁgÀPÉÌ 2 UÀAmÉUÀ¼ÀAvÉ ¸É«Ä¸ÀÖgïUÉ 20 UÀAmÉUÀ¼À ¥ÁoÀ)
PÀxÀPÀªÀ£ÀUÀ¼ÀÄ – 2
¥Àæ: ªÉÄʸÀÆgÀÄ «±Àé«zÁ央AiÀÄ ¥ÀæPÀluÉ
¤UÀ¢vÀ 5 PÀxÀ£À PÀªÀ£ÀUÀ¼ÀÄ
- ªÀÄgÀ¸ÀĨÉÃmÉ – PÀĪÉA¥ÀÄ
- vÁ£Áf – PÀĪÉA¥ÀÄ
- ¥ÀævÁ¥À¹AºÀ – PÀĪÉA¥ÀÄ
- AiÀÄzÀÄVjAiÀÄ ªÀiË£À«PÁ¸À – «.PÀÈ. UÉÆÃPÁPï
- vÁAiÀĪÀé£À ¸ÀªÀiÁ¢ü - ¥ÀÄ.w.£À
¸Á»vÀå WÀlPÀ: C«¸ÀÛgÀ ¥ÀoÀå: ªÁgÀPÉÌ 1 UÀAmÉ ¥ÁoÀ: 20 CAPÀUÀ¼ÀÄ
¥ÀoÀå: 2 - ¸ÀtÚ PÀxÉ (ªÁgÀPÉÌ 1 UÀAmÉAiÀÄAvÉ ¸É«Ä¸ÀÖgïUÉ 10 UÀAmÉUÀ¼À ¥ÁoÀ)
¸ÀtÚ PÀxÉUÀ¼ÀÄ – 2: ªÉÄʸÀÆgÀÄ «±Àé«zÁ央AiÀÄ ¥ÀæPÀluÉ
¤UÀ¢vÀ 4 PÀxÉUÀ¼ÀÄ
- ¥ÀæPÀÈw – AiÀÄÄ.Dgï.C£ÀAvÀªÀÄÆwð
- PÀ°è£À PÉƼÀ®Ä – ZÀzÀÄgÀAUÀ
- vÀªÀÄAzsÀzÀPÉÃqÀÄ – CªÀÄgÉñÀ £ÀÄUÀqÉÆÃtÂ
- ºÀ§â ªÀÄvÀÄÛ §° - ©.n. ®°vÀ£ÁAiÀÄPï
¨sÁµÁ WÀlPÀ: ªÁtÂdå PÀ£ÀßqÀ – 2 : (ªÁgÀPÉÌ 1 UÀAmÉAiÀÄAvÉ ¸É«Ä¸ÀÖgïUÉ 10 UÀAmÉUÀ¼À ¥ÁoÀ, 20 CAPÀUÀ¼ÀÄ)
- ªÀåªÀºÁgÉÆÃfÓêÀ£À ¥ÀvÀæ
- ¥Àj¥ÀvÀæ
- ºÀÄzÉÝUÀ¼À eÁ»ÃgÁvÀÄ, C¨sÀåxÀð£À ¥ÀvÀæ, £ÉêÀÄPÁw ¥ÀvÀæ
- ªÀgÀ¢UÀ¼ÀÄ
- ¸ÀAPÉëÃ¥À ¯ÉÃR£À (ªÁtÂdå – DyðPÀ «µÀAiÀÄPÉÌ ¸ÀA§A¢ü¹zÀAvÉ)
¨sÁµÁ WÀlPÀ - ¥ÀgÀªÀıÀð£À UÀæAxÀUÀ¼ÀÄ
- PÀbÉÃj PÉʦr – PÀ£ÀßqÀ DzsÀåAiÀÄ£À ¸ÀA¸ÉÜ, ªÉÄʸÀÆgÀÄ «±Àé«zÁ央AiÀÄ
- DqÀ½vÀ PÀ£ÀßqÀ – JZï.J¸ï. PÀȵÀÚ¸Áé«Ä CAiÀÄåAUÁgï
- ªÁåªÀºÁj PÀ£ÀßqÀ – JZï.J¸ï. PÀȵÀÚ¸Áé«Ä CAiÀÄåAUÁgï
- ªÀiÁzÀj PÀbÉÃj PÉʦr – PÀ£ÀßqÀ ªÀÄvÀÄÛ ¸ÀA¸ÀÌøw ¤zÉÃð±À£Á®AiÀÄ, ¨ÉAUÀ¼ÀÆgÀÄ
- DqÀ½vÀ ¨sÁµÉ – PÉ®ªÀÅ «ZÁgÀUÀ¼ÀÄ - ¥ÀæzsÁ£ï UÀÄgÀÄzÀvÀÛ
- ¯ÉÃR£À PÀ¯É – J£ï. ¥ÀæºÁèzÀgÁªï
4BCA2:Computer Graphicsand Multimedia
UNIT-1
Raster Graphics Algorithm for 2D primitives (15 Hours)
Introduction - Output Technology - Raster and Vector display system, Software portability and Graphic Standards, Conceptual Framework of Interactive Graphics
Scan converting – lines, circles, and ellipses, Filling rectangles, polygons, ellipse arcs, pattern filling, Thick primitives, Line Style, Pen Style, Clipping in a Raster World, Clipping lines, circles, ellipses and polygons, Generating characters.
UNIT-II
2D Graphics (18 Hours)
2D transformations, Homogenous coordinates, Matrix representation of 2D transformation, Composition of 2D transformation, Window to Viewport transformation
3D Graphics
Matrix representation of 3D transformation, Composition of 3D transformation, Transformations as change in coordinate systems
UNIT-III
Multimedia (12 Hours)
Introduction, Multimedia data streams, sound and audio file formats, images and graphics file formats, data compression and optical storage media
Text Books
- Foley J.D Van Dan A. Fundamentals of interactive computer Graphics, Addison Wasley.
- Multimedia Computing, communication and application by Rolfsteinmetz, Redson Education
Reference Books
1. Hearn. D Baker P.M COMPUTER GRAPHICS (PHI)
2. Rogers D.F Adam J: Mathematical Elements for Computer Graphics, McGraw Hill
3. Harrington D: Computer Graphics –A programming approach, Tata McGraw Hill
4. Foley, J.D Van Dam A, Feiner S.K. and Hughes; Computer Graphics principles and practice, Addison Wesley
5. Giloi W.K: Interactive computer graphics, prentices Hall
6. Newman W, Sproul R.F: Principles of Interactive computer Graphics, McGraw Hill
7. Rogers D.F Procedural Elements of computer Graphics.
10. Satish Gupta, Main Stream Multimedia, Van No stand 1993
11. Robert Jennings, Windows 3.1 Multimedia, Que Corporation 1992.
4BCA4: Database Management Systems
UNIT-1
Introduction to Database System Concepts and Architecture (15 Hours)
Databases and Database Users, Characteristics of the Database Approach, Advantages of Using a DBMS, Implications of the Database Approach
Data Models, Schemas, and Instances, DBMS Architecture and Data Independence, Database Languages and Interfaces, The Database System Environment, Classification of Database Management Systems
Data Modeling Using the Entity-Relationship Model
High-Level Conceptual Data Models for Database Design, Entity Types, Entity Sets, Attributes, and Keys, Relationships, Relationship Types, Roles, and Structural Constraints, Weak Entity Types, ER Diagrams, Naming Conventions, and Design Issues