B.sc. Computer Science Syllabus 3 and 4
B.sc. Computer Science Syllabus 3 and 4
Course Objectives:
Definition of algorithms
Performance analysis: time and space complexity 10
Asymptotic notations: Big-O, Omega, Theta
Best, worst, and average case analysis
Recursion
Heap and heap sort
3 Greedy Algorithms
4 Dynamic Programming
Pedagogy: Lectures, Seminars, Industry Visits, Debates, Quiz, Assignments and Coding
Hackathon.
Text Book:
1. Ellis, Horwitz, SartajSahani and Rajashekaran S., "Computer Algorithms", (1999) Galgotia
Publications Pvt.,Ltd
Reference Books:
1. Aho A.V, Hopcroft J.E and Ullman, J.D., "The Design and Analysis of Computer
Algorithms", (1976) Addison - Wesley.
2. Sara Baase, Computer Algorithms, "An Introduction to Design and Analysis", Addison
Wesley.
Assessment Type
Formative Assessment Summative Assessment
Components Weight age in Component Weight age in
marks marks
Internal Test-1 05
Internal Test-2 05
Seminar/ Group Discussion/ Theory Examination 80
05
Activity/Coding Hackathon
Assignment/Term paper
05
Total FA 20 Total SA 80
Formative Assessment(20)+Summative Assessment (80)=100marks
Title of the Paper Design and Analysis of Algorithm Laboratory
Subject Code Semester III
Credits 2 Contact Hours 40
Summative 40 Formative 10
Assessment Assessment
Course Objectives:
This Lab will train students to write programs and solve problems using algorithm
design techniques such as Divide and Conquer, Greedy, Dynamic programming, Back
tracking and to analyze the running time of algorithms.
To study about various designing paradigms of algorithms for solving real world
problems.
Program List:
1. Program to find factorial of a given number using recursion
2. Program to sort N numbers using Heap Sort
3. Program to search an element from a list using Binary Search Technique
4. Program to sort N numbers using Merge Sort
5. Program to implement Strassen's matrix multiplication
6. Program to find Maximum and Minimum elements in a matrix
7. Program to compute minimum spanning tree using Prim's Algorithm
8. Program to implement all pair shortest problem using dynamic programming
technique
Practical Assessment
Formative Assessment Summative Total
Assessment Marks
Assessment Weightage in Marks Practical Exams
Practical 10
Internal 40
Total 10 40 50
Title of the Paper Database Management System
Subject Code Semester IV
Credits 4 Contact Hours 48
Summative Assessment 80 Formative Assessment 20
Course Objectives:
1 Introduction to DBMS
3 Relational Model
Functional dependencies 8
Anomalies in unnormalized databases
Normal forms: 1NF, 2NF, 3NF, BCNF
Decomposition and dependency preservation
Lossless join decomposition
Pedagogy: Lectures, Seminars, Industry Visits, Debates, Quiz, Assignments and Coding
Hackathon.
Text Book:
1. Fundamentals of Database Systems, Ramez Elamassri, Shankant B. Navathe, 7th Edition,
Pearson, 2015.
Reference Books:
1. An Introduction to Database Systems, Bipin Desai, Galgotia Publications, 2010.
2. Introduction to Database System, C J Date, Pearson, 1999.
3. Database Systems Concepts, Abraham Silberschatz, Henry Korth, S.Sudarshan, 6ih
Edition, McGraw Hill, 2010.
4. Database Management Systems, Raghu Rama Krishnan and Johannes Gehrke, 3rd
Edition, McGraw Hill, 2002.
Assessment Type
Formative Assessment Summative Assessment
Components Weight age in Component Weight age in
marks marks
Internal Test-1 05
Internal Test-2 05
Seminar/ Group Discussion/ Theory Examination 80
05
Activity/Coding Hackathon
Assignment/Term paper
05
Total FA 20 Total SA 80
Formative Assessment(20)+Summative Assessment (80)=100marks
Title of the Paper DBMS Laboratory
Subject Code Semester III
Credits 2 Contact Hours 40
Summative Assessment 40 Formative Assessment 10
Program List:
Practical Assessment
Formative Assessment Summative Total
Assessment Marks
Assessment Weightage in Marks Practical Exams
Practical 10
Internal 40
Total 10 40 50
Title of the Paper Introduction to Java Programming
Subject Code Semester III
Credits 2 Contact Hours 40
Summative Assessment 80 Formative Assessment 20
Course Objectives:
1 Introduction to Java
History and evolution of Java
Features of Java 8
Java Virtual Machine (JVM), Java Development Kit
(JDK), and Java Runtime Environment (JRE)
Structure of a Java program
Compilation and execution process
2 Java Basics
Data types and variables 8
Operators and expressions
Control statements: if, if-else, switch, loops (for, while,
do-while)
Type casting and conversion
5 Exception Handling
Types of exceptions 8
Try-catch blocks, throw, throws, and finally
Built-in and user-defined exceptions
Pedagogy: Lectures, Seminars, Industry Visits, Debates, Quiz, Assignments and Coding
Hackathon.
Text Book:
1. Sachin Malhotra, Saurabh Choudhary, Programming in Java (2e)
Reference Books:
1. Bruce Eckel, Thinking in Java (4e)
2. Herbert Schildt, Java: The Complete Reference (9e)
3. Y. Daniel Liang, Introduction to Java Programming (10e)
4. Paul Deitel, Harvey Deitel, Java: How To Program (10e)
5. Cay S. Horsttnann, Core Java Volume I -Fundamentals (10e)
Title of the Paper Principle of IoT
Subject Code Semester IV
Credits 2 Contact Hours 40
Summative Assessment 80 Formative Assessment 20
Course Objectives:
Pedagogy: Lectures, Seminars, Industry Visits, Debates, Quiz, Assignments and Coding
Hackathon.
Text Book:
1. Sudip Misra, Anandarup Mukherjee, Arijit Roy, “Introduction to IoT”, Cambridge University Press
2021.
Reference Books:
1. S. Misra, C. Roy, and A. Mukherjee, 2020. Introduction to Industrial Internet of Things and
Industry 4.0. CRC Press.
2. Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-on-Approach)”,1st Edition,
VPT, 2014.
3. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to Connecting
Everything”, 1st Edition, Apress Publications, 2013.
Title of the Paper Programming Concepts using C
Subject Code Semester III
Credits 2 Contact Hours 40
Summative Assessment 80 Formative Assessment 20
Course Objectives:
1 Introduction to Programming
Pedagogy: Lectures, Seminars, Industry Visits, Debates, Quiz, Assignments and Coding
Hackathon.
Text Books:
1. Pradeep K.Sinha and Priti Sinha: Computer Fundamentals(Sixth Edition),
BPBPublication
2. E. Balgurusamy: Programming in ANSIC(TMH)
3. A. M. Padma Reddy: C- Programming Techniques, Sri Nandi Publications
Reference Books:
1. Kamthane: Programming with ANSI and TURBOC(Pearson Education)
2. V.Rajaraman: Programming in C(PHI–EEE)
3. S.Byron Gottfried: Programming with C(TMH)
4. Kernighan & Ritche: The C Programming Language(PHI)
5. Yashwant Kanitkar: Let us C
6. P.B.Kottur: Programming in C(Sapna Book House)
Title of the Paper Fundamental of Cyber Security
Subject Code Semester IV
Credits 2 Contact Hours 40
Summative Assessment 80 Formative Assessment 20
Course Objectives:
1 Introduction to Cybersecurity
Pedagogy: Lectures, Seminars, Industry Visits, Debates, Quiz, Assignments and Coding
Hackathon.
Text Books:
Course Objectives:
Pedagogy: Lectures, Seminars, Industry Visits, Debates, Quiz, Assignments and Coding
Hackathon.
Text Books:
1. Fundamentals of computers - V. Rajaraman - Prentice- Hall of India.
2. Computer Fundamentals - P. K. Sinha Publisher: BPB Publications.