Documente Academic
Documente Profesional
Documente Cultură
I to VI Semesters
Revised w.e.f.
Page 6 of 38
FIRST SEMESTER BCA
BCA102T : ENGLISH
Syllabus as per the one prescribed for science courses of Bangalore University.
Page 7 of 38
1. Ashok N. Kamthane et. al., Computer Programming and IT, Pearson Education,
2011
2. Mahapatra, Thinking In C , PHI Publications, 1998.
3. Yashwant Kanetkar, Let Us C, 13th Edition, PHP, 2013.
Page 8 of 38
Unit III
Number Systems: Introduction to number systems positional and non-positional, Base
/Radix. Decimal number system-Definition, digits, radix/base, Binary number system
Bit Byte, Conversions: Binary to Decimal and Decimal to Binary. Octal number system-
Conversion from Octal to Decimal to Octal, Octal to Binary and binary to Octal.
Hexadecimal number system Conversion : Decimal to Hex, Hex to decimal, Hex to
Binary, Binary to Hex, Octal to Hex, Hex to Octal, Binary, arithmetic binary addition,
subtraction, multiplication and division (only Integer part). 1s and 2s compliment: 2s
complement subtraction. Binary code: BCD numbers, 8421 code, 2421 code- examples
and applications. Gray code Conversions-Gray to binary and Binary to Gray,
application of gray code (Mention only). Excess-3 code self complimenting property
and applications. Definition and nature of ASCII code. Introduction to error detection
and correction code, parity check. Boolean algebra:-Laws and theorems. AND, OR,
NOT Laws, Commutative law, associative law, distributive law, Duality theorem.
Demorgans theorems-Statements, proof using truth tables; Simplification of Boolean
expressions using Boolean laws. Definition of product term, sum term, minterm,
maxterm, SOP, standard POS and Standard POS. Conversion of Boolean expression to
Standard SOP and Standard POS forms. Karnaugh maps-Definition of Karnaugh map,
K- map for 2, 3 and 4 variables. Conversion of truth tables into k-map grouping of cells,
redundant groups and dont care conditions Karnaugh map technique to solve 3 variable
and 4 variable expressions. Simplification of 3 and 4 variable Boolean expression using
K-maps (SOP only)
[ 12 Hours ]
Unit - IV
Logic Gates: AND Gate: Definition, symbol truth table, timing diagram, Pin diagram of
IC 7408. OR Gate: Definition, symbol, truth table, timing diagram of IC 7432. NOT
Gate: Definition symbol, truth table, timing diagram, Pin diagram of IC 7404. NAND
Gate: Definition, symbol, truth table, Pin diagram of IC 7400, NOR Gate: Definition,
symbol, truth table, timing diagram, Pin diagram of IC 7402. Exclusive OR Gate:
Definition, symbol, truth table, timing diagram. Combinational logic circuits: Definition,
applications. Half Adder: Symbol, Logic circuits using XOR and basic gates, Truth table,
Full Adder: Symbol, Logic circuits using XOR and basic gates, Truth table, Half
Subtractor: Symbol, Logic circuits using XOR and basic gates, Truth table. Full
Subtractor: Symbol, Logic circuits using XOR and basic gates, Truth table. Adder
Subtractor; Logic circuit, Pin diagram IC 7483, IC 7486. Parallel Adder: 4 bit parallel
binary adder, BCD adder, IC 7483 NAND NOR implementation of Adders.
[ 12 Hours ]
Unit - V
Sequential Circuits: Importance of clock in digital circuit and introduction to flip flop.
Flip flop-difference between latch and flip-flop. Qualitative study of level and edge
triggering. RS latch /unlocked, symbol and truth table. RS flip-flop using NAND gate,
symbol, truth table and timing diagram. D flip flop Symbol, truth table, Realization of
JK flip flop using NAND gates, working, and timing diagram. Race around condition,
present and clear inputs, pin diagram of IC 74112. T flip flop-Logic symbol, JK flip flop
as a T flip flop truth table and timing diagram. Master slave flip flop; Logic circuit,
truth table and timing diagram, advantage of M/S flip-flop, pin diagram of IC 7473 IC
7476. Registers: Definition, types of registers-Serial in serial out, serial in parallel out,
Parallel in serial out, Parallel in parallel our shift register (Block diagram representation
for each), truth table, timing diagram and speed comparison.
[ 12 Hours ]
Page 9 of 38
Text Books:
1) Thomas L.Floyd ,Digital Fundamentals, Peason Education Inc, New Delhi,
2003
Reference Books:
1) Morris Mano, Digital Design, 5Th Edition, Prentice Hall, 2013
2) R.P.Jain, Modern Digital Electronics, 3rd Edition, Tata Mc Graw Hill, 2003.
3) Bignell and Donovan, Digital Electronics, 5th Edition, Thomson Publication,
2007.
Page 10 of 38
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
1. Grewal, B.S.Higher engineering Mathematings, 36th Edition
Reference Books
1. Satyrs S.S, Engineering Mathematics.
2. Peter V.ONeil. Advanced Engineering Mathematics, 5th Edition.
BCA202T: ENGLISH
Syllabus as per the one prescribed for science courses of Bangalore University.
Page 12 of 38
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, Schaums outLines, Tata
McGraw-Hill, 2011.
REFERENCES BOOKS
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Second
Edition, Pearson Education, 2013.
2. Robert Kruse, C.L.Tondo, Bruce Leung, Shashi Mogalla, Data Structures and
Program Design using C, Pearson Education, 2009.
3. Forouzan, A Structured Programming Approach using C, 2nd Edition, Cengage
Learning India, 2008.
Page 15 of 38
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
Page 17 of 38
CATLOG(book-id: int, title : string, author-id: int, publisher-id: int, category: int, year:
int, price: int)
CATEGORY(category-id: int, description: string)
ORDER-DETAILS(order-no: int, book-id: int, quantity: int)
i) Create above tables by properly specifying the primary keys and the foreign keys.
ii) Enter atleast five tuples for each relation.
iii) Give the details of the authors who have 2 or more books in the catalog and the price
of the books is greater than the average price of the books in the catalog and the year
of publication is after 2010.
iv) Find the author of the book which has maximum sales.
v) Demonstrate how to increase price of books published by specific publisher by 10%
7. Consider the following database for BANK.
BRANCH(branch-name: string, branch-city: string, assets: real)
ACCOUNT(accno: int, banch-name: string, balance: real)
DEPOSITOR(customer-name: string, accno: int)
CUSTOMER(customer-name: string, customer-street: string, customer-city: string)
LOAN(loan-no: int, branch-name: string, amount: real)
ORROWER(customer-name: string, loan-no: int)
i) Create the above tables by properly specifying the primary keys and foreign keys.
ii) Enter atleast five tuples for each relation.
iii) Find all the customers who have atleast two accounts at the main branch.
iv) Find all customer who have an account at all the branches located in a specific city.
v) Demonstrate how t0 delete all account tuples at every branch located in specific city.
8. Consider the following database for ORDER PROCEESING.
CUSTOMER(cust-no: int, cname: string, city: string)
ORDER(orderno: int, odate: date, ord-amt: real)
ORDER_ITEM(orderno: int, itemno:int, qty: int)
ITEM(itemno: int, unitprice: real)
SHIPMENT(orderno: int, warehouseno: int, ship-date: date)
WAREHOUSE(warehouseno: int, city: 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) List the order number and ship date for all orders shipped from particular warehouse.
Page 18 of 38
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
BCA302T: ENGLISH
Syllabus as per the one prescribed for science courses of Bangalore University.
Page 21 of 38
Unit - III
Memory Management: Logical and Physical address space, Swapping, Contiguous
allocation, Paging, Segmentation, Segmentation with paging in Mastics and Intel 386,
Virtual memory-Demand paging and its performance, Page replacement algorithms,
Allocation of frames, thrashing, page size and other considerations. Demand
Segmentation.
[ 13 Hours ]
Unit - IV
File management (Systems, Secondary Storage Structure): File Concepts, Access
methods, Directory Structure, Protection and consistency, File system structure,
Allocation methods, Free space management, Directory Implementation, Efficiency and
Performance, Recovery. Disk Management (Structure, Disk Scheduling Methods): Disk
Structure & Scheduling methods, Disk management, Swap Space management.
[ 13 Hours ]
Unit - V
Protection and Security: Goals of protection, Domain Protection, Access matrix, Security
Problem, Authentication, One time password, program threats, System threads.
Case Study of Windows and Linux Operating System
[ 13 Hours ]
Text Books:
1. Abraham Silberschatz and Peter Baer Galvin, Operating System Concepts, 7th
Edition, Pearson Education, 2002.
Reference Books:
1. H.M.Deitel, Operating Systems, Pearson Learning Solutions, 3rd Edition, 2003.
2. William Stallings, Operating Systems, 6th Edition, Pearson Education, 2010.
3. Stuart, Operating systems: Principles, Design and Implementation, 1st Edition
2008, Cengage Learning India
Page 22 of 38
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
BCA402T: ENGLISH
Syllabus as per the one prescribed for science courses of Bangalore University.
Page 23 of 38
Unit - III
OOP methods and properties of an object, class Modules , Encapsultation and Inheritance
characteristics Dynamic Link Libraries (DLLs) and Windows API ; Designing Help files
; File handling Sequential ,Random access and Binary files, Database connectivity
DAO and ADO Tables and Queries, ActiveX Data objects.
[ 12 Hours ]
Unit IV
Visual C++ Programming: Objects-Classes-VC++Components Resources-Event
Handling Menus Dialog Boxes Importing VBX Controls Files MFC File
Handling Document View Architecture Serialization.
[ 12 Hours ]
Unit V
Interfacing Other Applications Multiple Document Interface (MDI) Splitter Windows
Exception Handling Debugging Object Linking and Embedding (OLE) Database
Application DLL- ODBC.
[ 12 Hours ]
Text Books:
1. Gurumit Singh, Visual Basic 6, First Edition, Firewall Media, 2007.
Reference Books:
1. Charles Petzold, Windows Programming, 5th Edition, Microsoft Press, 1999.
2. Steve Holzner, Visual C++ Programming, Second Edition, PHI, 1994.
3. Go ttfried, Programming with Visual Basic 6, PHI, 2000.
Page 25 of 38
FIFTH SEMESTER BCA
Unit I
Introduction: Communication Network and services, Approaches to Network Design,
Network Functions and Network Topology, Message ,packet and circuit Switching ,
Internet, Packet Switching ; Key factors in Communication Network Evolution ;
Layered Architecture and Applications Examples of Layering , OSI Reference Model,
TCP/IP Model Telnet FTP and IP Utilities. Digital Transmission: Digital Representation
of Information: Properties of digital transmission: Characterization of Communication
Channels Frequency Domain and Time Domain : Fundamental limits in Digital
Communication The Nyquist Signalling rate, The Shannon channel capacity : Line
coding , Modems & digital Modulations
[ 12 Hours ]
Unit - II
Transmission Systems: properties of media and digital transmission Systems Twisted
Pair , Coaxial Cable, Optical Fibre, Radio Transmission Intrared Light Error detection
and correction Error detection , Two dimensional parity checks , Internet checksum ,
Polynomial code; standardized Polynomial codes , Error detecting capability of a
polynomial code, Multiplexing frequency Division , Time Division , SONET;
Wavelength Division Multiplexing Circuit switches; Telephone network , signalling
Traffic and Overload control in Telephone networks Concentration, Routing Control,
Overload controls Cellular Telephone Networks, Satellite Cellular networks.
[ 12 Hours ]
Unit III
Peer to-Peer Protocols:- Peer-to peer Protocols and service models ARQ Protocols stop
and wait , Go back-N Selective Repeat , Transmission efficiency of ARQ Protocols,
Other adaptation functions , - Sliding window flow control Timing Recovery in
Synchronous Services Reliable Stream Service, Data Link Control, HDLC, PPP ;
Statistical Multiplexing.
[ 12 Hours ]
Unit - IV
Local Area Networks and Medium access Control Protocols:- Multiple access
communications; Local Area network LAN Structure, MAC Sublayer, Logical link
control layer, Random Access protocols ALOHA , Slotted ALOHA, CSMA, CSMA/CD,
Scheduling approaches to medium access control Reservation Systems, polling , Token
passing rings, comparison of Random access & Scheduling access control Comparison of
Radom access & SHEDULING MEDIUM access controls; Channelization FDMA,
TDMA, CDMA;
[ 12 Hours ]
Unit - V
LAN Standard Ethernet and IEF, 802.3 LAN Standard ; Token Ring and IEEE 8025
LAN standard , FDDI, Wireless LANs and IEEE 802.11 Standards; LAN Bridges
Transparent Bridges , Source Routing Bridges , Mixed media Bridges. Packet
Switching Networks :- Network services & Internal Network Operation; Packet Network
Topology; Datagrams & VIRTUAL circuits ; structure of switch/ Router, Connectionless
packet switching ; Virtual Circuit packet switching ; Overview of Routing and
congestion in packet networks Routing algorithms classification , Routing tables,
Page 26 of 38
shortest path routing algorithms, Flooding , Hierarchical routing , Distance vector routing
Link state routing , congestion control algorithms. [ 12 Hours ]
Text Books:
1. Stallings, Data and Computer Communications, 7th Edition,Pearson Education, 2012
Reference Books:
1. Andrew S Tanenbaim, Computer Networks, 4th Edition, Pearson Education.
2. Behrouz Ferouzan, Introduction to Data Communication & Networking TMH, 1999.
3. Larry &Peterson & Bruce S Davis; Computer networks Second Edition , Morgan
Kaufman, 2000.
Text Books:
1. A.Balaguruswamy, Programming with JAVA, A Primer, TMH, 1999.
Reference Books:
1. Thomas Boutel, CGI programming in C and Perl, Addison Wesley, 1996.
2. Jefry Dwight et al, Using CGI, Second Edition, Prentice Hall, India, 1997.
3. Patrick Naughton & Herbert Schildt, JAVA 2: The Complete Reference, THM,
1999.
4. Schildt, JAVA The Complete Reference, 7th Edition.
Page 31 of 38
BCA505P: ASSEMBLY LANGUAGE PROGRAMMING LAB
PART - A
1. Exchange of two 16-bit numbers.
2. Addition & Subtraction of two 8 bit HEX numbers.
3. Subtraction of two 16 bit numbers.
4. Two n-byte Number addition.
5. Block Transfer.
6. N Decimal Number addition.
7. 4-Digit BCD addition.
8. Subtraction of 16 bit number.
9. Sorting of array in ascending order.
10. Multiplication of 2 digit BCD
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
BCA506P : PROJECT
Students can develop a project in team (maximum three members). They should
implement their project in college in any RDBMS package or any language available in
the college. The students have to collect data outside practical hours. Project may be
taken outside but must be implemented in the college. Internal marks can be awarded by
the guide by evaluating the performance of the students during the course of project
work. In viva-voce the questions must be directed only on the project work to access the
involvement and understanding of the problem by the students.
The project carries 100 marks is distributed as follows:
Demonstration and Presentation 65 Marks
Viva-voce 25 Marks
Project Report 10 Marks
Text Book:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata
Theory, Languages and Computation, 3rd Edition, Pearson Education, 2011.
Reference Books:
1. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition,
Tata McGraw-Hill, 2007.
2. Daniel I.A. Cohen: Introduction to Computer Theory, 2nd Edition, John Wiley &
Sons, 2009.
3. Thomas A. Sudkamp: An Introduction to the Theory of Computer Science,
Languages and Machines, 3rd Edition,Pearson Education, 2006
Page 33 of 38
Unit - III
MACRO LANGUAGE AND THE MACRO PROCESSOR: Macroinstruction, Features
of macro Facility, Macro instruction arguments, conditional macro Expansion, macro
calls within macros, macro Instructions defining macros, Implementation, Statement of
problem, implementation of a restricted facility, A two pass algorithm. A single pass
algorithm, implementation of macro calls within macros. Implementation within an
assembles.
[ 12 Hours ]
Unit - IV
LOADERS: Loader schemes, Compile & go, General loading Scheme, absolute loaders,
Subroutine Languages, Relocating loaders, Direct linking loaders, other loading Schemes
Binders, linking loaders, Overlays, Dynamic binders. Design of absolute loader, Design
of a Direct linking loader Specification of problem, Specification of data structure,
format of data bases algorithm.
[ 12 Hours ]
Unit - V
COMPILERS: Statement of problem, Problem1: Recognizing basic Elements, Problem2:
Recognizing Syntactic cutis & interpreting meaning, Problem3: Storage Allocation,
Problem4: Code Generation. Optimization (machine independent) optimization (machine
dependent), Assembly Phase, General Model of complier. PHASES OF COMPILERS:
Simple Structure of Compiler, Brief introduction to 7 Phases of Compliers.
[ 12 Hours ]
Text Books:
1. John J. Donowon, System Programming, TATA McGraw-Hill.
Reference Books:
1. Dhamdhere: System programming and Operating System TMH
2. Beck: System Software, 3/e Pearson Education.
Page 37 of 38
BCA605P : PROJECT WORK
Students should individually develop a project. They should implement their project in
college in any RDBMS package or any language available in the college. The project
should web based. The students have to collect data outside practical hours. Project may
be taken outside but must be implemented in the college. Internal marks can be awarded
by the guide by evaluating the performance of the students during the course of project
work. In viva-voce the questions must be directed only on the project work to access the
involvement and understanding of the problem by the students.
The project carries 200 marks is distributed as follows:
Demonstration and Presentation 130 Marks
Viva-voce 50 Marks
Project Report 20 Marks
*********
Page 38 of 38