SHIVAJI UNIERSITY,

KOLHAPUR
SHIVA J I

R:

KOL
Accredited By NAAC with 'A++ Grade

Choice BasedCredit System with Multiple Entry and Multiple Exit Options

As per NEP-2020

Syllabus for

B.Sc. Part -I!

COMPUTER SCIENCK (Optional)

SEMESTER II AND IV

(Syllabus tobe implemented from Academic Year 2023-24)

 B.Sc. Computer Science (Optiona) Semester - I|I& IV
(CBCS) NEP-2020 Syllabus to be implemented from.June 2023 Onwards
1. TITLE: Computer Science
be implemented from June
2. YEAR OF IMPLEMENTATION: Revised Syllabus will
2023 onwards.
of the course shall be
3. DURATION: B.Sc. in Computer Science Part - ||The duration
one year and twO semesters.
4. PATTERN: The pattern of examination will be semester.
5. STRUCTURE OF COURSE:
STRUCTURE OF COURSE
Marks
Sr. Paper Name of Paper
No. Theory Internal Total

Computer Science (Semester - III)

DSC-C1I Web Technology 40 10 50
Object Oriented Programming Using C+E 40 10 50
2 DSC-C12
Computer Science (Semester - IV)
Cyber Security Essentials 40 10 50
DSC-DI1
Data Structure Using C++ 40 10 50
4 DSC-D12
Practical ( Annual )
Computer Science Practical 50 50
Practical
Paper Based on DSC-C11 (Practical)
Paper-II

Computer Science Practical 50 50

6 Practical
Paper Based on (Practical)
Paper-II
DSC-C12 and DSC-D12

OF PAPERS
6. EQUIVALENCE IN ACCORDANCE WITH TITLES AND CONTENTS
(FOR REVISED SYLLABUS)

Sr. Title of old paper Sr. Title of New paper

No. No.
SEMESTER II

PHP and MySQL Web Technology

2 Object Oriented Programming Using C++ 2 Object Oriented Programming Using
C++
SEMESTER - IV

3 Cyber Security Essentials-I 3 Cyber Security Essentials

4 Data Structure Using C++ 4 Data Structure Using Ctt
PRACTICAL (ANNUAL PATTERN)
Computer Science Practical Paper - II Computer Science Practical Paper -II
5

Computer Science Practical Paper - III 6 Computer Science Practical Paper - III
6

Page | |
 B.Se. Part -I|Coputer Science(Optional) (Semester- II1)
Course Code: DSC-CIH Paper -V
Computer Science
Course Title: Web Technology
Total Contact Hours: 36 Hrs (45 Lectures of 48 Min.)
Teaching Scheme: Theory -03 Lect. /Week
Total Marks: 50
Credits: 02

Course Outcomes:
Upon success ful completion of this course, students will be able to
I. understand the principles of web design.
2. construct basic websites using HTML and Cascading Style Sheets.
3. build dynamic web pages with validation using JavaScript.
4 develop a modern web application that neets the current industry
requirement.

18 Hrs.
Unit - 1: Introduction to Internet, HTML, CSS and JavaScript
1.1 Fundamentals
1.1.1 Introduction Internet.
1.1.2 WWw, Web Browsers, Web Servers.URL and URI.
1.2 Overview of different protocols
1.2.1 HTTP, SMTP, FTP.

1.3 HTML
1.3.1 Introduction,
1.3.2 Standard HTML Document Structure
1.3.3 Basic Text Formatting Elements <b>, <strong>, <i, <s>, <emp>, <>, <smal>,
<big>, <tt>.
and
1.3.4 Images <img>, Hypertext Links<a>, <span> and <div>,Lists -Ordered
Unordered, <input> (Type -Text, Password, Button, Submit, Reset).

1.4 Cascading Style Sheets

1.4.1 Introduction
1.4.2 Types of CSS
1.4.3 Basic syntaxX
1.4.4 Selectors -element, id, class, group, universal.
1.4.5 Style Properties of color, font, text, size and border

1.5 Java Script

1.5.1 Introduction
1.5.2 Document Object Model
1.5.3 Variables, Datatypes and Operators
1.5.4 Control Statenent - if, if-else, break
1.5.5 Looping Statements - while, for
1.5.6 Element Access in Java seripts - getElementByld() and getElementsByName()
1.5.7 Event and event handling - onCIick), onBlur), onFocus(), onKeyPress()
1.5.8 dialog boxes - alert(), prompt), confirm).

Page |2
 18 Tlrs.
Unit - 2: Introduetion to PP
2.1 Introduction PHP
2.1.1 Introduction and Features,
2.1.2 PHP basic syntax <?php...?,
2.1.3 Comment(single and multiline),
2.1.4 Echo command, PHP script execution in web browser.
2.1.5 Variables: Basics, Variable naming rules, unset(0, gettype(), isset(),
2.1.6 constants -define() and constant()
2.1.7 Operators:Arithmetic, Comparison, Relational, Assignment, Increment
Decrement, Ternary, Other operators(., $, @, 0,,=),
2.1.8 Strings: Single Quoted and Double Quoted, escape sequences,
variables
2.1.9 Forms: HTML forms, action and get & post methods. PHP super global
($ GET, $ POST, $ REQUEST
statement,
2.1.10 Decision-Making Statements: if, if... else, if ... elseif...else, switch
iterative Statements: for, while, do... while, foreach, break and continue statement
2.1.11 Exit statements: exit, die
2.1.12 User-Defined Functions: Declaring functions, Function call
2.1.13 Arrays:Concept, Types(Numerical/List, Associative/Maps, Multidimensional),
accessing array elements

2.2 Database Connection - Connection to MySQL

2.2.1 Establishing Connection - mysqli connect()
2.2.2 Closing connection - mysqli close()
2.2.3 Select a database - mysqli select db()
2.2.4 Execute MySQL commands- mysqli query)
2.2.5 Fetch data from tables - mysqli fetch row), mysqli_fetch array(),
mysqli fetch assoc)
Reference Books -

1. Web Programming- John Dean, John and Bartlett Learning

2. Internet Fundamentals &Concepts - Shubhra Garg, S.K.Kataria& Sons
3. Web Technologies HTML, JavaScript, PHP, Java, JSP, ASP.NET, XML, and AJAX
Comprehensive Problem Solver, Black Book -Kogent Learning Solutions Inc, Dreamtech
Press, Willey IndiaPvt Ltd.
4. Internet and World Wide Web How to Program-P. J. Deitel, H. M. Deitel, Pearson
5. PHP and MySQL byDreamtech Publications
6. PHP Concepts Unleashed for Novice - Vol I - By Poornima Naik, Kavita Ozá,
Evincepub Publishing
7. PHP ABeginner's Guide - Vikram Vaswami
8. Beginning PHP 6, Apache, MySQL Web Development- By Timothy Boronczyk,
ElizabethNaramore, Jason Gerner, Yann Le Scouarnec, Zeremy Stolz, MichaelK. Glass
9. PHP and MySQL by Rajendra Salokhe, Aruta Publications
10. Learning Laravel: The easiest way- Jack Vo, Lean Publishing
11. Beginning Laravel -Sanjib Sinha, Apress
12. Web application development with Laravel PHP Framework version 4 - Jamal Armel,
Metropolia
Pag |3
PracticalBased on DSC-C11
) For PHP practical use HTML formto take user input (avoid console-based input).
provided bclow.
2) Also, provide more assignments to students for practice apart fron the list

Sr. Particulars
No.
1. Create a web page to demonstrate the use of text formatting elements.

2 Create a web page having a link to another web page containing a gallery of images.
3. Design a web page to demonstrate CSS selectors.
and Size
4.
Design a Web page to demonstrate the use of- CSS Text, Color, Border,
properties.
Bar. Use
S.
Design a web page having three sections Header, Footer and Navigation
<div>,<span>, <ub and CSS.
Create a web page
i) To check given number is odd or even
6. To check given number is a Palindrome or not.
ii)
iii) To check given number is Armstrong or not.
7 Create a web page to perform simple arithmetic calculations
display
Create a web page with a Textbox and 4 buttons. Click on the 1 button will
the text entered in the text box on the web page, click on 2nd button will change text
8. color, click on 3rd button will change font and click on 4h button will set border to
text.
Design an HTML form with the following fields andvalidate user input using
9 JavaScript:
Roll No., Name and Email address.
Design a web page to input temperature in degree Celsius. Convert the temperature to
10.
degree Fahrenheit using PHP script.
Design a web page to input a number. Using PHP script check whether given number
11. is Odd/Even.

Design a web page to input a number. Using PHP script check whether given number
12. is Palindrome/ Armstrong and display message in Web page accordingly.

Design a web page to input a number. Using PHP script check whether given number
13. is Prime or Not.

Write a PHP script that will display array elements, smallest element in array, largest
14. element in array and Sum of elements ofarray. (Use hard coded array)

15. Write PHP script to display 'n' terms of Fibonacci series using user defined function.

16. Write PHP script todisplay factorial of natural number using user defined function.

Page |4
 Create Employee database in MySQL with table EmployeeMaster (Empld,
EmpNanme, EmpDepartent ). Createaweb page having aform with the above fields,
17. connect the web page to MySQL and perform Insert, Update and Delete operations
through the web page.
Use the Employee database (Specified in Sr. No.17) and perfor1the following
operation through the web page
18. Display allemployec details.
ii Display Employees from a specific departnent.
ii. Display count of employees in a particular departmcnt.
Create Student Database in MySQL with the following table:
19.
Student Master (RollNo, StudentName, AdmittedClass, DateOfBirth).
table.
Design a complete web form to perform CRUD operation on the above

3) Assignments using Laravel PHP web framework -

Introduce the following concepts to the students:
a. Introduction of Laravel
b. Features of Laravel
c. Introduction ofMVC Pattern
d. Laravel Directory Structure
e. Installation - using Composer
£ Laravel Application Structure
g. Laravel Routing -Basic Routing, Routing Parameters, Laravel Named Routes
h. Laravel Controllers, Routing Controllers, Resource Controllers
i. Laravel Views, Passing data to views
Create a minimum of two basic Laravel Web Applications.

Page
 B.Sc. Part - IIComputer Science(Optional) (Semester - III)
Course Code: DSC-C12 Computer Science Paper -VI
Course Titie: Object Oriented Programming Using C+t
Total Contact Hours: 36 Hrs (45 Lectures of 48 Min.)
Teaching Scheme: Thcory - 03 Lect. / Week
Credits: 02 Total Marks: 50

Course Outcomes:
Upon successful completion of this course, students will be able to
1. understand the principles of web design.
2. understand how C++ improves C with object oriented features
3. learn syntax and semantics ofC++ programming language
4. learn how to write inline functions for efficiency and performance.
5. learn how to overload functions and operators in C++.
6. learn how to design C++ classes for code reuse.
7. learn how inheritance promotes code reuse in C++.
8 learn how inheritance and virtual functions implement dynanmic binding with
polymorphism.

Unit - 1: Introduction to C++ 12 Hrs.

1.1Object oriented programming Concepts: Object, class, Encapsulation,Abstraction,
Polymorphism, Inheritance
1.2 Procedure Oriented programming versus Object oriented programming
1.3 Basic C++ program:
1.3.1Header file, using namespace std, main(), input:>> extraction using
cin and output: << insertion using cout operator
1.3.2 C+H Tokens:
1.3.2.1 Keywords - bool, class, delete, namespace, friend
1.3.2.2 Identifiers, Constants, Strings
1.4Structure of C++Program
1.5 Benefits of C+H over C Language
1.6 C++ Data Types:
1.6.1Built-in /Fundamental: void, char, int, float, double
1.6.2 User defined- struct, union, enum, class
1.6.3 Derived- array, function, pointer, reference

1.7Variable:
1.7.1Definition, Declaration, Initialisation
1.7.2 Dynamic Initialisation andreference variables
1.8 Operators in C++:
1.8.1 DMA operators: new, delete
1.8.2 Scope resolution operator:
1.8.3 Manipulators: setw, endl, setprecision
1.9 Function:
1.9.1 Function Call: by value, by pointer, by reference, return by reference
1.9.2 Default arguments, cOnst argunments
1.9.3 Inline function
1.9.4 Function overloading

Page|6
 24 Hrs.
Unit -2: Object Oriented Programming
2.1 Class:
2.1.1 Difference bctween struct and class
2.1.2 Class specification: class declaration, class definition, adding data membersand
member functions
2.1.3 Access modifiers/ visibility labels - private, public, protected members
2.1.4 Member function definition - inside the class and outside the class
2.1.5 Object definition and memory allocation of object
2.1.6 Use of this pointer
2.1.7Static members - data members and member function
2.1.8 Scope of avariable - local, local to class, global
2.2 Friend function and friend class:
Definition of friend function
2.2.1 Characteristics of friend function. Declaration and
2.2.2 Use of friend class
2.3 Constructor and Destructor:
2.3.1Constructor - Definition, Characteristics, features
2.3.2 Types - Default, parameterized, copy
2.3.3 Destructor- Definition, Need of destructor
2.4 Operator overloading:
2.4.1 Concept, Rules
2.4.2 Definition of operator function:
2.4.2.1 Using member function to overload unary and binary operators
Example: unary operator --, +t and Binary-Arithmetic Operator
2.4.2.2 Using friend function to overload unary and binary operators
Example: unary operator --, tt and Binary-Arithmetic Operator
2.5 Inheritance:
2.5.1Concept, Definition
2.5.2 Types: single, nmultilevel, multiple, hierarchical, hybrid
2.5.3 Defining derived class
2.5.4 Introducing protected members, visibility of derived members and virtual base class
2.5.5 Diamond problem with hybrid inheritance -virtual inheritance
2.6 Polymorphism:
2.6.1 Concept, Definition
binding /
2.6.2 Types: Compile timelearly binding/static binding and run time/ late
dynamic binding
2.6.3 Pointer to object
virtual functions
2.6.4 Virtual and pure virtual functions -abstract class, rules for

Reference Books

1. Object - Oriented Programming in C++ by Rajesh K. Shukla - Wiley India Pvt. Ltd
2. Object Oriented Programming Using C++ by Poonam Ponde
3. Object-Oriented Programming with C++ by E Balagurusamy - McGraw Hill India
4. Mastering C++ by K. R. Venugopal - McGraw Hill Higher Education
5. C++ Programming by D. Ravichandran
6. ATour of C++ (2nd Edition) - Bjarne Stroustrup.
7. The C++ Programming Language (4th Edition) -Bjarne Stroustrup.

Page |7
 DSC-C2
Practical Based on
problems and imyplenent code throuuh
Bse sProblem Solving Technkues tor followngAnalysN, Alyorithnn, Fkowchart, Output
C+programming language. It inc ludes: 1hoblemn
Algoithm, Source Code with Output
Tracing using proceSs nd compOnents (cpp, pt, as only )
witha
Eirct introduce the C+t compilation
using(GDB),
Debugging
simple prograum and
Content

Sr.
No. Function Default Argument:
ofsquare(4*r), rectangle(2*|H2*b), triangle (atbteh
i) To calculate perimeter trapezium(1/2*h*sl t s2)
of square(r*r), rectangle(1*b),
iü) Tocalculate area
default value zero,
Keeping other argument to
Function Overloading: rectange(2*+2*b),triangle (a+btc)
of square(4*r), trapezium(1/2*h*(sl+s2)
i)To calculate perimetersquare(r*r), rectangle(|*b),
ii) To calculate area of destructor
Constructor And Destructor:
(defaull, parameterised, copy) and
3 constructor integers using DMA
Demonstrate the working of from an array of
de-allocate memory to or
to allocate and
delete.
operators new and
Static Members: of class, counter is incremented in
4
counter which counts numbers of objects
Display destructor.
decremented in
constructor and
to
| Friend Function:
Fahrenheit and define friend functions to add and
and
Create two classes Celsius
Compare two temperatures.
Operator Overloading: function/friend function
6
arithmetic operator using member
To overload binary
Operator Overloading: function
7
unary --, tt operator using member function/friend
Tooverload Inheritance:
8 Pure VirtuaiFunction And virtual methods Input(), Perimeter() and Area().
with pure
To specify base class Shape Rectangle and Triangle from class Shape with
Inherit three classes Square, methods Input), Perimeter() and Area(). Use
override
appropriate data members and objects of Three classes and Demonstrate working ir
Pointer of class Shape to access
"nain" function.

Page | 8
 B.Se. Part- | Computer Science(Optional) (Semester I)
Course Codc: DSC-DI| Computer Sckence Paper VII
Course Title: Cyber Security Essentials
l'otal Contact Hours: 36 Hrs(45 Lectures of 48 Min.)
Teaching Scheme: Theory - 03 Lect. / Weck
TotalMarks: 50
Crdits: 02

Course Outcomes:
Upon suceessful completion of this course, students will be able to
1. understand the concept of information security management.
2. learn different access control methods.
3. understand wireless network security.
4. learn cyber security laws and the importance of security audit.
12 Hrs.
Unit - 1: Computer Networks and Information Security
Address,
Network, Internet, Internet Protocols, IP Address, MAC server,
Basic Terminologies: networks - files
DHCP, Components of computer
Domain Name Server (DNS), repeater, bridge, router, gateway.
workstation. Network, devices hub,
OSIModel, TCP/IP Model
Security, Types of Network Security, Cyber Security,
the
Information Security: Network Attacks -Distributed denial of service (DDoS), Man in for
of DoS attack, Goals
CIA Triad, Common Types Password atacks, Malware atacks. Security
middle, Email attacks,
Security, Security protocols, Computer Forensics, Process,
Security, E-commerce Management, Information Classification Business
Management- Overview of Security and Guidelines,
Policy, Risk Management, Security Procedures
Security Ethics and Best Practices.
Continuity and Disaster Recovery,
24 Hrs.
Controls, Cyber Security and Cyber Laws
Unit- 2: Network Security, Access
Security: Components of wireless networks, Security issues in
Wireless Network
wireless, Firewall, types of firewall. and Authorization, Overview of
Intrusion
Overview of Authentication
Access Controls: Systems.
Systems and Intrusion Prevention
Detection Systems, Intrusion Detection
to Cyber Security: Firewalls, Intrusion Detection Systems, Response,
Introduction and
Management, Cyber Security Vulnerabilities
Scanning, Security policy, Threat Intrusion
Cyber Security Safeguards Introductionethical to Cryptography, Network-based
hacking
detection, Intrusion prevention system,
Web Security: web authentication,
Cyber Security: Email security: PGP and SMIME,
SSL and SET, Database Security.
Security Laws: Cyber Crime, Security Assurance, Security Laws, Intellectual
Cyber Need, Importance.
Property Rights, International Standards, Security Audit-
References:

1. Computer Network -AS Tannenbum know about it (Cyber security,

2. Cyber Security for Beginners: Everything you need to
Cyber war, Hacking) - Harry Colvin.
3. How NOT To Use Your Smartphone - Rodney D Cambridge.Security Community Book -
4. Online Safety: Scams, SPAM, Viruses and Clouds (Cyber
A.M. Perry.
Page |9
 B.Sc. Part - IIComputer Science
Course Code: DSC-D12 (0ptional) (Semester - )
Computer Science Paper -VIII
Course Title: Data Structure Using
Total Contact Hours: 36 Hrs (45 C++
Lectures of 48 Min.)
Teaching Scheme: Theory - 03 Lect. / Weck
Credits: 02
TotalMarks: 50
Course Outcomes:
Upon successtul completion of this course, students will be able to
1. understandthe basic concepts such as Abstract Data Types, Linear and Non-Lincar Data
structures.
2 choose appropriate data structures to represent data items in real-world problems.
3. analyze the time and space complexities of algorithms.
4. des1gn programs using a variety of data structures such as array, stacks, queues, and
linked list.
5. analyze and implement various kinds of searching and sorting techniques.

Queue 18 Hrs.
Unit - l: Introduction to Data Structures: Stack and
1.1Concept of Abstract Data Types: Object, Data structure (D-Data, A-Axioms,
O
1.1.1 Definitions, Data types, Data
Operations),
Classification (Primitive, Non-Primitive: Array, Files, List: Linear, Non-Linear),
1.1.2 Insertion, Deletion, Sorting, Merging)
Searching,
1.1.3 Basic Operations (Traversing,
1.2 Sorting:
1.2.1Definition
1.2.2 Stable-Unstable Sorting
1.2.3 Adaptive-Non Adaptive Sorting
Sorting (Increasing, Decreasing, Non Increasing, Non Decreasing)
1.2.4 Order of sort
Techniques: Bubble sort,Selection sort, Insertion sort, Quick
1.3Sorting
Binary Search
1.4 Searching: Linear and
15 Stack:
1.5.1Definjition
Isfull, Isempty),
1.5.2 Operations (Push, Pop, Peek,
1.5.3 Implementation using array
Expressions (Well-Parentheses, Notations: Infix,
Mathematical
1.6 Applications of stack: Infix to Postfix and Infix to
Prefix)
Prefix, Postfix, Conversion from
1.7 Queue -
1.7.1 Definition of queue
Dequeue, Peek, Isfull, Isempty)
1.7.2 Operations (Enqueue,
Circular, Priority)
1.7.3 Types of queue (Linear, array(Compaction)
1.7.4 Implementation Linear Queue using
1.7.5 Applications of Queue
18 Hrs.
Trees
Unit - 2: Linked List and
2.1 Linked List:
2.1.1Concept of linked list
Linear-Circular)
2.1.2 Types Of Linked List (Singly-Doubly,
2.1.3 Implementation of Linked list
Page | 11
 2.1.4Operations on linear linked list (Insertion, Deletion, Display, Scarch)
2.1.5 Application
2.1.5.1 Implementation of stack and queue using linked list.
2.2 Trees:
2.2.1 Definition LeafExternal
(Root, Child, Parent. Siblings, Dcscendant, Ancestor,
2.2.2 Termino logies Depth, Height of
node/Internal node, Degree, Edge, Path, Level,
node, Branch
node, Height of tree, Forest)
2.3 Binary Tree:
2.3.1 Definition Balanced)
(Full/Proper/Plane,Complete, Perfect, Skewed,
Z.3.2 Types
2.4 BinarySearch Tree:
2.4.1 Definition Inorder,
2.4.2 Representation Tree Traversal: Preorder,
Search,
Operations (Insertion, Deletion,
2.4.3
Postorder)
Tenenbaum
Aaron M.
Reference Books C++ by Yedidyah Langsam,
Using C and
1 Data Structures C++-E
Balagurusamy
Strucure using Yashavant Kanetkar
2. Data Through C++ by
Structures S. Malik
3 Data Using C++ by D.
Strucure
4. Data