UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
MCA (OL) Scheme & Syllabus
SEMESTER-I
S. No.
Course Code
Name of the Course
Credit
1
OMCA-111
OOPS using C++
4
2
OMCA-112
Operating System
4
3
OMCA-113
Computer Organization and Architecture
4
4
OMCA-114
Discrete Mathematics
4
5
OMCA-115
Financial Accounting
4
SEMESTER-II
S. No.
Course Code
Name of the Course
1
OMCA-121
Python Programming
2
OMCA-122
Data Structure
3
OMCA-123
Software Engineering
4
OMCA-124
Data Communication and Networking
5
OMCA-125
Theory of Computation
SEMESTER-III
S. No.
Course Code
Name of the Course
1
OMCA-231
Database Management System
2
OMCA-232
Web Technology
3
OMCA-233
Information Security
4
OMCA-234
Artificial Intelligence
5
OMCA-235
Soft Computing
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
SEMESTER-IV
S. No.
Course Code
Name of the Course
Credit
1
OMCA-241
Capstone Project Work
16
2
OMCA-242
Comprehensive Viva-Voce
4
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-111
Credit
4
Year/Semester
1/1
L-T-P
4-0-0
Course Name
OOPS using C++
Objectives of the Course
● To understand the basics concept of OOPS which includes classes, objects etc.
● To understand inheritance and polymorphism concept
● To understand how to use exceptional handling in C++
● To provide knowledge of Programming for developing day to day Applications.
● To demonstrate the Basics of Reusability, and use of Files and its operations.
UNIT-I
Object-Oriented programming paradigm, Drawbacks of procedural programming, Advantages of OOP,
Basic data types, Tokens, Keywords, Identifiers, Variables, Operators: Arithmetic, Relational, Logical,
Assignment, Ternary, Bitwise, Unary Operators, Expressions and statements, Input and Output in C++,
manipulators with parameters, Flow of control - if, if-else, while, do-while, for loop, Switch, break and
continue.
UNIT-II
Defining and initializing arrays, accessing array elements, Single and multidimensional arrays.
Character array, string variables, reading multiple lines, arrays of strings, specifying the structure,
accessing structure members, array of structures. Classes and objects, Class declaration, Data
member and Member functions, private and public members, scope resolution operator.
UNIT-III
Inline Functions, Passing objects as arguments, returning objects, Function overloading, Friend
function, constructors, destructors, overloaded constructors, Types of Constructor, operator
overloading: Unary Operator, Binary Operator.
UNIT-IV
Inheritance: Derived Class and Base Class, specifying the derived class, accessing base class members,
the protected access specifier, abstract base class, single, multilevel, multiple inheritance, ambiguity and
multiple inheritance.
UNIT-V
Polymorphism: Introduction & types of polymorphism, Function overloading, operator overloading,
rules for overloading operators, overloading of unary & binary operators. Exception Handling: Try,
Throw, Catch, Throwing and Exception, Catching an Exception.
Course Outcomes (CO)
CO1 To understand how C++ improves C with object-oriented features.
CO2 To be able to explain arrays, classes and objects
CO3 To learn how to write inline functions for efficiency and performance.
CO4 To learn how containment and inheritance promote code reuse in C++.
CO5 To learn how to overload functions and operators in C++.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Books for References:
1. “Operating System Concepts” by AviSilberschatz and Peter Galvin.
2. “Operating Systems: Internals and Design Principles” by William Stallings.
3. “Operating Systems: A Concept-Based Approach” by D M Dhamdhere.
4. “Operating System: A Design-oriented Approach” by Charles Crowley.
5. “Operating Systems: A Modern Perspective” by Gary J Nutt.
6. “Design of the Unix Operating Systems” by Maurice Bach.
7. “Operating System Concepts: Windows Xp Update 6th Edition” by Silberschatz
Galvin Gagne.
8. ”Operating Systems” by Archer J Harris.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-112
Credit
4
Year/Semester
1/1
L-T-P
4-0-0
Course Name
Operating Systems
Objectives of the Course
● To provide students’ knowledge of Operating System and process control.
● To understand the concepts of threads, concurrency, memory management scheduling.
● To impart knowledge of I/O and files, distributed systems.
● Provide knowledge of security and networking.
● Student teams will implement a significant portion of an operating system.
Unit-I: Introduction to Operating Systems
Evolution of Operating Systems, Types of operating systems - Different views of the operating systems
– Principles of Design and Implementation. The process concept – system programmer’s view of
processes – operating system’s views of processes – operating system services for process management.
Unit-II: Process Management
Concept of process and process synchronization: Process Management and Scheduling, (Scheduling
Algorithms). Inter-process communication, Hardware requirements: protection, context switching,
privileged mode; Threads and their Management Tools and Constructs for Concurrency, Detection,
Prevention and Avoidance of deadlocks, Mutual Exclusion: Algorithms, semaphores – concurrent
programming using semaphores.
Unit-III: Memory Management
Memory Management paging, virtual memory management, Contiguous allocation – static, dynamic
partitioned memory allocation – segmentation. Non- contiguous allocation – paging – Hardware
support – Virtual Memory, Dynamic Resource Allocation.
Unit-IV: File Systems
A Simple file system – General model of a file system – Symbolic file system – Access control verification
– Logical file system – Physical file system – allocation strategy module – Device strategy module, I/O
initiators, Device handlers – Disk scheduling, Design of IO systems, File Management, directory
management.
Unit-V: Protection & Security
Protection & Security: Protection- Goals of protection, Domain of protection, Access matrix,
Implementation of access matrix, Revocation of access rights Security- The security problem,
Authentication, One-Time passwords, Threats.
Case Study: Study of different Operating, Systems (Linux, Windows, Android OS, MAC OS, iOS).
Course Outcomes (CO)
CO1 To understand the basic of Operating System
CO2 To provide knowledge of operating systems and process control.
CO3 To understand the concepts of threads, concurrency, and memory management scheduling.
CO4 To impart knowledge of I/O and files, distributed systems.
CO5 To Provide knowledge of security and networking.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Books for References:
1. E. Balaguruswamy, "Object-Oriented programming with C++",TMH, 5th Edition,
2011.
2. R.Lafore, "Object-oriented programming in TURBO C++", Galgotia, 1st Edition,
1997.
3. Y.P. Kanetkar, "Let us C++", BPB publication , 2nd Edition, 2015.
4. Stanley B. Lippman, Josée Lajoie, "C++ Primer", Pearson Education, 4th Edition.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-113
Credit
4
Year/Semester
1/1
L-T-P
4-0-0
Course Name
Computer Organization and Architecture
Objectives of the Course
● To understand the basics involved in data representation and digital logic circuits used in the
computer system.
● To know the general concepts in digital logic design, including logic elements, and their use in
combinational and sequential logic circuit design.
● To expose students to the basic architecture of processing, memory and i/o organization in a
computer system.
Unit I: Binary numbers and Arithmetic
Data and number re- binary-complement re, BCD- ASCII, conversion of numbers from one Number
system to the other, (r-1)’s & r’s complement re. Weighted and Unweighted Codes – Gray Code, Excess 3
Code, Binary Arithmetic, Floating Point Numbers. Computer arithmetic: addition, subtraction,
multiplication & division Fundamentals of Boolean Algebra, Logic gates (AND, OR, NOT, XOR, NAND,
NOR), MINTERM, MAXTERM, truth table, Boolean expression, simplification, Boolean Algebra, K- map
up-to 4 variable, Canonical Forms
Unit II: Combinational and Sequential Circuit
Adder, Subtractor , BCD adder, multiplexer, De-multiplexer, encoder, decoder, Sequential Circuits:
Flip-Flop (SR, JK, D, T, Master-slave), Application of flip-flop-- Asynchronous counter up-to 4 bit,
decade counter, mod-n-counter, Synchronous counter—ring counter, Johnson’s count, Up down
counter, Register
Unit III: Memory Organization and I/O interface
Types of memory RAM ROM, EPROM, DRAM, SRAM, Addressing Modes, Associative memory, main
memory, virtual memory, secondary memory, I/O interface, polling, interrupts, DMA, mode of data
transfer
Unit IV: CPU Organization
CPU organization, instruction format, addressing mode, RISC, CISC, Von- Neumann- Architecture
Pipeline & vector processing, Pipeline structure, speedup, efficiency, throughput and bottlenecks.
Arithmetic pipeline and Instruction pipeline
Unit V: Multiprocessors
Characteristics of Multiprocessors, Interconnection Structures:- Time- Shared Common Bus, Multipart
Memory, Crossbar Switch, Multistage Switching Networkand Hypercube Interconnection.
Interprocessor Arbitration:- System Bus, Serial Arbitration Procedure, Parallel Arbitration Logic and
Dynamic Arbitration Algorithms. Cache Coherence:- Conditions for Incoherence and Solutions to the
Cache Coherence Problem. Booth’s. Dual Core, C2D
Course Outcomes (CO)
CO1: Ability to understand the Binary system and working of Arithmetic and Logic Unit.
CO2: Ability to design, implement and analyze data paths for instruction execution.
CO3: Ability to understand the concepts of Memory Organization.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
CO4 Ability to understand design of instruction, analyze and evaluate the performance of
processors.
Books for References:
1. Modern Digital Electronics, R.P. Jain, 4e, Tata Mc Graw Hill.
2. Computer Organization & Architecture, William Stallings, 8e, Pearson Education.
3. Computer Architecture & Organization, John P. Hayes, 3e, Tata McGraw Hill.
4. Computer Organization, 5e, Carl Hamacher, Zcon ko Vranesic Safwat
Zaky, Tata McGraw Hill.
5. Digital Computer Fundamentals, Bartee C. Thomas , McGraw-Hill International
Edition.
6. Computer System Architecture, M. Morris Mano, Pearson Education.
7. Computer Architecture & Organization, Nicholas Carter, McGraw Hill.
8. Computer Architecture & Organization, 2e, Miles Murdocca& Vincent Heuring, Wiley India.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-114
Credit
4
Year/Semester
1/1
L-T-P
4-0-0
Course Name
Discrete Mathematics
Objectives of the Course
● To get familiar and understand the fundamental notions in discrete mathematics.
● To understand and demonstrate the basic concept of an algorithm and its application in
combinatorial mathematics.
● To identify the basic properties of graphs and trees and model simple applications.
● To understand the basic concept of group theory and its application.
● To get familiar with some statistical measures.
UNIT-I: Fundamentals - Sets and Relations, Operations on sets, Sequences, Division in the Integers,
Matrices, Logic - Proposition and logical operations, Methods of Proof, Mathematical Induction
UNIT-II: Mathematical Logic – Statements and Notation, Connectives, Normal Forms, Theory of
Inference for the Statement Calculus, Inference Theory of the Predicate Calculus
UNIT-III: Counting – Permutations, Combinations, The Pigeonhole Principle, Recurrence Relations,
Relations and Digraphs - Product Sets and Partitions, manipulation of Relations, Transitive Closure &
Warshall's Algorithm
UNIT-IV: Functions - Function for Computer Science, Permutation Functions, Growth of Functions
UNIT-V: Graph Theory – Basic Concept of Graph Theory, Euler's Path & Circuits, Hamiltonian Path &
Circuits, Ordered Sets Lattices, Finite Boolean Functions as Boolean Polynomials, Trees.(Minimal
Spanning Trees)
Course Outcomes (CO)
CO1 Understand the Fundamentals of Set theory
CO2 Understand the concepts and procedures of Logical calculations.
CO3 To apply the concepts in daily business situations.
CO4 To analyse the solutions for their decision making.
CO5 Evaluate different mathematical procedures for business.
Books for References:
Text Books:
1. Discrete Mathematical Structures: Bernard Kolman, Robert C. Busby & Sharon Ross, PHI.
2. Discrete Mathematical Structures with Applications to Computer Science: J.P. Tremblay
& R. Manohar, Tata McGraw Hill.
3. Discrete Mathematics: J.K. Sharma, McMillan.
Reference Books:
1. Discrete Mathematics: S.K. Chakraborty and B.K. Sarkar, Oxford Uni. Press, India.
2. Combinatorial Mathematics: C.J. Liu.
3. Discrete Mathematics with Graph Theory: E. Goodaire, PHI.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-115
Credit
4
Year/Semester
1/1
L-T-P
4-0-0
Course Name
Financial Accounting
Objectives of the Course
● To help students acquire the practical knowledge of Accounting.
● To equip them with the understanding of the counting process and preparation of final accounts.
● To ensure the understanding of the subsidiary books and Bank reconciliation statement.
● To impart knowledge on the Bills of Exchange and its usage.
Unit-I: Introduction and Accounting Process
Financial Accounting - Meaning – Definition – Functions - Advantages and Limitations – Users of
Accounting Information – Principles of Accounting- Concepts and Conventions - Branches of
Accounting – Accounting System- Types of Accounts – Accounting Cycle: Journal- Ledger and Trial
Balance (Including problems).
Unit-II: Subsidiary Books
Meaning- Types - Purchases Book - Sales Book - Purchases Returns Book - Sales Returns Book, –
Bills Receivables Book - Bills Payables Book - Single Column, Two Column, Three Column and Petty
Cash Book - Journal Proper (Including problems).
Unit-III: Bank Reconciliation Statement
Meaning – Need - Reasons for differences between Cash Book and Pass Book balances – Favourable and
Overdraft balances – Ascertainment of correct Cash Book balance - Preparation of Bank Reconciliation
Statement (Including problems).
Unit-IV: Bills of Exchange
Bills of Exchange - Definition- Promissory notes and Bills of exchange-Recording of Transactions relating
to Bills- Books of Drawer and Acceptor- Honour and Dishonour of Bills- Renewal of bills- Retiring of bills
under rebate- Accommodation bills (Including problems).
Unit-V: Final Accounts
Final Accounts, Financial Accounts, Sample Accounts, Capital and revenue expenditure, Trading and
Profit and Loss Accounts, Balance Sheets, Adjustments, Published Accounts, Depreciation, Terminal
Value, Revaluation, Intangible Assets, Stock Valuation, Dyson Patent case.
Course Outcomes (CO)
• CO1- To Compare the Financial Accounting, Cost Accounting and Accounting for
Management
• CO2-To understand various accounting terms and principles
• CO3 -To describe the various books of accounts
• CO4- To Apply the concept of the Bill of Exchange
• CO5 -To Evaluate the Preparation Final accounts for various organisations,
Books for References:
1. Accountancy-I: Haneef and Mukherjee, Tata McGraw Hill Company.
2. Principles & Practice of Accounting: R. L. Gupta & V. K. Gupta, Sultan Chand.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
3. Accountancy-I: S.P. Jain & K.L Narang, Kalyani Publishers.
4. Accountancy–I: Tulsian, Tata McGraw Hill Co.
5. Advanced Accountancy-I: S. N. Maheshwari & V. L. Maheshwari, Vikas.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-121
Credit
4
Year/Semester
1/2
L-T-P
4-0-0
Course Name
Python Programming
Objectives of the Course
● To acquire programming skills in core Python
● To acquire Object Oriented Skills in Python
● To develop the skill of designing Graphical user Interfaces in Python
● To develop the ability to write database applications in Python
Unit I -Introduction to Python Programming Language
Introduction to Python Language, Strengths and Weaknesses, IDLE, Dynamic Types, Naming
Conventions, String Values, String Operations, String Slices, String Operators, Numeric Data Types,
Conversions, Built In Functions.
Unit II- Data Collections and Language Component
Introduction, Control Flow and Syntax, Indenting, The if Statement, Relational Operators, Logical,
Operators, True or False, Bit Wise Operators, The while Loop, break and continue, The for Loop,
Lists, Tuples, Sets, Dictionaries, Sorting Dictionaries, Copying Collections.
Unit III-Object and Classes
Classes in Python, Principles of Object Orientation, Creating Classes Instance Methods, File
Organization Special Methods, Class Variables, Inheritance, Polymorphism, Type Identification, Custom
Exception Classes.
Unit IV-Functions and Modules
Introduction, Defining Your Own Functions, Parameters Function Documentation , Keyword and
Optional Parameters. Passing Collections to a Function, Variable Number of Arguments, Scope Functions
- "First Class Citizens" Passing Functions to a Function, Mapping Functions in a Dictionary, Lambda
Modules , Standard Modules ( sys Standard Modules, math Standard Modules), time, The dir Function.
Unit V-I/O and Error Handling In Python : Introduction: Data Streams, Creating Your Own Data
Streams, Access Modes , Writing Data to a File, Reading Data From a File. Additional File Methods Using
Pipes as Data Streams. Handling IO Exceptions, Working with Directories, Metadata Errors, Run Time
Errors. The Exception Model, Exception Hierarchy, Handling Multiple Exceptions.
Course Outcomes (CO)
CO1: Interpret the fundamental Python syntax and semantics and be fluent in the use of Python control
flow statements.
CO2: Express proficiency in the handling of strings and functions.
CO3: Determine the methods to create and manipulate Python programs by utilizing the data
structures like lists, dictionaries, tuples and sets.
CO4: Identify the commonly used operations involving file systems and regular expressions.
Understand
CO5: Articulate the Object-Oriented Programming concepts such as encapsulation, inheritance and
polymorphism as used in Python.
Books for References:
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
1. Python Crash Course, 2nd Edition: A Hands-On, Project-Based Introduction to
Programming.
2. Python Cookbook: Recipes for Mastering Python 3.
3. Learn Python in 1 Day: Complete Python Guide with Examples.
4. Python Programming: An Introduction to Computer Science.
5. Python Pocket Reference: Python in Your Pocket.
6. Python Machine Learning: Machine Learning and Deep Learning with Python,
scikit-learn, and TensorFlow.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-122
Credit
4
Year/Semester
1/2
L-T-P
4-0-0
Course Name
Data Structure
Objectives of the Course
● To learn how the choice of data structures impacts the performance of programs.
● To study specific data structures such as arrays, linear lists, stacks, queues, hash tables, binary
trees, binary search trees, heaps and AVLtrees.
● To learn efficient searching and sorting techniques.
UNIT-I: Introduction
Basic Terminology, Data structure, Time and space complexity, Review Of Array, Structures, Pointers.
Stack: Definition, Representation, Stack operations, Applications (Infix– Prefix–Postfix Conversion &
Evaluation, Recursion)
UNIT-II: Queues
Definition, Representation, Types of queue, Queue operations, Applications. Linked Lists: Dynamic
memory allocation, representation, Linked list insertion and deletion, Searching, Traversing in a list,
Doubly linked list, Sparse matrices
UNIT-III: Trees
Tree Terminologies, General Tree, Binary Tree, Representations, Traversing, BST, Operations on BST,
Heap tree, AVL Search Trees, M-way search tree, Applications of all trees
UNIT-IV: Sorting
Selection Sort, Bubble sort, Insertion Sorts, Merge Sort, Quick Sort, Radix Sort, Heap sort. Searching:
Linear search, Binary search
UNIT-V: Searching
Linear Search, Binary Search and Fibonacci Search . Greedy Algorithms – Knapsack Problem – Dynamic
Programming – Optimal Binary Search Tree - Warshall‟s Algorithm for Finding Transitive Closure
Course Outcomes (CO)
CO1: Ability to choose appropriate data structures to represent data items in real world problems.
CO2: Ability to analyze the time and space complexities of Algorithms combinations.
CO3: Implement and know the application of algorithms for sorting and pattern matching.
CO4: Ability to design programs using a variety of data structures such as stacks, queues, hash tables,
binary trees, search trees, heaps, graphs, and B-trees.
Books for References:
1. Horowitz E. & Sahni S and S. Rajasekaran, "Fundamentals of Computer
Algorithms", Universities Press, 2nd Edition, 2008.
2. Aho, Hopcroft & Ullman, "The Design and Analysis of Computer Algorithms",
Pearson, 1st Edition, 1974.
3. T.H.Cormen, C.E Leiserson, R.L.Rivest and C.Stein," Introduction to Algorithms",
PHI, 3rd Edition, 2009.
4. D.E. Knuth, "Fundamental Algorithms", Addison-wesley, 3rd Edition.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-123
Credit
4
Year/Semester
1/2
L-T-P
4-0-0
Course Name
Software Engineering
Objectives of the Course
● Software engineering incorporates various accepted methodologies to design software. This
subject gives a detailed description of the entire process of developing a software project and
also the issues associated after development. This course covers the introductory concepts of
software engineering and its design.
Unit 1: Software Product and Process
Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models – System
Engineering – Computer Based System – Business Process Engineering, Overview – Product Engineering
Overview.
Unit 2: Software Requirements
Functional and Non-Functional – Software Document – Requirement Engineering Process –
Feasibility Studies – Software Prototyping – Prototyping in the Software Process – Data – Functional
and Behavioral Models – Structured Analysis and Data Dictionary.
Unit 3: Analysis, Design Concepts and Principles
Systems Engineering - Analysis Concepts - Design Process and Concepts – Modular Design– Design
Heuristic – Architectural Design – Data Design – User Interface Design – Real Time Software Design –
System Design – Real Time Executives – Data Acquisition System – Monitoring and Control System.
Unit 4: Testing
Taxonomy of Software Testing – Types of S/W Test – Black Box Testing – Testing Boundary Conditions
– Structural Testing – Test Coverage Criteria Based on Data Flow Mechanisms – Regression Testing –
Unit Testing – Integration Testing – Validation Testing – System Testing and Debugging – Software
Implementation Techniques
Unit 5: Software Project Management
Measures And Measurements – ZIPF’s Law – Software Cost Estimation – Function Point Models–
COCOMO Model – Delphi Method – Scheduling – Earned Value Analysis – Error Tracking – Software
Configuration Management – Program Evolution Dynamics – Software Maintenance – Project Planning
– Project Scheduling– Risk Management – CASE Tools
Course Outcomes (CO)
CO1: Ability to identify the minimum requirements for the development of application
CO2: Ability to develop, maintain, efficient, reliable and cost effective software solutions
C03: Ability to critically thinking and evaluate assumptions and arguments by using variant software
architectural styles & software process models
CO4: Understanding of software testing approaches such as unit testing and integration testing
Books for References:
1. Ian Sommerville, “Software engineering”, Seventh Edition, Pearson Education Asia, 2007
2. Roger S. Pressman, “Software Engineering – A practitioner’s Approach”, Sixth Edition, McGraw-
Hill International Edition, 2005
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-124
Credit
4
Year/Semester
1/2
L-T-P
4-0-0
Course Name
Data Communication and Networking
Objectives of the Course
● To know about networks and topologies
● To know the knowledge about the layered communication architectures(OSI and TCP/IP) and
its functionalities
● To understand the principles of data communication and internet protocol
● To know the knowledge about application layer protocols
UNIT: I
Overview of Data Communications and Networking. Networking - Needs and Advantages, Network
Types- Client, Server and Peers. Network Topology-Bus, Star,Ring, Star and Mesh Topologies (Features,
Advantages and disadvantages of each type). Mode of data communication. Analog and Digital data and
signals
UNIT: II
Digital Transmission: Line coding, Sampling, Transmission mode. Analog Transmission: Modulation
of Digital Data. Multiplexing: FDM, WDM and TDM, Transmission Media: Guided Media, Unguided
media (wireless), Switching techniques: Circuit switching and Packet switching
Unit: III
Data Link Layer: Error Detection and correction: Type of Errors, Detection, Error Correction. Data Link
control and protocols: Flow and error Control, Stop-and-wait ARQ. Go-Back-N - ARQ, Selective Repeat
ARQ, HDLC. Point-to-Point Access: PPP.Point-to Point Protocol, PPP Stack. Multiple-Access: Random
Access, Controlled Access, Channelization. Local Area Network: Ethernet. Traditional Ethernet, Fast
Ethernet, Gigabit Ethernet. Token bus (IEEE- 802.4), Token ring (IEEE-802.5)
UNIT: IV
Network Layer: Host to Host Delivery: Internetworking, addressing and Routing. Network Layer
Protocols: ARP, IPv4, ICMP, IPv6, Transport Layer; Process to process Delivery: UDP; TCP congestion
control and Quality of service
UNIT: V
Application Layer: Client Server Model, Socket Interface, Domain Name System (DNS): Electronic Mail
(SMTP) and File transfer (FTP), Telnet, HTTP and WWW, Cryptography
Course Outcomes (CO)
CO1 Analyze a complex computing problem and to apply principles of computing and other
relevant disciplines to identify solutions.
CO2 Design, implement, and evaluate a computing-based solution to meet a given set of
computing requirements in the context of the program's discipline.
CO3 Communicate effectively in a variety of professional contexts.
CO4 Recognizes professional responsibilities and makes informed judgments in computing
practice based on legal and ethical principles.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Books for References:
1. B.A. Forouzan, "Data Communication and Networking", TMH, 4th Edition, 2006
2. A.S. Tannenbaum, "Computer Networks", Pearson, 5th Edition, 2012
3. William Stallings , "Data and Computer Communications", Pearson, 8th
Edition,2009
4. Rajneesh Agrawal, "Data Communication And Computer Networks", SChand,
1stEdition, 2005.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-125
Credit
4
Year/Semester
1/2
L-T-P
4-0-0
Course Name
Theory of Computation
Objectives of the Course
● Introduce students to the mathematical foundations of computation including automata theory;
the theory of formal languages and grammars; the notions of algorithm, decidability, complexity,
and computability
● Enhance/develop students' ability to understand the computation and algorithms
● Develop and conduct mathematical proofs for computation and algorithms
● To understand about Turing Machine
UNIT–I
Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata (DFA)-
Formal Definition, Simplified notation: State transition graph, Transition table, Language of DFA,
Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of
NFA and DFA, Minimization of Finite Automata, FA with output: Moore and Mealy machine,
Equivalence of Moore and Mealy Machine, Applications and Limitation of FA
UNIT–II
Regular expression: Definition, Operators of regular expression and their precedence, Algebraic
laws for Regular expressions, Regular expression to FA, DFA to Regular expression, Arden Theorem,
Non-Regular Languages, Pumping Lemma for regular Languages. Application of Pumping Lemma,
Closure properties of Regular Languages, Decision properties of Regular Languages
UNIT–III
Context Free Grammar: Definition, Examples, Derivation, Derivation trees, Ambiguity in Grammar,
Inherent ambiguity, Ambiguous to Unambiguous CFG, Useless symbols,
Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure properties ofCFLs, Decision
Properties of CFLs: Emptiness, Finiteness and Membership, Pumping lemma for CFLs
UNIT–IV
Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA,
Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and CFG,
CFG to PDA and PDA to CFG, PDA with two stacks
UNIT–V
Turing Machine: Basic model, definition and representation, Instantaneous Description, Language
acceptance by TM, Variants of Turing Machine, TM as Computer of Integer functions, Universal TM,
Recursive and recursively enumerable languages, Halting problem, Introduction to Undecidability,
Undecidable problems about TMs. Post correspondence problem (PCP), Modified PCP, Introduction to
recursive function theory
Course Outcomes (CO)
1. Design deterministic and non-deterministic finite state machines and understand their
capabilities and limits
2. Design deterministic and non-deterministic context-free grammars and pushdown automata
3. Design and analyze machines, their capabilities and limitations
4. Demonstrate the understanding of complexity classes and current unsolved problems in
theoretical computer science
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
5. Apply the theoretical concepts to the practice of program design with regular expresisons,
parsing, and complexity analysis
Books for References:
1. John E. Hopcroft, Rajeev Motwani and Jeffery D. Ullman, Automata Theory,
Languages, and Computation (3rd. Edition), Pearson Education,2008.
2. Peter Linz ,An Introduction to Formal Languages and Automata, Paperback –
2011.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-231
Credit
4
Year/Semester
2/3
L-T-P
4-0-0
Course Name
Database Management
Objectives of the Course
● Understand the basic concepts and the applications of database systems.
● Master the basics of SQL and construct queries using SQL.
● Understand the relational database design principles.
● Familiar with the basic issues of transaction processing and concurrency control.
● Familiar with database storage structures and access techniques.
Unit I Relational Databases
Purpose of Database System – Views of data – Data Models – Database System Architecture – Entity
Relationship model – ER Diagrams - Introduction to relational databases - The relational Model – Keys.
Functional Dependencies – Non-loss Decomposition – Functional Dependencies – First – Second -
Third Normal Forms - Dependency Preservation – Boyce/Codd Normal Form - Multi-valued
Dependencies and Fourth Normal Form
– Join Dependencies and Fifth Normal Form.
Unit II Relational Query Languages
Relational Algebra - SQL fundamentals - Data Definition, Query Structure, Basic operations,
Additional Operations, Set Operations, Null Values, Aggregate Functions, Nested Subqueries -
Modification of the Database - Join Expressions, Views, Transactions, Integrity Constraints, SQL Data
Types and Schemas, Authorization - Advanced SQL features – Accessing SQL from a Programming
Language - Dynamic SQL (JDBC and ODBC), Embedded SQL, Functions and Procedural Constructs,
Triggers, Recursive Queries, Advanced Aggregation Features, OLAP
Unit III Transactions
Transaction Concepts - Transaction Recovery – ACID Properties – System Recovery – Media Recovery
– Two Phase Commit - Save Points – SQL Facilities for recovery – Concurrency – Need for Concurrency
– Locking Protocols – Two Phase Locking – Deadlock – Recovery Isolation Levels – SQL Facilities for
Concurrency
Unit IV Database Implementation
Overview of Physical Storage Media – Magnetic Disks – RAID – Tertiary storage – File Organization –
Organization of Records in Files – Indexing and Hashing –Ordered Indices – B+ tree Index Files – B tree
Index Files – Static Hashing – Dynamic Hashing – Query Processing Overview
Unit V Spatial Database and Data base security
Representation of Spatial data, Spatial data operators and indexing, , Security architecture, Database
application security models
Course Outcomes (CO)
CO1 Explain the basic concepts of relational data model, entity-relationship model, relational
database design, relational algebra and SQL.
CO2 Design ER-models to represent simple database application scenarios.
CO3 Convert the ER-model to relational tables, populate relational databases and formulate SQL
queries on data.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
CO4 Improve the database design by normalization.
CO5 Familiar with basic database storage structures and access techniques: file and page
organizations, indexing methods including B tree, and hashing.
Books for References:
1. C.J. Date, An Introduction to Database Systems, Vol I & II, Addison Wesley.
2. Korth Silberschatz, Database System Concepts, McGraw Hill.
3. J.D. Ullman, Principles of Database Systems, Galgotia.
4. Wiederhold, Database Design, McGraw Hill.
5. R. Elmasri, and S.B. Navathe, Fundamentals of Database Systems, Pearson
EducationAsia.
6. Raghu Ramakrishnan, Database Management Systems, McGraw-Hill Education.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-232
Credit
4
Year/Semester
2/3
L-T-P
4-0-0
Course Name
Web Technology
Objectives of the Course
● Internet technologies are getting upgraded as each day passes. There are many web
technologies. HTML, CS, JavaScript are a few of them. This course gives an introduction to web
technologies and the internet. WWW, protocols, HTML, CSS and XML are covered in this course
Unit I - Web Essentials & Mark-up Languages
Clients, Servers, and Communication. The Internet-Basic Internet Protocols -The World Wide Web-HTTP
request message-response message-Web Clients Web Servers
Mark-up Languages: XHTML. An Introduction to HTML History-Versions-Basic XHTML Syntax and
Semantics-Some Fundamental HTML Elements-Relative URLs-Lists-tables-Frames- Forms- XML
Creating HTML Documents
Unit II – Style Sheets & Client Side Programming
Style Sheets: CSS-Introduction to Cascading Style Sheets-Features-Core Syntax-Style Sheets and
HTML Style Cascading and Inheritance-Text Properties-Box Model Normal Flow Box Layout-
Beyond the Normal Flow-Other Properties
Unit III – Client-Side Programming:
The JavaScript Language-History and Versions Introduction JavaScript in Perspective-Syntax-
Variables and Data Types-Statements-Operators- Literals- Functions-Objects-Arrays-Built-in Objects-
JavaScript Debuggers
Unit IV–Host Objects and Server-side programming
Host Objects: Browsers and the DOM-Introduction to the Document Object Model DOM History and
Levels-Intrinsic Event Handling-Modifying Element Style-The Document Tree- DOM Event Handling-
Accommodating Non Compliant Browsers Properties of window
Server-Side Programming: Java Servlets- Architecture -Overview-A Servlet-Generating Dynamic
Content-Life Cycle- Parameter Data-Sessions-Cookies- URL Rewriting-Other Capabilities-Data Storage
Servlets and Concurrency
Unit V – Web Data & JSP
Representing Web Data: XML-Documents and Vocabularies-Versions and Declaration- Namespaces
JavaScript and XML: Ajax-DOM based XML processing Event-oriented Parsing: SAX-Transforming XML
Documents-Selecting XML Data: XPATH-Template based Transformations: XSLT-Displaying XML
Documents in Browsers
JSP Technology Introduction-JSP and Servlets-Running JSP Applications Basic JSP-JavaBeans Classes and
JSP-Tag Libraries and Files-Support for the Model-View-Controller Paradigm
Course Outcomes (CO)
CO1 Understand the use of web terminologies and their uses
CO2 Understand the Client side programming
CO3 Understand the MVC architecture and develop applications.
CO4 Understand multiple client and server-side components along with Ajax.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
CO5 Develop web applications using a combination of client-side (JavaScript, HTML, XML, and
WML)
Books for References:
1. Jeffrey C. Jackson, "Web Technologies--A Computer Science Perspective", Pearson
Education, 2006.
2. Robert. W. Sebesta, "Programming the World Wide Web", Fourth Edition, Pearson
Education, 2007.
3. Deitel, Deitel, Goldberg, "Internet & World Wide Web How To Program", Third
Edition, Pearson Education, 2006.
4. Marty Hall and Larry Brown, “Core Web Programming”, Second Edition, Volume I and II,
Pearson Education, 2001.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-233
Credit
4
Year/Semester
2/3
L-T-P
4-0-0
Course Name
Information Security
Objectives of the Course
● The objective of the course is to familiarize the participants with the security and control system
use in the business world
Unit I: Introduction: need for security, security approaches, principle of security, risk to introduction
system. Security: physical security, logical security, threats to security
Unit II: Cryptographic technique: plain text and Cipher text, substitution technique, transportation
technique encryption and decryption, symmetric and assenter key, steganography, key range and
key size, possible type attack
Unit III: Computer based Symantec key cryptographic algorithms: Introduction algorithm types and
model overview of symmetric key cryptography, data encryption standard, IDEA, RCS, blowfish, AES
Unit IV: Computer based asymmetric key cryptographic algorithms: Introduction, RSA algorithm, digital
signature, knapsack algorithm
Unit V: Public key infrastructure, digital certificate, private key management, PKCS, XML, PKI and
security
Course Outcomes (CO)
CO1: Understand basic fundamentals of security
CO2: Understand Cryptographic techniques and other related concepts
CO3: Learn to create cryptographic algorithms
CO4: Understand Public and Private Key management
Books for References:
1. Cryptography and network security, Atil Khate, TMH.
2. PC and LAN Security by Stephen Cobb.
3. Enterprise Disaster Recovery Planning by Moira.
4. Computer Security for dummies.
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-234
Credit
4
Year/Semester
2/3
L-T-P
4-0-0
Course Name
Artificial Intelligence
Objectives of the Course
● To provide comprehensive and in-depth knowledge of AI principles and techniques by
introducing AI’s fundamental problems
● To give insight of the state-of-the-art models and algorithms used to undertake these problems.
● To expose students to the frontiers of AI-intensive computing and information systems
Unit-I Introduction to Al and Production Systems
Problem formulation, Problem Definition-Production systems, Control strategies’, Search strategies.
Problem characteristics, Production system characteristics -Specialized productions system- Problem
solving methods – Problem graphs, Matching, Indexing and Heuristic functions -Hill Climbing-Depth
first and Breadth first, Constraints satisfaction – Related algorithms, Measure of performance and
analysis of search algorithms. Intelligent agents: reactive, deliberative, goal-driven, utility-driven, and
learning agents
Unit-II Problem-solving through Search
Forward and backward, state-space, blind, heuristic, problem-reduction, A, A*, AO*, minimax,
constraint propagation, neural, stochastic, and evolutionary search algorithms, sample applications
Unit-III Knowledge Re and Reasoning
Ontologies, foundations of knowledge re and reasoning, representing and reasoning about objects,
relations, events, actions, time, and space; predicate logic, situation calculus, description logics,
reasoning with defaults, reasoning about knowledge, Knowledge re-Production based system, Frame
based system. Inference –Backward chaining, Forward chaining, Rule value approach, Fuzzy reasoning
– Certainty factors, Bayesian Theory- Bayesian Network-Dempster – Shafer theory
Unit IV Machine learning and Knowledge Acquisition
Learning from memorization, examples, explanation, and exploration. Learning nearest neighbor, naive
Bayes, and decision tree classifiers, Q-learning for learning action policies, applications. Sample
applications of AI
Unit V Expert systems
Architecture of expert systems, Roles of expert systems – Knowledge Acquisition – Meta knowledge,
Heuristics. Typical expert systems – MYCIN, DART, XOON, Expert systems shells
Course Outcomes (CO)
CO1: Demonstrate fundamental understanding and Apply basic principles of AI in solutions that
require problem solving, inference, perception, knowledge representation, and learning.
CO2: 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.
CO3: Demonstrate proficiency developing applications in an 'AI language', expert system shell, or
data mining tool.
CO4: Demonstrate proficiency in applying scientific method to models of machine learning.
CO56) Demonstrate an ability to share in discussions of AI, its current scope and limitations, and
societal implications.
Books for References:
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
1. Artificial Intelligence – A Modern Approach (3rd Edition): By – Stuart Russell and
Peter Norvig
2. Artificial Intelligence Engines: A Tutorial Introduction to the Mathematics of Deep
Learning By – James V Stone
3. Artificial Intelligence by Example By – Denis Rothman
4. Artificial Intelligence and Machine Learning By – Chandra S.S.V
5. Artificial Intelligence Basics: A Non-Technical Introduction By – Tom Taulli
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
Program Name
OMCA
Program Code
601
Course Code
OMCA-235
Credit
4
Year/Semester
2/3
L-T-P
4-0-0
Course Name
Soft Computing
Objectives of the Course
● To know Neural Network techniques and its applications
● To know various Soft Computing techniques
● Get knowledge of fuzzy logic. To know applications of advanced Neural Networks
● Get knowledge of Applications of Hybrid soft computing techniques
UNIT–I
Introduction to Soft Computing: Evolution of Computing - Soft Computing Constituents –From
Conventional to Computational Intelligence - Machine Learning Basics
UNIT–II
Neural Networks: Machine Learning using Neural Network, Adaptive Networks, Feed Forward
Networks, Supervised Learning Neural Networks, Radial Basis Function Networks, Reinforcement
Learning, Unsupervised Learning Neural Networks, Adaptive Resonance Architectures, Advances in
Neural Networks
Unit III
Fuzzy Logic: Fuzzy Sets, Operations on Fuzzy Sets, Fuzzy Relations, Membership Functions, Fuzzy Rules
and Fuzzy Reasoning, Fuzzy Inference Systems, Fuzzy Expert Systems, Fuzzy Decision Making
UNIT–IV
Neuro-Fuzzy Modelling: Adaptive Neuro-Fuzzy Inference Systems, Coactive Neuro- Fuzzy Modelling,
Classification and Regression Trees, Data Clustering Algorithms, Rule base Structure Identification,
Neuro-Fuzzy Control – Case Studies
UNIT–V
Genetic Algorithms: Introduction, Building block hypothesis, working principle, Basic operators and
Terminologies like individual, gene, encoding, fitness function and reproduction, Genetic modelling:
Significance of Genetic operators, Inheritance operator, crossover, inversion & deletion, mutation
operator, Bitwise operator, GA optimization problems
Course Outcomes (CO)
CO1: Learn about soft computing techniques and their applications
CO2: Analyze various neural network architectures
CO3: Understand perceptron’s and counter propagation networks.
CO4: Define the fuzzy systems
CO5: Analyze the genetic algorithms and their applications.
Books for References:
1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and
SoftComputing”, PHI India
2. Kwang H. Lee, “First course on Fuzzy Theory and Applications”, Springer–Verlag
Berlin Heidelberg
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
CAPSTONE PROJECT GUIDELINES
The Capstone Project provides an opportunity for students to engage in high-level work focusing on
an area of specialization within the profession. Capstone projects (CP) will be inquiry and practice-
cantered, and will draw upon areas of interest to the student. It is a summary of the main learning
from throughout the course or it can be in-depth exploration of one or more areas from a program
that is studied.
Students will identify the topics for their Capstone Project during their course work. It takes
inspiration
from curriculum in the degree program. It demonstrates the skills of student which they learned
during
the course which indicates their understanding in the subject matter.
A successful Capstone Project shall:
1) Illuminate and bring new insight to an area of the music education field;
2) Demonstrate a depth and breadth of knowledge and the application of this knowledge to
scholarship and/or practice;
3) Present a clearly articulated investigative framework, while situating projects within established
academic practices and/or ideas;
4) Offer inquiry-based argumentation for educational/curricular change and adaptation where
conceptual propositions are tied to in-the-world realities.
Project should be a Research Project or it may be an operational assignment that involves working
(40-50 days) by the students in an organization.
In case of an operational assignment
1)
Students are expected to do a project work in an organization.
2)
The students should identify specific problems faced by the organization in a functional
area in which the assignment is given
3)
In this study students should focus on Identifying the reasons / factors responsible for
the problems faced by the organization
• Collection of data (Primary & Secondary) related to reasons /factors responsible for
these problems
• Data Analysis tools & interpretation
• Findings & observations.
• Suggestions (based on findings & observations) for improving the functioning of the
organization.
Report will include the following Chapter Scheme
1)
Introduction: - This chapter will give a reader the background of problem area, specific
problem & how you come across it?
2)
Company profile
UTTARANCHAL UNIVERSITY
(Established vide Uttaranchal University Act, 2012, Uttarakhand Act No. 11 of 2013)
Premnagar-248007, Dehradun, Uttarakhand, INDIA
3)
Literature Review (in case of Research based Project)
4)
Objectives of the study / Tasks Undertaken– (for Operational Assignment)
5)
Research Methodology (in case of Research based Project)
6)
Data analysis & interpretation / Activities Undertaken for completion of Tasks– (for
Operational Assignment)
7)
Findings & Suggestions
8)
Learnings from the study
9)
Annexures