Cse Syllabus

MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY
BHOPAL - 462003
Name of Program B. Tech. Semester: First/Second Year: First
Name of Course Computer programming & Problem Solving
Course Code CSE 114
Core / Elective / Other Core
Prerequisite:
1. There are no prerequisites to learn C programming.
2. Just a bit of logical skills should be enough.
Course Outcomes:
On successful completion of the course, students should be able to
1. Identify tasks in which the numerical techniques learned are applicable and apply them
to write programs, and hence use computers effectively to solve the task.
2. Design algorithm and illustrate flowchart for a given problem.
3. Identify and abstract the programming task involved in a given computational problem,
4. Develop C programs on a computer, edit, compile, debug, correct, recompile and run it.
5. Learn the basics of the Internet of Things and its applications. Understand Arduino
Architecture, programming and interfacing with sensors.
Description of Contents in brief:

1. Introduction to Computer and its organization.
2. Problem solving using Computers by Flowchart and Algorithms.
3. Developing a running computer program in C.
4. C programming using conditions, loop, array, functions, pointers and structures.
5. Introduction to IoT using Arduino.
List of Textbooks:
1. E. Balaguruswamy, “Programming in ANSI C”, Tata McGraw-Hill.
2. Suresh Kumar Srivastava, “C in Depth”, BPB Publication.
3. R. G. Dromey, "How to Solve It By Computer", Pearson
4. K R Venugopal, “Mastering C”, Tata McGraw-Hill.
List of Reference Books:
1. Yashavant P. Kanetkar, “Let us C”, BPB Publication
2. A.R. Bradley, "Programming for Engineers", Springer
3. Schildt Herbert, “C- The Complete Reference” ,Tata McGraw-Hill.
4. Dan Gookin,”Begin programming with C for Dummies”, Wiley
URLs:
1. https://nptel.ac.in/courses/106/105/106105171/
2. https://www.nptel.ac.in/courses/106/104/106104128/
BHOPAL - 462003
Name of
B.TECH Semester III Year II
Program
Name of Course Mathematics- 3
Course Code MTH 231
Prerequisite:
1. Mathematics of higher secondary level
Course Outcomes :
1. Describe the basic principles of sets and operations in sets.
2. Determine the properties of relations and functions.
3. Define basic notions in graph theory and chromatic graph theory
4. Demonstrate different traversal methods for trees and graphs.
5. Recognize types of tree and graph algorithms, the issue of efficiency of algorithms and will
be able to use them to model problems in computer science.
1. Sets, relations, partial ordered set and lattices.
Group Theory: Groups, subgroups, cyclic group, cosets, homomorphism and isomorphism,
2.
Lagrange’s theorem
3. Discrete numeric function, Recurrence relation and generating function.
Statistics: Introduction, Measure of central tendency, Measures of Dispersion, Probability:
4. Addition and multiplication theorems, Condition Probability, Bayes’ theorem. Random
variable, Probability distribution, Binomial, Poisson and Normal distribution.
Graph Theory: Basic fundamentals of Graph Theory, Connected and Disconnected graphs,
Matrix representation of Graphs, Euler and Hamilton Paths, Shortest path algorithms. Tree,
5. Property of tree, Spanning tree, Spanning tree algorithms, Fundamental circuits and cut
sets. Graph coloring, covering and Partitioning. Bipartite graph, chromatic number,
Chromatic Partitioning, Chromatic Polynomial, matching, covering – four color problem.
List of Text Books:
Kenneth, K. R., Discrete Mathematics and its Applications, 7th Ed., Tata McGraw Hill,
1.
2012.
2. Harary F., Graph Theory, Narosa, 1969.
Hogg, R. V. and Craig, A., Introduction to Mathematical Statistics, Pearson Education, 6th
3.
edition 2006.
BHOPAL - 462003

1. Johnsonbaugh, R., Discrete Mathematics, 6th Ed., Maxwell Macmillan International 2006.
Mott, J.L., Kandel, A. and Baker, T.P., Discrete Mathematics for Computer Scientists and
2.
Mathematicians, Prentice Hall India Pvt Ltd 2001.
Kolman, B., Busby, R. and Ross, S.C., Discrete Mathematical Structure, 6th Ed., Pearson
3.
2008.
URLs:
BHOPAL - 462003
Name of Program B. Tech Semester- IV Year- II
Name of Course Fundamentals of Design
Course Code ME 252
Core / Elective / Other CORE

Prerequisite if any:
1. NIL
Course Outcomes:
Develop a strong understanding of the design process and apply it in a variety of
CO1
business settings
Analyse self, culture, teamwork to work in a multidisciplinary environment and
CO2
exhibit empathetic behavior
CO3 Formulate specific problem statements of real time issues and generate innovative
ideas using design tools
Apply critical thinking skills in order to arrive at the root cause from a set of likely
CO4
causes
CO5 Demonstrate an enhanced ability to apply design thinking skills for evaluation of
claims and arguments
Unit 1. Introduction to design thinking, traditional problem solving versus design thinking,
history of design thinking, wicked problems. Innovation and creativity, the role of
innovation and creativity in organizations, creativity in teams and their environments,
design mind-set. Introduction to elements and principles of design, 13 Musical Notes
for Design Mind-set, Examples of Great Design, Design Approaches across the world.
Unit 2. Understanding humans as a combination of I (self) and body, basic physical needs up
to actualization, prosperity, the gap between desires and actualization. Understanding
culture in family society, institution, startup, socialization process. Ethical behavior:
effects on self, society, understanding core values and feelings, negative sentiments
and how to overcome them, definite human conduct: universal human goal,
developing human Consciousness in values, policy, and character. Understand
stakeholders, techniques to empathize, identify key user problems. Empathy tools-
Interviews, empathy maps, emotional mapping, immersion and observations, customer
journey maps, and brainstorming, Classifying insights after Observations, Classifying
Stakeholders, Do’s & Don’ts for Brainstorming, Individual activity- ‘Moccasin walk’
Unit 3. Defining the problem statement, creating personas, Point of View (POV) statements.
Research- identifying drivers, information gathering, target groups, samples, and
feedbacks. Idea Generation-basic design directions, Themes of Thinking, inspirations
and references, brainstorming, inclusion, sketching and presenting ideas, idea
evaluation, double diamond approach, analyze – four W’s, 5 why’s, “How Might We”,
Defining the problem using Ice-Cream Sticks, Metaphor & Random Association
Technique, Mind-Map, ideation activity games - six thinking hats, million-dollar idea,
introduction to visual collaboration and brainstorming tools - Mural, JamBoard
Unit 4. Fundamental concepts of critical thinking, the difference between critical and ordinary
thinking, characteristics of critical thinkers, critical thinking skill slinking ideas,
structuring arguments, recognizing incongruences, five pillars of critical thinking,
argumentation versus rhetoric, cognitive bias, tribalism, and politics. Case study on
BHOPAL - 462003
applying critical thinking on different scenarios.

Unit 5. The argument, claim, and statement, identifying premises and conclusion, truth and
logic conditions, valid/invalid arguments, strong/weak arguments, deductive argument,
argument diagrams, logical reasoning, scientific reasoning, logical fallacies,
propositional logic, probability, and judgment, obstacles to critical thinking. Group
activity/role plays on evaluating arguments.
List of Text Books:
101 Design Methods A Structured
Vijay Kumar, John Wiley and Sons Inc,
1. Approach for Driving Innovation in
New Jersey
Your Organization,
2. Foundations of Ethics and Management BP Banerjee, Excel Books
3. Gavin Ambrose and Paul Harris, AVA
Design Thinking
Publishing SA
4. Roger L. Martin, Harvard Business Press,
Design of Business:
Boston MA
5. Engineering Design G.E. Dieter
URLs:
2. https://www.youtube.com/c/UniversalHumanValues
BHOPAL - 462003
Name of Program B.Tech Semester III Year II
Name of Course Data Structures

Course Code CSE 211
Prerequisite:
1. Programming Languages
Course Outcomes:
1. Describe the concepts and importance of data structures.
2. Implement various types of data structures.
3. Determine the algorithm correctness and its efficiency.

Introduction to Data Structures, Algorithm Evaluation, Arrays, Multi-dimensional
Arrays, Sparse Matrices, Structure, Pointers, Stacks: representation of stacks and basic
operations, applications of Stacks, Prefix, Postfix and Infix notations and conversion,
Recursion, Towers of Hanoi. Queues: Types of Queue and its application. Linked lists:
Types of Linked list, implementation of Stack and Queue using Linked list, Polynomial
representation and Arithmetic. Trees: binary tree, n-ary Tree, Tree Traversal, AVL
Trees, Binary Search trees, Graphs: Representation, Traversing. Searching: Sequential
Search, Binary Search, and Hashing. Sorting: External and Internal Sort, Selection Sort,
Bubble Sort, Insertion Sort, Radix Sort, and Bucket Sort.
List of Text Books:
1. Fundamentals of Data Structures by E.Horowitz and S.Sahni, Computer Science Press.
2. Data Structure Using C by A. M. Tanenbaum, PHI.
1. Data Structures and Algorithms in C (Second edition) by M. T. Goodriche and R.
Tamassia, John Wiley & Sons.
2. Data Structures and Algorithm Analysis in C (Second Edition), by M. A. Weiss,
Addison-Wesley, 2013.
3. Classic Data Structures by D. Samantha, PHI.
4. Data Structures, Schaum’s Series
URLs:
1. NOC:Programming, Data Structures and Algorithms -
https://nptel.ac.in/courses/106102064/
2. Stanford CS166: Data Structures - http://web.stanford.edu/class/cs166/
BHOPAL - 462003
Name of Course Data Base Management Systems
Course Code CSE 212
Prerequisite:
1. Programming Languages and Data Structures
Course Outcomes:
1. Discuss the database concepts and database management system software
2. Model an application’s data requirements using conceptual modeling tools like ER
diagrams and design database schemas based on the conceptual model.
3. Practice the DBMS query languages and representation of queries using Relational
algebra, calculus and SQL.
4. Design the database using bottom up approach
5. Describe the concurrent execution of transactions and their control and recovery

1. Fundamentals of DBMS, different data models. ER modelling, Enhanced ER Model,
Relational database systems, integrity constraints, ER to Relational Mapping.
2. Database Query Languages: Relational algebra and calculus, SQL, assertions, triggers.
3. Relational Database Design, functional dependency constraints, Normalization in
relational approach.
4. Overview of query processing and cost estimation, Query Optimization, Transaction
processing and concurrency control.
5. Data storage and indexing, B-Trees and B+ Trees, Overview of advanced databases.
List of Text Books:

1. Fundamentals of Database Systems Elmasri and Navathe
2. Database System Concepts Silberschatz, Korth and Sudershan .

An Introduction to Database Systems C. J. Date
BHOPAL - 462003
Name of Course Principles of Programming Languages
Course Code CSE 213
Prerequisite:
1. NIL
Course Outcomes:
1. Design effective algorithms.
2. Implement the algorithms with use of existing programming languages.
3. Extend the vocabulary of useful programming constructs.
Preliminary concepts of programming language, Language evaluation criteria, Issues in
Language Translation: Syntax, Semantics, Stages, analysis and synthesis, Data types,
Expressions and Statements, Subprograms and Blocks, Abstract Data types, Parameter
Passing, Scoping Rules, Exception handling, Runtime Environment, Object-oriented
programming concepts. Implementations of modern programming languages Java,
C++, Concurrency: Subprogram level concurrency, semaphores, monitors, message
passing. Functional Programming Languages, Logic Programming Languages.
List of Text Books:

1. Concepts of Programming Language by Robert .W. Sebesta

1. Programming Languages by Louden
2. Programming languages by Ghezzi
3. Programming Languages Design and Implementation by Pratt and Zelkowitz
BHOPAL - 462003
Name of Program B. Tech. CSE Semester III Year II
Name of Course Digital Circuit Design
Course Code CSE 214
Course Outcomes:
1. Explore number system used in computer system.
2. Identify the logic gates and their implementation.
3. Develop combinational circuits e.g. multiplexer, decoder, parallel adder and subtracter.
4. Perform the processing and implementation of sequential circuits.

1. Number system, radix conversion, Binary codes, Floating point format
2. Boolean algebra, Logic gates, simplification of Boolean expressions
3. Combinational circuit: Full and half adder, Full and half subtracter, Parallel adder and
subtracter, BCD adder, Excess 3 adder, Magnitude comparator, Look ahead carry
generator, Multiplexer and De-multiplexer, Encoder and Decoder
4. Sequential circuits: Flip-Flop, Designing of sequential circuit, Minimization of
sequential circuit, Synchronous and Asynchronous system, Synchronous Counter
Designing, Asynchronous Ripple counter
5. Registers, Shift registers, Serial and parallel registers, Johnson and ring counter.
List of Text Books:

1. Digital Electronics by Morris Mano

1. Digital Circuits & Design by Arivazhagan S Salivahanan
2. Fundamentals of Digital Logic with VHDL Design by Stephen Brown
BHOPAL - 462003
Name of Program B. TECH Semester IV Year II
Name of Course Fundamentals of Entrepreneurship
Course Code HUM-251
Prerequisite:
1 Fundamental Understanding of Personnel Administration is an integral part for Engineers
before entry into organization and to setup any startup business.
2 Organizational theories and Motivation for Entrepreneurship enthusiastic for systematic
approach to handle the materialistic and non-materialistic motivation.
3 Business Plan and fundamentals of Entrepreneur Development for engineering graduates to
survive in this competitive world.
4 A hybrid approach for technocrats to handle the multifunctional technicalities in case of
industrial laws and New social security and pension rules.
Course Outcomes:
On successful completion of the course, student be able to:
1. Apply administrative skills for Engineers to handle the all the matters related to personnel
and their dimensions.
2. Apply the industrial Laws and application of administrative principles for smooth
functioning of Industry and a fresh idea to setup new business.
3. Create business ideas to become successful entrepreneurs to setup new operational business
units to address the need of society.
1 Meaning, nature and scope of Personnel Administration in India, functions and significance
of Personnel Administration, Recruitment, Training, Promotion and Disciplinary Action,
Classification of Services, Generalists and Specialists, Development of Public Services in
India, Bureaucracy and Modern Democratic System, Performance Appraisal
2 Organizational Development Theories, Fredric Winslow Taylor, Marry Parker Follett, Elton
Mayo, Max Weber, Henry Fayol, Power, Accountability, Responsibility, Control,
Transparency and Conflict Resolutions.
3 Meaning and importance of Entrepreneurship, Evolution of Entrepreneurship, Factors
influencing Entrepreneurship: Social factors, psychological factors, economical factors and
environmental factors. Characteristics of an Entrepreneur, Types of Entrepreneur: type of
business, use of technology, motivation. New Generation of entrepreneurship: social
entrepreneurship, tourism entrepreneurship, women entrepreneurship. Barriers to
Entrepreneurship.
4 Entrepreneurial motivation: Relevance of Motivation, Maslow’s Theory, Herzberg’s
Theory, Douglas McGregor, Ethics, Corruption and Anti-Corruption Machinery in country
5 Factory Act 1948, Provident Fund Act 1952, Compensation Act 1919, Special Economic
Zone (SEZ), National Small Industries, Quality Standard with Special reference to (ISO),
Small Industries Development Bank of India (ISDBI), New Pension Scheme 2004 Act.
List of Text Books:
1. D. Ravindra Prasad, V.S. Prasad, P. Satyanarayana, Y. Pardhasaradhi. Administrative
Thinkers. Sterling Publishers Private Limited Second Revised Enlarged Edition, New Delhi.
2010.
BHOPAL - 462003
2. Haidi, Patricia & Brush, Teaching Entrepreneurship, Edward Elgar, United States of
America, 2014.
3. Norma M. Riccucci, Public Personnel Management, Rutledge, United States of America,
2017.
4. Padhi, Labour& Industrial Laws, PHI Learning Private Limited, Eastern Economy Edition.
New Delhi,2017
1. Monappa&Saiyadain, Personnel Management, McGraw Hills, January-2001.
2. Howard & Donald, Entrepreneurship: Theory, Process &Practice, engage Learning,
Australia, 2010.
3 Jared, Donald & John, Public Personnel Management, Rutledge, United Kingdom,2018
4. Sinha&Sekhar, Industrial Relations, Trade Unions and Labor Legislations,Pearson
Publication,New Delhi.2017
URLs:
1. https://www.google.com/search?ei=soDDXtS_G4ma4-
EPo8CFyAs&q=entrepreneurship+development&oq=entreprenurship&gs_lcp=CgZwc3ktY
WIQARgCMgQIABAKMgQIABAKMgQIABAKMgQIABAKMgQIABAKMgQIABAK
MgQIABAKMgQIABAKMgQIABAKMgQIABAKOgQIABBHOgQIABBDOgIIADoOC
AAQ6gIQtAIQmgEQ5QI6BQgAEJECOgUIABCDAToJCAAQChBGEPkBUKAiWJd5Y
NKgAWgBcAF4A4ABoAGIAcESkgEEMC4xOZgBAKABAaoBB2d3cy13aXqwAQY&sc
lient=psy-ab
EPo8CFyAs&q=personnel+administration&oq=personnel+administartaion&gs_lcp=CgZwc
3ktYWIQARgAMgQIABANMgQIABANMgQIABA
EPo8CFyAs&q=industrial+laws+in+india&oq=industrial+laws&gs_lcp=CgZwc3ktYWIQ
ARgBMgIIADICCAAyAggAMgIIADICCAAyAggAMgIIADICCAAyAggAOgQIABBHO
gQIABBDOg4IABDqAhC0AhCaARDlAjoFCAAQgwE6BQgAEJECUJoYWKRBYKNka
AFwAXgDgAGRAYgB1BCSAQQwLjE5mAEAoAEBqgEHZ3dzLXdperABBg&sclient=p
sy-ab
4. https://www.amazon.in/Industrial-Relations-Unions-Labour-Legislation-
ebook/dp/B073TZDYGM/ref=pd_simd_14_1/257-1509110-
0248531?_encoding=UTF8&pd_rd_i=B073TZDYGM&pd_rd_r=89ddebbb-c2da-4413-
97cf-3dfb96f9d746&pd_rd_w=Sd4l2&pd_rd_wg=WvAxZ&pf_rd_p=189ccf44-51b2-4146-
8c7f-
876b3263b44b&pf_rd_r=TWD32YRDW3JPK75NA49K&psc=1&refRID=TWD32YRDW
3JPK75NA49K
BHOPAL - 462003
Name of Program B.Tech Semester IV Year II
Name of Course Algorithm Design & Analysis
Course Code CSE 221

Prerequisite:
1. Data Structure
2. Basics of any computer programming knowledge
Course Outcomes:
1. Analyze time and space complexity for the given algorithms.
2. Use various searching, sorting and graph traversal algorithms.
3. Use various techniques for efficient algorithm design like divide and conquer, greedy
and dynamic algorithms.
4. Describe minimum spanning tree algorithms, Single source shortest path, all pair
shortest path algorithms in a graph and backtracking concepts.
5. Describe polynomial and non-polynomial problems, classify NP hard and NP complete
problems with their application.
1. Fundamentals of algorithm- analysis of complexity, recurrence relations, disjoint set
structure
2. Algorithm design techniques and Masters Theorem to compute algorithms time
complexity
3. Greedy algorithm and Dynamic programming concepts
4. Spanning Tree algorithms, graph shortest path algorithms
5. Branch and Bound techniques, Backtracking algorithms and graph traversal algorithms
(BFS and DFS)
6. Introduction of NP-completeness and NP-hardness problems
List of Text Books:
1. Fundamentals of Computer Algorithms by Horowitz Ellis and Sartaj Sahni
2. An Introduction to Algorithm by Thoman H. Cormen, Ronald L. Rivest
1. Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani: Algorithms
2. Data Structures and Algorithms Made Easy : Data Structure and Algorithmic Puzzles
URLs:
1. https://nasirmir.files.wordpress.com/2012/09/fundamentals-of-computer-algorithms-by-
ellis-horowitz-1984.pdf
2. https://nptel.ac.in/courses/106101060/
3. http://web.stanford.edu/class/cs161/schedule.html
4. https://www.coursera.org/specializations/algorithms
BHOPAL - 462003
Name of Program B. Tech. Semester IV Year II
Name of Course Computer System Organization
Course Code CSE 222
Prerequisite:
1. Digital Circuit Design (CSE-214)
Course Outcomes:
1. Analyze functioning of computer.
2. Analyze various components used in computers like CPU, Memory and I/O.
3. Analyze computer design (ALU and CU design).
1. Overview of basic computer organization and design, Central processor organizations:
basic building blocks, bus organized computer memory, address structure, register
transfer languages, instruction formats, expanding op-codes and addressing modes.
2. Control unit organization: hardwired control & microprogrammed control organization,
control memory, address sequencing micro-instruction formats, micro-program
sequencer, and micro-programming.
3. Arithmetic processor design: addition and subtraction algorithm, multiplication
algorithm, division algorithm, processor configuration, and floating-point arithmetic.
Performance evaluation of processors. Introduction to pipeline processing, pipeline
hazards.
4. Input-Output organization: Asynchronous Data Transfer, Asynchronous
Communication Interface, Modes of Transfer: Interrupt-Initiated, Direct Memory
Access (DMA).
5. Memory Organization: Main Memory, Auxiliary Memory, Associative Memory:
Hardware Organization, Cache Memory: Mapping Schemes.
List of Text Books:
1. Computer Architecture Morris Mano.
1. Computer Organization and architecture William Stallings.
2. Computer Architecture Schaum’s Outlines.
BHOPAL - 462003
Name of Program B.Tech Semester- IV Year- II
Name of Course Theory of Computation
Course Code CSE 223
Prerequisite:
1. Concepts of set theory
2. Concepts of functions and relations
Course Outcomes:
1. Construct deterministic and nondeterministic finite state automata (DFA and NFA) for solving
simple decision problems and equivalence of regular expression with FSM.
2. Inspect capabilities of CFG and PDA.
3. Apply concept of Turing machine and un decidable problems.
1. Introduction to Theory of computations, revision of basic set theory operations and relations
2. Finite State Machines, DFA, NFA and their conversions
3. Regular Expressions, Conversion of regular expression to NFA, DFA and vice versa
4. Regular Sets and their properties, Pumping Lemma
5. Output Machines Mealy and Moore machines
6. Context Free Grammar, Parse Tree, Simplification of CFG, Normalization of CFG
7. Push Down Automata, Non deterministic PDA
8. Context Free Languages and their properties, Regular Grammar
9. Turing Machines
10. Recursive and RE sets, Properties of recursive and RE sets.
11. Decidable and Un decidable problems, Non-RE language
12. The Universal Turing Machine, Rice’s Theorem, Post Correspondence Problem
List of Text Books:
1. Introduction to automata theory, language & computations Hopcroaf, Ullman and Motwani,
1. Theory of Computer Sc. (Automata, Languages and computation): K.L.P. Mishra & N.
Chandrasekaran,
2. Introduction to formal Languages & Automata Peter Linz,
3. Fundamentals of the Theory of Computation- Principles and Practice, Ramond Greenlaw and
H. James Hoover
URLs:
BHOPAL - 462003
Name of Program B. Tech. Semester IV Year II
Name of Course Data Communication
Course Code CSE 224
Prerequisite:
1. Basic Concept of Computer networks
2. Basic Concept of Analog and Digital Signals
Course Outcomes:
1. Identify suitable transmission modes for information transfer.
2. Analyze various modulation techniques used for analog and digital transmission.
3. Analyze spread spectrum technology for wireless communication.
4. Identify various error detection and correction techniques.

Characterization of communication signals: Bit rate Baud rate, Sampling, Nyquist bit rate,
Shannon Theorem, Bandwidth, Throughput. PCM, Delta Modulation, Serial & parallel
transmission, Amplitude modulation, frequency modulation and phase modulation, ASK,
BPSK, QPSK, FSK, QAM, Modems. Multiplexing, spread spectrum modulation: Pseudo
noise sequences, DS & FH spread spectrum. Synchronous and asynchronous transmission,
Line coding scheme, Error detection and correction.
List of Text Books:

1. Data Communication and Networking, B A Forouzan

1. Data & Computer Communication William Stallings
2. Digital Communications, Simon Haykin
3. Principles of Communication Systems, Herbert Taub & D L Schilling
URLs:
1. https://www.cisco.com/c/en_in/solutions/small-business/resource-center/networking.html
2. http://examradar.com/communication-networking-summary-1/
3. Nptel https://nptel.ac.in/courses/106/105/106105082/
BHOPAL - 462003
Name of Program B.Tech Semester- IV Year-II
Name of Course Software Engineering

Course Code CSE 225
Prerequisite:
1. Learn an OOP Language: Java, C++, Python etc. choose one and try to master it. There
are many tutorials/courses that cover these on Coursera and edX.
2. Algorithms and Data Structures: This is like the most important field of Computer
Science. Being good at Algorithms and Data Structures is ALWAYS a plus point.
Knowing how to implement a particular solution in the most efficient way is key for a
Software Developer. Working out problems alongside on platforms like CodeChef,
Hacker Rank will help you practice what you read.
3. Choose a Platform: iOS, Android, Windows, Web etc. Choose one and work towards
building your knowledge accordingly. Get to know the Platform in and out.
4. Analyze: This is the best way to learn and gain knowledge of how things are
happening. For example, if you want to work on Android, analyzing the source code
(since it's open source) will help a lot. Participate on forums like Stack Overflow etc.
Course Outcomes:
1. Use the techniques necessary for software engineering practice.
2. Apply software engineering perspective through software design and construction,
requirements analysis, verification, and validation, to develop solutions to modern
problems such as security, data science, and systems engineering.
3. Apply new knowledge as needed, using appropriate learning strategies.
1. Introduction to software engineering, software process & process models, Software
metrics and measurements.
2. software project management, software project planning, scheduling and tracking, cost
estimation methods
3. Requirements analysis: Principles, complexity, methods, structured analysis, SRS
Documentation. Design principles: abstraction, refinement, modularity, control
hierarchy, structured partitioning, design types and methods
4. Software coding: coding style, coding efficiency, capability maturity model (CMM),
Software quality assurance, Software testing: Software testing techniques, choice and
classification of test data, verification & validation methods.
5. Software maintenance, configuration management, system documentation, software
reusability, CASE tools.
List of Text Books:
1. Software Engineering: A Practitioner’s Approach by Roger S. Pressman, McGraw-Hill
International edition.
2. Software Engineering by Ian Sommerville, Addison-Wesley. 5. Fundamentals of
Software Engineering by Rajib Mall, PHI
1. An Integrated Approach to Software Engineering, by Pankaj Jalote, Narosa Publishing
House.
2. Software Engineering by K.K. Agarwal.
BHOPAL - 462003
Name of Program B.Tech Semester V Year III
Name of Course Operating Systems
Course Code CSE 311
Prerequisite:
Basics of Computer Architecture
Course Outcomes:
1. Describe functional architecture of operating system
2. Describe process concept and its implementation, compare process scheduling
algorithms
3. Classify memory management schemes and compare them on the basis of related
advantages and disadvantages
4. Describe Process synchronization mechanisms used to solve synchronization problems,
describe mechanisms for handling Deadlock problems
5. Express various file allocation and access methods, Disk structure, describe and compare
various Disk scheduling algorithms
1. Describe the general architecture of operating system, PCB, Process state transition
diagram, Process scheduling algorithms
2.
Concepts of uni-programming, Multiprogramming, Multitasking system
3. MVT and MFT memory management techniques, Paging schemes
4. Virtual memory concept, Page replacement algorithms and Segmentation scheme
5. Process synchronization and Deadlock concepts
6. Disk and File structure, Disk scheduling, I/O systems and System security
List of Text Books:
1. Operating System Concepts by Avi Silberschatz and Peter Galvin
2. Operating Systems: A Concept-Based Approach by D M Dhamdhere
3. Operating Systems: Internals and Design Principles by William Stallings
1. Operating Systems: A Modern Perspective” by Gary J Nutt
2. Operating System: A Design-oriented Approach” by Charles Crowley
3. MODERN OPERATING SYSTEMS” by Andrew S Tanenbaum
URLs:
1. http://web.stanford.edu/~ouster/cgi-bin/cs140-spring20/index.php
2. http://faculty.salina.k-state.edu/tim/ossg/index.html
BHOPAL - 462003
Name of Program B. Tech. Semester V Year III
Name of Course Compiler Design
Course Code CSE 312

Prerequisite:
1. Data Structure
2. Computer Architecture
3. Theory of Computation
Course Outcomes:
1. To analyze how each components of a compiler work, including lexical analysis,
parsing, code generation, code optimization.
2. Use the algorithms used to build a compiler and their underlying foundations from
formal language theory will be covered.
3. Use advance techniques for arbitrary and deterministic grammars.
4. Implement a simple working compiler for a high-level programming language.
5. Practice strong Mathematical Basis of Compilers.
1. Compilers and translators, structure of compiler its different phases, Compiler
construction tools. Lexical analyzer, Specification and recognition of tokens, input
buffering.
2. Syntax analyzer: top down parsing and bottom up parsing.
3. Syntax directed definition, syntax directed translation scheme, Type Checking, Run
time Environments.
4. Intermediate codes: syntax tree, post fixed expressions, three address code, quadruples
and triples.
5. Code optimization: DAG, Code generation, Symbol table implementation, Error
handling.
List of Text Books:
1. Compilers: Principles, Techniques and Tools, Alfred V. Aho, Ravi Sethi, Jeffrey D.
Ullman, Addison-Wesley.
2. Theory and Practice of Compiler, Tremblay & Sorenson
3. Modern Compiler Implementation in C/Java, Andrew W. Appel, Cambridge University
Press.
1. Compiler Design in C, Allen I. Holob, Prentice-Hall.
2. Advanced Compiler Design and Implementation, Steven S. Muchnik, Elsevier.
3. Optimizing Compilers for Modern Architectures, Randy Allen and Ken Kennedy,
Elsevier.
4. Engineering a Compiler, Keith D. Cooper and Linda Torczon, Elsevier.
5. Programming Language Pragmatics, Michael L. Scott, Elsevier.
URLs:
BHOPAL - 462003
1. http://sgbm.in/ebooks/cs/Compiler.pdf
2. https://holub.com/goodies/compiler/compilerDesignInC.pdf
BHOPAL - 462003
Name of Program B. Tech. Semester V Year III
Name of Course Computer Networks
Course Code CSE 313
Prerequisite:
1. Data Communications
2. Data Structures and Algorithms
3. C Programming
4. Fundamentals of Operating System and Computer Architecture
Course Outcomes: On successful completion of the course, students should be able to
1. Adapt computer network basics, network architecture, TCP/IP and OSI
reference models.
2. Interpret data link protocols, multi-channel access protocols and IEEE 802
standards for LAN.
3. Interpret routing and congestion in the network layer with routing algorithms
and classify IPV4 addressing scheme.
4. Determine the elements and protocols of the transport layer
5. Interpret network security and study various protocols such as FTP, HTTP,
Telnet, DNS.
Introduction to TCP/IP and OSI reference model, polling techniques,
multiplexing, and concentration, transmission media used in physical layer. MAC
protocols ALOHA, CSMA/CA, CSMA/CD Ethernet, token bus, token ring,
(IEEE 802.3, IEEE 802.4, IEEE 802.5) DLL protocols, error correction and
detection codes, flow control protocols performance evaluation with error or
without error, protocol specification and verification, framing, HDLC. Switching
techniques, Routing and congestion in network layer, routing and congestion
control algorithms. Connection management in transport layer, protocols of
transport layer, TCP , UDP etc., world wide web (www), electronic mail(E-mail),
Study of high speed fibre optic networks, FDDI.
List of Text Books:

1. Computer Networks, Andrew S. Tanenbaum
2. Data Communications and Networking by Behrouz A. Forouzan
3. Internetworking with TCP/IP by Douglas Comer
1. Computer Network W. Stalling
BHOPAL - 462003
2. Data networks by Dimitri Bertsekas and Robert G. Gallager
3. Computer Networking: A Top down Approach by James F. Kurose, Keith W.

Ross
4. Computer Networks: A Systems Approach Book by Bruce S. Davie and Larry L.
Peterson
5. Data & Computer Communications by William Stallings
URLs:
1. http://www.ietf.org/rfc.html
2. https://www.isc.org
3. http://www.internetsociety.org
4. Nptel: https://nptel.ac.in/courses/106/105/106105183/
BHOPAL - 462003
Name of Program B. TECH Semester V Year III
Name of Course Statistical Models for Data Interpretation and Analysis
Course Code CSE 314
Prerequisite:
1. Nil
Course Outcomes:
1. Apply techniques of statistical models and their applications for the analysis of data.
2. Create models for regression and time series forecasting.
3. Compare if there is a significant difference between two or more algorithms.
1 Introduction to Statistics, Types of data, Categorical data, Numerical data, Association between
categorical and numerical data
2 Introduction to Data Analysis, Measures of Central Tendency, Measures of Dispersion,
Moments, Skewness and Kurtosis
3 Presentation of Data, Data Visualization, Histograms, Box Plots, Surface Plots etc.
4 Population and Sample, Methods of sampling.
5 Random variables, Different Probability density distributions, Bayesian Statistics, Central
Limit Theorem
6 Hypothesis Testing, confidence interval, T-Test, Wilcoxon test, ANOVA
7 Regression, Correlation
8 Time series forecasting.
List of Text Books:

1. Dawn Griffiths: Modern Head First Statistics, O Reilly Publication.

1. The elements of statistical learning by Trevor Hastie, Robert Tibshirani & Jerome Friedman
URLs:
BHOPAL - 462003
Name of Program B.Tech Semester V Year III

Name of Course Artificial Intelligence
Course Code CSE 315
Prerequisite:
1. Fundamental knowledge of basic mathematics.
2. Knowledge of logics and reasoning desirable.

1. Adapt the concepts of Artificial Intelligence and Identify problems where artificial
intelligence techniques are applicable.
2. Apply selected basic AI techniques and Participate in the design of systems that act
intelligently and learn from experience.
3. Acquire advanced Data Analysis skills, Learn Industry relevant Applications of AI, and
Create AI solutions for various business problems.

1. Introduction to AI-Problem formulation, Problem Definition -Production systems,
Control strategies, Search strategies. Adversarial search, Problem characteristics,
Production system characteristics -Specialized productions system- Problem solving
methods – Problem graphs, Matching, Indexing and Heuristic functions -Hill Climbing-
Depth first and Breath first, Constraints satisfaction – Related algorithms, Measure
of performance and analysis of search algorithms.
2. Knowledge representation, Knowledge representation using Predicate logic and

prepositional logic, Resolution, Backward Chaining. Structured representation of
knowledge. Game playing.
3. Inference – Backward chaining, Forward chaining.
4. Basic plan generation systems, Strips, Advanced plan generation systems, K strips,
Strategic explanations -Why, Why not and how explanations. Learning.
5. Expert systems – Architecture of expert systems, Roles of expert systems – Knowledge

Acquisition – Meta knowledge, Heuristics. Typical expert systems – MYCIN, DART,
XOON, Expert systems shells.
List of Text Books:

1. Kevin Night and Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, Mc Graw Hill-
2008.

1. Peter Jackson, “Introduction to Expert Systems”, 3rd Edition, Pearson Education, 2007.
2. Stuart Russel and Peter Norvig “AI – A Modern Approach”, 2nd Edition, Pearson
BHOPAL - 462003
Education 2007.
3. Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill Education 2013.
URLs:
1. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-034-
artificial-intelligence-fall-2010/
2. http://nptel.ac.in
BHOPAL - 462003
Name of B. TECH Semester VI Year III

Program
Name of Course Engineering Management
Course Code ME 351
Prerequisite if any:
1. None
1. Determine the relevance and importance of Management Practices for Engineers.
2. Knowledge and Practices on the interdisciplinary course content that combines an engineering
focus with core business and management knowledge.
3. Interpret various methods of analysis and decision making related to operations, human
resources, finances and marketing management.
Unit 1. Principles/Functions of Management, Measure of Productivity and ways to enhance
Productivity. Management challenges for Engineers.
Unit 2. Operations Management and its scope, Production Systems, Facility Location, Facility
Planning & Plant Layouts.
Unit 3. Industrial Design, Product Design, Product / Project Life Cycle, Quality Control and Quality
Management, Forecasting Methods, Introduction to Supply Chain Management.
Unit 4. Material Management – Purchasing, Inventory & JIT Systems, Material Resource Planning,
Scheduling, Project Management, PERT and CPM, Project Crashing.
Unit 5. Introduction to Financial Management, Financial Statements and Analysis, Operations

Decision making - Break Even Analysis & Decision Trees
Unit 6 Fundamentals of Marketing Management, Organizational Behavior and Leadership, Strategic
Management, Statutory and Legal Issues.
List of Text Books:

1. Modern production/operations management by Buffa: Wiley India
2. Marketing Management by Kotler; PHI
3. Operations Management by Russel & Taylor; Wiley

1. Handbook of Industrial Engineering: Technology and Operations Management by
GavrielSalvendy; Wiley publication
2. Operations management by Krajewski; pearson
3. Industrial Engineering by Shankar Ravi; Galgotia Publication
4. Financial Management by I M Pandey; Vikas
5. Strategic Management by Pearce, Robinson and Mital; Mc Graw Hill Education
URLs:
BHOPAL - 462003
BHOPAL - 462003
Name of Program B. TECH Semester VI Year- III
Name of Course Machine Learning
Course Code CSE 321

Course Outcomes:
1. Analyze the Theoretical/ Practical techniques of machine learning algorithms.
2. Solve real world classification, regression problems using machine learning based
algorithm.
1 Data Preprocessing- Normalization, Feature Selection, Cross Validation, Handling
Missing Values.
2 Supervised Learning- Classification: Naïve Bayes, Bayesian Network, C4.5, ID3,
Support Vector Machine, Extreme Learning Machine, Neural Network
3 Regression: Linear, Polynomial, Multiple Linear Regression, Support Vector
Regression.
4 Underfitting, Overfitting and Regularization.
5 Committee Machines/ Ensemble Learning: Bagging, Boosting, Stacking, Negative
Correlation Learning.
6 Unsupervised Learning- Clustering: KNearestNeighbour, K-Means, Fuzzy K-Means,
Hierarchical Clustering, Single Linkage, Complete Linkage, Average Linkage, Non
Spherical Clustering Algorithms.
7 Neural networks, backpropagation, Extreme Learning Machine, RBFN,
9 VC Dimension, Kernel Methods.
10 Statistical Testing Methods.
11 Evolutionary Algorithms for parameter tuning like GA , ABC,PSO etc.
12 Deep Learning Neural Network.
13 Machine Learning Applications: Text Classification, Disease Diagnosis, Biometric
Systems, IDS, Rebar Detection, Ball bearing fault detection, ECG signal classification
etc.
List of Text Books:
1. Pattern Recognition and Machine Learning, Bishop, C. M. (2006),Springer, ISBN 0-
387-31073-8
1. The elements of statistical learning by Trevor Hastie, Robert Tibshirani& Jerome
Friedman
2. Machine Learning with SVM and other kernel methods, K. P. Soman.
URLs:
3 https://nptel.ac.in/courses/106/106/106106198/
BHOPAL - 462003
Name of Program B.Tech Semester VI Year III
Name of Course Digital Image Processing

Course Code CSE 322
Prerequisite:
1. Mathematics (including engineering mathematics).
2. linear Algebra
Differential Equations
Probability and Statistics
Calculus
3. A good programming skill(for platform like matlab, python)
1. Review the fundamental concepts of a digital image processing system.
2. Analyze images in the frequency domain using various transforms.
3. Evaluate the techniques for image enhancement and image restoration.
3. Categorize various compression techniques.
4. Interpret Image compression standards.
5. Interpret image segmentation and representation techniques.
1. Introduction and Fundamentals: motivation and Perspective, Applications, Components of

Image processing System, A simple image model,
Element of Visual Perception, A Simple Image Model,
Sampling and Quantization.
2. Image Enhancement in Frequency Domain: Fourier transform, Filters low pass, High pass,
correspondence between filtering in spatial & frequency domain, Smoothing Frequency Domain
Filters – Gaussian Low-pass Filters; Sharpening Frequency Domain Filters – Gaussian High-
pass Filters; Homomorphic Filtering.
3. Image Enhancement in Spatial Domain:

Introduction; Basic Gray Level Functions Piecewise-Linear Transformation Functions:
Contrast Stretching; Histogram Specification; Histogram Equalization; Local
Enhancement; Enhancement using Arithmetic/Logic Operations Image Subtraction,
Image Averaging; Basics of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic
Filter; Sharpening The Laplacian.
4. Image Restoration : A Model of Restoration Process, Noise Models,Restoration in the

presence of Noise only-Spatial Filtering Mean Filters: Arithmetic Mean filter, Geometric
Mean Filter, Order Statistic Filters Median Filter, Max and Min filters; Periodic Noise
Reduction by Frequency Domain Filtering Band-pass Filters; Minimum Mean-square
Error Restoration.
5. Morphological Image Processing: Introduction, Logic Operations involving Binary
Images, Dilation and Erosion Opening and Closing, Morphological Algorithms –
Boundary Extraction, Region Filling, Extraction of Connected, Components, Convex
Hull, Thinning, Thickening
BHOPAL - 462003
6. Image Segmentation:
Multi-level Thresh holding, Local Thresh holding, Region-based Approach, Detection of
discontinuation by point detection, Edge and Line Detection: Edge Detection, Edge
Operators,Pattern Fitting Approach, Edge Linking and Edge Following, Edge Elements
Extraction by Thresh holding Edge Detector Performance, Line Detection, Corner
Detection
7 Introduction of Image Transformation:
Discrete image transform. Wavelet transformation. Image Compression.
List of Text Books:
1. Jayaraman, S., Esakkirajan, S., & Veerakumar, T. (2009). Digital image processing tmh
publication. Year of Publication.
2. Digital Image Processing Second Edition (English, Paperback, S. Sridhar)
1. Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard E. Woods.
Published by: Pearson Education.
2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by: John
Wiley and Sons, NY.
3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice Hall,
Upper Saddle River, NJ.
URLs:
1. https://www.tutorialspoint.com/dip/index.htm
2. https://en.wikipedia.org/wiki/Digital_image_processing
3. https://www.geeksforgeeks.org/digital-image-processing-basics/
BHOPAL - 462003
Name of Program B.Tech Semester VI Year III
Name of Course Network & System Securities
Course Code CSE 323
Prerequisite:
1. Knowledge of computer networks, operating systems, data structures and algorithms.
2. Basic understanding of programming languages.
1. Acquire professional/academic knowledge and skills. Describe some common problems
or attacks on network security. And also Describe some network security services and
mechanisms.
2. Design a security solution for a given application, a system with respect to the security
of the system.
1. Introduction to Network And System Security. Basic concepts, common security goals.
Exploiting bugs in programs. Buffer overflows, return oriented programming, fuzzing.
2. Cryptography and cryptographic protocols, including encryption, authentication,
message authentication codes, Hash Functions - Security of Hash Functions and MACs -
MD5 message Digest algorithm - Secure Hash Algorithm - RIPEMD - HMAC Digital
Signatures, one way functions, public key cryptography, secure channels, zero
knowledge in practice, models and methods for security protocol analysis.
3. Malicious code analysis and defense. Intruders, Viruses, Worms, Trojan horses,
spyware, rootkits, botnets etc. and defenses against them, Detecting Attackers.
4. Software security. Secure software engineering, defensive programming, buffer overruns
and other implementation flaws.
5. Language based security: analysis of code for security errors, safe languages, and
sandboxing techniques. Operating system security. Memory protection, access control,
authorization, authenticating users, enforcement of security, security evaluation, trusted
devices, digital rights management.
6. Network security. Security services, Network based attacks, Security Issues in TCP/IP
suite- Sniffing, spoofing, buffer overflow, ARP poisoning, ICMP Exploits, IP address
spoofing, IP fragment attack, routing exploits, UDP exploits, TCP
exploits.Kerberos,X.509, firewalls, intrusion detection systems, DoS attacks and
defense. Case studies: DNS, IPSec.
7. Web security. Securing Internet Communication, XSS attacks and defenses, etc.
Advanced topics. Security monitoring, surreptitious communication, data remanence,
trusted devices, privacy and security of low powered devices (RFID) electronic voting,
quantum cryptography, penetration analysis, digital rights management and copy
protection, security and the law.
List of Text Books:
1. Network and System Security:John R. Vacca,2nd Edition (2010),ISBN 978-1-59749-
535-6 (1-7)
2. Computer Security: A Hands-on Approach, Wenliang Du, CreateSpace Independent
Publishing Platform; 1-st edition (2017)(1,3-7)
BHOPAL - 462003
3. Cryptography and Network Security: Principles and Practice, 6th Edition, William
Stallings, 2014, Pearson, ISBN13:9780133354690.(1-2)
1. Network Security: Private Communications in a Public World, M. Speciner, R. Perlman,
C. Kaufman, Prentice Hall, 2002.
2. Network Security, Firewalls And VPNs, J. Michael Stewart, Jones & Bartlett Learning,
2013, ISBN-10: 1284031675, ISBN-13: 978-1284031676.
3. The Network Security Test Lab: A Step-By-Step Guide, Michael Gregg, Dreamtech
Press, 2015, ISBN-10:8126558148, ISBN-13: 978-8126558148.
URLs:
https://nptel.ac.in/courses/106105031/
BHOPAL - 462003
Name of Program B.TECH Semester-VII Year IV
Name of Course Engineering Economics and IPR
Course Code HUM 451
Prerequisite:
1. Theoretical underpinning of the concepts related to Economics is crucial.
2. Technical knowledge and basic understanding of IPR laws is important.
1. Be in a position to link the concepts of Economics and Engineering
2. Explore the production and relate it with cash flow and payments
3. Interpret the benefits of IPR
4. Explore the Indian laws and acts regarding IPR
Description of Contents in Brief:
1.Introduction to Economics- Flow in an economy, Law of supply and demand, Concept
of Engineering Economics – Engineering efficiency, Economic efficiency, Scope of
engineering economics – Element of costs, Marginal cost, Marginal Revenue, Sunk cost,
Opportunity cost, Break-even analysis – V ratio, Elementary economic Analysis –
Material selection for product Design selection for a product, Process planning.
2.Methods of comparison of alternatives – present worth method (Revenue dominated
cash flow diagram), Future worth method (Revenue dominated cash flow diagram, cost
dominated cash flow diagram), Annual equivalent method (Revenue dominated cash
flow diagram, cost dominated cash flow diagram), rate of return method, Examples in all
the methods.
3. Make or buy decision, Value engineering – Function, aims, and Value engineering
procedure. Interest formulae and their applications –Time value of money, Single
payment compound amount factor, Single payment present worth factor, Equal payment
series sinking fund factor, Equal payment series payment Present worth factor- equal
payment series capital recovery factor – Uniform gradient series annual equivalent
factor, Effective interest rate, Examples in all the methods.
4. Basic concepts, characteristics and nature of Intellectual Property Right, IPR and
Economic Development, major international instrument relating to the protection of IP.
Meaning, Criteria for obtaining patents, Non Patentable inventions, procedure for
registration, term of Patent, Rights of patentee, basic concept of compulsory license and
government use of patent, infringement of patents and remedies in case of infringement,
Relevant Sections.
5. Meaning of mark, trademark, and categories of trademark: Certification Mark and
well known mark and Non-conventional marks, concepts of distinctiveness. Designs, GI
and other forms of IP, Designs: meaning design protection, concept of original design,
term of protection, relevant sections. Geographical Indication: meaning of GI, difference
between GI and Trade Mark, Concept of Authorized Use, Homonymous GI, Relevant
section,. Trade-secret: meaning, Criteria of Protection, relevant sections. Plant Variety,
Protection and Farmer’s Right: meaning, criteria of protection, relevant sections.
List of Text Books:
BHOPAL - 462003
1. A. Koutsoyiannis “Modern Microeconomics’. Macmillan Education.

2. Subbaram N.R. “Handbook of Indian Patent Law and Practice “, S. Viswanathan,
Printers and Publishers Pvt. Ltd.,1998
3. Stephen Ross and Randolph Westerfield and Jeffrey Jaffe and Bradford Jordan,
“Corporate Finance’, McGraw Hill.
1. Chan Spark, “Contemporary Engineering Economics”, Prentice Hall of India, 2011.
2. Donald. Newman, Jerome.P.Lavelle, “Engineering Economics and analysis” Egg. Press,
Texas, 2010.
3. Degarmo, E.P., Sullivan, W.G and Canada, J.R, “Engineering Economy”, Macmillan,
New York, 2011.
4. Zahid A khan: Engineering Economy, “Engineering Economy”, Dorling Kindersley,
2012
5. V.K. Ahuja , “ Law related to Intellectual Property Rights”. Publisher- Lexis-Nexi
6. R. Radhakrishnan and S. Balasubramanian, “Intellectual Property Rights- Texts and
Cases”, publisher- Excel Books India.
7. A. Koutsoyiannis “Modern Microeconomics’. Macmillan Education.
8. Stephen Ross and Randolph Westerfield and Jeffrey Jaffe and Bradford Jordan,
“Corporate Finance’, McGraw Hill.
URLs:
3. http://www.ipindia.nic.in/
BHOPAL - 462003
Name of Program B.Tech Semester-VII Year-IV
Name of Course Data Warehouse & Mining
Course Code CSE 411
Prerequisite:
1. Understanding of the basic database concepts such as schema. ER model, Structured Query
language.
2. Understanding the methodologies used for analysis of data.
Course Outcomes:On successful completion of the course, students should be able to
1. Adapt the principles of Data warehousing and Data Mining.
2. Perform classification and prediction of data.
3. Interpret the various Data preprocessing Methods
1. Data Warehousing and Business Analysis: - Data warehousing Components –Building a Data
warehouse –Data Warehouse Architecture – DBMS Schemas for Decision Support – Data
Extraction, Cleanup, and Transformation Tools –Metadata – reporting – Query tools and
Applications – Online Analytical Processing (OLAP) – OLAP and Multidimensional Data
Analysis.
2. Data Mining: - Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data
Integration and Transformation – Data Reduction – Data Discretization and Concept Hierarchy
Generation- Architecture of a typical Data Mining Systems- Classification of Data Mining
Systems. Association Rule Mining: - Efficient and Scalable Frequent Item set Mining Methods –
Mining Various Kinds of Association Rules – Association Mining to Correlation Analysis –
Constraint-Based Association Mining.
3. Classification and Prediction: - Issues Regarding Classification and Prediction – Classification

using Decision Tree. Bayesian Classification – Rule Based Classification – Classification by
Back propagation – Support Vector Machines – Associative Classification – Lazy Learners –
Other Classification Methods. Prediction – Accuracy and Error Measures – Evaluating the
Accuracy of a Classifier or Predictor – Ensemble Methods – Model Selection.
4. Cluster Analysis: - Types of Data in Cluster Analysis – A Categorization of Major Clustering

Methods – Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based
Methods – Model-Based Clustering Methods – Clustering High-Dimensional Data – Constraint-
Based Cluster Analysis – Outlier Analysis.
5. Mining Object, Spatial, Multimedia, Text and Web Data:

Multidimensional Analysis and Descriptive Mining of Complex Data Objects – Spatial Data
Mining – Multimedia Data Mining – Text Mining – Mining the World Wide Web.
BHOPAL - 462003
List of Text Books:
1. J. Hahn and Micheline Kamber - Data Mining: Concepts and Techniques {Ch. 1,2,3,4,5}
2. R.Kimball - DataWarehouse Toolkit (J.Wiley) {Ch. 1,2}
3. A.K.Pujari - Data mining (University Press) {Ch. 3,4,5}
1. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”, Tata McGraw –
Hill Edition, Tenth Reprint 2007.
2. K.P. Soman, Shyam Diwakar and V. Ajay “Insight into Data mining Theory and Practice”,
Easter Economy Edition, Prentice Hall of India, 2006.
3. G. K. Gupta “Introduction to Data Mining with Case Studies”, Easter Economy Edition, Prentice
Hall of India, 2006
URLs:
1. An Overview of Data Warehouse, OLAP and Data Mining Technology:

https://link.springer.com/chapter/10.1007/978-0-387-47653-7_1
2. Introduction to Data Warehousing Concepts:

https://docs.oracle.com/database/121/DWHSG/concept.htm#DWHSG9282
BHOPAL - 462003
Name of Program BTech Semester-VI Year-III
Name of Course Data Warehouse & Mining lab
Course Code CSE 412
Prerequisite:
1. Knowledge of supervised and unsupervised machine learning algorithms.
2. Theoretical knowledge of data mining and data warehousing concepts.
3. Understanding of probability theory, Statistical methods.
1. Demonstrate the data mining concepts such as classification, clustering etc. in real-world data
sets.
2. Demonstrate proficiency in applying the scientific method to models of machine learning.
3. Demonstrate awareness and a fundamental understanding of various applications of AI

techniques in intelligent agents, expert systems, artificial neural networks and other machine
learning models
1. Build Data Warehouse and Explore WEKA
2. Perform data preprocessing tasks and association rule mining on data sets.
3. Perform Classification, Clustering, Regression etc on data sets
4. Search: Uninformed search, A* search, adversarial search, local search
5. Planning: Markov Decision Problems, Value Iteration and Policy Iteration
6. Probabilistic reasoning: Bayes nets, conditional independence, exact and approximate inference
7. Uncertainty: Formal and Empirical approaches including Bayesian Theory, Fuzzy Logic, Non-
monotonic Logic, Default Reasoning
8. To do projects based on various AI applications: examples self-driving cars, face recognition,

web search, industrial robots, missile guidance, and tumor detection etc. To solve l complex real
world problems with applications of intelligence (AI).
List of Text Books:
1. Data Mining: Practical Machine Learning Tools and Techniques by Ian H. Witten, Eibe Frank,
Mark A. Hall
BHOPAL - 462003
2. Introduction to data mining by Vipin Kumar, Pang-Ning Tan, Michael Steinbach
3. Artificial Intelligence: A Modern Approach, by Stuart Russell and Peter Norvig
4. The Elements of Statistical Learning by Trevor Hastie, Robert Tibshirani, and Jerome Friedman
1. Data Mining: Concepts and Techniques by Jiawei Han
2. Data Mining: Concepts, Models, Methods and Algorithms by Mehmed Kantardzic
3. Principles of Artificial Intelligence by N.J. Nilsson
4. Automated Planning: Theory & Practice by Malik Ghallab, Dana Nau, Paolo Traverso.
URLs:
1. https://mrcet.com/pdf/Lab%20Manuals/CSE%20IV-I%20SEM.pdf
2. https://portal.iitb.ac.in/asc/Courses/crsedetail.jsp
3. https://portal.iitb.ac.in/asc/Courses/crsedetail.jsp
BHOPAL - 462003
Name of Program B.Tech
Name of Course Advanced Computer Architecture
Course Code CSE 351
Core / Elective / Other Group 1(A) & 2 (A) Department Elective

Prerequisite:
Course Outcomes: At the end of the course, students should be able to
1. Evaluate Performance of different architectures with respect to various parameters.
2. Illustrate parallel programming concepts.
3. Compare and contrast the parallel architectures.
4. Analyze performance of different Instruction-Level Parallelism techniques.
5. Identify cache and memory related issues in multi-processors.
1. Fundamentals of Computer Design: Review of Fundamentals of CPU, Memory and IO,
Trends in technology, power, energy and cost, Dependability, Performance Evaluation
2. Instruction Set Principles and Examples: Introduction, Classifying Instruction Set
Architectures, Memory Addressing, Type and Size of Operands, Operations in the
Instruction Set, Instructions for Control Flow, Encoding an Instruction Set, Crosscutting
Issues: The Role of Compilers, Putting It All Together: The MIPS Architecture
3. PIPELINING: Introduction; Pipeline hazards; Implementation of pipeline; What makes
pipelining hard to implement?
4. Instruction Level Parallelism: ILP concepts, Pipelining overview, Compiler Techniques for
Exposing ILP, Dynamic Branch Prediction, Dynamic Scheduling, Multiple instruction
Issue, Hardware Based Speculation, Static scheduling, Multi-threading, Limitations of ILP,
Case Studies.
5. Memory Hierarchy Design: Cache Performance, Reducing Cache Miss Penalty and Miss
Rate, Reducing Hit Time, Main Memory and Performance, Memory Technology. Types of
Storage Devices, Buses, RAID, Reliability, Availability and Dependability, I/O
Performance measures.
List of Text Books:
1. John L. Hennessy and David A. Patterson, “Computer Architecture: A quantitative
approach”, 5th edition, Morgan Kaufmann Elseveir, 2013
1. Kai Hwang and Faye Briggs, “Computer Architecture and Parallel Processing”, Mc Graw-
Hill International Edition, 2000.
2. Kai Hwang and Naresh Jotwani, “Advanced Computer Architecture (SIE): Parallelism,
Scalability, Programmability”, McGraw Hill Education 3/e. 2015
3. Sima D, Fountain T and Kacsuk P, “Advanced Computer Architectures: A Design
Space Approach”, Addison Wesley, 2000.
URLs:
1. Text Book URL:
http://acs.pub.ro/~cpop/SMPA/Computer%20Architecture%20A%20Quantitative%20Appr
oach%20(5th%20edition).pdf
BHOPAL - 462003
2. NPTEL Course: https://nptel.ac.in/courses/106/103/106103206/

BHOPAL - 462003
Name of Course Computer Graphics
Course Code CSE 352
Core / Elective / Other Group 1(A) & 2 (A) Department Elective
Prerequisite:
1. Linear Algebra, Calculus
2. Programming skills in C, C++
3. Matrices, Vectors, Polynomials
1. Analyze the development of computer graphics technologies.
2. Apply various operations on computer graphics.
3. Create to interactive computer graphics using OpenGL.
4. Perform geometric transformations on graphics objects.
1. Introduction to Computer Graphics
Overview of Computer Graphics, Computer Graphics Application and Software,
Description of some graphics devices, Input Devices for Operator Interaction, Active
and Passive Graphics Devices
2. Two-Dimensional Transformations
Transformations and Matrices, Transformation Conventions, 2D Transformations,
Homogeneous Coordinates and Matrix Representation of 2D Transformations,
Translations and Homogeneous Coordinates
3. Three-Dimensional Transformations
Introduction, Three-Dimensional Scaling, Three-Dimensional Shearing, Three-
Dimensional Rotation, Three-Dimensional Reflection, Three-Dimensional Translation,
Multiple Transformation
4. Plane Curves and Surfaces
Curve Representation, Nonparametric Curves, Parametric Curves, Parametric
Representation of a Circle, Parametric Representation of an Ellipse, Parametric
Representation of a Parabola, Parametric Representation of a Hyperbola
5. Surfaces
Quadric Surfaces, Bezier Surfaces & spline B-spline surfaces.
6. Illumination & Shading
Illumination Models for Polygons, Reflectance properties of surfaces, Ambient.
Introduction, Various models of shading.
List of Text Books:

1. Interactive Computer Graphics: A Top-Down Approach with Shader-Based OpenGL,
Sixth Edition, Edward Angel, Dave Shreiner, Pearson Education, 2011.
2. Computer Graphics using open GL, 3rd ed., F. S. Hill Jr. and S. M. Kelley, Pearson
Education Low Price Indian Edition, 2006.
3. Fundamentals of Computer Graphics, 3rd ed., Peter Shirley, A K Peters, 2009
BHOPAL - 462003

1. OpenGL Programming Guide. Mason Woo, Jackie Neider, Tom Davis, Dave Shreiner.
Third edition, OpenGL Version 1.2, Addison-Wesley, 1999.
2. Hughes, Van Dam, et al. Computer Graphics Principles and Practice 3e, Pearson, 2014
3. Principles of Interactive Computer Graphics William M. Newman.
URLs:
1. https://www.javatpoint.com/computer-graphics-tutorial
2. https://www.explainthatstuff.com/computer-graphics.html
3. https://www.geeksforgeeks.org/computer-graphics-2/
4. http://ecomputernotes.com/computer-graphics/basic-of-computer-
graphics/introduction-to-computer-graphics
BHOPAL - 462003
Name of Course UNIX Internals & Shell Programming

Course Code CSE 353
Core / Elective / Other Group 1(A)&2(A) Department Elective
Prerequisite:
1. Exposure to Operating Systems Concepts
2. Basics of C/C++ programming
1. Perform text data processing using Unix commands and filters.
2. Implement system calls for file system/ process management.
3. Update kernel modules.
1. INTRODUCTION: History of UNIX, Features & benefits, File System, commonly
used commands, Vi Editor, concepts of pipes and filters, basics of Shell scripting.
2. SHELL SCRIPTS & AWK PROGRAMMING: Interactive Scripts, Special
variables, Pattern matching, Basic Regular expression, Extended Regular Expression,
Awk command/scrip, arithmetic with Awk script.
3. OVERVIEW OF UNIX ARCHITECTURE: Buffer cache architecture, structure of
the Buffer pool, Kernel, Operating system concepts, Networking concepts.
4. FILES and PROCESS MANAGEMENT: INODES, INODE assignment to a New
File, File System and related system Calls, Process Creation/Termination, Process
States and Transitions, Inter-process communication, Process related system calls.
5. DEVICE DRIVER AND KERNEL MODULE: Introduction to device drivers,
Compiling and Loading kernel modules, Building and Running Modules.
List of Text Books:
1. The Design of Unix Operating System, Maurice J. Bach, Pearson Education.
2. Unix Concepts and Applications, Sumitabh Das, McGraw-Hill.
3. Linux: The Textbook, Syed Mansoor Sarwar, Robert Koretsky, Syed Aqeel Sarwar,
Addison Wesley.
1. The UNIX Programming Environment, B.W. Kernighan, R. Pike, Prentice Hall of
India.
2. Linux Device Drivers, Alessandro Rubini, Jonathan Corbet, O'Reilly.
3. Unix in a Nutshell, Arnold Robbins, O'Reilly.
URLs:
1. https://ubuntu.com/tutorials
2. https://www.hpe.com/global/softwarereleases/releases-
media2/HPEredesign/pages/overview.html
3. https://www.ibm.com/it-infrastructure/power/os/aix
BHOPAL - 462003
Name of Course Randomized Algorithms

Course Code CSE 354
Core / Elective / Other Group 1(A) & 2(A) Department Elective
Prerequisite:
1. Data Structures
2. Fundamentals of Algorithm Design & Analysis
1. Apply general principles lies at the heart of almost all randomized algorithms.
2. Apply concept of load balancing.
3. Interpret the concept of rapidly mixing Markov’s Chains.
13. Introduction to Randomized Algorithms
14. Review of probability theory
15. Moments and deviations
16. Markov’s Chains and Random Walks
17. Number Theoretic Algorithms
18. Graph Algorithms
19. Approximate Counting
20. Geometric Algorithms and Linear Programming
21. Randomized Data Structures
22. Computational Complexities
List of Text Books:
1. Randomized Algorithms, Rajeev Motwani and Prabhakar Raghavan, Cambridge
University Press
1. Probability and Computing, Michael Mitzenmacher and Eli Upfal, , Cambridge
University Press
URLs:
BHOPAL - 462003
Name of Program B.Tech.

Name of Course Object-Oriented Design & Modelling
Course Code CSE 355
Core / Elective / Other Group 1 (A) & 2 (A) Department Elective
Prerequisite:
Data Structures
1. Analyze problems using object-oriented analysis and design techniques
2. Apply aspects of object-oriented analysis and design in developing software.
3. Evaluate the fundamental principles through advanced concepts of analysis and design
using UML.
Object oriented programming concepts, Object Orientation, OMT Methodology, Object
and Class, Link and Association, Generalization, Aggregation, Multiple Inheritance,
Packages. Object Meta modeling, Functional Modeling. Analysis: Object Model, Data
Dictionary, Dynamic Model, Functional Model, Interaction Modeling-Use case model,
Sequence model, and Activity models, State Charts, System Design, Object Design,
Implementation-Implementation using programming language and Database, UML
Modeling.
List of Text Books:
1. Object Oriented Modeling and Design with UML by M. Blaha, J. Rumbaugh(2nd Edition),
Pearson Education,2005
2. Object-Oriented Analysis and Design with Applications, G. Booch, R. A.
Maksimchuk, M. W. Engle, B. J. Young, J. Conallen, K. A. Houston (3rd Edition), Pearson
Education, Addison-Wesley Professional, s2007.
3. Object-Oriented Analysis and Design with Applications, Booch, Jacobson, Rambaugh (3rd
edition) Pearson Education, Reprint 2013.
1. Object-Oriented Software Engineering: Practical Software Development Using UML and
Java by Timothy Christian Lethbridge , Robert Laganiere.
2. UML- A Beginner’s Guide by Jason T. Roff Tata McGraw Hill
3. Object Oriented Soft engineering using UML, Patterns, and Java by B. BRUEGGE and
Allen H. DUTOIT.
URLs:
1. https://www.youtube.com/watch?v=WpJ_yiwbGyk&list=PLJ5C_6qdAvBHslIkD7JB7kB
dgv1SeXy3P
2. https://www.youtube.com/watch?v=Wlrw9uMoOTQ&list=PL-
AyYXNLDtPZ37yxlhz1CCfBmHlHOfaVb
BHOPAL - 462003
Name of Course Software Testing

Course Code CSE 356
Core / Elective / Other Group 1 (A) & 2(A) Department Elective
Prerequisite:
1. Basic requirements would include knowledge of Programming languages.
2. Database concepts, Project life cycle, Testing concepts, testing types(unit testing,
integration testing, system testing, reliability testing, etc), Test plan idea,
3. Ability to analyze requirements, Documentation skill and Testing tools.
1. Design test cases suitable for software development in different domains.
2. Identify suitable tests to be carried out.
3. Prepare test planning based on the document.
4. Document test plans and test cases designed.
1. Testing as an Engineering Activity – Testing as a Process – Testing axioms – Basic
definitions – Software Testing Principles – The Tester’s Role in a Software
Development Organization – Origins of Defects – Cost of defects – Defect Classes –
The Defect Repository and Test Design – Defect Examples – Developer/Tester Support
of Developing a Defect Repository – Defect Prevention strategies.
2. Test case Design Strategies – Using Black Bod Approach to Test Case Design –
Random Testing – Requirements based testing – Boundary Value Analysis –
Equivalence Class Partitioning – Statebased testing – Cause-effect graphing –
Compatibility testing – user documentation testing – domain testing – Using White Box
Approach to Test design – Test Adequacy Criteria – static testing vs. structural testing –
code functional testing – Coverage and Control Flow Graphs – Covering Code Logic –
Paths – code complexity testing – Evaluating Test Adequacy Criteria.
3. The need for Levers of Testing – Unit Test – Unit Test Planning – Designing the Unit
Tests – The Test Harness – Running the Unit tests and Recording results – Integration
tests – Designing Integration Tests – Integration Test Planning – Scenario testing –
Defect bash elimination System Testing – Acceptance testing – Performance testing –
Regression Testing – Internationalization testing – Ad-hoc testing – Alpha, Beta Tests –
Testing OO systems – Usability and Accessibility testing – Configuration testing –
Compatibility testing – Testing the documentation – Website testing.
4. People and organizational issues in testing – Organization structures for testing teams –
testing services – Test Planning – Test Plan Components – Test Plan Attachments –
Locating Test Items – test management – test process – Reporting Test Results – The
role of three groups in Test Planning and Policy Development – Introducing the test
specialist – Skills needed by a test specialist – Building a Testing Group.
5. Software test automation – skill needed for automation – scope of automation – design
and architecture for automation – requirements for a test tool – challenges in
automation – Test metrics and measurements – project, progress and productivity
metrics.
List of Text Books:
1. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing – Principles and
Practices”, Pearson Education, 2006.
BHOPAL - 462003
2. Ron Patton, “Software Testing”, Second Edition, Sams Publishing, Pearson Education,
2007.
"The Art of Software Testing" Book by Glenford Myers ,Wiley 2011 Wiley
publication.
BHOPAL - 462003
Name of Program B. Tech.
Name of Course Advanced Data Structures

Course Code CSE 357
Core / Elective / Other Group 1A & 2A Department Elective
Prerequisite:
1. Data Structures and Algorithms
2. C/C++ Programming
1. Evaluate the application specific advanced data structures and analyze their amortized
complexity.
2. Use the proper data structure to reduce the running time of different applications.

Amortized complexity, Double-ended priority queues, Leftist trees, Binomial heaps,
Fibonacci heaps, Dictionaries, Optimal Binary Search Trees, Red-black trees, Splay
Trees, Binary Tries, Compressed Binary Tries, Suffix Trees, Bloom Filters, Interval
Trees, Priority Search Trees, Skip lists, Treaps, Selection trees & k-way merging,
String matching algorithms, disjoint set ADT, Network flow algorithms, Augmenting
data structures.
List of Text Books:
1. Data Structures, Algorithms and Applications in C++ by Sartaj Sahani University Press
2. Introduction to algorithms Cormen and Rivest
1. Fundamentals of data structures in C++, by E. Horowitz, S. Sahni, and D. Mehta
2. Handbook of Data Structures and Applications by Dinesh P. Mehta, Sartaj Sahni
3. Randomized algorithms R.Motwani and P. Raghavan
4. Data Structures and Algorithm Analysis in C++. By Mark Allen Weiss - Addison
Wesley
URLs:
1. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-851-
advanced-data-structures-spring-2012/
2. https://courses.csail.mit.edu/6.851/
3. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html
BHOPAL - 462003
Name of Course Data Science
Course Code CSE 358
Core / Elective / Other Group 1(A)& 2(A) Department Elective
Prerequisite:
1. Probability Theory and Distributions
2. Statistics
3. Linear Algebra
1. Apply data science techniques to the organization’s data management challenges.
2. Interpret analytical models to make appropriate business decisions.
1. The foundations of data science, statistics, Data Collection, Data Preprocessing and Data
modelling.
2. Analyze big data and make data-driven predictions through probabilistic modeling and
statistical inference.
3. Finishing this MicroMasters program will prepare you for job titles such as: Data
Scientist, Data Analyst, Business Intelligence Analyst, Systems Analyst, Data Engineer
1. James, G., Witten, D., Hastie, T., Tibshirani, R. An introduction to statistical learning with
applications in Springer, 2013.
2. Hastie, T., Tibshirani, R., Friedman, J. The elements of statistical learning 2nd edition
Springer.
3. Han, J., Kamber, M., Pei, J. Data mining concepts and techniques. Morgan Kaufmann,
2011.
URLs:
1. https://www.edx.org/micromasters/mitx-statistics-and-data
science?source=aw&awc=6798_1584454842_ddf569d7fa91a7ea267eb38042b11800&ut
m_source=aw&utm_medium=affiliate_partner&utm_content=text-
link&utm_term=315645_LearnDataSci
2. http://cs109.github.io/2015/pages/videos.html
BHOPAL - 462003
Name of Course Parallel Algorithms
Course Code CSE 451
Core / Elective / Other Group 3(A),4(A),5(A),6(A)Department Elective
Prerequisite:
1. Data Structure
2. Analysis and Design of Algorithms
3. Operating systems
1. Interpret the parallel architecture.
2. Implement parallel algorithms for any given problem.
3. Calculate the speed-up, cost and efficiency of parallel algorithm.
1. Introduction to parallel algorithm, data parallel and control parallel approach
2. Models of parallel computation, PRAM Model, Parallel Complexity, Elementary
Parallel Algorithms, Matrix Multiplication
3. Searching, sorting, and graph algorithms.
4. Introduction to distributed algorithms, synchronous algorithms network model, leader
election algorithm, minimum spanning tree, shortest path.
5. Distributed consensus k agreement problem, two phase commit, three phase commit,
mutual exclusion algorithms, and applications of distributed algorithm.
List of Text Books:
1. Parallel algorithms Michael. J. Quinn
2. Michael J Quinn, Parallel Computing, TMH
3. Joseph Jaja, An Introduction to Parallel Algorithms, Addison Wesley
1. Implicit Parallel Programming in PH
2. Distributed algorithm Nancy Lynch
3. Guy Blelloch, Prefix Sums and Their Applications, in Synthesis of Parallel Algorithms,
edited by John H Reif, Morgan Kaufmann, 1991.
4. Alan Gibbons and Wojciech Rytter, Efficient Parallel Algorithms, Cambridge
University Press, 1989.
5. Mark Harris, Shubhabrata Sengupta, and John Owens, Parallel Prefix Sum (Scan) with
CUDA, in GPU Gems 3, edited by Hubert Nguyen, 2007.
URLs:
1. http://www.toves.org/books/distalg/
2. https://www.comp.nus.edu.sg/~rahul/allfiles/cs6234-16-pds.pdf
BHOPAL - 462003
Name of Program B-Tech
Name of Course Cryptography
Course Code
CSE 452
Core / Elective / Other Group 3(A), 4(A),5(A),6(A)Department Elective
Prerequisite:
1. Algorithms
2 Discrete Mathematics, Computer and Network Security
1. Analyze different cryptosystems.
2. Identify the differences between secret key and public key cryptosystems.
3. Identify the different approaches to quantify secrecy.
Introduction to cryptography, Security Attacks, Mechanism and Services,
Cryptosystems,Conventional encryption model and techniques, classical encryption
techniques – substitution ciphers and transposition ciphers – Hill Cipher, Vigenere, Playfair,
Caesar, Multiplicative, Enigma machine, cryptanalysis, stream and block ciphers. Block
ciphers principals, feistel and non-feistel structure, DES, 3DES, AES, IDEA encryption and
decryption, key distribution. Finite field: Introduction to graph, ring, and field, modular
arithmetic, Fermat’s and Euler’s theorem, Euclid’s algorithm, Chinese remainder theorem,
Comparison of symmetric and public-key cryptographic systems, Modern Trend in
asymmetric-key cryptography – Elliptic curve based cryptography, Principals of public-key
cryptosystems, RSA algorithm, Diffie-Hellman key exchange algorithm, Message
Authentication and Hash Function: security of hash functions and MACS, message digest,
MD5, SHA, RIPEMD, HMAC
List of Text Books:
1. Cryptography and Network Security: Principles and Practice, William Stallings
1. Cryptography Theory and Practice, Douglas R. Stinson
2. Applied Cryptography: Protocols, Algorithms, Bruce Schneier
BHOPAL - 462003

Name of Course Ethical Hacking
Course Code CSE 453
Core / Elective / Other Group 3(A), 4(A),5(A),6(A) Department Elective
Prerequisite:
1. Basic Concept of Web programming, Operating System and Networking
2. Good problem-solving skills and analytical skills
1. Identify the vulnerabilities and their causes.
2. Analyze ethical hacking.
3. Exploit the vulnerabilities related to computer system and networks using state of the
art tools and technologies.
1. Ethical hacking Overview
- This covers the definition of ethical hacking and describes what is legal and
what is not legal
2. TCP/IP Concepts Review, Network and Computer Attacks, Network enumeration and
Foot printing- DNS query, Whois query, OS finger printing, Banner grabbing
- This provides overview of TCP/IP and numbering system along with IP
Addressing and intruder attacks.
3. Programming for security professionals- Web application vulnerabilities, Buffer
overflow attack, Session hijacking, Code injection attacks- Cross Site Scripting attack,
SQL injection attack
- This cover understanding of practical extraction of programming vulnerabilities
4. Password hacking, windows hacking, network hacking, anonymity and email hacking
- This covers practical exposures to password hacking related to windows and
email and also explains anonymity and network vulnerabilities.
5. Web servers hacking, session hijacking, Surveillance, desktop and server OS
Vulnerabilities, Database attacks, cryptography, Hacking wireless networks network
protection systems, Trojan and backdoor applications, legal resources, virtualization.
- This describes wireless network standards, authentication and wardriving,
firewalls, snort rules, honeypots and intrusion detection systems (IDS), methods
of surveillance, various vulnerabilities related to OS and various web based and
DB attacks, and explains different types of malware and its applications
List of Text Books:
1. Ethical Hacking and Network Defense. Michael T. Simpson, Kent Backman, James
Corley (1-3, 5)
2. Hacking Exposed6 – Network Security secrets and solutions, S.McClure, J.Scambray,
G.Kurtz, McGrawHill (4)
1. CEH, Review Guide, Kimberly Graves, Wiley Publication
2. Network Security Hacks, Andrew Lockhart, O’Reilly Publication
URLs:
BHOPAL - 462003
Name of Course Big data Technologies

Course Code CSE 454
Prerequisite:
1. A strong mathematical background in Probability and Statistics.
2. Proficiency with algorithms.
3. Programming skills in C, Python, R, Core Java,etc.
1. Identify a meaningful pattern in data.
2. Handle large scale analytics projects from various domains.
3. Develop intelligent decision support systems.
1. Insight into data analytics and statistical analysis of various formats of data.
2. Outlines various frameworks to handle big data.
3. Apache Hadoop Framework for batch , Apache Spark for stream data processing
4. Apache storm and Kafka briefing.
1. Tom White, “HADOOP: The definitive Guide”, O Reilly.
2. Learning Spark: Lightning-Fast Big Data Analysis Paperback by Holden Karau
3. Boris lublinsky, Kevin t. Smith, AlexeyYakubovich, “Professional Hadoop Solutions”, Wiley,
ISBN: 9788126551071, 2015.
URLs:
1. https://mitxpro.mit.edu/courses/course-
v1:MITxPRO+DSx+2T2019/about?utm_medium=website&utm_source=stats&utm_campaign=ds-
su19&utm_content=event-calendar
BHOPAL - 462003
Name of Course Internet of Things

Course Code CSE 455
Prerequisite:
1. Programming Languages
1. State the technology and standards relating to IoTs.
2. Develop prototypes for the applications of IoT in real time scenarios.
3. Analyze IoT data.
1. Introduction of IoT, IoT Building Blocks
2. Sensors and Actuators
3. Microcontrollers and IoT Boards
4. Networks for IoT
5. Edge/Fog Computing, Cloud Computing
6. Introduction to IoT Data Analytics and Machine Learning
7. Various Applications of IoT
1. "The Internet of Things: Enabling Technologies, Platforms, and Use Cases", by
Pethuru Raj and Anupama C. Raman (CRC Press)
2. "Internet of Things: A Hands-on Approach", by Arshdeep Bahga and Vijay Madisetti
(Universities Press)
URLs:
Name of Course Web Search & IR

BHOPAL - 462003
Course Code CSE 456

Prerequisite:
1. Data Mining
2. Basic probability and statistics
1. Develop web crawling techniques.
2. Explore knowledge of data structures in indexing methods of information retrieval
Systems.
3. Develop clustering and searching techniques.
4. Recognize parallel and distributed information retrieval system.
1. Information retrieval model, Basic Information Retrieval model (Boolean and vector-
space retrieval models; ranked retrieval; text-similarity metrics; TF-IDF (term
frequency/inverse document frequency) weighting; cosine similarity.)
2. Document Representation, Simple tokenizing, stop-word removal, stemming.
3. Performance metrics: recall, precision, and F-measure; Evaluations on benchmark text
collections.
4. Query expansion, Query languages and query operation,
5. Web Search, Web crawling, Link analysis, Ontology, domain specific search
6. Text Categorization & Clustering: Categorization algorithms: Rocchio, nearest
neighbor, and naive Bayes. Applications to information filtering and organization.
Clustering algorithms: agglomerative clustering; k-means; expectation maximization
(EM). Applications to information filtering; organization; and relevance feedback.
7. Collaborative filtering and content-based recommendation of documents and products.
8. Parallel and distributed information retrieval, Text and multimedia languages, Social
networks.
List of Text Books:
1. Introduction to Information Retrieval, Cambridge University Press by C. D. Manning,
P. Raghavan and H. Schütze
2. Mining the webDiscovering knowledge from hypertext data by S Chakrabarti

1. Search Engines: Information Retrieval in Practice, Addison-Wesley by B. Croft, D.
Metzler and T. Strohman
2. Modern Information Retrieval, AddisonWesley by R. Baeza-Yates and B. Ribeiro-Neto

BHOPAL - 462003
Name of Course TCP/IP and Web Technology

Course Code CSE 457
Prerequisite:
1. Basic Concept of Computer networks
2. Good problem-solving skills and analytical skills
3. Basic Concept of Web programming
1. Explore computer network basics, network architecture, TCP/IP and OSI reference
models.
2. Identify various techniques and modes of transmission.
3. Describe data link protocols, multi-channel access protocols and IEEE 802standards for
LAN.
4. Classify routing, congestion and IPV4 addressing scheme.
Introduction to TCP/IP network model, IP: Internet Protocol- IP header, IP Routing
Principal,IP Fragmentation, Checksum, IP options. Subnetting, Subnet masks,
Supernetting, CIDRDirectly/indirectly connected machines, IP addresses. Ethernet,
framing, ARP, ARP Cache,ARP Packet Format, RARP, Serial Links, Bridges,
Spanning Tree algorithm, ICMP- ICMP
message type, ICMP address mask request and reply, ICMP Query and Error
message,determining the path MTU.RARP and ARP. Transport layer protocols: TCP
and UDP: TCPand UDP header, Connection Establishment and Termination, TCP State
Transition diagram,Segmentation, Maximum Segment Size. ISN and sequence
numbers. TCP data transfer --sliding windows, slow start, congestion avoidance, fast
retransmit, fast recovery. TCP –Timeout and Retransmission. Sockets. Web
Technology: DNS, IGMP, FTP, POP, SMTP,HTTP, HTML, XML Basic concept of
client/server computing.
List of Text Books:
1. W Richard Stevens, TCP/IP Illustrated Vol. I: The Protocols, Pearson
Education Asia, 2000.
1. W Richard Stevens, TCP/IP Illustrated Vol. III: TCP for Transaction, HTTP, NNTP,
and the UNIX Domain Protocols, Pearson Education Asia,2000.
URLs:
1. https://docs.oracle.com/cd/E23823_01/html/816-4554/ipov-6.html
BHOPAL - 462003
Name of Course Computer Vision

Course Code CSE 458
Prerequisite:
1. Good Knowledge of digital Image Processing, Matlab programing
2. Linear algebra, Probabilities and Statistics
3. (Computer graphics), (Mathematical Methods for Visual Computing), or equivalent
courses from other departments. I will expect you to be familiar with the Fourier transform
(or be willing to learn it quickly), and basic linear algebra (eigen-analysis, matrix inverse)
1. Recognize the theoretical and practical aspects of computing with images.
2. Describe the foundation of image formation and image analysis.
3. Familiar with the major technical approaches involved in computer vision.
3. Explore advanced concepts related to objects and scene categorization from images.
4. Build computer vision applications.
1. Digital Image Formation and low-level processing:
Overview and State-of-the-art, Fundamentals of Image Formation, Transformation:

Orthogonal, Euclidean, Affine, Projective, etc. Fourier Transform, Convolution and
Filtering, Image Enhancement, Restoration, Histogram Processing.
2. Depth estimation and Multi-camera views, Multiple View Geometry
Perspective, Binocular Stereopsis: Camera and Epipolar Geometry; Homography,

Rectification, DLT, RANSAC, 3-D reconstruction framework; Auto-calibration.
3. Feature Extraction
Edges - Canny, LOG, DOG; Line detectors (Hough Transform), Corners - Harris and
Hessian Affine, Orientation Histogram, SIFT, SURF, HOG, GLOH, Scale-Space Analysis-
Image Pyramids and Gaussian derivative filters, Gabor Filters and DWT.
4. Image Segmentation
Region Growing, Edge Based approaches to segmentation, Graph-Cut, Mean-Shift, MRFs,

Texture Segmentation; Object detection.
5. Pattern Analysis
Clustering: K-Means, K-Medoids , Mixture of Gaussians, Classification: Discriminant

Function, Supervised, Un-supervised, Semi-supervised; Classifiers: Bayes, KNN, ANN
models; Dimensionality Reduction: PCA, LDA, ICA; Non-parametric methods.
6. Motion Analysis
Background Subtraction and Modeling, Optical Flow, KLT, Spatio-Temporal Analysis,

BHOPAL - 462003
Dynamic Stereo; Motion parameter estimation.

7. Shape from X
Photometric Stereo; Use of Surface Smoothness Constraint; Shape from Texture, color,
motion and edges.
List of Text Books:
1. Digital Image Processing using MATLAB, By: Rafael C. Gonzalez, Richard Eugene
Woods, 2nd Edition, Tata McGraw-Hill Education 2010
2. Richard Szeliski, Computer Vision: Algorithms and Applications, Springer-Verlag
London Limited 2011.
3. Computer Vision: A Modern Approach, D. A. Forsyth, J. Ponce, Pearson Education,
2003.
1. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer Vision,
Second Edition, Cambridge University Press, March 2004.
2. K. Fukunaga; Introduction to Statistical Pattern Recognition, Second Edition, Academic
Press, Morgan Kaufmann, 1990.
3. R.C. Gonzalez and R.E. Woods, Digital Image Processing, Addison- Wesley, 1992.
URLs:
2. https://towardsdatascience.com/computer-vision-for-beginners-part-1-7cca775f58ef
3. https://www.tutorialspoint.com/artificial_intelligence_with_python/artificial_intelligence_
with_python_computer_vision.htm
4. https://www.mathworks.com/products/matlab.html
BHOPAL - 462003
Name of Course Mobile Computing

Course Code CSE 459
Prerequisite:
Basic of Computer Networks
Analyze different types of mobile communications.
Introduction to Mobile Communications and Computing, novel applications, GSM:
Mobileservices, System architecture, and new data services. (Wireless) Medium Access
Control:Motivation for a specialized MAC, DMA, FDMA, TDMA, CDMA. Mobile
NetworkLayer: Mobile IP, IP packet delivery, Dynamic Host Configuration Protocol
(DHCP). MobileTransport Layer : Traditional TCP, Indirect TCP, Snooping TCP,
Mobile TCP, Fast retransmit/fast recovery, Transmission/time-out freezing, Selective
retransmission,Transaction oriented TCP. Database Issues: client server computing
with adaptation,transactional models, and quality of service issues. Mobile Ad hoc
Networks (MANETs):
Properties of a MANET, spectrum of MANET applications, routing and various
routingalgorithms, security in MANETs. Protocols and Tools: Wireless Application
Protocol-WAP.Bluetooth and J2ME.
List of Text Books:
Mobile Communications Jochen Schiller
1. Handbook of Wireless Networks and Mobile Computing Stojmenovic and Cacute
2. Fundamentals of Mobile and Pervasive Computing Adelstein, Frank, Gupta, Sandeep
KS, Richard III, Golden, Schwiebert, Loren
BHOPAL - 462003
Name of B.Tech
Program
Name of Course Information Theory & Coding
Course Code CSE 460
Core / Elective / Group 3(A), 4(A),5(A),6(A)Department Elective

Other
Prerequisite:
1. Computer Networks
2. Digital Communication
1. State the basic principles and applications of information theory.
2. Develop an understanding of how information is measured in terms of probability and
entropy, and the relationships among different entropies.
3. Generalize the concept of discrete channels and measures of information to their
continuous forms.
4. Evaluate the concepts of source coding and compression techniques.
Information and entropy information measures, Joint Entropy, Conditional Entropy, Mutual
Information, Relationship between Different Entropies Shannon’s concept of Channel
Capacity and Channel Redundancy Types of Channels: Symmetric channel, Binary
Symmetric Channel, Cascaded Channels, Binary Erasure Channel, Continuous Channel.
Theorem for discrete memory less channel. Information capacity theorem.
Source coding, Coding Efficiency, Shannon Fano Coding. Error detecting and error
correcting codes, Types of codes: block codes, hamming and Lee metrics, linear block codes,
parity check codes, cyclic code. Convolutional codes. Compression: loss less and lossy
compression, Huffman Coding, LZW algorithm, Binary image compression schemes, Video
image compression techniques.
List of Text Books:
1. Communication Systems: Analog and Digital by Singh and Sapre TMH Publications
2. Multimedia Communications by Fred Halsall, Pearson Publications.
1. Information Theory, Coding and Crptography, by R Bose, TMH 2007
2. Multimedia system Design by Prabhat K Andleigh and Kiran Thakrar PHI
Publications.
BHOPAL - 462003
Name of Course Distributed System

Course Code CSE 461
Prerequisite:
1. Computer Networks
2. Basic Programming
1. Use various architectures in designing distributed systems.
2. Build distributed systems using various inter-process communication techniques.
3. Attain the knowledge of different distributed algorithms.
Distributed Computing: Introduction, Types, and Various system models.
Communication and Processes: RPC, RMI and others, Client and Server threads. Clock
Synchronization: Types of clock and their synchronization, Introduction to distributed
mutual exclusion, Election of a process, Consensus and related problems; Consistency:
Various types of consistency, Consistency protocols, Fault tolerance: Introduction to
fault tolerance, Process resilience; Protection and security in distributed systems:
Various types of security techniques, Cryptography; Examples of distributed systems:
Distributed file systems, Distributed shared memory and others.
List of Text Books:
Distributed Systems Principles and paradigms Andrew S. Tanenbaum and Maarten
Distributed systems, concepts and design, George Colouris, Jean Dollimore and Tim
Kindberg.
BHOPAL - 462003
Name of Course High Performance Computing

Course Code CSE 462
Core / Elective / Other Group 3(A), 4(A),5(A),6(A) Department Elective
Prerequisite:
1. Basic Programming

1. On successful completion of the course, students should be able to apply different
parallel programming languages.

Overview of parallel system organization; Introduction to message passing and MPI
programming; Embarrassingly parallel problems; Problem decomposition, graph
partitioning and load balancing; Introduction to shared memory and OpenMP
programming; Examples of scientific computing; Parallel Languages.
List of Text Books:

Parallel Programming for Multicore and Cluster Systems by Thomas Rauber and
Gudula Runger.
Scientific Parallel Computing by Scott, Clark, and Bagheri.
Using OpenMP: Portable Shared Memory Parallel Programming by Chapman, Jost,
and van der Pas.
BHOPAL - 462003
Name of Program B. Tech
Name of Course Embedded Systems

Course Code CSE 463
1. Design, develop, and test the embedded system.
2. Evaluate the classification of the real-time operating systems.
3. Interpret the case studies of designing embedded system.
1. Introduction to Embedded System, Challenges & Design Matrices, Classification of
Embedded System
2. Design and Specification of Embedded System, Design of General-Purpose
Microprocessor, Assembly Language Programming
3. 8051 Microcontroller, ARM Controller and PIC Microcontroller
4. Peripheral device, Timers, Counters, Watchdog timers, and other controllers
5. Memory, Interfacing, and Protocols, Finite State machine for capturing behaviour
6. Implementation of project from start to finish (Digital Camera Example and others)
7. Real Time OS, Embedded Control Applications, Network Based Embedded
Applications
List of Text Books:
1. Embedded System Design: A Unified Hardware/Software Introduction by Frank Vahid,
Tony D. Givargis
2. Computers as Components :Principles of Embedded Computing System Design by
Marilyn Wolf
URLs:
1. https://nptel.ac.in/courses/108102045/ by Dr. Santanu Chaudhury, Department of
Electrical Engineering, IIT Delhi.
2. https://nptel.ac.in/courses/106105159/ by Prof. Anupam Basu, IIT Kharagpur.
3. https://nptel.ac.in/courses/106/103/106103182/ by Dr. Arnab Sarkar, CSE, IIT
Guwahati.
BHOPAL - 462003
Name of Course Natural Language Processing

Course Code CSE 464
1. Model linguistic phenomena with formal grammars.
2. Carry out proper experimental methodology for training and evaluating empirical NLP
systems.
3. Manipulate probabilities, construct statistical models over strings and trees, and
estimate parameters using supervised and unsupervised training methods.
4. Design, implement, and analyze NLP algorithms
1. Introduction- Human languages, why NLP is hard, why NLP is useful, classical
problems, models, ambiguity, processing paradigms; Phases in natural language
processing, applications
2. Regular Expressions, Text Normalization, Edit Distance
3. Language Modelling (basic ideas, smoothing techniques)
4. Naive Bayes and Sentiment Classification
5. Part-of-Speech Tagging
6. Constituency Grammars, Constituency Parsing, Statistical Constituency Parsing,
Dependency Parsing
7. Information Extraction: Introduction to Named Entity Recognition and Relation
Extraction
8. Additional topics: Advanced Language Modelling (including LDA), other applications
like summarization, question answering
List of Text Books:
1. Daniel Jurafsky and James H Martin. Speech and Language Processing, 2e, Pearson
Education, 2009
1. Foundations of Statistical Natural Language Processing”, Manning and H. Schutze
2. Computational Approaches to Morphology and Syntax (Oxford Surveys in Syntax &
Morphology)
URLs:
1. NPTEL: Natural Language Processing: https://nptel.ac.in/courses/106105158/
2. NPTEL : Natural Language Processing: https://nptel.ac.in/courses/106101007/
BHOPAL - 462003

Name of Course Quantum Computing
Course Code CSE 465
Prerequisite:
1. Linear Algebra & Probability Theory
2. Basics of Quantum Mechanics
3. Parallel Computations and Complexity Theory
1. Evaluate the quantum computing framework and comprehensive survey.
2. Propose the classical equivalent quantum algorithms, using quantum parallelism.
3. Interpret the mathematical justifications and analysis over speedups and complexity to
justify quantum algorithms as efficient.
1. Introduction to quantum computing, historical facts and comparison between classical –
quantum computing models.
2. Quantum fundamentals and mathematical operations. Quantum postulates, Block
sphere model.
3. Quantum logic gates and quantum circuits, quantum parallelism and quantum
algorithms, classical and quantum Turing machine models.
4. Existing quantum algorithms: Deutsch, Deutsch-Jozsa, Bernstein Vazirani, Simon’s,
Grover’s Shor’s algorithms with speedup analysis, computational complexities.
5. Realization of quantum computer technology, quantum simulation and emulation
aspects, quantum solvable / specific applications.
List of Text Books:
1. Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum
Information, 10th Anniversary Edition – 2010, Cambridge University Press.
2. Andreas de Vries. Quantum Computation: An Introduction for Engineers and Computer
Scientists, First Published Edition – 2012, Books on Demand.
3. Noson S. Yanofsky and Micro A. Mannucci. Quantum Computing for Computer
Scientists, First Published Edition – 2008, Cambridge University Press.
1. David McMahon. Quantum Computing Explained, Ist Edition – 2008, John Wiley and
Sons Inc.
2. N. David Mermin. Quantum Computer Science – An Introduction, I Edition – 2007,
Cambridge University Press.
3. Riley Tipton Perry. Quantum Computing from the Ground Up, Ist Edition – 2012,
World Scientific Publishing Co. Pte. Ltd.
URLs:
1. https://www.dwavesys.com/quantum-computing
2. https://www.ibm.com/quantum-computing/
3. https://www.cse.iitk.ac.in/users/rmittal/prev_course/s16/course_s16.php
BHOPAL - 462003
Name of Program B. TECH
Name of Course Optimization Techniques

Course Code CSE 466
Prerequisite:
1. Nil
1. Develop mathematical models.
2. Formulate optimization problems.
3. Analyze standard techniques of optimization.
1 Unconstrained Optimization, Convex Optimization, Optimization Using Calculus
2 Graphical Optimization, Linear Programming
3 Quadratic Programming.
4 Optimization Problem Formulation of machine learning algorithms like SVM and its
variants, ELM and its variant etc..
5 Study of evolutionary optimization techniques like PSO, Artificial Bee Colony
Algorithm, Genetic Algorithm, Ant Colony Optimization, Simulated Annealing, Neadler
Mead Algorithm etc.
6 Integer Programming
7 Dynamic Programming
8 Error Functions and their minimization techniques
List of Text Books:

1. Practical Optimization Algorithms and Engineering applications, Andreas
Antoniou, Lu, Wu-Sheng, Springer Publication
2. An Introduction to Optimization, Edwin KP. Chong & Stanislaw H. Zak, Wiley
Publication

1. Operations Research : An Introduction by Hamdy A Taha, Pearson
URLs:
3 https://nptel.ac.in/courses/111/105/111105100/
BHOPAL - 462003
Name of Course Cybercrime and Information Warfare

Course Code CSE 467
Prerequisite:
1. This Course doesn’t require any prerequisites, but the basic knowledge of computers
security is desired.
2. General awareness of how information is shared in cyber space.
1. Identify the features and typologies of various challenges to crime and cyberspace
patterns.
2. Analyze how national and non-national actors utilize the internet as a medium of attacks
in cyber warfare to penetrate automated networks and seize control of critical
infrastructure by case studies.
3. Identify the role of the web as a medium for hiring, communicating and funding
extremism.
4. Perform integrated and autonomous research through theoretical and practical
presentations.
1. A brief Introduction of cybercrime, the evolution of cybercrime, challenges of cyber
Crime, categorizing cybercrime, cyber terrorism, virtual crimes, and perception of Cyber
criminals, their motives, type, and organization.
2. Cyber Crime Cases: Money Laundering, Bank Fraud, Advance Fee Fraud, Malicious
Agents, Stock Robot Manipulation, Identity Theft, Digital Piracy, Intellectual Property
Crime, Internet Gambling.Tools used to implement attacks, System Protection against
attack.
3. Perception of cyber criminals: hackers, insurgents and extremist groups, Interception of
data, surveillance and protection, criminal copy right infringement, cyber stalking.
Hiding crimes in cyberspace and methods of Concealment.
4. Privacy in cyber space: web defacements and semantic attacks, DNS attacks, code
injection attacks. The challenges of fighting cybercrime: Opportunities, General
challenges, Legal Challenges
5. Information Warfare concept: information as an intelligence weapon, attacks and
retaliation, attack and defense. Information Warfare Strategies and Tactics from a
Military Perspective, Information Warfare Strategies and Tactics from a Corporate
Perspective, Strategies and Tactics from a Terrorist and Criminal Perspective
An I-War risk analysis model, implication of I-WAR for information managers,
Perceptual Intelligence and I-WAR, Handling Cyber Terrorism and information warfare,
Jurisdiction
6 Development of Capability to analyze and prognosis the potential of Socioeconomic,
sociopolitical impact that can be exerted by a rumor.
List of Text Books:
1. John R. Vacca, Computer Forensics: Computer Crime Scene Investigation, 2nd Edition,
Charles,River Media, 2005 ISBN: 1584503890 , 9781584503897
2. Computer Forensics: Investigating Network Intrusions and Cyber Crime (Ec-Council
Press Series:Computer Forensics), 2010
3. ChristofPaar, Jan Pelzl, Understanding Cryptography: A Textbook for Students and
Practitioners,2nd Edition, Springer’s, 2010
BHOPAL - 462003

1. Principles of cybercrime, Jonathan Clough Cambridge University Pres
2. Information Warfare: Corporate attack and defence in digital world, William
Hutchinson, Mathew Warren, Elsevier.
3. Cyber security and cyber warp. W. Singer and Allan Friedma
URLs:
1. https://swayam.gov.in/nd2_nou19_cs08/
2. https://cybercrime.gov.in/pdf/Cyber%20Security%20Awareness%20Booklet%20for%2
0Citizens.pdf
3. https://en.wikipedia.org/wiki/Information_warfare

BHOPAL - 462003
Name of Course Wireless Networks
Course Code CSE 468

1. Identify the theory, analysis, and design of wireless network.
2. Analyze various standards and protocols for different wireless networking technologies.
1. Introduction to Wireless Communication, Wireless Generations and Standards,
2. Cellular Concept and Cellular System Fundamentals, Frequency Planning, Traffic
Engineering
3. Radio Frequency Fundamentals,Mobile Radio Propagation characteristics, Basics of
Antenna
4. Digital Transmission, Line Coding, Spread Spectrum,
5. WLAN, IEEE 802.11, Adhoc network, Sensor network
6. OFDM, MIMO
7. Cognitive Radio Network, IEEE 802.22, LTE
8. 5G Wireless Communication
List of Text Books:
1. Wireless Communications: Principles and Practice, Rappaport
2. Wireless Communication and Networks William Stalling
URLs:
1. https://www.youtube.com/watch?v=Eu_mTZxPofIby Dr.Ranjan Bose, Department of
Electrical Engineering, IIT Delhi.
2. youtube.com/watch?v=pnunzdveztoby Prof. S. Ghosh,Department of Computer
Science & Engineering, I.I.T.,Kharagpur.
3. https://www.youtube.com/watch?v=YNmLYQWjYUYby Prof.A. Pal, Department of
Computer Science Engineering,IIT Kharagpur
BHOPAL - 462003
Name of Program B. Tech
Name of Course Biometrics

Course Code CSE 469
Prerequisite:
1. Good Knowledge of digital Image Processing / computer Graphics /
2. Linear algebra
3. Probabilities and Statistics
4. Matlab
1. Identify the state-of-the-art in biometric technologies.
2. Survey on the currently available biometric systems.
3. Design biometric system.
1. Biometrics-Introduction : benefits of biometrics over traditional authentication

systems -benefits of biometrics in identification systems-selecting a biometric for a
system
2. History of Biometrics : Evolution of biometric system with respect to time
3. Types of Biometric :
Physical : Fingerprints, Hand Geometry, Retina Scanning, Iris scanning
Facial Recognition, DNA
Behavioral : Signature, Voice, Key stroke pattern, Gait Body dynamics
4. Technical description: strengths, weaknesses, Hand scan DNA biometrics. Handprint

Biometrics DNA Biometrics.
5. Multi biometrics and multi factor biometrics: Limitations of unimodal systems,
Multibiometric scenarios, Levels of fusion, user-specific parameters, and soft
biometrics
6. Biometric System Security: Standards, Databases, Patient Records, Biometrics in
Credit Cards, Identification Forensic Odontology, Case Study Presentations
List of Text Books:
1. Digital Image Processing using MATLAB, By: Rafael C. Gonzalez, Richard Eugene
Woods, 2nd Edition, Tata McGraw-Hill Education 2010
2. Biometrics for network security,Paul Reid, Hand book of Pearson

3. A. Jain, R. Bolle, S. Pankanti, (Ed.), BIOMETRICS: Personal Identification in
Networked Society , KluwerAcademic Publishers, 1999. ISBN 0-7923-8345-1.
TK7882.P3 B36
4. J. Ashbourn, Biometrics: Advanced Identity Verification, Springer-Verlag, 2000. ISBN
1-85233-243-3. TK7882.P3 A84
5. Guide to Biometrics, By: Ruud M. Bolle, Sharath Pankanti, Nalini K. Ratha, Andrew
W. Senior, Jonathan H. Connell, Springer 2009
BHOPAL - 462003
6. Pattern Classification, By: Richard O. Duda, David G.Stork, Peter E. Hart, Wiley 2007
1. D. Maltoni, D. Maio, A. K. Jain, and S. Prabhakar, Handbook of Fingerprint
recognition, Springer Verlag, 2003.
2. A. K. Jain, R. Bolle, S. Pankanti (Eds.), BIOMETRICS: Personal Identification in
Networked Society, Kluwer Academic Publishers, 1999.
3. J. Wayman, A.K. Jain, D. Maltoni, and D. Maio (Eds.), Biometric Systems:
Technology, Design and Performance Evaluation, Springer, 2004.
4. Anil Jain, Arun A. Ross, Karthik Nandakumar, Introduction to biometric,
Springer,2011.
URLs:
2. https://www.tutorialspoint.com/biometrics/index.htm
3. https://www.mathworks.com/products/matlab.html
4. https://www.coursera.org/lecture/usable-security/biometric-authentication-RXVog

Cse Syllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cse Syllabus

Uploaded by

Copyright:

Available Formats

MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY

Name of Program B. Tech. Semester: First/Second Year: First

Name of Course Computer programming & Problem Solving

Course Code CSE 114

Core / Elective / Other Core

Description of Contents in brief:

Course Code MTH 231

Core / Elective / Other Core

List of Reference Books:

Name of Program B. Tech Semester- IV Year- II

Name of Course Fundamentals of Design

Course Code ME 252

Core / Elective / Other CORE

applying critical thinking on different scenarios.

Name of Program B.Tech Semester III Year II

Name of Course Data Structures

Description of Contents in brief:

Name of Program B.Tech Semester III Year II

Name of Course Data Base Management Systems

Course Code CSE 212

Core / Elective / Other Core

Description of Contents in brief:

List of Text Books:

List of Reference Books:

Name of Program B.Tech Semester III Year II

Name of Course Principles of Programming Languages

Course Code CSE 213

Core / Elective / Other Core

List of Text Books:

List of Reference Books:

Name of Program B. Tech. CSE Semester III Year II

Name of Course Digital Circuit Design

Course Code CSE 214

Core / Elective / Other Core

Description of Contents in brief:

List of Text Books:

List of Reference Books:

Name of Program B. TECH Semester IV Year II

Name of Course Fundamentals of Entrepreneurship

Course Code HUM-251

Core / Elective / Other CORE

Name of Program B.Tech Semester IV Year II

Name of Course Algorithm Design & Analysis

Course Code CSE 221

Name of Program B. Tech. Semester IV Year II

Name of Course Computer System Organization

Course Code CSE 222

Core / Elective / Other Core

Name of Program B.Tech Semester- IV Year- II

Name of Course Theory of Computation

Course Code CSE 223

Core / Elective / Other Core

Name of Program B. Tech. Semester IV Year II

Name of Course Data Communication

Course Code CSE 224

Core / Elective / Other Core

Description of Contents in brief:

List of Text Books:

List of Reference Books:

Name of Program B.Tech Semester- IV Year-II

Name of Course Software Engineering

Name of Program B.Tech Semester V Year III

Name of Course Operating Systems