Version 2018 Aiml

B.E.
(CSE) – Artificial Intelligence and Machine Learning

Vision
To become a prominent department of Computer Science & Engineering producing
competent professionals with research and innovation skills, inculcating moral values and
societal concerns.
Mission
 Provide learning ambience to generate innovative and problem solving skills with
professionalism
 Create facilities and expertise in advanced computer technology thereby promote
research
 Enhance Industry Institute Interaction program to get acquainted with corporate
culture
 Induce ethical values and spirit of social commitment
Program Educational Objectives (PEOs)

The graduate will be able to
PEO Have a bright career as Data Scientist, Machine Learning Engineer, NLP Engineer,
1 Researcher, or Entrepreneur and be able to adapt to the evolving technical challenges and the
changing career opportunities. Learn to effectively communicate ideas in oral written or
graphical form and to promote collaboration with other members of engineering teams
PEO Analyze a problem, identify and define the computing requirements appropriate to its solution
2 in addition to the ability to design, implement and evaluate a computer based system, process,
component, or programs to meet desired needs. Be able to continue to demonstrate the
professional skills and communicative abilities necessary to be competent employees, assume
leadership roles and have career success and satisfaction.
PEO Function effectively as a member or a leader of a diverse team under different environments.
3 Multidisciplinary work can be carried out by the teams.
PEO Have the agility to readily adapt to changing environments by continuously learning new state
4 of the art technologies
PEO Inculcate characteristics needed for leadership roles, professional ethics, excellence and active
5 participation in a successful career while working in an interdisciplinary team
Program Outcomes (POs)

At the end of the B.E. (CSE) – Artificial Intelligence and Machine Learning, graduates will be able to
PO1 Engineering Knowledge: An ability to apply knowledge of science, mathematical

foundations, algorithmic principles, and computer science and engineering theorems in the
modelling and design of computer-based systems to real-world problems
PO2 Problem analysis: Honed skill set comprising of evolutionary tools and techniques
applicable in computing & engineering practice.
PO3 Design/Development of solutions: To Recognize, Understand the real world problems and
to deploy and execute engineering solutions for sustainable eco system.
PO4 Investigations of complex problems: Ability to harness design and development principles
in the construction of verifying complex hardware and software systems.
PO5 Modern tool usage: An ability to come forward with lateral & efficient solutions using
modern tools for computing & engineering based problems.
PO6 The Engineer and Society: An educational ideology to assess the local & global impact of
computing and engineering solutions on individuals, organizations and society.
PO7 Environment and Sustainability: An ability to develop a computer-based system, process,
component, or program to meet the desired needs, within realistic constraints such as
economic, environmental, social, political, health and safety, manufacturability, and
sustainability
PO8 Ethics: An ability to challenge and solve professional, interpersonal, ethical, security &
social issues along with ability to perform responsibilities & duties
PO9 Individual and teamwork: An ability to participate effectively in multi-disciplinary teams
PO1 Communication: The ability to work in Professional environment and to communicate
0 effectively with peers
PO1 Project Management and Finance: Demonstrate knowledge and understanding of the
1 engineering and management principles and apply these to one’s own work, as a member
and leader in a team, to manage projects and in multidisciplinary environments.
PO1 Life-long Learning: The knowledge by recognizing professional development by pursuing
2 post graduate studies or face competitive examinations that offer challenging and rewarding
careers in computing.
Program Specific Outcomes (PSOs)
PSO1 Develop and apply algorithms to build machine intelligence.
PSO2 Apply principles of Data Science to solve real world problems
Demonstrate knowledge of statistical data analysis techniques for decision making

PSO3
PSO4 Delineate knowledge of data analytic tools and techniques utilized in business
decision-making
PSO5 Apply ethical practices in everyday business activities and make well-reasoned ethical
business and data management decisions
Scheme For 2018-2022
University Institute of Engineering – CSE IBM Collaborated Courses
Chandigarh University, Gharuan
Scheme Version: 2019 Name of Degree- BE CSE (Artificial Intelligence
Total Credits : 198
and Machine Learning)
First Semester Scheme
Course Code Course Name L T P S C
SMT-122 Calculus and Vector Spaces 3 2 0 5
Innovation and Inventions in Computer Science and
CST-156 2 0 0 2
engineering
UCT-144 Computer Programming 2 0 0 2
UCT-141 Communication Skills 2 0 0 2
EET-112 Basic Electrical and Electronics Engineering 3 1 0 4
SPT-125 Advanced Engineering Physics 3 1 0 4
SPP-126 Advanced Engineering Physics Lab 0 0 2 1
UCP-145 Computer Programming Lab 0 0 4 2
EEP-118 Basic Electrical and Electronics Engineering Lab 0 0 2 1
MEP-160 Workshop Practice 0 0 4 2
UCP-142 Professional Communication Skill Lab 0 0 2 1
UCY-146 Life Skill and Mentoring 0 1 0 0 NON

GRADED
1
Total 15 4
4
26
Second Semester Scheme L T P S C
SMT-172 Probability & Statistics 3 2 0 0 5
ECT-155 Digital Electronics 3 0 0 0 3
SZT-172 Biology for Engineers 3 0 0 0 3
CST-157 Object Oriented Programming Using C++ 0 2 0 0 2
PCT-154 Professional Communication Skills 2 0 0 0 2
CST- 0
166/CST- Modern Areas of Software in CC/IS/BDA 2 0 0 2
171/CST-165
CSP-157 Object Oriented Programming Using C++ Lab 0 0 4 0 2
ECP-156 Digital Electronics Lab 0 0 2 0 1
MEP-117 Engineering Graphics Using CAD Lab 1 0 4 0 3
PCP-158 Professional Communication Skills Lab 0 0 2 0 1
UCY-196 Life Skill and Mentoring 0 1 0 0 NON

GRADED
1 0
Total 14 5 6 24
Third Semester Scheme
CST-217 Data structures 3 1 0 0 4
CSP-219 Data structures lab 0 0 2 0 1
CST-205 Operating system 3 0 0 0 3
CST-209 DBMS 3 0 0 0 3
CST-208 Programming in Java 3 0 0 0 3
CST-216 Software Engineering 3 0 0 0 3
CST-218 Discrete Mathematics 3 1 0 0 4
UCT-248 Entrepreneurship 1 0 0 0 1
CSP-220 DBMS Lab 0 0 2 0 1
CSP-210 Operating System lab 0 0 2 0 1
CSP-218 Programming in Java Lab 0 0 2 0 1
TDP-201 Soft Skills1 0 0 2 0 1
CSI-212 Institutional Training 0 0 0 0 2
1
Total 19 2 0 0 28
CSY-201 MOOC -1 0 0 0 2 2
Fourth Semester Scheme
CST-259 Computer Organization & Architecture 3 0 0 0 3
CST-281 *System Programming* 3 0 0 0 3
CST-255 *Microprocessor and Interfacing* 3 0 0 0 3
*** Advance Probability and Statistics 3 1 0 0 4
*** Python and its Applications in AI 3 0 0 0 3
UCT-249 Introduction to Artificial Intelligence 1 0 0 0 1
CSP-252 System Programming Lab 0 0 2 0 1
CSP-257 Microprocessor and Interfacing Lab 0 0 2 0 1
*** Python and its Applications in AI Lab 0 0 2 0 1
*** Project Based Learning in Java Lab 0 0 6 0 3
TDT-252 Aptitude 0 2 0 0 1
1 0
Total 16 3 2 24
Fifth Semester Scheme
CST-319 Data Mining and Warehousing 3 0 0 0 3
CST-302 Design & Analysis of Algorithms 3 0 0 0 3
CST-309 Computer Networks 3 0 0 0 3
CST-310 Digital Image Processing 3 0 0 0 3
*** Soft Computing 3 0 0 0 3
CSP-301 Computer Networks Lab 0 0 2 0 1
CSP-308 Design & Analysis of Algorithms Lab 0 0 2 0 1
CSP-302 Digital Image Processing Lab 0 0 2 0 1
*** Soft Computing Lab 0 0 2 0 1
CST-311 Engineering Practice 0 2 0 0 1
CSR-310 Minor Project 0 0 2 0 2
1 3
Total 18 4 1 24
CSI-313 Industrial Summer Training 0 0 0 0 2
*** IOT 3 0 0 0 3
TDY-301 Soft Skills 0 0 2 0 2
TDY-302 Aptitude 0 2 0 0 1
CSY-301 MOOC -2 0 0 0 2 2
Sixth Semester Scheme
CST-352 Theory of Computation 3 0 0 0 3
CST-365 Network Operating System 3 0 0 0 3
*** Computer Vision 3 0 0 0 3
*** Natural Language Processing 3 0 0 0 3
*** Web Technologies 2 0 0 0 2
*** Computer Vision lab 0 0 2 0 1
*** Natural Language Processing Lab 0 0 2 0 1
*** Web Technologies Lab 0 0 2 0 1
*** Major Project 0 0 2 2 2
*** NOS lab 0 0 2 0 1
CSY-376 Enterprise Resource Planning/Mobile Computing 3 0 0 0 3
TDY-351 Soft Skills 0 0 2 0 2
TDY-352 Aptitude 0 2 0 0 1
1 2
Total 17 2 2 23
Seventh Semester Scheme
OE-1 Open Elective-I 3 0 0 0 3
***
Deep Learning 3 0 0 0 3
CST-403
Advanced Database Management System 3 0 0 0 3
CST-410
Security and Data Privacy Laws and Standards 3 0 0 0 3
***
Deep Learning lab 0 0 2 0 1
CST-408
Advanced Database Management Lab 0 0 2 0 1
CSY401
MOOC –3 0 0 0 5 5
Total 12 0 4 5 19
Eighth Semester Scheme
*** Open Elective-II 3 0 0 0 3
*** Human Computer Interaction 3 0 0 0 3
*** Augmented Reality 3 0 0 0 3
*** Blockchain 2 0 0 0 2
*** Human Computer Interaction lab 0 0 4 0 2
*** Augmented Reality lab 0 0 2 0 1
*** Blockchain Lab 0 0 2 0 1
CST-471 Technical Training 0 2 0 0 2
*** MOOC-4 0 0 0 5 5
Total 11 2 8 5 22
Note: *** indicates that the course code is yet to be generated.
3RD SEMESTER SYLLABUS
Scheme Name of Course: Data Structures L T P S C
Version: Apply to Programs : Common to all 3 0 0 0 3
2019 Specializations of CSE 2nd Year
Total Marks: 100
Internal Marks: 40 External Marks: 60
Course Pre-requisite: Basic programming Total hours =
Code 45Hours
CST-217 Course Objective
 To understand the concept of the data structures and operations on them,
 To apply different data structures for modeling real world problems.

Course Outcomes
1 Understand the properties of various data structures.
2 Identify the strengths and weaknesses of different data structures
3 Design and employ appropriate data structures for solving computing
problems
Content of the Syllabus
UNIT-I [15]
Introduction: Concept of data and information, Introduction to Data Structures, Types of

data structure: Linear and non-linear data structures, operations on Data Structures,
Algorithm complexity, Time-space trade off, asymptotic notations.
Arrays: Basic terminology, Linear arrays and their representation, Traversing Linear Array,
Insertion & Deletion in arrays, searching – linear search, binary search, sorting – insertion
sort , selection sort , bubble sort , merging arrays & merge sort , complexity analysis of each
algorithm, Multi-dimensional arrays and their representation, Pointers; Pointer Arrays,
Records; Record structure, representation of records in Memory, Parallel Arrays, sparse
matrices and their storage.
UNIT-II [15]
Linked List: Linear linked list, Representation of Linked Lists in Memory, Traversing a
linked list, searching a linked list, insertion in & deletion from linked list, Header Linked
List, doubly linked list, Operations on doubly linked list, complexity analysis of each
algorithm, Application of linked lists.
Stacks: Basic terminology, Sequential and linked representations, Operations on stacks:
PUSH & POP, Application of stacks: Parenthesis matching, evaluation of postfix
expressions, conversion from infix to postfix representation, Quick Sort and its complexity
analysis. Meaning and importance of recursion, principles of recursion & implementation of
recursive procedure
Queues: Linear queue, Sequential and linked representation of Linear queue, Circular queue,
Operations on queue, Deques, Priority queue.
UNIT-III [15]
Graphs: Graph Theory terminology, sequential representation of graphs (adjacency matrix,

Path Matrix), traversing a graph, Operations on Graph.
Trees: Basic terminology, Binary Trees, Representation of Binary Trees in Memory,

traversing Binary Trees, Traversal Algorithms using stacks, Header Nodes; Threads, Binary
Search trees, Searching, Inserting & Deleting in Binary Search Trees, AVL Search trees, B
Trees, Heap & Heap Sort.
Hashing & File Organization: Hash Table, Hash Functions, Collision Resolution Strategies,
Hash Table Implementation. Concepts of files, Organization of records into Blocks, File
organization: Sequential, Relative, Index Sequential, Inverted File.
Text Books:
1. Lipschutz, Seymour, “Data Structures”, Schaum's Outline Series, Tata McGraw Hill.
2. Gilberg/Forouzan,” Data Structure with C ,Cengage Learning.
3. Augenstein,Moshe J , Tanenbaum, Aaron M, “Data Structures using C and C++”,
Prentice Hall of India.
Reference books:
1. Goodrich, Michael T., Tamassia, Roberto, and Mount, David M., “Data Structures
and Algorithms in C++”, Wiley Student Edition.
2. Aho, Alfred V., Ullman, Jeffrey D., Hopcroft ,John E. “Data Structures and
Algorithms”, Addison Wesley.
Scheme Name of Course: Data Structures Lab L T P S C
Version: Apply to Programs Common to all 0 0 2 0 1
Total Marks: 100
Course Pre-requisite: Studied C/C++ in previous semesters Total hours
Code =45Hours
CSP-219 Course Objective
 To implement various data structure and operations on them using C++.

 To implement various sorting and searching algorithms using C++.
Course Outcomes
1 Designing and applying appropriate data structure using simple algorithms for
modeling and solving given computing problems.
2 Understand and implement the both array based and linked-list based data
structures, including singly, doubly, and circular linked-lists.
3 Understand and implement the Stack data structure and stack operations.
UNIT-I
1. Write a menu driven program that implement following operations (using separate
functions) on a linear array:
a) Insert a new element at end as well as at a given position
b) Delete an element from a given whose value is given or whose position is given
c) To find the location of a given element
d) To display the elements of the linear array
2. Program to demonstrate the use of linear search to search a given element in an array.
3. Program to demonstrate the use of binary search to search a given element in a sorted array
in Ascending order.
4. Program to sort an array of integers in ascending order using bubble sort.
5. Program to sort an array of integers in ascending order using selection sort.
6. Program to sort an array of integers in ascending order using insertion sort.
7. Program to sort an array of integers in ascending order using merge sort.
Scheme Name of Course: Operating System L T P S C
Version: Apply to Programs :Common to all 3 0 0 0 3
Total Marks: 100
Course Pre-requisite: Total hours =
Code 45Hours
 To grasp a fundamental understanding of operating systems and its

functionalities.
 To understand process management, various scheduling algorithms,
concurrency and synchronization.
 To understand memory management and virtual memory concepts in
modern Operating systems.
Course Outcomes
1 Describe the general architecture of computers
2 Describe, contrast and compare different structures for operating systems
3 Understand and analyze theory and implementation of: processes, resource
control (concurrency etc.), physical and virtual memory, scheduling, I/O
and files
UNIT-I [15]
Introduction to the Operating System: Introduction to Operating Systems, Operating

System Structure, Main Functions and characteristics of Operating Systems, Types of
Operating Systems, System calls, Types of system calls, System programs.
Process Management: Process Concept, Process Control Block, Process Scheduling,

Threads, CPU Scheduling : Preemptive/ Non Preemptive Scheduling, Scheduling Criteria,
Scheduling Algorithms, inter-process communication, remote procedure calls, Process
Synchronization.
Deadlocks: Deadlock characterization and conditions for deadlock, deadlock prevention,
Deadlock avoidance-safe state, resource allocation graph algorithm, Banker’s algorithms-
Safety algorithm, Deadlock detection, Recovery from deadlock.
UNIT-II [15]
Memory Management: Address binding, logical versus physical address space, dynamic
loading, Swapping, contiguous memory allocation, Fragmentation, Paging, Segmentation,
Segmentation with Paging, Virtual Memory Concept, Demand Paging, Page Replacement,
Page Replacement Algorithms.
Device Management: Disk Structure, Disk formatting, Disk Scheduling Algorithms, RAID
structure-RAID levels, problems with RAID.
File Management: File Concepts, Access Methods, Directory Structure, Allocation

Methods, Free Space Management.
UNIT-III [15]
System Protection and Security: Goals, principles and domain of protection, Access matrix,
implementation of access matrix, the security problem, program threats, system and network
threats.
Distributed and Network Operating Systems: Overview: Topology, connection strategy,

network operating system types: Peer to Peer & Client server, Distributed message passing.
Text Books:
1. Galvin, Peter B., Silberchatz, A., “Operating System Concepts”, Addison Wesley, 8th
Edition.
2. Flynn, “Operating Systems”, Cengage Learning.
3. Dhamdhere, D.M., "Operating System:A Concept Based Approach",
Tata Mc-Graw- Hill.
Reference Books:
1. Madnick , Stuart E., Donovan, John J. “ Operating System”, McGraw Hill.
2. Stalling, William, “Operating Systems”, Pearson Education, Fifth Edition.
Scheme Name of Course: Database Management L T P S C
Version: Systems
2019 Apply to Programs: Common to all 3 0 0 0 3
Specializations of CSE 2nd Year
Total Marks: 100
Course Pre-requisite: Total hours =45
Code
 To understand the concepts of relational databases
 To design the database
To learn about distributed databases

Course Outcomes
1 Designing database
2 Using SQL queries and implementing on the database
3 Understand the entity-relationship model
UNIT-I [15]
Relational Databases, Installation and Planning, Data Modeling, Data Modeling and Database
Design, Relational Databases, Introduction to RDBMS, Understanding a Table, Relational
Concepts
Database Query Languages, Simple SQL Queries, Retrieving Data from Multiple Tables,
Scalar Functions and Grouping, Database Query Languages, Column Functions and
Grouping, Union, Using Sub-queries
UNIT-II [15]
Relational Database Design, Views and Results during DB Design, Problem Statement,
Relational Database Design, Entity Relationship Model, Data and Process Inventories, Tuple
Types, From Tuple Types to Tables, Integrity Rules, Indexes, Logical Data Structures
UNIT-III [15]
Distributed Databases, Distributed Data, Physical Database Design, Physical Implementation,

Intermediate SQL, Maintaining Data, Information Storage and Retrieval, Data Moving Data,
Mapping - DB2 vs. Oracle
Text Books:
1. IBM Course Material Fundamentals of Information Management Basics (DBMS)

Scheme Name of Course: Programming in Java L T P S C
Version: nd
Apply to Programs: Common to all specialization (2 3 0 0 0 3
2019
Year)
Total Marks: 100
Course Pre-requisite: Knowledge of C++ Total hours =45
Code
CST-208
Course Objective
 The course will focus on using a teacher-student interactive and
decision-oriented learning exercises
 For the active learning mode in the course to be effective, participating
in class discussions is extremely important along with self-paced
learning to clear the concepts of software.
 In addition to the lectures, discussions and demonstrations, students
would be required to work on sample applications and exercises
Course Outcomes
1 Knowledge of the structure and model of the Java programming language,
(knowledge) and use the Java programming language for various programming
technologies (understanding)
2 Develop software in the Java programming language, (application) and evaluate
user requirements for software functionality required to decide whether the Java
programming language can meet user requirements
3 Propose the use of certain technologies by implementing them in the Java
programming language to solve the given problem and Choose an engineering
approach to solving problems, starting from the acquired knowledge of
programming and knowledge of operating systems.
UNIT –I [15h]
Introduction to Procedural Programming, Object-Oriented Programming, Introduction to
SDLC, Introduction to UML, Introduction to Java Programming Language, Introduction to
Java Development tools – Eclipse, Java Syntax Basics : Variables and primitive types,
Arrays, Operators, Objects & Messages, Strings, Wrapper classes, Statements - Conditional,
Looping, Branching, Building Classes.[18]
UNIT –II [15h]
Debug Applications, Inheritance and Refactoring, Collections, Threads and Synchronization,
Utility Classes, Exceptions and Exception Handling, Serialization and Streams, AWT,
Swings, Sockets, Java Beans, Java EE Web Component Introduction, Java Servlets, Java
Servlets API.[16]
UNIT –III [15 h]
Java Server Pages, JSP Specification and Syntax, Page Designer, Web
ApplicationsDebugging, Web Archive Deployment Descriptor, Session Management, Cookie
API, Http Session: Management of Application Data, URL Rewriting, JSP Expression
Language, JSP Tag Files – Custom Tags, Xdoclets Annotations, Connecting to Database,
Web Application Security, Java EE Packaging and deployment, Best Practices for Server side
Application. [17]
Text Book:
1. Object Oriented Programming Using Java – IBM Study Material.
2. Complete Reference –Herbert Schildt
Scheme Name of Course: Software Engineering L T P S C
Version: Apply to Programs: Common to all 3 0 0 0 3
Total Marks: 100
Course Pre-requisite: Knowledge of basic mathematics Total hours =45
Code
The purpose is to provide project-rich learning experiences to educate
engineers for success in a rapidly evolving computing field.
Course Outcomes
1 To be able to analyze, design, verify, validate, implement, apply, and maintain
software systems.
2 To be able to identify, formulate, and solve engineering problems.
3 To appropriately apply discrete mathematics, probability and statistics, and
relevant topics in computer science and supporting disciplines to complex
software systems.
Unit-I
Introduction: What is meant by Software Engineering? Definitions of Software Engineering;

Difference between Program and Software, Software Crisis – problem and causes, Software life
cycle models: Waterfall, Prototype, Evolutionary and Spiral models.
Software Project Planning: Cost estimation: COCOMO model, PERT and CPM, Putnam
Resource Allocation Model, Risk management, project scheduling, personnel planning, team
structure, Software configuration management, quality assurance, project monitoring.
Unit-II
Software Requirement Analysis and Specifications: Structured Analysis, Data Flow

Diagrams, Data Dictionaries, Entity-Relationship diagrams, Software Requirement and
Specifications, Behavioral and non-behavioral requirements.
Software Design: Design fundamentals, problem partitioning and abstraction, design

methodology, Cohesion & Coupling, Classification of Cohesiveness & Coupling.
Coding: Programming style, structured programming.
Unit-III
Software Testing: Testing fundamentals, Functional testing: Boundary Value Analysis,

Equivalence class testing, Decision table testing, Cause effect graphing, Structural testing:
Control flow based and data flow based testing, loop testing
Software testing strategies: unit testing, integration testing, Validation testing, System
testing, Alpha and Beta testing
Software Maintenance: Type of maintenance, Management of Maintenance, Maintenance

Process, maintenance characteristics.
Text Books –
1. Pressman R. S., “Software Engineering – A Practitioner’s Approach”, Tata McGraw Hill.
2. Jalote P., “An Integrated approach to Software Engineering”, Narosa.
Reference Books –
1. Sommerville, “Software Engineering”, Addison Wesley.
2. Fairley R., “Software Engineering Concepts”, Tata McGraw Hill.

Scheme Name of Course: Database Management L T P S C
Version: Systems Lab
Total Marks: 100
Course Pre-requisite: Studied C/C++ in previous semesters Total hours =30
Code
 To implement different SQL and PL/SQL commands.

 To learn relations within different relational models.
 To develop a project using database concepts.
Course Outcomes
1 To analyze an information storage problem and derive an information
model expressed in the form of an entity relation diagram and other optional
analysis forms, such as a data dictionary
2 To implement the concept of the relational data model.
3 To formulate, using SQL, solutions to a broad range of query and data update
problems. To develop a project using database concepts.
.
List of Experiments
UNIT-I
1. Introduction to DBMS, RDBMS, Oracle and basic SQL Commands
2. Create tables and specify the Queries in SQL.
3. To Manipulate the Operations on the table.
4. To implement the restrictions on the table.
5. To implement the structure of the table.
UNIT-II
6. To implement the concept of Joins.

7. To implement the concept of grouping of Data.
To implement the concept of Sub Query.
8. To implement the concept of Indexes and views. To implement cursors, triggers and
views.
UNIT-III
9. Design a case study for university management system.

10. Create a database for library management system.
11. Design a case study for railway reservation system.
Scheme Name of Course: Operating System Lab L T P S C
Total Marks: 100
Course Pre-requisite: Studied C/C++ in previous semesters Total hours = 30
Code
 To understand Computer Hardware and networking.

 To execute various commands in LINUX.
 To understand the concept of shell programming.
Course Outcomes
1 Basic LINUX Commands.
2 Introduction to Shell Programming and control structure
3 Loop control Structure and formatted output.
UNIT-I
1. Installation of Linux operating system.
2. Study of basic Linux commands.
3. Programs using the following system calls of Linux operating system: fork, getpid,
getppid, exit, wait,close.
4. Use of Linux file related commands like ls, grep, cat, etc.
5. Programs using the I/O system calls of Linux operating system( open, read, write etc).
6. Study of basics of shell programming.
UNIT-II
7. Write a program to show the use of echo .
8. Write a program to read the keywords in shell programming.
9. Write a program using arithmetic operators in shell programming.
10. Write a program using relational operators in shell programming.

11. Write a program using Boolean operators in shell programming.
12. Write programs using control structures in shell programming.
13. Write a program to demonstrate the difference between while and until statement.
UNIT-III
14. Simulation of First come first serve CPU scheduling algorithm.
15. Simulation of Shortest job first CPU scheduling algorithm.
16. Simulation of Round Robin CPU scheduling algorithm.
17. Simulation of Priority based CPU scheduling algorithm.
18. Simulate the Bankers algorithm for deadlock avoidance and deadlock prevention.
Scheme Name of Course: Programming in Java Lab L T P S C
Version:
Apply to Programs: Common to all Specializations 0 0 2 0 1
2019 nd
of CSE 2 Year
Total Marks: 100
Course Pre-requisite: Knowledge of C++ Total hours =45
Code
CSP-218
Course Objective
 Students will learn basic programs java.
 Students will learn the advance concepts of java
 To enable students to retrieve and update data from relational databases
using JDBC
Course Outcomes
1 The students will learn to write, compiling & execute basic java program and
learn the use of data types & variables, decision control structures: if, nested if
etc
2 The student will learn the use loop control structures: do, while, for etc.
3 The student will be able to create classes and objects and use them in their
program.
UNIT-I
1. Write a program in Java to find the result of following expression by getting inputs at
run time.
(a<<2 ) + (b<<1)
(a)|| (b>0)
(a + b * 100)/10
a&b
2. Write a program in Java to find the average of marks obtained by a study in five
papers.
Papers Paper1 Paper2 Paper3 Paper4 Paper5
Marks 50 70 65 80 56
3. Write a program in Java for find AXB where A is a matrix of 3X3 and B is a matrix
of 2X3.
4. Write a program in Java with class Rectangle with the data fields width, length, area
and color. The length, width and area are of double type and color is of string type.
The methods are set_length() , set_width() , set_color(), and find_area(). Create two
object of Rectangle and compare their area and color. If area and color same for the
objects then display “Matching Rectangles” otherwise display “Non Matching
Rectangle”.
5. Create a class Account with two overloaded constructors. First constructor is used for
initializing, name of account holder, account number and initial amount in account.
Second constructor is used for initializing name of account holder, account number,
address, type of account and current balance. Account class is having methods
Deposit(), WithDraw(), and GetBalance().Make necessary assumption for data
members and return types of the methods. Create objects of Account class and use
them.
6. Write program in Java to create a string object. Initialize this object with your name.
Find the length of your name using appropriate String method. Find whether character
‘a’ is in your name or not, if yes find the number of times ‘a’ is appear in your name.
Print locations of occurrences of ‘a’ Try same for different string objects.
UNIT-II
7. Write a program in Java to create an Array List object having details as Student UId,
Name and Department of 5 Students. And display it using Iterator interface.
8. Write a program in java which implement interface Student which has two methods
Display_Grade and Attendance for PG_Students and UG_Students (PG_Students and
UG_Students are two different classes for Post Graduate and Under Graduate
Students respectively).
9. Write a program in Java to display name and roll number of students. Initialize
respective array variables for 10 students. Handle ArrayIndexOutOfBoundsException,
so that any such problem does not cause illegal termination of program.
10. Write a java program using thread synchronization in multithreading.
11. Program to create a calculator with the help of AWT packages in Java.
UNIT-III
12.Write a program to create a student registration form with the help of swings in Java
and also do the database connectivity.
13.Create a simple HTML form containing a Text field and a Button. By clicking on
submit button, servlet is opened displaying a simple Hello message with the name
entered in the Text field.
14.Write a JSP to output the entire line, "Hello! Today is current date of
system”usingjava.util.Date class.
15.Write a simple JSP to print Hello message concatenated with the name entered in a
text field by user.
Scheme Name of Course: Dicrete Mathematics L T P S C
Version:
Apply to Programs: Common to all Specializations 0 0 2 0 1
2019 nd
of CSE 2 Year
Total Marks: 100
Course Pre-requisite: Knowledge of basic maths Total hours =45
Code
CST-218
Course Objective
 Identify and apply basic concepts of set theory, arithmetic, logic, proof
techniques, binary relations, graphs and trees
 Apply the knowledge and skills obtained to investigate and solve a variety
of discrete mathematical problems
Course Outcomes
1 Some fundamental mathematical concepts and terminology; How to use and
analyze recursive definitions;
2 How to count some different types of discrete structures;

3 Techniques for constructing mathematical proofs, illustrated by discrete
mathematics examples.
Contents of the Syllabus

UNIT-I [15]
Set Theory: Introduction to set theory, set operations, algebra of sets, combination of sets,
duality, finite and infinite sets, classes of sets, power sets, multi sets, Cartesian product
Relations and functions: Binary relations, types of relations, equivalence relations and
partitions, partial order relations, mathematical induction, principles of inclusion & exclusion,
functions and its types, composition of function and relations, inverse relations and functions
pigeonhole principle.
Propositional calculus: Basic operations: AND (˄) OR (˅), NOT (-) Truth value of a
compound statements, propositions, tautologies, contradictions.
UNIT-II [15]
Recursion and recurrence relations: Sequence, partial fractions linear recurrence relations
with constant coefficients, homogeneous and particular solutions, solutions of recurrence
relation using generating functions.
Algebraic structures: Definition, elementary properties of algebraic structures, semigroup
monoid, group, homomorphism, isomorphism and automorpbism, congruence relations,
subgroups, normal subgroups, cosets, Lagrange's theorem, cyclic groups, rings, integral
domains and fields.
UNIT-III [15]
Combinatorial Mathematics: Techniques of counting, rule of sum, rule of product
permutations and combinations.
Graph Theory : Introduction to graphs, directed and undirected graphs, homomorphic and
isomorphic graphs, sub graphs multi graphs and weighted graphs, paths and circuits, shortest
path in weighted graphs, eulerian paths and circuits, Hamiltonian paths and circuits, planer
graphs Euler's formula, chromatic
numbers (coloring problems).
Trees: Introduction to trees, difference between graphs and a tree rooted trees, path length in
trees, spanning trees & cut-sets, minimum spanning trees, binary trees and its traversal.
Text Books:
1. Liu C.L., “Elements of Discrete Mathematics". McGraw Hill, 3rd Edition.
2. Santha,"Discrete Mathematics with Graph Theory, Cengage Learning, 1st Edition.
3. Ronald G, Knuth, Donald and Patashik, Oren, " concrete Mathematics: A
Foundation for Computer Science ", Addison-Wesley.
Reference Material:
1. Kolaman, B. and Busby R.C, “Discrete Mathematical Structures”,PHI, 1st Edition.
2. Gersting, Judith L. “Mathematical Structures for computer Science”, Computer Science
Press.
3. Doerr and Levasseur, “Applied Discerte Structure for Computer Science”.
4. Tembley& Manohar, “Discrete Mathematical Structures with Applications to
Computers”, McGraw Hill.
5. Rosen K.H, “Discrete Mathematics and its applications”, Mc-Graw hill.
6. Lyengar. N Ch SN, Chandrasekaran, VM, “Discrete Mathematics”.
4TH SEMESTER SYLLABUS
Scheme Name of Course: Computer Organization and L T P S C

Version: Architecture
2019 Apply to Programs :Common to all 3 0 0 0 3
Total Marks: 100
Course Pre-requisite: Basics computer and electronics Total hours =45
Code knowledge
 To familiarize students with the architecture of a processor.
 To have a good understanding of various functional units of computer.
 To understand the design of a basic computer system.
Course Outcomes
1 Understand the operation of electronic logic elements
Understand the organization of a computer system in terms of its main
components
Understand different processor architectures.
2 Understand input/output mechanisms
Understand the various parts of a system memory hierarchy
3 Have practical experience of prototyping digital circuits

Be able to interface digital circuits to microprocessor systems.
UNIT-I [15h]
Basic concepts-Digital computer with its block diagram, computer hardware components -
ALU, registers, memory, system bus structure-data, address and control bus.
Instruction Set Architectures-Levels of programming Languages, Assembly Language

Instructions: instruction cycle, instruction types, addressing modes, RISC v/s CISC.
Computer Organization- CPU organization, Memory Subsystem Organization: Types of

memory, Internal Chip Organization, memory subsystem configuration.
UNIT-II [15h]
Design of control unit - Hardwired control unit, Micro-Programmed control unit and
comparative study.
Memory organization-Memory hierarchy, Cache Memory Associative Memory, Cache

memory with associative memory, Virtual Memory: Paging, Segmentation.
Input output organization –Asynchronous Data transfer: Source Initiated, Destination

Initiated, Handshaking, Programmed I/O, Interrupts DMA, IOP
UNIT-III [15h]
Introduction to Parallel Processing- Parallelism in uniprocessor system, Flynn’s

Classification, Handler’s Classification, concept of pipelining, Instruction Pipeline,
Arithmetic Pipeline.
Multiprocessors- Characteristics of multiprocessors, Uniform and non-uniform memory

access multi processors, various interconnection networks.
Text Books:
1. Carpinelli J.D,” Computer systems organization &Architecture”, Fourth Edition,

Addison Wesley.
2. Patterson and Hennessy, “Computer Architecture”, Fifth Edition.
Reference Books:
1. J.P. Hayes, “Computer Architecture and Organization”, Third Edition.

2. Mano, M., “Computer System Architecture”, Third Edition, Prentice Hall.
3. Stallings, W., “Computer Organization and Architecture”, Eighth Edition, Pearson
Education.
Subject Code SYSTEM PROGRAMMING L T P S C

Total Contact Hours : 42 Hours
CST-281 Common to all Specializations of 3 0 0 0 3
CSE 2nd Year
Marks-100
Internal-40 External-60
Course Objectives
 Design, write, and test moderately complicated low-level programs using a
systems programming language.
 Proficiently use a preprocessor to implement code that is portable between
different computing platforms.
 Implement routines that read and write structured binary fies such as word
processing documents, index systems, or serialized hierarchical data
Unit Course Outcomes

To understand the execution process of HLL programs.
I.
To understand the working of scanners and parsers
III. To understand the basic design of various system software.
IV. To implement various system software.

UNIT-I
Editors: Line editor, Full screen editor and multi window editor. Case study MS-Word, DOS
Editor and vi editor.
Assemblers: First pass and second pass of assembler and their algorithms. Assemblers for
CISC Machines: case study x85 & x86 machines.
.
UNIT-II
Compilers: Introduction to various translators, Various phases of compiler, Introduction to
Grammars and finite automata, Bootstrapping for compilers, Lexical Analysis and syntax
analysis, Intermediate Code Generation, Code optimization techniques, Code generation,
Case study :LEXX and YACC, Design of a compiler in C++ as Prototype.
Debuggers: Introduction to various debugging techniques, Case Study: - Debugging in Turbo

C++ IDE.
UNIT-III
Linkers and Loaders: Concept of linking, Case study of Linker in x86 machines, loading of
various loading schemes.
Operating System: Booting techniques and sub-routines, Design of kernel and various
management for OS, Design of Shell and other utilities
Socket Programming: Basics of Socket Programming, Socket Objects, Datagram Socket
Text Books:
1. Donovan J.J., Systems Programming, New York, Mc-Graw Hill, 1972.
2. Dhamdhere, D.M., Introduction to Systems Software, Tata Mc-Graw Hill 1996.
Reference Books:
1. Aho A.V. and J.D. Ullman Principles of compiler Design Addison Wesley/
Narosa 1985.
Scheme Name of Course: Microprocessors and L T P S C

Version: Interfacing
Specializations of CSE 2ndYear
Total Marks: 100
Course Pre-requisite: Studied Computer Architecture & Total hours
Code Basics of Computers =45Hours
 To understand the architecture, components, flags and instruction set of
8085 and 8086.
 To design interfacing circuits using 8085 and 8086.
To gain familiarity with 8255(PPI), 8253(Programmable interval timer), 8259

( PIC), 8237(DMA) and advanced microprocessor chips.
Course Outcomes
1 Identify the basic element and functions of microprocessor.
Describe the architecture of microprocessor and its peripheral devices.

2 Demonstrate fundamental understanding on the operation between the
microprocessor and its interfacing devices.
3 Apply the programming techniques in developing the assembly language
program for microprocessor application.
Unit-I [15h]
Introduction: Review of Hardwired Logic v/s Flexible Logic, Tri State Logic. Introduction
to microprocessor, Difference between microprocessor and microcomputer, Basic
components of a microprocessor, system bus: address, data and control buses.
8085 microprocessor: Architecture, pin diagram, flags, addressing modes, instruction set
and assembly language programming, timing diagrams, interrupt structure of 8085.
Memory Interfacing: Interfacing memory- Interfacing SRAM, DRAM, EPROM etc.
Unit-II [15h]
Interfacing devices:
Architecture, Block Diagram, Control words, Modes and working of 8255.

Architecture, Block Diagram and working of8251
Architecture, Block Diagram and working of 8253
Unit-III [15h]
8086 Microprocessor: Architecture, block diagram and pin diagram of 8086, operating
modes of 8086, details of sub-blocks such as EU, BIU; memory segmentation and physical
address computations, program relocation, addressing modes.
Advanced microprocessors: Introduction to 80186, 80286, 80386, 80486, Pentium

microprocessors.
Text Books:
1. Gaonkar, Ramesh S., “Microprocessor Architecture, Programming & Applications

with 8085”, Wiley Eastern Ltd.
2. Ayala, “The 8086 Microprocessor: Programming & Interfacing the PC”, Cengage
Learning.
3. Bhurchandi, K.M, Ray, A.K, “Advanced microprocessors and peripherals”, TMH.
Reference Books:
1. Brey, “The Intel Microprocessors 8086- Pentium processor”, PHI.

2. Triebel and Singh, Avtar, “The 8088 & 8086 Microprocessors-Programming,
interfacing, Hardware & Applications”, PHI
3. Liu, Yu-Chang &Gibson, Glenn A, “Microcomputer systems: The 8086/8088
Family: architecture, Programming & Design”, PHI.
4. Antonakos, James L., “The Pentium processor”, Pearson.
Scheme Name of Course: Advanced Probability and L T P S C

Version: Statistics
Total Marks: 100
Course Pre-requisite: Mathematics, Probability and Statistics Total hours = 60
Code
*** Course Objective
To apply the advanced concepts of Probability

To learn Bayesian statistics
To learn the advanced concepts of Statistics
Course Outcomes
1 To learn the core concepts of probability theory, understand difference between
one and two dimensional random variable, will be able to understand two
dimensional random variable distributions and will be able to find joint density
function, marginal density function, stochastic independence
2 To understand the difference between probability and likelihood functions, and
find the maximum likelihood estimate for a model parameter
3 To Understand the law of large numbers and the central limit theorem.
Unit-I
Basic concepts of one-dimensional random variable(No questions), Two-dimensional RV 2d-
joint P.M.F, Marginal Prob.Functions,Conditional Prob. Function, two dimensional
distribution function, Marginal function, joint density function, Marginal density function,
conditional distribution function and conditional probability density function, transformation
of 2-d random variable, distribution of difference ,product, quotient of two R.V, moments of
bivariate probability distribution, conditional expectation and conditional variance for
discrete and continuous case, stochastic independence.
Unit-II
Multiple and correlation, plane of regression, properties of residuals, coefficient of multiple
correlation,coeff of partial correlation ,curvilinear regression, polynomial fit of non-linear
regression, fitting of power curves and fitting of exponential curves, autocorrelation
Random process: Mean and auto covariance function,iid sequences, Gaussian process,
Poisson process, random walk.
Unit-III
Bayesian statistics inference: Baye’s rule in statistics, difference between likelihood and
probability, prior distribution ,posterior distribution, conjugate prior, characteristics of
estimators, Methods of estimation, method of maximum likelihood estimation, method of
minimum variance, method of moments, method of least square. Markov chains, weak law of
large numbers and centeral limit theorem,credible intervals for parameter estimate
Books; Probability and Statistics for Scientists and Engineers by Rao V Dukkipati ,
Statistics for Data Science by James D. Miller,
A Student’s Guide to Bayesian Statistics by Ben Lambert
Statistical Methods Paperback – 2012 by S. P. Gupta (Author)
Scheme Name of Course: Python and its applications in L T P S C

Version: Artificial Intelligence
2019 Apply to Programs: CSE Artificial Intelligence 3 0 0 0 3
and Machine Learning
Total Marks: 100
Course Pre-requisite: Knowledge of basic computing Total hours = 45
Code languages like C++
 To explain the importance of Python and describe its need as a

programming language.
 To strengthen the understanding of basic concepts of Python.
 Be able to design, code, and test small Python programs.
Course Outcomes
1 To identify and use various in-built functions, operators and statements
supported by python.
2 To Have knowledge of basic searching and sorting algorithms.
3 Understand the concepts of object-oriented programming as used in Python:
classes, subclasses, properties, inheritance, and overriding.
Unit-I
Introduction to Python Programming: History of Python, Installing Python, Executing

Python Programs, Internal Working of Python, Python Implementations.
Basics of Python Programming: Python Character Set, Token, Python Core Data Type,
print() function, Assigning Value to Variable, input() function, eval() function, Formatting
Number and Strings, Operators and Expressions.
Decision Statements: Boolean Type, Boolean Operators, Using Number and Strings with
Boolean Operators, Decision Making Statements and Conditional Expressions
Loop Control Statements: While loop, range() Function, For Loop, Nested Loops, Break
Statement, Continue Statement.
Functions: Syntax and Basics of a Function, Use of a function, Parameters and Arguments,
Local and Global Scope Scope of a Variable, return statement and Recursive Functions.
Introduction to Numpy package
Introduction to Pandas
Unit-II
Strings: str class, Inbuilt functions for String, index[] operator, traversal of String, String
operators, String Operations.
Lists and Dictionaries: Creating Lists, Basic list operators, Slicing, Inbuilt functions for
Lists, List operator, List Methods, Splitting, Need of Dictionary, Creating a Dictionary ,
Adding and Replacing Values, Retrieving Values ; Deleting Items and Traversing
Dictionaries.
Tuples and Sets: Creating Tuples; Tuple () Function, Inbuilt Functions for Tuples, Indexing
and Slicing; Operations on Tuples; Traverse Tuples from a List, Set operators; Set class.
Searching and Sorting: Sequential Search, Binary Search, Bubble Sort, Selection Sort,
Insertion Sort, Quick Sort and Merge Sort.
Object-Oriented Programming: Classes and objects, methods, Operator Overloading,
Inheritance, super () and Method Overriding.
File Handling: Need of File Handling, Reading/Writing Text and Numbers to/from a File;
Directories on a disk.
Introduction to Data Visualisation using Matplotlib and Seaborn. Dynamic Visualisation
using Plotly
Unit-III
Introduction to sklearn
Introduction to tensorflow
Text Books:
1. Ashok Namdev Kamthane, Programming and Problem Solving with Python, Mc
Graw Hill Education Publication, ISBN(13):978-93-87067-57-8.
Reference Books:
1. Allen B. Downey, Think Python, O’Reilly Media
Kenneth A. Lambert, The Fundamentals of Python: First Programs, 2011, Cengage Learning
Scheme Name of Course: System Programming Lab L T P S C

Version: th
Apply to Programs: Common to all specialisations(4 0 0 2 0 1
2019
sem)
Total Marks: 100
Course Pre-requisite: Microprocessor and Operating system Total hours =22
Code
CSP-252
Course Objective
 Design, write, and test moderately complicated low-level programs
using a systems programming language.
 Proficiently use a preprocessor to implement code that is portable
between different computing platforms.
 Implement routines that read and write structured binary fies such as
word processing documents, index systems, or serialized hierarchical
data
Course Outcomes
1 To understand the execution process of HLL programs. and understand the
working of scanners and parsers
2 To understand the basic design of various system software.
3 To implement various system software.
List of Programs
1. Write a program to implement the Lexical Analyzer.
2. WAP using LEX to count the number of characters, words, spaces and lines in a given input file.
3. WAP using LEX to count the numbers of comment lines in a given C program.
4. WAP using LEX to recognize a valid arithmetic expression and to recognize the identifiers and
operators present. Print them separately.
5. WAP using LEX to recognize and count the number of identifiers in a given input file.
6. WAP using YACC to recognize a valid arithmetic expression that uses operators +, –, * and /.
7. WAP using YACC to recognize a valid variable, which starts with a letter, followed by any
number of letters or digits.
8. Use Macro feature of C language
9. Write a SAL program in test file and genertate SYMTAB and LITTAB
10. Socket Programming
Scheme Name of Course: Microprocessors & L T P S C

Version: Interfacing Lab
Total Marks: 100
Course Pre-requisite: Basic Knowledge of computer Total hours =45
Code hardware
 To get familiarization with 8085 kit and simulator.
To implement basic programs using 8085 kit/simulator..

Course Outcomes
1 Learn how the hardware and software components of a microprocessor-based
system work together to implement system-level features
2 Learn both hardware and software aspects of integrating digital devices (such as
memory and I/O interfaces) into microprocessor-based systems
3 Learn the operating principles of, and gain hands-on experience with, common
microprocessor peripherals such as UARTs, timers, and analog-to-digital and
digital-to-analog converters
UNIT-I
1. To study 8085-microprocessor trainer kit.
2. Addition of two 8-bit numbers; sum 8 bits
3. Addition of two 16 bit number; sum 16- bits.
4. Subtraction of two 8-bit numbers; result 8 bits.
5. Subtraction of two-16 bit numbers; sum 16 bits.
UNIT-II
6. Find one’s complement of an 8-bit number.

7. Find one’s complement of a 16-bit number.
8. Find two’s complement of a 8-bit number.
9. Find two’s complement of a 16- bit number.
10. Shift an 8 -bit number to left by 1- bit.
11. Shift an 8-bit number to left by 2-bits.
12. Shift a 16 -bit number to left by 1- bit.
13. Shift a 16-bit number to left by 2- bits.
UNIT-III
14. Mask of least significant 4 bits of an 8-bit number.

15. Mask of most significant 4 bits of an 8-bit number.
16. Find the smaller out of two numbers.
17. Find the smaller number in a data array
18. Find the larger out of two numbers.
19. Find the largest number from data array.
Scheme Name of Course: Python and its Applications L T P S C
Version: in AI Lab
2019 Apply to Programs: CSE - Artificial Intelligence 0 0 2 0 1
and Machine Learning
Total Marks: 100
Course Pre-requisite: Basic knowledge of C++ Total hours = 30
Code
Course Outcomes
2 To have knowledge of basic searching and sorting algorithms.
1. Implement different types of operators available in python.

2. Implement the concept of lists, tuples and dictionary available in python.
3. Programs to implement Object Oriented Programming concepts:
a. Define class and methods
b. Constructors
c. Inheritance in Python
d. Multilevel inheritance in Python
e. Multiple inheritance in Python / use of super keyword
f. Operator overloading
g. Method overriding
4. Programs to implement Searching and Sorting operations:
a. Sequential search
b. Binary search
c. Bubble sort
d. Selection sort
e. Insertion sort
f. Quick sort
g. Merge sort
5. Import any dataset using Pandas and visualize it using matplotlib.

6. Implement any regression model using sklearn.
7. Implement any classification model using sklearn.
8. Implement any clustering technique using sklearn.
9. Build an artificial neural network using tensor flow for regression problem.
10. Build an artificial neural network using tensor flow for classification problem.
1. Create a web application showing the Servlet HttpSession login and logout
example.
2. Create an application to add your own cookie and display all cookies on the web
page.
3. Write a JSP to output the entire line, "Hello! Today is current date of
system”usingjava.util.Date class.
4. Write a simple JSP to print Hello message concatenated with the name entered in
a textfield by user.
Scheme Name of Course: Project based java Lab L T P S C
2019 specialization of CSE 2nd year
Total Marks: 100
Course Pre-requisite: Basic knowledge of C++ Total hours = 30
Code
Course Outcomes
2 To have knowledge of basic searching and sorting algorithms.
Table of Contents
Sr. Name of the Experiments Pag

No e
. No
1. Create an application to save the employee information using arrays having 1
following fields:-
empid[],depName[],empDes,empName[],dateJoin[],basic[
],hra[],it[], DesCodes[].
Solve following programs:-
a. Salary should be calculated as (Basic+HRA+DA-IT)
b. Printing designation and da according to employee designation
2. Design and implement a simple inventory control system for a small video
rental store. 4
3. Create an application to calculate interest for FDs, RDs based on certain

conditions using inheritance. 11
4. (a) Create a program to set view of Keys from Java Hashtable.
(b) Create a program to show the usage of Sets of Collection interface.
(c) Write a Program to perform the basic operations like insert, delete, display 16
and search in list. List contains String object items where these operations are
to be performed
5. Create a palindrome creator application for making a longest possible

palindrome out of given input string. 21
6. Create a menu based Java application with the following options.1.Add an

Employee2.Display All3.Exit If option 1 is selected, the application should
gather details of the employee like employee name, employee id, designation
and salary and store it in a file. If option 2 is selected, the application should
display all the employee details. If option 3 is selected the application should
exit.
REMARKS - Use agile methodology by dividing tasks into team of 3 24

students. DFD’s should be drawn and club at the end. The methodology will
continue in Experiment 7(b).
(a) Create a program for Unit testing of addition and multiplication.
(b) Continue
7. to Agile Methodology by apply unit test on Employee id, name and salary.
31
Write a8.Java multi threaded program to implement the tortoise and hare story. Make the hare 37
sleep at the mid of the way and let the tortoise win.
9. (a)Create a Servlet/ application with a facility to print any message on web
browser.
39
(b)Create JSP application for addition, multiplication and division.
10. Create database connectivity with Oracle using Java to retrieve employee-id,
name and designation. 43
CHANDIGARH UNIVERSITY, GHARUAN
Scheme Name of Course: Data Mining and L T P S C

Version: Warehousing
2019 Apply to Programs CSE (AIML) 5TH SEM 4 0 0 0 4
Total Marks: 100

Course Pre-requisite: Data Base Management System Total hours =45
Code Hours
:CST-319 Course Objective
• This course brings together several key to obtain knowledge about

requirement of Data Mining in Big Data Analytics.
• To recognize the key concepts of Generalization, Concept Hierarchy,
and Association Rules.
 This part is to learn about classification Techniques.
Course Outcomes
1 To develop the basic concepts that justifies the use of Data Mining
2 To learn different aspects of mining data from chunk of huge raw data.
3 To learn classification and regression Techniques.
UNIT I
Overview, Motivation (for Data Mining), Data Mining-Definition & Functionalities, Data
Processing, Form of Data Preprocessing, Data Cleaning: Missing Values, Noisy Data,
(Binning, Clustering, Regression, Computer and Human inspection), Inconsistent Data, Data
Integration and Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality
reduction, Data Compression, Numerosity Reduction, Clustering, Discretization and Concept
hierarchy generation.
UNIT II
Concept Description: Definition, Data Generalization, Analytical Characterization, Analysis
of attribute relevance, Mining Class comparisons, Statistical measures in large Databases.
Measuring Central Tendency, Measuring Dispersion of Data, Graph Displays of Basic
Statistical class Description, Mining Association Rules in Large Databases, Association rule
mining, mining Single-Dimensional Boolean Association rules from Transactional
Databases– Apriori Algorithm, Mining Multilevel Association rules from Transaction
Databases and Mining Multi- Dimensional Association rules from Relational Databases.
UNIT III
What is Classification & Prediction, Issues regarding Classification and prediction, Decision
tree, Bayesian Classification, Classification by Back propagation, Multilayer feed-forward
Neural Network, Back propagation Algorithm, Classification methods K-nearest neighbor
classifiers, Genetic Algorithm. Cluster Analysis: Data types in cluster analysis, Categories of
clustering methods, Partitioning methods. Hierarchical Clustering- CURE and Chameleon.
Density Based Methods-DBSCAN, OPTICS. Grid Based Methods- STING, CLIQUE. Model
Based Method –Statistical Approach, Neural Network approach, Outlier Analysis
Scheme Name of Course: Design & Analysis of L T P S C
Version: Algorithms
Specializations of CSE 5th sem
Total Marks: 100
Course Pre-requisite: Knowledge of Organizational Total hours =56
Code Behavior
 To understand meaning and characteristics of algorithms
 To study different algorithm design techniques.
 To implement different algorithm design techniques for solving
engineering and related problems.
Course Outcomes
1 Design algorithms for various computing problems and analyze the time-space
complexity of algorithms.
2 Critically analyze the different algorithm design techniques for a given
problem.
3 Modify existing algorithms to improve efficiency.
UNIT-I [15h]
Algorithm and its characteristics: - Algorithms and its characteristics, Growth of functions: asymptotic
notations, Analyzing and design of algorithms, Performance analysis and measurement of algorithms,
Time and space complexity.
Elementary Data Strictures: - Stacks, Queues, Trees, Graphs, Sets and Disjoint Set, Union.
Divide and Conquer: - General method, Binary Search, Merge sort, Quick sort, Finding
maximum and minimum.
UNIT-II [15h]
Greedy Algorithms: - General method, Elements of greedy strategy, An Activity Selection
Problem, Knapsack problem. Huffman codes, Minimum cost spanning trees.
Dynamic Programming:- General method, Elements of dynamic programming, Matrix-

chain multiplication problem, Longest common Subsequence Problem, Multistage Graph, 0/1
Knapsack, Travelling salesperson problem (TSP).
Back Tracking: - General method, 8 queen's
NP Hard and NP Complete Problems: - Basic concepts, The classes P and NP, NP Hard
and NP Complete problems, NP-completeness & reducibility.
UNIT-III [15h]
Elementary Graph Algorithms: - Basic terminology, Representation of Graphs, Depth First
Search, Breath First search, topological sort, Single source shortest path: Bellman- Ford
algorithm, Dijkstra’s Algorithm, All Pair shortest paths: Floyd Warshall algorithm.
Branch and Bound: - Branch and Bound method, 0/1 Knapsack problem, Travelling
salesperson problem.
Text Books:
1. Cormen, Leiserson, Rivest, Stein, “Introduction to Algorithms”, Prentice Hall of India, 3rd
edition 2012. problem, Graph coloring.
2. Horowitz, Sahni and Rajasekaran, “Fundamentals of Computer Algorithms”, University
Press (India), 2nd edition.
Reference Books:
1. Tanenbaum, Augenstein, &Langsam, “Data Structures using C and C++”, Prentice Hall
of India.
2. Brassard, Bratley, “Fundamentals of Algorithms”, Prentice Hall of India.
3. Knuth “The Art of Computer Programming, Volume 1: Fundamental Algorithms” (Addison-Wesley,
Third Edition).
4. Lipschutz, S., “Data Structures, Schaum's Outline Series”, Tata McGraw Hill.
5. Kruse, “Data Structures & Program Design”, Prentice Hall of India.
6. Aho, Haperoft and Ullman, ”The Design and analysis of Computer Algorithms”, Pearson
Education India.
Scheme Name of Course: Computer Networks L T P S C

Version:
specialization of CSE 5th sem
Total Marks: 100
Course Pre-requisite: Basic of Networking Total hours =45
Code Hours
:CST-309 Course Objective
• This course brings together several key of Computer network design and
architecture
• To recognize the key concepts of Internetworking
 To prepare a sample Network via Simulation.
Course Outcomes
1 To develop the understanding of basic networking concepts
2 To implement the functionality of different Algorithm and Protocols
3 To learn about different connection establishments techniques.

UNIT 1
Network layer-design issue, routing algorithms: Distance vector, link state, hierarchical,
Broadcast routing. Congestion control: congestion prevention policies, congestion control in
Datagram subnets, load shedding, jitter control, Leaky bucket and token bucket algorithms.
UNIT 2
Internetworking: Differences in networks, Tunneling, Internetwork routing, Fragmentation
Network layer in the Internet: IPv4 classful and classless addressing, subnetting Network
layer protocols (only working and purpose, packet headers etc. not included), Differences in
IPV6 over IPV4. Routing to Mobile Hosts and Mobile IP.
UNIT 3
Elements of transport protocols: addressing, connection establishment and release, flow
control and buffering, multiplexing and demultiplexing, crash recovery, introduction to UDP
protocol. Principles of Reliable Data Transfer: Reliable data transfer over a perfectly reliable
channel, Channel with bit errors and Lossy Channel with bit errors. Transport Layer in the
Internet: Introduction to TCP, TCP service Model, TCP Header and segment structure, TCP
connection establishment and release, transmission policy, timer management, Transactional
TCP. Mobile TCP, TCP Congestion Control: Fairness, TCP delay modeling.
Scheme Name of Course: Digital Image Processing L T P S C

Version:
specialization of CSE 5th sem
Total Marks: 100
Course Pre-requisite: Basics of Computer Graphics Total hours =45
Code Hours
:CST 310 Course Objective
• This course brings up knowledge about Image Processing

• To recognize the key concepts of NOISE in Image Processing
 To implement different Image Processing Algorithms.
Course Outcomes
1 To develop the better platform for understanding importance of image processing
2 To apply the concepts learnt as basics
3 To implement the technical aspects of Image processing for better results.
UNIT I
Introduction to Image Processing: Digital Image representation, Sampling & Quantization,
Steps in image Processing, Image acquisition, color image Representation, Image
Transformation & Filtering: Intensity transform functions, histogram processing, Spatial
filtering, Fourier transforms and its properties, frequency domain filters, colour models,
Pseudo coloring, color transforms, Basics of Wavelet Transforms
UNIT II
Image Restoration: Image degradation and restoration process, Noise Models, Noise Filters,
degradation function, Inverse Filtering, Homomorphism Filtering, Image Compression:
Coding redundancy, Interpixel redundancy, Psychovisual redundancy, Huffman Coding,
Arithmetic coding, Lossy compression techniques, JPEG Compression
UNIT III
Image Segmentation & Representation: Point, Line and Edge Detection, Thresholding, Edge
and Boundary linking, Hough transforms, Region Based Segmentation, Boundary
representation, Boundary Descriptors, Regional
Scheme Name of Course: Soft Computing L T P S C
Version: Apply to Programs: CSE(H) Artificial 3 0 0 0 3
2019 Intelligence and Machine Learning 5TH SEM
Total Marks: 100
Course Pre-requisite: Knowledge of Probability and Total hours = 45
Code Statistics
To develop the skills to gain a basic understanding of fuzzy logic theory
and genetic algorithms
Course Outcomes
1 Comprehend the fuzzy logic and the concept of fuzziness involved in
various systems and fuzzy set theory.
2 Understand the concepts of fuzzy sets, knowledge representation using
fuzzy rules, approximate reasoning, fuzzy inference systems, and fuzzy
logic
3 Reveal different applications of these models to solve engineering and other
problems.
Unit-I
Fuzzy Logic - Introduction – crisp sets- fuzzy sets – crisp relations and fuzzy relations:
cartesian product of relation – classical relation, fuzzy relations, Membership functions:
features, fuzzification, methods of membership value assignments-Defuzzification: lambda
cuts – methods – fuzzy arithmetic and fuzzy measures: fuzzy arithmetic – extension principle
– fuzzy measures – measures of fuzziness -fuzzy integrals – fuzzy rule base and approximate
reasoning : truth values and tables, fuzzy propositions, formation of rules-decomposition of
rules, aggregation of fuzzy rules, fuzzy reasoning-fuzzy inference systems-overview of fuzzy
expert system-fuzzy decision making.
Unit-II
Genetic Algorithm - Genetic algorithm and search space – general genetic algorithm –
operators – Generational cycle – stopping condition – constraints – classification – genetic
programming – multilevel optimization – real life problem- advances in GA
Unit-III
Hybrid soft computing techniques - Neuro-fuzzy hybrid systems – genetic neuro hybrid
systems – genetic fuzzy hybrid and fuzzy genetic hybrid systems – simplified fuzzy
ARTMAP – Applications: A fusion approach of multispectral images with SAR, optimization
of traveling salesman problem using genetic algorithm approach, soft computing based
hybrid fuzzy controllers.
Text Books –
1. Timothy J. Ross, “Fuzzy Logic with Engineering Applications”.
2. S.N.Sivanandam, S.N Deepa, “Principles of Soft Computing”
Reference Books –
1. Bart Kosko, “Neural Network and Fuzzy Systems: A Dynamic System Approach to
Machine” Prentice-Hall 1998
2. L. Fausett, “Fundamentals of Neural Networks: Architectures, Algorithms, and
Applications”, Prentice-Hall, 1994
3. Jack M. Zurada, “Introduction to Artificial Neural Systems”, PWS Publishing Co.,
Boston, 2002
Scheme Name of Course: Computer Network Lab L T P S C
2019 specialisations 3rd Year
Total Marks: 100
Course Pre-requisite: Network Basics Total hours =56
Code
 To understand Computer Hardware and networking.
 To work with cables.
 To configure networks..
Course Outcomes
1 Understand the structure and organization of computer networks; including the
division into network layers
2 Understand the basic concepts of application layer protocol design; including
client/server models
3 Understand the basic concepts of link layer properties; including error-detection
and correction techniques
List of Experiments
UNIT I
1. Familiarization with Computer Hardware & write specifications of latest desktops and
laptops.
2. Installation Process of various operating systems.
3. Study of LAN Components.
UNIT-II
4. Preparing straight and cross cables.
5.Familiarization with transmission media viz. coaxial cable, twisted pairs, optical fibre
networking, wireless networking, connectors etc.
6. Creation of different topologies.
UNIT III
7. Sharing of resources with two connected nodes.
8. Configuration of TCP/IP Protocols.

9. Network troubleshooting.
Scheme Name of Course: Design and Analysis of L T P S C
Version: Algorithms Lab
2018 Apply to Programs: Apply to Program: BE 0 0 2 0 1
CSE 3rd Year
Total Marks: 100
Course Pre-requisite: Studied C/C++ in previous semesters Total hours =56
Code
 To implement problems based on different algorithm design techniques.

 To implement algorithms based on graphs.
 To implement algorithms based on trees
Course Outcomes
1 Possess the knowledge of various existing algorithms
2 Analyze and compare the efficiency of algorithms
3 Possess the ability to design efficient algorithms for solving computing
problems
List of Experiments
UNIT-I
1. Code and analyze to compute the greatest common divisor (GCD) of two numbers.
2. Code and analyze to find the median element in an array of integers.
3. Code and analyze to find the majority element in an array of integers.
4. Code and analyze to sort an array of integers using Heap sort.
5. Code and analyze to sort an array of integers using Merge sort.
6. Code and analyze to sort an array of integers using Quick sort.
UNIT-II
7. To implement maximum and minimum problem using divide and conquer strategy.
8. To implement binary search using divide and conquer strategy.
9. Code and analyze to find an optimal solution to matrix chain multiplication using
dynamic programming.
10. Code and analyze to do a depth-first search (DFS) on an undirected graph.
Implementing an application of DFS such as (i) to find the topological sort of a
directed acyclic graph, OR (ii) to find a path from source to goal in a maze.
11. Code and analyze to do a breadth-first search (BFS) on an undirected graph.
Implementing an application of BFS such as (i) to find connected components of an
undirected graph, OR (ii) to check whether a given graph is bipartite.
12. Code and analyze to find shortest paths in a graph with positive edge weights using
Dijkstra’s algorithm.
13. Code and analyze to find shortest paths in a graph with arbitrary edge weights using
Bellman-Ford algorithm.
UNIT-III
14. To be able to compare the practical performance of different algorithms for the same
problem. Code and analyze to find the minimum spanning tree in a weighted,
undirected graph.
15. Code and analyze to find all occurrences of a pattern P in a given string S.
16. To implement Prim’s algorithm for minimum spanning tree.
17. To implement Kruskal’s algorithm for minimum spanning tree.
18. To implement LCS Problem using Dynamic Programming.
19. To implement matrix chain multiplication problem using Dynamic Programming.
Scheme Name of Course: Soft Computing Lab L T P S C
2019 Intelligence and Machine Learning
Total Marks: 100
Code Statistics
To develop the skills to gain a basic understanding of fuzzy logic theory
and genetic algorithms
Course Outcomes
1 Comprehend the fuzzy logic and the concept of fuzziness involved in
various systems and fuzzy set theory.
2 Understand the concepts of fuzzy sets, knowledge representation using
fuzzy rules, approximate reasoning, fuzzy inference systems, and fuzzy
logic
3 Reveal different applications of these models to solve engineering and other
problems.
1. To perform Union, Intersection and Complement operations

2. To implement De-Morgan’s Law
3. To plot various membership functions
4. To implement FIS Editor.
5. To implement Genetic Algorithm
6. To implement Neuro-fuzzy hybrid systems
7. To implement genetic neuro hybrid systems
8. To implement genetic fuzzy hybrid systems
9. To implement optimization of traveling salesman problem using genetic algorithm
approach
10. To implement backpropagation algorithm
Scheme Name of Course: Digital Image Processing Lab L T P S C
2019 specialization of CSE 3rd Year
Total Marks: 100
Course Pre-requisite: Knowledge of basic Mathematics Total hours = 30
Code
 This course brings up knowledge about Image Processing
 To recognize the key concepts of NOISE in Image Processing
 To implement different Image Processing Algorithms.
Course Outcomes
1 To develop the better platform for understanding importance of image
processing
2 To apply the concepts learnt as basics
3 To implement the technical aspects of Image processing for better results.
List of Experiments:
1. Color image segmentation algorithm development
2. Wavelet/vector quantization compression
3. Deformable templates applied to skin tumor border finding
4. Helicopter image enhancement
5. High-speed film image enhancement
6. Computer vision for skin tumor image evaluation
7. New Border Images
8. Applying Huffman Code
9. Write a Program to compress a JPEG.
10. Write a program Point, Line and Edge Detection
Scheme Name of Course: Theory of Computation L T P S C
Version: Apply to Programs : Common to all
2019 Specializations of CSE 3RD Year
Total Marks: 100
Course Pre-requisite: Knowledge of System programs Total hours =
Code 45Hours
 To understand the concept of formal languages and their relation with
finite automata and to study and design different finite automata.
 To study context free grammars and ambiguity related issues
 To gain familiarization with Push- Down Automata and Turing
Machines and to explore relationship between different classes of formal
languages.
Course Outcomes
1 Classify machines by their power to recognize languages, Explain deterministic and non-
deterministic machines
2 Employ finite state machines to solve problems in computing
3 Comprehend the hierarchy of problems arising in the computer sciences
UNIT –I [15h]

Introduction: Basic Terminology: Alphabet, Formal Language and operations on formal
languages, Examples of formal languages.
Finite automata : Concept of Basic Machines, Properties and Limitations of Finite State
Machines, Deterministic Finite Automata(DFA), Non-Deterministic Finite Automata(NFA),
Equivalence of DFA and NDFA , Non-Deterministic Finite automata with Λ-Transitions.
Regular expression: Regular Languages and Regular Expressions, Kleen’s Theorem.
Arden’s Method.

UNIT –II [15h]
Properties of Regular sets: The Pumping Lemma for Regular sets, Application of the
Pumping Lemma, Closure Properties of Regular Sets, Myhill- Nerode Theorem and
Minimization of Finite Automata, Minimization Algorithm.
Finite Automata with output: Moore and Mealy Machines. Equivalence of Moore and
Mealy Machines.
Context Free Grammars: Examples and Definitions, Derivation trees and ambiguity, An
Unambiguous CFG for Algebraic Expressions. Regular Grammar, Simplified forms and
Normal forms: Removal of useless symbols and unit production, Removal of Λ-moves,
Chomsky Normal Form (CNF), Griebach Normal Form (GNF).

UNIT –III [15h]
Pushdown Automata: Introduction and Definition of Push-Down Automaton, Applications
of Push Down Automata.
Turing Machines: Definitions and Examples, Deterministic and Non- Deterministic Turing
Machines, Unsolvable Problems: A Non-recursive Language and an Unsolvable Problem,
PCP Problem and MPCP Problem.
More General Languages and Grammars: Recursively Enumerable and Recursive
Languages, Unrestricted grammars, Context sensitive Language and grammar, Relation
between languages of classes, Chomsky hierarchies of grammars.
Text Books:
1. Martin J.C., “Introduction to Languages and Theory of Computation”, Tata McGraw-
Hill Publising Company Limited, 3 Edition. rd
2. Hopcroft J.E. and Ullman J.D., “Introduction to Automata Theory Languages and
Computation”, Narosa Publications.
Reference Books:
1. Sipser,” Theory Of Computation, Cengage Learning.
2. Daniel I.A. Cohen, “Introduction to computer Theory”, John Wiley.
Scheme Name of Course: Network Operating System L T P S C

Version: Apply to Programs : Common to all
Total Marks: 100
Course Pre-requisite: Basic Understanding of Subject Total hours =
Code Computer Networks 45Hours
1. To understand the concept of Operating System specifically designed for
supporting Communication Networks.
2. To study about backend Networks
3. To learn the functionality of Microsoft Servers and their Applications like
DNS Server and Active Directory.
Course Outcomes
1 Prepare a platform for student on which he can build thoughts for advanced CN
Topics.
2 Enable student to learn major protocols for authentic communication.
3 Learning of Windows Server System administration. Specifically focusing on
Active Directory.
UNIT –I
Introduction of Computer Networks: Reference Model: OSI Reference Model, TCP/IP
reference model, Core protocols of TCP/IP, IP routing, IP routers, Routing Tables.
Introduction to DNS: DNS Architecture, Understanding the DNS Domain Namespace, DNS
domain name hierarchy, DNS and Internet domains, DNS delegation
Introduction to DHCP: Introduction to DHCP,DHCP Architecture, Benefits to DHCP,DHCP
Terminologies and DHCP Server Responsibility.
Introduction to RPC: Introduction to RPC,RPC Dependencies and Interaction, RPC
Architecture, RPC Component and RPC Processes and Interaction.
Introduction to Microsoft Network Monitoring Tool: Introduction to netmon tool, Installation
and configuration of Netmon.
Unit-II
Introduction to operating System: Introduction to operating system, Types of operating
System: Mainframe, Desktop, Multiprocessor, Distributed, Clustered, Multiprogramming,
Real time, Embedded and Time Sharing
Operating System Components: Process Management Component, Memory Management
component, i/o Management component, File Management component, Protection System,
and Networking management component.
Comparison of Microsoft OS(Desktop, Server and Client),Hardware Requirement for
OS(Desktop, Server and client ),Workgroups and Domains.
Installing windows server 2008:Plan for a server roles and installing windows server core,
configure server core, Add and configure server roles, add backup feature and migrate roles
from previous versions of windows server.
Configuring Windows Server 2008:Windows server registry, Control Panel, Delegate
administration, Add and removes feature in window server, intial configuration taskes, server
manager console, server manager wizards and windows power shell.
Unit-III
Hyper-V: Introducing Hyper-V, Virtual Machines
Introducing to Active Directory: role of an AD DS Server, features in AD DS, Common
Terminologies and Active Directory Concepts, Active Directory Schema, Active Directory
Objects, Active Directory Concepts, Active Directory Data structure and storage architecture,
Active Directory Structure and storage components, DNS support for active directory, active
directory DNS support components
Install Active Directory Domains Services in Windows 2008 R2: Installing a new forest by
using the graphical user interface (GUI), Understanding active directory domain. Servicex
functional Levels.
Active Directory Administration: Active Directory Users and Computers. Managing
organizational units using Active Directory Users and Computers, Managing Trusts using
Active directory domains and trusts and managing forest trusts using active directory
domains and trusts snap-in.
Scheme Name of Course: Computer Vision L T P S C

Total Marks: 100
Course Pre-requisite: Knowledge of Digital Image Total hours = 45
Code Processing
The purpose is to have extensive understanding of computer vision theory
and applications
Course Outcomes
1 Understand the major concepts and techniques in computer vision and
image processing.
2 Demonstrate computer vision and image processing knowledge by
designing and implementing algorithms to solve practical problems.
3 Prepare for research in computer vision and image processing
Unit-I
Introduction to Computer Vision, Geometry of Image Formation, Two View Geometry,

Planar Scenes and Homography, Line detection, Edge Detection
Unit-II
Image Filtering, Hough Transform, 2D Transformations, Camera Calibration, Calibrated 3D

Reconstruction, Stereo Rectification, Images as Vectors,
Unit-III
Face Detection, Image Segmentation, Feature Tracking & Motion Layers, Deep Learning
Applications
Text Books –
1. Computer Vision - A modern approach, by D. Forsyth and J. Ponce, Prentice Hall
Robot Vision, by B. K. P. Horn, McGraw-Hill.
Reference Books –
1. Richard Szeliksy “Computer Vision: Algorithms and Applications”
Scheme Name of Course: Natural Language Processing L T P S C

Total Marks: 100
Course Pre-requisite: Knowledge of basic machine learning Total hours = 45
Code techniques
This course is an introduction to the fundamental concepts and techniques
of natural language processing (NLP).
Course Outcomes
1 Indepth understanding of the computational properties of natural
languages and the commonly used algorithms for processing linguistic
information
2 The course examines NLP models and algorithms using both the
traditional symbolic and the more recent statistical approaches
Unit-I
Introduction: Knowedge in speech and language processing, Ambiguity, Models and

Algorithms, Brief History. Regular Expressions and Automata, Morphology and Transducers:
Inflectional and derivatioal morphology, finite state morphological parsing, Combining FST
Lexicon and rules. Lexicon free FST: Porter Stemmer
N-grams: Counting Words in Corpora, Simple Unsmoothed n-grams, Smoothing, Entropy
HMM and Speech Recognition: Speech Recognition Architecture, Overview of HMM, A*
decoding
Unit-II
World Classes and Part-of-Speech Tagging: English word classes, Targets for English,
Part of Speech tagging, Rule based part of speech Tagging, Transformation based tagging.
Context Free Grammars for English: Constituency, Context Free rules and Trees, Sentence
level construction, The Noun Phrase, Coordination, Agreement, The verb phrase and sub
categorization. Spoken Language Syntax, Grammar Equivalance and Normal form, Finite
state context free grammars, Grammar and human processing.
Parsing with context free grammars: Parsing as Search, basic Top Down Parser, Problems
with basic top-down-parsers, the early Algorithm, Finite state parsing method
Features and Unifications: Feature Structures, Unification of Features Structures, Features
Structures in the grammar, Implementing Unification.
Lexicalized and probabilistic parsing: Probabilistic context free grammars, problems with
probabilistic context free grammars
Unit-III
Semantics: (Representing Meaning): Computational Desiderata for representation,

Meaning structure of language, First order predicate calculus, linguistically relevant concept,
Related Representational approaches, Alternative approaches to meaning.
Semantic Analysis: Syntax driven semantic analysis, Attachment of Fragment of English,
Robust Semantic Analysis
Lexical Semantics: Relation among lexemes and their senses, Internal Structure of words
Text Books –
1. Speech and Language processing An introduction to Natural Language Processing,
Computational Linguistics and speech Recognition by Daniel Jurafsky and James H. Martin
2. Natural Language Processing with Python by Steven Bird, Ewan Klein, Edward
Lopper
Reference Books –
1. Handbook of Natural Language Processing, Second Edition—NitinIndurkhya, Fred J.
Damerau, Fred J. Damerau
Scheme Name of Course: Web Technology L T P S C

Version:
Apply to Programs: Common to All Branches (3 3 0 0 0 3
2019
Year)
Total Marks: 100
Course Pre-requisite: Fundamentals of Computer Total hours =45
Code:
CST-***
Course Objective
 The course will focus on HTML, CSS, JavaScript.
 The course will focus on jQuery, libraries and different frameworks for
frontend development.
 The course will focus on Serverside Scripting languages, hosting of
webpages and concepts of digital marketing.
Course Outcomes
Students are able to develop a webpage by the use of HTML, CSS and
1
JavaScript.
Students are able to use different libraries and frameworks used in frontend
2
development.
Students are able to implement Serverside Scripting languages and learn to host
3
the website and apply the concepts of digital marketing.
UNIT –I [15h]
Chapter 1: Introduction to HTML 5, The Anatomy of an HTML Tag, How to Structure Text
in HTML, HTML Lists, HTML Image Elements, HTML Links and Anchor Tags, HTML
Tables, How to Type Emojis, HTML Forms
Chapter 2: Introduction to HTML Editors, Code Styling, Dev Servers Environment (like
WAMP, etc.)
Chapter 3: Introduction to CSS3, Inline CSS, Internal CSS, External CSS, Classes & IDs,
CSS Selectors, Debug CSS Code, HTML Divs, Box Model, CSS Float & Clear, Media
Queries, CSS Grid, CSS Responsive
Chapter 4: Introduction to JavaScript, JavaScript Variable, Array Methods, For, While and
Do While LOOP, Conditional Statements, Define & Call Functions, Cookies, JavaScript
DOM, OOJS, Internal & External JS, Validating Form Data, JS Versions, JS JSON, JS vs
jQuery
UNIT –II [15h]

Chapter 1: Introduction to jQuery, Basics of jQuery, jQuery Selectors, jQuery Events, jQuery
Effects, jQuery HTML/CSS, jQuery Traversing, jQuery AJAX, jQuery JSON, jQuery
noConflict(), jQuery Filters
Chapter 2: Frontend Development & Backend Development, What are the Libraries?, What
are the Frameworks?, Key Difference between Libraries and Frameworks, Top 5 Frontend
Frameworks & Backend Frameworks, Introduction to Full Stack Developers and other Stack
Developers
Chapter 3: Bootstrap 4: Introduction, Containers, Grid System, Typography, Color, Tables,

Images, Jumbotron, Alerts, Buttons, Badges, Progress Bars, Spinners, Paginations, List
Groups, Cards, Dropdowns, Collapse, Navs, Navbar, Forms, Inputs, Input Groups, Custom
Forms, Carousel, Modal, Tooltip, Popover, Toast, Scrollspy, Utilities, Flex, Media Objects,
Filters
Chapter 4: AngularJS: Introduction, Expressions, Modules, Directives, Model, Data Binding,

Controllers, Scopes, Filters, Services, HTTP, Tables, Select, SQL, DOM, Events, Forms,
Validation, API, Includes, Animations, Routing, Application; Angular JS vs Angular 2 vs
Angular 4
UNIT –III [15 h]

Chapter 1: Backend Programming; PHP: Introduction to PHP, Basic PHP, PHP Forms, PHP
Include, PHP Date & Time, PHP Arrays Multi, PHP File Handling, PHP File Upload, PHP
Cookies, PHP Sessions, PHP Filters, PHP Error Handling, PHP Exception, mySQL Database,
PHP AJAX, PHP Versions
Chapter 2: Domain, DNS, Web Hosting Basis, Types of Web Hosting, Using Control Panels
(cPanel, DirectAdmin, etc.), Email Hosting, Using FTP Clients, Installing SSL Certificates,
Maintaining a Website
Chapter 3: Digital Marketing: Marketing Fundamentals, Content Marketing, SEO, SEM,

SMO, SMM, Email Marketing.
Text Book:
1. Web Design with HTML, CSS, JavaScript and jQuery Set by Jon Duckett
2. Sams Teach Yourself: HTML, CSS, and JavaScript All in One: Covering HTML5, CSS3, and
ES6, by Julie C. Meloni and Jennifer Kyrnin
3. PHP: The Complete Reference by Steven Holzner
4. Mastering PHP 7 by James Mallison
5. Mastering Bootstrap 4: Master the latest version of Bootstrap 4 to build highly customized
responsive web apps, 2nd Edition by Benjamin Jakobus
6. Sams Teach Yourself: AngularJS, JavaScript by Dayley/Dayley
Web References:
1. W3Schools.com
2. TutorialRepublic.com
3. JQuery.com
4. GetBootstrap.com
5. AngularJS.org
6. PHP.net
Scheme Name of Course: Computer Vision Lab L T P S C

Total Marks: 100
Code Statistics
The purpose is to have extensive understanding of computer vision theory
and applications
Course Outcomes
1 Understand the major concepts and techniques in computer vision and
image processing.
2 Demonstrate computer vision and image processing knowledge by
designing and implementing algorithms to solve practical problems.
3 Prepare for research in computer vision and image processing
1. Introduction to basic tools for working with images and the central Python modules
2. Detecting interest points in images and how to use them to find corresponding points
and regions in images
3. Various Image transformations
4. Generate image projections from 3D space to image features and estimate camera
viewpoint
5. To work with several images of the same scene, the fundamentals of multiple-view
geometry and compute 3D reconstructions from images
6. Studying clustering methods and use them for grouping and organizing images based
on their visual content
7. Build efficient image retrieval techniques that can store image representations and
search for images based on their visual content
8. Implementing algorithms for classifying image content and implement obect
recognition
9. To divide an image into meaningful regions using clustering, user interactions or
image models
10. To use Python interface for the commonly used OpenCV library
Scheme Name of Course: Natural Language Processing L T P S C

Version: Lab
2019 Apply to Programs: CSE(H) Artificial 0 0 2 0 1
Intelligence and Machine Learning
Total Marks: 100
Course Pre-requisite: Knowledge of basic machine learning Total hours = 30
Code techniques
This course is an introduction to the fundamental concepts and techniques
of natural language processing (NLP).
Course Outcomes
1 Indepth understanding of the computational properties of natural
languages and the commonly used algorithms for processing linguistic
information
2 The course examines NLP models and algorithms using both the
traditional symbolic and the more recent statistical approaches
1. Counting words in Corpora using all basic corpus functionality in NLTK

2. Generating Random Text using Bigram
3. Regular Expressions for detecting Word Patterns
4. Regular Expressions for Tokenizing Text
5. N-Gram Tagging
6. Parsing with context free grammar
7. Use of Probabilistic context free grammar
8. Unification of Feature Structures and implementation
9. Text Classification
10. Consecutive or Sequence Classification
Scheme Name of Course: Web Technologies Lab L T P S C

Version:
Apply to Programs: COMMON TO ALL 0 0 2 0 1
2019
BRANCHES (3 YEAR)
Total Marks: 100
Course Pre-requisite: Fundamentals of Computers Total hours =30
Code:
 Students will learn how to create webpages.
 Students will learn the different web technologies used today
 Students will learn to host and maintain a website
Course Outcomes
1 The students will able to design and code the web pages.
2 The student will able to use different languages, libraries and frameworks of
Web Technologies.
3 The student will be able to create complete websites.
UNIT –I
Chapter 1: Create a webpage using HTML tags.
Chapter 2: Install WAMP Server in your PC. Run your first program.
Chapter 3: Create a webpage using HTML Tags & External CSS.
Chapter 4: Create a HTML Form using HTML Tags, External CSS & validate it using
JavaScript.
UNIT –II
Chapter 1: Putting the jQuery into no-conflict mode.
Chapter 2: Install the Libraries & Frameworks.
Chapter 3: Create a responsive mobile-friendly webpage using Bootstrap
Chapter 4: Create SPAs using AngularJS
UNIT –III
Chapter 1: Create HTML Form and save the input values in MySQL using PHP.
Live Project: Create a Website using all the technologies learnt in this subject which is
Responsive & Mobile-Ready and host it on web server.
Scheme Name of Course: Enterprise Resource Planning L T P S C

Version: Apply to Programs : Common to all 3 0 0 0 3
Total Marks: 100
Course Total hours =
Code 45Hours
 To understand the importance of Enterprise-wide systems to business
operations
 To understand basic concepts, tools and techniques of Enterprise
Resource Planning
To learn to use commercial ERP package
Course Outcomes
1 Knowledge of ERP, Warehousing & Data Mining
2 of Knowledge Business setup using ERP
3 Knowledge of various ERP Packages

UNIT-I [15h]
ERP Introduction- Benefits, Origin, Evolution and Structure: Conceptual Model of ERP,
Evolution of ERP, Structure of ERP, ERP and Functional Areas. Model: Dynamic and
process.
ERP and Technology- Business Process Reengineering, Data wareHousing, Data
Mining, Online Analytical Processing(OLAP), Product Life Cycle
Management(PLM),LAP, Supply chain Management.
ERP Implementation: Implementation Challenges , Strategies , Life Cycle , Pre –

implementation Tasks ,Requirements Definition , Methodologies , Package selection , Project
Teams ,Process Definitions , Vendors and Consultants, Data Migration , Project management
, Post Implementation Activities.
UNIT – II [15h]
ERP Marketplace and Marketplace Dynamics- Market Overview, Marketplace Dynamics,
Changing ERP Market.
ERP Functional Modules- Introduction, Functional Modules of ERP Software, Integration
of ERP, Inventory Control – Supply Chain Management and Customer Relationship
Applications.
UNIT – III [15h]
ERP & E-Commerce, Future Directives- in ERP, ERP and Internet, Critical success and
failure factors, Integrating ERP into organizational culture.
Using ERP Tool- ERP System Package – SAP, People Soft, BAAN and Oracle – as a case
study
Text Books:
1. Vinod Kumar Garg and N.K.Venkita Krishnan, “Enterprise Resource Planning-
Concepts and Practice”, Prentice Hall of India.
2. Antonio Fernandz, “The SAP R/3 Handbook”, Tata McGraw Hill.
Reference Books:
1. Brady, Monk, Wagner, “Concepts in Enterprise Resource Planning”, Thomson Asia.
2. Alexis Leon, “ERP DEMYSTIFIED”, Tata McGraw Hill, Second Edition, 2008.
Mary Sumner, “Enterprise Resource Planning”, Pearson Education, 2007.
Scheme Name of Course: Deep Learning L T P S C
Version: Apply to Programs: CSE Artificial Intelligence 3 0 0 0 3
2019 and Machine Learning
Total Marks: 100
Code Statistics and Machine Learning algorithms
 Introduce major deep learning algorithms, their problem settings
and their applications to solve real world problems
Course Outcomes
1 Identify the deep learning algorithms which are more appropriate for
various types of learning tasks in various domains
2 Implement deep learning algorithms and solve real-world problems
Unit-I
Basics of Artificial Neural Network: Computational models of neurons, Structure of neural

networks. Functional units of ANN for pattern recognition tasks, Pattern classification using
perceptron, Multilayer feed forward neural networks (MLFFNNs), Backpropagation learning,
Empirical risk minimization, Regularization, Difficulty of training DNNs, Greedy layer wise
training, Optimization for training DNNs, Newer optimization methods for neural networks
(AdaGrad, RMSProp, Adam)
Unit-II
Second order methods for training, Regularization methods (dropout, drop connect, batch
normalization), Introduction to CNNs - convolution, pooling, Deep CNNs, Different deep
CNN architectures - LeNet, AlexNet, VGG, Training a CNNs: weights initialization, batch
normalization, hyper parameter optimization, Understanding and visualizing CNNs
Unit-III
Sequence modeling using RNNs, Backpropagation through time, Long Short Term Memory
(LSTM), Bidirectional LSTMs, Bidirectional RNNs, Gated RNN Architecture, Autoencoders
(standard, denoising, contractive, etc), Variational Autoencoders, Adversarial Generative
Networks
Text Books –
1. Goodfellow, I., Bengio,Y., and Courville, A., Deep Learning, MIT Press, 2016.
2. Bishop, C., M., Pattern Recognition and Machine Learning, Springer, 2006.
Reference Books –
1. Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009
Scheme Name of Course: Deep Learning Lab L T P S C
Version: Apply to Programs: CSE Artificial Intelligence 0 0 2 0 1
2019 and Machine Learning
Total Marks: 100
Code Statistics
 Introduce major deep learning algorithms, their problem settings
and their applications to solve real world problems
Course Outcomes
1 Identify the deep learning algorithms which are more appropriate for
various types of learning tasks in various domains
2 Implement deep learning algorithms and solve real-world problems
All programs should be done using Tensorflow and Keras

1. Implementing Multilayer feed forward neural networks
2. Implementing DNN
3. Greedy Layerwise training of DNN
4. AdaGrad optimization
5. Implementing CNN
6. Implementing Deep CNN
7. Sequence Modelling using RNN
8. Implementing LSTM
9. Implementing Autoencoder
10. Implementing Adversarial Generative Networks
Scheme Name of Course: Security & Data privacy L T P S C
Version: Laws and standards
2019 Apply to Programs: Artficial Intelligence and 3 0 0 0 3
Machine Learning(7th sem)
Total Marks: 100
Course Pre-requisite: Knowing importance of Security in Total hours =45
Code: Computing
 Articulate the main elements of various cybercrime offences.
 Understand the unique challenges posed to law enforcement agents, policy
makers and prosecutors.
 Appreciate the level of technical complexity and evolving issues in high tech
crime.
 To be able to engage in debate on policy reform in the area.
Course Outcomes
1 Describe the legal requirements for use of seized data, data collection, and storage.
2 1. Analyze technology system vulnerabilities and related exploitations
2. Analyze cybercriminal and deviant behaviors from alternative theoretical
perspectives and apply these perspectives to practical scenarios.
3 Explain the role of both the private sector and law enforcement agencies in
investigating, prosecuting, and preventing cybercrime and analyze social control
efforts from alternative theoretical perspectives

Unit-1
[15h]
Designing Trusted Operating Systems: what is a Trusted system? Security Policies
Methods of security, trusted operating system design, Assurance in Trusted operating
system.
Database Security: Introduction to database, Security Requirements, Reliability and
Integrity, Sensitive data, Inference, Multilevel databases, Proposals for Multilevel security.
Administrating Security: Security planning, Risk analysis, Organization and security
Policies, Physical Security.
Legal, Privacy and Ethical Issues in Computer Security: Protecting Programs and data,
Information and law, Rights of Employer Security, Case studies of Ethics.
International Cyber crimes: Introduction, international cyber crime law and its case studies,
Unit-2 [15h]
Cyber Fraud and Electronic Misuse: Definition of Computer Fraud or Cyber Fraud –
Characteristics Cyber Fraud Offence, fraud related Offenses.
Protection of Cyber Crimes: Encryption in Crime and Terrorism- Law Enforcement Options-
Other Technologies for Hiding Evidence – Concealing Crimes though Anonymity.
Data protection for system designers: Evaluation criteria and security testing, International
standards, Analysis and Logging, Recovery and data backs, Security policy development;
Security Models: Frameworks, Standards, Security Certification ISO 17799/ ISO 27001,
System Security Engineering Capacity Maturity Model, Laws and Legal Framework for
Information Security, Recovery and risk analysis, Operating system and application specific
auditing.
Unit-3 [15h]
IT Act 2000 & IT Amendment Act 2008: Introduction, Digital Signature, Secure Electronic
records and secure digital signatures, Digital Signature Certificates, Offences covered under
IT Act 2000, Major Amendments in IT Act.
Understanding Copy Right in Information Technology: Understanding the technology of
Software software-copyright vs Patent debate Authorship, Assignment issues Commissioned
work, Work for hire Idea/Expression dichotomy, Copy right in internet, Legal Issues in
internet and Software Copyright Jurisdiction Issues, Copyright Infringe Remedies of
Infringement Multimedia, Copyright issues Software Piracy, Patents understanding.
Data Privacy laws: GDPR.
Text Books:
1. V. D. Dudeja ,”Cyber Crime and Law Enforcement”, Commonwealth Publishers, 2003
2. C. Davis,”IT Auditing: Using Controls to protect Information Assets”, TMH, 2011
Reference Books:
1. R.K.Suri and T.N. Chhabra ,”Cyber Crime”, Pentagon Press New Delhi ,2002.
Scheme Name of Course: Advanced Database L T P S C
Version: Management Systems
Specializations of CSE 4th Year
Total Marks: 100
Course Pre-requisite: Database Management Systems Total hours =45
Code
 Master the basic concepts and appreciate the applications of database systems
 Master the basics of creating databases query
 Be familiar with the basic issues of transaction processing and concurrency control
and knowledge about the various performance tools
Course Outcomes
1 List and explain the fundamental concepts of DB2 on various platforms
2 Utilize wide range of features available in a DBMS package
3 Manipulate a data base and assess the quality and ease of use of application performance
tools
UNIT-I [15]
Overview of DB2 9 on Linux, UNIX and Windows, Command Line Processor (CLP) and
GUI usage, The DB2 environment
UNIT-II [15]
Creating databases and data placement, creating database objects, Moving data
UNIT-III [15]
Backup and recovery, Locking and concurrency, Investigating DB2 locking

Problem determination, Application issues and performance, Application performance tools,
Security
Scheme Name of Course: Advanced Database L T P S C
Version: Management Systems Lab
Specializations of CSE 4th Year
Total Marks: 100
Course Pre-requisite: Database Management Systems Total hours =45
Code
 Describe unique recovery planning requirements for DB2 single and
multiple partition databases
 Recover DB2 table
 Plan, implement and manage a HADR environment
Course Outcomes
1 To analyze an information storage problem and derive an information model
expressed in the form of an entity relation diagram and other optional analysis
forms, such as a data dictionary.
2 To implement the concept of the relational data model.
3 To formulate, using SQL, solutions to a broad range of query and data update
problems.
To develop a project using database concepts.
List of Experiments
UNIT-I
12. Introduction to DBMS, RDBMS, Oracle and basic SQL Commands
13. Create tables and specify the Queries in SQL.
14. To Manipulate the Operations on the table.
15. To implement the restrictions on the table.
16. To implement the structure of the table.
UNIT-II
17. To implement the concept of Joins.

18. To implement the concept of grouping of Data.
19. To implement the concept of Sub Query.
20. To implement the concept of Indexes and views. To implement cursors, triggers and
views.
UNIT-III
21. Design a case study for university management system.

22. Create a database for library management system.
23. Design a case study for railway reservation system.
Scheme Name of Course: Human Computer Interaction L T P S C
Total Marks: 100
Code Statistics
 Learn the foundations of Human Computer Interaction
 Be familiar with the design technologies for individuals and persons
with disabilities
 Be aware of mobile HCI
 Learn the guidelines for user interface.
Course Outcomes
1 Design effective dialog for HCI
2 Design effective HCI for individuals and persons with disabilities
3 Assess importance of user feed back
4 Explain the HC implications for designing multimedia/ ecommerce / e-
learning websites
5 Develop meaningful user interfaces
Unit-I
Foundations of HCI – The Human: I/O channels – memory, reasoning and problem solving;
The computer: Devices, memory – processing and networks; Interaction: Models,
frameworks, ergonomics, styles, elements and interactivity, paradigms
Unit-II
Design and software process – Interactive Design basics: process, scenarios, navigation,
screen design, iteration and prototyping. HCI in software process: Software lifecycle,
usability engineering, prototyping in practice, design rationale. Design rules: Principles,
standards, guidelines, rules. Evaluation techniques – Universal Design. Cognitive Models –
Socio Organizational Issues and stakeholder requirements. Communication and collaboration
models: Hypertext, multimedia and WWW.
Unit-III
Applications of HCI – Mobile Ecosystem: Platforms, Application frameworks: Types of
Application frameworks. Designing Web interfaces – Drag & Drop, Direct Selection,
Contextual Tools, Overlays, Inlays and virtual pages, process flow
Text Books –
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer
Interaction”, 3rd Edition, Pearson Education, 2004
2. Bill Scott and Theresa Neil, “Designing Web Interfaces”, First Edition, O‟Reilly,
2009.
Reference Books –
1. Brian Fling, “Mobile Design and Development”, First Edition , O‟Reilly Media
Inc., 2009
Scheme Name of Course: Augmented Reality L T P S C

Total Marks: 100
Code Statistics
This course provides students with an opportunity to explore the research issues
in Augmented Reality and Virtual Reality (AR &VR). It also makes the
students know the basic concept and framework of virtual reality.
Course Outcomes
1 Develop interactive augmented reality applications for both PC based mobile
devices using a variety of novel input devices
2 Demonstrate a knowledge of the research literature in Augmented Reality for
both compositing and interactive applications
3 Develop skills in the design and development of interactive augmented reality
environments
Unit-I
Introduction of Virtual Reality: Fundamental Concept and Components of Virtual Reality.

Primary Features and Present Development on Virtual Reality. Multiple Models of Input and
Output Interface in Virtual Reality: Input -- Tracker, Sensor, Digital Glove, Movement
Capture, Video-based Input, 3D Menus & 3DScanner etc. Output -- Visual /Auditory / Haptic
Devices.
Unit-II
Visual Computation in Virtual Reality: Fundamentals of Computer Graphics. Software and
Hardware Technology on Stereoscopic Display. Advanced Techniques in CG: Management
of Large Scale Environments & Real Time Rendering, Interactive Techniques in Virtual
Reality: Body Track, Hand Gesture, 3D Manus, Object Grasp.
Unit-III
Augmented and Mixed Reality, Taxonomy, technology and features of augmented reality,
difference between AR and VR, Challenges with AR, AR systems and functionality,
Augmented reality methods, visualization techniques for augmented reality, wireless displays
in educational augmented reality applications, mobile projection interfaces, marker-less
tracking for augmented reality, enhancing interactivity in AR environments, evaluating AR
systems.
Text Books –
1. Virtual Reality Technology G. Burdea and P. Coiffet John Wiley & Sons, Inc.
2. Emerging Technologies of Augmented Reality M. Haller, M. Billinghurst and B.
Thomas Idea Group Publishing
Reference Books –
1. Augmented Reality, R. Behriger, G. Klinker and D. W. Mizell A K Peters
Scheme Name of Course: Augmented Reality L T P S C
Total Marks: 100
Course Pre-requisite: Total hours = 45
Code
.
Course Outcomes
1 Blockchain technology and the key concepts like cryptography and cryptocurrency
concepts
Gain a deep insight into Bitcoin, its network and how Bitcoin transactions are
validated by miners
Understand Ethereum Blockchain and learn Solidity programming language to
develop Smart Contracts
Deploy your private Blockchain on the web where you can visually see your
chains & send transactions between nodes
2 Infer Hyperledger project, its architecture, APIs and network topology
Work with Hyperledger Composer Playground on cloud & locally
Deploy and test business network using Composer
3 Develop a private Blockchain in MultiChain

Discuss the compelling use-cases of Blockchain
Interpret the prospects of Blockchain and assess how Blockchain can improve
your business standards
UNIT 1
 What is blockchain
 The business backdrop
 The problem area
 Cryptography
 Relation to bitcoin
 Concepts in Blockchain
 Introduction to HTML 5 and Javascript Programming
 NodeJS, Server side,Javascript, Callback functions
UNIT 2
 What is blockchain
 The business backdrop
 The problem area
 Cryptography
 Relation to bitcoin
 Concepts in Blockchain
 Introduction to HTML 5 and Javascript Programming
 NodeJS, Server side,Javascript, Callback functions
UNIT 3
 Block chain principles and its use in the enterprise
 Blockchain infrastructure and applications
 Identify participants, assets, transactions in a business network
 Hyperledger Fabric and Hyperledger composer
 Blockchain solution architecture
 Peers, smart contracts, channels, world state
 Consensus, ordering service and transaction endorsement
 Chain code structure, lifecycle and deployment approaches.
 Blockchain deployment with Docker and Kubernetes
 Blockchain security on Hyperledger Fabric and Composer
 Blockchain integration including SDKs, APIs, IoT and Cloud
Scheme Name of Course: Human Computer Interaction L T P S C
Version: lab
2019 Apply to Programs: CSE(H) Artificial 0 0 2 0 1
Intelligence and Machine Learning
Total Marks: 100
Code Statistics
*** Course Objectiv
e
 Learn the foundations of Human Computer Interaction
 Be familiar with the design technologies for individuals and persons
with disabilities
 Be aware of mobile HCI
 Learn the guidelines for user interface.
Course Outcomes
1 Design effective dialog for HCI
2 Design effective HCI for individuals and persons with disabilities
3 Assess importance of user feed back
4 Explain the HC implications for designing multimedia/ ecommerce / e-
learning websites
5 Develop meaningful user interfaces
1. To understand the trouble of interacting with machines, redesign interfaces of home

appliances
2. Design a system based on user centered approach
3. Understand the principles of a good screen design
4. Redesign existing GUI with screen complexity
5. Design Web User Interface based on Gestalt Theory
6. Implementation of Different knids of menus
7. Implementation of different kinds of windows
8. Design a system with proper guidelines for icons
9. Implementation of Contextual Tools
10. Implementation of Inlays, Overlays and Virtual Pages
Scheme Name of Course: Augmented Reality Lab L T P S C
Total Marks: 100
Code Statistics, Computer Vision and Programming
This course provides students with an opportunity to explore the research issues
in Augmented Reality and Virtual Reality (AR &VR). It also makes the
students know the basic concept and framework of virtual reality.
Course Outcomes
1 Develop interactive augmented reality applications for both PC based mobile
devices using a variety of novel input devices
2 Demonstrate a knowledge of the research literature in Augmented Reality for
both compositing and interactive applications
3 Develop skills in the design and development of interactive augmented reality
environments
1. Introduction to Vuforia (Unity)

2. Develop a simple augmented reality app in Vuforia
3. Detect multiple marker targets and overlay 3D items from Unity Asset Store
4. How to use your hands to draw in Mid Air using a Leap Motion Controller
5. Detect Cylindrical Targets and overlay particle effects
6. Levitate a Cube in Augmented Reality
7. Export AR app to Android
8. How to use Virtual buttons effectively within AR app
9. How to implement Vuforia Smart terrain
10. Implementing ARCore like experience using Ground Plane Technology

Version 2018 Aiml

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Version 2018 Aiml

Uploaded by

Copyright:

Available Formats

B.E.

(CSE) – Artificial Intelligence and Machine Learning

Program Educational Objectives (PEOs)

Program Outcomes (POs)

PO1 Engineering Knowledge: An ability to apply knowledge of science, mathematical

Program Specific Outcomes (PSOs)

PSO1 Develop and apply algorithms to build machine intelligence.

PSO2 Apply principles of Data Science to solve real world problems

Demonstrate knowledge of statistical data analysis techniques for decision making

UCY-146 Life Skill and Mentoring 0 1 0 0 NON

UCY-196 Life Skill and Mentoring 0 1 0 0 NON

 To apply different data structures for modeling real world problems.

Content of the Syllabus

Introduction: Concept of data and information, Introduction to Data Structures, Types of

Graphs: Graph Theory terminology, sequential representation of graphs (adjacency matrix,

Trees: Basic terminology, Binary Trees, Representation of Binary Trees in Memory,

 To implement various data structure and operations on them using C++.

Content of the Syllabus

 To grasp a fundamental understanding of operating systems and its

Content of the Syllabus

Introduction to the Operating System: Introduction to Operating Systems, Operating

Process Management: Process Concept, Process Control Block, Process Scheduling,

File Management: File Concepts, Access Methods, Directory Structure, Allocation

Distributed and Network Operating Systems: Overview: Topology, connection strategy,

To learn about distributed databases

Content of the Syllabus

Distributed Databases, Distributed Data, Physical Database Design, Physical Implementation,

1. IBM Course Material Fundamentals of Information Management Basics (DBMS)

Content of the Syllabus

Introduction: What is meant by Software Engineering? Definitions of Software Engineering;

Software Requirement Analysis and Specifications: Structured Analysis, Data Flow

Software Design: Design fundamentals, problem partitioning and abstraction, design

Coding: Programming style, structured programming.

Software Testing: Testing fundamentals, Functional testing: Boundary Value Analysis,

Software Maintenance: Type of maintenance, Management of Maintenance, Maintenance

1. Pressman R. S., “Software Engineering – A Practitioner’s Approach”, Tata McGraw Hill.

2. Jalote P., “An Integrated approach to Software Engineering”, Narosa.

1. Sommerville, “Software Engineering”, Addison Wesley.

2. Fairley R., “Software Engineering Concepts”, Tata McGraw Hill.

 To implement different SQL and PL/SQL commands.

2 To implement the concept of the relational data model.

6. To implement the concept of Joins.

9. Design a case study for university management system.

 To understand Computer Hardware and networking.

2 Introduction to Shell Programming and control structure

3 Loop control Structure and formatted output.

Content of the Syllabus

10. Write a program using relational operators in shell programming.

2 How to count some different types of discrete structures;

Contents of the Syllabus

Scheme Name of Course: Computer Organization and L T P S C

3 Have practical experience of prototyping digital circuits

Content of the Syllabus

Instruction Set Architectures-Levels of programming Languages, Assembly Language

Computer Organization- CPU organization, Memory Subsystem Organization: Types of

Memory organization-Memory hierarchy, Cache Memory Associative Memory, Cache

Input output organization –Asynchronous Data transfer: Source Initiated, Destination

Introduction to Parallel Processing- Parallelism in uniprocessor system, Flynn’s

Multiprocessors- Characteristics of multiprocessors, Uniform and non-uniform memory

1. Carpinelli J.D,” Computer systems organization &Architecture”, Fourth Edition,

1. J.P. Hayes, “Computer Architecture and Organization”, Third Edition.

Subject Code SYSTEM PROGRAMMING L T P S C

Unit Course Outcomes

Contents of the Syllabus