ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH

Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.

Syllabus Structure (Admission Batch: 2023-24)

School/ Department: School of Computer Sciences

Course: B. Tech.,
Programme: Computer Science and Engineering (Artificial Intelligence and Machine Learning)
Abbreviation used:
AC Audit course LC Laboratory Course PA Practical Assessment
PC Professional Core PR Project/ Practical/ Internship L Lecture
PE Professional Elective SE Seminar/ Expert Lecture/ Etc. T Tutorial
OE Open Elective IA* Internal Assessment P Practical
MC/BS/HS Mandatory/ Common Course EA End-Semester Assessment
ACC Advanced Competency Course
*
Internal Assessment Mark (40 marks) consists of (i) Mid Semester (20 marks), (ii) Quiz/ Assignment/Attendance (20 marks)

3rd Semester

Teaching Hours Maximum Marks

Sl. Subject Subject Subject
Credit
No. Type Code Name L T P IA EA PA Total
1 BS BH2459 Mathematics – III 3 0 0 3 40 60 - 100
Object Oriented Design and
2 PC CS2101 3 0 0 3 40 60 - 100
Programming
3 PC CS2103 Algorithm Analysis and Design 3 0 0 3 40 60 - 100
4 PC CS2105 Operating System 3 0 0 3 40 60 - 100
5 ACC CS2107 Data Analysis and Interpretation 3 0 0 2 40 60 - 100
6 HS BH2439 Engineering Economics 3 0 0 2 40 60 - 100
Object Oriented Programming
7 LC CS2501 0 0 3 1.5 - - 100 100
Laboratory
Algorithm Analysis and Design 1.5
8 LC CS2503 0 0 3 - - 100 100
Laboratory
9 LC CS2505 Linux System Programming Laboratory 0 0 3 1.5 - - 100 100
Data Analysis and Interpretation
10 ACC CS2507 0 0 3 1.5 - - 100 100
Laboratory
Total 18 0 12 22 240 360 400 1000

4th Semester

Teaching Hours Maximum Marks

Sl. Subject Subject Subject
Credit
No. Type Code Name L T P IA EA PA Total
1 PC CS2102 Computer Organization and Architecture 3 0 0 3 40 60 - 100
2 PC CS2112 Artificial Intelligence 3 0 0 3 40 60 - 100
3 PC CS2106 Discrete Mathematics 3 0 0 3 40 60 - 100
4 PC CS2108 Database System 3 0 0 3 40 60 - 100
Fundamental to Cloud Computing
5 ACC CS2110 3 0 0 2 40 60 - 100
Technology
6 HS BH2437 Organizational Behaviour 3 0 0 2 40 60 - 100
7 LC CS2502 Computer Organization Laboratory 0 0 3 1.5 - - 100 100
8 LC CS2510 Artificial Intelligence Laboratory 0 0 3 1.5 - - 100 100
9 LC CS2504 Java Laboratory 0 0 3 1.5 - - 100 100
10 LC CS2506 Database System Laboratory 0 0 3 1.5 - - 100 100
11 Summer Internship and Research Experience (SIRE - I) *
Total 18 0 12 22 240 360 400 1000

*Minimum 4 weeks of Summer Course / Training / Internship / Skill Course

/ etc. after 4th Semester
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

3rd Semester CSE(Artificial Intelligence and Machine Learning)

CS2101: Object Oriented Design and Programming(3-0-0 : 3)
Prerequisites Knowledge of C programming
Course Outcomes:

CO1 Students will be able to understand basics of C++ programming with different
programming constructs.
CO2 Students will analyze concepts of functions and advanced techniques like recursion.
CO3 Students will implement classes, objects and their utility in C++ programs, use
constructors, and destructors in programming.
CO4 Students will be able to create extensive use of C++ programs to overload operator,
type conversion using objects.
CO5 Students will develop code reusability and use of abstract classes for advanced
programming.
CO6 Students will implement error-handling mechanisms with advances in generic
programming using templates & namespaces

Detailed Syllabus
Module-I (8 Hours)
Introduction to Object Oriented programming: features of Object Oriented Programming,
Pillars of Object Oriented Programming. Abstraction, Encapsulation, Polymorphism,
Inheritance, Class, Object, Data Hiding, Message passing, Delegation.
Introduction to C++: Basic I/O, conditional statements, Loops, Arrays, structure & unions.

Module-II (6 Hours)
Functions in C++: Inline functions, default arguments, function overloading, Recursion, types
of parameters passing. Classes & Objects: static members of a class, nested class, array of
objects, member function overloading, friend function and friend classes.
Constructor & Destructors: default, parametrized & copy constructors, destructors, implicit &
explicit call to constructors & destructors, dynamic constructor & destructors
Module-III ( 8 Hours)
Operator Overloading: Overloading of unary & binary operator using member & friend
operator function, overloading of conditional operators.
Type conversion: Basic to class, class to basic and class to class conversion. Inheritance:
single inheritance, multiple, multilevel, hierarchical & hybrid inheritance. Types of
derivation, function overriding & Role of virtual base class.
Polymorphism: Binding, Static binding, Dynamic binding, virtual functions, pure virtual
functions, abstract classes. Virtual constructor & destructors.

Module-IV (8 Hours)
Exception handling: Error vs Exceptions, try, catch & throw, handling multiple exceptions,
rethrowing of an exception, handling uncaught exceptions, guidelines for exception handling.

Templates: Template classes, Template functions. Overloading in function templates.

Namespace: User defined Namespaces, Namespaces provided by library.
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Text Books:
1. ANSI and Turbo C++ - Ashoke N. Kamthane, PearsonEducation
2. C++: The Complete Reference- Schildt, McGraw-Hill Education(India)

References Books:
1. Big C++ - WileyIndia
2. “C++ and Object Oriented Programming” - Jana, PHILearning.
3. “Object Oriented Programming with C++ “- Rajiv Sahay,Oxford
4. Mastering C++ - Venugopal, McGraw-Hill Education(India)

CO-PO Mapping: (1: Low, 2: Medium, 3: High)

PO PO1
PO1 PO2 PO3 PO4 PO6 PO7 PO8 PO9 PO11 PO12
5 0
CO1 3 3 3 - - - - - - - 1 1
CO2 3 3 3 2 2 - - - 1 - 1 1
CO3 - 3 3 2 2 2 - - 1 - 1 1
CO4 2 3 3 2 2 2 - - 1 - 1 1
CO5 2 3 3 2 2 2 1 1 1 - 1 1
CO6 2 3 3 2 2 2 1 1 1 - 1 1

CS2103: Algorithm Analysis and Design (L-T-P:Credits)(3-0-0:3)

 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Prerequisites Mathematics, Basic program design concepts (e.g., pseudo-code), Data

structure

Course Outcomes:

CO1 Analyze the efficiency of algorithms including different type of sorting, evaluate their
time and space complexity
CO2 Able to understand concepts of algorithm design and principles, learn different
algorithm design strategies including divide and conquer methodologies and solve
recurrences.
CO3 Understand the concept and use of different greedy and dynamic algorithms.

CO4 Ability to design, analyze and prove correctness of graph algorithms.

CO5 Understand different algorithmic design strategies based on back tracking and branch
and bound.

Detailed Syllabus
Module-I (6 Hours)
Introduction to design and analysis of algorithms, Asymptotic analysis of algorithms, Growth
of Functions, Recurrences, solution of recurrences by substitution, Recursion Tree and
Master methods.
Design & Analysis of Divide and conquer algorithms:- Merge sort, Quick sort , Heap Sort

Module-II (8 Hours)
Greedy Algorithms - Elements of Greedy strategy, Activity- selection Problem, Fractional
knapsack problem, Huffman codes
Dynamic programming algorithms: - Elements of dynamic programming, The principle of
optimality, Matrix-chain multiplication, Longest common subsequence, Assembly-line
scheduling, String matching :-Naive String matching algorithm, Rabin-Karp algorithm

Module-III (10 Hours)

Data structure for disjoint sets:- Disjoint set operations, Linked list representation, Disjoint
set forests
Graph Algorithms: -Breadth First Search and Depth-First Search, Minimum Spanning Trees,
Kruskal and Prim's algorithms, Single Source Shortest Path (Bellman-ford and Dijkstra's
algorithms), All Pairs Shortest Paths (Floyd – Warshall Algorithm).

NP Completeness:-Polynomial time solving, Polynomial time verification, NP -

Completeness and reducibility, NP Complete problems (without proof):-Circuit Satisfiability
problem, Hamiltonian cycle problem, Travelling Salesman Problem, Vertex Cover Problem

Module-IV (6 Hours)
Back tracking algorithm:-Knapsack problem, N-queen problem, Graph Coloring, Branch
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Bound algorithm: - 0/1 knapsack algorithm, 15-puzzle

Text Books:
1. Introduction to algorithms by T.H. Cormen, C.E. Leiserson, R.L. Rivest,
C.Stein, 3rdEdition, MIT Press, 2022.
2. Computer Algorithms by Ellis Horowitz, Sartaj Sahni, Sanguthevar
Rajasekaran, 2nd Edition, Silicon Press, 2018

References Books:
1. Fundamentals of Algorithms by Gilles Brassard, Paul Brately, Pearson India,2015
2. Algorithm Design by Goodrich, Tamassia, Wiley India
3. The Algorithm Design Manual, Steven S. Skiena, Second Edition, Springer

CO-PO Mapping:

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

(1:Low, 2:Medium, 3:High)

CS2105: Operating System (L-T-P:Credits)(3-0-0:3)

Prerequisites To understand the basic computer organization, operating system

 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

structures, processes and threads.

Course Outcomes:

CO1 To understand the basic concepts and functions of operating systems.

CO2 To understand Processes, Threads and Deadlocks
CO3 To analyze Scheduling algorithms
CO4 To analyze memory management schemes.
CO5 To understand I/O management and File systems.

Detailed Syllabus
Module-I (7 Hours)
Overview Operating System, Simple Batch Processing Systems, Multiprogramming and
Time Sharing systems. Personal Computer Systems, Parallel Systems, Distributed Systems
and Real- time Systems. Operating System Structures: Operating System Services, System
components, Protection system, Operating System Services, system calls.

Module-II (8 Hours)
Process Concept, Process Scheduling, Operation on Processes, Inter-process communication,
Examples of IPC Systems, Multithreading Models, Threading Issues, Process Scheduling
Basic concepts, scheduling criteria, scheduling algorithms, Thread Scheduling. Process
Coordination, Synchronization, Critical section problem, Synchronization hardware,
Semaphores, Classical problems of synchronization, Monitors. Deadlocks, System model,
Deadlock Characterization, Handling Deadlocks, Deadlock Prevention, Deadlock avoidance,
Deadlock Detection, recovery from Deadlock.

Module-III (8 Hours)
Memory Management strategies, Logical versus Physical Address space, swapping,
contiguous Allocation, Paging, Segmentation. Virtual Memory: Background, Demand
paging, performance of Demand paging, Page Replacement, Page Replacement Algorithms.
Allocation of frames, Thrashing, Demand Segmentation.

Module-IV (7 Hours)
Overview of Mass Storage Structure, Disk Structure, Disk Scheduling, Disk Management,
Swap-Space Management, I/O System Overview, I/O Hardware. File system, file structure,
Directory Structure, Allocation Methods,

Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Concepts, 8th
Edition, Wiley-India, 2009.
2. William Stallings: Operating Systems, PHI Learning Pvt.Ltd.

Reference Books:
1. H.M. Deitel, P. J. Deitel, D. R. Choffnes: Operating Systems, 3rdEdition, PearsonEducation.
2. Andrew S. Tanenbaum: Modern Operating Systems, 3rdEdition, PHI Learning Pvt.Ltd.

CO-PO Mapping:

PO1 PO2 PO3 PO4 PO PO6 PO7 PO8 PO9 PO1 PO11 PO12
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

5 0
CO1 3 - - - - - - - - - - -
CO2 - 3 - - - - - - - - - -
CO3 - - 2 - - - - - - - - -
CO4 - - - 2 - - - - - - - -
CO5 - - - 2 - - - - - - - -

(1: Low, 2: Medium, 3: High)

CS2107: Data Analysis and Interpretation (L-T-P:Credits)(3-0-0:2)

 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Prerequisites Statistics, Programming in R/Python.

Course Outcomes:

CO1 Appreciate the science of statistics and the scope of its potential applications
Summarize and present data in meaningful ways
CO2 Select the appropriate statistical analysis depending on the research question at
hand
CO3 Form testable hypotheses that can be evaluated using common statistical analyses
CO4 Understand and verify the underlying assumptions of a particular analysis
CO5 Effectively and clearly communicate results from analyses performed to others
CO6 Conduct, present, and interpret common statistical analyses using R

Detailed Syllabus
Module-I (7 Hours)
Introduction to the science of statistics
Fundamental Elements of Statistics :Qualitative and Quantitative Data Summaries
Introduction to the science of statistics: Normal distribution, Sampling, The Central Limit
Theorem, Confidence intervals and hypothesis tests: Statistical Inference, Stating
Hypotheses, Test Statistics and p-Values, Evaluating Hypotheses.

Module-II (10 Hours)

Confidence intervals and hypothesis tests: Significance Test “Recipe”, Significance Tests and
Confidence Intervals, Inference about a Population Mean, Two-Sample Problems
Understanding the association between two continuous or quantitative factors: Scatter plots,
Correlation

Understanding the association between two continuous or quantitative factors: Simple Linear
Regression,F-test for Simple Linear Regression,t-test for Simple Linear Regression.
Regression diagnostics:Residual Plots,Outliers and Influence Points, Assumptions of least-
square regression

Multiple linear regression:Equation of multiple linear regression, Interpretation of multiple

linear regression, f-test for Multiple Linear Regression, t-tests in Multiple Linear Regression,
Cautions about Regression

Module-III (7 Hours)
Analysis of Variance (ANOVA): One-Way Analysis of Variance, F-test for ANOVA,
Evaluating Group Differences, Type I and Type II Errors
Analysis of Variance (ANOVA): Issues with Multiple Comparisons, Assumptions of
Analysis of Variance, Relationship between One-Way Analysis of Variance and Regression,
One-Way Analysis of Covariance, Two-Way Analysis of Variance, Two-Way Analysis of
covariance analysis for proportions: One-Sample Tests for Proportions, Significance Tests for
a Proportion. Confidence Intervals for a Proportion

Module-IV (6 Hours)
Analysis for proportions: Two-Sample Tests for Proportions, Confidence Intervals for
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Differences in Proportions, Significance Tests for Differences in Proportions, Effect

Measures, Logistic Regression, Multiple Logistic Regression,Area under the ROC Curve

Text Books:
1. Business Statistics, Global Edition Paperback – 5 January 2018 by David
Groebner, Patrick Shannon, Phillip Fry
2. R Programming: This book includes: R Basics for Beginners + R Data Analysis and
Statistics + R Data Visualization: 4 Paperback – 28 April 2022 by Andy Vickler

Reference Books:
1. Research Methodology Methods and Techniques by C.R. Kothari 4th edition
2. R for Data Scienceby Hadley Wickham and Garrett Grolemund

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1

1 2 3 4 5 6 7 8 9 0 1 2
CO
3 3 3 3 2 1 1 1 1 2 2 1
1
CO
3 3 3 3 2 1 1 1 1 2 2 1
2
CO
3 2 3 3 2 1 1 1 1 2 2 1
3
CO
1 2 2 4 2 1 1 1 1 2 2 1
4
CO
1 2 2 4 2 1 1 1 1 2 3 1
5
CO
3 3 3 3 2 1 1 1 1 2 2 1
6
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CS2501: Object Oriented Design &Programming Lab(2-0-0 : 2)

Prerequisites Basic knowledge of programming

Course Outcomes:

CO1 Students will be able to understand basics of C++ programming with different
programming constructs.
CO2 Students will analyze concepts of functions and advanced techniques like recursion.
CO3 Students will implement classes, objects and their utility in C++ programs, use
constructors, destructors in programming.
CO4 Students will be able to create extensive use of C++ programs to overload operator,
type conversion using objects.
CO5 Students will develop code reusability and use of abstract classes for advanced
programming.
CO6 Students will implement error handling mechanisms with advances in generic
programming using templates & namespaces

Detailed Syllabus

1. Introduction to C++, writing basic I/O, conditional statements, Loops

2. Programs on functions, recursive functions.
3. Programs on arrays, matrix, string.
4. Programs on classes & objects
5. Programs on constructor & destructors
6. Programs on operator overloading
7. Programs on type conversion
8. Programs on inheritance
9. Programs on virtual functions
10. Programs on templates, exception handling

Text Books:
1. Java: The Complete Reference
Schildt, H. (2018). Java: The Complete Reference (11th ed.). McGraw-Hill Education.
2. Introduction to Java Programming and Data Structures
Liang, Y. D. (2019). Introduction to Java Programming and Data Structures (11th ed.).
Pearson.

Reference Books:
1. Effective Java, Bloch, J. (2018). Effective Java (3rd ed.). Addison-Wesley.
2. Thinking in Java, Eckel, B. (2006). Thinking in Java (4th ed.). Prentice Hall.
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO-PO Mapping: (1: Low, 2: Medium, 3: High)

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

CS2503: Algorithm Analysis and Design Laboratory

(L-T-P:Credits) (0-0-3:1.5)
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Prerequisites Mathematics, Basic program design concepts (e.g., pseudocode), Data

structure

Course Outcomes:
CO1 Analyze the performance of algorithms.
CO2 Choose appropriate algorithm design techniques for solving problems.
CO3 Use design methods including the divide and conquer in problem-solving
CO4 Use a dynamic programming approach in problem-solving.
CO5 Use a greedy approach in problem-solving

Detailed Syllabus

1. Linear Search and Binary Search Algorithm

2. Quick Sort and Merge Sort Algorithm
3. Heap Sort Algorithm
4. Matrix Chain Multiplication Algorithm
5. Longest Common Subsequence Algorithm
6. Fractional Knapsack Algorithm
7. Huffman Code Algorithm
8. Breadth First Search and Depth First Search Algorithm
9. Kruskal Algorithm and Prim’sAlgorithm
10. Bellman Ford Algorithm/Floyd-Warshall Algorithm
11. Dijkstra’s Algorithm
12. Rabin-Karp pattern matching algorithm
Text Books:
1. Introduction to the Design and Analysis of Algorithms, Levitin, A. (2017). Introduction
to the Design and Analysis of Algorithms (3rd ed.). Pearson.
2. Algorithm Design, Kleinberg, J., & Tardos, É. (2005). Algorithm Design. Pearson.
Reference Books:
1. Introduction to Algorithms (Also known as "CLRS") Cormen, T. H., Leiserson, C. E.,
Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.
2. The Algorithm Design Manual, Skiena, S. S. (2020). The Algorithm Design Manual (3rd
ed.). Springer

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

PO PO1
PO1 PO2 PO3 PO4 PO6 PO7 PO8 PO9 PO11 PO12
5 0
CO1 3 3 3 3 2 - - - 1 - - 1
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO2 3 3 2 3 2 - - - 1 - 1 1
CO3 3 3 3 3 2 - - - 1 - - 1
CO4 3 3 3 3 2 - - - 1 - - 1
CO5 3 3 3 3 2 - - - 1 - - 1

CS2505: Linux Systems Programming Laboratory

(0-0-3:1.5)
Prerequisites Knowledge of programming, data structures, and concepts of operating
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

systems taught in the theory class is required.

Course Outcomes:
CO1 Become conversant with various Unix commands and their specific uses.
CO2 Write, debug, and execute UNIX shell scripts for a given problem.
CO3 Implement various scheduling algorithms used at the operating system level.
CO4 Write programs for the creation of child processes and communication among them.
CO5 Develop and implement deadlock avoidance and detection algorithms.

Detailed Syllabus
1. Introduction to basic Linux commands.
2. Linux File Structure and advance commands like grep, pipe, head etc.
3. VI editor commands and Linux system calls.
4. Introduction to Linux Shell Script: Arithmetic Expressions, Relational and Conditional
Operators.
5. Linux Shell Script: Looping, Switch Cases.
6. CPU Scheduling (Non-Pre-emptive) FCFS, SJF, Priority.
7. CPU Scheduling (Pre-emptive) SRTF, RR, Priority-based preemptive.
8. Programs on process creation and synchronization.
9. Synchronization using Semaphore (Producer- Consumer, Reader-Writer).
10. Inter-process communication using shared memory.
11. Deadlock implementation: Banker’s Algorithm.
12. Implementing Page Replacement Algorithms.
13. Implementing Disk scheduling Algorithms.
Text Books:
1. V. Mukhi, The C Odyssey: UNIX, 1st Edition, BPB Publications, 1992.
2. Silberschatz, P. B. Galvin, and G. Gagne, Operating System Concepts, 8th Edition,Wiley,
2009.
Reference Books:
1. S. Tanenbaum, Modern Operating Systems, 3rd Edition, PHI, 2009.
2. P. B. Prasad, Operating Systems and System Programming, 2nd Edition, Scitech
Publications, 2015.
3. Unix System Programming using C++, T.Chan, PHI (Unit III to Unit VIII)
4. Unix Concepts and Applications, 4th Ed, Sumitabha Das, TMH 3. Unix Network
Programming, W.R.Stevens,PHI.
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO-PO Mapping: (1: Low, 2: Medium, 3: High)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO 2 2 3 1 - 1 - - - - - 2
1
CO 2 2 2 1 - 1 - - - - - 2
2
CO 3 1 2 2 - 1 - - - - - 2
3
CO 3 2 2 1 - 1 - - - - - 2
4
CO 3 2 3 1 - 1 - - - - - 2
5
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CS2507: Data Analysis and Interpretation Laboratory

(0-0-3:1.5)

Prerequisites Programming in R/ Python

Course Outcomes:

CO1 Appreciate the science of statistics and the scope of its potential applications
Summarize and present data in meaningful ways.
CO2 Select the appropriate statistical analysis depending on the research question at
hand
CO3 Form testable hypotheses that can be evaluated using common statistical analyses
CO4 Understand and verify the underlying assumptions of a particular analysis
CO5 Effectively and clearly communicate results from analyses performed to others
CO6 Conduct, present, and interpret common statistical analyses using R

Detailed Syllabus

Implementation using R programming/ Python

1. Linear regression.

2. Multiple regression.

3. Logistic regression.

4. The t-test.

5. The F-test – ANOVA

6. Chi Square Test.

7. Mann–Whitney U test

8. Median Test

9. One way/two way analysis of variance

10. One way/two way analysis of covariance

Text Books:
1. Business Statistics, Global Edition Paperback – 5 January 2018 by David Groebner, Patrick
Shannon, Phillip Fry
2. R Programming: This book includes: R Basics for Beginners + R Data Analysis and
Statistics + R Data Visualization: 4 Paperback – 28 April 2022 by Andy Vickler
Reference Books:
1. Research Methodology Methods and Techniques by C.R. Kothari 4th edition
2. R for Data Science by Hadley Wickham and Garrett Grolemund
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

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

4th Semester CSE (Artificial Intelligence and Machine Learning)

CS2102: Computer Organization and Architecture (L-T-P:Credits) (3-0-0:3)

Prerequisites Computer fundamentals, Number Systems, Digital Electronics

 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

Course Outcomes:

CO1 Understand the theory and architecture of central processing unit.

CO2 Represent instructions in various formats and solve problems based on addressing
modes.
CO3 Demonstrate how to perform the different arithmetic operations on integers and
floating-point numbers using two’s complement and IEEE floating point
representation.
CO4 Exemplify in a better way the memory system and system organization.
CO5 Illustrate data transfer between CPU and I/O devices and outline the concept of I/O
organization.

Detailed Syllabus
Module-I (8 Hours)
Basic Structure of Computers: Computer Architecture vs Computer Organization, Functional
Units, Basic Operational Concepts, Bus Structures, Software, Performance.
Machine Instructions and Programs: Memory Locations and Addresses, Big-Endian and
Little-Endian Assignments, Memory Operations, Instruction Set: Instruction Format,
Instruction Types (RISC and CISC architecture), Instruction Execution and Straight-Line
Sequencing, Branching, Addressing Modes, Case Study – instructions set of some common
CPUs.

Module-II (10 Hours)

Basic Input/ Output Operations, Subroutines, Additional Instructions.
Arithmetic: Fixed point and Floating-point representation, Addition and Subtraction of
Signed Numbers, Design of Fast Adders, Multiplication of Positive Numbers, Signed-
Operand Multiplication- Booth’s algorithm, Fast Multiplication, Integer Division.

Module-III (8 Hours)
Basic Processing Unit: Fundamental Concepts, Execution of a Complete Instruction,
Hardwired Control, Microprogrammed Control.
Memory System: Basic Concepts, Memory Hierarchy, Cache Memory, Cache Memory
Mapping Functions, Replacement Algorithms

Module-IV (4 Hours)
Input/Output Organization: I/O subsystem, I/O transfer (DMA), Bus Control (Synchronous
bus, Asynchronous bus, I/O interfaces (SCSI, USB).

Text Books:
1. Computer Organization: Carl Hamacher, Zvonko Vranesic, Safwat Zaky, McGraw Hill,
5th Edition, 2002
2. Computer Architecture and Organization: J. P. Hayes, McGraw Hill, 3rd Edition, 2012
3. Computer Architecture and Organization: William Stallings, Pearson Education 10th
Edition, 2017

Reference Books:
1. Computer System Architecture: Morris M. Mano, PHI, 3rd edition, 2007
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

2. Computer Architecture and Organization: Design Principles and Applications

ByGovindarajalu, 8th Reprint, TMH

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

PO PO1
PO1 PO2 PO3 PO4 PO6 PO7 PO8 PO9 PO11 PO12
5 0
CO1 2 2 2 3 2 - - - - - - 1
CO2 3 3 2 3 1 - - - - - - 1
CO3 3 3 3 2 2 - - - - - - 1
CO4 2 3 3 2 1 - - - - - - 1
CO5 2 3 3 2 1 - - - - - - 1

CS2112: Artificial Intelligence (3-0-0:3)

Prerequisites Data Structures, Algorithms, Probability, Statistics

Course Outcomes:
CO1: Develop a basic understanding of AI building blocks presented in intelligent agents
CO2: Choose an appropriate problem-solving method and knowledge representation
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

technique
CO3: Design models for reasoning with uncertainty as well as the use of unreliable
information.
CO4: Design and develop the AI applications in real-world scenario.
CO5: Design and evaluate intelligent expert models for perception and prediction from an
intelligent environment

Detailed Syllabus:

Module-I (12 Hours)

Introduction to AI, AI Technique, Level of the Model, Problem Spaces, and Search: Defining
the Problem as a State Space Search, Production Systems, Problem Characteristics,
Production System Characteristics, Issues in the Design of Search Programs. Heuristic Search
Techniques: Generate-and-Test, Hill Climbing, Solution space search, Beam search Best-first
Search, Problem Reduction, Constraint Satisfaction, Means-ends Analysis, Knowledge
Representation: Representations and Mappings, Approaches to Knowledge Representation,
Using Predicate Logic: First Order Logic (FOL),Representing Simple Facts in Logic,
Representing Instance and ISA Relationships, Computable Functions and Predicates,
Resolution, Natural Deduction. Using Rules: Procedural Versus Declarative Knowledge,
Logic Programming, Forward Versus Backward Reasoning.

Module-II (6 Hours)
Symbolic Reasoning Under Uncertainty: Introduction to Nonmonotonic Reasoning, Logics
for Nonmonotonic Reasoning, Implementation Issues, Augmenting a Problem-solver, Depth-
first Search, Breadth-first Search. Weak and Strong Slot-and-Filler Structures: Semantic
Nets, Frames, Conceptual Dependency Scripts, CYC

Module-III (6 Hours)
Game Playing: The Minimax Search Procedure, Adding Alpha-beta Cutoffs, Iterative
Deepening. Planning: The Blocks World, Components of a Planning System, Goal Stack
Planning, Sussman's Anomaly, Nonlinear Planning Using Constraint Posting, Hierarchical
Planning Other Planning Techniques.

Module-IV (6 Hours)
Natural Language Processing: Introduction, Syntactic Processing, Semantic Analysis,
Discourse and Pragmatic Processing, Statistical Natural Language Processing, Spell
Checking. Learning: Rote Learning, Learning by Taking Advice, Learning in Problem-
solving, Learning from Examples: Induction, Neural Net Learning and Genetic Learning.
Expert Systems: Representing and Using Domain Knowledge, Expert System Shells,
Knowledge Acquisition

Text Books:
1. Elaine Rich, Kevin Knight, &Shivashankar B Nair, Artificial Intelligence, McGraw
Hill,3rded.,2009
2. Introduction to Artificial Intelligence & Expert Systems, Dan W Patterson, PHI.,2010

Reference Books:
1. S Kaushik, Artificial Intelligence, Cengage Learning, 1sted.2011
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

2. 2.Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach,

2ndedition.

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

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

CS2106: Discrete Mathematics (L-T-P:Credits)(3-0-0:3)

Prerequisites Concepts of mathematical logic

Course Outcomes:

CO1 Students will be able to understand & apply different methods of proof and
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

counting principles.
CO2 Students will be able to understand & implement relations & its types.
CO3 Students will be able to analyze and solve different recurrence relations by
traditional methods and generating functions.
CO4 Students will implement graphs & their applications, analyze the use of trees.
CO5 Students will be able to analyze different algebraic structures and their
implementation in real life.
CO6 Students will be able to understand & apply different partial ordering relations and
their variations in real world problems.

Detailed Syllabus
Module-I (8 Hours)
Introduction to proofs, Proof methods and strategy, Mathematical induction, Strong induction and well
ordering, The basics of counting, The pigeonhole principle, Inclusion and exclusion principle and its
applications.
Relations: Binary relation & its properties, equivalence relation, equivalence classes, properties of
equivalence classes.

Module-II (8 Hours)
Recurrence relations, solving linear recurrence relations, generating functions, solving recurrence
relation by generating functions.
Graphs and graph models, Graph terminology and special types of graphs, Graph representation, graph
isomorphism, Connectivity, Euler and Hamilton paths.

Module-III (8 Hours)
Tree: Binary tree, BST, Searching, Tree traversal, Spanning Tree, Minimum Spanning Tree.
Algebraic systems, Semi groups and monoids, Groups, Abelian group, Subgroups, Homomorphism’s,
Normal subgroup and cosets, Lagrange’s theorem, Definitions and examples of Rings, Fields and
Integral Domains.

Module-IV (6 Hours)
Partial ordering Relation, Posets, Lattices as posets, Properties of lattices, Lattices as
algebraic systems, Sub lattices, Direct product and homomorphism, Boolean algebra.

Text Books:
1. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, 7th Edition, Tata Mc
Graw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.
2. C. L. Liu and D. Mohaptra, “Elements of Discrete Mathematics”, Third Edition,
2008, Tata McGraw Hill Education, New Delhi

Reference Books:
1. Ralph. P. Grimaldi., “Discrete and Combinatorial Mathematics: An Applied
Introduction”, 4th Edition, Pearson Education Asia, Delhi,2007.
2. Thomas Koshy., “Discrete Mathematics with Applications”, Elsevier
Publications,2006.
3. Seymour Lipschutz and Mark Lipson., “Discrete Mathematics”, Schaum’s Outlines,
Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, 3rd Edition,2010.
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO-PO Mapping: (1: Low, 2: Medium, 3: High)

PO PO1
PO1 PO2 PO3 PO4 PO6 PO7 PO8 PO9 PO11 PO12
5 0
CO1 3 3 3 3 3 3 1 1 - - - -
CO2 3 3 3 3 3 3 1 1 - 1 1 -
CO3 3 3 3 3 3 3 1 1 - 1 1 -
CO4 3 3 3 3 3 3 1 1 - 1 1 -
CO5 3 3 3 3 3 3 1 1 - 1 1 -
CO6 3 3 3 3 3 3 1 1 - 1 1 -

CS2108: Database System (L-T-P:Credits) (3-0-0:3)

Prerequisites Knowledge of various data structures, some basic searching and sorting
techniques

Course Outcomes:
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO1 Understand the significance & components of DBMS and create E-R models for real-
world applications.
CO2 Construct queries using relational algebra and understand query processing &
optimization strategies.
CO3 Design relational databases and normalize the designs using different normalization
techniques.
CO4 Resolve concurrency control issues and recover from database failures.
CO5 Visualize storage structures, and indexing techniques and explore distributed &
NoSQL databases.

Detailed Syllabus

Module-I (8 Hours)
Introduction to database Systems, advantages of database system over traditional file system,
Basic concepts & Definitions, Database users, Database Language, Database System
Architecture, Schemas, Sub Schemas, & Instances, database constraints, 3-level database
architecture, Data Abstraction, Data Independence, Mappings, Structure, Components &
functions of DBMS, Data models.

Module-II (8 Hours)
Entity relationship model, Components of ER model, Mapping E-R model to Relational
schema, Network and Object-Oriented Data models, Storage Strategies: Detailed Storage
Architecture, Storing Data, Magnetic Disk, RAID, Other Disks, Magnetic Tape, Storage
Access, File & Record Organization, and File Organizations & Indexes.

Module-III (8 Hours)
Relational Algebra, Tuple & Domain Relational Calculus, Relational Query Languages: SQL
and QBE. Database Design: Database development life cycle (DDLC), Automated design
tools, Functional dependency and Decomposition, Join strategies, Dependency Preservation
& lossless Design, Normalization, Normal forms:1NF, 2NF,3NF, and BCNF, Multi-valued
Dependencies, 4NF&5NF. Query processing and optimization: Evaluation of Relational
Algebra Expressions, Query optimization, Query cost estimation.

Module-IV (8 Hours)
Transaction processing and concurrency control: Transaction concepts, properties of
transaction, concurrency control, locking and Timestamp methods for concurrency control
schemes. Database Recovery System, Types of Data Base failure, Types of Database
Recovery, Recovery techniques, Fundamental concepts on Object-Oriented Database, Data
warehousing & Data Mining, Big data, Introduction to No SQL

Text Books:
1. Fundamentals of Database System by Elmasari& Navathe, Pearson Education
2. Database System Concepts by Sudarshan & Korth, 6th edition, McGraw-Hill Education

Reference Books:
1. Database Management Systems by R. Ramakrishnan, 3rd edition, McGraw-Hill Education
2. Database Management Systems By R.Panneerselvam , 3rd Edition, PHI
3. Introduction to Database Management Systems By Atul Kahate, PEARSON
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

PO PO1
PO1 PO2 PO3 PO4 PO6 PO7 PO8 PO9 PO11 PO12
5 0
CO1 2 3 2 1 - 2 - - - - - 1
CO2 3 3 3 2 1 1 - - - - - 1
CO3 3 3 3 2 1 2 - - - - - 2
CO4 2 3 3 2 1 1 - - - - - 1
CO5 2 2 2 2 2 1 - - - - - 2

CS2110: Fundamentals to Cloud Computing Technology (L-T-P:Credits)(3-0-0:2)

Prerequisites Operating System, Computer Networks

Course Outcomes:
CO1 Identify the appropriate cloud services for a given application.
CO2 Assess the comparative advantages and disadvantages of Virtualization technology
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO3 Analyze authentication, confidentiality and privacy issues in cloud computing.

CO4 Identify security implications in cloud computing.
CO5 Understand the importance of protocols and standards in management for cloud
services.

Detailed Syllabus

Module-I (7 Hours)
Introduction to Cloud Computing Defining Cloud computing, Characteristics, Components,
deployment model, service model, Applications, Benefits of cloud computing, Limitations of
cloud computing. Grid Computing, Grid vs. Cloud Computing

Module-II (7 Hours)
Cloud architecture, Services and Applications Exploring cloud computing stack –
Composability, Infrastructure, Platforms, Virtual Appliances, Communication Protocols,
Applications, Defining Infrastructure as a Service (IaaS), Defining Software as a Service
(SaaS), Defining Platform as a Service (PaaS), Defining Identity as a Service (IDaaS),
Defining Compliance as a Service (CaaS).

Module-III (8 Hours)
Cloud Infrastructure and Virtualization Hardware and Infrastructure – Clients, Security,
Network and Services., use of Virtualization technology, Load Balancing and Virtualization,
virtualization benefits, Hypervisors, porting application, Defining cloud capacity by defining
baselines and Metrics.

Module-IV (8 Hours)
Cloud Administration and Security Management responsibilities, lifecycle management,
cloud management products, Cloud management standards. Cloud security, data security,
Identity and presence protocol standards, Availability management in SaaS, IaaS, PaaS,
Access Control, Security Vulnerability, Patch and Configuration Management, Security as a
Service of cloud, Future of Security in Cloud computing
Text Books:

1. Barrie Sosinsky, “Cloud Computing Bible”, Wiley India Edition.

2. Anthony Velte, TobyVelte, Robert Elsenpeter, “Cloud Computing – A Practical
Approach”, Tata McGraw-Hill Edition.

Reference Books:
1. Arshdeep Bahga, Vijay Madisetti. “Cloud Computing: A Hands-On Approach,
CreateSpace Independent Publishing Platform, 9 Dec 2013 - Computers - 454 pages.
2. Zaigham Mahmood,Thomas Erl, “Cloud Computing: Concepts, Technology &
Architecture”,Person, 1/e.

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

PO PO1
PO1 PO2 PO3 PO4 PO6 PO7 PO8 PO9 PO11 PO12
5 0
CO1 1 - - - 2 - - - - 2 - -
CO2 - 1 - - 2 - - - - - - -
CO3 - 1 - - 3 - - - - 3 - -
CO4 - - - - 1 - - - - - - -
CO5 1 - - - - - - - - - - -

CS2502: Computer Organization Laboratory (0-0-3:1.5)

Prerequisites Knowledge of computer basics and programming logic is required.

Course Outcomes:

CO1 To identify and understand the function of various PC components, including the
motherboard, SMPS, printer, hard disk, and real-time clock.
CO2 To gain hands-on experience in disassembling and assembling a PC.
CO3 To develop a comprehensive understanding of the microprocessor’s role in system
operations and its interaction with other hardware components.
CO4 To design and verify digital circuits like Half-Adders, Full-Adders, multiplexers, and
de-multiplexers using VHDL code.
CO5 To cultivate problem-solving skills through practical application of theoretical
knowledge.

Detailed Syllabus
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

1. To recognize various components of PC

2. Dismantling and assembling a PC
3. Study of Motherboard
4. Study of SMPS
5. Study of Printer
6. Study of Microprocessor
7. Study of hard disk
8. Study of real-time clock
9. Design and verify Half-Adder & Full-Adder using VHDL code
10. Design and verify multiplexer & de-multiplexer using VHDL code

Text Books:
1. "Computer Organization and Design: The Hardware/Software Interface" by David A.
Patterson and John L. Hennessy
2. "Digital Design: With an Introduction to the Verilog HDL, VHDL, and System Verilog"
by M. Morris Mano and Michael D. Ciletti

Reference Books:
1. "Modern Computer Architecture and Organization" by Jim Ledin
2. "Fundamentals of Digital Logic with VHDL Design" by Stephen Brown and Zvonko
Vranesic
3. "VHDL: Programming by Example" by Douglas L. Perry

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

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

CS2510: Artificial Intelligence Laboratory (0-0-3:1.5)

Prerequisites Knowledge of computer basics and programming logic

Course Outcomes:

CO1 Develop a basic understanding of AI building blocks presented in intelligent agents

CO2 Choose an appropriate problem-solving method and knowledge representation
technique.
CO3 Design models for reasoning with uncertainty as well as the use of unreliable
information.
CO4 Design and develop the AI applications in real world scenario.
CO5 Design and evaluate intelligent expert models for perception and prediction from
intelligent environment
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

List of Experiments

1. Write a program to print the multiplication table for the given umber

2. Write a program to find factorial of a number

3. Write program to implement Simple Calculator program.

4. Write a program to implement simple Chat bot.

5. Write a program to Implement of Towers of Hanoi Problem.
6. Write a Program to Implement Breadth First Search
7. Write a Program to Implement Depth First Search.
8. Write a program to implement Hill Climbing Algorithm
9. Write a program to implement A* Algorithm
10. Write a program to implement AO* Algorithm
11. Write a program to implement Tic-Tac-Toe game.

Text Books:
1. Artificial Intelligence: A Modern Approach, Russell, S., & Norvig, P. (2021). Artificial
Intelligence: A Modern Approach (4th ed.). Pearson.

2. Python Machine Learning, Raschka, S., & Mirjalili, V. (2019). Python Machine Learning
(3rd ed.). Packt Publishing

Reference Books:
1. Pattern Recognition and Machine Learning, Bishop, C. M. (2006). Pattern Recognition
and Machine Learning. Springer.
2. Deep Learning, Goodfellow, I., Bengio, Y., & Courville, A. (2016). Deep Learning. MIT
Press.
CO-PO Mapping: (1:Low, 2:Medium, 3:High)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 - - - - - - - 1 1
CO2 3 3 3 2 2 - - - 1 - 1 1
CO3 - 3 3 2 2 2 - - 1 - 1 1
CO4 2 3 3 2 2 2 - - 1 - 1 1
CO5 2 3 3 2 2 2 1 1 1 - 1 1
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CS2504: Java Laboratory (0-0-3:1.5)

Prerequisites Knowledge of C and C++ programming

Course Outcomes:

CO1 Students will be able to understand basics of Java programming with different
programming constructs like conditional statements and loopsand will analyze I/O in
Java.
CO2 Students will implement classes and objects, constructors and destructors.
CO3 Students will be able to implement interfaces, create user defined packages and their
usage.
CO4 Students will develop applets and implement their methods.
CO5 Students will implement network programming using datagrams and socket
programming.
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CO6 Students will understand and use multithreading using Threads class and Runnable
interfaces.

Detailed Syllabus

1. Basis Java programming with different programming constructs like conditional

statements and loops.
2. Java programs to accept inputs from user, different related exceptions and packages.
3. Programs on classes and objects, constructors, and destructors.
4. Programming on inheritance and implement interfaces,
5. Program to create user defined packages and their usage.
6. Programs to develop applets and implement their methods.
7. Programs to implement network programming using datagrams and socket
programming.
8. Programs to use multithreading using Threads class and Runnable interfaces.

Text Books:
1. "Java: The Complete Reference" by Herbert Schildt
2. "Head First Java" by Kathy Sierra and Bert Bates
Reference Books:
1. "Effective Java" by Joshua Bloch
2. "Java Network Programming" by Elliotte Rusty Harold

CO-PO Mapping: (1: Low, 2: Medium, 3: High)

PO PO1
PO1 PO2 PO3 PO4 PO6 PO7 PO8 PO9 PO11 PO12
5 0
CO1 3 3 3 - - - - - - - 1 1
CO2 3 3 3 2 2 - - - 1 - 1 1
CO3 - 3 3 2 2 2 - - 1 - 1 1
CO4 2 3 3 2 2 2 - - 1 - 1 1
CO5 2 3 3 2 2 2 1 1 1 - 1 1
CO6 2 3 3 2 2 2 1 1 1 - 1 1
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

CS2506: Database System Laboratory (0-0-3:1.5)

Prerequisites Knowledge of Databases and Basic Programming

Course Outcomes:

CO1 Create database objects using SQL

CO2 Manipulate database records using SQL
CO3 Retrieve records using SQL
CO4 Manage database views, synonyms, indices, user access, etc
CO5 Develop real-world project from any problem space

Detailed Syllabus

1. Introduction to Oracle database: Database objects, data types

2. Introduction to SQL, Data Definition, Creation of data objects
 ODISHA UNIVERSITY OF TECHNOLOGY AND RESEARCH
Techno Campus, Mahalaxmi Vihar, Ghatikia, Bhubaneswar-751029.
Syllabus Structure (Admission Batch: 2023-24)

3. Database constraints, creation of objects with constraints

4. Data manipulation: insertion, updation, deletion, etc
5. Retrieve data from multiple tables using various types of Join operations.
6. Create, alter, and manage Views from single & multiple base tables.
7. Create and use other data base objects like sequence, indexes, and synonyms.
8. Controlling user access to database using DCL queries: Grant, Revoke.
9. Perform Set operations on tables: Union, Union All, Intersect, Minus.
10. Write SQL queries by using co-related sub-queries.
11. Introduction to PL/SQL, identifiers, literals, and keywords.
12. Write PL/SQL block by using conditional statements and expressions
13. Implement Exception Handling in a PL/SQL block.
14. Write PL/SQL block by using numeric, string, and other miscellaneous data types
15. Oracle Triggers – introduction, syntax, types and use.

Text Books:
1. K. Loney, Oracle Database 11g : The Complete Reference, 1st Edition, McGraw-Hill,
2009.
2. Bayross, Teach Yourself SQL/PL SQL Using Oracle 8i and 9i with SQLJ, 1st Edition,
BPB Publications, 2003.

Reference Books:
1. S. Feuerstein, Oracle PL/SQL Programming, 6th Edition, O’Reilly, 2014.
2. M. Mclaughlin, Oracle Database 11g PL/SQL Programming, 6th Edition, McGraw-Hill
Education, 2014.
3. Silberschatz, H. F. Korth, and S. Sudarshan, Database System Concepts, 6th Edition,
McGraw-Hill Education, 2013.

CO-PO Mapping: (1:Low, 2:Medium, 3:High)

PO PO1
PO1 PO2 PO3 PO4 PO6 PO7 PO8 PO9 PO11 PO12
5 0
CO1 - 3 - 2 2 - - - - - - 2
CO2 - 2 - 2 2 - - - - - - 2
CO3 - 1 2 2 2 - - - - - - 1
CO4 - 2 - 2 2 - - - - - - 2
CO5 - 2 - 2 2 - - - - - - 2