B.Sc.

(AI & ML)

CBCS Pattern with Effect from the Academic Year 2022-2023

Structure of Curriculum

Course Title HoursA eek Credits

Theorv Practical

Semester -I
Fundamentals of Information 4 3 4+ l=5
Technology
Semester -II

Object Oriented Programming with 4 J 4+l--5

Python

Semester -III
Operating Systems with Linux 4 3 4+l:5
Semester -IV
Data Analytics 4 3 4+l=5

Semester -V
Artificial Intelligence 4 3 4+l=5

Semester -VI
Machine Leaming 4 3 4+l:5

@ Y M , ^-*o n-
fA
2D1
u q \-----
Alo
\\\"\
)^4
l
Nf -

":.DLP
ffir70ft
V,"

L\
?v
 B.Sc. (Computer Science)
CBCS Pattern with Effect from the Academic Year 2022-2023

SEMESTER - I
Fundamentals of Information Technology

Theory 4 Hours/Week 4 Credit Internal marks : 20

Practical 3 Hours/Week I Credit External Marks = 80

Objectives:
l. To deal with the basic concepts ofcomputers.
2. To discuss about the computer hardware, its components and basic computer
architecture.
J To understand the basic computer software including the operating system andits
concepts,
4, To introduce the softrvare development process
5. To introduce the basic concept of programming

Outcomes:
Students should be able to
.
I Identify the components of a computer and their functions.
2. Understand the concept ofnetworking, LAN, Internet, and working ofwww.
3. Understand the notion ofproblem solving using computer by programming
4. Understand the notion of Software Project and the Process of software development

Unit-I
Data and Information: Introduction, Types of Data, Simple Model of a Computer, DataProcessing
Using a Computer, Desktop Computer [Reference I ]
Acquisition of Numbers and Textual Data: lntroduction, Input Units, Intemal Representation of
Numeric Data, Representation of Characters in Computers, Error-DetectingCodes [Reference l]

Unit-lI
Data Storage: Introduction, Storage Cell, Physical Devices Used as Storage Cells, Random Access
Memory, Read Only Memory, Secondary Storage, Compact Disk Read Only Memory (CDROM),
Archival Store [Reference l]
Central Processing Unit: lntroduction, Structure of a Central Processing Unit, Specifications of a
cPU, Interconnection of cPU with Memory and I/o Units, Embedded processors [Reference l]

Unit-III
computer Networks: Introduction, Local Area Network (LAN), Applications of LAN, wide Area
Network (WAN), Intemet, Naming Computers Connected to Internet, Future of Intemet Technology
[Reference l] : ..-
Operating systems: Functions of operating systems, types of operating systems, Device & ,
Resoucemanagement
Input output Devices: Introduction, Keyboard, video Display Devices, Touch ScreenDisplay, E-Ink
Display, Printers, Audio Output [Reference I ]
computer software: lntroduction, operating System, programming Languages, classification of
Programminq Lqnguages, Classification of Programming, Languages Basedon Applications IReference
rt - 172->7-
\N${.i
\., ;;
.. , .' y:- ..- o' -i '
V ,. Vy\,
 B.Sc. (Computer Science)
CBCS Pattern with Effect from the Academic year 2022_2023

SEMESTER-I
Fundamentals of Information Technology (Lab)

Practical 3 Hours/IVeek I Credit Marks: 25

Objective
The main objective of this laboratory is to familiarize the students
with the basic hardware
and software in computers

Exercises
l. Assembly and disassembly of a system box and identifying various parts inside
the
system box to recognize various parts ofa typical computer system
2. Assembly and disassembly of peripheral devices- keyboard and mouse and
study of
their interface cables, connectors and ports.
3. Installation of Operating Systems-Windows and Linux
4. Disk defragmentation using system tool.
5' Procedure ofdisk partition and its operation (shrinking, Extending,
Delete, Format).
6. Installing and uninstalling ofdevice drivers using control panel.
7' working practice on windows operating system and Linux operating system: creating
file, folder. Copying, moving, deleting file, folder
8. User Account creation and its feature on windows operating system and
changing
resolution, color, appearances, and Changing System Date and Time.
9. Installation and using various wireless input devices (Keyboardrvlouse/scanners
etc.,)under Windows/Linux.
l0' Study ofvarious types ofmemory chips and various types ofhard disk drives,partition
and formatting of hard disk.
I t. Installation of scanner, modem and network cards in Windows/Linux.
12. Assembly and disassembly of printer, installing a printer, taking test page,
and using
printer under Windows/Linux.
t3. Installation of application software's - Office Automation, Anti-Virus.
14. Demonstrate the usage of Word and power point in Windows and Linux
15. Configure Internet connection, Email Account creation, reading, writi ng and
sending
emails with attachment.
-.t'{ \' -(.

*{,,p"
w t
h
*,',

v.tr v*-L-- 7
Unit-IV
Database Management Systems: Data models, RDBMS, SQL, Database Transactions, data
centers, cloud services
The software Problem: cost, schedule, and Quality, Scale and change [Reference 2] software
Processes: Process and Project, Component Software Processes, Software Development Process
Models [Reference 2]
Programming Principles and Guidelines: structured Programming, lnformation Hiding, some
Programming Practices, Coding Standards [Reference 2l

References
I v Rajaraman. Introduction to Information Technology, 3'd Edition, PHI Leaming Private
Limited,20l8
2. Pankaj Jalote. Concise Introduction tosoftware Engineering, Springer, 201 I

@ +l )e4 \

@*tu,
,
ve"p Nq/
\
 B.Sc. (Computer Science)
CBCS Pattern with Effect from the Academic year 2022_2023

SEMESTER _ II
OBJECT ORIENTED PROGRAMMING USING PYTHON
Theory 4 Hours/Week lnternal marks = 20
Practical 4 Credit External Marks = 80
3 Hours/Week
I Credit
UNIT I
Identifiers, Keywords, Statements and Expressions,
variables, operators, precedence and
Associativity, Data Types, Indentation, comments,'Reaoing
rnprt, print output, Type conversions,
The rype0 Function and Is c)oerator, Dynamic ano'st.onlty
ryped Language, contror Flow
Statements, The if Decision contror Frow
statement, Theif...else Decision control Flow
statement, The if...erif...erse Decision contror
staiement, ltest"d if Statement, The whire Loop,
The for Loop, The continue and break Statements,
cut"t ing e^..ptions Using try and except
statement, Functions, Buil!In Functions, commonly
U..a'ruroaur"r, Function Definition and
calling the Function, The retum statement and void"Function,
Scope and Lifetime ofvariables,
and -if.*"igr, Command Line Arguments.
Default Parameters, Keyword Arguments, *args

UNIT II
creating and storing strings, Basic String operations,
Accessing characters in String by
Index Number, String sricing and Joining, String
Methods, Formatting strings, Lists, creating
Lists, Basic List operations, Indexing unJsti.inglin
Lists, Built-ln Functions Used on Lists, List
Methods, The del statement. Dictionaries: creating
Dictionary, Accessing and Modifying key:
value Pairs in Dictionaries, Bu t-rn Functions
Used on Dictionaries, Dictionary Methods, The
del
Statement, Tuples and Sets, creating Tupres,
Basic Tuple operations, Indexing and slicing in
Tuples, Built-In Functions Used on Tuples, Relation
bet*ee., Tupres and Lists, Relation berween
Tuples and Dictionaries, Tuple Methods, using
zip0 Function, Sets, set Methods, Traversing of
Sets, Frozenset.
UNIT III
and Reading Text Data, File Methods to Read
3f::^r^11",t,:.:arins
Keaorng ancl wnting Binary Fires, The pickre Module,
and Write Data,
and path Modules' Reourar Expression operationr,
os
csv-Fi;,
Reading and writing os pyhon
urirg Speciil characteis, Regutu.
Methods, Num"ic.oops i'" pytr,"" R;;;;"E.p..r.iois,
Regular E;;;;rrt"; with glob
mffi1""
UNIT IV
creating.classes in Py'thon, creating objects in python,
The constructor Method, classes
with Multiple objects, class Attributes u""r,
ouiu eit.iiui"s, rn.rprrtation, Inheritance, The
Polymorphism

@ i k^ q

\ ueJ
ffi* t
/,
Text Books:

I . Gowrishankar S, Veena A, "lntroduction to Plhon Programming", I st

Edition, CRC Press/Taylor & Francis,20l8. ISBN-I3: 978-0815394372
References:

l. Jake VanderPlas, "Python Data Science Handbook: Essential Tools for Working with
Data", lst Edition, O'Reilly Media, 2016. ISBN- I 3: 978-149 19 12058
2. AurelienGeron, Hands-On Machine Leaming with Scikit-Leam and TensorFlow: Concepts,
Tools, and Techniques to Build Intelligent Systems", 1st Edition,O'Reilly Media, 2017.

ISBN - l3: 978-1491962299.

3. Wesley J Chun, "Core Pyhon Applications Programming", 3rd Edition, Pearson Education

India, 201 5. ISBN-l 3: 978-9332555365

4. Miguel Grinberg, "Flask Web Development: Developing Web Applications with

Pyhon", 2nd Edition, O'Reilly Media, 2018. ISBN-13: 978-1491991732.

@
a ,Vl,,'*A-. ,)

@e1
\ VL t-r'
t
\q(
q,
 B.Sc. (Computer Science)
CBCS Pattern with Effect from the Academic Y ear 2022-2023

PYTHON PROGRAMMING LAB

Practical 3 HoursMeek I Credit Marks: 25

Course objective:
To implement Python programs with conditionals and loops. Also represent compound data
usingPyhon lists, tuples, dictionaries and Read and write data from/to files in Python.

l. Compute the GCD of two numbers.

2. Find the square root of a number (Newton's method)

J. Exponentiation (power of a number)
4. Find the maximum of a list of numbers
5. Linear search and Binary search
6, Selection sort, Insertion sort

7. First n prime numbers

8. Multiply matrices
9. Programs that take command line arguments (word count)

10. Find the most frequent words in a text read from a file
ll. Simulate elliptical orbits in Pygame

12. Simulate bouncing ball using Pygame

@ --l ^)
\<
[J@{
W
q
v bL-L D---2.=

'\,'A
 cB cs pa t te rn *,,n' f i;.f ?il.,ifi : i::il3,. y ear 20tz -2023

SEMESTER - III
Operating Systems with Linux

UNIT I
operating system: concept, components of operating System, operating System operations,
Protection and Security. computing Environment. Abstract vieu. of os] user view, System
view, operating system serv.ices, System calls: concept, Types of system ca[s. io,nput".
System Architecture: single-processor systems, Multiprocessor Systems. Types
of operating
systems: Batch operating sysrem, Murti-programmed operaiing system, Time'-shared
operating system, Real rime operating system, Distributea opiating systems. process
Management: Process Concept, operation on processes, cooperating p.oJ".ses,.
Inter-process
communication, Threads. Linux operating system: Introductio-n to Linux oS,
Basic
Commands of Linux OS.
UNIT II
Process Synchronization: Introduction, The critical-secrion probrem
with solution, Bakery
Algorithm, synchronization hardware, semaphores, Semaphores Implementation,
blassicat
Problems of Synchronization with algorithms, Critical Regions,
Monitors. cru scrreauting:
Basic. Concepts,_ Scheduring c_riteria, scheduring argorithms,
Murtilever qr"u" i"t.auting,
Multilevel Feedback eueue Scheduring. Linui olerating System: n.oi"r.
t tunug"r"nt
Commands and System Calls.
UNIT III
Deadlock: System Moders, Deadlock characterization, Resource A
ocation Graph, Deadlock
Prevention, Avoidance, Detection and Recovery, Bani<er's algorithm.
Memory iraunu!"o,"nt,
Main Memory: contiguous y.-oy
Alrocation, Fragmentati-on, paging, Anj s"grr,.'ntution.
virtual Memory: Demand paging, page Repracement,-page repracemenialgorithm jAllocation
of Thrashing. Linux operating Sysiem: Memory fuunug"..nt coninands
.frames, and System
Calls.
UNIT IV
o.evigl and Secondary Storage Management: F e-System Interface:
fjle,
Methods, Directory and Disk. structure. F i-system Struiture,
concepts, Access
File-System rrnptimlntation,
Directory Implementation, Alrocation- y:thd:, Free-Space Management.
o.ri""r,- iyp". or
devices, channels and contror Unit, Multiple paths, Biock
Murtipiexing. s""on*ury dL.ug",
Mass-Storage srructure, Disk structure, Disl scheduiing Algorithms,
oiri rra"r"g..ini nan
structure of disk. Linux operating System: File Management
commands.ra syrti. c.ii..
TEXT EOOKS:
silberschatz, Galvin, Greg, "operating system concepts", wiley and
^L. Sons, 9th Edition,
2015.
2' Sumitabha Das' "Unix concept and programming", McGraw H I education, 4th
Edition,
2015.
j
REFERENCE BOOKS:
I . God_bole, Achyut, "operating system", McGraw-Hilr
Education, 2nd Edition, 2005.
2' william Stallings, "operating System: Intemals and Design principles,,, person, gth
Edition,
2018.
3. A. S. Tanenbaum, "Mo dern Operating Systems ", pearson,
3rd Edition, 2007.
4. Kenneth H. osenet al, "UNIX: The Complete Reference',. McGraw-H ill/Osborne , 6th
Editi

D I E&-,1-
 \JperalruB DlsLgru A uurluqpt ualEu arpptuaux , I ata rugrJraw-hlll,
and Edition, 2006.
6. ,ladnick E. and Donovan J., "Operating Systems", Tata McGraw Hill, 2001 .

B.Sc. (ComPuter Science)

CBCS Pattern with Effect liom the Academic Y ear 2022'2023
Operating Systems with Linux Lab

Practical 3 HoursAVeek I Credit Marks: 25

LEARNING OBJECTTVES:
In this course, the leamers will be abte to develop the working expertise of the following:-

l. Perform Linux Operating System Installation.

2. Implement the policies of Process Management, Inter process communication and Memory

Management

3. Apply the basics of File Management, Device and Disk Storage Management

@ "-^'A ^, )w --l- '7w

Bo.
[il4.
\ vry.
1

ff,v.
 GBCS pa ttern *,,f #"::lfi Hfi : f;:l:*. y ear 2022_2023

SEMESTER _IV
DATAANAIYTICS
UNIT-I:
Introduction to Big Data: Introduction to Big Data platform
- chalrenges of conventional
systems- web data - Evolution of Analytic scalability, anallic process uni toolr, Analysis vs
Reporting - Modern data analytic tools,
statistical concepts: Sampling distributions, resampling, statistical inference,
prediction error.
UNIT _ II:
Data Analysis: Regression modeling,_Multivariate anarysis,
Bayesian modeling, inference and
Bayesian networks, Support vector and Kemel methods
Analysis of rime series: Linear systems analysis, nonlinear
Neural Networks: Learning and and Generarisation,
dynamics -
Rure induction -
competitive Ieaming, rrinc-ipal coiponent
analysis and neural networks
Fuzzy.Logic: extracting fuzzy models from data, fuzzy decision
trees, stochastic search
methods.
UNIT _ III:
Mining Data Streams: Introduction to streams Concepts
- Stream data model and architecture
-, stream. computing, Sampring data in a stream -' Filtering ,,r"".. cou*ing"airtir"t
elements in a stream - Estimating nloments - -Decaying
- counting oneness
Real. time Anaryics pratform (RTAp) apprications
in a window -
1inlow .-
sennment analysts, stock market predictions.
- case studies rear time -
UNIT _ IV:
Frequent Itemsets and crustering: Mining Frequent itemsets
Apriori Algorithm - Handring largi data r.tr in Muin Memory -
Market based Modeling -
counting frequent itemsets in a Siream clustering Techniques-
rimitea pass ergJ,n- -
-
clustering high dimensional data - cLIeUE and proLLUS Frequent - Hierarchical - i<-ta""nr.
methods - clustering in non-Euclidean space clustering
- pattem-based .iurt.ring
- for streams and paralrelism.

TEXT BOOKS:
L
Intelligent Data Analysis, Michael Berthold, David J. Hand, Springer,
2007
2' Mining of Massive Datasets, Anand Rajaraman and Jeffrey David Ullman,
cambridge
University Press, 20 l2

REFERENCES:
l- the Big Data Tidar wave: Finding opportunities in Huge Data streams
-Taming with
Advanced Analytics, Bitl Franks, John Wiley & Sonr,)OtZ
2'-Big Data Glossary, Glenn J. Myatt, Making sense of Data, John
wiley & Sons, pete warden,
O'Reilly, 2011
3. Data Mining concepts and rechniques, Jiawei Han, Micheline Kamber,
2nd Edition,
Elsevier,2008

ril,.-),r
ry*j Nfr
 B.Sc. (Computer Science)
CBCS Pattern with Effect from the Academic Y ear 2022-2023

DATA ANATYTICS TAB

Practical 3 Hours/Week I Credit Marks: 25

COURSE OBJECTIVES:
. To explore and understand various data management and handling methods
. To understand the concept of data analytics
. To use Big Data tools and techniques for data processing

Data Processing Tool - Hive (NoSQL query based language)

Hive command line tool allows you to submit jobs via bash scripts.
Identifying properties of a data set:
We have a table'user data'that contains the following fields:
data date: string
user id: string
properties: string
The properties field is formatted as a series of attribute=value pairs.
Ex: Age:21; state:CA; gender:M;

Lab Instructions:
l Create the table in HIVE using hive nosql based query.
2. Fill the table with sample data by using some sample data bases.
3. Write a program that produces a list of properties with minimum value(min-value), largest
value(max-value) and number of unique values. Before you start, execute the prepare step to
load the data into HDFS.
4. Generate a count per state.
5. Now that extracted the properties, calculate the number ofrecords per state'
6. Write a progmm that lists the states and their count from the data input.

A,J )er', \*
@ 1

\J
{)p. ,l
V-----z---
N4-
ffi'v. v )
 B.Sc. (Computer Science)
CBCS Pattern with Effect from the Academic Year 2022-2023

SEMESTER_V
ARTIFICIAL INTELLIGENCE
UNIT - I:
Introduction: AI problems, foundation of AI and history of AI intelligent agents: Agents and
Environments, the concept of rationality, the nature of environments, structure o1 agents,
problem solving agents, problem formulation.

UNIT - II:
Searching: Searching for solutions, uniformed search strategies Breadth first search, depth
limited Search.
-
Search with partial information (Heuristic search) Greedy best first search, A* search, Memory
-bounded heuristic search
Local search algorithms- Hill climbing, Simulated annealing search, Local beam search,
Cenetic algorithms

UNIT - III:
constraint satisfaction Problems: Backtracking search for csp's, Local search for cSp
Game Playing: Adversial search, Games, Minimax algorithm, optimal decisions in multiplayer
games, Alpha-Beta pruning, Evaluation functions, cutting of sear;h.

UNIT _ IV:
Knowledge Representation: Procedural Versus Declarative knowledge, using predicate logic,
representing facts in logic, functions and predicates, Conversion to cLuse form, Resolution in
propositional logic, Resolution in predicate togic, Unification.

UNIT * V:
Learning: What is learning, Leaming by Taking Advice, Leamin g in Problem-solving,
Leaming from example: induction, Explanation-based leaming. Introduction to Neural
Networks, Differenttypes of Learning in Neural Networks, Applications of Neural Networks,
Recurrent Networks.
Expert system: Representing and using Domain Knowledge, Reasoning with knowledge,
Expert System Shells-examples, Knowledge acquisition skills-examples.

TEXT BOOKS:
l. Artificial Intelligence A Modem Approach, stuart Russell and peter Norvig, 3rd Edition,
Pearson Education
2. Artificiat Intelligence, Kevin Knight, Elaine Rich, B. shivashankar Nair, 2nd Edition, 200g
3. Artificial Neural Networks, B. Yagna Narayana, pHI
!

REFERENCES:
l. Expert Systems: Principles and Programming, Giarrantana, Riley,4th Edition, Thomson
2. PRoLoG Programming for Artificial Intelligence, Ivan Bratka, 3rd Edition, pearson
Education
3. Neural Networks, Simon Haykin, pHI
lntelligence, Parrick Henny Winston, 3rd Edition, pearson Education
,fr\fft",
\ \ [}.
' _-2,
2-i / 1,
i " v-ti-'-
- .. .j \ .,
 B.Sc, (Computer Science)
CBCS Pattern with Effect from the Academic Y ear 2022-2023
ARTIFICIAL INTELLIGENCE LAB

Practical 3 HoursAVeek I Credit Marks: 25

COURSE OBJECTIVES:
. To apply various AI search algorithms
. To explore various knowledge representation concepts and Logic in AI

l.Write a program to solve any problem using depth first search.

2.Write a program to solve any problem using best first search algorithm
3. Write a program to implement depth limit search
4.Write a program to implement heuristic approach
S.Write a program to implement tic_tac_toe with min_max algorithm
6.Write a program to implement A*algorithm
7. Illustrate Knowledge representation using online tools.

0 -ry- k^ ./}-

w ,---_--..---:

ffr" w
 B.Sc. (Computer Science)
CBCS Pattern with Effect from the Academic Year 2022-2023

SEMESTER-VI
MACHINE LEARNING
UNIT - I:
Introduction to Machine Learning: Human leaming, types of human leaming, machine
leaming, types of machine leaming, problems not to be solved using machine leaming,
applications of machine learning, tools in machine learning, Issues in Machine Leaming.
Supervised Learning: Classifi cation
Introduction, example ofsupervised learning, classification model, classification learning steps,
classification algorithms: K-Nearest Neighbour (k-NN), Decision tree, Random Forest modil,
Support vector machines.

UNIT - II:
Supervised Learning: Regression
Introduction, examples of regression, common regression algorithms: simple linear regression,
multiple linear regression, assumptions in regression analysis. Main problems in re-gression
analysis, improving accuracy of the linear regression model, polynomial regressiori model,
logistic regression model, maximum likelihood estimation.

UNIT _ III:
Unsupervised Learning
Introduction, unsupervised vs supervised learning, applications of unsupervised learning,
clustering: clustering as a machine leaming task, diffirent types of clusiering techniquei,
partitioning methods, k-medoids, hierarchical clustering, density-[a5s6 methods 6sscAN.
-
UNIT _ IV;
Modelling and Evaluation:
Selecting a model: Predictive and Descriptive models, Training a model (for supervised
learning): Holdout method, K-fotd cross-validation method, Bootst;p sampling, Lazy is Eager
learner. Model representation and interpretability: underfitting, ovirfitting, Eiu, vu.i-""
-
trade-off. Evaluating performance of a model: supervised leaming classiircation, regression,
Unsupervised learning
-
- clustering, Improving performance of a model.

TEXT BOOKS:
l. Machine Learning, Saikar Dutt, Subramanian Chandramouli, Amit Kumar Das, pearson India
2. Machine Learning, Tom M. Mitchell, McGraw-Hill Education

,)
1.!!^J
)a
,I
t
0{
o.-->-
 B.Sc, (Computer Science)
CBCS Pattern with Effect from the Academic Year 2022-2023
MACHINE LEARNING LAB

Practical 3 HoursMeek I Credit Marks: 25

COTIRSE OBJECTIVES:
. To get an overview ofthe various machine learning techniques
. To demonstrate single layer and multilayer feed forward neural networks
. To understand training, building and evaluate a model
. To demonsEate real word case study

I. Implement k-Nearest Neighbour (k-NN) and Decision Tree leaming algorithm

2. Implement Random Forest model leaming algorithm and Support vector machines learning
algorithm
3: Implement Linear Regression learning algorithm.
4: Implement logistic Regression Ieaming algorithm.
5: Implement unsupervised k-means algorithm
6: Model Training:
7. Holdout, K-Fold cross validation and Bootstrap Sampling
8. Evaluating Model Performance:
9. Supervised Leaming- Classification
I 0. Supervised Leaming- Regression

I l. Unsupervised Leaming-Clustering

0 n )L h o_ 'Tw ,1,*\

[e@0/

r-->,= 'r.d"-F -....-.