0% found this document useful (0 votes)

23 views

Btech CSF Syllabus (18 19)

Uploaded by

emmettsteveson2

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

23 views

Btech CSF Syllabus (18 19)

Uploaded by

emmettsteveson2

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 146

School of Computing Science and Engineering

Department of Computer Science and Engineering

B. Tech CSE (with Specialization in Cyber Security and Forensics)
Semester – I
Teaching Scheme
(Hrs./Week) Examination Scheme

Sr. Course Formative Summative Total

Core Course Name Marks
No. Code Assessment Assessment
L T P C
CIA ESE

Course Lab Course Lab

1 17YES103 Information Security Fundamentals 2 -- -- 2 50 -- 50 -- 100

TOTAL 2 -- -- 2 50 -- 50 -- 100

CIA: Continuous Internal Assessment #: Internship for 15 days. CIA Weight age Description
L: Theory Lecture *: Oral Examination CIA 1 10% Home Assignment
CIA 2 20% Mid-Term Exam (MTE)
T: Tutorial UC: University Core
CIA 3 10% Seminar Presentation
P: Practical PC: Programme Core CIA 4 10% Research Based Activity
TH: Theory Exam. PE: Programme Elective TOTAL 50%

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: First Year Semester – I
Course: Information Security Fundamentals Course Code: 17YES102

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
2 -- -- 2 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) – 03Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
Basics of Computer Network, Internet Fundamentals, WWW

Objectives:
Students are able to:-
1 Understands the Information security and data integrity
2 Understands tools and techniques and algorithms used for information security
3 Understands to physical and network layer security
4 Operating system role in Information security
5 Auditing and Monitoring for information security

Unit
Details Hours
No
Module 1: The CIA Triad
3
Confidentiality, Integrity & Availability, What is Information Security? Identification and
1
Module 2: Authentication, Authorization and Access Control, Auditing and
3
Accountability.
Module 1: Cryptography, Operations Security
3
Modern Cryptography Tools, Protecting Data at rest, in motion, And in Use,
2
Module 2: Origins Of Operations Security, The Operations Security Process, Laws Of 3
Operations Security, Operations Security in our Personal Lives.
Module 1: Physical Security and Network Security
3
Introduction, Physical Security Controls, Protecting People, Data and Equipment.
3
Module 2:Protecting Networks,
3
Protecting Network Traffic. Network Security Tools.
Module 1:Operating System and Application Security
Operating System Hardening, Protecting Against Malware, Software Firewalls and Host 3
4 Intrusion Detection.
Module 2: Operating System Security Tools, Software Development Vulnerabilities, Web
3
Security, Database Security, Application Security Tools.
Module 1: Information Security - Audit and Monitoring, Intelligence, Compliance,
Management and Governance.
Change and Security Implications, System Models, Targets and Methods, Log
5 3
management, Data Aggregation and Reduction, Notifications and Reporting, Monitoring
and Control Challenges, Auditing Standards, SAS 70 Audits, Sarbanes-Oxley, Addressing
Multiple Regulations for Information Security

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2: Technical Frameworks for IT Audits, Intelligence and Compliance,
3
Management and Governance.

Outcomes:
On completion of the course, student will be able to–
1 Data Security and Data integration
2 Data encryption and decryption for data security
3 Knowledge of physical layer component and security
4 Operating system role in data security
Text Books
1. Information Security Fundamentals (IBM ICE Publication)
2. The Basics of Information Security: Understanding the Fundamentals of InfoSec in Theory and Practice
by Jason Andress
3. Computer Security Handbook, by Seymour Bosworth, M.E. Kabay and Eric Whyne
Reference Book
--

Document Reference Revision No. / Date Prepared By Approved By

Sr. Course Formative Summative Total

Core Course Name Marks
No. Code Assessment Assessment
L T P C
CIA ESE

Course Lab Course Lab

3 1 -- 4
1 17YES203 IT Physical Security 50 -- 50 -- 100

TOTAL 2 -- -- 2 50 -- 50 -- 100

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: First Year Semester – II
Course: IT Physical Security Course Code: 17YES203

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 1 -- 4 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03Hrs. End Semester Exam (Lab) - 00Hrs.

Prerequisites:
Introduction to security fundamentals, WWW, Internet

Objectives:
The course will enables students to:-
1 Physical Security Overview and Vulnerability Assessment
2 Security Surveys and the Audit
3 Approaches to Physical Security, Security Lighting, Alarms—Intrusion Detection Systems
4 Video Technology Overview, Biometrics Characteristics, Access Control and Badges, Fence
Standards
5 Fire and Fire Safety Inspection, Standards, Regulations, and Guidelines

Unit
Details Hours
No
Module 1: Physical Security Overview and Vulnerability Assessment
Importance Of Physical Security, Relationship Between Physical And Cyber Security,
Guard Against Disgruntled Employees And Angry Former Employees, How Activists And
Corporate Foes Can Hurt You, Vandals Who Damage For Fun, Saboteurs Who Work For 3
Profit, Thieves And Spies Are Everywhere, Domestic Terrorists Are Still A Threat,
International Terrorist Are A Growing Threat, Physical Security For Natural Disasters,
1
Security For Random Incidents, Steps To Improve Physical It Security,
Module 2:Influence Of Physical Design - Defensible Space, Crime Prevention Through
Environmental Design, Risk Management And The Vulnerability Assessment, Risk
Assessment And The Vulnerability Assessment Process, Statistics And Quantitative 4
Analysis, Vulnerability Process Overview, Reporting And Using Of Vulnerability
Assessment, System Engg And Vulnerability Assessment.
Module 1: Security Surveys and the Audit
Overview, The Best Time To Conduct The Survey, Why Conduct A Security Review,
Classification Of Survey Recommendations, Developing Security Points, Nine Points Of
Security Concern, Personality Of The Complex, Positive And Negative Aspects Of Making 4
Recommendations, Crime Analysis, Key Control, Digital Closed-Circuit Television,
2 Intrusion Alarms, Lighting And Security, Other Security Aspects, Security Survey Follow-
up, Residential Security, Home Security Checklist, Top Ten Security Threats, The Audit.
Module 2:Site Survey And Risk Assessment, Physical Security Survey - Exterior Physical
Characteristics: Perimeter Grounds, Plant Security Checklist , Security Officers Checklist ,
4
Office Security Checklist , Home Security Checklist - Exterior, Doors, Windows, General
Home Security, Miscellaneous, Fire Safety Inspection - Administrative And Planning Phase

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
, Bullet-Resistant Glazing For A Secure Workplace, Bullet-Resistant Fiberglass Wall
Panels, Bullet-Resistant Doors, Bullet-Resistant Windows, Window Film
Module 1: Approaches to Physical Security, Security Lighting, Alarms—Intrusion
Detection Systems
Overview, Levels Of Physical Security, The Value Of Planning, Physical Barriers, The
Security Plan. Protective & Physical Barriers - Perimeter Entrances, Barrier Planning,
Fence Standards, Types Of Security Fences, Doors, Roofs, Floors, Fences, Walls And
Moats, Topography, Use Of Locks In Physical Crime Prevention - Lock Terminology And
Components, Key-Operated Mechanisms, Combination Locks, Lock Bodies, Door Lock
4
Types, Strikes, Attacks And Countermeasures, Locks And The Systems Approach To
Security , Safes, Vaults,
3
And Accessories - Choose The Right Container, Ul-Rated Combination Locks, Relocking
Devices, Locking Dials, Lockable Handles, Time Locks, Time-Delay Combination Locks,
Alarmed Combination Locks, Vision-Restricting And Shielded Dials, Combination
Changing, Safe Burglaries, Hidden Combinations, Overcoming Safe-Opening Problems ,
Rating Files, Safes, And Vaults.
Module 2:Illumination, Types Of Lamps, Things Needed To Know About Lighting,
Energy Management, Lighting Definitions, Lighting Description, Components Of Alarm
4
Systems, Application, Alarm Equipment Overhaul, A Smoke Detectors, Alarm Certificate
Services - Definitions, Standards, Fire Classifications, Use Of Fire Extinguishers
Module 1:Video Technology Overview, Biometrics Characteristics, Access Control
and Badges, Fence Standards
Video System, Camera Function, Scene Illumination, Scene Characteristics, Lenses,
Cameras, Transmission, Switchers, Quads And Multiplexers, Monitors, Recorders,
3
Hardcopy Video Printers, Ancillary Equipment, Cctv Biometrics Characteristics Access
Control, Designated Restricted Areas, Degree Of Security, Considerations, Employee
4 Screening, Identification System, Id Methods, Mechanized/Automated Systems,
Card/Badge Specifications,
Module 2:Visitor Identification And Control, Visitors, Enforcement Measures,
Sign/Countersign And Code Word, Duress Code, Access Control Rosters, Control
Methods, Security Controls Of Packages, Personal Property, And Vehicles, Tactical- 4
Environment Considerations Fence Standards - Recommendations, Security Planning,
Material Specifications, Design Features And Considerations, Typical Design Example
Module 1:Fire and Fire Safety Inspection, Standards, Regulations, and Guidelines—
Compliance and Your Security Program, Including Global Resources & Security
personnel
How Fire Spreads? Four Ways To Put Out A Fire, Classifying Fire, Ul Standard 217, Water 4
Supply For Sprinklers And Tanks. Fire Safety Inspection - Administrative And Planning
Phase, General Physical Inspection Phase, Extinguisher Inspection Phase, Stand Pipe, Fire
5
Hose, And Control Valve Inspection Phase, Sprinkler System Inspection Phase.
Module 2: Hazardous Materials Inspection Phase, Alarm System Inspection Phase.
Introduction, Standards, Regulations, Guidelines, Managing Compliance, Resources.
Number And Function Of Guards, Uniform, Firearms, Vehicles, Guardhouses, 4
Communication, Rounds, Logbooks, Hazard Assessment, Command Structure, Emergency
Drills & Crisis Management

Outcomes:
On completion of the course, student will be able to–
1 Different types of vulnerability in physical layer security

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
2 Understand different intrusions detection systems
3 Different auditing systems for monitoring security issues
4 Understand different security standards and Regulations
Text Books
1. Physical Security (IBM ICE Publication)
2. Effective Physical Security by Lawrence J. Fennelly
3. Physical Security for IT by Michael Erbschloe
Reference Book
--

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering

B. Tech CSE (with specialization in Cyber Security and Forensics)

Semester – III

Teaching Scheme
(Hrs./Week) Examination Scheme
Sr. Formative Total
Summative Marks
Core Course Code Course Name
No. Assessment Assessment
L T P C CIA ESE
Course Lab Course Lab
Discrete Mathematics and
1 UC 17YBS304 3 -- -- 3 50 -- 50 -- 100
Logic
Digital Design and Computer
2 PC 17YCF301 3 -- -- 3 50 -- 50 -- 100
Organization
3 PC 17YCF302 Object Oriented Programming 3 -- -- 3 50 -- 50 -- 100
4 PC 17YCF303 Data Structures 3 -- -- 3 50 -- 50 -- 100
5 PC 17YCF304 IT Systems Security 3 -- -- 3 50 -- 50 -- 100
Object Oriented Programming
6 PC 17YCF311 -- -- 2 1 -- 25 -- 25 50
Lab
7 PC 17YCF312 Data Structure Lab -- -- 4 2 -- 25 -- 25 50
8 PC 17YCF313 IT System Security Lab -- -- 2 1 -- 25 -- 25 50
Dynamic Paradigm in Cyber
9 PC 17YCF314 -- -- 2 1 -- 50 -- - 50
Security and Forensics 1
10 UC 17YCF315 Industry Internship -- 1 -- 1 -- 50 -- -- 50
TOTAL 15 01 8 21 250 175 250 75 750

Note:
17YCF314 – Seminar and Webinars conducted by IBM Experts (Student must submit a Report on the same technical topic)
17YCF315 – Applicable for Natural growth students only, Maximum Two weeks, Students will submit report for the same

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Second Year Semester – III
Course: Discrete Mathematics and Logic Course Code: 17YBS304

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 1 0 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) -3 Hrs. End Semester Exam (Lab) - 0Hrs.

Prerequisites:
Basic Mathematics

Objectives:
Students are able to:-
1 To impart fundamentals of discrete mathematical structures useful in studying, analyzing
and solving problems in Computer Science.
2 To sharpen the mathematical skills by practicing problem solving, logical reasoning and
writing precise proofs.
3 To impart skills for applying ideas from discrete mathematics to real world problems.

Unit
Details Hours
No
Module 1:Need of Set, Representation of Sets, Subsets, Venn Diagrams, 3
complements, Cartesian products, Operations on sets, Laws of Set Theory, Power
Sets and Products, cardinality and countability (Countable and Uncountable sets),
1 Partition of sets, Multisets, The Principle of Inclusion - Exclusion.
Module 2: Propositions and Logical operations, Truth tables, Equivalence, 4
Implications, Laws of Logic, Normal forms, Predicates and quantifiers,
Mathematical Induction.
Module 1: Relations and their properties, n-array relations and their applications, 3
representing relations, closure of relations, equivalence of relations, partial
orderings, Hasse Diagram, Lattices, Chains and Anti-Chains, Transitive Closure
2
and Warshall‘s Algorithm.
Module 2:Surjective, Injective and Bijective functions, Inverse Functions and 4
Compositions of Functions, The Pigeonhole Principle.
Module 1:Basic terminology, representation of a graph in computer memory, 3
multi-graphs and weighted graphs, Sub graphs, Isomorphic graphs, Complete,
regular and bipartite graphs, operations on graph.
3
Module 2:Paths and circuits, Euler paths and circuits, Hamiltonian paths and 3
circuits, Planner graphs, shortest path in weighted graphs (Dijkstra’s algorithm),
coloring graphs, Isomorphism of Graphs.
Module 1: Basic terminology and characterization of trees, rooted trees and path 4
4 length in rooted trees, binary search trees, Tree traversal, Fundamental Trees and
cut sets.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2: Spanning tree and Minimal Spanning tree, Isomorphism of trees, 4
Weighted trees and Prefix Codes, The Max flow- Min Cut Theorem (Transport
network).
Module 1:Algebraic structures with one binary operation - semi groups, monoids 4
and groups, Isomorphism, homomorphism, automorphism, Cyclic groups,
5 Module 2:Normal sub group, codes and group codes, Algebraic structures with 4
two binary operations - rings, integral domains and fields. Ring homomorphism
and Isomorphism.

Outcomes:
At the end of this course students will be able to:-
1 Solve real world problems logically using appropriate set, function, and relation models and
interpret the associated operations and terminologies in context.
2 Analyze and synthesize the real world problems using discrete mathematics.
Text Books
1. C L Liu, “Elements of Discrete Mathematics”, Tata McGraw-Hill, ISBN 10:0-07-066913-9.
2. K.H. Rosen, “Discrete Mathematics and its application”, 7th edition, Tata McGraw Hill, ISBN
978-0-07-338309-5.
3. B. Kolman, Robert C. Busby, Sharon Ross, “Discrete Mathematical Structure”, 6th edition,
Pearson/Prentice Hall, ISBN 9780132078450.
Reference Book
1. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, 6th edition, McGraw-Hill,
2007, ISBN 978-0-07-288008-3.
2. Tremblay J. P. and R. Manohar, Discrete Mathematical Structures with Applications to
Computer Science, Tata McGraw-Hill, 1997.
3. Bernard Kolman, Robert C. Busby and Sharon Ross, Discrete Mathematical Structures, Prentice-
Hall of India /Pearson, ISBN: 0132078457, 9780132078450.
4. N. Biggs, “Discrete Mathematics‖”, 3rd Edition, Oxford University Press, ISBN 0-19 850717 – 8.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 -- -- 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) - 0Hrs.

Prerequisites:
Fundamentals of Programming Languages., Basics of Electronics Engineering

Objectives:
Students are able to:-
1 To understand the structure, function and characteristics of computer systems & Number
System.
2 To understand the various computer systems and logic gates.
3 To understand combinational and sequential logic circuits.
4 To understand memory concept.
5 To understand I/O devices and instruction sets.

Unit
Details Hours
No
Module 1:Basic Organization of Computers, Classification Micro, Mini, 3
Mainframe and Super Computer. System Bus and Interconnection, Computer
Function, Interruptand Class of Interrupts.
1
Module 2: Number systems, Decimal Number system, Binary number system, 4
Octal &Hexa decimal number system,1's & 2's complement, Binary Fixed Point
Representation.
Module 1:Von-Neumann M/c: Structure of IAS. Fundamental Concepts: Fetching 3
and storing a word in Memory, Register Transfer, Performing an Arithmetic &
Logic Operation, Execution of Instruction.
2
Module 2:Arithmetic operation on Binary numbers, Overflow &underflow.Logic 4
Gates, AND, OR, NOT GATES and their Truth tables, NOR, NAND & XOR
gates.
Module-1 Half Adder, Full Adder, 4-bit binary adder, multiplexer-2:1, 4:1, 8:1, 3
Demultiplexer-1:2, 1:4, 1:8.
3 Module 2 Latch, Flip Flop-SR FF, D FF, JK FF, Race around condition, T FF, 3
MSJK FF. Shift Registers-SISO, SIPO, PISO,PIPO, Counter-Asynchronous and
asynchronous.
Module 1:Cache memory- Computer Memory system Overview, Memory 4
4 hierarchy, Cache memory principles, Elements of cache design.
Module 2:Internal Memory-Semiconductor main memory, Error correction. 4

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
External Memory-Magnetic Disk, RAID.
Module 1:I/O-External Devices, I/O Modules, Programmed I/O, Interrupt Driven 4
I/O, DMA.
5 Module 2: Instruction Sets-Machine Instruction Characteristics, types of operands, 4
types of operations, Addressing Modes-Instruction Formats. Processor
Organization, Register Organization.

Outcomes:
At the end of this course students will be able to:-
1 Understand the structure, function and characteristics of computer systems & Number
System.
2 Understand the various computer systems and logic gates.
3 Understand combinational and sequential logic circuits.
4 Understand memory concept.
5 Understand I/O devices and instruction sets.
Text Books
1. Stephen Brown, Zvonko Vranesic, ―Fundamentals of Digital Logic with VHDL Design‖,
McGraw-Hill, ISBN–13:978-1-25-902597-6.
2. R.P. Jain, ―Modern Digital Electronics‖, TMH, 2012, ISBN–13: 978-0-07- 066911-6.
3. W. Stallings, ―Computer Organization and Architecture: Designing for performance‖, Pearson
Education/ Prentice Hall of India, 2003, ISBN 978-93-325-1870-4, 7th Edition.
4. Zaky S, Hamacher, ―Computer Organization‖, 5th Edition, McGraw-Hill Publications, 2001,
ISBN- 978-1-25-900537-5, 5th Edition.
Reference Book
1. John Yarbrough, ―Digital Logic applications and Design‖, Cengage Learning, ISBN – 13: 978-
81-315-0058-3
2. John P Hays, ―Computer Architecture and Organization‖, McGraw-Hill Publication, 1998,
ISBN:978-1-25-902856-4, 3rd Edition.
3. A.Tanenbaum, ―Structured Computer Organization‖, Prentice Hall of India, 1991 ISBN: 81 –
203 – 1553 – 7, 4th Edition of India /Pearson, ISBN: 0132078457, 9780132078450.
4. N. Biggs, “Discrete Mathematics‖”, 3rd Edition, Oxford University Press, ISBN 0-19 850717 – 8.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 - - 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) – 0 Hrs.

Prerequisites:
Fundamentals of Programming Languages

Objectives:
Students are able to:-
1 To study the object-oriented programming principles and techniques.
2 To understand fundamental concepts of OOP such as data abstraction, encapsulation,
inheritance, dynamic binding and polymorphism.
3 To create base of cutting-edge programming.

Unit
Details Hours
No
Module 1:Principles of OOP: Software crisis, Software evolution, OOP paradigm, 3
Basic Concepts of OOP, Benefits & applications of OOP. Functions: Function,
function prototype, accessing function and utility function.
1 Module 2:Moving from C to C++: Declaration of variable, Reference variables, 4
Scope resolution operator, Member dereferencing operator, memory management
operators. Beginning with C++: What is C++, Applications of C++, A Simple C++
Program.
Module 1: Class, Object, class and data abstraction, class scope and accessing 3
class members, Controlling access to members, Objects and Memory
requirements, Defining member functions, A C++ program with class, Making an
outside function inline, Nesting of member function, Private member function,
2 Arrays within class, Member allocation for objects, Arrays of objects, Objects as
function arguments. Static Class members, Static Functions, inline function, Friend
Function.
Module 2: Constructors, Parameterized constructors, Multiple constructors in a 4
class, Constructors with default arguments, Destructors.
Module 1: Polymorphism: Operator overloading concept, Use of operator 3
overloading, defining operator overloading, Binary operator overloading.
Module 2: Inheritance- Base Class and derived Class, protected members, 3
3 relationship between base Class and derived Class, Constructor and destructor in
Derived Class, Overriding Member Functions, Class Hierarchies, Inheritance,
Public and Private Inheritance, Levels of Inheritance, Multiple Inheritance,
Ambiguity in Multiple Inheritance.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1: Pointers- indirection Operators, Memory Management: new and delete, 4
Pointers to Objects, accessing Arrays using pointers, Function pointers, Pointers to
4 Pointers, this Pointer, virtual function, dynamic binding, Virtual destructor.
Module 2: function templates, Function overloading, overloading Function 4
templates, class templates, class template and Nontype parameters.
Module 1: Fundamentals of exception handling techniques, simple exception 4
handling- Divide by Zero, rethrowing an exception, exception specifications.
Module 2: Data hierarchy, Stream and files, Stream Classes, Stream Errors, Disk 4
5
File I/O with Streams, File Pointers, and Error Handling in File I/O, File I/O with
Member Functions, Standard Template Library: Introduction to STL, Containers,
algorithms and iterators.

Outcomes:
At the end of this course students will be able to:-
1 Apply standards and principles to write executable code.
2 Take a problem and develop the structures to represent the solution in the form of objects
and the algorithms.
3 Check the program and, if necessary, find errors in the program and rectify them.
Text Books
1. Balagurusamy, “Object Oriented Programming with C++” Sixth Edition, McGrawHill
Publication, ISBN 13:978-1-25-902993-6.
2. BjarneStroustrup, ―The C++ Programming language‖, Third edition, Pearson Education. ISBN
9780201889543.
Reference Book
1. Robert Lafore, ―Object-Oriented Programming in C++, fourth edition, Sams Publishing,
ISBN:0672323087 (ISBN 13: 9780672323089).
2. Herbert Schildt, ―C++ The complete reference‖, Eighth Edition, McGraw Hill Professional,
2011, ISBN:978-00-72226805.
3. Cox Brad, Andrew J. Novobilski, ―Object –Oriented Programming: An Evolutionary
Approach‖, Second Edition, Addison–Wesley, ISBN:13:978-020-1548341.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
C, C++, Data Structures and algorithms

Objectives:
The course will enables students to:-
1 To develop a logic for graphical modeling of the real life problems.
2 To suggest appropriate data structure and algorithm for graphical solutions of the problems.
3 To understand advanced data structures to solve complex problems in various domains.
4 To operate on the various structured data
5 To build the logic to use appropriate data structure in logical and computational solutions.

Unit
Details Hours
No
Module 1: Introduction to Data Structures: Concept of data, Data object, Data
structure, Abstract Data Types, realization of ADT in 'C'. Concept of Primitive and
non-primitive, linear and Non-linear, static and dynamic, persistent and ephemeral
data structures. Analysis of algorithm: frequency count and its importance in 4
analysis of an algorithm, Time complexity & Space complexity of an algorithm,
Big 'O', ‘Ω' and 'Θ' notations, Best, Worst and Average case analysis of an
1
algorithm
Module 2: Search Techniques, Sequential search, variant of sequential search-
sentinel search, Binary search, Fibonacci search.
Types of sorting-Internal and external sorting, General sort concepts-sort order, 4
stability, efficiency, number of passes, Sorting methods- Bubble sort, Insertion
sort, Selection sort, Quick sort, Heap sort, Shell sort
Module 1: Introduction of stack, Operations on stacks: Push & Pop, Array
representation of stack, Linked representation of stack, Application of stack,
Conversion of infix to prefix and postfix expressions, Evaluation of the postfix 4
expression using a stack. Iteration and recursion with examples such as binary
2
search, Fibonacci numbers, Use of stack in backtracking
Module 2: Array and linked representation, Operations on queue, Types of queue:
Circular queues, Advantages of Circular queue. Multiqueues, Dequeues and 3
Priority queue, Linked Queue & operations, Applications of Queue.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1: Basic concept, Representation of linked lists, Comparison of sequential
& linked organizations, Operations on linked list, linked list as ADT, Linked list
4
using dynamic memory management, Types of linked list: Linear, Circular linked
3 list, Doubly linked list and operations,
Module 2: Applications of linked list: Polynomial representation and addition,
Polynomial addition & Multiplication using linked list, Generalized Linked 4
list(GLL) concept, polynomial representation
Module 1: Tree- basic terminology, General tree and its representation,
representation using sequential and linked organization, Binary tree- properties,
converting tree to binary tree, binary tree traversals- inorder, preorder, post 4
order, level wise -depth first and breadth first, Operations on binary tree. Binary
4 Search Tree (BST), BST operations, Threaded binary tree- concepts, threading,
Module 2: Graph- Basic Concepts, Storage representation, Adjacency matrix,
adjacency list, Traversals-depth first and breadth first. Minimum spanning Tree,
3
Prims and Kruskal Algorithms, Dikjtra's Single source shortest path, Topological
ordering.
Module 1: Symbol Table-Representation of Symbol Tables- Static tree table and
Dynamic tree table, Height Balanced Tree- AVL tree.
4
Indexing and Multiway Trees-Indexing, indexing techniques, Types of search tree-
Multiway search tree, B-Tree, B+Tree
5 Module 2: Hash Table- Concepts-hash table, hash function, bucket, collision,
probe, synonym, overflow, open hashing, closed hashing, perfect hash function,
load density, full table, load factor, rehashing, issues in hashing, hash functions 4
properties of good hash function. Heap-Basic concepts, realization of heap and
operations

Outcomes:
On completion of the course, student will be able to–
1 To apply appropriate advanced data structure and efficient algorithms to approach the
problems of various domain.
2 To design the algorithms to solve the programming problems.
3 To use effective and efficient data structures in solving various Computer Engineering
domain problems.
4 To analyze the algorithmic solutions for resource requirements and optimization.
Text Books
1. Horowitz, Sahani, Dinesh Mehata, “Fundamentals of Data Structures in C++”, Galgotia
Publisher, ISBN: 8175152788, 9788175152786.
2. M Folk, B Zoellick, G. Riccardi, “File Structures, Pearson Education”, ISBN:81-7758-37-5.
3. Peter Brass, “Advanced Data Structures‖”, Cambridge University Press, ISBN:978-1-107-
43982-5
Reference Book
1. Aho, J. Hopcroft, J. Ulman, ―Data Structures and Algorithms‖, Pearson Education, 1998,
ISBN-0-201-43578-0.
2. Michael J Folk, ―File Structures an Object Oriented Approach with C++‖, Pearson Education,

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
ISBN: 81-7758-373-5.
3. G A V Pai, ―Data Structures and Algorithms‖, The McGraw-Hill Companies, ISBN -
9780070667266.
4. Goodrich, Tamassia, Goldwasser, ―Data Structures and Algorithms in Java‖, Wiley Publication,
ISBN: 9788126551903.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
DDCO

Objectives:
The course will enables students to:-
1 Understand data storage technique
2 Understand the authentication problems

Unit
Details Hours
No
Module 1: Tree- Introduction, 4
1
Module 2: Network security 4
Module 1: Hardware/Downloadable devices/Data storage, 4
2
Module 2: Physical security. 3
Module 1:Software updates to reduces vulnerabilities, 4
3
Module 2: Firewall. 4
Module 1: Account Management - One Time passwords . 4
4
Module 2: Account Management - Authentication. 3
Module 1: System Threats - Antivirus software, Worms, Trojan horse, Root kits, 4
5 Module 2: Port Scanning, Denial of service attack, Distributed Denial of Service
4
attack.

Outcomes:
On completion of the course, student will be able to–
1 Implementation of passwords
2 Know system threats
Text Books
IT Systems security (IBM ICE Publication)
Reference Book

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Second Year Semester – III
Course: Object Oriented Programming Lab Course Code:17YCF311

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA- Lab Theory Lab
4
0 0 2 1 -- -- -- -- 25 0 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03
Hrs.

Prerequisites:
C Programing

Objectives:
Students are able to:-
1 Have successful technical and professional careers in their chosen fields such as circuit
theory, Field theory, control theory and computational platforms.
2 Engross in life long process of learning to keep themselves abreast of new developments in
the field of Electronics and their applications in power engineering.

Guidelines for Assessment

Continuous assessment of laboratory work is done based on overall performance and lab
assignments performance of student. Each lab assignment assessment will assign grade/marks
based on parameters with appropriate weightage. Suggested parameters for overall assessment as
well as each lab assignment assessment include- timely completion, performance, innovation,
efficient codes, punctuality and neatness.
Guidelines for Laboratory Conduction
The instructor is expected to frame the assignments by understanding the prerequisites,
technological aspects, utility and recent trends related to the topic. The assignment framing policy
need to address the average students and inclusive of an element to attract and promote the
intelligent students. The instructor may set multiple sets of assignments and distribute among
batches of students. It is appreciated if the assignments are based on real world
problems/applications. Encourage students for appropriate use of Hungarian notation, Indentation
and comments. Use of open source software is encouraged.

In addition to these, instructor may assign one real life application in the form of a mini-project
based on the concepts learned. Instructor may also set one assignment or mini-project that is
suitable to respective branch beyond the scope of syllabus.

Set of suggested assignment list is provided in three groups. Each student must perform at least 13
assignments as at 05 compulsory from group A, 07 from group B and 01 from group C

Operating System recommended : 64-bit Open source Linux or its derivative

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
Group A (Compulsory Assignments)
1. Create class Student having Roll No. and Name member variable and get_data () and put_data()
member functions. Take values for member variables through member functions and print those
values by calling member functions through object.
2. Create any one class and demonstrate the use of static member variable and static member
functions.
3. Write a program to display name and age of five managers using array of objects.
4. Write a program to demonstrate the use of friend function within class.
5. Write a program containing Default Constructor, Parameterized Constructor, and Destructor.
Group B (Any 7)
1. Write a program to sort the numbers in an array using separate functions for read, display, sort
and swap.
2. Write a program to perform addition, subtraction, multiplication and division operations on
complex numbers.
3. Write a program to implement database of persons using inheritance which have different
profession e,g. engineer, doctor, student, laborer etc.
4. Write a program to perform addition, subtraction, multiplication and division operations on
complex numbers using operator overloading.
5. Write a program using Constructors and destructors to implement Stack. Design the class for
stack and the operations to be performed on stack.
6. Write a program in C++ to handle the “Divide by zero” exception.
7. Write a program in C++ using the open (), eof() and getline() member functions to open and
read file content line by line.
8. Write a program in C++having class Number which has inline function mult() and cube() for
calculating the multiplication of 2 double numbers given and cube of the integer number given.
9. Write a program in C++ for bubble sort using function template.
10. Write a program in Java with class Rectangle with the data field’s width, length, area and
colour. The length, width and area are of double type and colour is of string type. The methods
are get_length(), get_width(), get_colour() and find_area(). Create two objects of Rectangle and
compare their area and colour. If the area and colour both are the same for the objects then
display “Matching Rectangles”, otherwise display “Non-matching Rectangle”.
Group C (Any 1)
1. Write a program to store roll numbers of student in array who attended training program in
random order. Write function for- a) Searching whether particular student attended training
program or not using linear search and sentinel search. b) Searching whether particular student
attended training program or not using binary search and Fibonacci search.
2. Write program to implement a priority queue in C++ using an inorder List to store the items in
the queue. Create a class that includes the data items (which should be template) and the priority
(which should be int) Theinorder list should contain these objects, with operator <= overloaded
so that the items with highest priority appear at the beginning of the list (which will make it
relatively easy to retrieve the highest item.)

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
- - 4 1 -- -- -- -- 25 0 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs.

Prerequisites:
Basic Programming Language

Objectives:
Students are able to:-
1 To perform different c operations.
2 To understand searching and sorting.

Guidelines for Assessment

Set of suggested assignment list is provided in three groups. Each student must perform at least 13
assignments as at 05 compulsory from group A, 07 from group B and 01 from group C

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
Group A (Compulsory Assignments)
1. Write a program to perform Set operations - Union, Intersection, Difference, Symmetric

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Difference etc.
2. Write a program to perform various string operations such as Copy, Length, Reversing,
Palindrome, and Concatenation and to find occurrence substring etc with and without using
library functions.
3. Write a program to perform following operations on any database: Add, Delete, Modify, Display,
Search & Sort etc.
4. Implement Sorting Methods using functions- Bubble Sort, Selection Sort and Insertion Sort.
5. Implement Searching Methods-Sequential Search and Binary Search.
Group B (Any 7)
1. Implement Sorting Methods using recursion- Quick Sort and Merge Sort.
2. Represent polynomial using structures and write a menu driven program to perform Addition,
Multiplication and Evaluation.
3. Write a menu driven program to perform following operations on SLL/CDLL: Create, Insert –
Start, end, between, Search & delete, Reverse, Display etc.
4. Create two Singly Linked lists, sort one after creation and one while creation using Pointer
manipulation. Merge these two lists into one list without creating a new node or swapping of the
data.
5. Represent a polynomial using Circular Linked List and write a menu driven program to perform
Addition, Multiplication and Evaluation.
6. Implement Stack as an ADT using Array. Use this ADT to perform expression conversion and
evaluation (infix to postfix, infix to prefix, prefix to infix, prefix to postfix, postfix to infix and
postfix to prefix).
7. Represent Circular Queue using Linked List and write a program to perform operations like
Insert, Delete, Finding front and rear element.
8. Write a program for simulating job queue. Write functions to add job and delete job from queue.
9. Pizza parlor accepting maximum M orders. Orders are served in first come first served basis.
Order once placed cannot be cancelled. Write C++ program to simulate the system using
circular queue using array.
10. Write a program to perform various operation on Binary Tree
11. Write a program to perform various operation on Binary Search Tree
12. Write a program to perform various operation on Heap using linear probing
13. Write a program to perform various operation on Sequential file
Group C (Any 1)
1. Write a program to store roll numbers of student in array who attended training program in
random order. Write function for- a) Searching whether particular student attended training
program or not using linear search and sentinel search. b) Searching whether particular student
attended training program or not using binary search.
2. Write a program to perform various operation on index file
3. Write a C Program to implement hashing.
4. C Program to Implement Hash Tables chaining with Singly Linked Lists.
5. C Program for the Implementation of a Symbol Table with functions to create, insert, modify,
search and display

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA- Lab Theory Lab
4
- - 2 1 -- -- -- -- 25 -- 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03
Hrs.

Prerequisites:
Computer Organization

Objectives:
Students are able to:-
1 Understand data storage technique
2 Understand the authentication problems

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
Assignment list will be given by IBM ICE trainer

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Second Year Semester – III
Course: Dynamic Paradigm Cyber Security Course Code: 17YCF314
andDigital Forensics1

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA- Lab Theory Lab
4
- - 2 1 -- -- -- -- 50 -- -- 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
Computer Organization

Objectives:
The course will enables students to:-
1 Learn how to analyze multidimensional data properly.
2 Understand the role of formal statistical theory and informal data warehouse methods.

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
Seminars and Webinars conducted by IBM ICE trainer

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
-- 1 -- 1 -- -- -- -- 50 -- -- 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 00 Hrs.

Objectives:
Students are able to:-
1 To expose students to the 'real' working environment and get acquainted with the
organization structure, business operations and administrative functions.
2 To set the stage for future recruitment by potential employers.

Unit
Details Hours
No
Course (catalog) description: As a part of the B. Tech Curriculum, Industry
Internship is a Practical course, in which the students of CSE are trained for
technical skills.
Grading:
The Course is graded based on:
Presentation : 50%
Student’s reports : 50%
Employers Expectations:
Source of highly motivated pre professionals.
1 Students bring new perspectives to old problems.
Visibility of your organization is increased on campus.
Quality candidates for temporary or seasonal positions and projects.
Freedom for professional staff to pursue more creative projects.
Flexible, cost effective work force not requiring a long term employer
commitment.
Proven, cost effective way to recruit and evaluate potential employees.
Your image in the community is enhanced as you contribute your expertise to the
educational enterprise

Outcomes:
On completion of the course, student will be able to–
1 An ability to work in actual working environment.
2 An ability to utilize technical resources.
3 An ability to write technical documents and give oral presentations related to the work
completed.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
STUDENT EVALUATION OF INDUSTRY INTERNSHIP

Please respond to the following questions regarding your internship experience.

The purpose of this form is to provide opportunity for an honest appraisal of the internship site
and supervisor.

Organization: ___________________________________________

Semester/Year:_____________

Location: ___________________________________

Supervisor: _________________________________

1. Please rate the following aspects of your internship placement on the basis of this scale:

(0) No Observation, (1) Poor, (2) Fair, (3) Good, (4) Excellent

 Work experience relates to my career goals

 Adequacy of employer supervision
 Helpfulness of supervisor
 Acceptance by fellow workers
 Opportunity to use my training
 Opportunity to develop my human relations skills
 Provided levels of responsibility consistent with my ability and growth
 Opportunity to develop my communication skills
 Opportunity to develop my creativity
 Cooperativeness of fellow workers
 Opportunity to problem solve
 Opportunity to develop critical thinking skills
 Provided orientation to the organization
 Attempt to offer feedback on my progress and abilities
 Effort to make it a learning experience for me

Feel free to explain any of your responses to the above criteria here (use other side if
necessary):

2. Would you work for this supervisor again? ___ Yes ___ No ___ Uncertain

3. Would you work for this organization again? ___ Yes ___ No

Uncertain

4. Would you recommend this organization to other students? ___ Yes ___ No ___ Uncertain

Why or why not?

5. Your Name: ___________________________ Date:

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
B. Tech CSE (with specialization in Cyber Security and Forensics)

Semester – IV

Teaching Scheme
(Hrs./Week) Examination Scheme
Sr. Formative Total
Summative Marks
Core Course Code Course Name
No. Assessment Assessment
L T P C CIA ESE
Course Lab Course Lab
1 UC 17YBS401 Modern Mathematics 3 1 -- 4 50 -- 50 -- 100
Object Oriented Programming
2 PC 17YCF401 3 -- -- 3 50 -- 50 -- 100
in Java
3 PC 17YCF402 Database Management System 3 -- -- 3 50 -- 50 -- 100
4 PC 17YCF403 IT Application Security 3 -- -- 3 50 -- 50 -- 100
5 UC 17YHS401 Professional Ethics 3 -- -- 3 50 -- 50 -- 100
Object Oriented Programming
6 PC 17YCF411 -- -- 2 1 -- 25 -- 25 50
in Java Lab
Database Management System
7 PC 17YCF412 -- -- 2 1 -- 25 -- 25 50
Lab
8 PC 17YCF413 IT Application Security Lab -- -- 2 1 -- 25 -- 25 50
Dynamic Paradigm in Cyber
9 PC 17YCF414 -- -- 2 1 -- 50 -- -- 50
Security and Forensics 2
English Communication and
10 UC 17YFE411 2 -- 2 3 -- 25 -- 25* 50
Soft Skill
17YFF401/ Foreign Language (French I /
11 UC 17YFG402
2 -- -- 2 50 -- 50 -- 100
German I)
TOTAL 19 01 10 25 300 150 300 100 850

CIA: Continuous Internal Assessment #: Internship for 15 days.

CIA Weight age Description
L: Theory Lecture *: Oral Examination
CIA 1 10% Home Assignment
T: Tutorial UC: University Core
CIA 2 20% Mid-Term Exam (MTE)
P: Practical PC: Programme Core
CIA 3 10% Seminar Presentation
TH: Theory Exam. PE: Programme Elective
CIA 4 10% Research Based Activity
TOTAL 50%
Note:
17YCF414 – Seminar and Webinars conducted by IBM Experts (Student must submit a Report on the same technical topic)

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Second Year Semester – IV
Course: Modern Mathematics Course Code: 17YBS401

Prerequisites:
Basic Mathematics

Objectives:
The course will enables students to:-
1 To solve order linear differential equations.
2 To find the roots of polynomial equations by using numerical methods and to learn the
concepts of interpolation.
3 To understand the basic concepts of probability distributions, correlation, regression and
fitting of curves.
4 To understand the basic concepts of linear Programing problems.
5 To find the optimal solution of LPP by using simplex and dual simplex method

Unit
Details Hours
No
Module 1: Linear Differential Equations with constant coefficients, Homogeneous
4
1 Linear differential equations,
Module 2: Applications of LDE with constant coefficients to Electrical systems. 4
Module 1: Zeroes of transcendental and polynomial equation using Bisection
method, Secant method, Regulafalsi method and Newton Raphson method, Rate of 4
convergence of above methods.
2
Module 2:Interpolation: Finite differences, difference tables, Newton’s forward
and backward interpolation, Lagrange’s and Newton’s divided difference formula 3
for unequal intervals.
Module 1 Probability: Random variable, Binomial, Poisson, and Normal
4
distributions.
3
Module 2: Fitting of curves: Coefficient of correlation and lines of regression of
4
bivariate data, Fitting of Curves by method of Least squares.
Module 1: Formulation of Linear Optimization Problems, constraints, Graphical
4
method to solve LPP,
4
Module 2: Standard and Canonical forms, basic solutions and feasible solutions,
3
optimal solutions by simplex method.
Module 1: Artificial Variables, Duality concept, formulation of dual problems,
5 4
duality principle,

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2: Relation between Primal and Dual L.P.P., Dual simplex method. 4

Outcomes:
On completion of the course, student will be able to–
1 Solve linear differential equation using appropriate techniques.
2 Apply statistical methods like correlation, regression analysis and probability theory for
analysis and prediction of a given data as applied to machine intelligence.
3 Solve Linear Programming Problems.
Text Books
1. B. S. Grewal, Higher Engineering Mathematics, 43rd edition, Khanna Publishers.
2. A text book of Applied Mathematics: Vol. I, II and III by J. N. Wartikar& P. N. Wartikar ,
VidyarthiGrihaPrakashan, Pune.
3. Operations Research by T. A. Taha.
Reference Book
1. Ervin Kreyszig, Advanced Engineering Mathematics, 10th edition, John Wiley and Sons.
2. Peter V. O'Neil, Advanced Engineering Mathematics, 7th edition, Cengage Learning.
3. Operations Research by S. D. Sharma.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
C, C++.

Objectives:
The course will enables students to:-
1 To understand fundamental concepts of OOP such as data abstraction, encapsulation,
inheritance, dynamic binding and polymorphism.
2 To understand the implementation of OOP concepts with JAVA.
3 To learn the features of core java that makes it more popular.

Unit
Details Hours
No
Module 1: Introduction: Programming language Types and Paradigms, Why Java ,
4
Flavors of Java, Features of Java Language,
1 Module 2: JVM –The heart of Java, Java’s Magic Bytecode, Java Program
Development, Data types, Loops, Java Source File Structure, Compilation, 4
Executions.
Module 1: Inheritance : Use and Benefits of Inheritance in OOP, Types of
Inheritance in Java, Inheriting Data members and Methods , Role of Constructors 4
2 in inheritance.
Module 2:Overriding Super Class Methods, Use of “super”, Polymorphism in
3
inheritance, Type Compatibility and Conversion Implementing interfaces.
Module 1Array &String:Defining an Array, Initializing & Accessing Array, Multi
4
–Dimensional Array, Operation on String, Mutable & Immutable String,
3
Module 2:Using Collection Bases Loop for String, Tokenizing a String, Creating
4
Strings using StringBuffer.
Module 1:Exception Handling:The Idea behind Exception, Exceptions & Errors,
Types of Exception, Control Flow In Exceptions, JVM reaction to Exceptions, Use
4
of try, catch, finally, throw, throws in Exception Handling, In-built and User
Defined Exceptions, Checked and Un-Checked Exceptions.
4
Module 2:File Handling:Input/Output Operation in Java (java.io Package),
Streams and the new I/O Capabilities, Understanding Streams, The Classes for
3
Input and Output, The Standard Streams, Working with File Object, File I/O
Basics, Reading and Writing to Files, Buffer and Buffer Management.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1:GUI Programming:Designing Graphical User Interfaces in Java,
Components and Containers, Basics of Components, Using Containers, Layout
Managers, AWT Components, Adding a Menu to Window, Extending GUI
4
Features Using Swing Components, Java Utilities (java.util Package) The
5 Collection Framework : Collections of Objects , Collection Types, Sets ,
Sequence, Map, Understanding Hashing, Use of ArrayList& Vector.
Module 2:Event Handling:Event-Driven Programming in Java, Event- Handling
Process, Event-Handling Mechanism, The Delegation Model of Event Handling, 4
Event Classes, Event Sources, Event Listeners.

Outcomes:
On completion of the course, student will be able to–
1 Implement Object Oriented Programming Concepts
2 Use and create packages and interfaces in a Java program
3 Use graphical user interface in Java programs
4 Create Applets
5 Implement exception handling in Java
6 Implement Multithreading
7 Use Input/output Streams
Text Books
1. E Balagurusamy"Programming with Java", Fifth Edition, McGraw Hill Education, 2014, ISBN:
978-9351343202.
2. Herbert Schildt, “Java A Beginner's Guide”, 6th Edition, Tata McGraw-Hill , 2014, ISBN:
9789339213039.
3. R. NageswaraRao, “Core Java: An Integrated Approach”, 1est Edition, DreamtechPress , 2016,
ISBN: 978-9351199250.
Reference Book
1. Herbert Schildt"Java: The Complete Reference"; Ninth Edition, Oracle Press, ISBN 978-0-07-
180855-2.
2. D.T.EditorialSerices "Java 8 programming" Black Book.
3. D.T Editorial Services, R. NageswaraRao"Core Java: An Integrated Approach"

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Data Structures

Objectives:
The course will enables students to:-
1 To understand the fundamental concepts of database management
2 To learn databases and applications software primarily in the relational model
3 To use querying languages, primarily SQL, and other database supporting software
4 To understand the basic issues of transaction processing and concurrency control
5 To implement security and integrity policies relating to databases

Unit
Details Hours
No
Module 1: Database Concepts, Database System Architecture, Data Modelling:
Data Models, Basic Concepts, entity, attributes, relationships, constraints, keys, 4
users and architecture of DBA
1
Module 2: Components of E-R Model, conventions, converting E-R diagram into
tables, EER Model components, converting EER diagram into tables, legacy 4
system model
Module 1: Basic concepts, Attributes and Domains, Codd's Rules, Relational
Integrity: Domain, Entity, Referential Integrities, Enterprise Constraints, Views, 4
Schema Diagram, Database Design : Functional Dependency,Directives
2 Module 2: Purpose of Normalization, Data Redundancy and Update Anomalies,
Normalization: 1NF, 2NF, 3NF, BCNF. Decomposition: lossless join
3
decomposition and dependency preservation, Multi valued Normalization (4NF),
Join Dependencies and the Fifth Normal Form
Module 1: Introduction to SQL: Characteristics and advantages, SQL Data Types
and Literals, DDL, DML, DCL, TCL,SQL Operators, Tables: Creating,
4
Modifying, Deleting, Views: Creating, Dropping, Updating using Views, Indexes,
Nulls
3
Module 2: SELECT Query and clauses, Set Operations, Predicates and Joins, Set
membership, Tuple Variables, Set comparison, Ordering of Tuples, Aggregate
4
Functions, Nested Queries, Database Modification using SQL Insert, Update and
Delete Queries, MongoDB

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1: Stored Procedures, Cursors, Triggers, assertions, roles and privileges
4
Programmatic SQL: Embedded SQL, Dynamic SQL
4 Module 2: Basic concept of a Transaction, Transaction Management, Properties
of Transactions, Concept of Schedule, Serial Schedule, Serializability: Conflict 3
and View, Cascaded Aborts, Recoverable and Non- recoverable Schedules
Module 1: Need, Locking Methods, Deadlocks, Time-stamping Methods,
Optimistic Techniques, Recovery methods : Shadow-Paging and Log-Based 4
Recovery, Checkpoints
Module 2: Centralized and Client-Server Architectures, 2 Tier and 3 Tier
5
Architecture,Introduction to Parallel Databases, Key elements of Parallel Database
Processing, Architecture of Parallel Databases,Introduction to Distributed 4
Databases, Architecture of Distributed Databases, Distributed Database Design,
Internet Databases, Database Connectivity using Mongo databases

Outcomes:
On completion of the course, student will be able to–
1 Learn fundamental concepts of database management
2 Analyze database models & entity relationship models
3 Apply the basics of database languages and construct queries using SQL, PLSQL
4 Design cost effective transaction queries for databases.
Text Books
1. Silberschatz A., Korth H., Sudarshan S., "Database System Concepts", 6thEdition, McGraw Hill
Publishers, ISBN 0-07-120413-X
Reference Book
1. S.K.Singh, Database Systems : Concepts, Design and Application , 2nd Edition, Pearson, 2013,
2. Connally T., Begg C., "Database Systems", 3rd Edition, Pearson Education, 2002, ISBN 81-
7808-X
3. P. S. Deshpande, “SQL & PL / SQL for Oracle 11g Black Book”, DreamTech Publication

Document Reference Revision No. / Date Prepared By Approved By

Teaching
Scheme End Semester
Continuous Internal Assessment (CIA)
(Hrs. Examination Total
/Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 -- -- 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
IT System Security

Objectives:
The course will enables students to:-
1 This course is a study within the Information Assurance discipline of Application Security
as it relates to security assessments and secures deployment.

Unit
Details Hours
No
Module 1: Application Security, Authentication & Authorization
Input Validation - Buffer overflow; cross-site scripting; SQL injection;
4
canonicalization, Sensitive information Access sensitive data in storage; network
1 eavesdropping; data tampering.
Module 2: Network eavesdropping; Brute force attack; dictionary attacks; cookie
replay; credential theft. Elevation of privilege; disclosure of confidential data; data 4
tampering; luring attacks; Phishing
Module 1: Configuration management & Session management
Unauthorized access to administration interfaces; unauthorized access to
configuration stores; retrieval of clear text configuration data; lack of individual 4
2
accountability; over-privileged process and service accounts.
Module 2: Hijacking; session replay; man in the middle 3
Module 1: Cryptography, Parameter manipulation & Exception Management
Cryptography Poor key generation or key management; weak or custom
4
encryption. Parameter manipulation Query string manipulation; form field
3
manipulation; cookie manipulation
Module 2: HTTP header manipulation Exception Management Information
4
disclosure; denial of service
Module 1: Auditing and logging, Countermeasures
4
Auditing and logging User denies performing an operation
4
Module 2: attacker exploits an application without trace; attacker covers his or her
3
tracks, Countermeasures
5 Module 1: Introduction to code analysis 4

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2: Introduction to code analysis using IBM Rational AppScan 4

Outcomes:
On completion of the course, student will be able to–
1 Understand the role of IT Physical Security in transactions
2 Describe social networking and evaluate associated risks
3 Evaluate web application security vulnerabilities
4 Identify IT Physical Security controls and risk mitigation techniques
5 Develop a security strategy and solution for securing web based applications
6 Assess web application security compliance requirements and objectives.
Text Books
IT Application security (IBM ICE Publication)
Reference Book
----

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Soft Skills and Language.

Objectives:
The course will enables students to:-
1 To enable the students to imbibe and internalize the Values and Ethical Behavior in the
personal and Professional lives.

Unit
Details Hours
No
Module 1: Basic Concepts, Governing Ethics, Personal & Professional Ethics,
Ethical Dilemmas, Life Skills, Emotional Intelligence, Thoughts of Ethics, Value 4
Education.
1
Module 2: Dimensions of Ethics, Profession and professionalism, Professional
Associations, Professional Risks, Professional Accountabilities, Professional 4
Success, Ethics andProfession.
Module 1: Basic Ethical Principles, Moral Developments, Deontology,
Utilitarianism, Virtue Theory, Rights Theory, Casuist Theory, Moral Absolution. 4
2
Module 2: Moral Rationalism, Moral Pluralism, Ethical Egoism, Feminist
3
Consequentialism, Moral Issues, Moral Dilemmas, MoralAutonomy.
Module 1: Professions and Norms of Professional Conduct, Norms of
Professional Conduct vs. Profession; Responsibilities, Obligations and Moral
Values in Professional Ethics, Professional codes of ethics, the limits of 4
3 predictability and responsibilities of the engineering profession.
Module 2: Central Responsibilities of Engineers - The Centrality of
Responsibilities of Professional Ethics; lessons from 1979 American Airlines DC- 4
10 Crash and Kansas City Hyatt Regency Walk awayCollapse.
Module 1: Work Place Rights & Responsibilities, Ethics in changing domains of
Research, Engineers and Managers; Organizational Complaint Procedure,
4
difference of Professional Judgment within the Nuclear Regulatory Commission
4
(NRC), the Hanford Nuclear Reservation.
Module 2: Ethics in changing domains of research - The US government wide
3
definition of research misconduct, research misconduct distinguished from

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
mistakes and errors, recent history of attention to research misconduct, the
emerging emphasis on understanding and fostering responsible conduct,
responsible authorship, reviewing & editing.
Module 1:Introduction – Current Scenario, Technology Globalization of MNCs,
International Trade, World Summits, Issues, Business Ethics and Corporate 4
Governance.
5
Module 2:Sustainable Development Ecosystem, Energy Concerns, Ozone
Deflection, Pollution, Ethics in Manufacturing and Marketing, Media Ethics; War 4
Ethics; Bio Ethics, Intellectual Property Rights.

Outcomes:
On completion of the course, student will be able to–
1 The students will understand the importance of Values and Ethics in their personal lives
and professional careers. The students will learn the rights and responsibilities as an
employee, team member and a global citizen.
Text Books
1. Professional Ethics: R. Subramanian, Oxford University Press, 2015.
2. Ethics in Engineering Practice & Research, Caroline Whit beck, 2e, Cambridge University Press
2015.
Reference Book
1. Engineering Ethics, Concepts Cases: Charles E Harris Jr., Michael S Pritchard, Michael J
Rabins, 4e, Cengagelearning, 2015.
2. Business Ethics concepts & Cases: Manuel G Velasquez, 6e, PHI, 2008.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
0 0 2 1 -- -- -- -- 25 0 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs.

Prerequisites:
Object oriented programming

Objectives:
Students are able to:-
1 To teach the students basics of JAVA programs and its execution.
2 To teach the students the differences between C++ and Java programming.
3 To make the students learn concepts like packages and interfaces.
4 To make the students understand life cycle of the applets and its functionality.
5 To make the students understand the usage util package.

Guidelines for Assessment

Continuous assessment of laboratory work is done based on overall performance and lab assignments
performance of student. Each lab assignment assessment will assign grade/marks based on parameters
with appropriate weightage. Suggested parameters for overall assessment as well as each lab assignment
assessment include- timely completion, performance, innovation, efficient codes, punctuality and
neatness.
Guidelines for Laboratory Conduction
The instructor is expected to frame the assignments by understanding the prerequisites, technological
aspects, utility and recent trends related to the topic. The assignment framing policy need to address the
average students and inclusive of an element to attract and promote the intelligent students. The
instructor may set multiple sets of assignments and distribute among batches of students. It is
appreciated if the assignments are based on real world problems/applications. Encourage students for
appropriate use of Hungarian notation, Indentation and comments. Use of open source software is
encouraged.

In addition to these, instructor may assign one real life application in the form of a mini-project based
on the concepts learned. Instructor may also set one assignment or mini-project that is suitable to
respective branch beyond the scope of syllabus.

Set of suggested assignment list is provided in three groups. Each student must perform at least 13
assignments as at 05 compulsory from group A, 07 from group B and 01 from group C

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Group A (Compulsory Assignments)
1. Write a java program for employee class to display basic information.
2. Design a class in java to perform various mathematical operations on given numbers.
3. Write a java program for calculating area of circle.
4. Write a program for implementing single inheritance for student class.
5. Write a program for implementing multilevel inheritance for employee class.
Group B (Any 7)
1. Implement java program to display content of array.
2. Write a java program to find the prime number from 1 to 20.
3. Write a java program to display Fibonacci series of any number.
4. Implement a java program to perform addition of two numbers, accept numbers form user.
5. Write a java program to find.
a. Length of given string.
b. Reverse the string.
c. Palindrome.
6. Implement a java program to count number of vowels from given string.
7. Design an applet program to perform addition of two numbers.
8. Write an exception handling program to handle divide by zero and Array Index OutOfBounds
errors.
9. Implement AWT program to design student admission form.
10. Write a java program to read and write the content of given "example.txt" file.
Group C (Any 1)
2. Design a calculator using AWT.
3. Implement Tic Tac Toe using AWT.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Elementary knowledge about computers including experience of using UNIX.
Computer Programming & Utilization
Knowledge about data structures and algorithms, corresponding to the basic course on Data
Structures and Algorithms.

Objectives:
Students are able to:-
1 To understand Database Programming Languages.
2 To learn and understand SQL, PL/SQL ,NoSQL
3 To learn Relational Database (Open source) such as MongoDB, MySQL
4 To learn and understand Database Project Life Cycle.
5 To understand Database Programming Languages.

Guidelines for Assessment

Set of suggested assignment list is provided in three groups. Each student must perform at least 13
assignments as at 05 compulsory from group A, 07 from group B and 01 from group C

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
Group A (Compulsory Assignments)
1. Study of Open Source Databases : MySQL/ MongoDB/CouchDBetc.
2. Design and Develop SQL DDL statements which demonstrate the use of SQL objects such
3. Design 10 SQL queries for suitable database application using SQL DML statements:
Insert, Select, Update, Delete with operators
4. Design at least 10 SQL queries for suitable database application using SQL DML
statements: all types of Join, Sub-Query and View

5. Use the relations below to write SQL queries to solve the business problems specified.
CLIENT (clientno#,name, client_referred_by#)
ORDER (orderno#, clientno#, order_date, empid#)
ORDER_LINE (orderno#, order line number#, item_number#, no_of_items, item_
cost, shipping_date)
ITEM (item_number#, item_type, cost)
EMPLOYEE (empid#, emp_type#, deptno, salary, firstname, lastname)

Group B (Any 5)
1. Write a PL/SQL block to calculate the student grades.
2. Write a PL/SQL block to implement types of cursors.
3. Write a PL/SQL stored procedure and function.
4. Write a database Trigger.
5. Write and implement Sub queries /Nested Queries
6. Write and Implements all Arithmetic Functions.
7. Use the relations below to write SQL Nested queries with various Clauses to solve the
business problems specified.
CLIENT (clientno#,name, client_referred_by#)
ORDER (orderno#, clientno#, order_date, empid#)
ORDER_LINE (orderno#, order line number#, item_number#, no_of_items, item_
cost, shipping_date)
ITEM (item_number#, item_type, cost)
EMPLOYEE (empid#, emp_type#, deptno, salary, firstname, lastname)
Group C (Any 1)
1. Implement aggregation and indexing with suitable example using MongoDB
2. Implement Map reduces operation with suitable example using MongoDB.
3. Design and Implement any 5 query using MongoDB

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3
CIA- Lab Theory Lab
4
0 0 2 1 -- -- -- -- 25 0 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03
Hrs.

Prerequisites:
IT System security

Objectives:
Students are able to:-
1 Understands the different types of attack perform on system.
2 Understands the Unauthorized access to administration and confidential data in the system.
3 Understands application of cryptography in border sense.
4 Understands the different exploit perform without tracing.
5 Understands the application part of IBM Rational AppScan.

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
1. Study practical on Application Security, Authentication & Authorization.
2. Perform Buffer Overflow and Input Validation.
3. Perform brute force attack on another machine.
4. Perform the on dictionary attacks.
5. Perform Phishing operation on another system.
6. Generate Cookies and transfer to it different machine.
7. Perform practical on to take unauthorized access to administration interfaces.
8. Perform the man in the middle attack.
9. Perform cryptography operation using cipher text.
10. Perform cryptography using public, private and symmetric key.
11. Perform different code analysis using IBM Rational AppScan.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
2 - 2 3 10 20 10 20 -- -- 50 100
Max. Time, End Semester Exam (Theory) - 00 Hrs. End Semester Exam (Oral) – 01 Hrs.

Prerequisite
1. Functional grammar-Parts of speech, Tenses, Sentence pattern
2. Formal letter
3. Fluency in reading and speaking

Objectives:
The course will enables students to:-
1 To help the students in building interpersonal skills.
2 To develop Emotional Intelligence to deal with difficult situations.
3 To create an open environment for Communication.
4 To inculcate employability skills among students.

Unit
Details Hours
No
Module 1: Study Skills
Communication: Importance, barriers to communication, effective communication.
4
Listening Skills: Listening for Comprehension
1 Reading Skills: passages from varied registers
Module 2:
Written Skills: Formal writing, Email writing, picture composition 4
Writing for Social Media
Module 1: English
Parts of Speech 4
Vocabulary Building
Module 2:
2
Basic Sentence Pattern
Antonyms and Synonyms- functional usage 3
Idioms, Phrases and Proverbs
Passive Voice
Module 1 : Soft Skills – I
4
Self-awareness: SWOT/SWOC, Perceptions and Attitudes, Positive ttitude
3 Module 2:
Body Language 4
Interpersonal Skills

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1 :
Soft Skills – II 4
4 Presentation Skills
Module 2: Group Discussion
3
Interview Techniques.
Module 1:Reference & Study Skills
4
5 Use of Dictionary and Thesaurus
Module 2: Use of Articles, Journals and Reference booksWriting Reviews 4

Objectives:
Students should able to:
1. Students will acquire basic proficiency in English including reading and listening
comprehension, writing and speaking skills.
2. Students will be able to write formal letters effectively.
3. Students will be able to prepare, organize and deliver oral presentation.
4. Students will develop reading speed and build academic vocabulary.
5. Students will demonstrate behavior and attitudes appropriate to university environment.

Text Books
1. Communication Skills by Sanjay Kumar and PushpaLata, Oxford University Press.
2. Developing Communication Skill by Krishna Mohan, MeeraBanerji, McMillan India Ltd.
3. English for Business Communication by Simon Sweeney, Cambridge University Press.
Reference Book
1. Ethics in Engineering Practice and Research by Caroline &Whitbeck, Cambridge University
Press.
2. Personality Development and Group Discussions by Barun K. Mitra, Oxford University Press.
3. Group Discussions and Interview Skills by PriyadarshiPatnaik , Foundation Books , Cambridge
University Press.
4. The Power of Your Subconscious Mind by Dr Joseph Murphy MaanuGraphics , ISBN-13
9789381529560.
5. The 80/20 Principal by Richard Koch, Nicholas BrealeyPublishings , ISBN-13 9781857883992.
6. Time Management from Inside Out by Julie Morgenstern, Owl Books (NY), ISBN-13
9780805075908.
7. You can win by Shiv Khera, Macmillan, ISBN-139789350591932.
Web References
https://www.britishcouncil.in/sites/default/files/esfe_report.pdf
https://www.britishcouncil.org/sites/default/files/english-soft-skills-maghreb-research-report.pdf
http://nptel.ac.in/courses/109104030/references/references.pdf
http://promeng.eu/downloads/training-materials/ebooks/soft-skills/effective-communication-
skills.pdf
Journals
https://pdfs.semanticscholar.org/c1d3/e21ea8496e2d828678cde2981aac1bd4ce3e.pdf
http://www.iosrjournals.org/iosr-jhss/papers/Vol11-issue4/D01142022.pdf
https://www.tandfonline.com/doi/abs/10.1080/18186874.2016.1248061

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Computer Organization

Objectives:
The course will enables students to:-
1 Learn how to analyze multidimensional data properly.
2 Understand the role of formal statistical theory and informal data warehouse methods.

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
Seminars and Webinars conducted by IBM ICE trainer

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
2 - 2 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00
Hrs.

Objectives:
The course will enables students to:-
1 To be able to greet others formally and Informally ,say good bye and also frame and answer
W-questions about themselves and ask these questions to others
2 To be able to talk/write about their friends and their hobbies
3 To be able to talk about the city they live in, housing style, the important monuments and
the means of transport
4 To be able to talk about food habits and learn to communicate with the direct object.
5 To be able to talk about one’s family and relationships.

Unit
Details Hours
No
Module 1: Good Day!
Speech intentions: Greetings and Goodbyes, Introduce yourself and others, Speak
4
about yourself and others, Numbers till 20, To be able to say telephone, numbers
1 and email address, Spell it out, Speak about countries and their languages.
Module 2: Vocabulary: Numbers from 0-100, Countries and
Languages/nationalities Grammar: W- Questions (formal +informal / tuouvous), 4
Declarative sentences, Verbs, Personal pronouns Pronunciation, Alphabets.
Module 1: Friends, Colleagues and myself/S'ouvrir aux autres. Speech intentions:
Speak about hobbies, Arrange an informal meeting, State the days of the week,
4
telling the time in French /activity: dr. Appointment / speak work timings
Professions/le metier, Ordinal Numbers, Speak about seasons,
2 Module 2: Vocabulary, Hobbies, Days of the week, Numbers from70-
1000/practice date of birth, Professions, Months and seasons, Grammar, definite
articles ( Le,LA, les), for masculine, feminine gender agreement with gender. 3
verbs and personal pronouns 2, 3.Yes/ No questions, Plural, Verbs- to have and to
be ( avoir, etre)
Module 1In the city
Speech intentions:
1.State the names of places and buildings
3 4
2. Ask the address or directions to a place
3.Assign texts to a picture story/flashcards
4. Ask for things

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
5. State the names of various means of Transport
6. Ask for directions and to give directions
7. understand texts with international words and learn articles
Module 2: Grammar:
1. definite articles ( le LA Les)
2. indefinite articles (un, une,des) 4
3. negation with (ne---pas) (ne----pasde)
4. Formal imperative
Module 1: Goutera LA compagne(Enjoy your meal)
Speech intentions:
1. Speak about food
2. Make a shopping list
3. Converse while shopping
4. Understand texts using W- questions
4
5. Arrange the words and learn them
Vocabulary:
4
1. Meal timings
2.Grocery
3.Drinks
4. Shops
Module 2: Grammar:
1. Word order in sentences
3
2.Verbes acheter,payer, manger, boire
3. Usage of De, du, de la,des
Module 1: Family: Vocabulary related to family 4
5
Module 2: Film screening for all the lessons. 4

Internal Assessment:
CIA 1: Students will shoot a short introduction about themselves on the phone
CIA 2A: Receptive task: Read and understand a text
CIA 2B: Productive task: Write about 5-6 sentences about a friend/family member
CIA 3: Presentation on Nashik in the form of poster/picture post card according to the student's
choice/ monuments
CIA 4: The students will research into french food options inregionalzoneand make a presentation
on the topic in a format of their choice
Text Books
1. SaisonMETHODE DE FRANÇAIS A1
2. AlteregoA1
3. Apprenon le francais Niveau1-5
4. Jumelage
5. TRICOLOR
All books are published by GoyalsaabDelhi, We will be using SAISONA1 as the base for teaching.
Reference Book
All the audio available DELF ON didierfle.com/saison/www.didierfle.com/saison

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
2 - - 2 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00
Hrs.

Objectives:
The course will enables students to:-
1 To be able to greet others, say good bye and also frame and answer W-questions about
themselves and ask these questions to others.
2 To be able to talk/write about their friends and their hobbies.
3 To be able to talk/write about the city they live in, the important buildings there and the
means of transport.
4 To be able to talk/write about food habits and learn the accusative case in German.
5 To be able to talk/write about one’s family.

Unit
Details Hours
No
Module 1: Good Day!
Speech intentions:
Greetings and Goodbyes.
Introduce yourself and others
4
Speak about yourself and others
Numbers till 20
To be able to say telephone numbers and email address
Spell it out, Speak about countries and their languages.
Module 2:
1 Vocabulary:
Numbers from 0-100
Countries and Languages/nationalities
Grammar:
W- Questions (formal +informal / tuouvous) 4
Declarative sentences
Verbs
Personal pronouns Pronunciation
Alphabets.
Listening Comprehension
Module 1: Friends, Colleagues and myself/S'ouvrir aux autres.
2 Speech intentions: 4
Speak about hobbies

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Arrange an informal meeting
State the days of the week
Speak about work, work timings ans Professions
Numbers From 20
Speak about seasons
Module 2: Vocabulary
Hobbies
Days of the week
Numbers from 20
Professions
Months and seasons
Grammar,
Definite articles (der , die , das): Nominative Case for masculine, feminine and 3
neutral.
Verbs and personal pronouns 2
Yes/ No questions
Plural
Verbs- to have and to be ( haben, sein)
Reading Comprehension, Write simple texts using the grammar that has been
taught
Module 1In the city
Speech intentions:
1.State the names of places and buildings
2. Ask the address or directions to a place
3.Assign texts to a picture story/flashcards
4
4. Ask for things
5. State the names of various means of Transport
6. Ask for directions and to give directions
3
7. understand texts with international words and learn articles

Module 2: Grammar:
1. definite articles (der, die, das)
2. indefinite articles (ein, eine, ein)
4
3. negation with (kein, keine, kein)
4. Formal imperative
Join the sentences using “aber’ (but) and “und” (and)
Module 1: GutenAppetit! (Enjoy your meal)
Speech intentions:
1. Speak about food
2. Make a shopping list
4 3. Converse while shopping 4
4. Understand texts using W- questions
5. Arrange the words and learn them
Vocabulary:
1. Meal timings

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
2.Grocery
3.Drinks
4. Shops

Module 2: Grammar:
1. Word order in sentences
2. Accusative case
3
3. Verbs with Accusative
Form W-Questions, Statements and interrogative sentences and check the position
of the verb in the sentence
Module 1: Family: Vocabulary related to family
4
-Draw a family tree and describe one’s family
5
Module 2: , Film screening for all the lessons– Interactive session on films of the
4
units covered to understand the grasping of the vocabulary of all the 5 units

Outcomes:
CIA 1: Students will shoot a short introduction about themselves on the phone
CIA 2A: Internal exam
CIA 2B: Internal exam
CIA 3: Presentation on Nashik in the form of poster/picture post card according to the
student's choice
CIA 4: The students will research into food options in Nashik and make a presentation on
the topic in a format of their choice
Text Books
1. Netzwerk A1
2. Tangram A1
3. Studio D A1
4. Moment Mal A1
5. Themen 1
All books are published by Goyalsaab Delhi
We will be using Netzwerk A1 as the base for teaching.
Reference Book
www.youtube.com german150
https://www.youtube.com/channel/UC5ZnpdkQIit8TWhGVDiDnQQ
https://www.youtube.com/watch?v=PMj9kUPrnBk&t=46sMein Wegnach Deutschland
https://www.youtube.com/watch?v=X-J1t8q0wxMTypisch!
Dw.com/nico
www.vitaminde.de
Deutschtrainer A1 – Learning App from Google Store

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
B. Tech CSE (withspecialization in cyber security and forensics)
Semester- V

Teaching Scheme
(Hrs./Week) Examination Scheme
Sr. Course Formative Total
Summative Marks
Core Course Name
No. Code Assessment Assessment
L T P C CIA ESE
Course Lab Course Lab
Formal Languages and
1 PC 17YCF501 3 1 0 4 50 -- 50 -- 100
Automata Theory
2 PC 17YCF502 Operating System 3 -- 0 3 50 -- 50 -- 100
3 PC 17YCF503 IT Data Security 3 -- 0 3 50 -- 50 -- 100
4 PC 17YCF504 IT Network Security 3 -- 0 3 50 -- 50 -- 100
5 PC 17YCF505 Computer Networks 3 -- 0 3 50 -- 50 -- 100
6 PC 17YCF511 IT Data Security Lab -- -- 4 2 -- 25 -- 25 50
7 PC 17YCF512 IT Network Security Lab -- -- 4 2 -- 25 -- 25 50
8 UC 17YCF513 Industry Internship -- 1 -- 2 -- 25 -- -- 25
Dynamic Paradigm in Cyber
9 PC 17YCF514 -- -- 2 1 -- 25 -- -- 25
Security and Digital Forensics 3
10 UC 17YCF515 Audit Course I -- -- -- -- -- -- -- -- --
TOTAL 15 02 10 23 250 100 250 50 650

CIA: Continuous Internal #: Internship for 15 Weight

CIA Description
Assessment days. age
CIA 1 10% Home Assignment
L: Theory Lecture *: Oral Examination CIA 2 20% Mid-Term Exam (MTE)
T: Tutorial UC: University Core CIA 3 10% Seminar Presentation
CIA 4 10% Research Based Activity
P: Practical PC: Programme Core
TH: Theory Exam. PE: Programme Elective TOTAL 50%

Note:
17YCF514 :- After 4 th semester students must complete Three weeks of Industry Internship (Student must submit a Report)
17YCF515 :- Technical session Conducted by IBM Expert (Student must submit a Report on same technical topic)
$ :Probable MOOC and SWAYAM Courses.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Third Year Semester – V
Course: Formal Languages And Automata Theory Course Code: 17YCF501

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination
(Hrs. /Week) Total
L T P C CIA-1 CIA-2 CIA-3 CIA- Lab Theory Lab
4
3 1 - 4 10 20 10 10 - 50 - 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00
Hrs.

Prerequisites:
Discrete Mathematics and Logic

Objectives:
The course will enables students to:-
1 Classify machines by their power to recognize languages.
2 Employ finite state machines to solve problems in computing.
3 Explain deterministic and non-deterministic machines.
4 Comprehend the hierarchy of problems arising in the computer sciences.

Unit
Details Hours
No
Module 1: Fundamentals: Strings, Alphabet, Language, Operations, Finite state
machine, definitions, finite automaton model, acceptance of strings, and languages,
4
deterministic finite automaton and non deterministic finite automaton, transition
diagrams and Language recognizers.
1
Module 2:Finite Automata: NFA with Î transitions - Significance, acceptance of
languages. Conversions and Equivalence: Equivalence between NFA with and
4
without Î transitions, NFA to DFA conversion, minimization of FSM, equivalence
between two FSM’s, Finite Automata with output- Moore and Melay machines.
Module 1: Regular Languages: Regular sets, regular expressions, identity rules,
Constructing finite Automata for a given regular expressions, Conversion of Finite
4
Automata to Regular expressions. Pumping lemma of regular sets, closure
properties of regular sets (proofs not required).
2
Module 2:Grammar Formalism: Regular grammars-right linear and left linear
grammars, equivalence between regular linear grammar and FA, inter conversion,
3
Context free grammar, derivation trees, and sentential forms. Right most and
leftmost derivation of strings.
Module 1: Context Free Grammars : Ambiguity in context free grammars.
Minimization of Context Free Grammars. Chomsky normal form, Greibach normal
3 4
form, Pumping Lemma for Context Free Languages. Enumeration of properties of
CFL (proofs omitted).

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2:Push Down Automata: Push down automata, definition, model,
acceptance of CFL, Acceptance by final state and acceptance by empty state and
4
its equivalence. Equivalence of CFL and PDA, inter-conversion. (Proofs not
required). Introduction to DCFL and DPDA.
Module 1:Turing Machine, definition, model, design of TM, Computable
4
functions, recursively enumerable languages.
4
Module 2: Church’s hypothesis, counter machine, types of Turing machines
3
(proofs not required). Linear bounded automata and context sensitive language.
Module 1:Chomsky hierarchy of languages, linear bounded automata and
4
context sensitive language, LR(0) grammar, decidability of, problems,
5 Module 2:Universal Turing Machine, undecidability of posts. Correspondence
problem, Turing reducibility, Definition of P and NP problems, NP complete and 4
NP hard problems.

Outcomes:
On completion of the course, student will be able to–
1 Master regular languages and finite automata.
2 Master context ‐ free languages, push ‐ down automata, and Turing recognizable languages.
3 Be exposed to a broad overview of the theoretical foundations of computer science.
4 Be familiar with thinking analytically and intuitively for problem ‐ solving situations in
related areas of theory in computer science.
Text Books
1. “Introduction to Automata Theory Languages and Computation”. Hopcroft H.E. and Ullman J.
D. Pearson Education
2. Introduction to Theory of Computation – Sipser 2nd edition Thomson.
Reference Book
1. Introduction to Formal languages Automata Theory and Computation Kamala Krithivasan Rama
R.
2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
3. Theory Of Computation: A Problem - Solving Approach, Kavi Mahesh, Wiley India Pvt. Ltd.
4. “Elements of Theory of Computation”, Lewis H.P. &Papadimition C.H. Pearson /PHI.
5. Theory of Computer Science – Automata languages and computation -Mishra and
Chandrashekaran, 2nd edition, PHI.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
DDCO

Objectives:
The course will enables students to:-
1 To understand main components of OS and their working.
2 To study the operations performed by OS as a resource manager.
3 To understand the different scheduling policies of OS.
4 To understand the different memory management techniques.
5 To understand process concurrency and synchronization.
6 To understand the concepts of input/ output, storage and file management.

Unit
Details Hours
No
Module 1: Introduction and history of Operating systems, structure and perations;
4
processes and files
1 Module 2: Processor management : inter process communication, mutual
exclusion, semaphores, wait and signal procedures, process scheduling and 4
algorithms, critical sections, threads, multithreading
Module 1: Memory management contiguous memory allocation, virtual memory,
4
paging, page table structure
2
Module 2: demand paging, page replacement policies,thrashing, segmentation,
3
case study
Module 1 : Deadlock : Shared resources,resource allocation and scheduling,
4
resource graph models
3
Module 2: deadlock detection, deadlock avoidance, deadlock prevention
4
algorithms
Module 1: Device management : devices and their characteristics, device drivers 4
4
Module 2 : device handling, disk scheduling algorithms and policies 3
Module 1: File management : file concept, types and structures, directory
structure, 4
5
cases studies, access methods and matrices
Module 2: file security, user authentication. 4

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Outcomes:
On completion of the course, student will be able to–
1 Apply optimization techniques for the improvement of system performance.
2 Ability to understand the synchronous and asynchronous communication mechanisms in
their respective OS.
3 Learn about minimization of turnaround time, waiting time and response time and also
maximization of throughput with keeping CPU as busy as possible.
4 Ability to compare the different OS
Text Books
1. Operating System Principles, Abraham Silberchatz, Peter B. Galvin, Greg Gagne 8th Edition,
Wiley Student Edition.
2. Operating systems - Internals and Design Principles, W. Stallings, 6th Edition, Pearson.
Reference Book
1. Silberschatz& P.B. Galvin, ‘Operating System concepts and principles’, Wiley India, 8th ed.,
2009.
2. Tanenbaum, ‘Modern Operating Systems’, Prentice Hall India, 2003
3. W. Stallings, ‘Operating Systems: Internals and designPrinciples’, Pearson Ed., LPE, 6th Ed.,
2009.M.J. Bach, ‘Design of Unix Operating system’, Prentice Hall, 1986.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Second Year Semester – V
Course: IT Data Security Course Code: 17YCF503

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 - - 3 10 20 10 10 50 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00
Hrs.

Prerequisites:
Information Security Fundamentals

Objectives:
The course will enables students to:-
1 To define the concepts of confidentiality, availability and integrity as they relate to
information security.
2 To define the concepts of authentication, non-repudiation, access control and privacy
3 To construct a comprehensive information security policy based on environmental
characteristics

Unit
Details Hours
No
Module 1: Introduction, Data breach, Identity Theft, Bank fraud 4
1 Module 2:Census and Sampling Method, Parameter and Statistic, Independent and
4
Dependent Variables, Examining Relationships, Introduction to SPSS Statistics.
Module 1: Physical or Digital theft ( Stolen laptops, removable media,
4
2 impersonation), Malware, ,
Module 2: SQL Injection, Dumpster diving 3
Module 1Phishing and Pre-Phishing, 4
3
Module 2: Denial of Service attack, Social Engineering 4
Module 1: Introduction, Disk Encryption, Hardware based mechanisms for
4
4 protecting data,
Module 2: Backups, Data masking, Data Erasure 3
Module 1: Introduction Database Activity Monitoring. 4
5
Module 2: Database Activity Monitoring using IBM InfosphereGuardium 4

Outcomes:
On completion of the course, student will be able to–
1 To define the concepts of confidentiality, availability and integrity as they relate to
information security.
2 To define the concepts of authentication, non-repudiation, access control and privacy
3 To construct a comprehensive information security policy based on environmental

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
characteristics
Text Books
IT Data Security( IBM ICE Publication)
Reference Book

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Digital Design And Computer Organization

Objectives:
The course will enables students to:-
1 Understand networking types, networking devices
2 Understand the networking connectivity

Unit
Details Hours
No
Module 1: International Organization for Standardization/Open Systems
Interconnection (ISO/OSI) Layers and Characteristics, LANs vs. WANs, Network
1 Cabling.
Module 2: Wireless, LAN Technologies (Ethernet, Token Ring, and FDDI),
4
Network Topologies, Network Protocols.
Module 1:Lan Manager / Microsoft Network / NT Domains, TCP/IP, Weaknesses,
Routing Protocols, PPP (Point to Point Protocol), DNS (Domain Name Service), 4
NIS, NIS + (Network Information Service).
2
Module 2: DHCP (Dynamic Host Configuration Protocol), NFS (Network File
System), Appletalk, SNA, IPX/SPX, OSI protocols, X.25, DECNET, 3
Telephone/Fax Network.
Module 1: Ethernet, Leased lines, FDDI, ATM, Hubs, Bridges, Routers, Modems,
4
Gateways, Firewalls, Internet Email Gateway, Permission for external connections.
3 Module 2: Remote Access Security Management, Network and Protocol Security
Mechanisms (VPN, Secure Communications Protocols, E-Mail Security Solutions, 4
Dial Up Protocols, Authentication Protocols)
Module 1: Remote Access and Telecommuting Techniques (Frame Relay), Other
4
WAN Technologies (SMDS, X.25,
4
Module 2: ATM, HSSI, SDLC, HDLC, ISDN), Avoiding Single Points of Failure
3
(Redundant Servers, Failover, RAID)
Module 1: IBM Netview, HP Open view, Sun Net Manager. 4
5
Module 2: Introduction to Penetration Testing. 4

Outcomes:

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
On completion of the course, student will be able to–
1 Know networking devices and their implementation.
2 Know the connectivity protocol of each layer.
Text Books
IT Network Security (IBM ICE Publication)
Reference Book
--

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme (Hrs. Continuous Internal Assessment (CIA)
Examination Total
/Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 - - 3 10 20 10 10 - 50 - 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) –00 Hrs.

Prerequisites:
Basics of Computer Networks and Data Communications

Objectives:
The course will enables students to:-
1 To introduce the fundamental various types of computer networks.
2 To demonstrate the TCP/IP and OSI models with merits and demerits.
3 To explore the various layers of OSI Model.
4 To introduce UDP and TCP Models.

Unit
Details Hours
No
Module 1: Components – Direction of Data flow – Networks – Components and
Categories – Types of Connections – Topologies –Protocols and Standards – ISO / 4
OSI model, Example Networks such as ATM,
1
Module 2: Frame Relay, ISDN Physical layer: Transmission modes, Multiplexing,
Transmission Media, Switching, Circuit Switched Networks, Datagram Networks, 4
Virtual Circuit Networks.
Module 1: Introduction, Framing, and Error – Detection and Correction – Parity –
LRC–CRC Hamming code, Flow and Error Control, Noiseless Channels, Noisy 4
Channels, HDLC.
2
Module 2: Point to Point Protocols. 111 Medium Access sub layer: ALOHA,
CSMA/CD, LAN –Ethernet IEEE 802.3, IEEE 802.5 – IEEE 802.11, Random 3
access, Controlled access, Channelization.
Module 1: Logical Addressing, Internetworking, Tunneling, Address mapping,
4
3 ICMP, IGMP.
Module 2: Forwarding, Uni-Cast Routing Protocols, Multicast Routing Protocols. 4
Module 1: Process to Process Delivery, UDP and TCP protocols, Data Traffic,
4
Congestion, Congestion Control.
4
Module 2:QoS, Integrated Services, Differentiated Services, QoS in Switched
3
Networks.
Module 1: Domain name space, DNS in internet, electronic mail. 4
5
Module 2: , SMTP, FTP, WWW, HTTP, SNMP. 4

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Outcomes:
On completion of the course, student will be able to–
1 To master the terminology and concepts of the OSI reference model and the TCP ‐ IP
reference model.
2 To master the concepts of protocols, network interfaces, and design/performance issues in
local area networks and wide area networks.
3 To be familiar with wireless networking concepts.
4 To be familiar with contemporary issues in networking technologies.
5 To be familiar with network tools and network programming.
Text Books
1. Data Communications and Networking, Behrouz A. Forouzan , Fourth Edition TMH, 2006.
2. Computer Networks, Andrew S Tanenbaum, 4th Edition. Pearson Education, PHI.
Reference Book
1. Data communications and Computer Networks, P.C .Gupta, PHI.
2. An Engineering Approach to Computer Networks, S. Keshav, 2nd Edition, Pearson Education.
3. Understanding communications and Networks, 3rd Edition, W.A. Shay, Cengage Learning.
4. Computer Networking: A Top-Down Approach Featuring the Internet. James F. Kurose & Keith
W. Ross, 3 rd Edition, Pearson Education.
5. Data and Computer Communication, William Stallings, Sixth Edition, Pearson Education, 2000.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
0 0 4 2 -- -- -- -- 25 -- -- 25
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
Information Security Fundamentals

Objectives:
Students are able to:-
1 Open availability of robust, strong cryptography
2 A Secure Name Infrastructure
3 A Secure Forwarding Infrastructure
4 Encryption by default
5 A Useful Privacy and Security Public Policy Framework

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
1. Study of Network Security fundamentals -Ethical Hacking, Social Engineering practices.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
2. Study of System threat attacks -Denial of Services.
3. Study of Sniffing and Spoofing attacks.
4. Study of Techniques uses for Web Based Password Capturing.
5. Study of Different attacks causes by Virus and Trojans.
6. Study of Anti-Intrusion Technique –Honey pot.
7. Study of Symmetric Encryption Scheme – RC4.
8. Implementation of S-DES algorithm for data encryption
9. Implementation of Asymmetric Encryption Scheme –RSA.
10. Study of IP based Authentication.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA- Lab Theory Lab
4
- - 4 2 -- -- -- -- 25 -- 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs.

Prerequisites:
DDCO

Objectives:
Students are able to:-
1 Understand networking types, networking devices
2 Understand the networking connectivity

Guidelines for Assessment

Set of suggested assignment list is provided in three groups. Each student must perform at least 13
assignments as at 05 compulsory from group A, 07 from group B and 01 from group C

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
1. Study of different wireless network components and features of any one of the Mobile Security
Apps.
2. Study of the features of firewall in providing network security and to set Firewall Security in
windows.
3. Steps to ensure Security of any one web browser (Mozilla Firefox/Google Chrome)
4. Study of different types of vulnerabilities for hacking a websites / Web Applications.
5. Analysis the Security Vulnerabilities of E-commerce services.
6. Analysis the security vulnerabilities of E-Mail Application

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
-- -- 1 1 -- -- -- -- 25 -- -- 25
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 00 Hrs.

Unit
Details Hours
No
Course (catalog) description: As a part of the B. Tech Curriculum, Industry
Internship is a Practical course, in which the students of CSE are trained for
presentation skills.
Grading:
The Course is graded based on:
Presentation : 50%
Student’s reports : 50%
Employers Expectations:
Source of highly motivated pre professionals.
1 Students bring new perspectives to old problems.
Visibility of your organization is increased on campus.
Quality candidates for temporary or seasonal positions and projects.
Freedom for professional staff to pursue more creative projects.
Flexible, cost effective work force not requiring a long term employer
commitment.
Proven, cost effective way to recruit and evaluate potential employees.
Your image in the community is enhanced as you contribute your expertise to the
educational enterprise

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Third Year Semester – V
Course: Dynamic Paradigm in Cyber Security Course Code: 17YCF514
and Digital Forensics 3

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA- Lab Theory Lab
4
- - 1 1 -- -- -- -- 25 -- 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs.

Prerequisites:
Computer Organization

Objectives:
The course will enables students to:-
1 Learn how to analyze multidimensional data properly.
2 Understand the role of formal statistical theory and informal data warehouse methods.

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
Seminars and Webinars conducted by IBM ICE trainer

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
-- -- -- -- -- -- -- -- -- -- -- --
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 00 Hrs.

Objectives:
Students are able to:-
1
2

Guidelines for Conduction

In addition to credits, it is recommended that there should be audit course in preferably in V, VI, and
VII semester from third year to supplement knowledge and skills. The student may opt for one of the
audit courses per semester, starting from second year. Though not mandatory, such a selection of the
audit courses helps the learner to explore the subject of interest in greater details resulting in achieving
the very objective of audit course's inclusion. List of options offered is provided. Each student has to
choose one audit course from the list per semester. Evaluation of audit course will be done at institute
level itself. Method of conduction and method of assessment for audit courses are suggested.

Guidelines for Conduction and Assessment (Any one or more of following but not limited to)

 Lectures/ Guest Lectures  Surveys

 Visits (Social/Field) and reports  Mini Project
 Demonstrations  Hands on experience on specific focused topic

Guidelines for Assessment (Any one or more of following but not limited to)
 Written Test  IPR/Publication
 Demonstrations/ Practical Test  Report
 Presentations
Audit Course Options (Any one of following but not limited to)
 Road Safety
 Humanities and Social Sciences  Smart Cities
 Environmental Studies  Water Harvesting
 Water Management  Cyber Security Awareness

B. Tech CSE (with Specialization in Cyber Security and Forensics)

Semester – VI

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering

Teaching
Scheme Examination Scheme
(Hrs./Week)
Sr. Course Total
Core Course Name Formative Summative Marks
No. Code Assessment Assessment
L T P C CIA ESE
Course Lab Course Lab
1 PC 17YCF601 Design and Analysis of Algorithm 3 -- -- 3 50 -- 50 -- 100
Software Engineering and Project
2 PC 17YCF602 3 -- -- 3 50 -- 50 -- 100
Management
3 PC 17YCF603 Digital Forensics 3 -- -- 3 50 -- 50 -- 100
Information Security Audit
4 PC 17YCF604 Monitoring and Management 3 -- -- 3 50 -- 50 -- 100
Practices
5 PC 17YCFO__ Open Elective I 3 -- -- 3 50 -- 50 -- 100
6 PC 17YCF611 Digital Forensics Lab -- -- 4 2 -- 25 -- 25 50
Design and Analysis of Algorithm
7 PC 17YCF612 -- -- 4 2 -- 25 -- 25 50
Lab
8 UC 17YCF613 Seminars -- -- 4 2 -- 50 -- 50
Dynamic Paradigm Cyber Security
9 PC 17YCF614 -- -- 2 1 -- 50 -- -- 50
and Digital Forensics 4
10 UC 17YCF615 Audit Course-II -- -- -- -- -- -- -- -- --
TOTAL 15 00 14 22 250 150 250 50 700

CIA: Continuous Internal #: Internship for 15 Weight

Assessment days. CIA Description
age
L: Theory Lecture *: Oral Examination CIA 1 10% Home Assignment
T: Tutorial UC: University Core CIA 2 20% Mid-Term Exam (MTE)
P: Practical PC: Programme Core CIA 3 10% Seminar Presentation
TH: Theory Exam. PE: Programme Elective
CIA 4 10% Research Based Activity
TOTAL 50%

Open Elective I:
1. Web Technology(17YCFO01) 3. Business Intelligence(17YCFO03)
2. E-Commerce (17YCFO02) 4. Data Mining(17YCFO04)

Note:$ : Probable MOOC and SWAYAM Courses

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme (Hrs. Continuous Internal Assessment (CIA)
Examination
/Week) Total
L T P C CIA-1 CIA-2 CIA-3 CIA-4 La Theory Lab
b
3 1 -- 4 10 20 10 10 --- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
Data Structures, Discrete Mathematics and Logic

Objectives:
The course will enables students to:-
1 Analyze the asymptotic performance of algorithms.
2 Write rigorous correctness proofs for algorithms.
3 Demonstrate a familiarity with major algorithms and data structures.
4 Apply important algorithmic design paradigms and methods of analysis.
5 Synthesize efficient algorithms in common engineering design situations.

Unit
Details Hours
No
Module 1: Algorithm, Psuedo code for expressing algorithms, performance
4
Analysis-Space complexity, Time complexity,
1
Module 2: Asymptotic Notation- Big oh notation, Omega notation, Theta notation
4
and Little oh notation, probabilistic analysis, Amortized analysis.
Module 1: Divide and conquer: General method, applications-Binary search 4
2
Module 2:Divide and conquer: Quick sort, Merge sort 3
Module 1 : Greedy method: General method, applications-Job sequencing with
4
deadlines, knapsack problem.
3
Module 2:Greedymethod:Spanning trees, Minimum cost spanning trees, Single
4
source shortest path problem.
Module 1: Dynamic Programming: General Method, Applications-Matrix chain
4
multiplication, Optimal binary search tree,
4
Module 2: Dynamic Programming: 0/1 Knapsack problem, All pairs shortest path
3
problem, Travelling salesman problem, Reliability design.
Module 1: Backtracking: General method, Applications-N Queen problem, Sum
4
of subsets problem, Graph coloring, Hamiltonian cycles.
5 Module 2: Branch and Bound: General method, Applications- Travelling sales
person problem, LC Branch and bound solution, FIFO Branch and Bound 4
Solution.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering

Outcomes:
On completion of the course, student will be able to–
1 Analyze worst-case running times of algorithms using asymptotic analysis.
2 Describe the divide-and-conquer paradigm and explain when an algorithmic design situation
calls for it.
3 Describe the dynamic-programming paradigm and explain when an algorithmic design
situation calls for it.
4 Describe the greedy paradigm and explain when an algorithmic design situation calls for it.
Text Books
1. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and Rajasekharam,
Universities Press.
2. Design and Analysis of Algorithms , S Sridhar, Oxford
3. Design and Analysis of Algorithms, ParagHimanshu Dave, HimansuBAlachandra Dave,
2ed,Pearson Education.
Reference Book
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.
2. Introduction to the Design and Analysis of Algorithms, AnanyLevitin, PEA
3. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest and
C.Stein,PHI Pvt. Ltd.
4. Algorithm Design, Foundation, Analysis and internet Examples, Michel T Goodrich, Roberto
Tamassia, Wiley

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 0 4 5 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) –00 Hrs.

Prerequisites:
Problem solving and object oriented programming, Fundamental of data structures

Objectives:
1 To understand the nature of software complexity in various application domains, disciplined
way of software development and software lifecycle process models.
2 To introduce principles of agile software development, the SCRUM process and agile
practices.
3 To know methods of capturing, specifying, visualizing and analyzing software requirements
4 To understand project management through life cycle of the project.
5 To understand current and future trends and practices in the IT industry.
6 To learn about project planning, execution, tracking, audit and closure of project.

Unit
Details Hours
No
Module 1:Introduction To Software Engineering
Nature of Software, Software Process, Software Engineering Practice, Software
Myths, Generic Process model, Analysis and comparison of Process Models:
5
Waterfall Model, Incremental Models, Evolutionary Models, Concurrent,
1 Specialized Process Models, Personal and Team Process Models, Introduction to
Clean Room Software Engineering.
Module 2: Software Quality Assurance (SQA)
Verification and Validation, SQA Plans, Software Quality Frameworks, ISO 4
9000 Models, CMM Models.
Module 1:Requirements Capturing:
requirements engineering (elicitation, specification, validation, negotiation, 5
prioritizing requirements (Kano diagram) - real life application case study.
Module 2:Requirements Analysis:
2
basics, scenario based modelling, UML models: use case diagram and class
diagram, data modelling, data and control flow model, behavioralmodeling using 4
state diagrams - real life application, case study, software Requirement
Specification. Project Planning
Module 1:Agile Development:
3 5
Agile manifesto, agility and cost of change, agility principles, myth of planned

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
development, toolset for the agile process.
Module 2: Extreme Programming:
XP values, process, industrial XP, SCRUM - process flow, scrum roles, scrum
cycle description, product backlog, sprint planning meeting, sprint backlog, sprint
execution, daily scrum meeting, maintaining sprint backlog and burn-down chart, 4
sprint review and retrospective.
Agile Practices: test driven development, refactoring, pair programming,
continuous integration, exploratory testing versus scripted testing
Module 1:Project monitoring and control:
tools for project management, Software tools like Microsoft project management 5
or any other open source tools.
Module 2: The Importance of Project Quality Management:
4
Planning Quality Management, Performing Quality Assurance, Controlling
Quality, Tools and Techniques for Quality Control (statistical control, six sigma) 4
The Importance of Project Risk Management, Planning Risk Management,
Common Sources of Risk in IT Projects.
Module 1:Software configuration management:
SCM basics, SCM repository, SCM process, SCM tools such as GitHub, CASE –
5
taxonomy, tool-kits, workbenches, environments, components of CASE, categories
(upper, lower and integrated CASE tools).
Module 2:Emerging software engineering trends:
5
technology evolution, process trends, collaborative development, est-driven
development, global software development challenges
4
Project Management trends: CRM, ERP: Basic concepts, Advantages and
limitations, SAP, Business process reengineering, International Project
Management, Case studies

Outcomes:

1 To identify unique features of various software application domains and classify software
applications.
2 To choose and apply appropriate lifecycle model of software development.
3. To describe principles of agile development, discuss the SCRUM process and distinguish
agile process model from other process models.
4. To analyze software requirements by applying various modeling techniques.
5. To list and classify CASE tools and discuss recent trends and research in software
engineering
6 To understand IT project management through life cycle of the project and future trends in
IT Project Management.
Text Books
1. Roger S Pressman, Software Engineering: A Practitioner’s Approach, Mcgraw-Hill, ISBN:
0073375977,Seventh or Eighth Edition.
2. Joseph Phillips, IT Project Management –On Track From Start to Finish, Tata McGraw-Hill,
ISBN13:978-0-07106727-0, ISBN-10: 0-07-106727-2.
Reference Book

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
1. PankajJalote, Software Engineering: A Precise Approach, Wiley India, ISBN: 9788126523115.
2. Marchewka, Information Technology Project Management, Wiley India, ISBN: 9788126543946.
3. Chris Dawson with Ben Straub, Building Tools with GitHub, O’Relly, Shroff publishers, ISBN:
978-93-5213-333-8.
4. C. Michael Pilato, Ben Collins-Sussman and Brian Fitzpatrick, Version Control with subversion,
O’Relly, Shroff publishers, ISBN: 978-81-8404-728-8.
5. P.C. Tripathi, P.N. Reddy, Principles of Management, Tata McGrew Hill Education Private
Limited,ISBN: 9780071333337, ISBN: 0071333339.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Information Security, System Security

Objectives:
The course will enables students to:-
1 Demonstrate knowledge and comprehension of basic tools and techniques used in the field
of computer forensics sciences.
2 Demonstrate general knowledge and comprehension of digital forensic sciences as a
profession.

Unit
Details Hours
No
Module 1:. Computer Forensics
Standard Procedure, Incident Verification, System identification, Recovery of Erased and 3
1 damaged data, Disk imaging and preservation,
Module 2:Data encryption and compression, Automated search techniques, Forensic
3
software
Module 1: Network Forensics
Tracking network traffic, Reviewing Network Logs, Tools, Performing Live Acquisitions, 4
Order of volatility, Standard Procedure
Module 2:. Internet Forensics
Internet & World wide web threats ( Email, Chat-rooms, Search Engines, Hacking &
2 illegal access, Obscene and indecent transmission, Extortion & threats ) Domain Name
Ownership Investigation, Reconstructing Past Internet Activities and Events, Email
Forensics: E-mail Analysis, Email Forensics: Email Headers and Spoofing, Email 3
Forensics: Laws Against Email Crime, Messenger Forensics: AOL, Yahoo, MSN, and
Chats, Browser Forensics: Analyzing Cache and Temporary Internet Files, Browser
Forensics: Cookie Storage and Analysis, Browser Forensics: Web Browsing Activity
Reconstruction
Module 1:Forensic Investigation and Evidence Presentation
Authorization to collect the evidence, Acquisition of evidence, Authentication of the
evidence, Analysis of the evidence, Reporting on the findings, Testimony 4
3 Legal aspects of Digital Forensics: Laws & regulations - Information Technology
Act Giving evidence in court
Module 2:Mobile Forensics
4
Collecting and Analyzing Cell Phone, PDA, Blackberry, iPhone, iPod, iPad,and MP3

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Evidence, Analyzing CD, DVD, Tape Drives, USB, Flash Memory, and other Storage
Devices, Digital Camera Forensics, Reconstructing Users Activities, Recovering and
Reconstructing Deleted Data
Module 1:Steganography
4
Steganography Tools and Tricks, Data Hiding, Data Recovery
4
Module 2:Memory Forensics
3
Memory Data Collection and Examination, Extracting and Examining Processes
Module 1:Malware Analysis:
Analyzing Live Windows System for Malware, Analyzing Live Linux System for
Malware, Analyzing Physical and Process Memory Dumps for Malware, Discovering and 4
5 Extracting Malware from Windows Systems, Discovering and Extracting Malware from
Linux Systems,
Module 2:
4
Rootkits and Rootkit Detection and Recovery, Reverse Engineering Tools and Techniques

Outcomes:
At the end of the course, the student will
1 Understand the market dynamics namely, demand and supply, demand forecasting,
elasticity of demand and supply, pricing methods and pricing in different market structures.
2 Gain an insight into how production function is carried out to achieve least cost
combination of inputs and cost analysis.
3 Develop an understanding of
4 Analyse how capital budgeting decisions are carried out.
Text Books
1. Varshney&Maheswari: Managerial Economics, Sultan Chand, 2009.
2. S.A. Siddiqui& A.S. Siddiqui, Managerial Economics and Financial Analysis, New Age
international Publishers, Hyderabad 2013.
3. M. Kasi Reddy &Saraswathi, Managerial Economics and Financial Analysis, PHI New Delhi,
201
Reference Book
1. Ambrish Gupta, Financial Accounting for Management, Pearson Education, New Delhi, 2012.
2. H. Craig Peterson &W. Cris Lewis, Managerial Economics, Pearson, 2012.
3. Lipsey&Chrystel, Economics, Oxford University Press, 2012.
4. Domnick Salvatore: Managerial Economics In a Global Economy, Thomson, 2012.
5. Narayanaswamy: Financial Accounting A Managerial Perspective,Pearson, 2012.
6. S.N. Maheswari& S.K. Maheswari, Financial Accounting, Vikas, 2012.
7. Truet and Truet: Managerial Economics: Analysis, Problems and Cases, Wiley, 2012.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Fourth Year Semester – VI
Course: Information Security Auditing and Course Code: 17YCF604
Monitoring
Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 - - 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
IT System Security, IT Application Security

Objectives:
The course will enables students to:-
1 Know different auditing methods
2 Various reporting techniques
3 Different tools and techniques available for information monitoring
4 Different tools and techniques available for information management

Unit
Details Hours
No
Module 1: Accountability, Compliance, Audit Trails, Reporting timeline, Record
4
Retention, External Auditors.
1
Module 2: Laws Monitoring tools, Warning banner, Traffic analysis, Trend
4
analysis..
Module 1: Customers and Legal Agreements, Rules of Engagement, Penetration
Testing Planning and Scheduling, Pre Penetration Testing Checklist, Information
Gathering, Vulnerability Analysis, External Penetration Testing, Internal Network
4
Penetration Testing, Penetration testing for Denial of Service, Password Cracking,
Social Engineering, Stolen Laptop, PDAs and Cell phones, Application, Physical
Security, Database, VoIP, VPN, War Dialing, Virus and Trojan Detection
2 Module 2:Log Management, File Integrity Checking,
Blue Tooth and Hand held Device, Telecommunication and Broadband
Communication, Email Security, Security Patches, Data Leakage, Penetration
Testing Deliverables and Conclusion, Penetration Testing Report and 3
Documentation Writing, Penetration Testing Report Analysis, Post Testing
Actions, Ethics of a Penetration Tester, Standards and Compliance.
Countermeasures.
Module 1: Information Security Governance, Tone at the Top, Tone at the
Bottom, Governance, Risk, and Compliance (GRC), the Compliance Dilemma.
3 Evolution of Information Security, Organization Historical Perspective, 4
Understand the External Environment, The Internal Company Culture, Prior
Security Incidents, Audits , Security Strategy Development Techniques, Security

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Planning.
Module 2: History of the Security Leadership Role Is Relevant, The New Security
Officer, Mandate, Security Leader Titles, Techie versus Leader, The Security
Leaders Library, Security Leadership Defined, Security Leader Soft Skills, Seven 4
Competencies for Effective Security Leadership, Security Functions, Reporting
Model.
Module 1: Communication between the CEO, CIO, Other Executives, and CISO,
Building Grassroots Support through an Information Security Council. Risk in Our
Daily Lives, Accepting Organizational Risk, Just Another Set of Risks, 4
Management Owns the Risk Decision, Qualitative versus Quantitative Risk
4 Analysis, Risk Management Process, Risk Mitigation Options.
Module 2:Why Information Security Policies Are Important, Avoiding Shelf ware,
Electronic Policy Distribution, Canned Security Policies, Policies, Standards,
3
Guidelines Definitions, an Approach for Developing Information Security,
Policies, Utilizing the Security Council for Policies, the Policy Review Process.
Module 1 Security Control Convergence, Security Control Methodology, Security
Assessment and Authorization Controls, Planning Controls, Risk Assessment
Controls, System and Services Acquisition Controls, Program Management 4
Controls. Access Control Controls, Audit and Accountability, Controls,
5 Identification and Authentication, System and Communications Protections.
Module 2:Awareness and Training Controls, Configuration Management Controls,
Contingency Planning Controls, Incident Response Controls, Maintenance
4
Controls, Media Protection Controls, Physical and Environmental Protection
Controls, Personnel Security Controls, System and Information Integrity Controls.

Outcomes:
On completion of the course, student will be able to–
1 Knows Various reporting techniques
2 Understands different tools and techniques available for information monitoring
3 Understands different tools and techniques available for information management
Text Books
1. Professional Ethics: R. Subramanian, Oxford University Press, 2015.
2. Ethics in Engineering Practice & Research, Caroline Whit beck, 2e, Cambridge University Press
2015.
Reference Book
1. Engineering Ethics, Concepts Cases: Charles E Harris Jr., Michael S Pritchard, Michael J
Rabins, 4e, Cengagelearning, 2015.
2. Business Ethics concepts & Cases: Manuel G Velasquez, 6e, PHI, 2008.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Discrete Mathematics, FLAT

Objectives:
Students are able to:-
1 Introduce the fundamental problems of machine learning.
2 Provide understanding of techniques, mathematical concepts, and algorithms used in
machine learning to facilitate further study in this area.
3 Provide pointers into the literature and exercise a project based on literature search and one
or more research papers.

Unit
Details Hours
No
Module 1: Introduction - What is Web Engineering? Web Development History,
Motivation, Categories of Web Applications, Web Applications Characteristics.
Evolution and Need for Web Engineering, Web Engineering Models, Software 4
Engineering v/s Web Engineering World Wide Web: Introduction to TCP/IP and
WAP, DNS, Email, TelNet, HTTP and FTP.
1
Module 2:Introduction to Browser and search engines, Search fundamentals,
Search strategies, Directories search engines and Meta search engines, Working of
the search engines , Miscellaneous Web Browser details, Introduction to Web 4
Servers: Features of web servers, caching, case study-IIS, Apache, Configuring
web servers.
Module 1: The role of the Information Architect, Collaboration and
Communication, Organizing Information, Organizational Challenges, Organizing
Web sites parameters and Intranets Creating Cohesive Websites: Conceptual
4
Overview Website Development, Website Design issues, Conceptual Design,
High-Level Design, Indexing the Right Stuff, Grouping Content. Architectural
Page Mockups, Design Sketches, Navigation Systems.
2
Module 2:Searching Systems Good & bad web design, Process of Web
Publishing. Phases of Web Site development, enhancing your web-site, submission
of website to search engines Web security issues, security audit of websites, Web
3
effort estimation, Productivity, Measurement, Quality usability and reliability.
Requirements Engineering for Web Applications: Introduction, Fundamentals,
Requirement Source, Type, Notations Tools.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1: Introduction HTML: HTML and DHTML, HTML Basic Concepts,
Static and dynamic HTML, Structure of HTML documents, HTML Elements,
Linking in HTML, Anchor Attributes, Image Maps, Meta Information, Image
Preliminaries, Layouts, Backgrounds, Colors and Text, Fonts, Tables, Frames and 4
layers, Audio and Video Support with HTML Database integration, CSS,
3
Positioning with Style sheets, Forms Control, Form. Elements. Difference between
HTML and HTML5
Module 2:. Applying Styles, values, selectors, class, ids, inheritance, layout,
backgrounds, borders, margin, padding, lists, fonts, text formatting, positioning, 4
Dynamic HTML, DHTML with CSS.
Module 1: Introduction to JavaScript: Introduction to Scripting, Difference
between Java and JavaScript, JavaScript Characteristics, JavaScript and Common 4
Programming Concepts
Module 2:Introduction, Benefits Of Using PHP, MySQL, Server/Client
4 Environment, Development Concept: How PHP Script Work, PHP Syntax, Embed
PHP In HTML/HTML In PHP, PHP Data Types, Variable In PHP, Operator in
3
PHP, Control Structure, Looping Structure, Function, File Inclusion: Include()/
Require(), Array, String Function: chr()/ strlen()/ strpos()/strcmp(), State
Management : Cookies, Session management.
Module 1:Working with PHP My Admin: Types Data Type, Creating Database &
Tables, Dropping Database & Tables, Adding Fields, Selecting Table MySQL
4
Function in PHP : Database Connections, Managing Database Connections,
Performing Queries, Closing Connection.
5 Module 2:The J2EE and its multitier architecture, The enterprise application, Java
Servlet and CGI, A simple servlet, life cycle of servlet, anatomy of servlet,
javax.servlet package, Generic servlet, Http Servlet, reading data from client, 4
HTTP request headers, sending data to client, HTTP response header, cookies,
session management.

Outcomes:
On completion of the course, student will –
1 Provide understanding of the limitations of various machine learning algorithms and the
way to evaluate performance of machine learning algorithms.
Text Books
1. Steven M. Schafer, “HTML, XHTML and CSS”, Fourth Edition by, Wiley India Edition. ISBN:
978- 81-265-1635-3.
2. Ivan Bayross, ”Web Enabled Commercial Application Development Using HTML, JavaScript,
DHTML and PHP”, 4th Edition, BPB Publications.
3. Jason Hunter, “Java Servlet Programming”, 2nd Edition, O'reilly Publications.
Reference Book
1. Roger S. Pressman, David Lowe, “Web Engineering”, Tata Mcgraw Hill Publication, 2007
2. Jim Keogh, “J2EE: The Complete Reference”, 1st Edition , Tata McGraw Hill Pulishing
Company, ISBN: 978-0-07-052912-0
3. Professional WordPress: Design and Development by Brad Williams, David Damstra, Hal Stern,
Wrox publications

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
4. Ralpha Moseley, M.T. Savaliya, “Developing Web Applications”, Wiley, 2nd Edition, ISBN :
978- 81-265-3867-6
5. Web Technologies Black Book: HTML, JavaScript, PHP, Java, JSP, XML and AJAX by Kogent
Learning Solutions Inc.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA- Lab Theory Lab
4
3 -- -- 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) -3 Hrs. End Semester Exam (Lab) : 00
Hrs.

Prerequisites:
Professional Ethics

Objectives:
Students are able to:-
1 Understand the e business concepts.
2 Understand e-business models and infrastructure.
3 Understand hoe e-business concepts are applied to different fields like education, banking
tourism and so on.
4 Inspire students with various online business ideas.

Unit
Details Hours
No
Module 1: Introduction to E-business. 3
1 Module 2: Making Functional Areas E-Business Enabled : Value chain and supply 4
chain, inter and intra organizational business processes, ERP.
Module 1Making Functional Areas E-Business Enabled : E-Procurement 4
2 Module 2Making Functional Areas E-Business Enabled : E-marketing, E-Selling, 4
E-Supply Chain Management
Module 1: Technologies for E-Business: Internet and Web based system 4
3
Module 2Technologies for E-Business: Security and payment systems. 4
Module 1: Technologies for E-Business: Supply chain integration technologies 4
(EDI, RFID, Sensors, IoT, GPS, GIS).
4
Module 2: Technologies for E-Business: Supply chain integration 3
technologies (Web services and cloud)
Module 1Decision Support in E-Business: Web analytics, Decision Support in E- 4
Business: Customer behavior modeling
5
Module 2: Decision Support in E-Business: Auctions, Decision Support in E- 4
Business: Recommender systems

Outcomes:
On completion of the course, student will be able to–

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
1 Able to distinguish between e-commerce and e-business.
2 Understand e-marketplaces.
3 Students are able to state various requirements for starting an online business.
4 Students will be able to work in groups in order to design a new online business idea.
5 Students will be able to analyze and present successful e-business stories.
Text Books
Electronic Commerce: A managerial perspective, Turban, Prentice Hall Publ. 2008
Reference Book
Electronic Business and Electronic Commerce Management, 2nd edition, Dave Chaffey, Prentice
Hall, 2006.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
Scheme End Semester
Continuous Internal Assessment (CIA) Total
(Hrs. Examination
/Week)
L T P C CIA-1 CIA-2 CIA-3 CIA- Lab Theor Lab
4 y
3 0 0 3 10 20 10 10 - 50 - 100
Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) - 0Hrs.

Prerequisites:
Database Management System.

Objectives:
Students are able to:-
1 This course focuses on how to design and build a Business Intelligence solution.
2 Students will also learn how to design and build a data warehouse within the context of student
BI projects.
3 Students can develop their own projects within collaborative teams or be assigned an existing
data source to develop a project.
4 To ensure success during the implementation phase, students will plan for and gather business
requirements, as well as design the data warehouse in order to develop an effective BI plan.

Unit Hou
Details
No rs
Module 1: Introduction to Data, Information, and Knowledge, Design and 5
implementation aspect of OLTP, Introduction to Business Intelligence and
Business Models, Design and implementation aspect of OLAP/Data Warehouse,
1
BI Definitions & Concepts,
Module 2:Business Applications of BI, Role of DW in BI, BI system 4
components, Components of Data Warehouse Architectures.
Module 1:Star schema, Snow flake schema, and Fact Constellation schema, 5
Grain of dimensional model, transactions,
Module 2:Recurring Snapshots, Accumulating Snapshots, Dimensions (SCD 4
2 types, conformed dimensions)Clickstream Source Data (Google Analytics as a
Clickstream Data Source), Facts (additive, semi-additive, non-additive),
Hierarchy in dimensions, parent child relationships, Many-Many Dimensional
relationship, Multi Valued Dimensions and Dimension Attributes.
Module 1:Data Quality, Data profiling, Data enrichment, data duplication, ETL 5
3
Architecture and what is ETL, Extraction concept and Change data capture,

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2:Transformation concept, lookups, time lag, formats, consistency, 4
Loading concept, Initial and Incremental loading, late arriving facts, What is
Staging, Data marts, Cubes, Scheduling and dependency matrix.
Module 1:Metadata Layer, Presentation Layer, Data Layer, Use of different 5
layers and overall Reporting architecture, Various report elements such as
Charts, Tables,
4
Module 2:prompts Data aggregation: Table based, Materialized views, Query 4
rewrite, OLAP, MOLAP, Dashboards, Ad-hoc reports, interactivity in analysis
(drill down, drill up), Security: report level, data level (row, column),Scheduling
Module 1:Analytics concepts and use in Business Intelligence, Exploratory and 5
statistical techniques:- Cluster analysis, Data visualization, Predictive analysis
Regression, Time series,
5
Module 2:Data Mining :- Hierarchical clustering, Decision tree Text analytics :- 4
Text mining, In-Memory Analytics and In-DB Analytics, Case study: Google
Analytics

Outcomes:

1 Design and implement OLTP, OLAP and Warehouse concepts.

2 Design and develop Data Warehouse using Various Schemas & Dimensional
modelling.
3 Use the ETL concepts, tools and techniques to perform Extraction, Transformation, and
Loading of data.
4 Report the usable data by using various reporting concepts, techniques/tools, and use
charts, tables for reporting in BI.
5 Use Analytics concepts like data mining, Exploratory and statistical techniques for
predictive analysis in Business Intelligence
Text Books
1. ReemaThareja, “Data Warehouse”, Publisher: Oxford University Press.
2. Jiawei Han, MichelineKamber, Jian Pei “Data Mining: concepts and techniques”, 2nd Edition,
Publisher: Elsevier/Morgan Kaufmann.
3. Ralph Kimball, Margy Ross, “The Data Warehouse Toolkit”, 3rd edition, Publisher: Wiley
Reference Book
1. William Inmon, “Building the Data Warehouse”, Wiley publication 4 th edition.
2. Efrem G. Mallach, “Decision Support And Data Warehouse Systems”, 1st Edition Publisher:
Tata McGraw-Hill Education,. ISBN-10: 0072899816.
3. Efraim Turban, Ramesh Sharda, DursunDelen, David King, “Business Intelligence”, ISBN-10:
013610066X Publisher: Prentice Hall.ISBN-13: 9780136100669.
4. Dorian Pyle, “Business Modeling and Data Mining”, Elsevier Publication MK.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Third Year Semester – VI
Course: Data Mining Course Code: 17YCFO04
Teaching
End Semester
Scheme (Hrs. Continuous Internal Assessment (CIA)
Examination Total
/Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 -- -- 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
Data Base Management System.

Objectives:
The course will enables students to:-
1 To introduce students to the basic concepts and techniques of Data Mining.
2 To develop skills of using recent data mining software for solving practical problems
3 To gain experience of doing independent study and research

Unit
Details Hours
No
Module 1: What is data mining, Related technologies - Machine Learning, DBMS,
4
OLAP, Statistics, Data Mining Goals, and Stages of the Data Mining Process.
1
Module 2: Data Mining Techniques, Knowledge Representation Methods,
4
Applications, Example: weather data.
Module 1: Types of Data in Cluster Analysis ,A Categorization of Major
Clustering Methods,
Partitioning Methods ,Hierarchical methods, Density Based Methods ,Grid Based 4
2 Methods, Model Based Clustering Methods, Clustering High, Dimensional
Data ,Constraint ,Based Cluster Analysis ,Outlier Analysis.
Module 2:Model Based Clustering Methods, Clustering High, Dimensional
3
Data ,Constraint ,Based Cluster Analysis ,Outlier Analysis.
Module 1:Data Warehouse and DBMS, Multidimensional data model. 4
3
Module 2: OLAP operations, Example: loan data set. 4
Module 1: Issues Regarding Classification and Prediction, Classification by
4
Decision Tree Introduction, Bayesian Classification Rule Based Classification.
4
Module 2: Classification by Back propagation ,Support Vector Machines,
3
Associative Classification ,Lazy Learners ,Other Classification Methods .
Module 1: Multidimensional Analysis and Descriptive Mining of Complex Data
4
Objects.
5
Module 2: Spatial Data Mining, Multimedia Data Mining ,Text Mining ,Mining
4
the World Wide Web.

Outcomes:

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
On completion of the course, student will be able to–
1 Understand the data warehouse and OLAP operations.
2 Analyse different classification techniques.
Text Books
1. Jiawei Han and MichelineKamber “Data Mining Concepts and Techniques” Second Edition,
2. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”, Tata McGraw
3. Hill Edition, Tenth Reprint 2007.
4. K.P. Soman, ShyamDiwakar and V. Ajay “Insight into Data mining Theory and Practice”, Easter Economy
Edition, Prentice Hall of India, 2006.
Reference Book
1. G. K. Gupta “Introduction to Data Mining with Case Studies”, Easter Economy Edition, Prentice Hall of India,
2006.
2. Pang Ning Tan, Michael Steinbach and Vipin Kumar “Introduction to Data Mining”, Pearson Education,
2007

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
-- -- 4 2 -- -- -- -- 25 -- 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs.

Prerequisites:
Cyber forensics

Objectives:
Students are able to:-
1 Demonstrate knowledge and comprehension of basic tools and techniques used in the field
of computer forensics sciences.
2 Demonstrate general knowledge and comprehension of digital forensic sciences as a
profession.

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
Group A (Compulsory Assignments)
1. Implementation of following spoofing assignments using C++ multicore Programming

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
a) IP Spoofing
b) Web Spoofing
2. Write a computer forensic application program in Java/Python/C++ for Recovering Deleted Files
and Deleted Partitions.
3. Write a program in C++ /Python to analyze Email Header.
Group B (Any 7)
1. Develop a GUI and write a Java/Python/C++ program to monitor Network Forensics,
Investigating Logs and Investigating Network Traffic.
2. Write a program in Python for Investigating Wireless Attacks using Multicore
3. Programming
4. Create a Scenario and write a program for overcoming a Website hacking problems and
identifying hacker machine using Java/Python/C++. Develop a prototype website using Ruby on
rails.
5. Write a program in C++ for Tracking Emails and Investigating Email Crimes
6. Install and use Android Mobile Forensics Open Source Tools
7. Install and use an open source tool to Identifying MMS attacks, create necessary Scenario
8. Write a program to identifying private data acquisition of digital evidence using Java in a WiFi
system, use SAN storage(BIGDATA)
9. Write a program to Implement a fingerprint recognition using Java Programming
10. Write a program for identifying the image tampering, voice data
(recorded/Blogged/twitted/Social Web Sites) tampering Python Programming. use SAN
storage(BIGDATA)
11. Write a program for Identifying the tampering of digital signature using Python
12. Write a C++/Java program for Log Capturing and Event Correlation
Group C (Any 1)
1. Implementation of Steganography program
2. Implement a program to generate and verify CAPTCHA image
3. Intrusion Detection System
4. Write a program to detect and prevent windows 8 registry Hacks and Tricks

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3
CIA- Lab Theor Lab
4 y
0 0 4 2 -- -- -- -- 25 0 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03
Hrs.

Prerequisites:
Data structure

Objectives:

1 This course covers the basic concepts of different data structures which are the basic
building blocks of Programming and problem solving

Guidelines for Assessment

Term Work assessment shall be conducted for the Project, Tutorials and Seminar. Term work is
continuous assessment based on work done, submission of work in the form of report/journal,
timely completion, attendance, and understanding. It should be assessed by subject teacher of the
institute. At the end of the semester, the final grade for a Term Work shall be assigned based on the
performance of the student and is to be submitted to the University.
1. The experiments from the regular practical syllabus will be performed (15 Marks).
2. The regular attendance of students during the syllabus practical course will be monitored and
marks will be given accordingly (5 Marks).
3. Good Laboratory Practices (5 Marks)

Guidelines for Laboratory Conduction

Practical/Oral/Presentation shall be conducted and assessed jointly by internal and external
examiners. The performance in the Practical/Oral/Presentation examination shall be assessed by at
least a pair of examiners appointed as examiners by the University. The examiners will prepare the
mark/grade sheet in the format as specified by the University, authenticate and seal it. Sealed
envelope shall be submitted to the head of the department or authorized person.
1. One experiment from the regular practical syllabus will be conducted. (Total 15 Marks).
2. Complete laboratory journal/records (05 Marks).
3. Viva-voce (05 Marks).

Operating System recommended:

Programming tools recommended:

Suggested List of Laboratory Assignments

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Group A (Compulsory Assignments)
1. Implement 0/1 Knapsack problem using Dynamic Programming.
2. To sort the elements using quick sort.
3. Write a program to to sort the elements using merge sort.
4. Write a program to implement booth’s multiplication.
5. From a given vertex in a weighted connected graph, find shortest paths to other vertices
using Dijkstra's algorithm.
6. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm.
7. Print all the nodes reachable from a given starting node in a digraph using BFS method.
8. Check whether a given graph is connected or not using DFS method.
9. Implement any scheme to find the optimal solution for the Traveling Salesperson problem
and then solve the same problem instance using any approximation algorithm and determine
the error in the approximation.
10. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
11. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm. Parallelize this
algorithm, implement it using Open MP and determine the speed-up achieved.
12. Implement N Queen's problem using Back Tracking.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Third Year Semester – VI
Course: Seminars Course Code: 17YCF613
Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
-- -- 2 1 -- -- -- -- 50 -- -- 50
Max. Time, End Semester Exam (Theory) -03 Hrs. End Semester Exam (Lab) – 00
Hrs.

Unit
Details Hours
No
Course (catalog) description: As a part of the B. Tech Curriculum, SEMINAR is
a Practical course, in which the students of CSE are trained for presentation
skills.
Course Guidelines:
Grading:
The Course is graded based on:
Presentation : 50%
Student’s reports : 20%
PPT presentation : 25%
Attendance : 05%

Note:
1
Presentation will take place in the weekly class. The presentation is evaluation by
your class in charge.
Report must be submitted during presentation. The report evaluation is done by
your class in charge.
A Viva voce comprising a comprehensive questions based on your presentation.
Etiquette :
Dress properly
Behave well
Portray good image as a university student
Be punctual
Observe work ethics
Concern for safety
Be professional

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Outcomes:
On completion of the course, student will be able to–
1 An ability to work in actual working environment.
2 An ability to utilize technical resources.
3 An ability to write technical documents and give oral presentations related to the work
completed.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Computer Organization

Objectives:
The course will enables students to:-
1 Learn how to analyze multidimensional data properly.
2 Understand the role of formal statistical theory and informal data warehouse methods.

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
Seminars and Webinars conducted by IBM ICE trainer

Document Reference Revision No. / Date Prepared By Approved By

Objectives:
Students are able to:-
1
2

Guidelines for Conduction

Guidelines for Conduction and Assessment (Any one or more of following but not limited to)

 Lectures/ Guest Lectures  Surveys

 Visits (Social/Field) and reports  Mini Project
 Demonstrations  Hands on experience on specific focused topic

Guidelines for Assessment (Any one or more of following but not limited to)
 Written Test  IPR/Publication
 Demonstrations/ Practical Test  Report
 Presentations
Audit Course Options (Any one of following but not limited to)
 Road Safety
 Smart Cities
 Humanities and Social Sciences
 Water Harvesting
 Environmental Studies  Cyber Security Awareness
 Water Management

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
B. Tech CSE (with Specialization in Cyber Security and Forensics)
Semester – VII
Teaching
Scheme Examination Scheme
(Hrs./Week) Total
Sr. Course
Core Course Name Formative Summative Marks
No. Code
Assessment Assessment
L T P C
CIA ESE
Course Lab Course Lab
Object Oriented Analysis and
1 PC 17YCF701 3 -- -- 3 50 -- 50 -- 100
Design
Information Security Intelligence
2 PC 17YCF702 3 -- -- 3 50 -- 50 -- 100
and Compliance Analytics

3 PC 17YCF703 Artificial Intelligence 3 -- 3 50 -- 50 -- 100

4 PC 17YCFO__ Open Elective II 3 -- -- 3 50 -- 50 -- 100
Information Security Intelligence
5 PC 17YCF711 -- -- 4 2 -- 25 -- 25 50
and Compliance Analytics Lab
Object Oriented Analysis and
6 PC 17YCF712 -- -- 4 2 -- 25 -- 25 50
Design Lab
7 UC 17YCF713 Project Stage – I -- -- 6 3 -- 50 -- 50 100
8 UC 17YCF714 Internship III - 1 - 3 -- 50 -- -- 50
9 UC 17YCF715 Audit Course-III -- -- -- -- -- -- -- -- --
TOTAL 12 01 14 22 200 150 200 100 650

CIA: Continuous Internal #: Internship for 15 Weight

Open Elective II:

1. Cloud Computing and Virtualization(17YCFO05)
2. Cyber Laws (17YCFO06)
3. Introduction on Intellectual Property to Engineers and Technologists(17YCFO07)
4. Advanced Computer Networks(17YCFO08)

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Software Engineering

Objectives:
The course will enables students to:-
1 To Introduce various designing techniques and methods for object oriented
2 Performance analysis with real time system
3 Demonstrate a familiarity with object oriented data and system.
4 To give clear idea on implementing design with UML diagram like state diagram, activity
diagram, use case diagram etc.

Unit
Details Hours
No
Module 1: Introduction, Object orientation, OO Development, OO themes,
4
Modeling as a design technique, Class Modeling.
1
Module 2:Abstraction, The three models, Object and class concepts, Link and
4
association concepts, Generalization & Inheritance, Navigation of class models.
Module 1: Advanced object and class concepts, Association Ends, N-ary
4
association, Aggregation, Abstract classes, Multiple inheritance,
2 Module 2:Metadata, Reification, Constraints, Derived data, Packages, State
Modeling: Events, States, Transitions and Conditions, State diagrams, State 3
diagram behavior.
Module 1: Nested state diagram, Signal Generalization, Nested states,
4
Concurrency, Relation of class and state models, Use case model.
3
Module 2: Sequence models, Activity models, Use case relationships, Procedural
4
sequence model, Special constructs for activity models.
Module 1:Development stages, Development life cycle, Devising a system
4
concepts, Elaborating a concepts.
4
Module 2:, Preparing a problem statements, Overview of analysis, Domain class
3
models, Domain state model, Domain Interaction model.
Module 1:Overview of System Design, Estimating Performance, Making a reuse
plan, Breaking a system into subsystems, Identifying Concurrency, Allocation of
5 4
subsystems, Management of data storage, Handling global resources, Choosing a
software control strategy.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2:Handling boundary conditions, Architecture of the ATM system.
Realizing the use cases, Designing algorithms recursing Downwards, Refactoring,
4
Design Optimization, Reification of behavior, Organizing a class design, ATM
examples.

Outcomes:
On completion of the course, student will be able to–
1 Describe Object Oriented Analysis and Design concepts and apply them to solve problems
2 Prepare Object Oriented Analysis and Design documents for a given problem using Unified
Modeling Language
Text Books
Blaha ,Rumbaugh:”Object Oriented Modeling and Design with UML”(2/e) Pearson Education.
Reference Book
1. Dathan ,Ramnath : “Object Oriented Analysis, Design &Implementation,”OUP.
2. McRobb& Farmer: “Object Oriented System Analysis &Design”McGraw Hill.
3. 3Booch, Rumbaugh& Jacobson: “The UML User guide”PearsonEducation.
4. Whitten & Bentley: “System Analysis & Design Methods”TataMcGraw Hill.
5. Booch: “Object Oriented Analysis & Design with Applications”,Pearson Education.
6. Visual modeling with Rational Rose and UML by Terry Quatrani, by Addison-Wesley
Professional.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Fourth Year Semester – VII
Course: Information Security intelligence and compliance Course Code: 17YCF702
analytics
Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 -- -- 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
IT Data Security

Objectives:
The course will enables students to:-
1 Different security issues in information
2 Concepts of Information Security intelligence
3 Know different tools used for compliance analytics

Unit
Details Hours
No
Module 1: what is big data?, The arrival of analytics, where is the value?, more to
big data than meets the eye, dealing with the nuances of big data, an open source 4
brings forth tools, caution: obstacles ahead.
1 Module 2:why big data matters - big data reaches deep, obstacles remain,
Data continue to evolve, data and data analysis are getting more complex, the
4
future is now, big data and the business case - realizing value, the case for big data,
the rise of big data options, beyond hadoop, with choice come decisions
Module 1: The data scientist, the team challenge, different teams, different goals. 4
2 Module 2: don’t forget the data, challenges remain, teams versus culture, gauging
3
success.
Module 1: hunting for data, setting the goal, big data sources growing, diving
deeper into big data sources, a wealth of public information, getting started with
big data acquisition, ongoing growth, no end in sight. The storage dilemma,
4
building a platform, bringing
3 Structure to unstructured data processing power, choosing among in-house,
Outsourced, or hybrid approaches
Module 2: the storage dilemma, building a platform, bringing structure to
unstructured data processing power, choosing among in-house, outsourced, or 4
hybrid approaches.
Module 1: pragmatic steps to securing big data, classifying data, protecting big
4
data analytics
4
Module 2: Big data and compliance, the intellectual property challenge
3
Big data: the modern era, today, tomorrow, and the next day, changing algorithms.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1: start small with big data, thinking big, avoiding worst practices, baby
4
steps, the value of anomalies, expediency versus accuracy, in-memory processing.
5
Module 2:the path to big data, the realities of thinking big data, hands-on big data,
4
the big data pipeline in depth, big data visualization, big data privacy.

Outcomes:
On completion of the course, student will be able to–
1 Knows Information security fundamentals
2 Tools and techniques used for Security intelligence
Tools and techniques used for compliance analytics
Text Books
Information Security intelligence and compliance analytics (IBM ICE Publication)
Reference Book
--

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Linear algebra, Probability theory, Calculus, Calculus of variations, Graph theory.

Objectives:
Students are able to:-
1 To know about the basic building block of AI
2 Explain the concept of machine thinking
3 Explain the evolution of AI and modern concepts and programming platforms for AI
4 Explain about problem solving in AI
5 Explain about the concept of gaming concept in AI

Unit Hou
Details
No rs
Module 1: General Concept and Philosophy of AI: 5
Defining AI: AI what and what not?- Basic principle and concept of AI-The
intellectual History of AI -Foundations of AI-Frontiers of artificial intelligence-
Parallel and distributed AI--AI and the programming platform-Uses and
1 application of AI.
Module 2:Introduction to agent-Agent performance –Example of Agents- Agent 4
Faculties- Can machine think?: ‘Turning and testing-The Chinese room.
Computation and representation-Applications eras of AI-Computationalism-
Ethics of AI-Impacts of AI
Module 1:Intelligent System and Modern AI 5
What is intelligence?-Structure of intelligent system-Biological brain -Basic
neural model- Intelligent Agents- Rationality- Agent Environment- Agent
architectures-the concept of rationality-The structure of agent-The impact of AI
2
in human labor-AI and the social equality.
Module 2:Technology that precursors to AI era -The concept of bot-AI and 4
Automation-Super intelligence and AI-paths to super intelligence-Forms of
super intelligence-Future impacts of AI-AI programming platforms.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1:Informed search and Constraint satisfaction problem 5
State space search- Goal Directed Agent- Search Problem- illustration of search
process- eight queens problem-tic tac toe - General state space search-Search
Tree- Terminology of search tree-Informed search -Best-first Search-A* search-
3 Hill climbing search-Simulated Annealing-Tabu search.
Module 2:Introduction to constraint satisfaction problem- Backtracking Search 4
for constraint satisfaction problem- Local Search for Constraint Satisfaction
Problems- The Structure of Problems-Constraint propagation- forward checking-
Arc consistency.
Module 1:Adversarial Search 5
Introduction to Games- Two player game-Optimal Decisions in Games- Optimal
strategies- The minimax algorithm- min max with Tic-Tac-Toe-Optimal
4 decisions in multiplayer games- Alpha-Beta Pruning- min max with Alpha-Beta
pruning-Imperfect.
Module 2:Real-Time Decisions-classical AI: checkers-Chess-Othello-Go- 4
Backgammon-Application of AI algorithm in Video Game.
Module 1:Uninformed search 5
Search and AI -Define Uninformed Search- Depth first search (DFS)-Example
of DFS-Depth Limited Search-algorithm with example-(BFS) Breadth first
5 search – Example of Breadth first search-Properties of BFS-Pros and Cons of
BFS-Low Cost First Search- example of low cost first search-
Module 2:Iterative deepening Search-Bidirectional search-Time and space 4
complexities-Uniform cost search.

Outcomes:

1 Get to know about the basic principle of AI

2 To understand the concept of machine thinking
3 Understanding the modern concept in AI
4 Understand the concept of problem solving and thus to improve the problem solving
skill
5 Understand the concept of gaming and know the decision making in checker.
Text Books
1. Artificial Intelligence- Rich-And-Knight
2. Artificial Intelligence- Kevin Warwick
3. Artificial Intelligence-M.Tim Jones
Reference Book
1. Artificial Intelligence: Foundations Of Computational Agents- D. Poole- Cambridge
University Press, 2010
2. “Artificial Intelligence and Intelligent Systems”- Padhy N.P-4th impression , Oxford
University Press, 2007.
3. Super intelligence paths, Dangers and Strategies- Nick Bostrom

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3
CIA- Lab Theory Lab
4
3 -- -- 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) - 00Hrs.

Prerequisites:
Computer Network, Operating System

Objectives:
Students are able to:-
1 Analyze the components of cloud computing showing how business agility in an
organization can be created
2 Evaluate the deployment of web services from cloud architecture
3 Critique the consistency of services deployed from a cloud architecture
4 Compare and contrast the economic benefits delivered by various cloud models based on
application requirements, economic constraints and business requirements.
5 Critically analyze case studies to derive the best practice model to apply
when developing and deploying cloud based application

Unit
Details Hours
No
Module 1:CLOUD COMPUTING FUNDAMENTALS
Cloud Computing definition, private, public and hybrid cloud. Cloud types;
IaaS,PaaS, SaaS. Benefits and challenges of cloud computing, public vs private 4
1 clouds, role of virtualization in enabling the cloud; Business Agility: Benefits and
challenges to Cloud architecture.
Module 2:Application availability, performance, security and disaster recovery;
4
next generation Cloud Applications.
Module 1:MANAGEMENT OF CLOUD SERVICES
Reliability, availability and security of services deployed from the cloud.
Performance and scalability of services, tools and technologies used to manage 3
cloud services deployment; Cloud Economics: Cloud Computing infrastructures
2
available for implementing cloudbased services.
Module 2:Economics of choosing a Cloud platform for an organization, based on
application requirements, economic constraints and business needs (e.g Amazon, 3
Microsoft and Google, Salesforce.com, Ubuntu and Redhat)
Module 1:CLOUD IT MODEL
3 4
Analysis of Case Studies when deciding to adopt cloud computing architecture.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
How to decide if the cloud is right for your requirements.
Module 2:Cloud based service,applications and development platform deployment
4
so as to improve the total cost of ownership (TCO)
Module 1:VIRTUALIZED DATA CENTER ARCHITECTURE
Cloud infrastructures; public, private, hybrid. Service provider interfaces; Saas, 3
Paas, Iaas.
4
Module 2:VDC environments; concept, planning and design, business continuity
and disaster recovery principles. Managing VDC and cloud environments and 3
infrastructures.
Module 1:SECURITY CONCEPTS
Confidentiality, privacy, integrity, authentication , non-repudiation, availability,
access control, defence in depth, least privilege,how these concepts apply in the 4
cloud, what these concepts mean and their importance in PaaS, IaaS and SaaS.
5
e.g. User authentication in the cloud.
Module 2:Cryptographic Systems- Symmetric
cryptography, stream ciphers, block ciphers, modes of operation, public-key 4
cryptography, hashing, digital signatures

Outcomes:
After completion of course students will be able to-
1 Explain the core concepts of the cloud computing paradigm: how and why this paradigm
shift came about, the characteristics, advantages and challenges brought about by the
various models and services in cloud computing.
2 Discuss system, network and storage virtualization and outline their role in enabling the
cloud computing system model.
3 Illustrate the fundamental concepts of cloud storage and demonstrate their use in storage
systems such as Amazon S3 and HDFS.
4 Analyze various cloud programming models and apply them to solve problems on the
cloud.
Text Books
1. GautamShroff, “Enterprise Cloud Computing Technology Architecture Applications”,
Cambridge University Press; 1 edition,[ISBN: 978-0521137355], 2010.
Reference Book
1. Toby Velte, Anthony Velte, Robert Elsenpeter, “Cloud Computing, A Practical Approach”
McGraw-Hill Osborne Media; 1 edition [ISBN: 0071626948], 2009.
2. Dimitris N. Chorafas, “Cloud Computing Strategies”CRC Press; 1 edition [ISBN: 1439834539],
2010.
3. Tim Mather, SubraKumaraswamy, ShahedLatif, “Cloud Security and Privacy: An Enterprise
Perspective on Risks and Compliance”O'Reilly Media; 1 edition[ISBN: 0596802765],2009
4. Greg Schulz, “Cloud and Virtual Data Storage Networking”, Auerbach Publications [ISBN: 978-
1439851739], 2011.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3
CIA- Lab Theory Lab
4
3 -- -- 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) - 00Hrs.

Prerequisites:
Digital Forensics

Objectives:
Students are able to:-
1 Understand various legal measures that can be taken against various cyber crimes.
2 Understand various types of illegal or punishable offenses that can be done through digital
media.
3 Understand punishments constituted in cyber laws related to various malpractices in digital
world.

Unit
Details Hours
No
Module 1: Introduction to cyber law, Indian Judiciary system 3
1 Module 2: Digital Signature and Electronic Signature, Penalty and compensation 4
for damage to computer
Module 1: Tampering with computer source documents, punishment for sending 3
offensive messages through communication service.
2
Module 2: Punishment for dishonestly receiving stolen computer resources or 5
communication device.
Module 1: Identity theft, punishment for identity theft, punishment for cheating by 3
personation by using computer resources.
3
Module 2: Explanation of privacy, punishment for violation of privacy, 4
punishment for cyber terrorism.
Module 1: Punishment for publishing or transmitting obscene material in 4
electronic form, punishment for plagiarism.
4
Module 2: Punishment for publishing or transmitting of material 3
containing sexually explicit act
Module 1: Punishment for publishing or transmitting of material depicting 3
5 children in sexually explicit act
Module 2: Breach of confidentiality and privacy 4

Outcomes:

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering

1 Students are able to distinguish between legal and illegal activities in cyber world.
2 Students are able to use digital signature to claim the originator’s identity for an electronic
document.
3 Students are able to state various punishments related to plagiarism or illegal possession of
digital information.
4 Students will be driven away from performing any cyber crime.
Text Books
Cyber Laws Online Leaning Material
Reference Book
--

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Cyber Laws

Objectives:
Students are able to:-
1 Understand basics of intellectual properties and copyrights.
2 Distinguish patentable and non-patentable inventions.
3 Understand industrial design basics and trademark basics.
4 Understand the infringement of copyright or trademark.

Unit
Details Hours
No
Module 1: Basics of intellectual properties, introduction to law, theories of IP. 3
1
Module 2: Different forms of IP and application of thory. 4
Module 1:Patent Basics, Patent Ability criteria 4
2
Module 2: Non Patentable inventions, Prier art search, Patent filling procedure 4
Module 1: Patent Prosecution, International Patents 3
3
Module 2: Patent infringement, Patent management 4
Module 1: Utility module protection, copyright basics, copy right registration 4
4
Module 2: Copyright infringement and fair use, Copy right in digital media 4
Module 1: Industrial design basics, Industrial design registration 4
5
Module 2: Trademark basics, IC layout design 4

Outcomes:

1 Students are able to understand and use patent law and how patents are prosecuted and
enforced.
2 Students are able to comprehend complex intellectual property scenario.
3 Students are able to state criteria that determine infringement and law against it.
4 Students will be able to draft patent application.
5 Students will understand the importance of intellectual property laws in engineering and
related environment.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Text Books
1. Fundamentals of IP for engineers: K. Bansal and P. Bansal
2. Intellectual Property Rights: Deborah, E. Bauchoux. Cengage Learning
Reference Book
Intellectual Property Right- Unleashing the knowledge economy: PrabuddhaGanguli, TMH Publ.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme (Hrs. Continuous Internal Assessment (CIA)
Examination Total
/Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 - - 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
Basics of Computer Networks and Data Communications

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Outcomes:
On completion of the course, student will be able to–
1 To master the concepts of protocols, network interfaces, and design/performanceissues in
local area networks and wide area networks.
2 To be familiar with wireless networking concepts.
3 To be familiar with contemporary issues in networking technologies.
4 To be familiar with network tools and network programming.
Text Books
3. Data Communications and Networking, Behrouz A. Forouzan , Fourth Edition TMH, 2006.
4. Computer Networks, Andrew S Tanenbaum, 4th Edition. Pearson Education, PHI.
Reference Book
6. Data communications and Computer Networks, P.C .Gupta, PHI.
7. An Engineering Approach to Computer Networks, S. Keshav, 2nd Edition, Pearson Education.
8. Understanding communications and Networks, 3rd Edition, W.A. Shay, Cengage Learning.
9. Computer Networking: A Top-Down Approach Featuring the Internet. James F. Kurose & Keith
W. Ross, 3 rd Edition, Pearson Education.
10. Data and Computer Communication, William Stallings, Sixth Edition, Pearson Education,
2000.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
0 0 4 2 -- -- -- -- 25 0 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs.

Prerequisites:
IT Data Security

Objectives:
Students are able to:-
1 Different security issues in information
2 Concepts of Information Security intelligence
3 Know different tools used for compliance analytics

Guidelines for Assessment

Continuous assessment of laboratory work is done based on overall performance and lab assignments
performance of student. Each lab assignment assessment will assign grade/marks based on parameters
with appropriate weightage. Suggested parameters for overall assessment as well as each lab assignment
assessment include- timely completion, performance, innovation, efficient codes, punctuality and
neatness.
Guidelines for Laboratory Conduction
The instructor is expected to frame the assignments by understanding the prerequisites, technological
aspects, utility and recent trends related to the topic. The assignment framing policy need to address the
average students and inclusive of an element to attract and promote the intelligent students. The
instructor may set multiple sets of assignments and distribute among batches of students. It is
appreciated if the assignments are based on real world problems/applications. Encourage students for
appropriate use of Hungarian notation, Indentation and comments. Use of open source software is
encouraged.

In addition to these, instructor may assign one real life application in the form of a mini-project based
on the concepts learned. Instructor may also set one assignment or mini-project that is suitable to
respective branch beyond the scope of syllabus.

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments
1. Writing basic program using python
2. Creating program using conditional statements and loops
3. Creating functions in python

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
4. Creating recursive functions
5. Creating lists, dictionaries in python
6. File handling using python
7. Word count function in python
8. Installing Hadoop
9. Configuring Hadoop
10. Running jobs on Hadoop
11. Working on HDFS
12. Hadoop streaming
13. Creating Mapper function using python.
14. Creating Reducer function using python
15. Python iterator and generators

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA- Lab Theory Lab
4
-- -- 4 2 -- -- -- -- 25 -- 25 50
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs.

Prerequisites:
Software Engineering

Objectives:
Students are able to:-
1 To Introduce various designing techniques and methods for object oriented
2 Performance analysis with real time system
3 Demonstrate a familiarity with object oriented data and system.
4 To give clear idea on implementing design with UML diagram like state diagram, activity
diagram, use case diagram etc.

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Programming tools recommended: Open Source C Programming tool like GCC
Suggested List of Laboratory Assignments

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
1. Study of Software Development Life Cycle
2. Study of Unified Modeling language and IBM Rational Rose.
3. Design of Information Flow diagram for Hospital Management System.
4. Design of Use Case diagram for Hospital Management System.
5. Design of Activity diagram for Hospital Management System.
6. Design of Sequence diagram for Hospital Management System.
7. Design of Class diagram for Hospital Management System.
8. Design of State Chart diagram for Hospital Management System.
9. Design of a Mini Project using UML.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
-- -- 8 4 -- -- -- -- 50 -- 50 100
Max. Time, End Semester Exam (Theory) -00 Hrs. End Semester Exam (Lab) – 03 Hrs.

Objectives:
Students are able to:-
1 To develop problem solving abilities using mathematics;
2 To apply algorithmic strategies while solving problems;
3 To develop time and space efficient algorithms;
4 To develop software engineering documents and testing plans;
5 To use algorithmic solutions using distributed, Embedded, concurrent and parallel environments.

Unit
Details Hours
No
Course (catalog) description: As a part of the B. Tech Curriculum, Dissertation
Stage- I is a Practical course, in which the students of CSE are trained for
project based learning.
Proposed Criteria for Dissertation Evaluation

I suggest the following 9 aspects of every project and presentation. Every item is
worth 10 points out of total 90.
For each of the items I give several key words explaining my understanding of the
item. This grading scheme is only a proposal and is open for any input, discussion
and final approval by members of the seminar. As the evaluation procedure I
1 suggest for each project and each of the first 8 items to assign a base group to
evaluate it.
Content:
(1) Topic: Is the topic chosen interesting, useful, worth researching?
(2) Thesis: Are the theses of the project identifiable, plausible, insightful, and
clear?
(3) Evidence / Sources: Are the sources of information used primary, sufficient,
and relevant? Is evidence clearly related to claims?
(4) Analysis / Logic / Argumentation: Is analysis fresh, posing new ways to think
of the material? Are Ideas represented logically? Is the argument identifiable,
reasonable, and sound? Do authors anticipate and defuse counter-argument?
Presentation:
(5) Structure: Is the structure evident, understandable, and appropriate? Is

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
transition from point to point smooth?
(6) Slides / transparencies: Are slides well designed (not too busy, right font)?
Are graphic and visual appropriate? Any spelling, grammar, word use slips?
(7) Timing: Is presentation timed properly, rehearsed?
(8) Style: Is the level of treatment appropriate (not too detailed or too general)?
Is the presentation energetic, enthusiastic, and clear? Is the volume good?
(9) Extra points for excellence

Tools Required:
Preferably 64-bit FOSS tools but if sponsoring company’s requirement is non-open
sourceplatform then it must be latest and current version of non-absolute tools. 64-bit
i5/i7Desktops/Mobiles, Latest SAN,3-tier architectures along with latest version of FOSS
Operating systems like Fedora 21or equivalent, LAMP tools, WEB server, Applications
servers, Database servers, MongoDBor latest open source BigDATA tools, FOSS
Programming Tools like gcc,g++,Eclipse,Python, Java and other tools are as per the
requirement of the SRS. The documentationtools like Open office, GIT, Latex, Latex-
Presentation
Outcomes:
On completion of the course, student will be able to–
1 An ability to work in actual working environment.
2 An ability to utilize technical resources.
3 An ability to write technical documents and give oral presentations related to the work
completed.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Third Year Semester – VII
Course: Industry Internship Course Code: 17YCF714

Document Reference Revision No. / Date Prepared By Approved By

Objectives:
Students are able to:-
1
2

Guidelines for Conduction

Guidelines for Conduction and Assessment (Any one or more of following but not limited to)

 Lectures/ Guest Lectures  Surveys

 Visits (Social/Field) and reports  Mini Project
 Demonstrations  Hands on experience on specific focused topic

Guidelines for Assessment (Any one or more of following but not limited to)
 Written Test  IPR/Publication
 Demonstrations/ Practical Test  Report
 Presentations
Audit Course Options (Any one of following but not limited to)
 Road Safety
 Smart Cities
 Humanities and Social Sciences
 Water Harvesting
 Environmental Studies  Cyber Security Awareness
 Water Management

Document Reference Revision No. / Date Prepared By Approved By

Semester – VIII

Teaching Scheme
(Hrs./Week) Examination Scheme
Sr. Course Formative Total
Summative Marks
Core Course Name
No. Code Assessment Assessment
L T P C CIA ESE
Course Lab Course Lab
1 PC 17YCFE__ Program Elective-1 3 0 0 3 50 -- 50 -- 100
2 PC 17YCF__ Program Elective-2 3 0 0 3 50 -- 50 -- 100
3 PE 17YCFE__ Program Elective-3 3 0 0 3 50 -- 50 -- 100
4 UC 17YCF811 Project Stage – II 0 0 12 8 -- 50 -- 100 150
TOTAL 09 00 12 17 150 75 150 125 500

Program Elective I:
1. Advance Software Engineering(17YCFE01)
2. Software Project Management(17YCFE02)
3. Grid and Cluster Computing(17YCFE03)
4. Machine Learning(17YCFE04)
Program Elective II:
1. Neural Networks (17YCFE05)
2. Soft Computing(17YCFE06)
3. Mobile Computing (17YCFE07)
4. Ubiquitous Computing(17YCFE08)
Program Elective II:
1. Information Storage and Retrieval (17YCFE05)
2. Distributes System (17YCFE06)
3. Advanced Databases (17YCFAE07)
4. Embedded and Real Time Operating System(17YCFE08)

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering

Year: Fourth Year Semester – VIII

Course: Advance Software Engineering Course Code:17YCFE01

Prerequisites:
Software Engineering

Objectives:
Students are able to:-
1 appreciate the wider engineering issues which form the background to developing complex,
evolving (software-intensive) systems
2 plan a software engineering process to account for quality issues and non-functional
requirements
3 employ a selection of concepts and techniques to complete a small-scale study into one of
the advanced topic areas
4 Embark on more in-depth research or practice in software engineering.

Unit
Details Hours
No
Module 1: Introduction to software engineering. 4
1
Module 2:Basics of software engineering. 4
Module 1: Embedded software and systems engineering: overview, examples and
4
industrial realities.
2
Module 2:Project Management - Project Planning and Scheduling standards,
3
Scheduling.
Module 1: Unified Software Development Process, Software Process
4
Improvement, Software Economics, Software Quality.
3 Module 2:Software Metrics - Measurement, Estimation and Prediction,
Requirements Management, Configuration Management, Risk Management, 4
Testing and Inspection.
Module 1: Architecture Description Languages, Pattern-Oriented Software
4
Architecture, Component-based Development.
4 Module 2:Distributed Software Architectures using Middleware, Enterprise
Application Integration, Architectures for Mobile and Pervasive Systems, Model 3
Driven Architecture.
Module 1: UML Extension Mechanisms. 4
5
Module 2:Object Constraint Language, Model Checking. 4

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering

Outcomes:
On completion of the course, student will be able to–
1 Apply software engineering life cycle by demonstrating competence in communication,
planning, analysis, design, construction, and deployment.
2 Have brief account of associated professional and legal issues.
3 Ability to perform independent research and analysis.
4 Ability to work as an effective member or leader of software engineering teams.
5 To manage time, processes and resources effectively by prioritizing competing demands to
achieve personal and team goals Identify and analyzes the common threats in each domain.
Text Books
Software Engineering: A Practitioner’s Approach, Roger S Pressman 6th Edition
Reference Book
Software Engineering: IyanSomarville, 7th Edition

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Year: Fourth Year Semester – VIII
Course: Software Project Management Course Code: 17YCFE02

Prerequisites:
Understanding of software Engineering Process.

Objectives:
Students are able to:-
1 Explore software project management activities from product concept through
developmentbased upon case studies and best practices.

Unit
Details Hours
No
Module 1: Importance of Software Project Management – Activities
Methodologies – Categorization of Software Projects – Setting objectives – 4
1 Management Principles – Management Control .
Module 2:Project portfolio Management – Cost-benefit evaluation technology –
4
Risk evaluation – Strategic program Management – Stepwise Project Planning
Module 1: Software process and Process Models – Choice of Process models –
mental delivery – Rapid Application development – Agile methods – Extreme
Programming .SCRUM – Managing interactive processes – Basics of Software 4
estimation – Effort and Cost estimation techniques – COSMIC Full function points
2
– COCOMO II A Parametric Productivity Model – Staffing Pattern.
Module 2:SCRUM – Managing interactive processes – Basics of Software
estimation – Effort and Cost estimation techniques – COSMIC Full function points 3
– COCOMO II A Parametric Productivity Model – Staffing Pattern.
Module 1: Objectives of Activity planning – Project schedules – Activities –
Sequencing and scheduling – Network Planning models – Forward Pass & 4
Backward Pass techniques – Critical path (CRM) method.
3
Module 2:Risk identification – Assessment – Monitoring – PERT technique –
Monte Carlo simulation – Resource Allocation – Creation of critical patterns – 4
Cost schedules.
Module 1:Framework for Management and control – Collection of data Project
4
termination – Visualizing progress – Cost monitoring.
4
Module 2:Earned Value Analysis- Project tracking – Change control- Software
3
Configuration Management – Managing contracts – Contract Management.
Module 1:Managing people – Organizational behavior – Best methods of staff
5 4
selection – Motivation – The Oldham-Hackman job characteristic model – Ethical

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
and Programmed concerns.
Module 2: Working in teams – Decision making – Team structures – Virtual teams
4
– Communications genres – Communication plans.

Outcomes:
On completion of the course, student will be able to–
1 To understand Software Project Models and Software Management Concepts
2 To understand the various methods of Cost Estimation
3 To Study about Software Quality Management
4 To Study about Software Metrics.
5 To understand Project Evaluation.
Text Books
Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata
McGraw Hill, New Delhi, 2012.
Reference Book
Robert K. Wysocki “Effective Software Project Management” – Wiley Publication,2011.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Computer Architecture and Programming Concepts, Operating Systems, Data Communication And
Computer Networks

Objectives:
Students are able to:-
1 To investigate cluster and grid as computing platform for distributed computing.
2 To make students aware of distinguishing characteristics of cluster and grid computing.
3 Introducing software tools used in both cluster and grid computing.

Unit
Details Hours
No
Module 1: Basic concepts in Distributed Systems, Notion of time 4
Module 2: Introduction to Cluster Computing, Scalable Parallel Computer
1
Architectures, Cluster Computer and its Architecture, Categories of clusters, 4
Cluster Components, Cluster Middleware and Single System Image.
Module 1: Programming Environments and Tools, Networking Protocols and I/O
for clusters, Load Sharing, Load Balancing, Resource Management System,
4
2 Process Scheduling, Performance measures and metrics, Detecting and Masking
Faults, Recovering from Faults
Module 2:Case Study : Beowulf and PARAM. 3
Module 1: Introduction to Message Passing Interface (MPI), Programming using
message-passing - send and receive operations, Message passing interface,
Introduction to MPI routines — send, receive, broadcast, gather, scatter, barrier, 4
3
reduction, prefix, all-to-all communication. Demonstration of programs using MPI
routines — matrix-matrix multiplication, quick sort, etc.
Module 2:Introducing OpenMP programming. 4
Module 1:Introduction to Grid Computing, Difference between Cluster and Grid
computing, Grid Architecture and its key components, Computational, Data, 4
4
Enterprise, and, Desktop grids
Module 2:Overview of applications of Grid Computing, Grid Infrastructure. 3
Module 1:Web Services and Service Oriented Architecture (SAO), Open Grid
5 Services Architecture (OGSA), OGSA Platform Components, Open Grid Services 4
Infrastructure (OGSI), OGSA Basic Services, Web Services Resource Framework

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
(WSRF)
Module 2:List of Globally available Middleware, Introducing Grid Computing
4
Toolkit : Globus, Introducing India’s Grid Computing initiative GARUDA

Outcomes:
On completion of the course, student will –
1 Be acquainted with various tools and techniques used in the arena of Cluster and Grid
Computing.
2 Able to justify the choice or selection of distributed computing platform for a specific
application.
3 Able to design programs in OpenMP and MPI.
Text Books
1. Prabhu, C. S. R. Grid and cluster computing. PHI Learning Pvt. Ltd., 2008.
2. Quinn, Michael J. Parallel Programming. TMH CSE 526, 2003.
3. Foster, Ian, and Carl Kesselman, eds. The Grid 2: Blueprint for a new computing infrastructure.
Elsevier, 2003.
4. Joseph, Joshy, and Craig Fellenstein. Grid computing. Prentice Hall Professional, 2004.
Reference Book
1. Pacheco, Peter S. Parallel programming with MPI. Morgan Kaufmann, 1997.
2. Buyya, Rajkumar. High performance cluster computing: Architectures and systems (volume 1).
Prentice Hall, Upper SaddleRiver, NJ, USA 1, 999, 1999.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Discrete Mathematics, FLAT

Unit
Details Hours
No
Module 1: Basic Maths: Probability, Linear Algebra, Convex Optimization 4
1 Module 2:Background: Statistical Decision Theory, Bayesian Learning (ML,
4
MAP, Bayes estimates, Conjugate priors)
Module 1: Regression : Linear Regression, Ridge Regression, Lasso 4
2 Module 2:Dimensionality Reduction : Principal Component Analysis, Partial
3
Least Squares
Module 1: Classification : Linear Classification, Logistic Regression, Linear
Discriminant Analysis, Quadratic Discriminant Analysis, Perceptron, Support 4
3 Vector Machines Kernels,
Module 2:. Artificial Neural Networks Back Propagation, Decision Trees, Bayes
4
Optimal Classifier, Naive Bayes.
Module 1:Evaluation measures : Hypothesis testing, Ensemble Methods,
4
4 Bagging Adaboost Gradient Boosting,
Module 2:Clustering, K-means, K-medoids, Density-based Hierarchical, Spectral 3
Module 1:Miscellaneous topics: Expectation Maximization, GMMs, Learning
4
5 theory Intro to Reinforcement Learning
Module 2:Graphical Models: Bayesian Networks. 4

Outcomes:
On completion of the course, student will –
1 Provide understanding of the limitations of various machine learning algorithms and the

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
way to evaluate performance of machine learning algorithms.
Text Books
1. Christopher M. Bishop. Pattern Recognition and Machine Learning (Springer)
2. David Barber, Bayesian Reasoning and Machine Learning (Cambridge University Press).
Online version available
3. Tom Mitchell. Machine Learning (McGraw Hill)
4. Richard O. Duda, Peter E. Hart, David G. Stork. Pattern Classification (John Wiley & Sons)

Reference Book
1. T. Hastie, R. Tibshirani, J. Friedman. The Elements of Statistical Learning, 2e, 2008.
2. Christopher Bishop. Pattern Recognition and Machine Learning. 2e

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Basic knowledge of computer architecture

Objectives:
The course will enables students to:-
1 Understand the learning and generalisation issue in neural computation.
2 Understand the basic ideas behind most common learning algorithms for multilayer
perceptrons, radial-basis function networks, and Kohonen self-organising maps.
3 To introduce some of the fundamental techniques and principles of neural computation.
4 To investigate some common models and their applications.

Unit
Details Hours
No
Module 1: Introduction: Fundamental concepts: neuron models and basic
learning rules, History, Articial and biological neural networks. Artificial 4
1
intelligence and neural networks
Module 2:Learning of a single neuron and single layer neural networks 4
Module 1: Neurons and Neural Networks: Biological neurons, Models of single
neurons, Different neural network models, Multilayer neural networks and back- 4
2 propagation
Module 2:Associative memory, Single Layer Perceptrons: Least mean square
3
algorithm, Learning curves, Learning rates, Perceptron
Module 1: Multilayer Perceptrons: The XOR problem, Back-propagation
algorithm, Heuristic for improving the back-propagation algorithm, Some 4
3 examples
Module 2:Self-organizing neural networks, Learning of self-organizing neural
4
network, Self-organizing feature map
Module 1:Radial-Basis Function Networks:Interpolation, Regularization,
4
4 Learning strategies
Module 2:Neural Network Trees, Neural Network Trees based learning case study 3
Module 1:Kohonen Self-OrganisingMaps:Self-organising map, The SOM
4
5 algorithm, Learning vector quantisation
Module 2: RBF neural networks and support vector machines. 4

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Outcomes:
On completion of the course, student will be able to–
1 Understand the learning and generalisation issue in neural computation.
2 Understand the basic ideas behind most common learning algorithms for multilayer
perceptrons, radial-basis function networks, and Kohonen self-organising maps.
3 Implement common learning algorithms using an existing package.
4 Apply neural networks to classification and recognition problems.
Text Books
1. 1S. Haykin, Neural Networks: A Comprehensive Foundation 2nd edition, (Prentice Hall, 1999)
2. K. Mehrotra, C. Mohan, and S. Ranka, Elements of Artificial Neural Networks, MIT Press,
1997.
3. C. Looney, Pattern Recognition Using Neural Networks, Oxford University Press, 1997
4. C. Bishop, Neural Networks for Pattern Recognition, Oxford University Press, 1995.
5. J. Hertz, A. Krogh, R.G. Palmer, Introduction to the Theory of Neural
Computation (Addison-Wesley, 1991)
Reference Book
1. Jacek M. Zurada, Introduction to Artificial Neural Systems, PWS Publishing Company,
1995.
2. Simon Haykin, Neural Networks: A Comprehensive Foundation, Macmillan College Publishing
Company, 1994.
3. Mohamad H. Hassoun, Foundamentals of Artificial Neural Networks, The MIT Press, 1995.
4. LaureneFausett, Fundamentals of Neural Networks: Architectures, Algorithms, and
Applications, Prentice Hall International, Inc., 1994.
5. B. D. Ripley, Pattern Recognition and Neural Networks, Cambridge University Press., 1996.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Basic knowledge of computer architecture, Neural network

Unit
Details Hours
No
Module 1: Artificial Neural Network -I Biological neuron, Artificial neuron
model, concept of bias and threshold , McCulloch‐ Pits Neuron Model ,
4
implementation of logical AND, OR, XOR functions Soft Topologies of neural
networks, learning paradigms: supervised, unsupervised, reinforcement,
1
Module 2:Linear neuron model : concept of error energy , gradient descent
algorithm and application of linear neuron for linear regression, Activation
4
functions : binary , bipolar (linear, signup, log sigmoid, tan sigmoid) Learning
mechanisms: Hebbian, Delta Rule o Perceptron and its limitations Draft
Module 1: Artificial Neural Network-II:Multilayer perceptron (MLP) and back
propagation algorithm o Application of MLP for classification and regression o 4
Self‐ organizing Feature Maps,
2
Module 2:k‐ means clustering o Learning vector quantization Radial Basis
Function networks: Cover’s theorem, mapping functions. Application of RBFN for 3
classification and regression o Hopfield network, associative memories.
Module 1: Fuzzy Logic –I: Concept of Fuzzy number, fuzzy set
theory(continuous, discrete) o Operations on fuzzy sets, Fuzzy membership 4
3 functions (core ,boundary ,support) , primary and composite linguistic terms.
Module 2:Concept of fuzzy relation, composition operation (T-norm,T‐conorm) o
4
Fuzzy if‐then rules.
Module 1:Fuzzy Logic-II:Fuzzification , Membership Value Assignment
4 4
techniques, De‐fuzzification ( Maxmembership principle, Centroid method,

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Weighted average method), Concept of fuzzy inference, Implication rules-
Dienes‐Rescher Implication,
Module 2:Mamdani Implication, Zadeh Implication, Fuzzy Inference systems
‐Mamdani fuzzy model , Sugeno fuzzy model , Tsukamoto fuzzy model,
3
Implementation of a simple two‐input single output FIS employing Mamdani
model Computing.
Module 1:Fuzzy Control Systems: CONTROL SYSTEM DESIGN PROBLEM
1.5, Control (Decision) Surface, Assumptions in a Fuzzy Control System Design
4
V, Fuzzy Logic Controllers Soft o Comparison with traditional PID control,
5
advantages of FLC,
Module 2: Architecture of a FLC: Mamdani Type , Example Aircraft landing
4
control problem.

Outcomes:
On completion of the course, student will be able to–
1 use a new tool /tools to solve a wide variety of real world problems
2 find an alternate solution , which may offer more adaptability, resilience and optimization
3 Identify the suitable antenna for a given communication system
4 Gain knowledge of soft computing domain which opens up a whole new career option
5 Tackle real world research problems
Text Books
1. Fundamentals of Neural Networks: Architectures, Algorithms And Applications,
LaureneFausett, Pearson Education, Inc, 2008 .
2. Fuzzy Logic With Engineering Applications, Third Edition Thomas, Timothy Ross, John Wiley
& Sons,2010
3. Neuro- Fuzzy and Soft Computing, J.S. Jang, C.T. Sun, E. Mizutani, PHI Learning Private
Limited.
4. 4. Principles of Soft Computing , S. N. Sivanandam, S. N. Deepa, John Wiley & Sons, 2007
Reference Book
1. Introduction to the theory of neural computation, John Hertz, Anders Krogh, Richard Palmer,
Addison –Wesley Publishing Company, 1991
2. Neural Networks A comprehensive foundation,, Simon Haykin,Prentice Hall International Inc-
1999
3. Neural and Adaptive Systems: Fundamentals through Simulations, José C. Principe Neil R.
Euliano , W. Curt Lefebvre, John-Wiley & Sons, 2000
4. 4. Pattern Classification, Peter E. Hart, David G. Stork Richard O.Duda,Second Edition,2000

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA)
Examination Total
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 0 - 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) - 03 Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:

Objectives:
Students are able to:-
1 To develop problem solving abilities using Mobile Computing
2 To study foundations of Mobile Computing

Unit
Details Hours
No
Fundamental of Wireless and basics of wireless network:
Module 1: Digital communication, wireless communication system and 4
limitations, wireless media, frequency spectrum.
1
Module 2: technologies in digital wireless communication, wireless
communication channel specification, wireless network, wireless switching 4
technology, wireless communication
Mobile Communications and Computing
Module 1: An Overview Mobile Communication, Mobile Computing, Mobile
Computing Architecture, Mobile Devices, Mobile System Networks, Data 4
Dissemination, Mobility Management, Security, Mobile Devices and Systems,
2
Mobile Phones
Module 2: Digital Music Players, Hand-held Pocket Computers, Hand-held
Devices: Operating Systems, Smart Systems,Limitations of Mobile Devices, 3
Automotive Systems.
GSM and other architectures:
Module 1: GSM-Services & System Architectures ,Radio Interfaces, Protocols
Localization, Calling, Handover, Security, New Data Services, modulation, 4
3 multiplexing
Module 2: controlling the medium access, spread spectrum, coding methods,
4
CDMA, IMT 2000, WCDMA and CDMA 2000, 4G Networks.
4 Mobile Network and Transport Layer: 4

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1: IP & Mobile IP Network Layers, Packet Delivery & Handover
Management, Location Management, Registration, Tunneling& Encapsulation,
Route Optimization, Dynamic Host Configuration Protocol
Module 2: Mobile Transport Layer, Conventional TCP/IP Transport Layer
Protocol, Indirect TCP, Snooping TCP, Mobile TCP, Mobile Ad-hoc
3
Networks(MANET), Routing and Routing Algorithms in MANET, security in ad-
hoc networks
Data Dissemination and Data Synchronization in Mobile Computing
Module 1: Communication Asymetry, classification of data delivery mechanism, 4
5 data dissemination broadcast models
Module 2: selective tuning and indexing techniques, synchronization,
4
synchronization software for mobile devices, synchronization protocols.

Outcomes:
On completion of the course, student will be able to–
1 To write a survey on Mobile Computing Building Blocks.
2 To write a presentation on survey FOSS tools and Technologies.
3 To write test cases to solve problems using Mobile Computing algorithms
Text Books
1. Raj Kamal, Mobile Computing, 2/e , Oxford University Press-New Delhi
2. Dr. Sunil kumar S. Manavi, Mahabaleshwar S. Kakkasageri, Wireless and Mobile Networks,
concepts and protocols, Wiley, India.
Reference Book
1. Andrew Tanenbaum, Modern Operating System, 3rd/e, Pearson Education International, ISBN
Q-lB-filBMST-L
2. Digital Content: iOS Technology Overview: IOSTechOverview.pdf, Apple Inc. Copyright
2014

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:

Objectives:
Students are able to:-
1 To describe ubiquitous computing, its properties applications and architectural design.
2 To explain various smart devices and services used in ubiquitous computing.
3 To teach the role of sensors and actuators in designing real time applications using
Ubicomp.
4 To explore the concept of human computer interaction in the context of Ubicomp.
5 To explain Ubicomp privacy and challenges to privacy.

Unit
Details Hours
No
INTRODUCTION TO UBIQUITOUS COMPUTING:
Module 1: Concept of Ubiquitous Computing and Advantages, Ubiquitous
4
Computing Applications and Scope,Properties of Ubiquitous Computing,
1
Modeling the Key Ubiquitous Computing Properties
Module 2: Ubiquitous System EnvironmentInteraction. A architectural
4
DesignforUbiComSystems:SmartDEIModel.
UBIQUITOUS COMPUTING SMART DEVICES AND SERVICES
Module 1: Smart Devices and Service properties, Smart mobile devices and Users, 4
2 Mobile code, Smart Card Devices and Networks, Service Architecture Models.
Module 2: Service Provision Life-Cycle. Virtual Machines and Operating
3
Systems, OS for Mobile Computers and Communicator Devices.
ACTUATION AND CONTROL:
Module 1:TaggingthePhysical World, Sensors andNetworks, Micro-Electro- 4
3 Mechanical Systems
Module 2: Embedded Systems and Real-TimeSystems. Programmable andPID
4
type control system, Robots.
HUMAN COMPUTER INTERACTION
Module 1:UserInterfacesandInteraction for devices, Abstract user interface
4 4
throughBasic Smart Wearable and Implanted Devices. Human-Centered
Design(HCD)

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2: User Models:Direct and indirect user input and modeling, modeling
3
users’ planned tasks and multiple tasks-basedcomputing.
UBIQUITOUS COMPUTING PRIVACY
Module 1: Ubiquitous computing privacy definition, Solove’s taxonomy of
4
privacy, leagal background,
5 Interpersonal privacy,
Module 2:Ubicomp challenges to privacy: Collection scale, manner and
motivation, data types, data accessibility; Case study of privacy solution such as 4
Protecting RFID tags, Ways of addressing privacy in Ubicomp.

Outcomes:
On completion of the course, student will be able to–
1 To Demonstrate the knowledge of design of Ubicomp and its applications.
2 To Explain smart devices and services used Ubicomp.
3 To Describe the significance of actuators and controllers in real time application design.
4 To Use the concept of HCI to understand the design of automation applications.
5 To Classify Ubicomp privacy and explain the challenges associated with Ubicomp privacy.
Text Books
1. Stefan Poslad, Ubiquitous Computing, Wiley, Student Edition, ISBN:9788126527335 John
Krumm, Ubiquitous Computing Fundamentals
Reference Book
1. Yin-LengThengand Henry B.L. Duh, Ubiquitous Computing, IGI, 2 nd Edition, ISBN:
9781599046938
2. Adam Greenfield, Everyware the Drawing age of Ubiquitous Computing, AIGA, 1st Edition ,
ISBN: 9780321384010
3. Laurence T. Yeng, EviSyukur and Seng W. Loke, Handbook on Mobile and Ubiquitous
Computing, CRC, 2 nd Edition, ISBN:9781439848111

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
1. Data Structures and Files. 2. Database management systems.

Objectives:
Students are able to:-
1 To understand information retrieval process.
2 To understand concepts of clustering and how it is related to Information retrieval.
3 To deal Storage, Organization & Access to Information Items.
4 To evaluate the performance of IR system and understand user interfaces for searching
5 To understand information sharing on semantic web.

Unit
Details Hours
No
Introduction:
Module 1:Basic Concepts of IR, Data Retrieval & Information Retrieval, text 4
mining and IR relation, IR system block diagram.
1 Module 2:Automatic Text Analysis: Luhn's ideas, Conflation Algorithm, Indexing
and Index Term Weighing, Probabilistic Indexing Inverted file, Suffix trees &
4
suffix arrays, Signature Files, Scatter storage or hash addressing, Clustered files,
Hypertext and XML data structures.
Module 1:Retrieval strategies: Vector Space model, Probabilistic retrieval
strategies, Language models, Inference networks, Extended Boolean retrieval, 4
2 Latent semantic indexing, neural networks, Fuzzy set retrieval.
Module 2:Retrieval utilities: Relevance feedback, Cluster Hypothesis, Clustering
3
Algorithms: Single Pass Algorithm, Single Link Algorithm.
Module 1:Performance evaluation: Precision and recall, MRR, F-Score, NDCG,
4
user oriented measures, cross fold evaluation.
3
Module 2:Visualisation in Information System: Starting points, document context,
4
User relevance judgement, Interface support for search process.
Module 1:Distributed IR: Introduction, Collection Partitioning, Source Selection,
4 4
Query Processing, web issues.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2:MULTIMEDIA IR: Introduction, Data Modeling, Query languages,
Generic multimedia indexing approach, One dimensional time series, two 3
dimensional color images, Automatic feature extraction.
Module 1:Searching the Web: Challenges, Characterizing the Web, Search
Engines, Browsing, Matasearchers, Web crawlers, Meta-crawler, Web data 4
5
mining, Finding needle in the Haystack, Searching using Hyperlinks,
Module 2:Page ranking algorithms: Pagerank, Rank SVM. 4

Outcomes:
On completion of the course, student will be able to–
1 Understand the concept of Information retrieval.
2 Deal with storage and retrieval process of text and multimedia data.
3 Evaluate performance of any information retrieval system.
4 Design user interfaces.
5 Understand importance of recommender system
Text Books
1. Yates &Neto, Modern Information Retrieval, Pearson Education, ISBN:81-297-0274-6
2. C.J. Rijsbergen, Information Retrieval, (www.dcs.gla.ac.uk)., 2ndISBN:978- 408709293.
3. David Grossman, OphirFrieder, Information Retrieval - Algorithms and Heuristics, Springer
International Edition, ISBN: 978-1-4020-3004-8.
4. Grigoris Antoniou and Frank van Harmelen, A semantic Web Primer, Massachusetts Institute
of Technology, ISBN: 978-0-262-01242-3.
5. Pascal Hitzler, Markus Krötzsch, Sebastian Rudolph, Foundations of Semantic Web
Technologies, Chapman & Hall/CRC, ISBN: 9781420090505.
6. Hang Li, Learning to Rank forInformationRetrievaland Natural Language.
7. Processing, Morgan & Claypool, ISBN: 9781608457076.
Reference Book
1. Christopher D. Manning, PrabhakarRaghavan and HinrichSchutzen, Introduction to
Information Retrieval, Cambridge University Press, Online book, ISBN:978-0-521-86571-5
2. Robert Korfhage, Information Storage and Retrieval, John Wiley & Sons,1 Edition,
ISBN:9788126507702.
3. Kowalski, Gerald, Maybury, Mark, Information Storage and Retrieval Systems :Theory and
Implementation, Springer US, 2 nd Edition,ISBN:978-0-7923-7924-9.
4. Zhang, Jin, Visualization for Information Retrieval, Springer-Verlag Berlin Heidelberg,1st
Edition,ISBN:978-3-642-09442-2Mark leven, Introduction to search engines and web navigation,
John Wiley and sons Inc, 2 ndEdition,ISBN 9780-170-52684-2.
5. V. S. Subrahamanian, Satish K. Tripathi , Multimedia information System,Kulwer Academic
Publisher.

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
1. Web Technology. 2. Computer Network Technology. 3. Operating System.

Unit
Details Hours
No
Module 1: Characteristics and examples of distributed systems, Design goals,
Types of distributed systems, Trends in distributed systems, Focus on Resource 4
Sharing, Challenges.
1
Module 2:Architectures: Architectural styles, middleware and middleware
organization, system architectures, Example architectures. Case Study: The World 4
Wide Web
Module 1: Communication: Introduction, Layered protocols , Types of
communication, Inter-process Communication, Remote Procedure Call (RPC), 4
Message oriented communication, Multicast Communication,
2
Module 2:Network Virtualization: Overlay Network Coordination: Clock
Synchronization, Logical Clocks, Mutual Exclusion, Election algorithms, 3
Distributed event matching, Gossip Based coordination
Module 1: Replication: Reasons for replication, Replica management, Failure
4
masking and replication, Consistency protocols, Catching and replication in web,
3 Module 2: Fault Tolerance: Introduction, Failure models, Fault systems with
arbitrary failures, Reliable client server communication, Reliable group 4
communication, Distributed commit, Recovery, Checkpoints
Module 1:Distributed File Systems: Introduction, File System Architecture, Sun
4 4
Network File System, and HDFS. Name Services: Introduction, Name Services

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
and the Domain Name System, Directory Services.
Module 2: Case Study- 1: The Global Name Service, 2. The X.500 Directory
Service. Distributed Multimedia Systems: Characteristics of Multimedia Data, 3
Quality of Service Management, Resource management, Stream Adaptation.
Module 1:Architecture of Traditional Web-Based Systems, Apache Web Server,
Web Server Clusters, Communication by Hypertext Transfer Protocol, 4
5 Synchronization, Web Proxy Caching, Replication for Web Hosting Systems
Module 2:Replication of Web Applications, Fault Tolerance in distributed web
4
based systems, Security Concerns.

Outcomes:
On completion of the course, student will be able to–
1 Understand the principles and desired properties of distributed systems based on different
application areas.
2 Understand and apply the basic theoretical concepts and algorithms of distributed systems
in problem solving.
3 Recognize the inherent difficulties that arise due to distributed-ness of computing resources.
4 Identify the challenges in developing distributed applications
Text Books
1. Maarten van Steen, Andrew S. Tanenbaum, Distributed Systems , PHI, 3rd Edition Version 3.01,
ISBN: 978-15-430573-8-6(Printed).
2. Andrew S. Tanenbaum, Maarten van Steen, Distributed Systems – Principles and Paradigms,
PHI, 2nd Edition, ISBN: 978-0130888938.
Reference Book
1. George Coulouris, Distributed Systems: Concepts and Design,Pearson, 5 th edition, Jean
Dollimore, Tim Kindberg, Gordon Blair, ISBN:13: 978-0132143011, ISBN:10: 0132143011. 2.
AbhijitBelapurkar, AnirbanChakrabarti, HarigopalPonnapalli, NiranjanVarada
2. rajan, SrinivasPadmanabhuni, SrikanthSunderrajan, Distributed System Security: Issues,
Processes and solutions, Willey online Library, ISBN: 978-0-470-51988-2.
3. 3. SunitaMahajan, Seema Shah, Distributed Computing, Oxford University Press, 2nd Edition,
ISBN-13: 978-0198093480.

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme Continuous Internal Assessment (CIA) Total
Examination
(Hrs. /Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
3 0 0 3 10 20 10 10 -- 50 -- 100
Max. Time, End Semester Exam (Theory) -3Hrs. End Semester Exam (Lab) – 00 Hrs.

Prerequisites:
Understanding of the database schema and need for normalization. Knowledge of Design the
database schema with the use of appropriate data types for storage of data in database. Use different
types of database analysis and visualization tools

Objectives:
Students are able to:-
1 To Evaluate emerging architectures for database management systems
2 To develop an understanding of the manner in which relational systems are implemented
and the implications of the techniques of implementation for database performance
3 to assess the impact of emerging database standards on the facilities which future database
management systems will provide

Unit
Details Hours
No
Module 1:Database Concepts (File System and DBMS), Database Storage 5
Structures (Tablespace, Control files, Data files)
1
Module 2:Structured and Unstructured data, SQL Commands (DDL, DML & 5
DCL), Dataware Housing concept and tools (ETL tools),
Module 1: Introduction to Modern databases,NoSQL, NewSQL, NoSQLVs 4
RDBMS databases, Advantages &Tradeoffs, Working with MongoDb,No,SQL,
2 Data Models , XML, working with MongoDB),
Module 2:Tools , OLTP and OLAP, data preparation and cleaning techniques 5

Module 1: Advanced query optimization: Volcano/Cascades framework for query 4

optimization; multi-query optimization, materialized views and view maintenance
3
Module 2:index and view selection, database tuning. Adaptive query processing 4
and optimization
Module 1:Query processing on RDF data.Transaction and query processing on 4
main-memory and columnar databases.
4
Module 2: Data streams and stream management systems. Information retrieval 4
and databases

5 Module 1: Handling uncertain and precise data. Security and privacy. 4

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 2:Crowd-sourced databases, applications of declarative querying outside 3
of database applications

Outcomes:
At the end Students will be able to-
1 Critically assess new developments in database technology
2 Interpret and explain the impact of emerging database standards
3 Evaluate the contribution of database theory to practical implementations of database
management systems
Text Books
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan, Database System Concepts 6th
Ed, McGraw Hill, 2010.
2. Transaction Processing, Concepts and Techniques, J. Gray and A. Reuter, Morgan
Kauffman, 1994
Reference Book
1. MongoDB in Action by Kyle Banker
2. The Definitive Guide –MongoDB by Kristina Chodorow
3. MongoDB Aggregation Framework Principles and Examples by John Lynn
4. Getting Started with NoSQL by GauravVaish
5. Database System Concept by Henry Korth, S.Sudarshan& Abraham Silberschatz

Document Reference Revision No. / Date Prepared By Approved By

Prerequisites:
Systems Programming and Operating System

Objectives:
Students are able to:-
1 To understand a typical embedded system and its constituents
2 To learn the selection process of processor and memory for the embedded system
3 To learn communication buses and protocols used in the embedded and real-time systems
4 To understand real-time operating system (RTOS) and the types of RTOS
To learn various approaches to real-time scheduling

Unit
Details Hours
No
Module 1: Introduction to Embedded systems, Characteristics, Challenges,
Processors in Embedded systems, hardware Unit s and devices in an embedded
3
system – Power source, memory, real-time clocks, timers, reset circuits, watchdog-
1 timer reset,
Module 2:Input-output ports, buses and interfaces, ADC, DAC, LCD, LED,
Keypad, pulse dialer, modem, transceivers, embedded software, software are tools 3
for designing an embedded system.
Module 1: Embedded SOC, ASIC, IP core, ASIP, ASSP, examples of embedded
systems. Advanced architectures/processors for embedded systems- ARM,
SHARC, DSP, Superscalar Units. Processor organization, Memory organization, 3
Performance metrics for a processor, memory map and addresses, Processor
2
selection and memory selection for real-time applications.
Module 2:Networked embedded systems- I2C, CAN, USB, Fire wire. Internet
enabled systems- TCP, IP, UDP. Wireless and mobile system Protocols- IrDA, 3
Bluetooth, 802.11, ZigBee.
Module 1: Devices and communication buses: Types of I/O communication, types
of serial communication, Serial protocols, Devices and buses- RS-232C, RS-485, 3
3 HDLC, SPI, SCI, SI, SDIO. Parallel ports and interfacing.
Module 2:Parallel device protocols: ISA, PCI, PCI/X, ARM bus, Wireless
3
devices.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019
School of Computing Science and Engineering
Department of Computer Science and Engineering
Module 1:Introduction to real-time operating systems. Hard versus soft real-time
systems and their timing constraints. Temporal parameters of real-time process: 3
Fixed, Jittered and sporadic release times, execution time.
4 Module 2:Types of real-time tasks, Precedence constraints and data dependency
among realtime tasks, other types of dependencies for real-time tasks. Functional
3
parameters and Resource parameters of real-time process, Real-time applications:
Guidance and control, Signal processing, Multimedia, real-time databases.
Module 1:Real-time task and task states, task and data. Approaches to real-time
scheduling: clock driver, weighted round-robin, priority-driven- Fixed priority and
4
dynamic priority algorithms –Rate Monotonic (RM), Earliest-Deadline-First
5
(EDF), Latest-Release-Time (LRT), Least-Slack-TimeFirst (LST).
Module 2:Static and Dynamic systems, on-line and off-line scheduling,
4
Scheduling a-periodic and sporadic real-time tasks

Outcomes:
On completion of the course, student will be able to–
1 Recognize and classify embedded and real-time systems
2 Explain communication bus protocols used for embedded and real-time systems
3 Classify and exemplify scheduling algorithms
4 Apply software development process to a given RTOS application
Design a given RTOS based application
Text Books
1. Raj Kamal, “Embedded Systems: Architecture, programming and Design”, 2nd Edition,
McGraw-Hill, ISBN: 13: 9780070151253
2. Jane W. S. Liu, “Real-Time Systems”, Pearson Education, ISBN: 10: 0130996513
3. David E. Simon, “An Embedded Software Primer”, Pearson Education, ISBN: :8177581546
Reference Book
1. Sriram V. Iyer, Pankaj Gupta, “Embedded Real-time Systems Programming”, Tata McGraw-
Hill, ISBN: 13: 9780070482845
2. Dr. K. V. K. K. Prasad, “Embedded Real-Time Systems: Concepts: Design and Programming”,
Black Book, Dreamtech Press, ISBN: 10: 8177224611,13: 9788177224610

Document Reference Revision No. / Date Prepared By Approved By

Teaching
End Semester
Scheme (Hrs. Continuous Internal Assessment (CIA)
Examination Total
/Week)
L T P C CIA-1 CIA-2 CIA-3 CIA-4 Lab Theory Lab
-- -- 12 8 -- -- -- -- 50 -- 100 150
Max. Time, End Semester Exam (Theory) -03 Hrs. End Semester Exam (Lab) – 00 Hrs.

Unit
Details Hours
No
Course (catalog) description: As a part of the B. Tech Curriculum, Dissertation
Stage- II is a Practical course, in which the students of CSE are trained for
project based learning.
Proposed Criteria for Dissertation Evaluation

Document Reference Revision No. / Date Prepared By Approved By

Tools Required:
Preferably 64-bit FOSS tools but if sponsoring company’s requirement is non-open
sourceplatform then it must be latest and current version of non-absolute tools. 64-
bit i5/i7Desktops/Mobiles, Latest SAN,3-tier architectures along with latest
version of FOSS Operating systems like Fedora 21or equivalent, LAMP tools,
WEB server, Applications servers, Database servers, MongoDBor latest open
source BigDATA tools, FOSS Programming Tools like gcc,g++,Eclipse,Python,
Java and other tools are as per the requirement of the SRS. The
documentationtools like Open office, GIT, Latex, Latex-Presentation
Outcomes:
On completion of the course, student will be able to–
1 An ability to work in actual working environment.
2 An ability to utilize technical resources.
3 An ability to write technical documents and give oral presentations related to the
work completed.

Document Reference Revision No. / Date Prepared By Approved By

SUN/SOCSE/BTECH/CSF/2019 R3 / 23 October 2019

IT311-Information Assurance and Security
100% (1)
IT311-Information Assurance and Security
12 pages
STAR8800 User Manual
No ratings yet
STAR8800 User Manual
99 pages
Course Outline SCS4110
No ratings yet
Course Outline SCS4110
3 pages
Computer Security
No ratings yet
Computer Security
7 pages
4205-Comuter Systems Security Course Outline
No ratings yet
4205-Comuter Systems Security Course Outline
5 pages
Cyber Security Unit-1
No ratings yet
Cyber Security Unit-1
34 pages
CP ISS vsFgqAla3v
No ratings yet
CP ISS vsFgqAla3v
11 pages
CSE 323 Computer and Cyber Security Ourse Outline Fall 2023
No ratings yet
CSE 323 Computer and Cyber Security Ourse Outline Fall 2023
7 pages
Lecture1_Intro(Part-I)
No ratings yet
Lecture1_Intro(Part-I)
38 pages
PCAP Level I Bootcamp Rev 8.21
No ratings yet
PCAP Level I Bootcamp Rev 8.21
12 pages
Network Security Revised-Eric
No ratings yet
Network Security Revised-Eric
3 pages
IAS-101-PRELIM-MODULE-1-5-2024-2024-2ND-SEM
No ratings yet
IAS-101-PRELIM-MODULE-1-5-2024-2024-2ND-SEM
40 pages
Info Assurance Security Syll 2 2022-2023
No ratings yet
Info Assurance Security Syll 2 2022-2023
7 pages
CSE3501 - INFORMATION-SECURITY-ANALYSIS-AND-AUDIT - ETH - 1.0 - 62 - CSE3501 Information Security Analysis and Audit
100% (1)
CSE3501 - INFORMATION-SECURITY-ANALYSIS-AND-AUDIT - ETH - 1.0 - 62 - CSE3501 Information Security Analysis and Audit
3 pages
BE - IT CBCS VII & VIII Syllabus - Information Security-Cbit
No ratings yet
BE - IT CBCS VII & VIII Syllabus - Information Security-Cbit
2 pages
Bcse410l Cyber-Security TH 1.1 0 Bcse410l
No ratings yet
Bcse410l Cyber-Security TH 1.1 0 Bcse410l
2 pages
CIS6006-Cyber Security WRIT1
No ratings yet
CIS6006-Cyber Security WRIT1
14 pages
Reference-Material- Information security
No ratings yet
Reference-Material- Information security
20 pages
Cybersecurity Exam Questions and Answers
100% (1)
Cybersecurity Exam Questions and Answers
158 pages
Jakkx
No ratings yet
Jakkx
13 pages
3.1 Cyber Security (ECSDECYS001T)
No ratings yet
3.1 Cyber Security (ECSDECYS001T)
2 pages
Cybersecurity Syllabus
No ratings yet
Cybersecurity Syllabus
2 pages
cyber sec sem 4
No ratings yet
cyber sec sem 4
7 pages
3 III BTech Minor CS courses syllabus
No ratings yet
3 III BTech Minor CS courses syllabus
5 pages
Moduleoutline INFO409
No ratings yet
Moduleoutline INFO409
3 pages
23it17report
No ratings yet
23it17report
43 pages
Course Outline. Introduction to Computer Security
No ratings yet
Course Outline. Introduction to Computer Security
3 pages
IS - Unit-I - Foundations of Information Security
No ratings yet
IS - Unit-I - Foundations of Information Security
106 pages
CMT 405 Course Outline
No ratings yet
CMT 405 Course Outline
4 pages
Cyber Security
No ratings yet
Cyber Security
14 pages
Department of Computer Science & Engineering: Syllabus Booklet
No ratings yet
Department of Computer Science & Engineering: Syllabus Booklet
27 pages
CS 5950/6030 Network Security Class 1 (W, 8/31/05)
No ratings yet
CS 5950/6030 Network Security Class 1 (W, 8/31/05)
27 pages
Introduction To Information Security
No ratings yet
Introduction To Information Security
5 pages
Lecture1-2_IPS
No ratings yet
Lecture1-2_IPS
32 pages
DLC Form Course Syllabus
No ratings yet
DLC Form Course Syllabus
8 pages
SYLLABUS
No ratings yet
SYLLABUS
3 pages
Bcse354e Information-Security-Management Eth 1.0 77 Bcse354e
No ratings yet
Bcse354e Information-Security-Management Eth 1.0 77 Bcse354e
2 pages
Course Outline
No ratings yet
Course Outline
3 pages
DSF-112023 Module Introduction v2
No ratings yet
DSF-112023 Module Introduction v2
18 pages
CT702-N - Cyber Security
No ratings yet
CT702-N - Cyber Security
4 pages
Csvtu Mtech CFIS Syllabus 2nd Sem
No ratings yet
Csvtu Mtech CFIS Syllabus 2nd Sem
10 pages
M. Sc. CS Draft Syllabus 13.12.2021
No ratings yet
M. Sc. CS Draft Syllabus 13.12.2021
73 pages
System Security
No ratings yet
System Security
4 pages
Cybersecurity 1
No ratings yet
Cybersecurity 1
43 pages
Csbs 6
No ratings yet
Csbs 6
23 pages
2012S1 Itsy 1400 5420
No ratings yet
2012S1 Itsy 1400 5420
5 pages
Course Overview: This Course Provides In-Depth Coverage of The Eight Domains Required To Pass The CISSP Exam
No ratings yet
Course Overview: This Course Provides In-Depth Coverage of The Eight Domains Required To Pass The CISSP Exam
30 pages
AI 403 Cyber Security and Forensics
No ratings yet
AI 403 Cyber Security and Forensics
2 pages
#09. 25_SP-ITSY-1342-3P1-Information Technology Security
No ratings yet
#09. 25_SP-ITSY-1342-3P1-Information Technology Security
23 pages
Information Security Management
No ratings yet
Information Security Management
3 pages
Final B.voc. Syllabus- FCS
No ratings yet
Final B.voc. Syllabus- FCS
4 pages
(ISC)2 CISSP Certified Information Systems Security Professional Official Study Guide Mike Chappledownload
100% (2)
(ISC)2 CISSP Certified Information Systems Security Professional Official Study Guide Mike Chappledownload
58 pages
IESC_master_CYS_2021-2022_Syl
No ratings yet
IESC_master_CYS_2021-2022_Syl
6 pages
New Syllabus
No ratings yet
New Syllabus
4 pages
CST2410 Syllabus
No ratings yet
CST2410 Syllabus
3 pages
CIS2619 W15 Syllabus
No ratings yet
CIS2619 W15 Syllabus
5 pages
Cyber Security Documentation
No ratings yet
Cyber Security Documentation
9 pages
01CC0102 - FUNDAMENTAL OF CYBER SECURITY
No ratings yet
01CC0102 - FUNDAMENTAL OF CYBER SECURITY
3 pages
CSD4003 Network-And-System-Security LP 1.0 6 CSD4003
No ratings yet
CSD4003 Network-And-System-Security LP 1.0 6 CSD4003
3 pages
Dr.B.R.Ambedkar Institute of Technology ,: Department of Computer Engineering
100% (1)
Dr.B.R.Ambedkar Institute of Technology ,: Department of Computer Engineering
9 pages
Practical Pentesting Guide: Preparation for Certification and Ethical Hacking
From Everand
Practical Pentesting Guide: Preparation for Certification and Ethical Hacking
Evan Blake
No ratings yet
233125 PMT101 – MATHEMATICAL LOGIC COMBINATION AND GRAPH THEORY
No ratings yet
233125 PMT101 – MATHEMATICAL LOGIC COMBINATION AND GRAPH THEORY
4 pages
233252.54.59.66.74.79 17YCS602-Software Engineering and Project Management-set-2..
No ratings yet
233252.54.59.66.74.79 17YCS602-Software Engineering and Project Management-set-2..
3 pages
232486.99 17ycf403– It Application Security-1
No ratings yet
232486.99 17ycf403– It Application Security-1
3 pages
233071.72.73 17YCS701 OBJECT ORIENTED ANALYSIS & DESIGN
No ratings yet
233071.72.73 17YCS701 OBJECT ORIENTED ANALYSIS & DESIGN
4 pages
AWS_Cloud_Compounding
No ratings yet
AWS_Cloud_Compounding
25 pages
IT Project Management IT-402
No ratings yet
IT Project Management IT-402
2 pages
TNPSC Science (PYQP) 2023
No ratings yet
TNPSC Science (PYQP) 2023
60 pages
ErrorDetails (7)
No ratings yet
ErrorDetails (7)
5 pages
Triac Application Note
No ratings yet
Triac Application Note
10 pages
Aog Checklist Final
No ratings yet
Aog Checklist Final
1 page
Validation Notes
No ratings yet
Validation Notes
13 pages
Fast and Flexible Conversion of Geohash Codes To and From Latiture Longitude Coordinates PDF
No ratings yet
Fast and Flexible Conversion of Geohash Codes To and From Latiture Longitude Coordinates PDF
8 pages
1756-Controllogix Common Procedures Programming Guide
No ratings yet
1756-Controllogix Common Procedures Programming Guide
575 pages
Ds-3E0109P-E 8-Ports 100Mbps Unmanaged Poe Switch
No ratings yet
Ds-3E0109P-E 8-Ports 100Mbps Unmanaged Poe Switch
2 pages
FCC - 2021 - Fourteenth Broadband Development Report
No ratings yet
FCC - 2021 - Fourteenth Broadband Development Report
290 pages
RFC 2928
No ratings yet
RFC 2928
9 pages
Epson PP-100 - Product Brochure
No ratings yet
Epson PP-100 - Product Brochure
6 pages
Sample Test Plan
No ratings yet
Sample Test Plan
18 pages
Business Communication Sem I
No ratings yet
Business Communication Sem I
82 pages
T Rec T.871 201105 I!!pdf e
No ratings yet
T Rec T.871 201105 I!!pdf e
18 pages
PCB Module Manual
No ratings yet
PCB Module Manual
91 pages
Ins QB
No ratings yet
Ins QB
3 pages
1 Answer:: Question 1. Define The Jobs Performed by The Biu and Eu in The 8086.? 2
No ratings yet
1 Answer:: Question 1. Define The Jobs Performed by The Biu and Eu in The 8086.? 2
12 pages
Written Report On Infographics
No ratings yet
Written Report On Infographics
6 pages
Resume Syaza Suhaimy (OLD 0123)
No ratings yet
Resume Syaza Suhaimy (OLD 0123)
1 page
Data Communication and Computer Network Questions 1 For Students
No ratings yet
Data Communication and Computer Network Questions 1 For Students
18 pages
AEC24_RTI_RTaW_DDS-over-TSN-1
No ratings yet
AEC24_RTI_RTaW_DDS-over-TSN-1
23 pages
Data Resilience With Flash Level 1 Quiz PDF
No ratings yet
Data Resilience With Flash Level 1 Quiz PDF
9 pages
Laval Virtual
No ratings yet
Laval Virtual
3 pages
CRM Detail
No ratings yet
CRM Detail
2 pages
Sales Planning Hands-On Workshop Oct 24
No ratings yet
Sales Planning Hands-On Workshop Oct 24
48 pages
IEEE Paper Template
No ratings yet
IEEE Paper Template
3 pages
Cassandra
No ratings yet
Cassandra
10 pages

Btech CSF Syllabus (18 19)

Uploaded by

Btech CSF Syllabus (18 19)

Uploaded by

School of Computing Science and Engineering

Department of Computer Science and Engineering

Sr. Course Formative Summative Total

Course Lab Course Lab

1 17YES103 Information Security Fundamentals 2 -- -- 2 50 -- 50 -- 100

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Sr. Course Formative Summative Total

Course Lab Course Lab

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

B. Tech CSE (with specialization in Cyber Security and Forensics)

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Document Reference Revision No. / Date Prepared By Approved By

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Please respond to the following questions regarding your internship experience.

 Work experience relates to my career goals

Why or why not?

5. Your Name: _________________________________________ Date: ______________

Document Reference Revision No. / Date Prepared By Approved By

CIA: Continuous Internal Assessment #: Internship for 15 days.

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Guidelines for Assessment

Document Reference Revision No. / Date Prepared By Approved By

Operating System recommended : 64-bit Open source Linux or its derivative

Document Reference Revision No. / Date Prepared By Approved By

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

Guidelines for Assessment

Operating System recommended : 64-bit Open source Linux or its derivative

Document Reference Revision No. / Date Prepared By Approved By

Document Reference Revision No. / Date Prepared By Approved By

5. Your Name: ___________________________ Date: