V.B.S.
PURVANCHAL UNIVERSITY, JAUNPUR
Evaluation Scheme & Syllabus
For
B.Tech. 2nd Year (III & IV Sem.)
(CSE/IT/ECE/EIE/ME/EE)
Syllabus of Non Credit Courses
(Effective from the Session 2020-21)
V.B.S. PURVANCHAL UNIVERSITY, JAUNPUR
B.TECH (B.TECH. (CSE/IT/ECE/EIE/ME/EE)
SEMESTER- III
End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No. Codes
L T P CT TA Total PS TE PE
KNC301/ Computer System 75
1 2 0 0 15 10 25 50 0
KNC302 Security/Python Programming
SEMESTER- IV
End
Sl. Subject Periods Evaluation Scheme Total
Subject Semester Credit
No. Codes
L T P CT TA Total PS TE PE
KNC402/ Python Programming/ 75
1 2 0 0 15 10 25 50 0
KNC401 Computer System Security
DETAILED SYLLABUS
COMPUTER SYSTEM SECURITY
Course Outcome ( CO)
At the end of course , the student will be able to understand
To discover software bugs that pose cyber security threats and to explain how to fix the bugs to
CO 1 mitigate such threats K1, K2
To discover cyber attack scenarios to web browsers and web servers and to explain how to
CO 2 mitigate such threats K2
To discover and explain mobile software bugs posing cyber security threats, explain and
CO 3 recreate exploits, and to explain mitigation techniques. K3
To articulate the urgent need for cyber security in critical computer systems, networks, and
CO 4 world wide web, and to explain various threat scenarios K4
To articulate the well known cyber attack incidents, explain the attack scenarios, and explain
CO 5 mitigation techniques. K5, K6
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Computer System Security Introduction: Introduction, What is computer security and what to l
earn? , Sample Attacks, The Marketplace for vulnerabilities, Error 404 Hacking digital India part 1
chase.
I Hijacking & Defense: Control Hijacking ,More Control Hijacking attacks integer overflow ,More 08
Control Hijacking attacks format string vulnerabilities, Defense against Control Hijacking -
Platform Defenses, Defense against Control Hijacking - Run-time Defenses, Advanced Control
Hijacking attacks.
Confidentiality Policies: Confinement Principle ,Detour Unix user IDs process IDs and privileges
II , More on confinement techniques ,System call interposition ,Error 404 digital Hacking in India
part 2 chase , VM based isolation ,Confinement principle ,Software fault isolation , Rootkits 08
,Intrusion Detection Systems
Secure architecture principles isolation and leas: Access Control Concepts , Unix and windows
access control summary ,Other issues in access control ,Introduction to browser isolation .
III Web security landscape : Web security definitions goals and threat models , HTTP content 08
rendering .Browser isolation .Security interface , Cookies frames and frame busting, Major web
server threats ,Cross site request forgery ,Cross site scripting ,Defenses and protections against XSS
, Finding vulnerabilities ,Secure development.
IV Basic cryptography: Public key cryptography ,RSA public key crypto ,Digital signature Hash
functions ,Public key distribution ,Real world protocols ,Basic terminologies ,Email security 08
certificates ,Transport Layer security TLS ,IP security , DNS security.
Internet Infrastructure: Basic security problems , Routing security ,DNS revisited ,Summary of
V 08
weaknesses of internet security ,.Link layer connectivity and TCP IP connectivity , Packet filtering
firewall ,Intrusion detection.
\
Text books:
1. William Stallings, Network Security Essentials: Applications and Standards, Prentice Hall, 4th edition, 2010.
2. Michael T. Goodrich and Roberto Tamassia, Introduction to Computer Security, Addison Wesley, 2011.
3. William Stallings, Network Security Essentials: Applications and Standards, Prentice Hall, 4th edition, 2010.
4. Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptography, CRC Press,
2001.
Mapped With : https://ict.iitk.ac.in/product/computer-system-security/
PYTHON PROGRAMMING
Course Outcome ( CO)
At the end of course , the student will be able to understand
To read and write simple Python programs.
CO 1 K1, K2
To develop Python programs with conditionals and loops.
CO 2 K2, K4
To define Python functions and to use Python data structures - lists, tuples, dictionaries
CO 3 K3
To do input/output with files in Python
CO 4 K2
To do searching ,sorting and merging in Python
CO 5 K2, K4
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: The Programming Cycle for Python , Python IDE, Interacting with Python Programs ,
Elements of Python, Type Conversion.
I 08
Basics: Expressions, Assignment Statement, Arithmetic Operators, Operator Precedence, Boolean
Expression.
Conditionals: Conditional statement in Python (if-else statement, its working and execution),
Nested-if statement and Elif statement in Python, Expression Evaluation & Float Representation.
II 08
Loops: Purpose and working of loops , While loop including its working, For Loop , Nested Loops ,
Break and Continue.
Function: Parts of A Function , Execution of A Function , Keyword and Default Arguments ,Scope
Rules.
Strings : Length of the string and perform Concatenation and Repeat operations in it. Indexing and
III
Slicing of Strings. 08
Python Data Structure : Tuples , Unpacking Sequences , Lists , Mutable Sequences , List
Comprehension , Sets , Dictionaries
Higher Order Functions: Treat functions as first class Objects , Lambda Expressions
Sieve of Eratosthenes: generate prime numbers with the help of an algorithm given by the Greek
Mathematician named Eratosthenes, whose algorithm is known as Sieve of Eratosthenes.
File I/O : File input and output operations in Python Programming
Exceptions and Assertions
IV Modules : Introduction , Importing Modules , 08
Abstract Data Types : Abstract data types and ADT interface in Python Programming.
Classes : Class definition and other operations in the classes , Special Methods ( such as _init_,
_str_, comparison methods and Arithmetic methods etc.) , Class Example , Inheritance , Inheritance
and OOP.
Iterators & Recursion: Recursive Fibonacci , Tower Of Hanoi
Search : Simple Search and Estimating Search Time , Binary Search and Estimating Binary Search
V 08
Time
Sorting & Merging: Selection Sort , Merge List , Merge Sort , Higher Order Sort
Text books:
Updated for Python 3,
Revised and updated for Python 3.2, Network
Theory Ltd., 2011.
expanded Edition, MIT
Press , 2013
An Inter-disciplinary
Approach, Pearson India Education Services Pvt. Ltd., 2016.
-Graw Hill Education (India) Private Ltd.,, 2015.
ython: A Computational ProblemSolving Focus, Wiley
India Edition, 2013.
Computer Science
Mapped With : https://ict.iitk.ac.in/product/python-programming-a-practical-approach/
