0% found this document useful (0 votes)
6 views17 pages

B.sc. Computer Science Syllabus 3 and 4

The document outlines various academic courses including 'Design and Analysis of Algorithm', 'Database Management System', and 'Introduction to Java Programming', detailing their objectives, unit descriptions, and assessment methods. Each course includes a structured curriculum with specific topics and practical applications, along with recommended textbooks and reference materials. The courses aim to equip students with essential skills in algorithm design, database management, Java programming, and IoT principles.

Uploaded by

Shireen Fatima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views17 pages

B.sc. Computer Science Syllabus 3 and 4

The document outlines various academic courses including 'Design and Analysis of Algorithm', 'Database Management System', and 'Introduction to Java Programming', detailing their objectives, unit descriptions, and assessment methods. Each course includes a structured curriculum with specific topics and practical applications, along with recommended textbooks and reference materials. The courses aim to equip students with essential skills in algorithm design, database management, Java programming, and IoT principles.

Uploaded by

Shireen Fatima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Title of the Paper Design and Analysis of Algorithm

Subject Code Semester III


Credits 4 Contact Hours 48
Summative Assessment 80 Formative Assessment 20

Course Objectives:

 Understand algorithm design techniques and their applications.


 Analyze the time and space complexity of algorithms.
 Compare algorithmic strategies and identify the most efficient solutions.
 Apply algorithmic thinking to real-world problems.

Unit Description Hours

1 Introduction to Algorithm Analysis

 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

2 Divide and Conquer

 The General Method 10


 Strategy and characteristics
 Merge Sort, Quick Sort, Binary Search, Max and Min
Problem
 Matrix Multiplication and Related Operations:
Strassen’s Matrix Multiplication and Boolean Matrix
Multiplication

3 Greedy Algorithms

 The General Method


 Strategy and applications 10
 Knapsack Problem, Job Sequencing with deadlines ,
Prim’s and Kruskal’s algorithm, Single Source
Shortest Path
 Greedy vs. Dynamic Programming

4 Dynamic Programming

 The General Method, Principle of optimality 10


 Multistage Graphs, All Pair’s Shortest Path, 0/1
Knapsack and Travelling Salesman Problem
 Comparison with divide and conquer
5 Backtracking and NP-Completeness
 Backtracking: N-Queens, Sum of Subsets, Graph 8
coloring, Hamiltonian cycle
 Classes of problems: P, NP, NP-Complete, NP-Hard
 Examples of NP-Complete problems: SAT, 3-CNF
SAT, Clique, Vertex Cover

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:

 Understand fundamental concepts of database systems.


 Learn data modeling using Entity-Relationship (ER) diagrams.
 Design normalized relational databases.
 Develop skills in SQL and relational algebra.
 Understand transaction processing, concurrency, and recovery.

Unit Description Hours

1 Introduction to DBMS

 Definition and need for DBMS


 File system vs. DBMS 10
 Applications of DBMS
 DBMS architecture (1-tier, 2-tier, 3-tier)
 Data abstraction and data independence
 Database users and administrators

2 Data Models and ER Model

 Data models: Hierarchical, Network, Relational 10


 Entity-Relationship (ER) model
o Entities, attributes, keys, and relationships
o ER diagrams: symbols, notations
 Extended ER features: generalization, specialization,
aggregation

3 Relational Model

 Structure of relational databases


 Keys: primary, foreign, candidate, super 10
 Relational integrity constraints: domain, entity, referential
 Relational algebra operations: select, project, union, set
difference, Cartesian product, rename, join

4 Structured Query Language (SQL)

 DDL: CREATE, ALTER, DROP 10


 DML: SELECT, INSERT, UPDATE, DELETE
 Constraints: NOT NULL, UNIQUE, PRIMARY KEY,
FOREIGN KEY, CHECK
 SQL functions: aggregate functions, string/date functions
 Joins: INNER, LEFT, RIGHT, FULL OUTER
 Nested queries, subqueries, and views
5 Database Design &Normalization

 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:

A. Consider the following schema for a Library Database:

BOOK (Book_id, Title, Publisher_ Name, Pub_ Year)


BOOK_AUTHORS (Book_id, Author_Name)
PUBLISHER (Name, Address, Phone)
BOOK_COPIES (Book_id, Branch_id, No-of_Copies)
BOOK_LENDING (Book_id, Branch_id, Card_No, Date_Out, Due_Date)
LIBRARY_ BRANCH (Branch id, Branch_Name, Address)

Write SQL queries to


1. Retrieve details of all books in the library - id, title, name of publisher, authors,
number of copies in each branch, etc.
2. Get the particulars of borrowers who have borrowed more than 3 books, but from Jan
2017 to Jus 2017
3. Delete a book in BOOK table. Update the contents of other tables to reflect this data
manipulation operation.
4. Partition the BOOK table based on year of publication. Demonstrate its working with a
simple query.
5. Create a view of all books and its number of copies that are currently available in the
Library.

B. Consider the following schema for Order Database:

SALESMAN (Salesman_ id, Name, City, Commission)


CUSTOMER (Customer_id, Cust_Name, City, Grade, Salesman_id)
ORDERS (Ord_No, Purchase_Amt, Ord_Date, Customer_id, Salesman_id)

Write SQL queries to


1. Count the customers with grades above Bangalore's average.
2. Find the name and numbers of all salesmen who had more than one customer.
3. List all salesmen and indicate those who have and don't have customers in their cities
(Use UNION operation)
4. Create a view that finds the salesman who has the customer with the highest order of a
day.
5. Demonstrate the DELETE operation by removing salesman with id 1000. All his
orders must also be deleted.

C. Consider the schema for Movie Database:

ACTOR (Act id, Act_Name, Act_Gender)


DIRECTOR (Dir id, Dir_Name, Dir _Phone)
MOVIES (Mov_ id, Mov_Title, Mov _Year, Mov _Lang, Dir id)
MOVIE_ CAST (Act id, Mov id, Role)
RATING (Mov id, Rev Stars)

Write SQL queries to


1. List the titles of all movies directed by 'Hitchcock'.
2. Find the movie names where one or more actors acted in two or more movies.
3. List all actors who acted in a movie before 2000 and also in a movie after
2015(Use JOIN operation).
4. Find the title of movies and number of stars for each movie that has at least one rating
and find the highest number of stars that movie received. Sort the result by movie
title.
5. Update rating of all movies directed by 'Steven Spielberg' to 5.

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:

 Understand the fundamentals of object-oriented programming using Java.


 Learn Java syntax and basic programming structures.
 Develop console-based and simple GUI-based applications.
 Apply Java concepts to solve real-world problems.

Unit Description Hours

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

3 Object-Oriented Programming Concepts


 Classes and objects
 Constructors and method overloading 8
 this keyword and static members
 Access modifiers and encapsulation
 Inheritance, polymorphism, and method overriding
 Abstract classes and interfaces

4 Arrays and Strings


 One-dimensional and multi-dimensional arrays 8
 String class and String Buffer
 String manipulation methods

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:

 To introduce the basic principles and architecture of IoT.


 To understand sensors, actuators, and IoT communication protocols.
 To explore real-world applications in smart environments.
 To develop simple IoT-based applications using microcontrollers or cloud platforms.

Unit Description Hours

1 Basics of Networking: Introduction, Network Types,


Layered network models.

Emergence of IoT: Introduction, Evolution of IoT, 8


Enabling IoT and the Complex Interdependence of
Technologies, IoT Networking Components.

2 IoT Sensing and Actuation: Introduction, Sensors,


Sensor Characteristics, Sensorial Deviations, Sensing
Types, Sensing Considerations, Actuators, Actuator 8
Types, Actuator Characteristics.

3 IoT Processing Topologies and Types: Data Format,


Importance of Processing in IoT, Processing Topologies,
IoT Device Design and Selection Considerations,
8
Processing Offloading.

4 Cloud Computing: Introduction, Virtualization, Cloud


Models, Service-Level Agreement in Cloud Computing,
8
Cloud Implementation, Sensor-Cloud: Sensors-as-a-Service.

5 IOT CASE STUDIES AND FUTURE TRENDS


Agricultural IoT – Introduction and Case Studies
Vehicular IoT – Introduction 8
Healthcare IoT- Introduction and Case Studies

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:

 Understand the fundamental concepts of programming.


 Learn structured programming using the C language.
 Write modular and efficient C programs.
 Solve real-life problems using programming constructs.

Unit Description Hours

1 Introduction to Programming

 Basics of programming languages


 Compiler, interpreter, assembler 8
 Structure of a C program
 Creating and executing C programs
 Variables, constants, and data types
 Input and output functions (scanf, printf)

2 Operators and Control Structures

 Arithmetic, relational, logical, bitwise operators 8


 Conditional statements: if, if-else, nested if, switch
 Loops: for, while, do-while
 break, continue, goto statements

3 Functions and Modular Programming

 Defining and calling functions


 Function arguments: call by value and call by 8
reference
 Recursion
 Scope and lifetime of variables
 Storage classes (auto, static, extern, register)

4 Arrays and Strings

 One-dimensional and multi-dimensional arrays 8


 String operations using library functions (strlen,
strcpy, etc.)
 Array of strings
 Sorting and searching algorithms with arrays

5 Pointers and Structures


 Introduction to pointers 8
 Pointer arithmetic
 Pointers and arrays
 Dynamic memory allocation (malloc, calloc, free)
 Structures and unions
 Arrays of structures and nested structures

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:

 Understand the basics of cyber security and threats.


 Learn security principles and best practices.
 Explore common attacks and defenses.
 Understand the importance of data protection and user awareness.

Unit Description Hours

1 Introduction to Cybersecurity

 Definition, scope, and importance of cybersecurity


 Key concepts: CIA Triad (Confidentiality, Integrity, 8
Availability)
 Categories of threats: malware, phishing, DoS,
insider threats
 Security goals and risk management
 Roles of cybersecurity professionals

2 Cyber Attacks and Threats

 Types of malware: virus, worm, trojan, ransomware, 8


spyware
 Social engineering: phishing, pretexting, baiting,
tailgating
 Network attacks: Man-in-the-Middle (MITM), IP
spoofing, session hijacking
 Web-based attacks: SQL injection, cross-site
scripting (XSS), CSRF
 Case studies of major breaches

3 Security Measures and Controls

 Authentication: passwords, biometrics, multi-factor


authentication 8
 Authorization and access control
 Firewalls, antivirus, intrusion detection systems
(IDS/IPS)
 Encryption basics (symmetric/asymmetric)
 Securing devices and mobile platforms

4 Data Protection and Cyber Laws

 Importance of data privacy 8


 Basics of data encryption and secure communication
 Indian IT Act, 2000 and amendments
 GDPR overview (European law)
 Digital forensics basics and evidence handling

5 Cyber Ethics and Safe Practices

 Ethical hacking overview 8


 Responsible internet and social media usage
 Safe browsing, software updates, and backups
 Cyberbullying, online harassment, and legal
consequences
 Cyber hygiene and awareness campaigns

Pedagogy: Lectures, Seminars, Industry Visits, Debates, Quiz, Assignments and Coding
Hackathon.

Text Books:

1. Cybersecurity for Beginners by RaefMeeuwisse


2. Cybersecurity Essentials by Charles J. Brooks
3. CERT-IN – Official Indian cybersecurity agency
4. StaySafeOnline.org – Global cybersecurity awareness portal
Title of the Paper Digital Fluency
Subject Code Semester IV
Credits 2 Contact Hours 30
Summative Assessment 40 Formative Assessment 10

Course Objectives:

 Develop foundational skills in digital tools and technologies


 Promote responsible and ethical digital citizenship
 Understand internet, communication, and collaboration technologies
 Prepare students to use technology effectively in academics and careers

Unit Description Hours

1 Introduction to Digital Fluency


 What is Digital Fluency?
 Importance in education, employment, and everyday life 6
 Difference between digital literacy and fluency
 Digital access and equity
 Digital natives vs digital immigrants

2 Digital Devices and Operating Systems


 Types of digital devices (PCs, tablets, smartphones, 6
wearables)
 Basics of hardware and software
 Operating systems overview (Windows, macOS, Android)
 File and folder management
 Cloud vs local storage

3 Internet, Web, and Digital Communication


 Internet basics and history
 Browsers and search engines 6
 Effective online search strategies
 Email etiquette and communication tools (Gmail,
Outlook, Teams, Zoom)
 Collaboration platforms: Google Workspace, Microsoft
365

4 : Productivity and Data Tools


 Word processing (MS Word / Google Docs) 6
 Spreadsheets (Excel / Google Sheets): formulas, charts,
sorting/filtering
 Presentations (PowerPoint / Google Slides): design and
delivery
 Basics of data privacy and file sharing
 Introduction to data-driven decision-making
5 Digital Citizenship and Online Safety
 Digital identity and footprint 6
 Cyberbullying and online behavior
 Protecting personal data and privacy
 Understanding misinformation and fake news
 Intellectual property and copyright basics

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.

You might also like