BENGALURU CITY UNIVERSITY

CHOICE BASED CREDIT SYSTEM

(Semester Scheme with Multiple Entry and Exit Options for

Under Graduate Course- as per NEP 2020)

Syllabus for B.Sc. Computer Science

(III & IV Semester)

2022-23 onwards
!

2
 Semest Course Title of the Paper Credits Languages, Skill Credits Total
er Code Enhancement (SEC), and Credits
Ability Enhancement
Courses (AECC)

I CS-C1T Problem Solving Techniques 4 OE1: Open Elective 3 25

CS-C2P Problem Solving Lab using C HLL 2 Language L1 3

XX Other Option Theory 4 Language L2 3

XX Other Option LAB 2 SEC I : 2

Physical Education 1

Health & Wellness 1

II CS-C3T Data Structure 4 OE2: Open Elective 3 25

CS-C4P Data Structures Lab 2 Language L1 3

XX Other Option Theory 4 Language L2 3

XX Other Option LAB 2 Environmental studies 2

Physical Education 1

NCC/NSS/CL/R&R 1

III CS-C5T Object Oriented Programming 4 OE3: Open Elective 3 25

using Java

CS-C6P Java Lab 2 Language L1 3

XX Other Option Theory 4 Language L2 3

XX Other Option LAB 2 SEC II : 2

Physical Education 1

NCC/NSS/CL/R&R 1

IV CS-C7T Operating Systems 4 OE4: Open Elective 3 25

CS-C8P Linux Lab 2 Language L1 3

XX Other Option Theory 4 Language L2 3

XX Other Option LAB 2 The Constitution of India 2

Physical Education 1

NCC/NSS/CL/R&R 1

V CS-C9T Database Management System 3 Vocation Course I : 3 22

Other Option (Major)

CS-C10T Arti cial Intelligence 2 SEC III : 2

CS-C11P Database Management System 3 Physical Education 1

Lab

CS-C12P Arti cial Intelligence Lab 2 NCC/NSS/CL/R&R 1

XX Other Option (Minor) LAB 3

XX Other Option (Minor) LAB 2

3
fi
fi
Semest Course Title of the Paper Credits Languages, Skill Credits Total
er Code Enhancement (SEC), and Credits
Ability Enhancement
Courses (AECC)

VI CS-C13T Python Programming 3 Vocation Course I : 3 24

Technical Writing

CS-C14T Computer Networks 3 Internship 2

CS-C15P Python Programming Lab 2 SEC III : 2

CS-C16P Computer Networks Lab 2 Physical Education 1

XX Other Option (Minor) Theory 3 NCC/NSS/CL/R&R 1

XX Other Option (Minor) LAB 2

VII CS-C17T Internet Technologies 3 Elective I: 3 22

(Internet of Things,
Cloud Computing,
Data Mining,
Image Processing,
Discrete Structures,
Modeling and Simulation)

CS-C18T Data Analytics 3 Elective II : 3

(Internet of Things,
Cloud Computing,
Data Mining,
Image Processing,
Discrete Structures,
Modeling and Simulation)

CS-C19T Design and Analysis of Algorithm 3 Research Methodology 3

CS-C20P Internet Technologies Lab 2

CS-C21P Data Analytics Lab 2

VIII CA-C22T Machine Learning 3 Elective III : 3 20

(Block Chain
Technologies,
Operations Research,
Human Computer
Interface,
Parallel Algorithms)

CA-C23T Theory of Computation 3 Research Project 6

CA-C24T System Security 3

CA-C24P Machine Learning Lab 2

4
 CS-C5T: OBJECT ORIENTED PROGRAMMING USING JAVA

Total Teaching Hours: 64 No. of Hours / Week: 04

UNIT-I [16 Hours]

Introduction to Java: Basics of Java programming, Data types, Variables, Operators, Control structures
including selection, Looping, Java methods, Overloading, Math class, Arrays in java. Objects and Classes:
Basics of objects and classes in java, Constructors, Finalizer, Visibility modifiers, Methods and objects,
Inbuilt classes like String, Character, String Buffer, File, this reference

UNIT-II [16 Hours]

Inheritance and Polymorphism: Inheritance in java, Super and sub class, Overriding, Object class,
Polymorphism, Dynamic binding, Generic programming, Casting objects, Instance of operator, Abstract
class, Interface in java, Package in java, UTIL package.

UNIT-III [16 Hours]

Event and GUI programming: Event handling in java, Event types, Mouse and key events, GUI Basics,
Panels, Frames, Layout Managers: Flow Layout, Border Layout, Grid Layout, GUI components like Buttons,
Check Boxes, Radio Buttons, Labels, Text Fields, Text Areas, Combo Boxes, Lists, Scroll Bars, Sliders,
Windows, Menus, Dialog Box, Applet and its life cycle, Introduction to swing, Exceptional handling
mechanism. I/O programming: Text and Binary I/O, Binary I/O classes, Object I/O, Random Access Files.

UNIT-IV [16 Hours]

Multithreading in java: Thread life cycle and methods, Runnable interface, Thread synchronization,
Exception handling with try-catch-finally, Collections in java, Introduction to JavaBeans and Network
Programming.

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/

5
 CS-C6T: JAVA PROGRAMMING LAB

1. Write a simple java application, to print the message, “Welcome to java”

2. Write a program to display the month of a year. Months of the year should be held in an array.
3. Write a program to demonstrate a division by zero exception
4. Write a program to create a user defined exception say Pay Out of Bounds. .
5. Write a java program to add two integers and two float numbers. When no arguments are supplied,
give a default value to calculate the sum. Use function overloading.
6. Write a program to perform mathematical operations. Create a class called AddSub with methods to
add and subtract. Create another class called MulDiv that extends from AddSub class to use the
member data of the super class. MulDiv should have methods to multiply and divide A main function
should access the methods and perform the mathematical operations.
7. Write a program with class variable that is available for all instances of a class. Use static variable
declaration. Observe the changes that occur in the object’s member variable values.
8. Write a java program to create a student class with following attributes: Enrollment_id: Name, Mark
of sub1, Mark of sub2, mark of sub3, Total Marks. Total of the three marks must be calculated only
when the student passes in all three subjects. The pass mark for each subject is 50. If a candidate fails
in any one of the subjects his total mark must be declaredas zero. Using this condition write a
constructor for this class. Write separate functions for accepting and displaying student details. In the
main method create an array of three student objects and display the details.
9. In a college first year class are having the following attributesName of the class (BCA, BCom, BSc),
Name of the staff No of the students in the class, Array of students in the class
10. Define a class called first year with above attributes and define a suitable constructor. Also write a
method called best Student () which process a first-year object and return the student with the highest
total mark. In the main method define a first-year object and find the best student of this class
11. Write a Java program to define a class called employee with the name and date of appointment. Create
ten employee objects as an array and sort them as per their date of appointment. ie, print them as per
their seniority.
12. Create a package‘ student.Fulltime.BCA‘ in your current working directory
a. Create a default class student in the above package with the following
attributes: Name, age, sex. b. Have methods for storing as well as displaying
13. Write a small program to catch Negative Array Size Exception. This exception is caused when the
array is initialized to negative values.
14. Write a program to handle Null Pointer Exception and use the “finally” method to display a message to
the user.
15. Write a program which create and displays a message on the window
16. Write a program to draw several shapes in the created window
17. Write a program to create an applet and draw grid lines
18. Write a program which creates a frame with two buttons father and
mother. When we click the father button the name of the father, his age and designation must appear.
When we click mother similar details of mother also appear.

6
19. Create a frame which displays your personal details with respect to a button click
20. Create a simple applet which reveals the personal information of yours.
21. Write a program to move different shapes according to the arrow key pressed.
22. Write a java Program to create a window when we press M or m the window displays Good Morning,
A or a the window displays Good After Noon E or e the window displays Good Evening, N or n the
window displays Good Night
23. Demonstrate the various mouse handling events using suitable example.
24. Write a program to create menu bar and pull-down menus.

7
 CS-C7T: OPERATING SYSTEMS
Total Teaching Hours: 64 No. of Hours / Week: 04

UNIT - I [16 Hours]

Introduction: Computer System Organization, Architecture, Structure, Operations, Process
Management, Memory Management, Storage Management, Kernel Data Structures, Computing
Environments. Operating System Structures: Services, System Calls, Types, Operating System
Structure, System Boot. Processes: Process Concept, Scheduling, Operations, Interprocess
Communication. Multithreaded Programming: Multicore Programming, Multithreading Models.

UNIT –II [16 Hours]

Process Synchronization: The Critical-Section Problem, Peterson’s Solution, Synchronization
Hardware, Mutex Locks, Semaphores, Classic Problems of Synchronization, Monitors,
Synchronization Examples. Process Scheduling: Criteria, Scheduling Algorithms, Multi-Processor
Scheduling, Real-time CPU Scheduling. Deadlocks: System model, Characterization, Methods
for handling deadlocks, Deadlock Prevention, Avoidance, Detection and Recovery from deadlock.

UNIT – III [16 Hours]

Memory Management Strategies: Background, Swapping, Contiguous Memory Allocation,
Segmentation, Paging, Structure of the Page Table. Virtual Memory Management: Demand Paging;
Copy-on-Write, Page Replacement; Allocation of Frames; Thrashing, Memory-Mapped Files,
Allocating Kernel Memory. File System: File Concept, Access Methods, Directory and Disk
Structure, Protection. File-System Implementation: Structure, File-System and Directory
Implementation, Allocation Methods, Free Space Management, Efficiency and Performance,
Recovery. Mass-Storage Structure: Overview, Disk Scheduling, Disk Management.

UNIT - IV [16 Hours]

Protection: Goals, Principles, Domain of Protection, Access Matrix, Implementation of the Access
Matrix, Access Control, Revocation of the Access Rights. Virtual Machines: Building Blocks, Types
of VMs and their implementations. Distributed Systems: Advantages, Types of Network-based OS,
Robustness, Design Issues, Distributed File Systems. Case Studies: The Linux System, Windows
10.

Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating Systems Concepts, 9th
Edition, 2016 India, Wiley.

Reference Books:
1. William Stallings, “Operating Systems-Internals and Design Principles”, Pearson, 9th Edition, 2018
2. D M Dhamdhere: Operating Systems – A Concept Based Approach, 3rd Edition, Tata McGraw
–Hill, 2015.
3. Harvey M Deitel, Paul J Deitel, Dr Choffnes,“Operating Systems”, Pearson Education Limited,
3rd Edition, 2013.
4. J. Archer Harris, John Cordani, “ Operating Systems”, Schaum's Outline, Indian Edition, Mc
Graw Hill Education (India), First Edition.
5. Gary Nutt, Nabendu Chaki, Sarmistha Neog, “Operating Systems” Pearson Education Limited,
3rd Edition, 2016.

8
 CS-C8P: UNIX LAB
PART-A

1. Learn the use of basic UNIX commands –

a. To access information using date, history, man, who, whoami, uptime, finger,cal.
b. To display contents of files using cat, vi, more, head, tail, grep, cmp, wc
c. To manage files using cat, cp, ls, mv,rm, chmod, find
d. Process utilities using ps, pid, ppid, tty, time, kill, exit
e. Directory handling utilities using cd, mkdir, rmdir, mv, pwd

2. Write a shell script that displays list of all the files in the current directory to which the user
has read, write and execute permissions.

3. Write a shell script that accepts a list of file names as its arguments, count and reports the
occurrence of each word that is present in the first argument file on other argument files.

4. Write a shell script that accepts one or more file name as arguments and converts all of them
to uppercase, provided they exist in the current directory.

5. Write grep commands to the following:

a. To select the lines from a file that has exactly 2 characters.
b. To select the lines from a file that has more2 than one blank spaces.

6. Write a shell script which accepts two file names as arguments. Compare the contents. If
they are same, then delete the second file.

7. Write a shell script

a. to count number of lines in a file that do not contain vowels.
b. to count number of characters, words, lines in a given file.

8. Write a shell script to list all the files in a given directory.

9. Write a shell script to display list of users currently logged in.

10. Write a shell script to read three text files in the current directory and merge them into a
single file and returns a file descriptor for the new file.

PART-B

1. Write a program to copy a file into another using system calls.

9
 2. Write a program using system call: create, open, write, close, stat, fstat, lseek.

3. Write a program to create a child process and allow the parent to display “parent” and the
child to display “child” on the screen.

4. Write a program to create a Zombie process.

5. Write a program to implement inter process communication using pipes.

6. Simulate the following CPU scheduling algorithms

a. Round Robin
b. SJF
7. Write a program that illustrates file locking using semaphores.

8. Write a program that implements a producer-consumer system with two processes (using
semaphores).

9. Write a program that illustrates inter process communication using shared memory system
calls.

10. Write a program that illustrates the following:

a. Creating message queue.
b. Writing to a message queue
c. Reading from a message queue

Reference Books:
1. Sumitabha Das: “UNIX Concepts and Applications”, 4th Edition, Tata McGraw Hill, 2006.
2. Kenneth Roson et al ,“UNIX: The Complete Reference”, McGraw-Hill Osborne Media
3. M G Venkateshmurthy,“UNIX and Shell Programming”, Pearson Education Asia, 2005
4. Behrouz A. Forouzan, Richard F. Gilberg,“Unix and shell Programming.”, Brooks/Cole-
Thomson Learning, 2003
5. Uresh Vahalia, “UNIX Internals”, Pearson Education, 2005.
6. Richard Stevens, Stephen Rago, “Advanced Programming in the UNIX Environment”, Pearson
Education, 2/e.

10
 Open Elective courses o ered by the
Department of Computer Science
Open Elective 3: Fundamentals of HTML & CSS

Course Code: CSOE04 Fundamentals of HTML & CSS

Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration:

Introduction to HTML
History of HTML - What you need to do to get going and make your rst HTML page - What
are HTML Tags and Attributes? - HTML Attributes - How to di erentiate HTML Document
Versions- Introduction and Advantages of HTML 5 - Limitations of HTML 4 - First HTML5
Document - Overview of New Features of HTML5.

HTML-Basic Formatting

HTML Basic Tags - HTML Formatting Tags - HTML Color Coding - Div and Span Tags for
Grouping -Table: , Lists: Unordered Lists - Ordered Lists - De nition list, Images: Image and
Image Mapping, HTML-Iframe : Attributes Using - Iframe as the Target, Hyperlink: URL -
Uniform Resource Locator - URL Encoding. Semantic elements: Header - Navigation -
Section & Articles - Footer – Aside

Web Forms

Web Forms: HTML 5 Global Attributes - Displaying a Search Input Field - Utilizing Date and
Time Input Fields - Number Inputs - Selecting from a Range of Numbers - Selecting Colors
- Creating an Editable Drop-Down - Requiring a Form Field - Displaying Placeholder Text -
Disabling Autocomplete - Restricting Values.

CSS

Introduction: CSS Versions History - Bene ts of CSS - What CSS3 Is and How It Came to
Be - CSS3 Is Modular - CSS3 Is Not HTML5- Browser-Speci c Pre xes, Syntax: CSS
Syntax - single Style Sheets - Multiple Style Sheets - Value Lengths and Percentages,
Selectors: ID Selectors - Class Selectors - Grouping Selectors - Universal Selector -
Descendant / Child Selectors - Attribute Selectors, CSS-Color Background Cursor, Text
Fonts, -Lists Tables, transformations.

Readings:
1. HTML5 and CSS3 visual quick start guide 7th edition
ff
fi
fi
ff
fi
fi
fi
2. Black Book, HTML 5, Dreamtech Press
3. Ralph Moseley and M. T. Savaliya, Developing Web Applications, Wiley-India
 Open Elective courses offered by the Department
of Computer Scienc
Open Elective 4: Database Management Syste

Course Code: CSOE04 Database Management Systems

Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration:

Course Outcomes (COs)

After completing this course satisfactorily, a student will be able to
• Understand relevance of Databases and DBMS
• Appreciate the purpose of SQL and learn to use SQL DDL and DML command
• Write SQL for Join operations and aggregation
• Obtain insights about transactions and apply all the SQL DDL, DML command

Content Ho
urs
Unit – 1
Introduction to Databases & DBMS 12
Hrs
Introduction: File Systems, File storage and its limitations, The Database Approach,
Database Management Systems, DBMS advantages and limitations, DBMS Concepts:
Database Schema, Meta-Data/ Data Dictionary, Constraints, Relational Data Model
Concepts: Relation, Attributes, Tuples, Domain, Cardinality, Degree. Keys – Candidate
key, Primary key, Composite key, foreign key.

Unit – 2
Introduction to SQL: 10
Hrs
SQL and its features, SQL Data types, DDL: Create tables (with constraints), Alter tables,
DML: Insert, Update, Delete Operations, Queries: Simple Queries, select with WHERE
clause, ORDER BY clause and aggregate functions, Using operators like BETWEEN , IN ,
ANY , ALL and computations in queries, Simple Queries using all clauses

Unit – 3
More on SQL 10
Hrs
Joins, types of joins , queries with GROUP BY clause, queries with HAVING clause,
views and their relevance, creating and using views, simple example queries for joining
tables and using GROUP BY and HAVING claus

Unit – 4
:

 Case Study 10
Hrs
The University Database has the following tables
STUDENT(usn, name, address, date_of_birth, program_cd, semester
DEPARTMENT( dept_cd, dept_name, HOD_cd) (HOD_cd is foreign key which
references faculty_cd of FACULTY table
FACULTY( faculty_cd, name, address, date_of_join, dept_cd
Program( program_cd, program_name, dept_cd) (Each Department offers multiple
programmes eg: BCA, MCA are offered by CS department

Write SQL DDL and DML statements for the following

1. Create all the tables de ning primary keys and foreign keys
2. Add the column email_id to the STUDENT tabl
3. Insert minimum three tuples in each of the tables
4. Update the date_of_birth of a speci c student
5. Delete the data of a speci c faculty
6. Display all the programmes taught by Computer Science departmen
7. Display all the faculties who teach in the Math department
8. Display the number of faculty members in each departmen
9. Display the student usn, name along with the programme (program name) he is
studyin
10. Display all the department names along with the names of their HODs.

Reference Books
1. Elmasri, Navathe , Fundamentals of Database Systems (5th Edition), Pearso
2. Alan Beaulieu, Learning SQL – 2nd Edition, O’Reilly Publications

Web Resources

1. https://ncert.nic.in/textbook/pdf/keip107.pdf
2. https://ncert.nic.in/textbook/pdf/keip108.pdf
g

fi
fi
.

fi
)