Computer Science & Engineering

Semester -VII
Branch: Computer Science & Engineering
)$ Code Course Title Lecture Tutorial Practical Credits
1 CSC701 Artificial Intelligence 3 0 0
2 PEC-III Professional Elective -III 3 0 0
3 PEC-IV Professional Elective -IV 3 0 0
4 OEC III Open Elective -III 3 0 0
5 OEC IV Open Elective -IV 3 0 0 3
6 CS701P Artificial Intelligence Lab. 0 0 2 1
7 CS702D Project-I 0 0 4 2
8 CS703I Internship Assessment II 0 0 2 2
Total credits 20

Code Professional Elective-III Any

( one) Code Professional Elective- IV(Any one)
CSP702 Machine Learning ITP705 Data Mining and Data Warehousing.
CSP703 Multimedia and Applications ITP706 Information Security.
CSP704 Human Computer Interaction CSP707 Computer Vision

Code Open Elective-III (Any one) Code Open Elective-IV(Any one)

ITO708 Software Engineering ITO711 Information Security
CSO709 Values and Ethics in Profession. CSO712 Cryptography
CSO710 *Data Mining ITO713 Knowledge Domain Development

* Not for CSE Students

 Semester -VIII
Branch: Computer Science & Engineering

S.N. Code Course Title L T P Credits

1. CS801D Project-II 16 08
Total Credit 08

NOTE- A Student can be allowed to do project outside after the permission of departmental Academic
Committee. Those students doing project outside has present their project progress every month. Those
students doing project outside can be permitted to present progress every fortnight though video
conferencing. Students doing project in house has present their project progress every week.
CSE / IT
 Computer Science & Engineering and Information Technology

Code: CSC701 Artificial Intelligence L T P C

3 0 0 3

COURSE OUTCOME

CO.1: Discuss basic concepts of Artificial Intelligence, AI(Artificial Intelligence) principles, AI

Task domains and application.
CO.2: Explain various searching techniques, constraint satisfaction problem, game playing
techniques and Apply these techniques in applications which involve perception, reasoning and
learning.
CO.3: Explain various searching techniques, constraint satisfaction problem, game playing
techniques and Apply these techniques in applications which involve perception, reasoning and
learning.
CO.4: Explain working of uncertainty management, decision making and learning methods.
CO.5: Apply different knowledge representation, reasoning, and learning techniques to real-
world problems.

CO-PO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10 P11 P12
CO.1 3 - - - - - - - - - - 3
CO.2 3 2 2 2 - - - - - - - -
CO.3 3 2 2 2 - - - - - - - -
CO.4 3 - - - - - - - - - - 2
CO.5 - 2 2 2 - - - - - - - -
*3: high, 2: moderate, 1 low

MODULE 1:

Introduction
Overview of AI, Problems of AI, AI techniques, Problem Solving, Problem Space and Search,
Defining the problem as state space search, Problem characteristics; Tic,Tac,Toe Problem
AI languages
Basic knowledge of AI programming languages like Prolog and Lisp .

MODULE 2:

Basic Search Techniques

Solving Problems by searching; Uniform search strategies; Breadth first search, depth first
search, depth limited search, bidirectional search, Best First search, comparing search strategies
in terms of complexity.

MODULE 3:

Special Search Techniques

Heuristic Search, greedy best,first search, A* search; Hill climbing search, Simulated Annealing
search; Genetic Algorithm; Constraint Satisfaction Problems; Adversarial search, Games,
Optimal decisions and strategies in games, Minimax search, Alpha,beta pruning.
Symbolic Logic
Syntax and semantics for propositional logic, Syntax and semantics of FOPL, Properties of WFF,
Clausal form, Unification, Resolution.

MODULE 4:

Reasoning Under Inconsistencies and Uncertainties :

Non,monotonic reasoning, Truth Maintainace System, Default Reasoning & closed world
assumption, Predicate completion and circumscription, Fuzzy Logic.
Probabilistic Reasoning
Bayesian probabilistic inference, Representation of knowledge in uncertain domain, Semantics
of Bayesian networks, Dempster, Shafer theory.

MODULE 5:

Structured Knowledge
Associative networks, Conceptual graphs, Frames structures.
Expert Systems
Rule based systems, Non production systems : decision tree architectures, black board system
architecture, neural network architecture.
Learning
Types of learning, general learning model, Learning by induction; generalization, specialization,
example of inductive learner.
Text book:

1. Elaine Rich, Kevin Knight and Shivashankar B Nair, “Artificial Intelligence”, Mc Graw
Hill Publication, 2009.
2. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert System”, Pearson
Publication,2015.

References:

1. Saroj Kaushik, “Artificial Intelligence”, Cengage Learning, 2011.

 Computer Science & Engineering and Information Technology
CSP702 Machine Learning L T P C
3 0 0 3

Course Outcome: At the completion of the course a student will be able to –

1. Discuss fundamental of machine learning, design and its application.

2. Differentiate various learning approaches, and to interpret the concepts of different
learning.
3. Illustrate and apply clustering algorithms and identify its applicability in real life
problems.
4. Discuss basics of neural network and its different model.
5. Describe different optimizations algorithm.

CO-PO Mapping-

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 3 1 2
CO2 3 2 3 1 1 2
CO3 3 3 2 2 1
CO4 3 2 2 2
CO5 2 2 3 1 2

MODULE 1: What is Machine learning, Basic principal, Utility of ML Well defined learning
system, Designing learning system, Challenges in ML, Application of ML.

MODULE 2: Linear Regression (with one variable and multiple variables), Gradient Descent,
Classification (Logistic Regression, Over fitting, Regularization, Support Vector Machines),
Decision Trees and issue in decision tree, Bayesian Learning – Bayes Theorem, Concept
Learning, Bayes Optimal Classifier, Naïve Bayes Classifier, Bayesian Belief Networks, EM
Algorithm.
MODULE 3:

Clustering (K-means, Hierarchical, etc.), Dimensionality reduction, Principal Component

Analysis, Anomaly detection, Feasibility of learning, Reinforcement learning.

MODULE 4:

Artificial Neural Networks, Artificial Perceptron’s, Gradient Descent and The Delta Rule,
Adaline, Multilayer Networks, Back-propagation Rule back-propagation Algorithm-
Convergence.

MODULE 5:

Evolutionary algorithm, Genetic Algorithms – An Illustrative Example, Hypothesis Space

Search, Genetic Programming, Swarm intelligence algorithm.

Text Book:
1. Understanding Machine Learning. Shai Shalev-Shwartz and Shai Ben-David. Cambridge
University Press.

2. Tom Mitchell. Machine Learning (McGraw Hill)

3. Artificial Neural Network, B. Yegnanarayana, PHI, 2005

Reference Book:
1. Christopher M. Bishop. Pattern Recognition and Machine Learning (Springer)
 Computer Science & Engineering and Information Technology
ITP706 "#%!'#" &(%'+ L T P C

3 0 0 3

Course Outcomes: At the end of the course the student will be able to:
% (31=5<7H3 >@=>3<A7BG =4 3@@=@A /<2 @3;3273A 7< >@=13AA3A 7<D=:D7<5 7<4=@;/B7=<
B316<=:=5G
% =<AC;;/B3 9<=E:3253 =4 @7A9 /<2 1=<B@=:A 7< * =>3@/B7=< 7< 7<2CAB@G

% 3B3@;7<3 * A31C@7BG 5C723:7<3A 4=@ D/@7=CA BG>3 =4 7<2CAB@73A

% D/:C/B3 /AA3B A/435C/@27<5 2/B/ 7<B35@7BG AGAB3;
34431B7D3<3AA /<2 AGAB3;
344717 3<1G

% +<23@AB/<2 A=4BE/@3 A31C@7BG /C27B7<5 7<1:C27<5 2/B/0/A3 A31C@7BG /C27B <3BE=@9 A31C@7BG
/C27B /<2 ;71@=1=;>CB3@ A31C@7BG /C27B

Mapping of course outcomes with program outcomes

=C@A3
$# $# $# $# $# $# $# $# $#
%CB1=;3A
%
%
%
%
%

Detailed syllabus:

Module1

Computer Auditing- System Access control, Data Access Control, Security Administration,
System Design.
Module 2

Hardware Security Controls - The Total System Needs Securing, Levels of Hardware Controls,
Operating System Controls , Access Controls, General-Purpose Operating Systems Security ,
Sources of Additional Information

Module 3

Software Controls - Software Security and Controls, Types of Software Intrusions, Configuration
Management , Modularity and Encapsulation, Protecting Information, Selecting Security
Software, Analysis of Software Products Database Security - Introduction to Databases,
Security Requirements of Databases, Designing Database Security.

Module 4:

Methods of Protection, Security of Multilevel Databases,The Future of Databases. Network and

Telecommunication Security - Telecommunications and Networks, Security Considerations,
Cases in Point, Special Communications, Security Considerations.

Module 5:

#71@=1=;>CB3@ )31C@7BG  #71@=1=;>CB3@ &@=0:3;A /<2 )=:CB7=<A  *63 #71@=1=;>CB3@ <D7@=<;3<B 

)31C@7BG =4 #71@=1=;>CB3@A <B3@</: /B/ )31C@7BG *63 *6@3/BA B= #71@=A 3D3:=>7<5
/ #71@= )31C@7BG
&:/< AB/0:7A67<5
/ #71@=B=#/7<4@/;3 "7<9  &=@B/0:3 #71@=1=;>CB3@ )31C@7BG  &/AAE=@2 &@=B31B7=<
)31C@7BG =4 )>317/: #71@= >>:71/B7=<A
Reading:
1. Deborah Russell, Computer Security Basics, O'Reilly & Associate, 1991.
2. Karen A. Forcht, Computer Security Management, Boyd & Fraser Publishing Co., 1994.
3. Donald A. Watne, Peter B.B. Turney, Auditing EDP Systems, 2nd Edition, PH 1990
 Computer Science & Engineering and Information Technology
CSO709 Values and Ethics in Profession L T P C
3 0 0 3

:?<=0 #?>.:80=

# 23<B74G B63 34431BA =4 B316<=:=571/: 5@=EB6 =< B63 A=173BG /<2 B63 :7;7B32 </BC@/: @3A=C@13A
# 23<B74G B63 3AA3<13 =4 ACAB/7</0:3 23D3:=>;3<B /<2 E7:: 03 /0:3 B= />>:G />>@=/163A B=
6/<2:3 3<3@5G 1@7A7A /<2 3<D7@=<;3<B >@=B31B7=<
# </:GH3 B63 7;>/1B =4 B316<=:=5G B@/<A43@ /<2 B63 >@=0:3;A =4 ;/< ;/167<3 7<B3@/1B7=<
4=@ B63 6C;/< =>3@/B=@A 7< 3<57<33@7<5 >@=831BA /<2 7<2CAB@73A
# >>:G 7<2CAB@7/: AB/<2/@2A 1=23 =4 3B671A /<2 @=:3 =4 >@=43AA7=</: 3B671A 7< 3<57<33@7<5 473:2
# AA3AA B63 >=AA70:3 D/:C3A 1@7A7A /B 27443@3<B :3D3:A /<2 B63 E/G =CB E7B6 B63 63:> =4 B63
1=<AB7BCB7=< /<2 ;=@/: /<2 3B671/: D/:C3A

#$# !,;;492

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10 P11 P12
IT6105.1 - - 2 - - 2 3 - - - - -
IT6105.2 - - 3 - - - 3 - - - - -
IT6105.3 - - 1 - 2 - 2 2 - - - -
IT6105.4 - - 3 - 2 3 - 3 - - - -
IT6105.5 - - 1 - 2 3 - 3 - - - -
Average 2 1.2 1.6 1.6 1.6
 6756:G  ;=23@/B3 /<2  :=E

!:/?70

)173<13 *316<=:=5G /<2 <57<33@7<5 /A !<=E:3253 /<2 /A )=17/: /<2 &@=43AA7=</: 1B7D7B73A 4431BA =4
*316<=:=571/:
@=EB6 (/>72 *316<=:=571/: 5@=EB6 /<2 23>:3B7=< =4 @3A=C@13A
(3>=@BA =4 B63 :C0 =4
(=;3 "7;7BA =4 5@=EB6 ACAB/7</0:3 23D3:=>;3<B <3@5G @7A7A (3<3E/0:3 <3@5G (3A=C@13A

!:/?70

<D7@=<;3<B/: 235@/2/B7=<
/<2 >=::CB7=< 1=4@73<2:G *316<=:=573A <D7@=<;3<B/: (35C:/B7=<A

<D7@=<;3<B/: B671A >>@=>@7/B3 *316<=:=5G #=D3;3<B =4 )16C;/163@ :/B3@ 23D3:=>;3<BA

!:/?70

*316<=:=5G /<2 23D3:=>7<5 </B7=<A &@=0:3;A =4 *316<=:=5G B@/<A43@ *316<=:=5G /AA3AA;3<B 7;>/1B
/</:GA7A C;/< %>3@/B=@ 7< <57<33@7<5 >@=831BA /<2 7<2CAB@73A &@=0:3;A =4 ;/< ;/167<3
7<B3@/1B7=< ;>/1B =4 /AA3;0:G :7<3 /<2 /CB=;/B7=< C;/< 13<B3@32 *316<=:=5G

!:/?70
B671A =4 &@=43AA7=<

<57<33@7<5 >@=43AA7=< B671/: 7AAC3A 7<
3<57<33@7<5 >@/1B713 =<4:71BA 03BE33< 0CA7<3AA 23;/<2A
/<2 >@=43AA7=</: 723/:A )=17/: /<2
3B671/: @3A>=<A707:7B73A =4 *316<=:=57ABA =23A =4 >@=43AA7=</:
3B671A
-67AB:3 0:=E7<5
/<2 03G=<2 /A3 ABC273A

!:/?70

&@=43AA7=< /<2 C;/< ,/:C3A

,/:C3 @7A7A 7< 1=<B3;>=@/@G A=173BG $/BC@3 =4 D/:C3A ,/:C3 )>31B@C; =4 / J5==2K :743 &AG16=:=571/:
D/:C3A <B35@/B32 >3@A=</:7BG ;3<B/: 63/:B6 )=173B/: D/:C3A *63 ;=23@< A3/@16 4=@ / J5==2K A=173BG
8CAB713 23;=1@/1G A31C:/@7A; @C:3 =4 :/E D/:C3A 7< <27/< =<AB7BCB7=< 3AB63B71 D/:C3A &3@13>B7=<
/<2 3<8=G;3<B =4 03/CBG A7;>:717BG 1:/@7BG  #=@/: /<2 3B671/: D/:C3A $/BC@3 =4 ;=@/: 8C25;3<BA
1/<=<A =4 3B671A 3B671A =4 D7@BC3 3B671A =4 2CBG 3B671A =4 @3A>=<A707:7BG

&?220=>0/ '0B> ::6=

 )B3>63<  +<53@ =<B@=::7<5 *316<=:=5G B671A /<2 B63 (3A>=<A70:3 <57<33@A =6< -7:3G
 )=<A $3E .=@9   <2 27B7=<
 30=@/6 =6<A=< B671/: AAC3A 7< <57<33@7<5 &@3<B713 /:: <5:3E==2 :744A $3E 3@A3G
 
  $ *@7>/B67 C;/< D/:C3A 7< B63 <57<33@7<5 &@=43AA7=< #=<=5@/>6 >C0:7A632 0G #
/:1CBB/ 

&?220=>0/ %010<09.0 ::6=

 #793 #/@B7< /<2 (=</:2 )167<H7<53@ LB671A 7< <57<33@7<5M #1@/E7:: $3E .=@9 
 6/@:3A  /@@7A #716/3: ) &@7B16/@2 /<2 #716/3: (/07<A L<57<33@7<5 B671A =<13>BA /<2
/A3AM *6=;>A=< "3/@<7<5 
 =D7<2/@/8/< # $/B/@/8/< ) )3<B67: !C;/@ , ) L<57<33@7<5 B671AM &@3<B713 /:: =4 <27/
$3E 3:67 
 6/@:3A  :3223@;/< <57<33@7<5 B671AM &@3<B713 /:: $3E #3F71= 
 2;C<2  )330/C3@ /<2 (=03@B " /@@G C<2/;3<B/:A =4 B671A 4=@ )173<B7ABA /<2 <57<33@AM
%F4=@2 +<7D3@A7BG &@3AA %F4=@2 
 /D72 @;/<< /<2 #7163:3 ) )6/C4 L=;>CB3@A B671A /<2 )=173BGM %F4=@2 +<7D3@A7BG &@3AA

 Computer Science & Engineering and Information Technology
CSO712 %+$'#%$+ L T P C

3 0 0 3

:?<=0 #?>.:80

.1 Explain the basics of network security and compare various encryption techniques.
.2 Summarize the functionality of public key cryptography
.3 Apply various message authentication functions and secure algorithms
.4 Demonstrate different types of security systems and describe different levels o f
security and services.

#$# !,;;492

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10 P11 P12
'  - - - - 2 - - - - 1 - 1
'  - 2 - - 2 - - - - - - -
'  3 2 - - 2 1 - - - - 1 -
'  - 3 1 - - 2 - 3 - - - -
@0<,20 0.75 1.75 0.25 0 1.5 0.75 0 0.75 0 0.25 0.25 0.25

:?<=0 0=.<4;>4:9

!#(  

:9@09>4:9,7 9.<C;>4:9 ,9/ !0==,20 :914/09>4,74>C =<D3<B7=</: <1@G>B7=< &@7<17>:3A

=<D3<B7=</: <1@G>B7=< :5=@7B6;A "=1/B7=< =4 <1@G>B7=< 3D713A !3G 7AB@70CB7=<

!#(  

$?-74. 60C .<C;>:2<,;3C ,9/ !0==,20 ?>309>4.,>4:9 >>@=/163A B= #3AA/53 CB63<B71/B7=< ) 
# &C0:71 93G 1@G>B=5@/>6G &@7<17>:3A () 757B/:
)75</BC@3A !3G #/</53;3<B

!#(  

"0>A:<6 &0.?<4>C ;;74.,>4:9= !3@03@=A #=B7D/B7=< !3@03@=A D3@A7=<  && $=B/B7=< &&
%>3@/B7=</: 3A1@7>B7=<

!#(  

$ &0.?<4>C & )31C@7BG %D3@D73E & )31C@7BG @167B31BC@3 CB63<B71/B7=< 3/23@

*0- &0.?<4>C -30 )31C@7BG *6@3/BA -30 *@/4471 )31C@7BG >>@=/163A %D3@D73E =4 )31C@3 )=193B "/G3@
/<2 *@/<A>=@B "/G3@ )31C@7BG %D3@D73E =4 )31C@3 :31B@=<71 *@/<A/1B7=<

!#(  
9><?/0<= ,9/ )4<?=0= <B@C23@A <B@CA7=< *316<7?C3A &/AAE=@2 &@=B31B7=< &/AAE=@2 A3:31B7=<
)B@/B3573A <B@CA7=< 3B31B7=< #/:717=CA &@=5@/;A $/BC@3 =4 D7@CA3A *G>3A =4 D7@CA3A #/1@= D7@CA3A
<B7D7@CA >>@=/163A

4<0A,77= 7@3E/:: 16/@/1B3@7AB71A *G>3A =4 7@3E/::A 7@3E/:: 1=<475C@/B7=<

&?220=>0/ '0B> ::6=


E<C;>:2<,;3C ,9/ "0>A:<6 &0.?<4>C $<49.4;70= ,9/ $<,.>4.0=F :?<>3 /4>4:9 *4774,8
&>,77492= $?-74=30< $<09>4.0 ,77

E<C;>:2<,;3C 9/ "0>A:<6 &0.?<4>CF !.<,A 477 03<:?D   
ITO711 INFORMATION SECURITY L3 –T0 –P 0 Credit 3

Course Outcomes: At the end of the course the student will be able to:
% (31=5<7H3 >@=>3<A7BG =4 3@@=@A /<2 @3;3273A 7< >@=13AA3A 7<D=:D7<5 7<4=@;/B7=<
B316<=:=5G
% =<AC;;/B3 9<=E:3253 =4 @7A9 /<2 1=<B@=:A 7< * =>3@/B7=< 7< 7<2CAB@G

% 3B3@;7<3 * A31C@7BG 5C723:7<3A 4=@ D/@7=CA BG>3 =4 7<2CAB@73A

% D/:C/B3 /AA3B A/435C/@27<5 2/B/ 7<B35@7BG AGAB3;
34431B7D3<3AA /<2 AGAB3;
3447173<1G

% +<23@AB/<2 A=4BE/@3 A31C@7BG /C27B7<5 7<1:C27<5 2/B/0/A3 A31C@7BG /C27B <3BE=@9 A31C@7BG
/C27B /<2 ;71@=1=;>CB3@ A31C@7BG /C27B

Mapping of course outcomes with program outcomes

=C@A3
$# $# $# $# $# $# $# $# $#
%CB1=;3A
%
%
%
%
%

Detailed syllabus:
Module1

Computer Auditing- System Access control, Data Access Control, Security Administration,
System Design.

Module 2

Hardware Security Controls - The Total System Needs Securing, Levels of Hardware Controls,
Operating System Controls , Access Controls, General-Purpose Operating Systems Security ,
Sources of Additional Information

Module 3

Software Controls - Software Security and Controls, Types of Software Intrusions, Configuration
Management , Modularity and Encapsulation, Protecting Information, Selecting Security
Software, Analysis of Software Products Database Security - Introduction to Databases,
Security Requirements of Databases, Designing Database Security, Methods of Protection,
Security of Multilevel Databases,The Future of Databases. Network and Telecommunication
Security - Telecommunications and Networks, Security Considerations, Cases in Point, Special
Communications, Security Considerations.

Module 4

#71@=1=;>CB3@ )31C@7BG  #71@=1=;>CB3@ &@=0:3;A /<2 )=:CB7=<A  *63 #71@=1=;>CB3@ <D7@=<;3<B 

)31C@7BG =4 #71@=1=;>CB3@A <B3@</: /B/ )31C@7BG *63 *6@3/BA B= #71@=A 3D3:=>7<5
/ #71@= )31C@7BG
&:/< AB/0:7A67<5
/ #71@=B=#/7<4@/;3 "7<9  &=@B/0:3 #71@=1=;>CB3@ )31C@7BG  &/AAE=@2 &@=B31B7=<
)31C@7BG =4 )>317/: #71@= >>:71/B7=<A
Reading:
1. Deborah Russell, Computer Security Basics, O'Reilly & Associate, 1991.
2. Karen A. Forcht, Computer Security Management, Boyd & Fraser Publishing Co., 1994.
3. Donald A. Watne, Peter B.B. Turney, Auditing EDP Systems, 2nd Edition, PH 1990
 COMPUTER SCIENCE & ENGINEERING AND INFORMATION TECHNOLOGY
COURSE CODE: CSE 701P ARTIFICIAL INTELLIGENCE LAB L T P C
& IT 701P
0 0 2 1

LIST OF EXPERIMENTS

EXP EXPERIMENT NAME COURSE

No. OUTCOME
1 Write LISP Program to define a function for CO1
i. Converting Centigrade temperature to Fahrenheit
ii. Finding maximum among three numbers
iii. Finding factorial of a number
iv. Finding nth power of m (mn) using recursive function
2 Write PROLOG program CO1
i. To find maximum among three numbers
ii. To find factorial of a number
iii. To add/remove nth element in a list
iv. To implement reverse of a list
3 Write a PROLOG Program about family relations and checking the relation between CO1
different family members by using facts and rules.
4 Write a PROLOG Program for Missionaries and Cannibal problem. CO2
5 Write a PROLOG Program for Water Jug problem. CO2
6 Write a LISP program to perform Breadth-first search CO2
7 Write a LISP program to perform Depth-first search CO2
8 Write a PROLOG Program for 8 puzzle problem. CO2
9 Write a PROLOG Program for an expert course advisor system. CO4
10 Write a program for TIC-TAC-TOE game using python. CO3