0% found this document useful (0 votes)
4 views3 pages

Security Analysis Using Python

The document outlines the syllabus for courses in Predicate Calculus, Security Analysis using Python, and Introduction to Cyber Forensics, covering topics such as functions, relations, formal languages, finite automata, and network programming. It includes details on mathematical concepts, programming structures, and the fundamentals of computer forensics, including data recovery and evidence collection. References for further reading are also provided for each course.

Uploaded by

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

Security Analysis Using Python

The document outlines the syllabus for courses in Predicate Calculus, Security Analysis using Python, and Introduction to Cyber Forensics, covering topics such as functions, relations, formal languages, finite automata, and network programming. It includes details on mathematical concepts, programming structures, and the fundamentals of computer forensics, including data recovery and evidence collection. References for further reading are also provided for each course.

Uploaded by

anjalysivan58
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Predicate calculus – Mathematical induction.

Functions and Relations: Injective, Surjective, Bijective functions - composition, identity, inverse;
Relations - properties of relations - closure operations on relations.

UNIT V
Formal languages: Four classes of grammars (Phrase Structure, Context sensitive, Context Free,
Regular) - definitions - Context free Grammar : Right most, Left most derivations – Syntax trees –
Unambiguity, Ambiguity – Construction of grammars for languages – Derivation of languages from
grammars – Regular expressions.

Finite automata: Definition of Deterministic Finite state Automaton (DFA), Non deterministic Finite
state Automaton (NFA) - equivalence of DFA and NFA - Equivalence of regular grammars and
finite automata.

Push Down Automata (PDA): Informal description - definition - Deterministic PDA - Equivalence
of acceptance by final state and empty stack - Equivalence of PDA's and Context Free languages.

References
1. Advanced Engineering Mathematics, Erwin Kreyzig, 9th edition, John Wiley & Sons, Inc, 2006
2. Discrete mathematics and its applications, Kenneth H Rosen, 7th edition, McGraw-Hill Higher
Education, 2012
3. Introduction to Automata Theory, Languages and Computation, John E Hopcroft, Rajeev
Motwani, and Jeffrey [Link], Addison-Wesley/Pearson, 2006.
4. Introduction to Languages and the Theory of Computation, John C Martin, 3rd edition, Tata
McGraw-Hill Education Pvt. Ltd., 2007

CF010103 SECURITY ANALYSIS USING PYTHON

Total Hours: 72
Total Credits: 4
Objective of Course: To identify and analyse the computer and network security risks using
python.

UNIT I

Program Structure & Syllabus PGCSS 2019 – M. Sc. Cyber Forensics Page 10
Introduction-Running Python, Variables and Arithmetic Expressions, Conditionals, File Input and
Output ,Strings, Lists, Tuples, Sets, Dictionaries, Iteration and Looping, Functions, Generators,
Coroutines , Objects and Classes, Exceptions , Modules ,Getting Help .

Lexical Conventions and Syntax-Line Structure and Indentation, Identifiers and Reserved Words,
Numeric Literals, String Literals ,Containers ,Operators, Delimiters, and Special Symbols,
Documentation Strings, Decorators, Source Code Encoding.

Types and Objects-Terminology, Object Identity and Type, Reference Counting and Garbage
Collection, References and Copiesm, First-Class Objects, Built-in Types for Representing Data,
Built-in Types for Representing Program Structure, Built-in Types for Interpreter Internals, Object
Behaviour and Special Methods.

UNIT II
Operators and Expressions-Operations on Numbers, Operations on Sequences, String Formatting,
Advanced String Formatting, Operations on Dictionaries, Operations on Sets, Augmented
Assignment The Attribute (.) Operator, The Function Call () Operator, Conversion Functions,
Boolean Expressions and Truth Values, Object Equality and Identity, Order of Evaluation,
Conditional Expressions

Program Structure and Control Flow-Program Structure and Execution, Conditional Execution,
Loops and Iteration, Exceptions, Built-in Exceptions, Defining New Exceptions.
Functions and Functional Programming-Functions, Parameter Passing and Return Values, Scoping
Rules.

UNIT III
Classes and Objects: Oriented Programming, The class Statement, Class Instances, Scoping Rules,
Inheritance, Modules, Packages, and Distribution- Modules and the import Statement. Built-in
Functions and Types.

UNIT IV
Network Programming and Sockets: Network Programming Basics, asyn chat, asyncore, select,
socket, ssl, SocketServer. Internet Application Programming: ftp lib, http Package, smtplib, urllib
Package. Web Programming-cgi, cgitb, wsgiref, web browser. Cryptographic Services.

Program Structure & Syllabus PGCSS 2019 – M. Sc. Cyber Forensics Page 11
UNIT V
Introducing the scope of pentesting, Approaches to pentesting , Scanning Pentesting-Ping sweep,
The TCP scan concept and its implementation using a Python script, How to create an efficient IP
scanner, The concept of a port scanner, How to create an efficient port scanner. Introducing a
network sniffer, Implementing a network sniffer using Python. Wireless SSID finding and wireless
traffic analysis by Python, Wireless attacks, The concept of foot printing of a web server, Introducing
information gathering.

References
1. Python Essential Reference, David M. Beazley, 4 th Edition, Pearson Education, Inc.,
2009
2. Python Penetration Testing Essentials, Mohit Raj, 2nd Edition, Packt Publishing Ltd,
2015
3. Python Programming: An Introduction to Computer Science , John Zelle , Michael
Smith, Franklin, Beedle & Associates Inc; 2nd edition , 2010

CF010104 INTRODUCTION TO CYBER FORENSICS

Total Hours: 72
Total Credits: 4
Objective of Course: This course provides a broad knowledge of computer crimes and forensics.

UNIT I
Computer forensics fundamentals: What is computer forensics, use of computer forensics in law
enforcement, Computer forensics assistance to human resource/employment proceedings, Computer
forensics services, benefits of professional forensics methodology, steps taken by Computer
forensics specialists, who can use Computer forensics evidence, Types of Computer forensics
technology: types of military Computer forensics technology, types of law enforcement, Computer
forensic technology, types of business Computer forensic technology. Types of vendor and computer
forensics services: Occurrence of cyber crime, cyber detectives, computer forensics investigative
services, forensics process improvement.

UNIT II
Data recovery: Data recovery defined, data back-up and recovery, the role of back-up in data
recovery, the data recovery solution. Evidence collection and data seizure- Why collective evidence,

Program Structure & Syllabus PGCSS 2019 – M. Sc. Cyber Forensics Page 12

You might also like