BCA SYLLABUS
BCA SYLLABUS
BANGALORE UNIVERSITY
NEP2021 Scheme
BANGALORE UNIVERSITY
BCA SYLLABUS (NEP)
[Based on I-C. Model of Karnataka State Higher Education Council]
Semest Course Title of the Paper Credits Languages, Skill Credits Total
er Code Enhancement (SEC), and Credits
Ability Enhancement
Courses (AECC)
NCC/NSS/CL/R&R 1
NCC/NSS/CL/R&R 1
NCC/NSS/CL/R&R 1
Semest Course Title of the Paper Credits Languages, Skill Credits Total
er Code Enhancement (SEC), and Credits
Ability Enhancement
Courses (AECC)
Reference Books:
1. Kenneth H Rosen. Discrete Mathematics and its Applications, McGraw-Hill publications, 7th edition,
2007.
2. J. P. Tremblay and R.P. Manohar. Discrete Mathematical Structures with applications to Computer
Science, Mc Graw Hill Ed. Inc. 1975.
3. Charles G Cullen. Matrices and Linear Transformations, Dover Publications Inc., Second Edition, 1990
Web Resources:
1. https://www.my-mooc.com/en/categorie/mathematics
2. http://www.nptelvideos.in/2012/11/discrete-mathematical-structures.html
3. https://ocw.mit.edu/courses/mathematics/
6 of 15
Text Books:
1. R.G.Dromey, “How to Solve it by Computer”, Pearson Education India, 2008.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to
Algorithms”, 3rd Edition, The MIT Press Cambridge, Massachusetts London, England, 2008
3. Brain M. Kernighan, and Dennis M. Ritchie, “The C Programming Language”, 2nd edition, Princeton
Hall Software Series, 2012.
Reference Books:
1. Steven S. Skiena, “The Algorithm Design Module”, 2nd Edition, Springer-Verlag London Limited, 2008.
2. Donald E. Knuth, The Art of Computer Programming”, Volume 1: Fundamental Algorithms, 3rd Edition,
Addison Wesley Longman, 1997.
3. Donald E. Knuth, The Art of Computer Programming”, Volume 2: Seminumerical Algorithms, 3rd
Edition, Addison Wesley Longman, 1998.
4. Greg Perry and Dean Miller, “C programming Absolute Beginner’s Guide”, 3rd edition, Pearson
Education, Inc, 2014.
Web Resources:
1. http://algorithmsforinterviews.com “Algorithms for Interviews”
7 of 15
Text Books:
1. Seymour Lipschutz, “Data Structures with C”, Schaum’s outLines, Tata Mc Graw Hill, 2011.
2. Robert Kruse, C.L.Tondo, Bruce Leung,Shashi Mogalla,“Data Structures and Program Design using C”,
Pearson Education, 2009.
ReferenceBooks:
1. Mark Allen Weiss,“ Data Structures and Algorithm Analysis in C”, Second Edition, Pearson Education,
2013.
2. Forouzan,“A Structured Programming Approach using C”,2nd Edition, Cengage LearningIndia,2008.
8 of 15
NOTE: For all the programs write the output, flowchart and number of basic operations performed.
1. Given {4,7,3,2,1,7,9,0} find the location of 7 using Linear and Binary search and also display its first
occurrence.
2. Given {5,3,1,6,0,2,4} order the numbers in ascending order using Bubble Sort Algorithm
3. Perform the Insertion and Selection Sort on the input {75,8,1,16,48,3,7,0} and display the output in
descending order.
4. Write a program to insert the elements {61,16,8,27} into singly linked list and delete 8,61,27 from the
list. Display your list after each insertion and deletion.
5. Write a program to insert the elements {61,16,8,27} into linear queue and delete three elements from the
list. Display your list after each insertion and deletion.
6. Write a program to insert the elements {61,16,8,27} into circular queue and delete 4 elements from the
list. Display your list after each insertion and deletion.
7. Write a program to insert the elements {61,16,8,27} into ordered singly linked list and delete 8,61,27
from the list. Display your list after each insertion and deletion.
9. Write a program to push 5,9,34,17,32 into stack and pop 3 times from the stack, also display the popped
numbers.
11. Write a program to inert the elements {5,7,0,6,3,9} into circular queue and delete 6,9&5 from it(using
linked list implementation)..
12. Write a program to convert an infix expression x^y/(5*z)+2 to its postfix expression
14. Write a program to create a binary tree with the elements {18,15,40,50,30,17,41} after creation insert 45
and 19 into tree and delete 15,17 and 41 from tree. Display the tree on each insertion and deletion
operation
15. Write a program to create binary search tree with the elements {2,5,1,3,9,0,6} and perform inorder,
preorder and post order traversal.
16. Write a program to Sort the following elements using heap sort {9.16,32,8,4,1,5,8,0}
17. Given S1={“Flowers”} ; S2={“are beautiful”} I. Find the length of S1 II. Concatenate S1 and S2 III.
Extract the substring “low” from S1 IV. Find “are” in S2 and replace it with “is”
10 of 15
TEXT BOOKS:
1. Mano M Morris, ”Computer System Architecture”, 3rd edition Pearson India(2019).
2. William Stallings, “Computer Organization and Architecture designing for performance”, 10th
edition, Pearson(2016)
REFERENCE BOOKS
1. Subrata Ghoshal, “Computer Architecture And Organization”, Pearson India(2011).
2. Andrew S. Tanenbaum “ Structured Computer Organization”, 5th edition, Pearson Education
Inc(2006).
3. Carl Hamacher, Zvonks Vranesic,SafeaZaky, “Computer Architecture And Organization”, 5th edition
McGraw Hill New Delhi,India(2002).
4. Kai Hwang, “Advanced Computer Architecture - Parallelism, Scalability, Programmability”, Tata
Mcgraw-Hill (2008).
11 of 15
Textbooks:
1. E. Balagurusamy, Programming with JAVA, McGraw Hill, New Delhi, 2007
Reference Books:
1. Raj Kumar Buyya, Object Oriented Programming with JAVA, McGraw Hill, 2009
2. Herbert Schildt, Java A Beginner’s Guide – Create, Compile, and Run Java Programs Today, Sixth
Edition, Oracle Press, 2014
3. Ken Arnold, James Gosling, “The Java Programming Language, Fourth Edition, Addison Wisely, 2005
4. Herbert Schildt, ‘The Complete Reference Java, 7th Edition, McGraw Hill, 2007
Web Resources
1. https://docs.oracle.com/javase/tutorial/
2. https://javabeginnerstutorial.com/core-java-tutorial/
12 of 15
Text Books:
1. Elmasri and Navathe: Fundamentals of Database Systems, 7th Edition, Addison -Wesley, 2016.
2. Silberschatz, Korth and Sudharshan Data base System Concepts, 7th Edition, Tata McGraw Hill, 2019.
References:
1. C.J. Date, A. Kannan, S. Swamynatham: An Introduction to Database Systems, 8th Edition, Pearson
education, 2009
2. Database Management Systems :Raghu Ramakrishnan and Johannes Gehrke: , 3rd Edition, McGraw-
Hill, 2003
13 of 15
PART – A
1. Draw E-R diagram and convert entities and relationships to relation table for a given scenario.
Two assignments shall be carried out i.e. consider two different scenarios (eg. bank, college)
Database.
4. For a given set of relation schemes, create tables and perform the following Simple Queries, Simple
Queries with Aggregate functions, Queries with Aggregate functions (group by and having clause).
b. Find the sum of the salaries of all employees of the ‘Accounts’ department, as well as the maximum
salary, the minimum salary, and the average salary in this department
8. For each Department that has more than five employees, retrieve the department number and number of
employees who are making salary more than 40000.
9.For each project on which more than two employees work, retrieve the project number, project name and
the number of employees who work on that project.
15 of 15
10. For a given set of relation tables perform the following: Creating Views (with and without check option),
Dropping views, Selecting from a view
PART B
Create the following tables with properly specifying Primary keys, Foreign keys and solve the following
queries.
2. a. List the details of Students who are all studying in 2nd sem BCA.
b. List the students who are not borrowed any books.
4. a. Display the student details who borrowed more than two books.
b.Display the student details who borrowed books of more than one Author.
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 LAN’s 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