Scheme & Syllabi of 7th Semester For CSE Batch 2016-2020 Maharishi Markandeshwar University

Batch 2016-2020 only
M.M. (DEEMED TO BE UNIVERSITY) , MULLANA (AMBALA)
w.e.f. June 2019 (For Batch 2016-2020 Only)

Bachelor of Technology (B.Tech) in Computer Science & Engineering: Scheme
7th SEMESTER
Sr. Course Course Course Title Teaching Credits Examination Marks

No. No. Category Schedule
L T P Internal Theory Practical Total
1. CS-37 Core Genetic Algorithms 3 - - 3 40 60 - 100
2. CS-38 Core Distributed Operating System 3 - - 3 40 60 - 100
3. CS-39 Specialization Elective-IV 3 - - 3 40 60 - 100
4. CS-40 Specialization Elective-V 3 - - 3 40 60 - 100
5. General Open Elective-I 3 1 - 4 40 60 - 100
6. General Open Elective-II 3 1 - 4 40 60 - 100
7. CS-41 Core Genetic Algorithms Lab - - 2 2 60 - 40 100
8. CS-42 Core Project-III - - 8 8 60 - 40 100
Total 18 2 10 30 360 360 80 800
One Course -3 credit Swayam

*Swayam means subject that cover under self study/learning mode via online study material
Elective–IV & V
Course Course Title Course Course Title

No. No.
Elective-IV Elective-V
CS-39 (a) Software Project Management CS-40 (a) Neural Networks
CS-39 (b) Formal Languages & Automata Theory CS-40 (b) Dataware Housing & Data Minning
CS-39 (c) Statistical Modeling and Queuing Theory CS-40 (c) AI & Machine Learning
CS-39 (d) Robotic Process Automation Design &
Development
List of Open Elective Courses
Course Code Course Name Course Code Course Name

OE-CSE-01 / Database Management Systems OE-CE-11 General Principles of Building
BCSE-510 Construction
OE-CSE-02 / Data Structure & Algorithm OE-CE-12 Planning for sustainable
BCSE-503 development
OE-CSE-03 / Python Programming OE-ECE-13 / EC-11 Principles of Communication
CS-32 (c)
OE-CSE-04 / Object Oriented Programming in OE-ECE-14 / EC-10 Digital Electronics
BCSE-509 JAVA
OE-ME-05 Project & Production Management OE-ECE-15 / EC-47 Internet of Things
OE-ME-06 Quality Assurance & Reliability OE-ECE-16 / EC-38 Embedded System
OE-ME-07 Entrepreneurship & Family OE-EE-17 / EE-04 Analog Electronics
Business (Open Elective-II)
OE-ME-08 Supply Chain Management OE-EE-18 / EE-05 Network Analysis & Synthesis
OE-CE-09 Disaster Management (Open OE-EE-19 / EE-18 Control Systems
Elective-I)
OE-CE-10 Project Management OE-EE-20 / EE-12 Measurements & Instrumentation
1
B. Tech. (7th Sem) Computer Science & Engineering

CS-37 (Genetic Algorithms)
L T P Continuous evaluation 40
3 - - End semester exam 60
Total marks 100
Credits 3.0
Course Objectives:
1. To acquire the knowledge about the basic concept of Genetic algorithms.
2. To learn about Schema theory and Binary genetic algorithm.
3. To learn about Continuous and Parallel Genetic algorithms.
4. To learn about MATLAB and its applications.
Unit:-1
Introduction- Historical background, Optimization, need of Genetic Algorithms.
Basic Principles- Genetic Algorithm concepts, Representation, The elements of a Genetic Algorithm, Practical
considerations.
Unit:-2
Schema Theory- Schemata, The schema theorem, exact models, Walsh Transforms and deception.
The Binary Genetic Algorithm- Selecting the variables and the cost function, Variable Encoding and Decoding, The
population, natural selection, selection, crossover, mutation, convergence.
Unit:-3
The continuous Genetic Algorithm- The example variables and cost function, variable encoding, precision and bounds,
initial population, natural selection, pairing, crossover, mutation, convergence.
Parallel Genetic Algorithms- Advantages of parallel GAs, strategies for parallel GAs, expected speedup, an example
parallel GA.
Unit:-4
MATLAB- Basic features, MATLAB desktop, arrays and array operations, numeric data types, cell arrays and structures,
character strings, relational and logical operations, control flow, functions, M -file debugging and profiling, file and directory
management, set, bit and base functions.
Course Outcomes:
1. Understand need and application of Genetic algorithms.
2. Understand various categories of genetic algorithms.
3. Understand various concepts related to MATLAB.
4. Identify and solve various problems using MATLAB.
Instructions for paper setter: All Questions are compulsory. The Question paper is divided in to four sections A, B, C
and D. Section A is compulsory and comprises of 12 questions of one mark each, 3 from each unit. The questions shall be
asked in such a manner that there are no direct answers including one word answer, fill in the blanks or multiple choice
questions. Section B comprises of 4 questions of 2 marks each, one from each unit. Section C Comprises of 4 questions of
4 marks each, one from each unit. Section D Comprises of 4 questions of 6 marks each, one from each unit. There is no
overall choice, however internal choice may be provided in section C and D, if paper setter so desires.
Text/Reference Books:
1. Colin R. Reeves, Jonathan E. Rowe, “Genetic Algorithms: Principles and perspectives”, Kluwer Academic Publishers.
2. Randy L. Haupt, Sue Ellen Haupt, “Practical Genetic Algorithms”, Wiley Interscience, Second Edition.
3. Franz Rothlauf, “Representations for Genetic and Evolutionary Algorithms”, Second Edition, Springer.
4. David E. Goldberg, “Genetic Algorithms in search, optimization and machine learning”, Pearson Education.
5. Duane Hanselman, Bruce Littlefield, “Mastering MATLAB 7”, Pearson Education.
2

CS-38 (Distributed Operating System)
Total marks 100
Credits 3.0
Course Objectives:
1. To acquire the knowledge about the basic concepts about Distributed Operating System.
2. To learn about phenomenon of mutual inclusion in distributed systems.
3. To learn about deadlock detection techniques in distributed systems.
4. To learn about distributed file system & distributed scheduling mechanism used in distributed systems.
Unit:-1
Architecture of Distributed Operating System- Introduction, Motivation, System architecture type, Issues in distributed
operating system, Communication primitive.
Unit:-2
Distributed mutual Inclusion- Introduction, Classification preliminaries, Simple solution, Non token based algorithm,
Lamport algorithm, Ricart algorithm, Mackawa’s algorithm, A generalize d Non token based algorithm, Token based
algorithm, Broad caste algorithm, Heuristic algorithm, Tree based algorithm, Comparative performance analysis.
Unit:-3
Distributed Deadlock Detection- Introduction, Deadlock handling, Strategies, Issues in deadlock detection & resolution,
Control organization, Centralized, Distributed & Hierarchical detection algorithm.
Unit:-4
Distributed File System- Introduction, Architecture mechanism for building, Design issues, Log Structured file system.
Distributed Scheduling- Introduction, Motivation, Issues in load distribution, Component of load algorithm, Stabilizing load
distribution algorithm, Performance comparison, Selection of a suitable load sharing algorithm, Requirement for load
distribution, Task migration, Issues in task migration.
Course Outcomes:
i) Understand architecture of distributed operating system.
ii) Understand various characteristics, properties of distributed systems.
iii) Identify and solve deadlock related problems in distributed operating systems.
iv) Understand various concepts related to distributed file system.
questions. Section B comprises of 4 questions of 2 marks each, one from each unit. Section C Com prises of 4 questions of
1. Mukesh Singhal & N.G. Shivaratri, “Advanced concepts in operating systems”, TMH 2001.
2. A. S. Tanenbaum, “Modern Operating Systems”, PHI.
3. A. Silberschatz, P. Galving, G. Gahne, “Applied operating system concepts”, Wiley
3

CS-39 (a) (Software Project Management)
Total marks 100
Credits 3.0
Course Objectives:
1. To acquire the knowledge about the basic conventional software management process.
2. To learn about various attributes of software management process.
3. To learn about disciplines of software management.
4. To learn about project control and process instrumentation.
Unit:-1
Conventional Software Management- Evolution of software economics, improving software economics,
Reducing product size, Software processes, Team effectiveness, Automation through software environments, Principles of
modern software management.
Unit:-2
Software Management Process- Framework, Life cycle phases (Inception, Elaboration, construction and training phase),
Artifacts of the process (artifact sets, management artifacts, engineering artifacts, and
Pragmatics artifacts), Model based software architectures, Workflows of the process, Checkpoints of the process.
Unit:-3
Software Management Disciplines- Iterative process planning, Project organizations and responsibilities,
Process Automation.
Unit:-4
Project Control and Process Instrumentation- Core metrics, Management indicators, Life cycle expectations,
Process Discriminants.
Course Outcomes:
i) Understand the concept of software process, team effectiveness.
ii) Understand software architecture.
iii) Understand various types of software management disciplines.
iv) Understand the process of controlling a project.
asked in such a manner that there are no direct answers includ ing one word answer, fill in the blanks or multiple choice
4 marks each, one from each unit. Section D Comprises of 4 questions of 6 ma rks each, one from each unit. There is no
1. Walker Royce, “Software Project management”, Addison Wesley, 1998.
2. Project management, 2nd edition, Maylor.
3. Humphrey, “Managing the Software Process”.
4. Ramesh, “Managing global software Projects”, TMH.
4

CS-39 (b) (Formal Languages & Automata Theory)
Total marks 100
Credits 3.0
Course Objectives:
1. To acquire the knowledge about fundamental of the core concepts in automata theory & formal languages.
2. To learn about regular sets and machines.
3. To learn about grammars and pushdown automata.
4. To learn about importance of computational theory and power of the Turing Machine.
Unit:-1
Finite Automata and Regular Expression- Finite State System, Basic Definition Non-Deterministic finite Automata (NDFA),
Deterministic finite Automata (DFA), Equivalence of DFA and NDFA Finite Automata with E -moves, Regular
expression, Equivalence of finite Automata and expression, Re gular expression conversion and vice-versa.
Unit:-2
Introduction to Machines- Concept of basic machines, Properties and limitations of FSM, Moore and Mealy Machines,
Equivalence of Moore and Mealy Machines, Conversion of NFA and DFA by Arden’s method.
Properties of Regular sets- The Pumping Lemma for regular sets, Application of the pumping Lemma, Closure Properties
of regular sets, Minimization of Finite Automata, Minimization Algorithm.
Unit:-3
Grammars- Definition, Context free and Context sensitive Grammar, Ambiguity, Regular grammar, Reduced forms,
Removal of useless symbols, null production and unit production, Chomsky Normal Form (CNF), Griebach Normal
Form (GNF). Pushdown Automata- Introduction to push-down machines, Application of push down machines.
Unit:-4
Turing Machines- Deterministic and Non-Deterministic Turing Machines, Design of TM, Halting Problem of TM., PCP
problem. Chomsky Hierarchy- Chomsky hierarchies of grammars, unrestricted grammar, Context sensitive Language,
Relation between languages of classes. Computability- Basic Concepts, Primitive Recursive functions.
Course Outcomes:
i) Acquire a fundamental understanding of the core concepts in automata theory and formal languages.
ii) Gets an ability to design automata, regular expressions and context-free grammars accepting or generating a
certain language.
iii) Able to describe the language accepted by automata or generated by a regular expression or a context -free
grammar.
iv) Able to solve problems related to Turing Machine.
v) Develop a view on the importance of computational theory.
questions. Section B comprises of 4 questions of 2 marks each, on e from each unit. Section C Comprises of 4 questions of
overall choice, however internal choice may be provided in section C and D, if pap er setter so desires.
1. John C. Martin, “Introduction to Languages and the Theory of Computation”, MGH.
2. Lewis & Papadimitriou, “Elements of the Theory of Computation”, PHI.
3. Daniel I. A. Cohen, “Introduction to Computer Theory”, John Wiley.
4. Hopcroaft & Ullman, R. Motwani, “Introduction to Automata Theory, Languages & Computations”.
5. K. L. P. Mishra & N. Chandershekaran, “Theory of Computer Sc. (Automata, Language & Computation)”.
6. Peter Linz, “Introduction to formal language & Automata”.
5

CS-39 (c) (Statistical Modeling and Queuing Theory)
Total marks 100
Credits 3.0
Course Objectives:
1. To acquire the knowledge about simple probability & conditional probability.
2. To learn about Baye’s theorem, Bernoulli theorem and Random variables.
3. To learn about expectation, variance & transform methods.
4. To learn about concept of stochastic process & Markov chains for the analysis of various systems .
Unit:-1
Random Experiment, Sample Space, Events & their algebra, Graphical method of representing events, Probability Axioms,
Conditional probability, Independence of Events, Bayes' Rule and Bernoulli Trials.
Unit:-2
Random Variable- Definition and their event space.
Discrete Random Variable- Probability mass function, Distribution function, Some discrete distributions (Bernoulli,
Binomial, Geometric, Poisson, uniform), Probability Generating Function, Discrete random vectors .
Continuous Random Variable- pdf, some continuous distributions (Exponential, Gamma, Normal), Joint1y distributed
random variables.
Unit:-3
Expectation- Definition, Expectation of functions of more than one random variable, Variance, Moments and
transforms of some distributions (Bernoulli, Binomial, Geometric, Poisson, Exponential), Computation of Mean Time
To Failure (MTTF).
Stochastic Process- Definition, Classification of stochastic processes, Bernoulli process, Binomial process, Renewal
process.
Unit:-4
Markov Chains (Discrete parameter Markov Chains, Continuous parameter Markov Chains), Computation of n-step
transition probabilities, State classification and limiting distributions, Irreducible finite chains with aperiodic states (M emory
interference in Multiprocessor system), General Queuing Sys tem, Discrete parameter Birth-Death processes, Analysis of
program execution time.
Course Outcomes:
i) Able to differentiate between simple probability & Conditional Probability.
ii) Able to solve complex problems using Baye’s theorem & Bernoulli Theorem.
iii) Able to understand the application of Random variable & various distribution functions.
iv) Able to solve various problems related to expectation, variance & transform methods.
v) Able to apply the concept of stochastic process & Markov chains for the analysis of vari ous systems.
vi) Able to understand the applicability of this course in the research work related areas.
1. K.S. Trivedi, “Probability, Statistics with Reliability, Queuing and Computer Science Applications”, PHI, 2001.
2. W. Feller, “An Introduction to Probability Theory and its applications”, Wiley Eastern, 1975.
3. L. Kleinroek, “Queuing Systems”, John Wiley, 1976.
6

CS-39 (d) (Robotic Process Automation Design & Development)
Total marks 100
Credits 3.0
Course Objectives:
1. To understand Basic Programming concepts and the underlying logic/structure.
2. To describe RPA, where it can be applied and how it’s implemented.
3. To describe the different types of variables, Control Flow and data manipulation techniques.
4. To Understand Image, Text and Data Tables Automation.
5. To describe automation to Email and various types of Exceptions and strategies to handle.
Unit-1: Programming Basics & Recap
Programming Concepts Basics- Understanding the application, Basic Web Concepts, Protocols, Email Clients.
Data Structures- Data Tables, Algorithms, Software Processes, Software Design, Scripting, .Net Framework, .Net
Fundamentals, XML, Control structures and functions, XML, HTML, CSS, Variables & Arguments.
Unit-2: RPA Concepts
RPA Basics, History of Automation, What is RPA, RPA vs Automation, Processes & Flowcharts, Programming Constructs
in RPA, What Processes can be Automated, Types of Bots, Workloads which can be automated, RPA Advanced Concepts,
Standardization of processes, RPA Development methodologies, Difference from SDLC, Robotic control flow architecture,
RPA business case, RPA Team, Process Design Document/Solution Design Docu ment, Industries best suited for RPA,
Risks & Challenges with RPA, RPA and emerging ecosystem.
Unit-3: RPA Tool Introduction & Basics
Introduction to RPA Tool, The User Interface, Variables, Managing Variables, Naming Best Practices, The Variables
Panel, Generic Value Variables, Text Variables, True or False Variables, Number Variables, Array Variables, Date and
Time Variables, Data Table Variables, Managing Arguments, Naming Best Practices, The Arguments Panel, Using
Arguments, About Imported Namespaces, Importing New Namespaces, Control Flow, Control Flow Introduction, If Else
Statements, Loops, Advanced Control Flow, Sequences, Flowcharts, About Control Flow, Control Flow Activities, The
Assign Activity, The Delay Activity, The Do While Activity, The If A ctivity, The Switch Activity, The While Activity, The For
Each Activity, The Break Activity, Data Manipulation, Data Manipulation Introduction, Scalar variables, collections and
Tables, Text Manipulation, Data Manipulation, Gathering and Assembling Data.
Unit-4: Advanced Automation Concepts & Techniques
Recording and Advanced UI Interaction, Recording Introduction, Basic and Desktop Recording, Web Recording,
Input/Output Methods, Screen Scraping, Data Scraping, Scraping advanced techniques, Selectors, Selec tors, Defining and
Assessing Selectors, Customization, Debugging, Dynamic Selectors, Partial Selectors, RPA Challenge, Image, Text &
Advanced Citrix Automation, Introduction to Image & Text Automation, Image based automation, Keyboard based
automation, Information Retrieval, Advanced Citrix Automation challenges, Best Practices, Using tab for Images, Starting
Apps, Excel Data Tables & PDF, Data Tables in RPA, Excel and Data Table basics, Data Manipulation in excel, Extracting
Data from PDF, Extracting a single piece of data, Anchors, Using anchors in PDF. Email Automation, Incoming Email
automation, Sending Email automation, Debugging and Exception Handling, Debugging Tools, Strategies for solving
issues, Catching errors.
Course Outcomes:
i) Understand Basic Programming concepts and the underlying logic/structure.
ii) Describe RPA, where it can be applied and how its implemented.
iii) Describe the different types of variables, Control Flow and data manipulation techniques.
iv) Identify and understand Image, Text and Data Tables Automation.
v) Describe automation to Email and various types of Exceptions and strategies to handle.
7
1. Alok Mani Tripathi, “Learning Robotic Process Automation”, Packt Publishing.
2. Frank Casale, Rebecca Dilla, Heidi Jaynes, Lauren Livingston, “Introduction to Robotic Process Automation: a Primer, Institute
of Robotic Process Automation”.
3. Richard Murdoch, “Robotic Process Automation: Guide To Building Software Robots, Automate Repetitive Tasks & Become An
RPA Consultant”.
4. Srikanth Merianda, “Robotic Process Automation Tools, Process Automation and their benefits: Understanding RPA and
Intelligent Automation”.
5. https://www.uipath.com/rpa/robotic-process-automation.
8

CS-40 (a) (Neural Networks)
Total marks 100
Credits 3.0
Course Objectives:
1. To acquire the knowledge about basic concepts and classification of neural networks.
2. To learn about Hopfield net and Counter propagation networks.
3. To learn about Bi-directional associative memories.
4. To learn about applications of Artificial neural networks.
Unit:-1
Introduction- Concepts of neural networks, Characteristics of Neural Networks, Historical Perspective and Applications of
Neural Networks. Fundamentals of Neural Networks- The biological prototype, Neuron concept, Single layer Neural
Networks, Multi-Layer Neural Networks, terminology, Notation and representation of Neural Networks, Training of Artificial
Neural Networks, Representation of perceptron and issues, perceptron learning and training, Classification, Linear
Separability.
Unit:-2
Hopfield Nets- Structure, Training and applications, Stability. Back propagation- Concept, Applications and Back
Propagation Training Algorithms. Counter Propagation Networks- Kohonan Network, Grossberg Layer & Training,
Applications of counter propagation, Image classification.
Unit:-3
Bi-directional Associative Memories- Structure, retrieving a stored association, Encoding associations, memory capacity.
ART- ART architecture, ART classification operation, ART implementation and characteristics of ART, Image Compression
Using ART.
Unit:-4
Applications- Applications of Artificial Neural Networks to Function Approximation, Regression, Classification, Blind
Source Separation, Time Series and Forecasting.
Course Outcomes:
i) Describe the relation between real brains and simple artificial neural network models .
ii) Able to solve various problems related to Hopfield net and Bi-directional associative memories.
iii) Able to identify the main implementation issues for common neural network systems.
iv) Able to apply neural networks model for solving real life problems.
1. Li Min Fu, “Neural Networks in Computer Intelligence”, McGraw-Hill, Inc.
2. Philip D. Wasserman, “Neural Computing Theory and Practice”, ANZA Research Inc.
3. Melaine Mitchell, “An introduction to Genetic Algorithms”, PHI.
4. M. H. Hassun, “Fundamentals of Artificial Neural Networks”, PHI.
9

CS-40 (b) (Data Warehousing and Data Mining)
Total marks 100
Credits 3.0
Course Objectives:
1. To acquire the knowledge about Data Warehousing.
2. To learn about Data Mining concepts.
3. To learn about various Data Mining techniques.
4. To acquire knowledge about mining complex data objects.
Unit-1: Data Warehousing

Definition, usage and trends, DBMS Vs Data warehouse, data marts, metadata, Multidimensional data mode, data cubes,
Schemas for Multidimensional database: stars, snowflakes and fact constellations, Data warehouse process &
architecture, OLTP Vs OLAP, ROLAP Vs MOLAP, types of OLAP, ser vers, 3-Tier data warehouse architecture,
Distributed and virtual data warehouses, data warehouse manager.
Unit-2: Data Mining
Definition & task, KDD versus Data mining, Data mining techniques, Tools and applications, Data mining query languages,
Data specification, specifying knowledge, Hierarchy specification, pattern presentation & visualization specification.
Unit-3: Data Mining Techniques
Association rules, Clustering techniques, Decision tree knowledge discovery through Neural Networks & Generic
Algorithm, Rough Sets, Support Victor Machines and Fuzzy techniques.
Unit-4: Mining Complex Data Objects
Spatial databases, Multimedia databases, Time series and sequence data, mining text Databases and mining World Wide
Web.
Course Outcomes:
i) Understand operational database, warehousing and multidimensional need of data base to meet industrial needs.
ii) Identify and understand the components of warehousing.
iii) Identify and understand the data extraction and transformation techniques.
iv) Identify and understand the Business analysis, query tools and application, OLAP etc.
v) Introduce with and gain knowledge about data mining, decision tree, neural networks and clustering.
1. Sam Anahory & Dennis Murray, “Data warehousing in Real World”, Pearson.
2. Jiawei Han & Micheline Kamber, Morgan Kaufmann, “Data Mining-Concepts & Techniques”.
3. Arun Pujar, “Data Mining Techniques”, University Press, Hyderabad.
4. Pieter Adriaans & Dolf Zantinge, “Data Mining”, Pearson Education.
5. Alex Berson, “Data Warehousing, Data Mining and OLAP”, McGraw Hill.
6. Mallach, “Data Warehousing System”, McGraw Hill.
7. W.H. Longhman, C.Klelly, “Building the Data Warehouses”, John Wiley & Sons.
8. W.H. Longhman, C.Klelly, “Developing the Data Warehouses”, John Wiley & Sons.
9. W.H. Longhman, C.Klelly, “Managing the Data Warehouses”, John Wiley & Sons.
10

CS-40 (c) (AI & Machine Learning)
Total marks 100
Credits 3.0
Course Objectives:
1. To acquire knowledge about Artificial intelligence basic concepts & characteristics.
2. To learn various search techniques.
3. To acquire knowledge about expert system.
4. To acquire knowledge about key aspects of machine learning.
Unit:-1
Introduction- The Turing Test, AI application area, Problem representation, Truth maintenance system s.
Knowledge representation- Logical representation scheme (propositional and predicate Calculus, syntax and semantic,
unification and resolution), Procedural representation scheme (production system, different types of production system),
Network representation scheme (semantic networks, conceptual dependencies), Structured representation scheme (scripts
and frames).
Unit:-2
Searching Techniques- Data driven and goal driven search, heuristic search (Hill climbing search, Best first search or A*
algorithm, Problem reduction method or AO* algorithm), admissibility, monotonicity and informedness, heuristics in games.
Unit:-3
Expert Systems- Overview of expert system technology, expert system architecture, Case study of MYCIN Expert system,
tools for building expert systems. Supervised learning- Basic methods (Distance based Methods, Nearest neighbor,
decision trees, naïve bayes), Linear Models (Liner regression, logistic regression, generalized linear models), Spot Vector
Machines, Non Linearity.
Unit:-4
Unsupervised Learning- Clustering (K-means/kernel K-means), Dimensionally reduction (PCA and Kernel PCA), Matrix
factorization and matrix completion.
Evaluating Machine Learning Algorithms and Model Selection, Introduction to statistical learning theory.
Course Outcomes:
i) Apply artificial intelligence techniques, including search heuristics, knowledge representation, planning and
reasoning
ii) Describe the key components of the artificial intelligence (AI) field, search strategies.
iii) Describe the key aspects of machine learning.
iv) Design and implement appropriate solutions for search problems (such as playing two -person games) and for
planning problems.
1. Rich and Knight, “Artificial Intelligence”, Tata McGraw Hill.
2. Eugene Charniak, “Introduction to Artificial intelligence”, Drew McDermott Addison Wesley-2000.
3. Kevin Murphy, “Machine Learning: A probabilistic Perspective”, MIT Press, 2012.
4. Trevor Hastie, Robert Tibshirani, Jerome Friedman, “The Elements of Statistical Learning”, Springer 2009.
11
OE-CE-09: Disaster Management

(Common to All Branches)
Nomenclature L T P/D Total Credit

Open Elective Course 03 01 - 04 04
Course Objectives
1. Discuss the importance of planning for disasters.
2. To study inter-relationship between Disaster and Development
3. Discuss (overview of) policies and the roles of the local, state, and central government.
4. Discuss various components of disaster relief.
UNIT-I
Introduction to Disasters: Concepts and definitions (Disaster, Hazard, Vulnerability, and Resilience Risks) Disasters:
Classification Causes, Impacts (including social, economic, political, environmental, health, psychosocial etc.)
Differential impacts – in terms of caste, class, gender, age, location, disability Global trends in disasters urban disasters,
pandemics, complex emergencies, Climate change.
UNIT-II
Approaches to Disaster Risk reduction: Disaster cycle – its analysis, Phases, culture of safety, prevention, mitigation
and preparedness, community based DRR, structural-non-structural measures, roles and responsibilities of community,
Panchayati Raj institutions/Urban local bodies (PRIs/ULBs), states, Centre and other stake-holders.
UNIT-III
Inter-relationship between Disaster and Development: Factors affecting Vulnerabilities, differential impacts, impact
of Development projects such as dams, embankments and changes in Land use etc. climate change adaption.
Relevance of indigenous knowledge, appropriate technology and local resources.
UNIT-IV
Disaster Risk Management in India: Hazard and vulnerability profile of India, Components of Disaster Relief: Water,
Food, Sanitation, Shelter, Health, and Waste Management, Institutional arrangements (Mitigation, Response and
Preparedness, DM Act and Policy, other related policies, plans, programmes and legislation)
Project Work: (Field Work and Case studies)

The project/fieldwork is meant for students to understand vulnerabilities and to work on reducing disaster risks and to
build a culture of safety. Projects must be conceived base on the geographic location and hazard profile of the region
where the college is located. A few ideas or suggestions are discussed below: Several governmental initiatives require
urban local bodies (ULBs0 and Panchayati Raj institutions (PRIs) to be proactive in preparing DM plans and community
based disaster preparedness plans. Information on these would be available with the district collector or Municipal
Corporations. The scope for students to collaborate on these initiatives in immense. Teachers may explore possibilities.
Teachers could ask students to explore and map Disaster prone areas, vulnerable sites, vulnerability of people (specific
groups) and resources. The students along with teachers could work on ways of addressing these vulnerabilities,
preparing plans in consultation with local administration or NGOs Students could conduct mock drills in schools,
colleges, or hospitals. They could also work on school safety of college buildings, training in first aid. Other examples
could be identifying how a larger dam, road/highway or an embankment or the location of an industry affects local
environment and resources or how displacement of large sections of people creates severe vulnerabilities may be
mapped by student project work.
Course out comes: On completion of this course successfully, a candidate will be able to :
1. Understand the key perspectives of disasters, hazards and the related concepts.
2. Study the trends in disasters and the concept of climate change.
3. Develop a basic understanding of prevention, mitigation, preparedness, response and recovery for disaster risk reduction.
4. Study the basic components of disaster relief.
5. Discuss the roles and responsibility of Govt. and private bodies for disaster management.
6. Study the hazard and vulnerability profile of India.
Note for Paper-setter: The Question paper is divided in to three sections A and B. Section A comprises of 12 questions of one mark
each, 3 from each unit. The questions shall be asked in such a manner that there are no direct answers including one word answer,
fill in the blanks or multiple choice questions. The section B comprises 4 questions of 12 marks each, one from each unit. Each
question shall have two alternatives, out of which student will be required to attempt one
Books-
01. Andharia J. Vulnerability in Disaster Discourse, JTCDM, Tata Institute of Social Sciences Working paper no. 8, 2008
02. Blaikle, P, Cannon T, Davis I, Wisner B 1997. At Risk Natural Hazards, Peoples, Vulnerability and Disasters, Routledge.
03. Coppola P Damon, 2007. Introduction to international Disaster Management
04. Carter, Nick 1991. Disaster Management: A Disaster Manager’s Handbook. Asian Development Bank Manila Philippines.
05. Cuny, F. 1983. Development and Disasters, Oxford University Press
06. Document on World Summit on Sustainable Development 2002
07. Govt. of India: Desaster Management Act 2005, Government of India, New Delhi
08. Government of India, 2009. National Disaster Management Policy.
12
OE-ME-07: Entrepreneurship & Family Business
L T P Theory: 60
3 1 0 Continuous Evaluation: 40
Time: 3 Hours
COURSE OBJECTIVE:
 The main aim of the course is to allow the student to critically reflect on empirical material recognizing the rise of modern
business and to appreciate the experience of individuals within specific family firms. The various dimensions of leadership
and succession will be conveyed as well as their managerial, structural and emotional implications.
Unit 1
Definition and objectives of Project Management, Characteristics of projects, Taxonomy of projects, Project identification & project
preparation, Zero based project formulation, Types of Project, Project appraisal-Technical, Commercial, Economic, Financial,
Management; Project risk analysis- Break even analysis, Sensitivity analysis, Decision tree analysis, Monte-carlo technique , Game
theory;
Unit 2
Present value and future value, Types of cost, Cost of project, components of capital cost of project, sources of finance, role of
Financial Institutions, Project scheduling, Project cost Vs Project completion time, Normal time & crash time, Direct & Indirect cost,
Total cost, Rehabilitation of sick units, causes & prediction of sickness, Board of Industrial & Financial Reconstruction (BIFR)
Unit 3
Entrepreneurship, Role of Entrepreneur in Indian economy, Characteristics of an entrepreneur, Types of entrepreneurs, some
myths and realities about entrepreneurship, Role and scope of small scale industries, concept of small scale and ancillary industrial
undertakings, How to start a small scale industry, Steps in launching own venture, procedure for registration of small scale industries,
Financial concept for small-scale industries, financial requirements, Financial support programmer of banks, government
financial agencies
Unit 4
Various developmental agencies-their functions and role in industrial and entrepreneurship development, Infrastructure facilities
available for entrepreneurship development in India, Hire-purchase facilities, alternate sources of finance, The modern concept of
marketing, Definitions, functions and principle of marketing, Marketing research, Advertising, Market survey, Pre -
feasibility and feasibility of project. Identification and evaluation of business opportunity, risk involved and preparation of
business plan, Tools for evaluation of techno economic feasibility project report, SWOT analysis.
COURSE OUTCOMES: Upon the completion of course student will able to

1. Integrating entrepreneurial and professional management concepts for strengthening
their family business performance.
2. Understand the complexities and importance of growth and regeneration in relation to the family businesses
3. Identify and describe the factors affecting the development of entrepreneurship in family businesses.
4. Understand how the family informs entrepreneurial opportunity
Instructions for paper setter :
a. All Questions are compulsory.
b. The Question paper is divided in to four sections A, B, C and D.
c. Section A is compulsory and comprises of 12 questions of one mark each, 3 from each unit. The questions shall be asked in
such a manner that there are no direct answers including one word answer, fill in the blanks or multiple choice questions
(2.5 minutes each)
d. Section B comprises of 4 questions of 2 marks each, one from each unit. (6 minutes each)
e. Section C Comprises of 4 questions of 4 marks each, one from each unit. (10 minutes each). Each question shall have two
alternatives, out of which student will be required to attempt one.
f. Section D Comprises of 4 questions of 6 marks each, one from each unit. (15 minutes each). Each question shall have two
alternatives, out of which student will be required to attempt one.
Reference and Text Books:
1. The practice of Entrepreneurship - By G. G. Meredikh, R.E. Nelson and P.A. Neck
2. Handbook of Entrepreneurship- By Rao and Pareek
3. Project Management- K. Nagarajan
13

CS-41 (Genetic Algorithms Lab)
- - 2 End semester exam 40
Total marks 100
Credits 2.0
Course Objectives:
1. To acquire the practical knowledge about the implementation of basic concept of Genetic algorithm.
2. To learn about practical implementation of various phases of Genetic algorithms.
3. To learn about implementation of Continuous and Parallel Genetic algorithms.
4. To learn about basic features of MATLAB.
List of Practical
Experimental work will be based upon the course Genetic Algorithms (CS-37).
Course Outcomes:
i) Practically implement basic concept of Genetic algorithm.
ii) Able to implementation various phases of Genetic algorithms.
iii) Able to implement various types of genetic algorithms.
iv) Able to run basic features of MATLAB.

CS-42 (Project-III)
- - 8 End semester exam 40
Total marks 100
Credits 8.0
Course Objectives:
1. To learn about various phases of software development life cycle.
2. To learn about how to provide software solution for real life problems.
3. To learn about coding and testing of solutions.
4. To learn about report writing concepts.
The students are required to develop a project during semester and final evaluation will be entirely based upon his/her project work.
Course Outcomes:
i) Able to identify software solution corresponding to real life problems.
ii) Able to code software solution.
iii) Able to test software solution.
iv) Able to write reports.
14

Scheme & Syllabi of 7th Semester For CSE Batch 2016-2020 Maharishi Markandeshwar University

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Scheme & Syllabi of 7th Semester For CSE Batch 2016-2020 Maharishi Markandeshwar University

Caricato da

Copyright:

Formati disponibili

Batch 2016-2020 only

M.M. (DEEMED TO BE UNIVERSITY) , MULLANA (AMBALA)

w.e.f. June 2019 (For Batch 2016-2020 Only)

Sr. Course Course Course Title Teaching Credits Examination Marks

One Course -3 credit Swayam

Course Course Title Course Course Title

List of Open Elective Courses

Course Code Course Name Course Code Course Name

B. Tech. (7th Sem) Computer Science & Engineering

B. Tech. (7th Sem) Computer Science & Engineering

B. Tech. (7th Sem) Computer Science & Engineering

B. Tech. (7th Sem) Computer Science & Engineering

B. Tech. (7th Sem) Computer Science & Engineering

B. Tech. (7th Sem) Computer Science & Engineering

B. Tech. (7th Sem) Computer Science & Engineering

B. Tech. (7th Sem) Computer Science & Engineering

Unit-1: Data Warehousing

B. Tech. (7th Sem) Computer Science & Engineering

OE-CE-09: Disaster Management

Nomenclature L T P/D Total Credit

Project Work: (Field Work and Case studies)

OE-ME-07: Entrepreneurship & Family Business

COURSE OUTCOMES: Upon the completion of course student will able to

B. Tech. (7th Sem) Computer Science & Engineering

B. Tech. (7th Sem) Computer Science & Engineering

Potrebbero piacerti anche