PROPOSED SCHEME

FOR
4-YEAR UNDERGRADUATE ENGINEERING
PROGRAM
IN
CSE (Cyber Security)
(B. TECH IN CSE (Cy. Security))
COURSE CODE AND DEFINITION

S. No. Category Code

1 Humanities and Social Sciences including Management courses HSMC 1
2 Basic Science courses BSC 2
Engineering Science courses including workshop, drawing, basics of
3 ESC 3
electrical/mechanical/computer etc.
4 Professional core courses PCC 4
5 Professional Elective courses relevant to chosen specialization/branch PEC 5
6 Open subjects – Electives from other technical and /or emerging subjects OE 6
7 Project work, seminar and internship in industry or elsewhere PSIT 7
8 Social Outreach Discipline & Extra-Curricular Activities SODECA 8
Mandatory Courses [Environmental Sciences, Induction Program, Indian
9 MC 9
Constitution, Essence of Indian Knowledge Tradition]
Teaching & Examination Scheme
B. Tech.: CSE (Cy. Security)
2nd Year – III Semester

THEORY
Contact
Course Marks Total
SN Category hrs. /week
Credits
Code Title L T P IA ETE Total
1 BSC 3CYS2-01 Integral Transform and Optimization 3 1 0 60 140 200 4

2 HSMC 3CYS1-02 Technical Communication 2 0 0 30 70 100 2

3 ESC 3CYS3-03 Digital Electronics 3 0 0 45 105 150 3

4 PCC 3CYS4-04 Data Structures and Algorithms 3 0 0 45 105 150 3
5 PCC 3CYS4-05 Object Oriented Programming in Java 3 0 0 45 105 150 3
6 PCC 3CYS4-06 Discrete Mathematical Structures 3 0 0 45 105 150 3
Sub Total 17 1 0 270 630 900 18

PRACTICAL & SESSIONAL

Data Structures and
7 PCC 3CYS4-21 0 0 3 45 30 75 1.5
Algorithms Lab
Object Oriented
8 PCC 3CYS4-22 0 0 3 45 30 75 1.5
Programming in Java Lab
9 PCC 3CYS4-23 Digital Electronics Lab 0 0 2 30 20 50 1
10 PSIT 3CYS7-30 Industrial Training 0 0 2 0 0 50 1
Social outreach Discipline &
11 SODECA 3CYS8-00 0 0 0 0 0 25 0.5
Extra-Curricular Activities
Sub Total 0 0 10 120 80 275 5.5
TOTAL OF III SEMESTER 17 1 10 390 710 1175 23.5

Non-Credit Mandatory course for Honors Degree

1 MC 3CYS9-MC1 Business Studies 2 0 0 100 0 100 0

L: Lecture, T: Tutorial, P: Practical, Cr: Credits

ETE: End Term Exam, IA: Internal Assessment
Teaching & Examination Scheme
B. Tech.: CSE (Cy. Security)
2nd Year – IV Semester
THEORY
Contact
Course Marks Total
SN Category hrs /week
Credits
Code Title L T P IA ETE Total
1 BSC 4CYS2-01 Statistics & Probability Theory 3 1 0 60 140 200 4
Managerial Economics & Financial
2 HSMC 4CYS1-02 2 0 0 30 70 100 2
Accounting
3 ESC 4CYS3-03 Computer Organization & Architecture 3 0 0 45 105 150 3
4 PCC 4CYS4-04 Information System Security 3 0 0 45 105 150 3
5 PCC 4CYS4-05 Analysis of Algorithms 3 0 0 45 105 150 3
6 PCC 4CYS4-06 Database Management Systems 3 0 0 45 105 150 3
Sub Total 17 1 0 270 630 900 18

PRACTICAL & SESSIONAL

Computer Organization & Architecture
7 PCC 4CYS4-21 0 0 3 45 30 75 1.5
Lab
8 PCC 4CYS4-22 Analysis of Algorithm Lab 0 0 2 30 20 50 1
9 PCC 4CYS4-23 Information System Security Lab 0 0 3 45 30 75 1.5
10 PCC 4CYS4-24 Database Management Systems Lab 0 0 2 30 20 50 1
Social Outreach, Discipline & Extra
11 SODECA 4CYS8-00 0 0 0 0 0 25 0.5
Curricular Activities
Sub Total 0 0 10 150 100 275 5.5
TOTAL OF IV SEMESTER 17 1 10 420 730 1175 23.5

Non-Credit Mandatory course for Honors degree

1 MC 4CYS9-MC1 Elements of Literature 2 0 0 100 0 100 0

L: Lecture, T: Tutorial, P: Practical, Cr: Credits

ETE: End Term Exam, IA: Internal Assessment
Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS2-01: Integral Transform and Optimization

Credit: 4 Max. Marks: 200 (IA: 60, ETE: 140)

3L+1T+0P End Term Exam: 3 Hours

Unit CONTENTS Hours

0 0 Introduction: Objective, Scope and Outcome of the course 1
Integral Transform:
Laplace Transform: Definition and existence of Laplace transform, Properties of
Laplace Transform, Unit Step function, Heaviside function, Inverse Laplace
1 8
transform, convolution theorem. Applications to the solution of ordinary
differential equations having constant coefficients.

Fourier Transform: Definition & Properties. Fourier Complex, Fourier Sine and
Cosine transform, properties and formulae, inverse Fourier transforms,
2 7
Convolution theorem.

Optimization- Historical development, Engineering Applications of

Optimization, Formulation of Design Problems as a Mathematical Programming
3 5
Problems, Classification of Optimization Problems.

Classical Optimization using Differential Calculus: Multivariable

Optimization with & without Constraints, Hessian matrix method, Lagrange’s
4 6
method of multipliers, Kuhn Tucker conditions.

Linear Programming: Formulation, Graphical method, Simplex method, Big M-

Method and Duality in Linear Programming. Application of Linear Programming:
5 9
Transportation and Assignment Problems.

TOTAL 36

Pre-requisites: Integral, Differentiation, Maxima and Minima

SUGGESTED TEXT BOOKS:

1. Grewal B.S., “Higher Engineering Mathematics”, Khanna Publishers, New Delhi, 43rd
Edition, 2014.
1. 2. Alan Jeffrey, “Advanced Engineering Mathematics”, University of Newcastle, Academic
Press, Sydney, 2002.
SUGGESTED REFERENCE BOOKS
1. Bird, Jeffrey, “Higher Engg. Mathematics”, ELSEVIER
2. B.V. Ramana, “Higher Engg. Mathematics”, Tata McGraw Hill
3. Irvin Kreyszig, “Advanced Engineering Mathematics”, Wiley (2010)
CO1 Students will be able to solve ordinary differential equation having constant coefficients by using
Laplace transform and Inverse Laplace transform with their simple properties.
CO2 Students will be able to find Fourier Transform, Complex form of Fourier Transform and also
learn about Fourier Sine and Cosine transform.
CO3 Able to understand the optimization techniques and applying it to formulate various design
problems.
CO4 To understand various types of Optimization with the different constraints and use these
concepts in various engineering problems.
CO5 To study about linear programming problems and its applications in engineering. Also able
to understand about Transportation and Assignment problems.
Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS1-02: Technical Communication

Credit: 2 Max. Marks: 100 (IA: 30, ETE: 70)

2L+T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 0 Scope, objectives and outcomes 1
Introduction to Technical Communication- Definition of technical
communication, Aspects of technical communication, forms of technical
1 communication, importance of technical communication, technical 4
communication skills (Listening, speaking, writing, reading writing), linguistic
ability, difference between communication and technical communication.
Comprehension of Technical Materials/Texts and Information Design &
development- Reading of technical texts, Reading and Comprehending
instructions and technical manuals, Interpreting and summarizing technical
2 6
texts, Note-making. Introduction of different kinds of technical documents,
Information collection, factors affecting information and document design,
Strategies for organization.
Grammar- Technical writing process, forms of technical discourse, Writing,
drafts and revising, Basics of grammar ( parts of speech, relative pronouns,
3 4
narration, voice) common error in writing and speaking, Study of
advanced grammar (syntax, type of sentences)..
Technical Writing- Planning, drafting and writing Official Notes, Letters,
4 E-mail, Resume, Job Application, Minutes of Meetings. 4
Advanced Technical Writing- Technical Reports, types of technical
reports, Characteristics and formats and structure of technical reports.
5 Technical Project Proposals, types of technical proposals, Characteristics and 7
formats and structure of technical proposals. Technical Articles, types of
technical articles, Writing strategies, structure and formats of technical articles
TOTAL 26
Pre-requisites: Basic knowledge of English Grammar and Informal manner of writing

TEXT BOOKS:
1. Technical communication by Meenakshi Raman
REFERENCES BOOKS:
1. Techniques for technical communicators by Barnum Carol M. And Saul Carliner, Macmillan
publishing company.
2. Technical writing and professional communication by Thomas N. Huckin.
CO1 Students will enable to improve the language proficiency
CO2 Students will be able to develop communication skills for formal and informal situations.
CO3 Students will be efficient in professional writing skills.
CO4 Students will study other engineering subjects with more efficiency in English.
CO5 They would develop writing skills in career such as business letter writing, technical report
etc.
Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS3-03: Digital Electronics

Credit: 3 Max. Marks: 150 (IA: 45, ETE: 105)

3L+0T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 0 Scope, objectives and outcomes 1
Fundamental concepts of Number system, codes and logic gates:
Basic number system representation, Sign & magnitude, representation, Fixed point
representation, Weighted Codes, Binary codes, Code Conversion, Error Correction/ 7
1
Detection Codes, BCD codes, r’s compliment form arithmetic in different codes &
their inter conversion.
Logic Gates and Minimization Techniques:
Features of logic algebra, postulates of Boolean algebra. Theorems of Boolean
8
algebra. Principle of Duality, Boolean expression Minimization, SOP & POS forms,
2
Canonical forms, Karnaugh maps up to 6 variables, Tabulation Method.
Combinational Logic Circuits Design:
Half and Full Adders, Subtractors, Serial and Parallel Adders, BCD Adder,
8
3 Magnitude Comparators, Multiplexers, Encoder, Decoder, Driver & Multiplexed
Display, Logic Implementation using combination blocks.
Sequential Circuits:
Latches, Flip-flops - SR, JK, D, T, and Master-Slave Characteristic table and
equation, counters and their design, Synchronous counters– Synchronous Up/Down 7
4
counters – Programmable counters – State table and state transition diagram,
sequential circuits design methodology. Registers –shift registers.
Logic Families:
TTL NAND gate, Specifications, Noise margin, Propagation delay, fan-in, fan- 5
5
out, Tristate TTL, ECL, CMOS families and their electrical behaviour
TOTAL 35
Pre-requisites: Basic Electronics

TEXT BOOKS:

1.M. Morris Mano: Digital Design, Third Edition, Prentice Hall

2.S.Salivahanan and S. Arivazhagan: Digital Circuits and Design, Fifth Edition, OXFORD UNIVERSITY PRESS

REFERENCES BOOKS:
1. R. J. Tocci: Digital Systems: Principles and Applications, Fourth Edition, Prentice Hall
2. R. P. Jain: Modern Digital Electronics, Third Edition, TMH
3. Taub and Schilling: Digital Integrated Electronics, McGraw HILL
CO1 Students will learn to represent a value in various number systems with their algebra.

CO2 Students will learn to design a logic or a circuit with optimization of gates.

CO3 Students will realize applications of digital electronics in today's life.

CO4 Students will be able to identify basic requirements for a design application and propose a cost-
effective solution.

CO5 Students will understand the properties of various electronic components.

Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS4-04: Data Structures and Algorithms

Credit: 3 Max. Marks: 150 (IA: 45, ETE: 105)

3L+0T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours

0 Scope, objectives and outcomes 1

Introduction: Basic Terminology, Elementary Data Organization, Built in

Data Types in C. Algorithm, Efficiency of an Algorithm, Time and Space 7
1 Complexity, Asymptotic notations: Big Oh, Big Theta and Big Omega, Time-
Space trade-off. Arrays: Definition, Single and Multidimensional Arrays, Row
Major Order, and Column Major Order, Sparse Matrices and their
representations.
Linked lists: Singly Linked Lists, Doubly Linked List, Circularly Linked List,
Operations on a Linked List. Insertion, Deletion, Traversal

2 Stacks: Array and Linked Implementation of Stack , Push & Pop Operation, 7
Application of stack: Prefix and Postfix Expressions, Evaluation of postfix
expression, Queues: Array and Linked Implementation of Queue ,Operations
on Queue: Create, Add, Delete, Circular queues and Priority Queue

Searching & Sorting : Concept of Searching, Sequential search, Binary

3 Search. Concept of Hashing & Collision resolution Techniques used in 7
Hashing. Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort

Trees: Basic terminology used with Tree, Binary Trees, Binary Tree
4 Representation: Representation, Binary Search Tree, Operation of Insertion, 7
Deletion, Searching & Modification of data in Binary Search, Tree Traversal
algorithms: In order, Preorder and Post order, Constructing Binary Tree,
Threaded Binary trees. Concept & Basic Operations for AVL Tree, B Tree,
B+ Tree
Graphs: Terminology used with Graph, Data Structure for Graph
5 Representations: Adjacency Matrices, Adjacency List, Adjacency. Graph 7
Traversal: Depth First Search and Breadth First Search, Minimum Cost
Spanning Trees: Prims and Kruskal algorithm, Shortest Path algorithm:
Warshal Algorithm and Dijikstra Algorithm.

TOTAL 36

Pre-requisites: C-language
TEXT BOOKS:
1. Seymour Lipschutz, Data Structures, Schaum's Outlines Series, Tata McGraw-Hill
2. Ellis Horowitz, S. Sahni, Freed, “Fundamentals of Data Structures in C”, 2nd edition, 2015.
REFERENCES BOOKS:
1. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to Algorithms, Third
edition, MIT Press,
2. Y. Langsam, M. J. Augenstein and A. M. Tanenbaum, ―Data Structures using C, Pearson
Education Asia,
3. Vishal Goyal, Lalit Goyal and Pawan Kumar, Simplified approach to Data Structures, Shroff
publications and Distributors.

CO1 Understanding the fundamental analysis and time complexity for a given problem.
CO2 Articulate linear data structures and legal operations permitted on them.
CO3 Understanding Tree Concept, different types of tree ,operations, and Traversal
CO4 Understanding graph algorithms, operations, and applications
CO5 Applying a suitable algorithm for searching, sorting & Understanding of importance of
hashing.
Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS4-05: Object Oriented Programming in JAVA

Credit:3 Max. Marks: 150 (IA: 45, ETE: 105)

3L+0T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 0 Scope, objectives and outcomes 1
Java Basics and Anatomy:
1 Java Basics: OOP‟s principles, Java History, advantages, Data types,
operators, expressions, control statements, methods and recursion, sample
programs. 7
Java Anatomy: Java Objects and References, Constructors, this keyword,
Arrays (single and multi-dimensional), String and its immutability, Buffer &
Builder Classes, String Tokenizer
Inheritance (Extending and Implementing): Introduction, Derived Classes,
Advantages and Types of Inheritance, Member Accessibility. Overriding,
2 Super, Abstract classes and Methods, Final Classes and Final Methods,
7
Polymorphism, Dynamic Binding.
Interfaces: Differences between classes and interfaces, defining an interface,
implementing interface, variables in interface, extending interfaces
Packaging and Java API Packages: Defining, Creating and Accessing a
3 Package, importing packages, access controls (public, protected, default, and 7
private). Wrapper Classes and Auto Boxing, I/O classes
Exception handling and Multithreading: Concepts of exception handling,
4 benefits of exception handling, usage of try, catch, throw, throws and finally,
7
built in exceptions, creating own exception.
Threads: Thread life cycle, creating threads, synchronizing threads
Graphical User Interaction Graphical User Interaction: Swings-
5 Introduction, limitations of AWT, components, containers, exploring swing-
Frame and Jcomponent , Icons and Labels, text fields. 7
Layout managers– border, grid Event Handling: Events, Event Delegation
Model, Event classes, Listeners, handling mouse and keyboard events.
TOTAL 36
Pre-requisites: Object Oriented Programming Concepts

TEXT BOOKS:
1. Java Fundamentals, A Comprehensive Introduction, Herbert Schildt, McGraw-Hill
2. Programming with JAVA , E Balagurusamy, McGrawHill

REFERENCES BOOKS:
1. Introduction to Java Programming 7/e, Brief version, Y.Daniel Liang, Pearson
2. Java: The complete reference, 7/e, Herbert Scheldt, TMH.
3. Java How to Program, 7/E: Paul Deitel, Deitel & Associates, Inc

CO1 Students will understand the key features of the Java programming language
CO2 Students will apply essential features of object-oriented programming concepts like dynamic
polymorphism, abstract (virtual) methods using Java
CO3 Students will apply the principles behind good object-oriented design
CO4 Students will apply the principles of multithreading and exception handling.
CO5 Students will design and develop GUI based applications in a group using modern tools and
frameworks
Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS4-06: Discrete Mathematical Structures

Credit: 3 Max. Marks: 150 (IA: 45, ETE: 105)

3L+0T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 0 Scope, objectives and outcomes 1
Set Theory: Definition of sets, countable and uncountable sets, Set operations,
Partition of set, Cardinality (Inclusion-Exclusion & Addition Principles) Venn
Diagrams, proofs of some general identities on sets.
Relation: Definition, types of relation, composition of relations, Pictorial
representation of relation, Equivalence relation, Partial ordering relation, Job-
Scheduling problem. 7
1
Function: Definition, type of functions, one to one, into and onto function,
inverse function, composition of functions, recursively defined functions,
pigeonhole principle. Theorem proving Techniques: Mathematical induction,
Proof by contradiction. Composition of Functions. The Pigeonhole and
Generalized Pigeonhole Principles.
Propositional Logic: Proposition, First order logic, Basic logical operation,
truth tables, tautologies, Contradictions, Algebra of Proposition, logical
2 implications, logical equivalence, predicates, Normal Forms, Universal and 5
existential quantifiers. 2 way predicate logic.

Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram
of partially, ordered set, isomorphic ordered set, well ordered set, properties of
Lattices, bounded and complemented lattices.
Combinatorics: Introduction, Permutation and combination, Binomial
3 Theorem, Multimodal Coefficients, Recurrence Relation and Generating 9
Function: Introduction to Recurrence Relation and Recursive algorithms, linear
recurrence relations with constant coefficients, Homogeneous solutions,
Particular solutions, Total solutions, Generating functions, Solution by method
of generating functions.
Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid,
Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets,
4 factor group, Permutation groups, Normal subgroup, Homomorphism and 7
isomorphism of Groups, example and standard results, Rings and Fields:
definition and standard results.
Graph Theory: Introduction and basic terminology of graphs, Planer graphs,
Multi graphs and weighted graphs, Isomorphic graphs, Paths, Cycles and
5 connectivity, Shortest path in weighted graph, Introduction to Eulerian paths 7
and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic number,
Isomorphism and Homomorphism of graphs, matching, vertex/edge covering.
TOTAL 36
Pre-requisites: Elementary Mathematics

TEXT BOOKS:
1. Introductory Discrete Mathematics – V. K. Balakrishnan, Dover Publications
2. Elements of Discrete Mathematics – Chung Laung Liu, McGraw Hill

REFERENCES BOOKS:
1. Discrete Mathematics and its Applications - Kenneth H. Rosen, McGraw Hill
2. Discrete Mathematics – An Open Introduction, Oscar Levin, 3rd Edition
3. Discrete Mathematics: A Unified Approach – Stephen A. Wiitala, McGraw Hill

CO1 Introduction to the concepts of sets, relations, functions and fundamentals principle of
counting.
CO2 To develop basic understanding and representation of logics.
CO3 To represent sets in form of posets, Hasse diagrams, lattices and introduction to generating
functions.
CO4 To develop an understanding of groups, rings and fields in algebraic structures.
CO5 Introduction to concept of graphs and basic terminologies used in graph theory.
Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS4-21: Data Structures and Algorithms Lab

Credit: 1.5 Max. Marks: 75 (IA: 45, ETE: 30)

0L+0T+3P End Term Exam: 3 Hours
Sr. No. Experiments
Write a program for implementing the following searching techniques.
1 a. Linear search
b. Binary search
Write a program for implementing the following sorting techniques to arrange a
list of integers in ascending order.
2 a. Bubble sort
b. Insertion sort
c. Selection sort
3 Write a program to Design and implement Stack and its operations
Write a program to Design and implement Queue and its operations.
4
5 Write a program which convert infix expression into postfix expression.
Write a program for the following operations on Single Linked List.
6
(i) Creation (ii) insertion (iii) deletion (iv) traversal
Write a program for the following operations on Circular Linked List. (i)
7
Creation (ii) insertion (iii) deletion (iv) traversal
Write a program for the following: Uses functions to perform the following
8 operations on Double Linked List. (i) Creation (ii) insertion (iii) deletion (iv)
traversal in both ways.
Write a program to implement the following graph traversal algorithms:
9 a. Depth first search.
b. Breadth first search.
Write a program to perform the following:
a. Create a binary search tree.
10
b. Traverse the above binary search tree recursively in pre-order, post-order and in-
order.
Tools/ software/ language: Python/ C Programming Language
Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS4-22 Object Oriented Programming in Java Lab

Credit: 1.5 Max. Marks: 75 (IA: 45, ETE: 30)

0L+0T+3P End Term Exam: 2 Hours
S.No. List of Experiments

1. WAP in Java to show implementation of classes.

2. WAP in Java to show implementation of inheritance.

3. WAP in Java to Implement Polymorphism (Method Overloading and Overriding)

4. WAP in Java to show Implementation of packages and interfaces.

5. WAP in Java to show Implementation of threads.

6. WAP in Java Using Exception Handling mechanisms.

7. WAP in Java to show Implementation of Applets.

8. WAP in Java to show Implementation of mouse events, and keyboard events.

9. WAP in Java to show Implementing basic file reading and writing methods.

10. WAP in Java to accomplish basic networking features.

11. WAP in Java to show Connecting to Database using JDBC.

12. Project work: A desktop-based application project should be designed and implemented in java.

Tools/ software/ language: JAVA

Suggested Readings/Books

1. Herbert Schildt, The Complete Reference Java2, McGraw-Hill.

2. Deitel and Deitel, Java: How to Program, 6th Edition, Pearson Education.

3. James Edward Keogh, Jim Keogh, J2EE: The complete Reference, Mc Graw Hill
Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS4-23: Digital Electronics Lab

Credit: 1 Max. Marks: 50 (IA: 30, ETE: 20)

0L+0T+2P End Term Exam: 2 Hours
Sr. No. Experiments
Introduction to Digital Electronics Lab- Nomenclature of Digital ICs, Specifications,
1
Concept of Vcc and Ground.
2 Verify the truth tables of basic logic gates: AND, OR, NOT, NAND, NOR and Ex-OR.
3 Realize OR, AND, NOR, Ex-OR, Ex-NOR using Universal gates.
To realize an SOP and POS expression.
4
5 To verify the truth table of Half adder / Half Subtractor using universal gate.

6 To verify the truth table of Full adder / Full Subtractor.

7 Design 2-bit binary adder, subtractor and adder-subtractor circuit.
To verify the truth table of 2-to-1 Multiplexer and 1-to-2 Demultiplexer. Realize the
8 multiplexer using basic gates only.
9 Study of 4 x 1multiplexer and 1x 4 Demultiplexer circuit and verify the truth table.
Study of seven segment led display, perform an experiment to realize 0-9 on seven
10
segment display.
To realize and verify the truth table of R-S flip flops with and without clock signal using
11
basic logic gates.
Tools/ software/ language: Hardware kits
Jodhpur Institute of Engineering & Technology
Syllabus
III - Semester
Branch: CSE (Cy. Security)
3CYS9-MC1: Business Studies

Credit: 0 Max. Marks: 100

2L+0T+0P 2 Mid Term Exam: 1.5 Hours each

UNIT I : NATURE AND PURPOSE OF BUSINESS

Content After going through this unit, the student/learner would be
able to:
Business- Meaning and ● Understand the meaning of business with special reference
characteristics to economic and non- economic activities.
● Discuss the characteristics of business.
Objectives of Business. ● Appreciate the economic and social objectives of business.
● Examine the role of profit/wealth in business.
Classification of Business ● Understand the broad categories of business activities-
Activities- Industry and Industry and commerce.
Commerce.
Business Risk- Concept. ● Understand the concept of business risk.
● Examine the nature and causes of business risk.
Case Study ● Develop the higher order thinking skills.

UNIT II: FORMS OF BUSINESS ORGANISATION

Content After going through this unit, the student/learner would be
able to:
Sole proprietorship- ● Identify and explain the concept, merits and limitations of
Concept, merits and Sole Proprietorship.
limitations.
Partnership- Concept, types, ● Identify and understand the concept, merits and
merits and limitations of limitations of a partnership firm.
partnership, registration of a ● Understand the types of partnership.
partnership firm, partnership ● State the need for registration of a partnership firm.
deed. Types of partners.

Hindu Undivided Family ● Understand the concept of Hindu Undivided Family

Business.
Cooperative Societies- ● Identify and understand the concept, merits and
Concept, merits and limitations of cooperative societies.
limitations.
Joint stock company- ● Identify and understand the concept, merits and
Concept, merits and limitations of private and public limited companies.
limitations. ● Distinguish between a private and public company.
Types- Private limited
company and Public limited
company.
Case Study ● Develop the higher order thinking skills.

UNIT III: EMERGING MODES OF BUSINESS

Content After going through this unit, the student/learner would be
able to:
E-Business- Concept, scope and ● Understand the concept of e-business.
benefits.
● Distinguish e-business from traditional business.

Business Process Outsourcing ● Understand the concept of outsourcing.

(BPO)- Concept, need and ● Understand the need and scope of outsourcing.
scope.
Knowledge Process Outsourcing ● Understand the concept of Knowledge Process Outsourcing.
(KPO)- Meaning and features. ● Distinguish between Business process outsourcing
and knowledge process outsourcing.
Case Study ● Develop the higher order thinking skills.

UNIT IV: SOCIAL RESPONSIBILITY OF BUSINESS

Content After going through this unit, the student/learner would be

able to:
Concept of Social ● Understand the concept of social responsibility.
Responsibility. ● Identify the social responsibility towards different interest
groups.
Business and Environment ● Appreciate the role of business in environment protection.
Protection.
Business Ethics- Concept and ● Understand the concept and elements of business ethics.
elements.
Case Study ● Develop the higher order thinking skills.

UNIT V: BUSINESS FINANCE

Content After going through this unit, the student/learner would be
able to:
Business Finance- Meaning, ● Understand the meaning, nature and importance of business
Nature and Significance. finance.
Sources of Finance- Owners’ ● Understand the meaning of owners’ fund and classify the
funds various sources of owners’ funds.
Business Ethics- Concept and ● Understand the concept of borrowed funds.
elements. ● Distinguish between owners’ funds and borrowed
funds.
Jodhpur Institute of Engineering & Technology
Syllabus
IV - Semester
Branch: CSE (Cy. Security)
4CYS2-01: Statistics and Probability Theory
Credit: 4 Max. Marks: 200 (IA: 60, ETE: 140)
3L+1T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 Introduction: Objective, Scope and Outcome of the course 1
Probability: Introduction- Sample space, events, algebra of events, Dependent and
1 Independent events, Addition & multiplication rules, Conditional probability, total 7
probability & Baye's theorem.
Random variable: Introduction to Discrete and Continuous random variables,
Probability distribution function, Mathematical Expectations: Moments, Moment
2 7
Generating Functions, Mean and variance.

Probability distributions- Bernoulli's trials. Binomial distribution, Poisson

Distribution, Normal Distribution. Karl Pearson’s correlation coefficient, Spearman's
3 Rank correlation coefficient. Lines of Regression, Angle between lines of regression.
9

Applied Statistics: Introduction to statistics and data analysis- Mean, mode,

median, variance and standard deviation. Testing of hypothesis–Introduction-
4 Types of errors, critical region, procedure of testing hypothesis- Large sample 6
tests- Z test for Single Proportion, Difference of Proportion, mean and
difference of means.
Small sample tests- Students t-test, Paired t-test, F-test, Chi-square test- goodness of
fit -independence of attributes- Design of Experiments - Analysis of variance – one-
5 way classification.
6

TOTAL 36
Pre-requisites: Elementary knowledge of Probability and Statistics

TEXT BOOKS:
1. Gupta S.C. & Kapoor V.K., “Fundamentals of Mathematical Statistics”- S. Chand & Sons.
2. Grewal B.S., “Higher Engineering Mathematics”, Khanna Publishers, New Delhi, 43 rd
Edition, 2014.
REFERENCES BOOKS:
1. Soong T. T., “Fundamentals of Probability and Statistics for Engineers”- John Wiley &
Sons.
2. Bubu Ram, “Higher Engineering Mathematics” Pearson Publication
3. Schaum's series-“Statistics and Probability Theory”
CO1 Students would be able to understand the fundamentals of probability theory and to
illustrate these concepts with engineering applications.
CO2 Able to develop and distinguish between discrete and continuous random variables and
compute their mean, variance and standard deviations.
CO3 Able to learn various standard probability distributions and able to perform a regression
analysis, compute and interpret the coefficient of correlation.
CO4 Able to understand the basic concepts of Statistics and use these concepts in various
problems of different branches of Engineering.
CO5 Able to learn various Statistical tests techniques and applying it on large and small random
samples to analyse the mathematical & statistical problems.
Jodhpur Institute of Engineering & Technology
Syllabus
IV - Semester
Branch: CSE (Cy. Security)
4CYS1-02: MANAGERIAL ECONOMICS AND FINANCIAL ACCOUNTING

Credit:2 Max. Marks: 100 (IA: 30, ETE: 70)

2L+0T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 0 Scope, objectives and outcomes 1
Basic economic concepts- Meaning, nature and scope of economics.
Introduction of micro and macro economics.

Demand and Supply analysis- Demand-types of demand, determinants of 5

1
demand, demand function, elasticity of demand, Supply-determinants of supply,
supply function, elasticity of supply.

Production and Cost analysis- Theory of production- production function,

law of variable proportions, laws of returns to scale, production optimization,
least cost combination of inputs, iso-quant and iso-cost curve. 6
2
Cost concepts-Meaning and types of cost, cost function, cost curves, cost and
output decisions.

Market structure and pricing theory- Perfect competition, Monopoly,

3 5
Monopolistic competition, Oligopoly. Forms of Business organizations.

Financial statement analysis- Trading Account, profit and loss statement and
4 4
related concepts, Balance sheet and related concepts.

Ratio analysis- Meaning and importance, Liquidity and Profitability Ratio.

4
5
Capital budgeting- Meaning and Techniques.

TOTAL 24
Pre-requisites: General Awareness of External Environment and Economics

TEXT BOOKS:
1. Varshney & Maheswari: Managerial Economics, Sultan Chand, 2009.
2. M. Kasi Reddy & Saraswathi, Managerial Economics and Financial Analysis, PHI New Delhi,
2012.
3. S.A. Siddiqui & A.S. Siddiqui, Managerial Economics and Financial Analysis, New Age
international Publishers, Hyderabad 2013
REFERENCES BOOKS:
1. Prof. D.N.Dwivedi: Managerial Economics, Vikas, 2012
2. Lipsey & Chrystel, Economics, Oxford University Press, 2012.
3. Narayanaswamy: Financial Accounting - A Managerial Perspective, Pearson, 2012.
4. Prof. M.D.Agarwal, Prof. Som Deo, Business Economics.

CO1 At the end of the semester, Students will be able to understand the basic concepts of micro,
macro economics and consumer & Producer behaviour.
CO2 At the end of the semester, students will be able to develop the capability to analyze the
relation between Production, cost and revenue analysis.
CO3 It is expected that by the end of the semester, the students will be able Understand the
concepts of price and output determination under different market structures.
CO4 At the end of the semester, students will be able to understand the concept of accounting and
final accounts.
CO5 It is expected that by the end of the semester, the students will be able understand the
concepts of capital budgeting and ratio analysis.
Jodhpur Institute of Engineering & Technology
Syllabus
IV - Semester
Branch: CSE (Cy. Security)
4CYS3-03: Computer Organisation & Architecture

Credit:3 Max. Marks: 150 (IA: 45, ETE: 105)

3L+0T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 0 Scope, objectives and outcomes 1
Digital Computers:
Definition of Computer Organization, Computer Design and Computer
Architecture. Register Transfer language, Register Transfer, Bus and memory
transfers, Arithmetic ,logic and shift micro operations, Arithmetic logic shift
1 7
unit.
Instruction codes, Computer Registers Computer instructions, Timing and
Control, Instruction cycle, Memory Reference Instructions, Input – Output and
Interrupt.
Micro programmed Control:
Control memory, Address sequencing, micro program example, design of
2 7
control unit. General Register Organization, Instruction Formats, Addressing
modes, Data Transfer and Manipulation, Program Control.
Data Representation:
Data types, Complements, Fixed Point Representation, Floating Point
3 Representation. Addition and subtraction, multiplication Algorithms, Division 7
Algorithms, Floating – point Arithmetic operations. Decimal Arithmetic unit,
Decimal Arithmetic operations.
Memory & Input-Output Organization: Memory hierarchy, Memory Chip
Organization, Cache memory, Virtual memory. Parallel Bus Architectures,
4 Internal Communication Methodologies, Serial Bus Architectures, Mass 7
storage .

Reduced Instruction Set Computer:

CISC Characteristics, RISC Characteristics.
5 7
Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC
Pipeline, Vector Processing, Array Processor.
TOTAL 36
Pre-requisites: Digital Logic and Design

TEXT BOOKS:

1. Computer System Architecture – M. Moris Mano, Third Edition, Pearson/PHI.

2. Computer Fundamentals: Architecture and Organization- B.Ram/Paperback

REFERENCES BOOKS:
1. Computer Organization – Car Hamacher, Zvonks Vranesic, Safea Zaky, Vth Edition, McGraw Hill
2. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI.
3. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition, PHI/Pearson.
CO1 Demonstrate an understanding of the design of the functional units of a digital computer
system.

CO2 Understand the basics of instructions sets and their impact on processor design.

CO3 Recognize and manipulate representations of numbers stored in digital computers.

CO4 Evaluate cost performance and design trade-offs in designing and constructing a computer
processor including memory.

CO5 Design a pipeline for consistent execution of instructions with minimum hazards.
Jodhpur Institute of Engineering &Technology
SYLLABUS
IV -Semester
Branch: CSE (Cy. Security)
4CYS4-04: Information System Security

Credit: 3 Max. Marks: 150 (IA: 45, ETE:105)

3L+0T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 0 Scope, objectives and outcomes 1
Introduction to Information Security: Attacks, Vulnerability, Security Goals,
1 Security Services and mechanisms 4

Conventional Cryptographic Techniques: Conventional substitution and

2 transposition ciphers, Symmetric and Asymmetric Ciphers, One-time Pad, 6
Block cipher and Stream Cipher, Steganography
Symmetric and Asymmetric Cryptographic Techniques: Symmetric
Encryption Algorithms (DES, AES, RC) Asymmetric Encryption Algorithm
(RSA)
3 10
Authentication and Digital Signatures: Digital Signatures, Use of
Cryptography for authentication, Secure Hash function, Key management –
Kerberos
Program Security: Nonmalicious Program errors – Buffer overflow,
4 Incomplete mediation, Time-of-check to Time-of-use Errors, Viruses, 8
Trapdoors, Salami attack, Man-in-the-middle attacks, Covert channels
Security in Networks: Threats in networks, Network Security Controls –
Architecture, Encryption, Content Integrity, Strong Authentication, Access
5 Controls, Wireless Security, Honeypots, Traffic flow security, Firewalls – 8
Design and Types of Firewalls, Personal Firewalls, IDS, Email Security – PGP,
S/MIME
TOTAL 36
Pre-requisites:

TEXT BOOKS:
1. Security in Computing, Fourth Edition, by Charles P. Pfleeger, Pearson Education
2. Cryptography And Network Security Principles And Practice, Fourth or Fifth Edition, William
Stallings, Pearson
REFERENCES BOOKS:
1. Modern Cryptography: Theory and Practice, by Wenbo Mao, Prentice Hall.
2. Network Security Essentials: Applications and Standards, by William Stallings. Prentice Hall
CO1 Understand and explain the risks faced by computer systems and networks.
CO2 Identify and analyze security problems in computer systems and networks.
CO3 Understand the working of security mechanisms.
CO4 Develop security mechanisms to protect computer systems and networks.
CO5 Use cryptography algorithms and protocols to achieve computer security.
Jodhpur Institute of Engineering & Technology
SYLLABUS
IV - Semester
Branch: CSE (Cy. Security)
4CSDS4-05: Analysis of Algorithm

Credit: 3 Max. Marks: 150 (IA: 45, ETE: 105)

3L+0T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 Introduction: Objective, scope and outcome of the course. 1
Foundation of Algorithm Analysis: Algorithm and its properties, efficient
algorithm, Time and Space Complexity, Asymptotic Notations: Big-O, Big-Ω
and Big-Ө Notations their Geometrical Interpretation and Examples.
Recurrences: Recursive Algorithms and Recurrence Relations, Solving
1 Recurrences (Recursion Tree Method, Substitution Method, Application of 7
Masters Theorem) and calculating complexity.
Divide and Conquer Method: Binary Search, Merge Sort, Quick sort and
Strassen's matrix multiplication algorithms.
Greedy Method: General Characteristics of greedy algorithms, Knapsack
Problem, Job Sequencing, and Minimal Spanning Trees.
2 Dynamic Programming: Matrix Chain Multiplication. Longest Common 7
Subsequence and 0/1 Knapsack Problem.
Branch and Bound: Traveling Salesman Problem and Lower Bound Theory.
Backtracking Algorithms and queens problem.
3 Pattern Matching Algorithms: Naïve and Rabin Karp string matching 7
algorithms, KMP Matcher and Boyer Moore Algorithms.
Assignment Problems: Formulation of Assignment and Quadratic Assignment
Problem.
4 Randomized Algorithms- Las Vegas algorithms, Monte Carlo algorithms, 7
Randomized algorithm for Min-Cut, Randomized algorithm for 2- SAT.
Problem Classes Np, Np-Hard and Np-Complete: Definitions of P, NP-Hard
and NP-Complete Problems. Decision Problems. Cook's Theorem.
5 7
Proving NP- Complete Problems - Satisfiability problem and Vertex Cover
Problem. Approximation Algorithms for Vertex Cover and Set Cover Problem.
TOTAL 36
Pre-requisites: DSA and Discrete Mathematics

TEXT BOOKS:
1. Introduction to Algorithms; Cormen, Leiserson, Rivest; Prentice Hall of India.
2. Fundamental of Computer algorithms; Horowitz and Sahani; Computer Science Press.
REFERENCES BOOKS:
1. Design and analysis of Algorithms; Aho A.V , J.D Ulman; AddisonWesley.
2. Fundamental of Algorithmic; Gilles Brassard, Paul Bratley; PHI
Understand the basic concepts of algorithms and analyse the performance of algorithms.
Describe the divide-and-conquer paradigm and explain when an algorithmic design
CO1 situation calls for it. Recite algorithms that employ this paradigm. Synthesize divide and-
conquer algorithms. Derive and solve recurrences describing the performance of divide-
and-conquer algorithms.
Describe the Greedy and Dynamic-programming paradigm. Explain when an algorithmic
CO2 design situation calls for it. Recite algorithms that employ these paradigms. Synthesize
these algorithms, and analyse them.
Able to find the optimal solution for combinatory, discrete, and general mathematical
CO3 optimization problems using Branch and Bound. Be familiar with String matching
algorithms and analyse the complexity of these algorithms.
To understand the methods of solving different assignment problems and the use of
assignment models in industry and business. An understanding of the major categories of
CO4
approaches to using randomness to solve problems, and the difference between Las Vegas
and Monte Carlo algorithms.
To understand the variations among tractable and intractable problems. To introduce P and
CO5
NP classes.
Jodhpur Institute of Engineering & Technology
SYLLABUS
IV - Semester
Branch: CSE (Cy. Security)
4CYS4-06 Database Management System

Credit: 3 Max. Marks: 150 (IA: 45, ETE: 105)

3L+0T+0P End Term Exam: 3 Hours
Unit CONTENTS Hours
0 0 Introduction: Objective, scope and outcome of the course. 1
Introduction to database systems: Overview and History of DBMS. File
System v/s DBMS. Advantage of DBMS Describing and Storing Data in a
DBMS. Queries in DBMS. Structure of a DBMS.
Entity Relationship model: Overview of Data Design Entities, Attributes and
1 Entity Sets, Relationship and Relationship Sets. Features of the ER Model- Key 7
Constraints, Participation Constraints, Weak Entities, Class Hierarchies,
Aggregation, Conceptual Data Base, and Design with ER Model- Entity v/s
Attribute, Entity vs Relationship Binary vs Ternary Relationship and
Aggregation v/s ternary Relationship Conceptual Design for a Large Enterprise.
Relationship Algebra and Calculus: Relationship Algebra Selection and
Projection, Set Operations, Renaming, Joints, Division, Relation Calculus,
Expressive Power of Algebra and Calculus. SQL queries programming and
2 Triggers: The Forms of a Basic SQL Query, Union, Intersection and Except, 7
Nested Queries, Correlated Nested Queries, Set-Comparison Operations,
Aggregate Operators, Null Values and Embedded SQL, Dynamic SQL, ODBC
and JDBC, Triggers and Active Databases.
Schema refinement and Normal forms: Introductions to Schema Refinement,
3 Functional Dependencies, Boyce-Codd Normal Forms, Third Normal Form, 7
Normalization Decomposition into BCNF Decomposition into 3-NF.
Transaction Processing: Introduction-Transaction State, Transaction
properties, Concurrent Executions. Need of Serializability, Conflict vs. View
4 7
Serializability, Testing for Serializability, Recoverable Schedules, Cascade less
Schedules.
Concurrency Control: Implementation of Concurrency: Lock-based protocols,
Timestamp based protocols, Validation-based protocols, Deadlock handling,
5 Database Failure and Recovery: Database Failures, Recovery Schemes: 7
Shadow Paging and Log-based Recovery, Recovery with Concurrent
transactions.
TOTAL 36
Pre-requisites: Pre-requisites: DSA and Discrete Mathematics

TEXT BOOKS:
1. H. F. Korth and Silberschatz: Database Systems Concepts, McGraw Hill
2. Almasri and S. B. Navathe: Fundamentals of DataBase Systems
REFERENCES BOOKS:
1. Hansen and Henson: DBM and Design, PHIA. Forouzan. Third Edition TMH.
2. Ramakrishnan: Database Management Systems
3. C. J. Date: Data Base Design, Addison Wesley

CO1 Describe DBMS architecture, physical and logical database designs, database models, entity-
relationship model.
CO2 Understand relational algebra, relational calculus importance and query writing
CO3 Apply Structured query language (SQL) for database definition, database manipulation, data
control.
CO4 Understanding of normalization theory and apply it to normalize databases.
CO5 Understand various transaction processing, concurrency control mechanisms and database
protection mechanisms.
Jodhpur Institute of Engineering & Technology
SYLLABUS
IV - Semester
Branch: CSE (Cy. Security)
4CYS4- 21: Computer Organisation & Architecture Lab

Credit: 1.5 Max. Marks: 75 (IA: 45, ETE: 30)

0L+0T+3P End Term Exam: 3 Hours
Sr.No. Experiments
1 To study arithmetic and logic unit and memory devices (RAM, ROM, HDD, FDD).

2 To design a 4-bit common bus using 4:1 mux to transfer data from register to bus.
Design a 2-bit combinational shifter circuit which implements the logical shift, circular
3 shift, arithmetic shift for both directions.
To design 2-bit arithmetic circuit which performs the following arithmetic
4 operations add, add with carry, subtract, subtract with borrow, increment and
decrement
5 To design 4-bit BCD Adder & Subtractor using IC 7483.

6 To design a 2-bit multiplication circuit.

7 Verify the function table of the arithmetic logic unit using IC 74181.
8 Implement Logic gates using NAND and NOR gates
Implement a C program to perform Multiplication of two binary numbers (signed)
9
using Booth’s Algorithms.
Implement a C program to perform division of two binary numbers (Unsigned) using
10
restoring division algorithm.
Tools/ software/ language: Xilinx Software/ C-Programming

TEXT BOOKS:
1. Computer System Architecture – M. Morris Mano, Third Edition, Pearson/PHI.
2. Computer Fundamentals: Architecture and Organization- B.Ram/Paperback
REFERENCES BOOKS:
1. Computer Organization – Car Hamacher, Zvonks Vranesic, Safea Zaky, Vth Edition, McGraw
Hill.
2. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI.
3. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition, PHI/Pearson.
Jodhpur Institute of Engineering & Technology
SYLLABUS
IV - Semester
Branch: CSE (Cy. Security)
4CYS4-22: Analysis of Algorithm Lab
Credit: 1 Max. Marks: 50 (IA: 30, ETE: 20)
0L+0T+2P End Term Exam: 3 Hours
S.No. Experiments
Sort a given set of elements using the Merge sort method and determine the time
required to sort the elements. Repeat the experiment for different values of n, the
1 number of elements in the list to be sorted and plot a graph of the time taken versus n.
The elements can be read from a file or can be generated using the random number
generator.
Sort a given set of elements using the Quick sort method and determine the time
required to sort the elements. Repeat the experiment for different values of n, the
2 number of elements in the list to be sorted and plot a graph of the time taken versus n.
The elements can be read from a file or can be generated using the random number
generator.
Search a given element using the Binary Search method and determine the time required
3 to search the element. Repeat the experiment for different values of n, and plot a graph
of the time taken versus n.
To implement and analysis 0/1 knapsack problem by finding optimal cost and quantity
4 in knapsack allotment using Dynamic Programming.
5 To implement and analysis of Algorithm to generate Matrix Chain Multiplication.
To implement and analysis Longest Common Subsequence using Dynamic
6 Programming.

Find Minimum Cost Spanning Tree (MST) of a given undirected graph using Prim’s
7
algorithm.
Find Minimum Cost Spanning Tree (MST) of a given undirected graph using
8
Kruskal’s algorithm.
9 To implement and analysis of N Queens problem using backtracking.
10 To implement and analysis of Rabin Karp String matching algorithm.
Tools/ software/ language: Java / C++

TEXT BOOKS:

1. Introduction to Algorithms; Cormen, Leiserson, Rivest; Prentice Hall of India.

2. Fundamental of Computer algorithms; Horowitz and Sahani; Computer Science Press.

REFERENCES BOOKS:
1. Design and analysis of Algorithms; Aho A.V , J.D Ulman; AddisonWesley.
2. Fundamental of Algorithmic; Gilles Brassard, Paul Bratley; PHI.
Jodhpur Institute of Engineering & Technology
SYLLABUS
IV - Semester
Branch: CSE (Cy. Security)
4CYS4-23: Information System Security Lab
Credit: 1.5 Max. Marks: 75 (IA: 45, ETE: 30)
0L+0T+3P End Term Exam: 3 Hours
S. No. Experiments
Implement the following SUBSTITUTION & TRANSPOSITION TECHNIQUES
1 concepts: a) Caesar Cipher b) Playfair Cipher c) Hill Cipher d) Vigenere Cipher e) Rail
fence – row & Column Transformation
2 Implement the following algorithms a) DES and RSA Algorithm

3 Implement the Diffie-Hellman key-exchange algorithm

4 Implement the MD5 and SHA-1 hashing algorithms

Study and perform steps to ensure Security of any one web browser (Mozilla
5
Firefox/Google Chrome)
Study of different types of vulnerabilities for hacking websites / Web Applications.
6
7 Implement the Signature Scheme - Digital Signature Standard
Study of the features of Firewall in providing network security and to set Firewall
8
Security in windows.
9 Set Up a honey pot and monitor the honeypot on network (K F Sensor)
10 Installation of rootkits and study about the variety of options
Tools/ software/ language: Python

TEXT BOOKS:

1. Security in Computing, Fourth Edition, by Charles P. Pfleeger, Pearson Education

2. Cryptography And Network Security Principles And Practice, Fourth or Fifth Edition, William
Stallings, Pearson

REFERENCES BOOKS:
1. Modern Cryptography: Theory and Practice, by Wenbo Mao, Prentice Hall.
2. Network Security Essentials: Applications and Standards, by William Stallings. Prentice Hall
Jodhpur Institute of Engineering & Technology
SYLLABUS
IV - Semester
Branch: CSE (Cy. Security)
4CYS4-24: Database Management System Lab

Credit: 1 Max. Marks: 50 (IA: 30, ETE:20)

0L+0T+2P End Term Exam: 2 Hours
S. No. List of Experiments
1. To perform various SQL Commands of DDL, DML, DCL.

2. Write SQL Commands such as Insertion, deletion and updation for any schema.

3. Write SQL command to implement the referential integrity constraints.

4. To execute Nested Queries, Join Queries, order-by, having clause and string operation.

5. To perform set operators like Union, Intersect, Minus on a set of tables.

6. To execute various commands for GROUP functions (avg, count, max, min, Sum).

7. Write a PL/SQL block for a transaction application using Cursors..

8. Write a PL/SQL block for transaction application using Triggers.

9. Write the query to create the views.

10. Write the query for creating the users and their role.

In this subject, the students are supposed to prepare a small database application in the
complete semester like financial accounting system, Railway reservation system,
11.
Institute timetable management system, Student record system, library management
system, etc.

Tools/ software/ language: Oracle SQL

Jodhpur Institute of Engineering & Technology
SYLLABUS
IV - Semester
Branch: CSE (Cy. Security)
4CYS9-MC1: ELEMENTS OF LITERATURE

Credit: 0 Max. Marks: 100

2L+0T+0P 2 Mid Term Exam: 1.5 Hours each

COURSE OBJECTIVE:
● To make the students aware about the finer sensibilities of human existence through an art form.
The students will learn to appreciate different forms of literature as suitable modes of expressing
human experience.

1. COURSE CONTENTS
Introduction to Elements of Literature

1. Relevance of literature

a) Enhances Reading, thinking, discussing and writing skills.

b) Develops finer sensibility for better human relationship.

c) Increases understanding of the problem of humanity without bias.

d) Providing space to reconcile and get a cathartic effect.

2. Elements of fiction

a) Fiction, fact and literary truth.

b) Fictional modes and patterns.

c) Plot character and perspective.

3. Elements of poetry

a) Emotions and imaginations.

b) Figurative language.

c) Simile, metaphor, conceit, symbol, pun and irony

d) Personification and animation.

e) Rhetoric and trend.

4. Elements of drama

a) Drama as representational art.

b) Content mode and elements.

c) Theatrical performance.

d) Drama as narration, mediation and persuasion.

e) Features of tragedy, comedy and satire.

TEXT BOOKS:
1.An Introduction to the Study of English Literature, W.H. Hudson, Atlantic, 2007.
2.An Introduction to Literary Studies, Mario Klarer, Routledge, 2013.
3.The Experience of Poetry, Graham Mode, Open college of Arts with Open Unv Press, 1991.
4.The Elements of Fiction: A Survey, Ulf Wolf (ed), Wolfstuff, 2114.
5.The Elements of Drama, J.L.Styan, Literary Licensing, 2011.