Shivaji University, Kolhapur

T. Y. B. Tech (Computer Science and Engineering) Sem – VI

1. Compiler Construction (PCC - CS601)
TEACHING SCHEME EXAMINATION SCHEME
Theory : 3 Hrs./Week Theory : ESE 70 Marks
CIE 30 Marks
Tutorial : ----- Term work : 25 Marks
Practical : 2 Hrs./Week Oral : -----

Pre-requisites: C, System Programming, Data structures

Course Objectives

1. To introduce the fundamentals of compilers and their phases.

2. To design and implement phases of a compiler.
3. To expose the students to various tools like LEX and YACC.

Course Outcomes

1. Recall the compiler phases and compiler construction tools like LEX and YACC.
2. To design and implement Lexical Analyser for a simple language.
3. To design and implement Syntax analyser for a simple expression.
4. To apply Syntax directed translations and Syntax Directed definitions to generate intermediate
code.
5. To identify appropriate code optimizing transformation for the given code.
6. To explain concept of code generation.

UNIT NO. OF
UNIT NAME & DETAILS
NO. LECTURES
Introduction:
1. Compilers, Phases of a compiler, Compiler construction tools, cousins of 5
the compiler.
Lexical Analysis:
Role of a Lexical analyzer, input buffering, specification and recognition
2. of tokens, finite automata implications, designing a lexical analyzer 6
generator.
Syntax Analysis:
Role of Parser, Writing grammars for context free environments, Top-
3. 7
down parsing, Recursive descent and predictive parsers (LL), Bottom-Up
parsing, Operator precedence parsing, LR, SLR and LALR parsers
Syntax Directed Translation and Intermediate Code Generation:
Syntax directed definitions, construction of syntax tree, S-attributed
4. 7
definitions, L-attributed definitions, Intermediate languages, assignment
statements, back patching.
T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 27
Shivaji University, Kolhapur

Code Optimization:
5. Principle sources of optimization, optimization of Basic Blocks, loops in 5
flow graphs, Peephole optimization
UNIT 6- Code Generation:
Issues in design of a code generator and target machine, Run time storage
6. management, Basic blocks and flow graphs, Next use information and 6
simple code generator, Issues of register allocation, code generation from
Dags.
Term Work
Minimum of 10 to 12 experiments should be carried out based on the following experiments based
on following list.
Practical List
Minimum of 10 to 12 experiments should be carried out based on the following experiments.
1. Design of preprocessor for C program.
2. Design a complete lexical analyzer for C language.
3. Program to create a symbol table generator.
4. Design a syntax analyzer for simple expression in c language using top down parsing.
5. Program to create a syntax tree for simple expression in c language using recursive descent
parsing.
6. To implement intermediate code generator for Boolean expression in three address code format.
7. Implement intermediate code generator for the conditional statements in three address code format.
8. Implement any one bottom up parsing [LR, SLR, LALR, Operator precedence] technique.
9. To implement a program for code generator from labeled tree.

Text Books

Sr. Publication & Units

Title Author(s) Name
No. Edition Covered
Compilers - Principles,
A. V. Aho, R .Shethi and Pearson
1. Techniques and Tools ALL Units
J. D. Ullman Education

Reference Books

Sr. Publication Units

Title Author(s) Name
No. & Edition Covered
1. Compiler construction D.M. Dhamdare Mc-Millan -
LEX & YACC Dong Brown, John O’Reilly 2nd Refer for
2.
Levine, Tony Mason Edition Practical’s

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 28

Shivaji University, Kolhapur

T. Y. B. Tech (Computer Science and Engineering) Sem –VI

2. Operating System -II (PCC - CS602)
TEACHING SCHEME EXAMINATION SCHEME
Theory : 4 Hrs./Week Theory : ESE 70 Marks
CIE 30 Marks
Tutorial : ----- Term work: 25 marks
Practical: 2 Hrs./Week Practical : -----

Pre-requisites: Data Structures, Concepts of Process, deadlock and System calls.

Course Objectives

1. Fundamental architecture of UNIX operating system kernel.

2. Detail algorithms of buffer cache management.
3. Internal File system organizations and related algorithms in UNIX.
4. System calls for UNIX file system.
5. Process structure, creation and management in UNIX.
6. Architecture and algorithms of process scheduling and memory management.
7. I/O subsystem architecture and algorithms.
Course Outcomes

Upon Completion of this course, students will be able to:

1. To understand UNIX kernel, its architectural components like file subsystem, process control
subsystem, memory management.
2. To understand a concrete way (UNIX i-nodes) of organizing a file system on a physical storage
medium.
3. To maintain UNIX directories, files, manage processes, manipulate data with proper use of
pipes and file redirection, UNIX filters.
4. To implement and handle various UNIX system calls.
5. To explain the principles of paging, virtual memory (VM) and describe the data structures and
components (both hardware and software) that are necessary to implement it.
6. To perform shell programming involving decision control, looping and control flow statements
on UNIX based machines.

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 29

Shivaji University, Kolhapur

UNIT NO. OF
UNIT NAME & DETAILS
NO. LECTURES
Introduction and buffer cache:
General Overview of the System - History, System
Structure, User Perspective, Operating System Services,
1. Assumptions About Hardware, Architecture of the UNIX
OS, Introduction to System Concepts, Kernel Data 10
Structure, System Administration.
Buffer Cache: - Buffer Headers, Structure of the Buffer
Pool, Scenarios for Retrieval of a Buffer, Reading and
Writing Disk Blocks, Advantages and Disadvantages of
Buffer Cache.
Internal Representation of Files:
I-nodes, Structure of the Regular File, Directories, Conversion of
2. 8
a Pathname to I-node, Super Block, I-node Assignment to a New
File, Allocation of Disk Blocks, Other File Types.
System Calls for File System:
Open, Read, Write, File and Record Locking, Adjusting the
Position of FILE I/O-LSEEK, Close, File Creation, Creation
3. of Special Files, Change Directory and Change Root, Change 6
Owner and Change Mode, Stat and FStat, Pipes, Dup,
Mounting and Un-mounting File Systems, Link, Unlink, File
System Abstractions, File System Maintenance.
The Structure of Processes:
4. Process States and Transitions, Layout of System Memory, The 8
Context of a Process, Saving Context of a Process, Manipulation
of the Process Address Space.
Process Control and Scheduling:
Process Control: - Process Creation, Signals, Process
Termination, Awaiting Process Termination, Invoking Other
5. Programs, The User ID of a Process, The Shell, System Boot 8
and the Init Process.
Process Scheduling: - Process Scheduling, System Calls for
Time, Clock.
Memory management and I/O Subsystem:
Swapping, Demand Paging, A Hybrid System with Demand
6. 8
Paging and Swapping.
Driver Interfaces, Disk Drivers, Terminal Drivers, Streams.

Term Work

 It should consist of minimum 10-12 experiments based on the above topics and
covering the following list of assignments. (Reference book – Linux System
Programming by Robert Love may be referred for the assignments listed below.)

1. Demonstration of how the Linux Kernel implements and Manages files.

2. Implement User Buffer I/O using ‘C’ program.
3. Study & Implement file management using low level file access system calls.

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 30

Shivaji University, Kolhapur

4. Implementation of various operations on Files (Create, Open, Read, Write, Append,

Fstat, Dup etc.,)
5. Implementation of various system call (OPEN, READ, WRITE) by reader & writer
process.
6. Study & Implementation of pipe () system call.
7. Demonstration of UNIX Process Management – from process creation to process
termination.
8. Study & Implementation of signal () system call.
9. Study and demonstration of different Memory Management Techniques.
10. Study and Implement Time, Sleep and Clock Management.
11. Client - Server communication using IPC mechanism: Unnamed pipe, Named pipe.
12. Implementation of Shell Scripts.
13. Implementation of system call for UNIX/Linux.
14. Study of boot loader like “Grub”
15. Study of compilation of Linux kernel.

Text Books

Sr. Publication & Units

Title Author(s) Name
No. Edition Covered

The design of Unix

1 Maurice J. Bach PHI All Units
Operating System
Reference Books

Sr.
Title Author(s) Name Publication & Edition
No.
Linux System
1 Robert Love SPD, O’ REILLY
Programming

Unix concepts Tata McGrow Hill,

2 Sumitabha Das
& administration 3rd Edition

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 31

Shivaji University, Kolhapur

T. Y. B. Tech (Computer Science and Engineering) Sem – VI

3. Database Engineering (PCC - CS603)
TEACHING SCHEME EXAMINATION SCHEME
Theory : 4 Hrs./Week Theory : ESE 70 Marks
CIE 30 Marks
Tutorial : ----- Term work : 25 marks
Practical: 2 Hrs./Week Practical : 50 Marks

Pre-requisites: Set Theory, Operating System, Data Structures.

Course Objectives

1. To understand fundamental concepts and algorithms of Database Systems.

2. To gain familiarity with SQL and DBMS.
3. To learn database design techniques.

Course Outcomes

1. Understand fundamentals of database management systems.

2. Represent logical design of database using E-R Diagram.
3. Analyze & construct good database design.
4. Apply SQL queries to design & manage the database.
5. Understand transactions, concurrency control and apply to database system.
6. Understand failures in database and appropriate recovery techniques.

UNIT NO. OF
UNIT Name and Contents
NO. LECTURES
INTRODUCTION TO DATABASES [Text Book 1]
Database System Applications, Purpose of Database Systems,
View of Data, Database Languages, Database Users &
1. 8
Administrators, Structure of Relational Databases, Database
Schema, Keys, Schema Diagrams, Relational Query Languages,
Relational Operations.
E-R MODEL AND DATABASE DESIGN
[E-R Model: Text Book 1] [Normalization: Text Book 2]
E-R Model: The Entity-Relationship Model, Mapping
Constraints, Keys, Entity-Relationship Diagrams, Reduction to
2. Relational Schemas, Extended ER features-Specialization, 10
Generalization, Aggregation.
Normalization: Data Redundancies & Update Anomalies,
Functional Dependencies. Canonical Cover, The Process of
Normalization, First Normal Form, Second Normal Form, Third
T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 32
Shivaji University, Kolhapur

Normal Form, Boyce-Codd Normal Form, Fourth Normal Form,

Fifth Normal Form.
STRUCTURED QUERY LANGUAGE (SQL) [Text Book 1]
Overview of the SQL Query Language, SQL Data Definition,
3. Basic Structure of SQL Queries, Additional Basic Operations, 8
Set Operations, Aggregate Functions, Nested sub Queries,
Modification of Databases, Join expression, Views.
DATA STORAGE & INDEXING [Text Book 1]
Physical storage media, File Organization, Organization of
4. records in File, Data Dictionary Storage, Database Buffer, Basic 8
Concepts indexing & hashing, Ordered Indices, B+ Tree Index
files, Multiple-Key Access, Static Hashing, Dynamic Hashing.
TRANSACTION MANAGEMENT [Text Book 1]
Transaction Concept, A Simple Transaction Model, Transaction
5. Atomicity and Durability, Transaction Isolation, Serializability, 9
Lock-Based Protocols, Timestamp-Based Protocols, Validation-
Based Protocols.
RECOVERY SYSTEM [Text Book 1]
Failure Classification, Storage, Recovery and Atomicity,
6. 5
Recovery Algorithm, Failure with Loss of Nonvolatile Storage,
Remote Backup Systems.

Term Work

Minimum 12 -14 Experiments based on the following topics.

1. Draw an E-R Diagram of any organization.

2. Reduce above mentioned E-R Diagram into tables.
3. Normalize any database from first normal form to Boyce-Codd Normal Form (BCNF).
4. Write a program of Database connectivity with any object oriented language.
5. Use DDL Queries to create, alter (add, modify, rename, drop) & drop Tables.
6. Use DML Queries to insert, delete, update & display records of the tables.
7. Create table with integrity constraints like primary key, check, not null and unique.
8. Create table with referential integrity constraints with foreign key, on delete cascade and on
delete set null.
9. Display the results of set operations like union, intersections & set difference.
10. Display the results of Join Operations like cross join, self join, inner join, natural join, left
outer join, right outer join and full outer join.
11. Display the records using Aggregate functions like min, max, avg, sum & count. Also use
group by, having clauses.
12. Display the results using String operations.
T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 33
Shivaji University, Kolhapur

13. Create & Update views for any created table.

14. Write java program to implement dense and sparse indexing
15. Write java program to implement B+ tree indexing.
16. Write java program to implement static hashing.
17. Study of NoSql.

Text Books

Sr. Publication & Units

Title Author(s) Name
No. Edition Covered
6th Edition,
Database System A. Silberschatz, H.F.
1 McGraw Hill 1,3,4,5,6
Concepts Korth, S. Sudarshan
Education.
Database Systems -
A practical approach 3rd Edition,
Thomos Connolly,
2 to Design, Pearson 2
Carolyn Begg
Implementation and Education
Management

Reference Books

Sr. Publication Units

Title Author(s) Name
No. & Edition Covered
Database Systems – 5th Edition
Design, Thomson
1 Rob & Coronel 3
Implementation and Course
Management Technology
4th Edition,
Fundamentals of Ramez Elmasri,
2 Pearson 2
Database Systems Shamkant B. Navathe
Education

******************************************************************************************

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 34

Shivaji University, Kolhapur

T. Y. B. Tech (Computer Science and Engineering) Sem – VI

4. Machine Learning (PCC - CS604)
TEACHING SCHEME EXAMINATION SCHEME
Theory : 3 Hrs./Week Theory : ESE 70 Marks
CIE 30 Marks
Tutorial :1 Hrs./Week Term work : 25 marks
Practical : ----- Practical : -----

Pre-requisites: Linear Algebra, Statistics, Probability Theory.

Course Objectives
1. To understand Machine Learning Aspects.
2. To understand primitives in learning process by Computer.
3. To understand nature of problems solved with Machine Learning.

Course Outcomes

On completion of the course, student will be able to

1. Explain Machine Learning concepts.
2. Analyze the Machine Learning model.
3. Design solution using Machine Learning techniques.
4. To tackle real world problems in domain of data mining, information retrieval, computer vision,
linguistics and bioinformatics, etc.

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 35

Shivaji University, Kolhapur

UNIT NO. OF
UNIT NAME & DETAILS
NO. LECTURES
Introduction to Machine Learning:
Introduction to Probability and Statistics,
Machine Learning: Definition, Terminology, Types of
1. 06
learning, Machine Learning Problem categories, Machine
learning architecture, process, Lifecycle, Performance
measures, tools and framework, data visualization.
Regression:
Simple regression – hypothesis, cost function, parameter
learning with gradient descent, learning rate, Gradient Descent
2. for linear regression, examples, simple regression in matrix form. 06
Multivariate Linear Regression – Multiple features, hypothesis
functions, Gradient Descent for multiple variables, Feature
scaling, polynomial regression
Classification- logistic regression & Naïve Bayes :
Logistic Regression – Definition, Hypothesis representation,
decision boundary, cost function, Gradient Descent for Logistic
Regression. Multiclass Classification,
3. Regularization - Over fitting &Under fitting, cost function, 07
Regularized Linear Regression, Regularized Logistic Regression,
Conditional probability and Naïve Bayes Classifier.
Instance-based classifier – K- Nearest Neighbor Classifier,
Bayesian Network, Hidden Markov Model.
Classification- Decision trees and Support Vector Machine:
Decision trees: definition, terminology, the need, advantages,
and limitations. Constructing and understanding Decision trees,
4. common problems with Decision trees, Decision tree algorithms, 06
random forest, examples.
Support Vector Machine: What is SVM, Kernel Trick, Cost
Function, Decision Trees vs. Support Vector Machine.
Unsupervised learning :
5. Clustering, K Means clustering, Hierarchical clustering, 04
Association Rule mining.
Neural Network & Recommendation System:
Neural Networks- Neuron representation and model, Hypothesis
for neuron, cost function, solution of a problem using single
neuron. Gradient descent for a neuron.
6. Neural network, Multiclass classification with neural network. 07
Learning in neural network-back propagation algorithm
Recommendation System: Popularity based recommender
engines, Content based recommendation engines, Classification
based recommendation engine, Collaborative filtering.

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 36

Shivaji University, Kolhapur

Term Work

 It should consist of minimum 10-12 assignments based on the above topics.

Text Books

Sr. Publication & Units

Title Author(s) Name
No. Edition Covered

Machine Learning with

BPB
1 Python- an approach to Abhishek Vijayvargia All Units
Publications
applied ML

Practical Machine Packt

2 Sunila Gollapudi 1,2
Learning Publishing Ltd
McGraw Hill
3 Machine Learning Tom M. Mitchell Education; First 1,2,3,4,5
Edition

Reference Books

Sr. Author(s) Publication Units

Title
No. Name & Edition Covered

John Paul Willey

1 Machine Learning for dummies
Muller Publication

PHI 2nd
2 Introduction to Machine Learning EthemAlpaydin 1,2
Edition-2013

3 http://neuralnetworksanddeeplearning.com/ 6

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 37

Shivaji University, Kolhapur

T. Y. B. Tech (Computer Science and Engineering) Sem –VI

5. Open Elective Course - II (OEC- CS605)

E- Commerce & Digital Marketing (OEC - CS605)

TEACHING SCHEME EXAMINATION SCHEME

Theory : 3 Hrs./Week Theory : ESE 70 Marks
CIE 30 Marks
Tutorial : ----- Term work : -----
Practical : ----- Practical : -----

Course Objectives:

1. To get the knowledge about business advantages of the e-commerce and digital marketing and its
importance

2. To develop a digital marketing plan and to make SWOT analysis

3. To get introduced with various digital channels, business tools in social networking

4. To understand the optimization of a Web site and SEO optimization

Course Outcomes:

1. Students will be able to identify the importance of the e-commerce and digital marketing for business
success
2. Students will be able to create a digital marketing plan, starting from the SWOT analysis and defining a
target group
3. Students will be able to identifying digital channels, business tools used in social networking
4. Students will be able to demonstrate the optimization of web site using business tools.
UNIT NO. OF
UNIT NAME & DETAILS
NO. LECTURES
Introduction to E-commerce, frameworks & architectures (4)
1. Introduction: The term “E-Commerce”, Business models related
to E-Commerce, Technical and economic challenges
Frameworks and architectures: Actors and stakeholders,
Fundamental sales process, Technological elements
B2C business, B2B business (5)
B2C Business: The process model and its variants, The pricing
challenge, The fulfillment challenge, The payment challenge, B2C-
business and CRM, B2C software systems
2. B2B business: The process model and its variants, B2B software
systems

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 38

Shivaji University, Kolhapur

Introduction to Digital Marketing (6)

How digital technologies transformed marketing?, Definitions-

digital marketing and multichannel marketing- Paid, owned and
earned media, the growing range of digital marketing platform,
digital marketing strategy-key features of digital marketing
3.
strategy, applications of digital marketing, benefits of digital
marketing, alternative digital business models, difference between
e-commerce and e-business, challenges in developing and
managing digital marketing strategy

Online marketplace analysis & macro environment (8)

Introduction: situation analysis for digital marketing, the digital

marketing environment, understanding customer journeys, online
consumer behavior and implications for marketing, business
4. models for e-commerce

Online macro environment: Technological forces, economic

forces, political forces, Legal forces, social forces and cultural
forces

Digital Marketing Strategy and relationship marketing (6)

Digital Marketing strategy development: how to structure digital
marketing strategy, strategy implementation
5.
Relationship marketing using digital platforms: Introduction,
the challenge of customer engagement, customer lifecycle
management

Marketing Communications (7)

Marketing Communications using digital media channels:

Introduction, search engine marketing, online public relations, e-
mail marketing and mobile text messaging, social media and viral
6. marketing, offline promotion techniques.

Case study: How the ministry of food processing took to social

media or world food India 2017.

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 39

Shivaji University, Kolhapur

Text Books:

1. Introduction to E-commerce: Combining Business & Information Technology 1 st Edition, (2016)

Martin Kutz. & bookboon.com
2. Digital Marketing: Strategy, Implementation and Practice, 6 th Edition by Dave Chaffey, Fiona
Ellis-Chadwik, Pearson Education.

Reference Books:

1. The Beginner's Guide to Digital Marketing (2015). Digital Marketer.

Pulizzi, J.(2014) Epic Content Marketing, McGraw Hill Education.
2. “Electronic Commerce”, Jeffrey F Rayport and Bharat Bhasker, Tata McGraw Hill.

It should consist of assignments on following topics within group of 4-5 students & its evaluation will be
considered for CIE

1. Define a target group (working in groups)

2. Creating web sites, MS Expression (working in groups)

3. Writing the SEO content (working in groups)

4. Google AdWords (working in groups)

5. CRM strategy (working in groups)

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 40

Shivaji University, Kolhapur

T. Y. B. Tech (Computer Science and Engineering) Sem – VI

5. Open Elective Course - II (OEC - CS606)

Cyber Security (OEC - CS606)

TEACHING SCHEME EXAMINATION SCHEME

Theory : 3 Hrs./Week Theory : ESE 70 Marks
CIE 30 Marks
Tutorial : ----- Term work : -----
Practical : ----- Practical : -----

Prerequisite: Fundamental knowledge of Data Communication, Networking and Information Security.

Course Objectives:
1. To gain knowledge about securing both clean and corrupted systems, protect personal data, and secure
computer networks
2. To examine secure software development practice
3. To understand key terms and concepts in I.T. ACT
4. To incorporate approaches for incident analysis and response

Course Outcomes:
On completion of the course, student will be able to
1. Explain the cyber security concepts.
2. Describe the cyber security vulnerabilities and prevention techniques.
3. Explain the different rules and regulations under I.T. ACT.
4. Explain the concepts of digital forensics & incident management

UNIT NO. OF
UNIT NAME & DETAILS
NO. LECTURES
Computer and Network Security 06
1.
Introduction to Computer Security - Introduction, How Seriously
Should You Take Threats to Network Security?, Identifying Types
of Threats, Basic Security Terminology, Concepts and
Approaches, Online Security Resources Networks and the Internet
: Introduction, Network Basics, How the Internet Works, Basic
Network Utilities , Advanced Network Communications Topics

Cyber Frauds, DoS, Viruses: 06

2. Cyber Stalking, Fraud, and Abuse: Introduction, How Internet
Fraud Works, Identity Theft, Cyber Stalking, Protecting Yourself

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 41

Shivaji University, Kolhapur

Against Cyber Crime. Denial of Service Attacks: Introduction,

DoS, Illustrating an Attack, Malware: Introduction, Viruses,
Trojan Horses, The Buffer-Overflow Attack. The Sassier
Virus/Buffer Overflow, Spyware, Other Forms of Malware,
Detecting and Eliminating Viruses and Spyware

Techniques Used by Hackers : 06

Introduction, Basic Terminology, The Reconnaissance Phase,
3.
Actual Attacks, Malware Creation, Penetration Testing

Computer Security Technology: 06

4. Introduction, Virus Scanners, Firewalls, Antispyware, IDS, Digital
Certificates, SSL/TLS, Virtual Private Networks, Wi-Fi Security

I.T. ACT: 06
Introduction, Cyber Security Regulations, Roles of International
5.
Law, the state and Private Sector in Cyberspace, Cyber Security
Standards. The INDIAN Cyberspace, I.T. Act

Introduction to Forensics: 06
Introduction, General Guidelines, Finding Evidence on the PC,
Finding Evidence in System Logs , Getting Back Deleted Files,
6. Operating System Utilities, Operating System Utilities, Mobile
Forensics: Cell Phone Concepts

Text Books:
1. Computer Security Fundamentals - Chuck Easttom, Pearson, third edition.
Reference Books:
1. Jason Luttgens, Matthew Pepe, Kevin Mandia, Incident Response & Computer Forensics, McGraw-Hill
Osborne Media, 3 rd edition , 2014.
2. Keith J. Jones, Richard Bejtlich, Curtis W. Rose, Real Digital Forensics: Computer Security and
Incident Response, Paperback – Import, 2005.
3. John Sammons, the Basics of Digital Forensics: The Primer for Getting Started in Digital Forensics
Paperback, February 24, 2012.
4. Hacking Exposed: Network Security Secrets & Solutions, Stuart McClure, Joel Scambray and
George.Kurtz, McGraw-Hill, 2005.
5. Ethical Hacking, Thomas Mathew, OSB Publisher, 2003.
7. Dave Shackleford, Virtualization Security: Protecting Virtualized Environments, John Wiley & Sons,
2012.
8. BRAGG, Network Security: The Complete Reference, McGraw Hill Professional, 2012

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 42

Shivaji University, Kolhapur

T. Y. B. Tech (Computer Science and Engineering) Sem – VI

6. C# Programming (PCC - CS607)
TEACHING SCHEME EXAMINATION SCHEME
Theory : 2 Hrs./Week Theory : -----

Tutorial : ----- Term work : 25 marks

Practical : 2 Hrs./Week Practical : 50 marks

Pre-requisites: C++, Java, HTML

Course Objectives

1. Understand code solutions and compile C# projects within the .NET framework
2. Demonstrate knowledge of object-oriented concepts using C#.NET application
3. Create and manipulate GUI components in C# and interact with database using ADO.NET in window based
application
4. Create network based and multithreaded applications using C#
5. Creating ASP.Net applications using standard .net controls
6. Maintain session and controls related information for users in multi-user web applications

Course Outcomes

1. Students will be able to develop correct, well-documented programs using the C# programming language.
2. Students will be able to learn to develop object-oriented programs using C# classes and objects
3. Students will be able to learn to use Windows Forms and WPF to create GUI-based programs
4. Students will be able to build networking and multithreading based programs using C#
5. Students will be able to design web applications using ASP.NET using ASP.NET controls in web applications.
6. Students will be able to debug and deploy ASP.NET web applications and create database driven ASP.NET
web applications.

UNIT NO. OF
UNIT NAME & DETAILS
NO. LECTURES
.Net architecture and C# Basics:
.Net Architecture: The Relationship of C# to .NET, The Common
Language Runtime, A Closer Look at Intermediate Language,
1.
Assemblies, .NET Framework Classes, Namespaces, 3
C# basics: Predefined data types, The Main () Method, More on
Compiling C# Files, Console I/O, Using Comments# Programming
Guidelines, Dynamic variables, DLL creation & calling.

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 43

Shivaji University, Kolhapur

Object oriented programming in C# :

Classes and Structs, Class Members, Anonymous Types, Structs,
Partial Classes, Static Classes, The Object Class, Extension
2. 4
Methods,
Inheritance: Types of Inheritance, Implementation Inheritance,
Modifiers, Interfaces
Arrays, Operators and casts and strings:
Arrays: Simple Arrays, Multidimensional Arrays, Jagged Arrays,
Array Class, Array and Collection Interfaces, Enumerations
3. Operators and casts: Operators, Type Safety, Comparing Objects 4
for Equality, Operator Overloading, User-Defined Casts,
String: System. String, Building Strings, String Builder Members,
Format Strings, Regular Expressions.
Windows Form & Database with ADO.NET:
Introduction to GUI application & components –add data control
programmatically, Link data to control, process all control, track
the visible forms, Find all MDI child forms, Save configuration
4. 5
setting for form, Force list box to scroll items, Restrict text box,
Use of auto complete combo-box ,Sort a list view, Database with
ADO.NET-Overview of Ado.NET, Data components in Visual
Studio .NET.
Threading and Networking:
Threading: Overview, Asynchronous Delegates, the Thread Class
and Thread Pools, Threading Issues, Synchronization, and Timers.
5. Networking: Networking-Obtain information about Local 4
network, Detect changes in network, Download data over HTTP or
FTP, Download a File & Process using Stream, Respond to HTTP
request from your application.
Introduction to ASP.NET 4.5
ONE ASP.NET: Introducing One ASP.NET, Simplifying a
Complex Ecosystem, How Do You Benefit?
ASP.NET web form structure: Application Location Options,
6. 4
The ASP.NET Page Structure Options, ASP.NET 4.5 Page
Directives, ASP.NET Page Events, Dealing with Post backs,
Cross-Page Posting ,ASP.NET Application Folders, Compilation,
Build Providers, Global.aspx

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 44

Shivaji University, Kolhapur

Term Work

1. It should consist of 10 to 12 experiments based on the above syllabus covering following list of
assignments
2. 50% of the experiment should be console based & 40 % experiment should be windows form
application. and 10% should be web-based application

Practical List:
1. Language Introduction (Includes console-based application, creation of DLL, running a program
without IDE) calling a method from another program.
2. OOPS concepts in C#-Class, Implementation Inheritance, Extension methods (Use any application).
3. Develop DLL file and use it in application program. (Use Any application)
4. Implementation of Interface Inheritance (Use Any Application).
5. Implementation of Multidimensional & Jagged array (Use Any application).
6. Use of properties in any application.
7. Implementation of Operator overloading (Any application).
8. String manipulation using String & String builder(Any application)
9. Develop program to use Regex. Matches method and Regular Expression pattern matching.
10. Design a Windows Form based application for different controls.(Any application)
11. Design a Windows Form based MDI application with different controls.(Any application)
12. Design a Windows Form based application for field validation.(Any application)
13. Design a any Windows Form based application with Database connectivity with all field
validation.(Any application)
14. Develop a Win1dows Form application that performs SELECT, INSERT, UPDAE & DELETE
queries and also displays the List of Books available in a Library System by fetching the details from
a database. The C# application must also contain the filter capability.
15. Implement console-based networking application to obtain information of network & detect changes
in network.
16. Design a Windows form application to download file & process it using stream.
17. Simple ASP.NET web application deployment in IIS server
18. Design simple login and registration page using client-side validation controls in ASP.NET
19. Do the server-side validation by using database connectivity for above problem and display all the
records of database when successfully logged in using ASP.NET.

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 45

Shivaji University, Kolhapur

Text Books

Sr. Publication & Units

Title Author(s) Name
No. Edition Covered
Christian Nagel, Bill,
Professional C# Evjen, Jay Glynn, Wrox 1 to 2 and unit
1
2012 & .Net 4.5 Morgan Skinner, Karli Publication 3 (threading)
Watson
A Programmer’s Unit 3
Apress
2 Guide to ADO.Net Mahaesh Chand Windows app
Publication
in C# and ADO.NET
Unit 3
Visual C# 2010 Allen Jones, Adam
Windows app
Recipes- A Freeman, Matthew Apress
3 and ADO.Net
Problem-Solution MacDonald, Rakesh Publication
and Unit 4
Approach Rajan
networking
Professional Unit 4 ASP part
WROX
4 ASP.NET 4.5 in C# John Wiley & Sons Inc. and Unit 5 and
publication
and VB 6

Reference Books

Sr. Publication
Title Author(s) Name
No. & Edition

ASP.NET 4.5-Black Dreamtech

1 Kogent
book Publication

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 46

Shivaji University, Kolhapur

T. Y. B. Tech (Computer Science and Engineering) Sem – VI

7. Domain Specific Mini-project (PW - CS608)
TEACHING SCHEME EXAMINATION SCHEME
Theory : ----- Theory : -----

Tutorial : ----- Term work : 25 marks

Practical : 2 Hrs./Week Practical : 50 marks

Pre-requisites:

1. Software Engineering Concepts

2. Object Oriented Concepts

Course Objectives
1. To expose the students to use engineering approach to solve domain specific real time problem.
2. To use the appropriate and newer technologies while developing the project.
3. To learn the skills of team building and team work.

Course Outcomes
Upon successful completion of this course, the student will be able to –
1. Identify specific problem statement from a selected domain.
2. Analyze the problem and prepare SRS and design document.
3. Write code and carry out testing.
4. Write a report covering details of the project and give presentation on a project.
Contents
The students should form group of 4 to 5 students and every group is supposed to choose a
specific domain (preferably from Smart India Hackathon problem statement) to do the mini
project. Further the group should identify the relevant problem in the selected domain and
propose the solution, which can be implemented as a mini-project using suitable technology.
The mini-project work should be evaluated by a team of teachers appointed by the department.
The evaluation and marking should include Continuous Internal Evaluation (CIE) and
Semester End Examination (SEE) during which the group should give presentation and
demonstration of their work done. Care should be taken to avoid out-sourcing of the work.

T.Y.B.TECH. (C.B.C.S.) COMPUTER SCIENCE AND ENGINEERING 47