LNCT UNIVERSITY, BHOPAL

Programme:- MCA (AI/ML) Semester - I wef: July 2024

Name of Theory
Paper Code
Paper Credit Marks
Data Structures L T J EST CAT Total
MAI-101
using C 3 1 0 80 20 100

The objective of this course is to provide the students with foundations in the basic
Course
concepts of C programming and data structures. Also to bring out the importance of data
Objective
structures in a variety of applications.

Hours
Units Contents (Theory)
/week

Fundamentals of C Programming: Introduction, Tokens, Type Casting, Storage Class,

I Control Statements, Functions, Recursion, Arrays and Strings, Structure and Union, 8
Pointers, Dynamic memory allocation, Unions, File Management.

Stack and Queue: Abstract Data Types (ADT), stack ADT, Operations and Applications
of stack, array and linked list implementations of stack, Queue ADT, Types of Queue:
II 8
Circular Queue, Priority Queue and Double Ended Queue, Operations and Applications of
Queue, Array and Linked list implementations of Queue.

Linked List: List ADT, Singly linked list, Circular linked list, Doubly linked list, Various
III operations on Linked list, Implementation of linked list using array, Applications of linked 8
list – Polynomial Manipulation.

Trees: Definition, Tree Terminologies, Binary Trees and its type: various theorems, Binary
tree traversals, Applications of trees - Huffman Algorithm, Expression Tree, Threaded
IV binary trees, Binary search tree, Operations on BST, Balanced Trees - AVL Tree, Splay 8
Tree, Red Black Tree, M Way search trees- B-Tree , B+ Tree, Forests, conversion of forest
into tree. Heap- Heap operations and Applications: Binomial Heap and Fibonacci Heap.

Graph: Introduction, Representation of graph , Graph Traversals - Depth-first and breadth

first traversal, Applications of graphs - Topological sort, shortest-path algorithms -
Dijkstra’s algorithm ,Bellman-Ford algorithm ,Floyd Warshall’s Algorithm, Minimum
spanning tree – Prim's and Kruskal's Algorithm.
V
Searching, Hashing and Sorting: Requirements of a search algorithm; sequential search, 8
binary search, indexed sequential search, interpolation search; hashing-basics, methods,
collision, resolution of collision, chaining; Internal sorting- Bubble sort, selection sort,
insertion sort, quick sort, merge sort on linked and contiguous list, shell sort, heap sort.
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Text Books/Reference Books:-

Name of Authors Titles of the Book Edition Name of the Publisher
BPB Publications, New
Yashvant P Kanetkar Let Us C VII
Delhi.
E. Balagurusami Programming in ANSI C IV Tata McGraw Hill
YashwantKanetkar Understanding Pointers in C V BPB
Kruse R.L Data Structures and Program Design in C II PHI
Trembly Introduction to Data Structure with IV
Applications
TennenBaum A.M & Data Structures using C & C++ III PHI
others

COURSE OUTCOMES: Students will be able to

CO1 Understand the fundamentals and structure of programming language C with file handing.
CO2 Describe, explain and use abstract data types including stacks and queues.
CO3 Design and implement linked list data structures.
Explain Tree data structure and applications of trees in solving complex computational
CO4
problems."
Understand Graph algorithms, search techniques, hashing methods, and sorting algorithms to
CO5
efficiently process and analyze data structures."
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Paper Theory
Name of Paper
Code Credit Marks
Data analysis L T J EST CAT Total
using Python,
Numpy, Pandas, MAI-102
Matplotlib and 3 1 0 80 20 100
Seaborn

Course The objective of this course is to provide the students with foundations in the basic
Objective concepts of Data analysis using Python, Numpy, Pandas, Matplotlib and seaborn.

Hours
Units Contents (Theory)
/week

Python programming Basic: Python interpreter, IPython Basics, Tab completion,

I Introspection, %runcommand, magic commands, matplotlib integration, python 8
programming, language semantics, scalar types. Control flow.

Data Structure, functions, files: tuple, list, built-in sequence function, dict, set,
II functions, namescape, scope, local function, returning multiple values, functions are 8
objects, lambda functions, error and exception handling, file and operation systems

NumPy: Array and Vectorized computation: Multidimensional array object.

Creating ndarrays, arithmetic with numpy array, basic indexing and slicing, Boolean
III indexing, transposing array and swapping axes, universal functions, array-oriented 8
programming with arrays, conditional logic as arrays operations, file input and output
with array.

Pandas: Pandas data structure, series, Data Frame, Index Object, Reindexing,
dropping entities from an axis, indexing, selection and filtering, integer indexes,
IV arithmetic and data alignment, function application and mapping, sorting and ranking, 8
correlation and covariance, unique values, values controls and membership, reading
and writing data in text format.

Visualization with Matplotlib: Figures and subplots, colors, markers, line style, ticks,
labels, legends, annotation and drawing on subplots, matplotlib configuration
V 8
Plotting with pandas and seaborn: line plots, bar plots, histogram, density plots,
scatter and point plots, facet grids and categorical data
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Text Books/Reference Books:-

Name of Authors Titles of the Book Edition Name of the Publisher
Mark Lutz Programming Python Shroff/Murach, 2016
Michael Urban and Joel Python Programming 4th O`Reilly
Murach Edition
, 2010
David M. Baezly Python Cookbook Third O`Reilly
edition
W.Chun Core Python Programming Pearson

COURSE OUTCOMES: Students will be able to

CO1 To learn and understand Python programming basics and paradigm.
CO2 To learn and know the concepts of file handling, exception handling
CO3 To learn different type of arrays and their implementation
CO4 To learn about dictionaries in python, variance and covariance
CO5 To impart the knowledge of plots and subplots.
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Theory
Name of Paper Paper Code
Credit Marks
Computer L T J EST CAT Total
Architecture & MAI-103
Operating System 3 1 0 80 20 100

Course The main objective is to understand the concept of computer system and organization,
Objective memory management, and parallel processing concepts.

Hours
Units Contents (Theory)
/week

Computer System: Comparison of Computer Organization &Architecture, Computer

Components and Functions.
Fundamentals of Digital Logic: Boolean Algebra, Logic Gates, Simplification of
Logic Circuits: Algebraic Simplification, Karnaugh Maps. Combinational Circuits:
I Adders, Multiplexer & De-Multiplexer, Sequential Circuits: Flip-Flops (SR, JK & D), 8
Counters.
Memory System Organization: Classification and design parameters, Internal
Memory, Interleaved and Associative Memory, Cache Memory, Memory mappings,
Replacement Algorithms, Virtual Memory, External Memory, Direct Memory Access.

CPU Organization: CPU Building Blocks, CPU Registers and BUS Characteristics,
Registers and System Bus Characteristics; Instruction Format; Addressing Modes;
Interrupts: Concepts and types; Instruction and Execution Interrupt cycle; Hardwired
and Micro Program control; Introduction to RISC and CISC
II Multi-Processor Organization: Parallel Processing, Concept and Block Diagram, 8
Types (SISD, SIMD, Interconnect network, MIMD, MISD), Future Directions for
Parallel Processors, Performance of Processors
Pipelining: Data Path, Time Space Diagram, Hazards. Instruction Pipelining,
Arithmetic Pipelining

Operating system concepts: OS definition and services; Types and features: System
Calls types, System Programs
III Process vs. Thread: Process states, process control block; inter-process 8
communication; Process Synchronization: Classical problems of synchronization; CPU
Scheduling: Criteria; Algorithms: FCFS, SJF, Priority, Round- Robin, Critical section
problem and solution criteria, Semaphores.

Memory Management: Paging and Segmentation approaches, Virtual memory,

IV Demand Paging and Page Replacement algorithms; Deadlocks: necessary conditions, 8
prevention, avoidance and recovery, Banker's algorithm
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

File Management: File system Structure, allocation methods: Contiguous allocation,

V Linked allocation, indexed allocation: free space management: Bit vector, linked list, 8
grouping, counting: Directory implementation: Linear List, Hash table. Device
Management: Disk structure, Disk scheduling:, Selecting Disk Scheduling algorithm.

Text Books/Reference Books:-

Name of Authors Titles of the Book Edition Name of the Publisher
Dr. Tarun Varma,
Exploring Computer Organization and
Dr. Lakshmi Narayan
Architecture (Foundation of Digital 1st Notion Press
Gahalod,
Design and Codes)
Prof. Shradhha Shrivastava
M. Morris Mano, edition Computer System Architecture 3rd PHI
Computer Organisation and
Pal Chaudhary 3rd PHI
architecture
Tanenbaum Structured computer organization- 6th Pearson
A. Silberschatz, Galvin Operating System Concepts 8th
Andrew S Tanenbaum, , Modern Operating Systems 3rd Pearson Education
Schaum’s Outline of Operating
J. Archer Harris 1st McGraw-Hill
Systems
William Stallings Operating System 8th Pearson Education.

COURSE OUTCOMES: Students will be able to

CO1 Describe the fundamental organization of a computer system, addressing modes, and instruction
formats with memory hierarchies.
CO2 Learn and Understand various addressing modes also explain parallel processing concepts.
CO3 Explain multiprogramming and multi tasking with CPU Scheduling algorithms and
Synchronization.
CO4 Understand concepts of paging, segmentation and dead lock situation with Hash table and disk
scheduling algorithms.
CO5 Organizing, accessing, manipulating, and securing files and directories across different operating
systems."
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Theory
Name of Paper Paper Code
Credit Marks
Software L T J EST CAT Total
Engineering
MAI-104
Methodologies 3 1 0 80 20 100
and UML

To understand the software engineering methodologies involved in the phases

Course
of project development and study of the problem identify project scope,
Objective
objectives and infrastructure.

Hours
Units Contents (Theory)
/week

Software Engineering paradigms – Waterfall Life cycle model – Spiral Model –

I Prototype Model– Software Requirement - Requirements Elicitation Techniques 8
– Initial Requirements Document –– SRS Document – Requirements Change
Management - Project Management.

Software Design Abstraction – Modularity – Software Architecture – Cohesion

II – Coupling – Various Design Concepts and notations – Development of Detailed 8
Design & Creation of Software Design Document - Dataflow Oriented design –
Designing for reuse – Programming standards.

Scope – Classification of metrics – Measuring Process and Product attributes –

III Direct and Indirect measures – Reliability – Software Quality Assurance – 8
Standards. Need of Software Estimation – Function Point – Risk Management.

Software Testing Fundamentals – Software testing strategies – Black Box

Testing – White Box Testing – System Testing – Functional Testing – Structural
IV Testing – Regression Testing - Testing Tools – Test Case Management – 8
Challenges of Software Maintenance – Types of Maintenance. Software
Maintenance Organization – Maintenance Report.

Introduction to UML: Use Case Approach,: Identification of Classes and

V Relationships, Identifying State and Behavior, Use Case Diagram Class Diagram 8
– State Diagram - Sequence ‘Diagram – Activity Diagram – Deployment
Diagrams Case Study – LMS.
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Text Books/ Reference Books:-

Name of the
Name of Authors Titles of the Book Edition
Publisher
Software Engineering – A
R. S. Pressman VI McGraw Hill
practitioner’s approach
Pankaj Jalote Software Engg IV Narosa Publications
Ian Sommerville Software Engineering 6/e VI Addison-Wesley

COURSE OUTCOMES: Students will be able to

CO1 Understand various models and design SRS document.
CO2 Learn modular approach for design software.
CO3 Learn measures of software estimation and risk management.
CO4 Learn various software testing methods and their usage.
CO5 Understand UML and its need in the software development.
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Theory
Name of Paper Paper Code
Credit Marks
Introduction to L T J EST CAT Total
AI, Data Science,
Ethics and MAI-105
Foundation of 3 1 0 80 20 100
Data Analysis

Course The main objective is to understand the concepts and techniques of data science and
Objective data analysis.

Hours
Units Contents (Theory)
/week
Introduction to Data Science: Defining Data Science and Big Data, Benefits and Uses
of Data Science and Big Data, Facets of Data, Structured Data, Unstructured Data,
Natural Language, Machine generated Data, Graph based or Network Data, Audio,
I Image, Video, Streaming data, Data Science Process, Big data ecosystem and data 8
science, distributed file systems, Distributed programming framework, data integration
framework, machine learning framework, No SQL Databases, scheduling tools,
benchmarking tools, system deployments

Data Science Processes: Six steps of data science processes, define research goals, data
retrieval, cleansing data, correct errors as early as possible, integrating – combine data
II from different sources, transforming data, exploratory data analysis, Data modelling, 8
model and variable selection, model execution, model diagnostic and model comparison,
presentation and automation.
Introduction to Machine Learning: What is Machine Learning, Learning from Data,
History of Machine Learning, Big Data for Machine Learning, Leveraging Machine
Learning, Descriptive vs Predictive Analytics, Machine Learning and Statistics, Artificial
III Intelligence and Machine Learning, Types of Machine Learning – Supervised, 8
Unsupervised, Semi-supervised, Reinforcement Learning.
Types of Machine Learning Algorithms, Classification vs Regression Problem, Bayesian,
Clustering, Decision Tree, Dimensionality Reduction, Neural Network and Deep
Learning, Training machine learning systems

Introduction to AI: What is AI, Turing test, cognitive modelling approach, law of
IV thoughts, the relational agent approach, the underlying assumptions about intelligence, 8
techniques required to solve AI problems, level of details required to model human
intelligence, successfully building an intelligent problem, history of AI

V Introduction to Data Analytics: Working with Formula and Functions, Introduction to 8

Power BI & Charts, Logical functions using Excel, Analysing Data with Excel.
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Text Books/Reference Books:-

Name of Authors Titles of the Book Edition Name of the Publisher

Artificial Intelligence 3e: A

Stuart J Russell & Peter Norvig 1st Pearson
Modern Approach Paperback

Artificial Intelligence Kevin Knight, Elaine Rich, B. Nair 3rd McGraw-Hill

COURSE OUTCOMES: Students will be able to

CO1 Know the concepts of big data and its usage and its various streaming processes.
CO2 Know data modelling and its uses in real life.
CO3 Learn the concept of machine learning and its applications.
CO4 Know the uses and ethics of AI and processes to solve AI domain based problems.
CO5 Know power BI, its functions and analysis procedures.
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024
Practical
Name of Paper Paper Code
Credit Marks
P J ESP CAP Total
Lab in Data Structure MAI-106
8 0 120 80 200
Content: -

1. C Programming Review: Recap basic C syntax, functions, arrays, pointers, and structures.

2. Stack:-
• Implementing stack using arrays and linked lists.
• Operations: push, pop, peek.
• Exercises: evaluate postfix expressions, implement stack-based algorithms (e.g.,
parentheses matching).

3. Queues:-
• Implementing queue using arrays and linked lists.
• Operations: enqueue, dequeue, peek.
• Exercises: Linear Queue, Circular Queues, Priority Queues.

4. Linked Lists:-

• Implementing Multiple type of linked lists.

• Operations: insertion, deletion, traversal.
• Exercises: reverse a linked list, detect and remove loops.

5. Trees:-

• Implementing binary trees and binary search trees (BST).

• Tree traversals: preorder, inorder, postorder.
• Exercises: searching in a BST, finding the lowest common ancestor.

6. Graphs:-

• Representing graphs using adjacency matrix and adjacency list.

• Graph traversals: BFS and DFS.
• Exercises: shortest path algorithms (Dijkstra's or Floyd-Warshall), spanning tree
algorithms (Prim's or Kruskal's).

7. Sorting Algorithms:-

• Implementing and comparing sorting algorithms: bubble sort, insertion sort, selection
sort, quicksort, mergesort.
• Exercises: analyze time complexity, sort different types of data (numbers, strings).
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024
Practical
Name of Paper Paper Code
Credit Marks
Programming Lab in P J ESP CAP Total
MAI-107
C++ 2 - 30 20 50

Content:
1. Simple C++ programs to implement various control structures.
• if statement
• switch case statement and do while loop
• for loop
• while loop
• Array
2. Write a program Illustrating Class Declarations, Definition, and Accessing Class Members
3. Write a C++ Program to illustrate default constructor, parameterized constructor and copy
constructors
4. WAP to find the largest of three numbers using inline function.
5. Given that an EMPLOYEE class contains following members: data members: Employee
number, Employee name, Basic, DA, IT, Net Salary and print data members.
6. Write a C++ program to read the data of N employee and compute Net salary of each
employee (DA=52% of Basic and Income Tax (IT) =30% of the gross salary).
7. Write a C++ Program to display Names, Roll No., and grades of 3 students who have appeared
in the examination. Declare the class of name, Roll No. and grade. Create an array of class
objects. Read and display the contents of the array.
8. WAP to Illustrate Multilevel Inheritance.
9. WAP to Demonstrate Multiple Inheritances.
10. Write a Program to demonstrate friend function and friend class.
11. Write a C++ to illustrate the concepts of console I/O operations.
12. Write a C++ program to use scope resolution operator. Display the various values of the same
variables declared at different scope levels.
13. Write a Program to illustrate New and Delete Keywords for dynamic memory allocation
14. Write a C++ program to allocate memory using new operator.
15. WAP to demonstrate template class
16. WAP to demonstrate template function.
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Theory
Name of Paper Paper Code
Credit Marks

L T J EST CAT Total

Disaster
FC-111
Management - - -

The Programme has been framed with an intention to provide a general concept in the
Course dimensions of disasters caused by nature beyond human control as well as the disasters
Objective and environmental hazards induced by human activities with emphasis on Natural
disaster, Man-made disaster.

Hours
Units Contents (Theory)
/week

Introduction: Hazard, Risk, Vulnerability, Disaster; Disaster Management, Meaning,

Nature Importance, Dimensions & Scope of Disaster Management, Disaster
I 2
Management Cycle. National disaster management framework; financial arrangements
for Disaster management, International Strategy for Disaster reduction

Natural Disasters: Meaning and nature of natural disasters, their types and effects,
Hydrological Disasters - Flood, Flash flood, Drought, cloud burst, Geological
II Disasters- Earthquakes, Landslides, Avalanches, Volcanic eruptions, Mudflow 2
Unit,Wind related- Cyclone, Storm, Storm surge, tidal waves, Heat and cold Waves,
Climatic Change, Global warming, Sea Level rise, Ozone Depletion

Man made Disaster: CBRN – Chemical disasters, biological disasters, radiological

III disasters, nuclear disasters 2
Fire – building fire, coal fire, forest fire, Oil fire
Types of Man – made Disasters:
Accidents- road accidents, rail accidents, air accidents, sea accidents
IV 2
Pollution and deforestation- air pollution, water pollution, deforestation, Industrial
wastewater pollution, deforestation

Disaster Determinants: Factors affecting damage – types, scale population, social

status, habitation pattern, physiology and climate.
V 2
Factors affecting mitigation measures, prediction, preparation, communication, area
and accessibility, population, physiology and climate
 LNCT UNIVERSITY, BHOPAL
Programme:- MCA (AI/ML) Semester - I wef: July 2024

Text Books/Reference Book:-

Name of Authors Titles of the Book Edition Name of the Publisher
S. L. Goel Disaster Administration and Deep and Deep
Management, Text & Case studies- Publications
G.K. Ghosh Disaster Management A.P.H. Publishing
Corporation
Vinod K Sharma- Disaster Management IIPA
S.K. Singh, S.C. Kundu, Disaster Management William Publications
Shobha Singh

COURSE OUTCOMES: Students will be able to

CO1 Know disaster management processes and financial arrangements.
CO2 Know various natural disasters and its effects.
CO3 Know various Man Made disasters and its effects.
CO4 Know consequences of air pollution and deforestation.
CO5 Know disaster determinants and mitigation measures.