B.Tech Syllabus-Final Copy Witth All Years - 12th Jan 2021
B.Tech Syllabus-Final Copy Witth All Years - 12th Jan 2021
Operating Systems
Computer Networks Lab
Software Engineering Lab
Operating System Lab
Artificial Intelligence
Cryptography and Network Security
Machine Learning
(vi) Professional Elective Courses
Elective group-1
Data Mining
Advanced Java
Distributed Computing
Advanced Computer Architecture
Elective group-2
Object Oriented Analysis and Design
Distributed Systems
Real time Operating System
Embedded Systems
Digital Image Processing
Mobile Application Development
Elective Group-3
Information Retrieval
Software Testing
Mobile Computing
Data Compression
Computer Graphics
Elective Group-4
Data Science
Unix Shell Programming
VLSI
Soft Computing
File Structures
Elective Group-5
Big Data Analytics
Design Patterns
Cloud Computing
Deep Learning
Internet of Things
Information Security
Computer Vision
Optimization Techniques
Open Elective Courses
OOPs through Java
Database Management Systems
Computer Graphics
Distributed Computing
Digital Image Processing
List of additional Open Electives
Soft Skills and Interpersonal Communication
Economic Policies in India
Indian Music System
Intellectual Property Rights (IPR)
(vii) Seminars/Mini Projects/Projects
Mini Project – 1
Summer Internship
Project-I
Project-II & Dissertation
Chapter-1
General, Course structure, Theme and semester-wise credit distribution
A. Definition of Credit:
1 Hour Lecture (L) per week 1 credit
1 Hour Tutorial (T) per week 1 credit
3 Hours Practical (Lab)/week 1.5 credits
B. Total number of credits: 160
C. Minimum number of contact hours/weeks per semester: 15 weeks of teaching
1. For 1 credit course: 15 contact hours per semester
2. For 2 credit course: 30 contact hours per semester
3. For 3 credit course: 45 contact hours per semester
4. For 4 credit course: 60 contact hours per semester
E. Structure of Program
Notations:
E1-S1: Engineering first year first semester
E1-S2: Engineering first year second semester
E2-S1: Engineering second year first semester
E2-S2: Engineering second year first semester
E3-S1: Engineering third year first semester
E3-S2: Engineering third year second semester
E4-S1: Engineering fourth year first semester
E4-S2: Engineering fourth year second semester
SUM INTERN: Summer Internship program
CHAPTER – 2
SEMESTER-WISE STRUCTURE OF CURRICULUM
Mandatory Induction Program
3 Weeks Duration
Physical activity
Creative Arts
Universal Human Values
Literary
Proficiency Modules
Lectures by Eminent people
Visit to local areas
Familiarization of Dept./Branch Innovations
ENGINEERING FIRST YEAR: SEMESTER-1
Total 11 3 12 19
3 ESC EC2109 3 0 0 3
Digital Logic Design
4 PCC CS2101 Design & Analysis of Algorithms 3 1 0 4
Course Content:
Unit – I (8 Contact hours)
Differential equations of first order and first degree:
Basic concepts, Variable Separable method, homogeneous differential equations, Exact differential
equations, Integrating factor, Differentiable equations Reducible to exact, Linear differential
equations, Bernoulli differential equations
Unit - II (16 Contact hours)
Functions of several variables:
Limit, Continuity and Differentiability of functions of several variables, Partial derivatives and their
geometrical interpretation, Differentials, Derivatives of Composite and Implicit functions, Chain
rule, Jacobians, Derivatives of higher order, Homogeneous functions, Euler's theorem, and
Harmonic functions, Taylor's expansion of functions of several variables, Maxima and Minima of
functions of several variables - Lagrange's method of multipliers.
Unit - III (8 Contact hours)
Beta and Gamma Functions:
Convergence of improper integrals, tests of convergence, Beta and Gamma functions - elementary
properties, differentiation under integral sign, and differentiation of integrals with variable limits -
Leibnitz rule.
Unit - IV (11 Contact hours)
Linear Algebra:
Vector Spaces, Linear Combinations of Vectors, Linear dependence and Independence, System of
Linear Equations, Rank of a Matrix, Inverse of a matrix, Eigen values and Eigen Vectors.
Properties for various type of matrices (i.e Symmetric, skew-symmetric, Hermitian, Skew -
Hermitian, Orthogonal, Unitary matrices and Idempotent matrix).
Unit - V (9 Contact hours)
Numerical solution of transcendental equations, Interpolation and Curve fitting:
Roots of polynomial and transcendental equations – bisection method, Regula-falsi method and
Newton-Raphson method, Finite differences, Newton's forward and backward interpolation
formulae, Gauss central difference Interpolation formulae, Curve fitting by Least square method [(i)
straight line (ii) Parabola].
Unit – VI (8 Contact hours)
Numerical integration and numerical solution of IVP:
Lagrange interpolation, Divided differences, Trapezoidal rule, Simpson's 1/3 rule rule for
rd
Reference Books:
1. TOM M. APOSTAL,’ Calculus, Volume II’, Wiley-India, Second Edition,
2. R. K. JAIN AND S. R. K. IYENGAR,’ Advanced Engineering Mathematics’, Narosa Publishers,
3rd Edition.
3. B.S.GREWAL, ‘Higher Engineering Mathematics’, Khanna Publishers, 42 Edition. nd
Web resources:
1. NPTEL, IIT- Madras, 08-June-2017, Introduction to ordinary differential equations URL:
https://nptel.ac.in/courses/111106100/12
2. NPTEL, IIT- Kanpur, 15-March-2016, Differential Calculus of Several Variables URL:
https://nptel.ac.in/courses/111104092/11
3. RGUKT Course Content.
Course outcomes: At the end of the course, the student will be able to
CO 1 Solve first order differential equations.
CO 3 Apply Leibnitz rule and beta gamma functions to evaluate improper integrals.
CO 4 Finding Eigen values and Eigen vector for a linear transformation.
CO 5 Approximate the roots of polynomial and transcendental equations.
CO 6 Approximate the value at a point by using given discrete data. Solve IVP numerically.
**************************************************************************
Course Code Course Name Course Category L-T-P Credits
Course Content:
Unit-I (13 Contact hours)
DC Circuits: Parallel circuits, Star-delta and delta-star transformations, equivalent resistance
calculation, Mesh and Nodal analysis, superposition theorem, thevenin’s theorem and maximum
power transfer theorem. Introduction, Basic definitions, Types of elements, Ohm’s Law,
Kirchhoff’s Laws, Series.
Learning Resources
Text books:
Basic Electrical and Electronics Engineering by Kothari and Nagarath, TMH Publications, 2nd
Edition.
Reference Books:
Principles of Electrical and Electronics Engineering by V.K.Mehta, S.Chand & Co.
Basic Electrical Engineering by Kothari and Nagarath, TMH Publications, 2nd Edition.
Web Resources:
1. Prof T S Natarajan, NPTEL-IIT Madras, 'Basic Electronics'
URL: https://nptel.ac.in/courses/122106025/
2. Prof U Umanand, IISC Bangalore, 'Basic Electrical Technology'.
URL: http://nptel.ac.in/courses/108108076/
3. Prof S Aniruddhan, IIT Madras, 'Basic Electrical Circuits'.
URL: https://onlinecourses.nptel.ac.in/noc16_ee03
Course Outcomes:
At the end of the course, the student will be able to
CO 1 Predict the behaviour of any electrical and magnetic circuits.
CO 2 Formulate and solve complex AC, DC circuits
CO 3 Identify the type of electrical machine used for that particular application
CO 4 Realize the requirement of transformers in transmission and distribution of electric power and
other applications
CO 5 Utilize the semiconductor devices like diodes and transistors
CO 6 Internlink Knowledge of electrical and electronic circuits to general problems
Assessment Method:
Weekly tests/Assignments Monthly tests
Assessment Tool End Semester Test Total
(In semester) (In semester)
Weightage (%) 10% 30% 60% 100%
***************************************************************************
Course Code Course Name Course Category L-T-P Credits
CS1101 Problem Solving and Programming Through
ESC 3-1-0 4
C
Reference Books:
1. E. BalaguruSwamy, “ Programming in ANSI C”, Mc Graw Hill, 7 Edition
th
Web resources:
Indian Institute of Technology, Kharagpur, “Problem Solving through Programming in
C”, https://nptel.ac.in/courses/106105171/
Course outcomes: At the end of the course, the student will be able to
CO 1 Develop flowcharts, algorithms for given complex problems.
CO 2 Analyze basic programming constructs.
Write C programs for real world problems. Implement C programming by using various
CO 3
control structures.
CO 4 Able to write rite modular and readable C Programs
CO 5 Able to use pointers in C programming
CO 6 Appreciate coding standards and best practices for program development.
Course Content:
Unit - I (6 Contact hours)
Introduction to Engineering drawing – Tools and Standards, Geometric Constructions, Scales,
Conics and Special Curves - ellipse, parabola, hyperbola, cycloids, Involutes.
Unit - II (6 Contact hours)
Introduction to Orthographic Projections,Projections of Points, Projection of Lines.
Unit - III (7 Contact hours)
Projection of Planes, Projections of Solids cube, prism, pyramid, cylinder, cone and sphere.
Unit - IV (5 Contact hours)
Sections of Solids - cube, prism, pyramid, cylinder, cone and sphere. Development of Surfaces –
Parallel line method and Radial line method.
Unit - V (6 Contact hours)
Computer Aided Design – Introduction to AutoCAD, Co-ordinate System (UCS) and their
Commands, Basic Commands of Drawing and Editing, Dimensioning and Text.
Unit – VI (6Contact hours)
Drawing practice with AutoCAD – Creating 2D Drawings of Objects from Isometric views,
Creating Isometric views form Orthographic views and . Introductions to 3D drawings.
Learning Resources
Text Book:
1. N.D. Bhatt and V.M. Panchal, “Engineering Drawing”, Charotar Publications
Reference Books:
1. K. Venugopal , “Engineering drawing”
2. N.S. Parthasarathy and Vela Murali , “Engineering Drawing”
Course outcomes: At the end of the course, the student will be able to
CO 1 Student will be aware of International and national standards of practice.
CO 2 Student will be familiar with obtaining the views of the frontal and the top surfaces of an
object.
Student will be aware of orthographic projections of right and regular solids in simple
CO 3
positions, when their axes are perpendicular to one reference plane and parallel to the other.
Student will know about computer aided drafting techniques and will be familiar with one of
CO 4
the most powerful software ‘AutoCAD’.
***************************************************************************
Objectives:
The sole aim of the course is to make students effective communicators.
The focus of this course is on communication skills which cover the four major
language skills, namely, reading, listening, speaking and writing besides
Functional English grammar.
It will improve the language proficiency of the students in English with
emphasis on LSRW skills
It will develop the communication skills of the students in both formal and
informal situations.
Unit 1
2. LISTENING
2.1Podcasts – 5
3. SPEAKING
3.1 British Council – A1 –level – Modules 1-5
3.2 ESL conversations – 5
4. READING
4.1Introduction to Reading Comprehension Passages
4.2Types of RC passages
4.3Tactics to tackle RC questions
5. WRITING
5.1Rearrangement of Jumbled Words and Sentences
5.2Format of the Questions
2. LISTENING
2.1Podcasts – 5 – LISTENING SKILLS
3. SPEAKING
3.1 British Council – A1 –level – Modules 6-10
3.2 ESL conversations - 5
4. READING
4.1. Types of RC passages
4.2. Time saving tactics
5. WRITING
5.1Rearrangement of Jumbled Words and Sentences
5.2Format of the Questions
Unit 3
2. LISTENING
2.1Podcasts – 5
3. SPEAKING
3.1British Council – A1 –level – Modules 11-15
3.2 ESL conversations - 5
4. READING -
4.1. RC Practice Tests – 5
5. WRITING
1. Accuracy Building Zone – Exercises 1 – 5
Unit 4
2. LISTENING
2.1Podcasts – 5 – LISTENING SKILLS
3. SPEAKING
3.1British Council – A1 –level – Modules 16-20
3.2 ESL conversations - 5
4. READING -
4.1. RC Practice Tests – 6-10
5. WRITING
1. Accuracy Building Zone – Exercises 6 – 10
2. LISTENING
2.1Podcasts – 5
3. SPEAKING
3.1British Council – A2 –level – Modules 1-5
3.2 ESL conversations - 5
4. READING -
4.1. RC Practice Tests – 1-5
5. WRITING
5.1Accuracy Building Zone – Exercises 11 – 15
Course outcomes
After the completion of this Laboratory course, the students will be able to
CO 1 Critically analyze a text and be more efficient in comprehensions and
vocabulary.
CO 2 Learn writing effectively.
CO 3 Speak confidently and spontaneously.
CO 4 Present the presentations effectively overcoming stress, fear and anxiety.
CO 5 Build a strong ethical personality.
CO 6 Implementing practically the four skills of English besides competency in
functional English.
References
Textual
1. British Council Face 2 Face Instruction Material
2. Objective English by Edgar Thorpe and Showick Thorpe
3. Oxford Interactive Lab Course
4. English For Engineers And Technologists, published by Orient Blackswan
Pvt Ltd
5. Non-Detailed Text Book: Panorama – A Course On Reading, published by
Oxford University Press India
6. Raymond Murphy: Essential English Grammar: A Self-Study Reference
and Practice Book (CUP)
Web Resources
1. www.Eslfast .com
2. www.British council.org
Assessment Method
Weightage (%) Internal Marks External Marks Total Marks
40% 60% 100%
************************************************************************
List of Experiments:
Familiarization with Computer Hardware and software installation, DSO, Function generators,
RPS, FPS, Mustimeters and other lab equipment
1. Every student should Draw the block diagram of the CPU along with the configuration of
each peripheral and submit to your instructor. Every student should disassemble and
assemble the PC back to working condition.
2. Every student should individually install operating system like Linux or MS windows on the
personal computer. The system should be configured as dual boot with both windows and
Linux.
3. Hardware Troubleshooting: Students have to be given a PC which does not boot due to
improper assembly or defective peripherals. They should identify the problem and fix it to
get the computer back to working condition.
4. Software Troubleshooting: Students have to be given a malfunctioning CPU due to system
software problems. They should identify the problem and fix it to get the computer back to
working condition
Course outcome
At the end of the course, the student will be able to
CO 1 Design basic circuits using P-N junction diode and Zener diode
CO 2 Design rectifier circuits considering the practical aspects into consideration
CO 3 Design simple amplifier with required gain
CO 4 Use circuit knowledge in analyzing Arduino boards
CO 5 Designing simple experiments using Arduino board and sensors interfacing
CO 6 Experimental verification of basic circuit laws and circuit theorems
CO 7 Experimental analysis of V-I characteristics of different electrical and electronic equipments
Assessment Method
Assessment Tool Experiments Report/Viva-Voce/ Quiz/MCQ/Lab project Total
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
***************************************************************************
*
* * *
* * * * *
* * *
*
6. Write a program to print the following pattern for given ‘n’ value
For Eg. If n = 4, the output would be
2
3 5
7 11 13
17 19 23 29
Functions
4. Write a program to implement the string operations like Length of String, String Copying,
String Concatenation, Conversion to Uppercase and String Comparison.( Define own Function for
each of the operation. Header file “string.h” is not allowed)
4. Write a C program to implement Multiplication and Division Operations without using
operators “*” and “\” respectively. Define function “mul” for multiplication and “div” for integer
division.
Recursion
1. Write a program to print the integers from 1 to N and then N to 1 for the given input number
‘N’ without using any loops.
2. Write a program to find the X power N(X using the user defined recursive function
N)
Structures
1. Write a program to take the information of ‘n’ Students (REGID, Name, CGPA, Address –
Village, District, Phone NO) and print the topper among the n students.
2. Write a program to take the information of ‘n’ Students (REGID, Name, CGPA, Address –
Village, District, Phone NO) and print the students in the ascending order of Regn ID.
3. Write a program to take the information of ‘n’ Students (REGID, Name, CGPA, Address –
Village, District, Phone NO)and print the list of Phone Number for the students who are the
above average of CGPA.
Course outcomes
At the end of the course, the student will be able
CO 1 To formulate the algorithms for simple problems
CO 2 To translate the given algorithms to a working and correct program
CO 3 To identify and correct logical errors encountered at run time
CO 4 To write iterative as well as recursive programs
CO 5 To represent Data in arrays, strings, Structures and manipulate them through a program
Assessment Method
Assessment Tool Experiments Report/Viva-Voce/ Quiz/MCQ/Lab project Total
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
********************************************************************
Course Contents
UNIT-I (5 Contact hours)
Introduction-Constitution’ meaning of the term, Indian constitution sources and constitutional
history, Features: Citizenship, Preamble, Fundamental Rights and duties, Directive Principles of
State Policy.
UNIT-II (5Contact hours) Union
Government and its Administration-Structure of the Indian Union: Federalism, centre-state
relationship, President: Role, power and position, PM and Council of ministers, Cabinet and Central
Secretariat, Loksabha, Rajyasabha.
UNIT-III (5 Contact hours)
Election commission-Election commission: Role and functioning, Chief Election Commissioner
and Election Commissioners, State Election Commission: Role and functioning, Institute and
Bodies for the welfare of SC/ST/OBC and women.
UNIT-IV (3 Contact hours)
State Government and its Administration- Governor: Role and position, CM and Council of
ministers, state secretariat: Organization, structure and functions.
UNIT-V (7 Contact hours)
Local Administration-District’s Administration head: Role and importance, Municipalities:
Introduction, Mayor and role of Elected Representatives, CEO of Municipal Corporation,
Panchayati raj: Introduction, PRI: Zilla Panchayat, Elected officials and their roles, CEO Zilla
Panchayat: Position and role, Block level: Organizational Hierarchy (different departments), Village
level: Role of elected and appointed officials, Importance of grass root democracy.
UNIT-VI (5 Contact hours)
Union Judiciary-Establishment and constitution of Supreme court, Appointment of Judges,
Establishment of State High court, Establishment of common High court for 2 or more states,
WRITS, PIL(Public Interest Litigation).
Learning resources
Text book:
1. Durga Das Basu,Constitutions of India, 23 ed, LexisNexis Publication.
rd
Reference Books:
1.’Indian Polity’ by Laxmikanth
2.’Indian Administration’ by SubhashKashyap
3.’Indian Administration’ by Avasti and Avasti
4.’Government and Politics of India’ by W.H.Mrrison Jones
5.’Constitution of India’ by J.C.Johari
Course outcomes: At the end of the course, the student will be able to
CO 1 The students will understand their fundamental rules and duties.
CO 2 The students will learn the political system and the system of elections in India.
It is to provide the students the institutions and processes to govern themselves in the manner
CO 3
they prefer.
CO 4 Students can also be able to utilize the laws and facilities provided by constution
CO 5 It will provide over all idea about our legal system.
It will enable students more strong in terms of law and practice in day to day
CO 6
life.
**************************************************************************
Course Content:
Unit – I (10 Contact hours)
Propositional logic:
Syntax, semantics, valid, satisfiable and unsatisfiable formulas, encoding and examining the
validity of some logical arguments.
Unit - II (6 Contact hours)
Proof techniques:
Forward proof, proof by contradiction, contra positive proofs, proof of necessity and sufficiency.
Unit - III (12 Contact hours) Sets,
relations and functions:
Operations on sets, relations and functions, binary relations, partial ordering relations, equivalence
relations, principles of mathematical induction, Finite and infinite sets, countable and uncountable
sets, Cantor's diagonal argument and the power set theorem.
Learning resources:
TEXT BOOKS:
1. Kenneth H. Rosen,’Discrete Mathematics and its Applications’, Tata McGraw-Hill. Seventh
edition
REFERENCE BOOKS:
1. Trembley and Manohar, ‘Discrete Mathematical Structures to Computer Science’, by Mc -
Graw Hill (1997).
2. Kolman, Busby and Ross, ‘Discrete Mathematical Structures’ PHI (2009), Sixth Edition.
3. Thomas Koshy, ‘Discrete Mathematics with Applications’, Elsevier Academic press.
Web resources:
1. 1. NPTEL Lectures by Prof. Kamala Krithivasan, Dept of CSE,IIT Madras
2. link: https://www.youtube.com/watch?v=xlUFkMKSB3Y&list=PL0862D1A947252D20
3. MIT open course ware: Mathematics for Computer Science, Fall 2010. Instructor: Tom
Leighton
https://www.youtube.com/watch?v=L3LMbpZIKhQ&list=PLB7540DEDD482705B
4. Also visit: http://ocw.mit.edu/6-042JF10
5. Discrete Mathematics for GATE. IIT lecture:
6. https://www.youtube.com/watch?v=E6uhC0pT9J8&list=PLEJxKK7AcSEGD7ty8DB1aU
0xVG_P_hs_0
7. 4.RGUKT Course Content
Course outcomes: At the end of the course, the student will be able to
CO 1 Read, comprehend and construct mathematical argument
CO 2 Prove theorems and mathematical statements in different techniques.
CO 3 Deal with set, relation, countability and functions.
Apply permutation, combination, pigeon hole principle, recurrence relation and
CO 4
generating functions to enumerate objects.
CO 5 Understand and apply concepts of graph in many computer science courses.
CO 6 Solve problems on group.
*********************************************************************
Course Course name Course L-T-P Credits
code Category
PY1201 E1 Engineering Physics-CSE BSC 3-1-3 5.5
Course Content:
Text Books:
1. Hitendra K. Malik and A. K. Singh, ‘Engineering Physics’ Tata McGraw Hill, 2nd Edition, 2017
2. Dr. M.N Avadhanulu, Dr. P.G Kishore sagar, ‘A Textbook of Engineering Physics’ S.chand, 2014
3. Gaur and Gupta “Engineering Physics, Dhanpathrai Publications, 6th edition
References:
1. Ajoy Ghatak ‘Optics’ Tata McGraw Hill, 6th Edition
2. M. Armugam, Anuradha ‘Engineering Physics’, Agencies publishers, 2003
3. David McMahon, ‘Quantum Computing Explained’, Wiley, 2016
Course outcomes: At the end of the course, the student will be able to
CO1.Student will be able to understand the phenomena of interference, diffraction and polarization
exhibited by light waves.
CO2. Student will be able to understand the working and construction of LASERS and its
applications in various fields. Student will get knowledge about optical fibers and their applications.
CO3. Student will be able to construct a quantum mechanical model to explain the behavior of a
system at microscopic level and solve engineering problems using the laws of quantum mechanics.
CO4. Student will able to understand the properties of semiconductors and basic electronic devices
CO5. Student will able to understand the nature and characterization of acoustic design and ultra-
sonic waves applications
CO6. Students will get knowledge about new emerging materials and its applications and use in
various fields.
Unit I: (6 hours)
Introduction to managerial economics, consumer behavior, demand, demand analysis, demand
forecasting, supply, supply analysis.
Unit II: (7 hours)
Theory of production, production functions, concept of cost, cost analysis, break even analysis.
Unit III: (6 hours)
Market structure-monopoly, oligopoly, monopolistic, prefect market; Types of business
organizations-sole proprietorship, partnership, private ltd. Companies and public ltd. Companies,
formation of company.
Reference Books:
1. Siddiqui., Managerial Economics & Financial Analysis, 2e, New Age International Private
Limited, 2017.
2. . Pandey, I.M., “Financial Management”, 11e, Vikas Publishing House, 2015.
3. . Prasanna Chandra., “Financial Management: Theory and Practice”, 9e, Mc Graw Hill
Education, 2015.
Web resources:
Course outcomes: At the end of the course, the student will be able to
A student will be able to understand basic economics as well as management
CO 1
concepts.
CO 2 This subject will provide implication facilities of concepts.
CO 3 Students can be able to do primary data collection and classification.
Students can also be able to forecast as well as generate trend series by utilizing the
CO 4
available secondary data.
CO 5 They have basic knowledge about accounting and its terminologies.
CO 6 They will be able to prepare and understand accounting tables.
Assessment Method
Weightage (%)
10% 30% 60% 100%
Course
Course code Course Name L-T-P Credits
Category
CS2102
Object Oriented Programing PCC
3-1-0 4
through JAVA
Strings: Exploring the String class, String buffer class, Command-line arguments. Library:
StringTokenizer, Random class, Wrapper classes. Encapsulation: Abstraction. Creating User defined
Data Structures: Array of Objects, User defined Linked List.
Inheritance and Interface:Types of Inheritance, usage of super key word, method overriding, final
methods and classes, abstract classes, Polymorphism: dynamic method dispatch, Static method
dispatch. Interfaces: Differences between classes and interfaces, defining an interface,
implementing interface, variables in interface and extending interfaces.
File Handling: Streams, File class, File streams. File Reader, File Writer, Buffered Reader,
Buffered Writer, String Tokenizer Exception Handling: Concepts of Exception handling, types of
exceptions, usage of try, catch, throw, throws and finally keywords, Built-in exceptions, creating
own exception sub classes.
Event Handling: Introduction to Event Handling, AWT Components, windows, Layout Managers,
Event handling model of AWT, Adapter classes, Menu, Menu bar. Swings: swings introduction,
JFrame, JPanel and JComponent, Icons and Labels, text fields, buttons – The JButton class, Check
boxes, Radio buttons. Combo boxes, Action Listeners. Introduction to JDBC.
Learning Resources
Text books:
Herbert Schildt, “The Complete Reference Java”, TMH Publishing Company Ltd, 9th Edition.
Cay Horstmann, “Big Java”, John Wiley and Sons, 2nd Edition
Reference Books:
Allen B.Downey,“Think Java; How to Think Like a Computer Scientist”,Paper Back
1stEdition
David J. Eck, Hobart and William Smith Colleges, “Introduction to Programming Using
Java” Published by Paper Back .
3. H.M.Dietel and P.J.Dietel “Java How to Program”, Sixth Edition, Pearson Education/PHI
Web resources:
1. http://www.nptelvideos.com/java/java_video_lectures_tutorials.php
2. https://www.tutorialspoint.com/java/
3. https://www.javatpoint.com/java-tutorial
4. http://mooc.fi/courses/2013/programming-part-1/material.html
5. http://math.hws.edu/javanotes
Course Outcomes: At the end of the course, the student will be able to
CO 1 Explain OOP Principles and Write Basic Java Programs.
CO 2 Defining Classes and Objects. Identify classes, objects, members of a class and
relationships among them needed for a specific problem
CO 3 To be able to write Java Programs to demonstrate method overloading and
Demonstrate the concepts of polymorphism and inheritance. Discuss method
overriding V/s method overloading.
CO 4 Explain the benefits of JAVA’s Exceptional handling mechanism compared to
other Programming Language
CO 5 To be able to write Java Programs to demonstrate Packages and Threading
concepts.
CO 6 Discuss and Demonstrate the AWT Concepts and develop the AWT
Applications.
Course Content:
Unit- I (7 Contact Hrs)
Introduction to Linear and Non-Linear data structures. Singly Linked Lists-Operations-Insertion,
Deletion, Searching, Concatenation of singly linked lists, Circularly linked lists-Operations for
Circularly linked lists, Doubly Linked Lists- Operations Insertion, Deletion, Searching.
Unit- II (8 Contact hours)
Stack ADT, definition, operations, array and linked implementations in C, applications-infix to
postfix conversion, Postfix expression evaluation, recursion implementation, Queue ADT,
definition and operations, array and linked Implementations in C, Circular Queues-Insertion and
deletion operations, Deque (Double ended queue) ADT, array and linked implementations in C.
Unit- III (9 Contact hours)
Sorting-Insertion Sort, Selection Sort, Merge Sort, Quick sort, Heap Sort, Comparison of Sorting
methods and linear sorting algorithms-Counting sort, Radix sort, shell sort
Searching – Linear Search, Binary Search, Basic Concepts- Hashing Methods- Collision
Resolutions- Open Addressing- Linked List Collision Resolution- Bucket Hashing
Unit- IV (6 Hrs)
Trees – Terminology, Representation of Trees, Binary tree ADT, Properties of Binary Trees, Binary
Tree Representations-array and linked representations, Binary Tree traversals, Max Priority Queue
ADT-implementation-Max Heap-Definition, Insertion into a Max Heap, Deletion from a Max Heap,
Min-Heap-Operations on Min-Heap.
Unit- V (9 Contact hours) Search
Trees-Binary Search Trees, Definition, Operations- Searching, Insertion and Deletion, AVL Trees-
Definition and operations on AVL Tree, Red Black Trees, Trie Tree, B and B+ -Trees.
Unit- VI (6 Contact hours)
Graphs – Introduction, Definition, Terminology, Graph ADT, Graph Representations- Adjacency
matrix, Adjacency lists, Graph traversals – DFS and BFS. Applications of DFS and BFS-
Connected Components, Topological sort.
Text Books:
1. R. Thareja “Data Structures using C” , Oxford University Press.
2. M. A. Weiss “Data structures and Algorithm Analysis in C “ , 2nd edition, Pearson.
References
1. Narsimha Karumanchi “Data Structures and Algorithms made easy in C”, 2nd Edition,
Career Monk Publications.
2. Allen Weiss, “Data Structures and Algorithms Analysis in C”, Pearson, 2nd Edition
Web resources:
1. Indian Institute of Technology, Madras , “Programming and Data Structures”, URL:
https://nptel.ac.in/courses/106106130/
2. Indian Institute of Technology, Delhi, ‘Data Structures and Algorithms’,
https://nptel.ac.in/courses/106102064/
Course outcomes: At the end of the course, the student will be able to
***********************************************************************
Experiments list
1. Laser Diffraction
2. Newton’s Ring expt
3. Polarimeter.
4. Ultrasonic interferometer
5. Hall Effect
6. Frank Hertz
7. Photo electric Effect
8. Energy Band Gap of a Semiconductor
9. Solar cells
10. Optical fiber
Course outcomes: At the end of the course, the student will be able to
CO 1 Student will able to understand the diffraction of grating by laser light
1. To build software development skills using java programming for real-world applications.
2. To understand and apply the concepts of classes, packages, interfaces, arraylist, User
defined Linked List, File Handling, exception handling and Multi-threading.
3. To develop applications using AWT programming and event handling.
List of Experiments:
1. Lab No 1: Basic Programs in JAVA
2. Lab No 2: Programming Assignments on Arrays and Strings
3. Lab No 3: Programming Assignments on Classes, Objects and Encapsulation
4. Lab No 4: Implementing the concepts of Inheritance and Array Objects
5. Lab No 5: Implementing the OOPS Concepts of Abstract, Interfaces and Polymorphism
6. Lab No. 6: Programming Assignments on File Handling
7. Lab No. 7: Programming Exercises on Exception Handling
8. Lab No 8: Working with List Operations
9. Lab No 9: Implementing the concepts of Multi-Threading
10. Lab No 10: Programming Exercises on Event Handling
Course Outcomes
At the end of the course, the student will be able to
CO 1 Understanding the control structures and conditional statements in Java
CO 2 Understanding the arrays and String handling in java
CO 3 Understanding the difference between class and object and providing security
for objects
CO 4 Understanding the reusability of objects and working with multiple objects
CO 5 Understanding about hiding the data, getting multiple inheritance through
interfaces
CO 6 Understanding the data processing from files
CO 7 Understanding about handling run time abnormal program executions
CO 8 Understanding about creating user defined linked list and dynamic objects
CO 9 Understanding the multi-threaded programming and inter thread
communication
CO 10 Understanding about GUI creation
Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
Course Objectives:
1. To develop skills to design and analyze simple linear and non-linear data structures
2. To strengthen the ability to identify and apply the suitable data structures for the given real-
world problem
3. To gain knowledge in practical applications of data structures.
List of Experiments:
1. Write a C program that uses functions to perform the following:
a) Create a singly linked list of integers.
b) Delete a given integer from the above linked list.
c) Display the contents of the above list after deletion.
2. Write a C program that uses functions to perform the following:
a) Create a doubly linked list of integers.
b) Delete a given integer from the above doubly linked list.
c) Display the contents of the above list after deletion.
3. Write a C program implement the Stack ADT using Arrays and Linked List.
4. Write a C program that uses stack operations to convert a given infix expression into its postfix
equivalent.
5. Write a C program that evaluates a postfix expression.
6. Write C program to implement queue ADT using array and doubly linked list.
7. a) Write C program to implement priority queue ADT using array.
b) Write C program to implement circular queue ADT using array.
8. Write C program for implementing the following sorting methods:
b) Insertion sort b) Merge sort
9. Write C program for implementing the following sorting methods:
b) Quick sort b) Selection sort
Course Outcomes:
At the end of this lab session, the student will
CO 1 Be able to design and analyze the time and space efficiency of the data
structure
CO 2 Be capable to identity the appropriate data structure for given problem
CO 3 Have practical knowledge on the application of data structures
Assessment Method
Assessment Experiment Report/Viva-Voce/
Total
Tool s Quiz/MCQ/Lab project
Weightage (%) 25% 15% 40%
UNIT-VIII
Field Work
Visit to a local area to document environment assets river / forest / grassland / hill / mountain. Visit
to a local polluted site-urban/rural/industrial/agricultural. Study of common plants, insects, birds.
Study of simple ecosystems-pond, river, hills lopes, etc (field work equal to 5 lecture works)
Learning resources
Text book:
1. ErachBharucha, ‘Textbook of Environmental studies’, UGC
Reference Books:
Clark RS, ‘Marine Pollution’, Clanderson Press, Oxofrd (TB).
De AK, ‘Environmental Chemistry’, Wiley Eastern Ltd.
Course Outcomes: At the end of the course, the student will be able to
After successful completion of the course, the learners would be able to bring
CO 1 about an awareness of a variety of environmental concerns.
It attempts to create a pro-environmental attitude and a behavioral pattern in
CO 2
society that is based on creating sustainable lifestyles.
Assessment Method
Assessment
Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
Learning resources
Text book:
1. William W. Hines and Douglas C. Montgomery, ‘Probability and Statistics in Engineering’,
Willy Publications, 4th Edition.
Reference Books:
1. Sheldon Ross, ‘A First Course in Probability’, Pearson Publications, 9th Edition.
2. Athanasios Papoulis and S. Unnikrishna Pillai, ’Probability, Random Variables and Stochastic
Processes’, TMH, 4th Edition,.
Web resources:
1. https://nptel.ac.in/courses/117105085/
2. https://nptel.ac.in/courses/111106112/
3. https://nptel.ac.in/courses/111102111/
4. RGUKT Course Content
Course outcomes: At the end of the course, the student will be able to
CO 1 Apply Probability theory via Bayes Rule.
CO 2 Describe the properties of Discrete and Continuous distributions.
CO 3 Apply problem-solving techniques to solving real-world events.
CO 4 Apply selected probability distributions to solve problems.
Develop problem-solving techniques needed to accurately calculate
CO 5
probabilities.
CO 6 Interpret and clearly present output from statistical analysis.
Text Books:
Hopcroft, J D Ullman “Introduction to Automata and Language Theory”, 3rd Edition, 2006
C. Papadimitrou and C. L. Lewis. Elements of Theory of Computation, Prentice-Hall, 1981.
Reference Books:
John.C.Martin, “Introduction to Languages and the Theory of Computation” McGraw-Hill
Education, 01- May-2010.
Kamala Krithivasan, Rama.R, “Introduction to Formal Languages, Automata Theory and
Computation”, Pearson Education India, 01-Sep-2009
Web Resources
Indian Institute of Technology, Guwahati, “ Formal Languages and Automata
Theory”, https://nptel.ac.in/courses/111103016/
Course outcomes: At the end of the course, the student will be able to
CO 1 Construct finite state diagrams while solving problems of computer science
CO 2 Ability to convert NFA to DFA and Epsilon NFA to DFA
CO 3 Ability to convert RE to Finite Automata and vise versa
CO 4 Design of new grammar and language
CO 5 Ability to design PDA and NPDA
Ability to learn design of Turing machine and Find solutions to the problems
CO 6
using Turing machines
Course Content
Unit-I (8Contact hours)
Number systems-Representations-Conversions, error detection and error correction, Boolean
constants and variables, basic gates: operation and truth tables, describing logic gates algebraically,
evaluating logic circuit outputs, implementing circuits from Boolean expressions, universality of
gates, Boolean theorems
Unit-II (8 Contact hours)
Combinational circuit minimization using Boolean laws and karnaugh maps, multilevel synthesis,
logic levels and noise margins. Single bit adders and subtractors, parallel adders, multi-bit
subtraction using adders, signed multiplier, unsigned multiplier
Unit-III (6 Contact hours)
Decoders, Encoders, Multiplexers, Demultiplexers. Realization of various functions using
Decoders, Multiplexers. Priority encoders ,IC 74x148
Unit-IV (7 Contact hours)
Bistable elements, Latches and Flip-flops : S-R latch, D latch, J - K Flipflop, D Flipflop,
master/slave flip-flop, edge triggered J-K flip-flop with asynchronous inputs, T flip-flops.
Excitation tables, Characteristic tables, Characteristic equations
Unit-V (8Contact hours)
Frequency division and counting. Design and analysis of synchronous counters, asynchronous
counters. State diagrams for D-flipflop, T-Flip flop, J-K Flip flop, Mealy machines and Moore
machines.
Unit-VI (8Contact hours)
Design and display of mobile number using synchronous and asynchronous counters, design and
display of digital clock using synchronous and asynchronous counters.
Learning Resources:
Text books:
1. Ronald J Tocci, Neal S.Widmer, Gregory L.Moss,'Digital systems' Pearson 10 th edition.
2. Stephen Brown, Zvonko Vranesic,'Fundamentals of Digital Logic with Verilog Design',
TMH, 2nd edition
Reference books
1. John F.Wakerly, 'Digital Design' , Pearson 4th edition
Web Resources
1. Prof. Shankar Balachandran, NPTEL-IIT Madras, 'Digital Circuits & Systems'
URL: https://nptel.ac.in/courses/117106114/
2. Prof. S Srinivasan, NPTEL-IIT Madras, 'Digital Circuits and Systems'
URL: https://nptel.ac.in/courses/117106086/
Course Outcomes
At the end of the course, the student will be able to
CO 1 Apply the knowledge of simplification in obtaining optimal digital circuits
CO 2 Employ Boolean algebra to describe the function of logic circuits
CO 3 Design circuits which represent digital logic expressions. Specifically, design a
gate-level digital circuit to implement a given Boolean function
CO 4 Study and examine the SSI, MSI, LSI and Programmable elements
CO 5 Analyse the operation of synchronous and asynchronous state machines
CO 6 Design any combinational or sequential digital circuits to meet the given
specifications
CO 6 Analyse any digital circuit and to debug such circuit
CO 7 Prototype a real time application on EDA tool
Assessment Method
Weekly
tests/Assignment Monthly tests End Semester
Assessment Tool Total
s (In semester) Test
(In semester)
Weightage (%) 10% 30% 60% 100%
***************************************************************************
Course
Course code Course name L-T-P Credits
category
Design & Analysis of
CS2101 PCC 3-1-0
Algorithms 4
Learning resources
Text Books:
Thomas H.Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein , “Introduction to
Algorithms”.
Reference Books:
3. SatrajSahni and Rajasekharam,“Fundamentals of Computer Algorithms”,
4. Galgotia publications pvt. Ltd.
5. ParagHimanshu Dave, HimanshuBhalchandraDave,”Design and Analysis
algorithms”,Publisher: Pearson.
6. R.C.T.Lee, S.S.Tseng, R.C.Chang and T.Tsai, McGraw Hill “Introduction to Design and
Analysis of Algorithms A strategic approach”
7. Allen Weiss “Data structures and Algorithm Analysis in C++”, Second edition,
8. Pearson education.
9. Aho, Ullman and Hopcroft “Design and Analysis of algorithms” Pearson education.
Web Resources
1.https://www.oreilly.com/library/view/design-and-analysis/9788177585957/
2.https://www.tutorialspoint.com/design_and_analysis_of_algorithms
3.https://www.amazon.in/Design-Analysis-Algorithms-V-Muniswamy/dp/9380026730
Course outcomes: At the end of the course, the student will be able to
CO 1 Synthesize efficient algorithms in common engineering design situations.
Major techniques for algorithm design and analysis are introduced through the
CO 2
study of various algorithms.
CO 3 Apply design principles and concepts to algorithm design
CO 6 Analyze the efficiency of algorithms using time and space complexity theory
Assessment Method
Assessment
Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
***************************************************************************
Course
Course code Course name L-T-P Credits
Category
CS2202 Database Management Systems PCC 3-0-0 3
Unit VI (9 Hours)
Transaction concept, ACID properties, Concurrency in a DBMS, Serializability and Recoverability,
Concurrency control Protocols (lock-based and time-stamp based)
Text Books
A. Silberschatatz, H. F. Korth and S. Sudarshan, Database System Concepts, 5/e, McGraw
Hill,2006
R. Ramakrishnan and J. Gehrke, Database System Concepts, 3/e, McGraw Hill, 2003
Wilfried Lemahieu, Seppe Vanden Broucke and Bart baesens Principles of Database Management
Systems, 1/e Cambridge 2018
Reference Books
Ramez Elmasri, Shamkant B. Navathe , Fundamentals of Database (7th Edition), Paperback, 2007
Theorey T J, Database Modeling & Design, 2/e, Morgan Kaufmann Publishers, 1994.
H. GarciaMolina, J. D. Ullman and J. Widom, Database Systems The Complete Book, 1/e, Pearson
Education, 2007
Web resources:
Department of CS&E, IIT M, “Introduction to Database Sytems and Design”,
https://nptel.ac.in/courses/106106095/
Indian Institute of Technology, Kharagpur, “ Database Management Systems”,
https://nptel.ac.in/courses/106105175/
Course outcomes: At the end of the course, the student will be able to
CO 1 Demonstrate the basic elements of a relational database management system,
CO 2 Ability to identify the data models for relevant problems.
Ability to design entity relationship and convert entity relationship diagrams
CO 3
into RDBMS and formulate SQL queries on the respect data.
CO 4 Apply normalization for the development of application software
CO 5 Ability to learn about Disk Management, Buffer management
CO 6 Ability learn about transaction management
For Theory courses only:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
List of Experiments:
1. Lab No 1: Implementation and Analysis of Sorting Algorithms – Quick Sort, Merge Sort &
Heap Sort
2. Lab No 2: Warshalls Algorithms – Applying to Topological Ordering of vertices in a given
digraph and computing the transitive closure of given directed graph
3. Lab No 3: Implement 0/1 Knapsack Problem using Dynamic Programming
4. Lab No 4: Shortest Paths Algorithms : All Pair Shortest Path algorithms – Floyds Algorithm
and other algorithms
5. Lab No 5: Implement any scheme to find the optimal solution for the Travelling Salesman
Problem
6. Lab No 6: Implement Minimum Spanning Tree Algorithms – Prims Algorithms and Kruskal
Algorithm
7. Lab No 7: Single Source Shortest Path Algorithms and other Graph Algorithms like
connected components
8. Lab No 8: Implement the Sum of Subsets Problem
9. Lab No 9: Implementation of any scheme to solve the SUDOKU puzzle
10. Lab No 10: Implement N Queens Problem using the Back Trackin
Course Outcomes
At the end of the course, the student will be able to
CO 1 To analyze asymptotic notation and worst, average and best case analysis using
suitable mathematical tools.
CO 2 To design efficient algorithms for computational problems using appropriate
algorithmic paradigm.
CO 3 To understand different graph algorithms and traversal problems.
CO 4 To analyze the complexity of different class of problems.
CO 5 To explain the role of randomization and approximation in computation
Assessment Method
Course Nature Practical
Assessment Method
Assessment Tool Experiment Record Viva-Voce/ Total
s Quiz/MCQ/Lab project
Weightage (%) 25% 5% 10% 40%
End Semester Examination weightage (%) 60%
***************************************************************************
Course Code Course Name Course Category L-T-P Credits
CS2189 Digital Logic Design Lab ESC 0-0-3 1.5
List of Experiments
1. Familiarization with logic gate IC’s and Arduino kits
2. Design of code converters and comparators (8-bit) on bread board
3. Adder related experiments: Half adder , full adder , half subtractor, full subtractor , ripple
carry adder, BCD adder, carry look ahead adder using IC
4. Design of a binary multiplier and displaying its inputs and outputs on seven segment display
unit
5. Familiarization with multiplexer, decoder, encoder. Design of Half adder, full adder,
magnitude comparator and other examples using above familiarized components
6. Bi-stable multi-vibrator design. Design and verification of SR,JK,D,T latch/flip-flops.
Verification and elimination of Race Around Condition
7. Flip-flop
conversions and Design of frequency dividers
8. Design of synchronous counters (Up and Down) and displaying result on seven segment
display unit
9. Design of Mod n ≤ 2n counter design( total 8 states, design of mod6 and mod7 with clear
10. Design and IC verification of Decade counter
11. Cascading of counters
12. Synchronous counter design and displaying result on seven segment display unit
13. Random sequence
14. Ring counter/Johnson counter
15. Verification and analysis of ALU IC
16. Design of a digital clock in synchronous state machine design and in asynchronous state
machine design
17. Design and submission of term project
Note:
1. All the above experiments (except few exceptional cases) are to be implemented on Arduino
kits also.
2. It is mandatory to perform experiment on any one of the EDA Tools before the experiment is
done on hardware. All experiments must be unique, design specifications should not be
common in the lab
Course outcomes:
After the completion of this Laboratory course, the student will be able to
CO 1 Understand the implementation of discrete digital components
CO 2 Utilize the ICs of Decoder, Multiplexer, Seven segment display unit in
combination circuit design
CO 3 Utilize the ICs of suitable Flipflops in sequential circuit design
CO 4 Utilize the Programmable Logic devices in digital design
CO 5 Understand the concepts of setup time, hold time, propagation delays
CO 6 Design circuits with optimal features of Area, Power and delay
CO 7 Design and implement prototypes of complete digital systems
Assessment Method
Assessment Tool Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
Course Objectives:
1. Analyze the problem and identify the Entities and Relationships, keys for given database.
2. Design, develop and query a database.
3. Able to construct queries and maintain a simple database using MySQL.
4. Normalization of data present in database tables.
5. Develop triggers programs using PL/SQL.
List of Experiments:
1. Designing the Database through Identifying Entities, Relationship Attributes.
MySQL
1. Queries to facilitate acquaintance of Built-In Functions, String Functions, Numeric
Functions,
2. Queries to facilitate acquaintance of Date Functions and Conversion Functions.
3. Queries for Creating, Dropping, and Altering Tables
4. Queries using operators in SQL
5. Queries to Retrieve and Change Data: Select, Insert, Delete, and Update
6. Queries using Group By, Order By, and Having Clauses
7. Queries on Controlling Data: Commit, Rollback, and Save point
8. Queries for creating Views, and Constraints
9. Queries on Joins ( Outer and Inner joins)
10. Queries on Correlated Sub-Queries
PL/SQL
1. Write a PL/SQL Code using Basic Variable, Anchored Declarations, and Usage of
Assignment Operation
2. Write a PL/SQL block using SQL and Control Structures in PL/SQL
3. Write a PL/SQL Code using Cursors, Exceptions and Composite Data Types
4. Write a PL/SQL Code using Procedures, Functions, and Packages FORMS
Course Outcomes:
After completing this course the student must demonstrate the knowledge and ability to:
CO 1 Identify the entities, attributes, relationships, keys for given database.
CO 2 Design a database schema for given problem.
CO 3 Formulate queries using MySQL DML, DDL commands.
CO 4 Formulate SQL queries using constraints and set comparison operators.
CO 5 Apply the normalization techniques for development of application software
to realistic problems.
CO 6 Develop PL/SQL programs using triggers, procedures
CO 7 Ability to design and implement given case study.
Course Course
Course name L-T-P Credits
code Category
CS2201 COMPUTER ORGANIZATION
PCC 3-0-0 3
AND ARCHITECTURE
Course content:
UNIT-I
Basic Functional blocks of a computer: CPU, memory, input -output subsystems, control unit.
Data Representation: Number systems, signed number representation, fixed and floating point
representations, character representation.
UNIT-II
ALU: Computer Integer Arithmetic: addition, subtraction, multiplication, division, floating point
arithmetic: Addition, subtraction, multiplication, division.
Instruction set architecture of a CPU registers, instruction execution cycle, RTL interpretation of
instructions, addressing modes, instruction set. RISC and CISC architecture. Case study instruction
sets of some common CPUs.
UNIT-III
CPU control unit design: Introduction to CPU design, Processor Organization, Execution of
Complete Execution, Design of Control Unit: hardwired and micro-programmed control, Case
study design of a simple hypothetical CPU.
UNIT-IV
Memory system design: Concept of memory: Memory hierarchy, SRAM vs DRAM ,Internal
organization of memory chips , cache memory: Mapping functions, replacement algorithms,
Memory management, virtual memory.
UNIT-V
Input -output subsystems, I/O transfers: programmed I/O, interrupt driven and DMA.
I/O Buses, Peripheral devices and their characteristics, Disk Performance
UNIT-VI
Performance enhancement techniques: Pipelining: Basic concepts of pipelining,
Through put and speedup, pipeline hazards.
Parallel processing: Introduction to parallel processing, Introduction to Network, Cache coherence
Text Books:
V. C. Hamacher, Z. G. Vranesic and S. G. Zaky, “Computer Organization,” 5/e, McGraw Hill,
2002.
William Stallings, “Computer Organization and Architecture”: Designing for Performance, 8/e,
Pearson Education India. 2010.
Morris Mano, “ Computer System Architecture”, Pearson Education India, Third edition.
References:
A. S. Tanenbaum, “Structured Computer Organization”, 5/e, Prentice Hall of India,
2009.
D. A. Patterson and J. L. Hennessy, “Computer Organization and Design,” 4/e,
Morgan Kaufmann, 2008.
J. L. Hennessy and D. A. Patterson,” Computer Architecture: A Quantitative
Approach",4/e, Morgan Kaufmann, 2006.
D. V. Hall, “Microprocessors and Interfacing”, 2/e, McGraw Hall, 2006
“ 8086 Assembler Tutorial for Beginners “By Prof. Emerson GiovaniCarati.
Web referneces:
https://en.wikibooks.org/wiki/IB/Group_4/Computer_Science/Computer_Organisation
http://www.cs.uwm.edu/classes/cs458/Lecture/HTML/ch05.html
http://www.cse.iitm.ac.in/~vplab/courses/comp_org.htm
OA IIT-Guwahati Pdf
Course outcomes: At the end of the course, the student will be able to
CO1 Understand the basic organization of computer and different instruction formats
and addressing modes.
CO2 Analyze the concept of pipelining, segment registers and pin diagram of CPU.
CO3 Understand and analyze various issues related to memory hierarchy.
CO4 Evaluate various modes of data transfer between CPU and I/O devices.
CO5 Examine various inter connection structures of multi processors.
For Theory courses only:
Course Nature Theory
Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
Data Science using Python
Course
Course name L-T-P Credits
Course code Category
Data Science with Python PCC 3-1-0 3
CSXY02
Assessment Method:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool (In semester) (In semester)
Weightage (%) 10% 30% 60% 100%
Course Code Course Name Course Category L-T-P Credits
Authentication: Google OAuth: Basic Steps. Access to Google APIs: For Server-side Web apps,
for Java Script Web apps, for Mobile & Desktop apps
jQuery: Introduction, Selectors, Attributes, Event Handlers, Style Methods, Traversing the DOM,
Effects, and Introduction to jQuery Plugins
UNIT V (7Contact hours)
Bootstrap: Introduction to Bootstrap, Responsive Design, Bootstrap Grid system, Navigation and
Navigation Bar, Icon Fonts, User Inputs, Bootstrap CSS Components, Bootstrap and JavaScript
Components, Bootstrap and JQuery, Building and Deployment, NPM Scripts, Task Runners
Learning resources:
Text Books
Reference Books
Web Resources
https://www.w3schools.com/
https://www.tutorialspoint.com/web_development_tutorials.htm
https://html.com/
https://www.coursera.org/learn/bootstrap-4
https://www.tutorialspoint.com/jquery/index.htm
https://www.tutorialspoint.com/nodejs/
http://www.ntu.edu.sg/home/ehchua/programming/java/javaservlets.html
http://wiki.lib.sun.ac.za/images/0/07/Bootstrap-tutorial.pdf
https://media.readthedocs.org/pdf/htmlguide/latest/htmlguide.pdf
Course outcomes: At the end of the course, the student will be able to
CO 1 Learn how to design, add client side script and publish web page
CO 2
Learn how to write server side programming and deploy the app into a server.
CO 3
Learn how to store data into database and NoSQL.
CO 4
Learn about Front-End Web UI Frameworks and GIT repository Tools.
CO 5
Learn about responsive Web design.
CO 6
Learn about Package manager and Web modules.
Course
Course
Course Name Categor L–T- P Credits
Code
y
EG2282 English-II Laboratory HSC 0L: 0T: 3 P 1.5 credits
learning.
2. To help the students cultivate the habit of reading passages from the computer monitor, thus
providing them with the required facility to face computer-based competitive exams such
3. To enable them to learn better pronunciation through stress on word accent, intonation, and
rhythm.
4. To initiate them into greater use of the computer in resume preparation, report writing,
Unit 1
2. Speaking
2.1 British Council – A 2 – Modules – 6-10 – Text Material
2.2 At The Post Office – Spoken English – EFLU
3. Reading
3.1 Vocabulary Skills
4. Writing
4.1 Curriculum Vitae
4.2 E- Correspondence
5. Essential English Grammar
5.1 I – me – mine – myself ( 59-63)
5.2 Kate’s camera – ( 64)
5.3 a/an and some – (65-68)
5.4 a/an and the – (69-73)
5.5 Some – any – no – none – (76-77)
7. Life Skills – Mega living! Achieving Mastery of the mind, body and
character
6.1 The Ultimate Challenge
Unit 2
2. Speaking
2.1 British Council – A 2 – Modules – 11-15 – Text Material
2.2 At The Doctor’s – Spoken English – EFLU
3. Reading
3.1 Eye Reading and Visual Perception
3.2 Prediction Techniques
4. Writing
4.1 Note Making
7. Life Skills – Mega living! Achieving Mastery of the mind, body and
character
6.1 The Power of Limitless Living
Unit 3
2. Speaking
2.1 British Council – A 2 – Modules – 16-20 – Text Material
2.2 Buying A Shirt – Spoken English – EFLU
3. Reading
3.1 Scanning Skills
3.2 Skimming Skills
4. Writing
4.1 Report Writing
5. Essential English Grammar
5.1 old – nice- interesting – quickly – badly – suddenly - (85 -86)
5.2 older (than) – the oldest – not as old as – (87-90)
5.3 enough and too – (91-92)
5.4 word order – (93-95)
5.5 and – but – or – because – when … - (97 - 98)
7. Life Skills – Mega living! Achieving Mastery of the mind, body and
character
6.1 The Promise of Mega Living
Unit 4
2. Speaking
2.1 British Council – B1 – Modules – 1-5 – Text Material
2.2 At The Market – Spoken English – EFLU
3. Reading
3.1 Intensive Reading Skills
4. Writing
4.1 Expansion Of Proverbs And Other
7. Life Skills – Mega living! Achieving Mastery of the mind, body and
character
7.1 Excelling With The and Igniting Yourself
Unit 5
2. Speaking
2.1 British Council – B 1 – Modules – 6-10 – Text Material
2.2 In The Library– Spoken English – EFLU
3. Reading
3.1 Reading Practice Exercises
4. Writing
4.1 Describing Pictures
7. Life Skills – Mega living! Achieving Mastery of the mind, body and
character
7.1 Your Mind And Its Unlimited Potential – Your Commitment To Self
Mastery:Kaizen
Resources
Text
1. British Council A2 Level Book
2. Spoken English : A Self Learning Guide To conversation Practice –
By: V.Sasi Kumar
PV Dhamija
3. Effective Technical Communication
By: M Ashraf Rizvi
4. English For Empowerment
By: G. Damodar
D. Venkateshwarlu
M. Narendra
M. Sarath Babu
GM. Sundaravalli
5. Mega Living
By: Robin Sharma
6. Raymond Murphy: Essential English Grammar: A Self-Study Reference and
Practice Book (CUP)
7. A Communicative Grammar of English – Geoffrey Leech and Jan Svartvik
Web
1. https://learnenglish.britishcouncil.org/beginner-a1-listening/request-your-boss
2. https://learnenglish.britishcouncil.org/beginner-a1-listening/voicemail-message
3. https://learnenglish.britishcouncil.org/beginner-a1-listening/booking-table
4. https://learnenglish.britishcouncil.org/beginner-a1-listening/business-cards
5. https://learnenglish.britishcouncil.org/beginner-a1-listening/finding-library
6. https://learnenglish.britishcouncil.org/beginner-a1-listening/meeting-new-team-member
7. https://learnenglish.britishcouncil.org/beginner-a1-listening/meeting-other-students
8. https://learnenglish.britishcouncil.org/beginner-a1-listening/meeting-people-dinner
9. https://learnenglish.britishcouncil.org/beginner-a1-listening/ordering-caf
10. https://learnenglish.britishcouncil.org/beginner-a1-listening/organising-group-project
Assessment Method
Course Outcomes
At the end of the course, the student will be able to
CO 1 Understand the basic logic gates
CO 2 Understand the full adder and full subtractor
Ripple Carry Adder
CO 3
examine the behavior of the working module to understand how the carry ripples
through the adder stages
to design a ripple carry adder using full adders to mimic the behavior of the working
module .
Carry Lookahead Adder
understand the behaviour of carry lookahead adder
understand the concept of reducing computation time with respect of ripple carry
adder by using carry generate and propagate functions
Combinational Multipliers
understand the behaviour of combinational multiplier .
understand the scheme implemented for the multiplication.
it can be designed by unrolling the multiplier loop
CO4
instead of handling the carry out of partial product summation bit,the carry out can
be sent to the next bit of the next step
this scheme of handling the carry is called carry save addition
Booth’s Multiplier
Understand the behaviour of Booth's multiplication.
Design Booth's multiplier with a controller and a datapath. This will also help in the
learning of control unit design as a finite state machine
Understand the advantages of Booth's multiplier
CO 5
It can handle signed integers in 2's complement notion
It decreases the number of addition and subtraction
It requires less hardware than combinational multiplier
It is faster than straightforward sequential multiplier
to examine the behavior of different modes of data input and data output(serial-in
serial-out, serial-in parallel-out, parallel-in serial out,parallel-in parallel-out)
CO8 to make use of shift register in data transfer
developing skills in the designing and testing of sequential logic circuits
developing skills in analysing timing signals.
Counters
understand the concept of counting upto certain limiting value and returning back to
the start state from final state
understand the generation of timing sequences to control operations in a digital
system
develop skills in the design and testing of counters for given timing sequences
develop skills in generating timing signals .
Memory Design
CO 9 Understand the behavior of memory.
Design memory for given parameter.
Direct Mapped Cache Design
CO 10 Understand the behavior of direct mapped cache from working module
Design a direct mapped cache for given parameters.
Associative Cache Design
CO 11 Understand the behavior of associative cache.
Designs a associative cache for given parameters.
Understand and develop Assembly Language Programs
Assessment Method
Assessment Tool Experiment Record/Viva-Voce/ Quiz/MCQ/Lab Total
s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
Course
Course name L-T-P Credits
Course code Category
Data Science using Python Lab 0-0-3 1.5
CSXY02
Lab:
Experiment 1:
a) Python Basics: Your first program, Types Expressions and Variables String Operations
b) Python Data Structures: Lists and Tuples Sets,and Dictionaries
c) Python Programming Fundamentals: Conditions and Branching Loops, Functions,
Objects and Classes
d) Working with Data in Python: Reading files with open, Writing files with open,
Loading data with Pandas, Working with and Saving data with Pandas
e) Working with Numpy Arrays: Numpy 1d Arrays, Numpy 2d Arrays
Experimen 2:
a) Importing Datasets: Learning Objectives, Understanding the Domain, Understanding
the Dataset, Python package for data science, Importing and Exporting Data in Python, Basic
Insights from Datasets
b) Cleaning and Preparing the Data: Identify and Handle Missing Values, Data
Formatting, Data Normalization Sets, Binning, Indicator variables
c) Model Development: Simple and Multiple Linear Regression, Model
EvaluationUsingVisualization, Polynomial Regression and Pipelines, R-squared and MSE for In-
Sample Evaluation, Prediction and Decision Making
d) Summarizing the Data Frame: Descriptive Statistics, Basic of Grouping, ANOVA,
Correlation, More on Correlation
e) Model Evaluation: Model Evaluation, Over-fitting, Under-fitting and Model Selection,
Ridge Regression, Grid Search, Model Refinement
Experiment 3:
a) Introduction to Visualization Tools: Introduction to Data Visualization,Introduction to
Matplotlib, Basic Plotting with Matplotlib,Dataset on Immigration to Canada, Line Plots
b) Basic Visualization Tools: Area Plots,Histograms,Bar Charts
c) Specialized Visualization Tools: Pie Charts, Box Plots, Scatter Plots, Bubble Plots
d) Advanced Visualization Tools: Waffle Charts, Word Clouds,Seaborn and Regression
Plots
Expeiment 4:
a) Introduction to Machine Learning: Applications of Machine Learning, Supervised vs
Unsupervised Learning, Python libraries suitable for Machine Learning
b) Regression: Linear Regression, Non-linear Regression, Model evaluation methods
c) Classification: K-Nearest Neighbour, Decision Trees, Logistic Regression, Support
Vector Machines,Model Evaluation
d) Unsupervised Learning:K-Means Clustering,Hierarchical Clusterin, Density-Based Clustering
Course code Course name Course Category L-T-P Credits
CS2283 Web Technologies Lab PCC 0-0-3 1.5
List of Experiments:
1. Install and configure the IDE
2. Incorporating JavaScript on an HTML page, and how to link to an external .js file
3. Comparing JavaScript with jQuery for same tasks
4. Using major methods/events in jQuery
5. Using Plugins and local data storage
6. Implement Bootstrap in existing web sites
7. Common Bootstrap components and use Bootstrap themes
8. Setup a Node.js project using npm
9. Use the Node.js core modules
Course Outcomes
At the end of the course, the student will be able to
COInstall
1 and configure the IDE
COIncorporating
2 JavaScript on an HTML page, and how to link to an external .js file
CO 3 Comparing JavaScript with jQuery for same tasks
COUsing
4 major methods/events in jQuery
COUsing
5 Plugins and local data storage
CO 6 Implement Bootstrap in existing web sites
COCommon
7 Bootstrap components and use Bootstrap themes
COSetup
8 a Node.js project using npm
COUse
9 the Node.js core modules
CO 10 ting Servlet application and deploying application in web server
Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
Course Content:
Unit - I (6 Contact Hours)
Basics: Evaluation, definition, Operating System Functionalities, Types of Operating Systems,
Computer Architecture support to Operating Systems: Kernel and user mode. Introduction to
Systems calls.
Learning Resources
Text book:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne,”Operating System Concepts”,
John Wiley & Sons Inc., 6th Edition.
6. William Stallings, “Operating System: Internals and Design Principles”, Pearson, 5th
Edition.
Reference Books:
1. Andrew S Tanenbaum, “Modern Operating Systems”, Pearson Prentice Hall, 4th Edition.
2. Systmes D M Dhamdhere, Operating Systems - System Programming and Operating, Tata
McGraw Hill
3. Gary Nutt, Operating Systems: A Modern Perspective, Addison Wesley, 2nd Edition.
Web resources:
1. PCP Bhattm, December 31 2009, Operating Systems, https://nptel.ac.in/courses/106108101/
Course outcomes: At the end of the course, the student will be able to
Identify the structure of OS and basic architectural components involved in OS
CO 1
design.
CO 2 Explain the Mutual exclusion, Deadlock Handling Methods
Design applications to simulate process scheduling and memory management
CO 3
algorithms.
CO 4 Differentiate the system functionalities in between old and modern OS
CO 5 Tell the need of protection and security in OS
*************************************************************************
Course Code Course Name Course Category L-T-P Credits
CS3102 Computer Networks PCC 3-0-0 3
Course Content:
Unit - I (7Contact hours)
Introduction: Network Hardware, Network Software, References Models. Physical Layer-Guided
medium and unguided medium , topologies.
Unit - II (8 Contact hours)
The Data Link Layer : Data link Layer Design Issues, Error Control.
Elementary Data Link Protocols, Sliding Window Protocols. The Medium Access Control
Sublayer: The Channel allocation Problem, Multiple Access protocols, Ethernet - Ethernet Cabling,
standard Ethernet , Switched Ethernet, Fast Ethernet.
Unit - III (9 Contact hours)
The Network Layer: Network Layer Design Issues, Routing Algorithms, Congestion Control
Algorithms. Internetworking,subnetting, The Network Layer in the Internet.
Unit - IV (7 Contact hours)
The Transport Layer: The Transport Service, Elements of Transport Protocols, The Internet
Transport Protocols: UDP, The Internet Transport Protocols: TCP.
Unit - V (7 Contact hours)
The Application Layer: DNS - The Domain Name System, Electronic Mail. The World Wide Web,
file transfer protocol Multimedia.
Unit – VI (7 Contact hours)
Network Security: Cryptography, Symmetric - Key Algorithms, Public - Key Algorithms, Digital
Signatures.
Learning resources
Text book:
6. Andrew S. Tanenbaum “Computer Networks”, 4e, Pearson Education.
7. Behrouz A. Forouzan “Data Communications and Networking”, 4e , Tata McGraw Hill.
8. W. Stallings, “Data and Computer Communication”, 8e, Pearson
Reference Books:
1. S. Kshev “An Engineering Approach to Computer Networks “, 2nd edition
2. W.A.Shay,Thomson “Understanding Communications and Networks”,3rd edition,
Web resources:
1. https://www.tutorialspoint.com/computer_fundamentals/computer_networking.htm
2. https://www.geeksforgeeks.org/computer-network-tutorials/
3.https://nptel.ac.in/courses/106105081/
Course outcomes: At the end of the course, the student will be able to
Assessment Method
Assessment
Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
**********************************************************************
Course Code Course Name Course Type L-T-P Credits
Course Outcomes: At the end of the course the students will be able to
CO1 Describe the software engineering lifecycle by demonstrating competence in
communication, planning, analysis, design, construction, and deployment
CO2 An ability to work in one or more significant application domain
CO3 To develop and deliver quality software by working as an individual and as part
of a multidisciplinary team
CO4 Demonstrate an understanding of and apply current theories, models, and
techniques that provide a basis for the software lifecycle
CO5 Deliver quality software products by possessing the leadership skills as an
individual or contributing to the team development and demonstrating effective
and modern working strategies by applying both communication and negotiation
management skill.
CO6 Apply new software models, techniques and technologies to bring out
innovative and novelistic solutions for the growth of the society in all aspects
and evolving into their continuous professional development.
For Theory courses only:
Course Nature Theory
Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
Course
Course name L-T-P Credits
Course code Category
Mathematical Foundations for Data
Science PCC 3-1-0 3
CSXY01
Unit 1:
LINEAR ALGEBRA BASICS- Vector spaces and subspaces, basis and dimensions,
linear transformation, four fundamental subspaces MATRIX THEORY- Norms and
spaces, eigenvalues and eigenvectors, Special Matrices and their properties, least
squared and minimum normed solutions.
Unit 2:
MATRIX DECOMPOSITION ALGORITHMS- SVD: Properties and applications, low
rank approximations, Gram Schmidt process, polar decomposition
Unit 3:
DIMENSIONS REDUCTION ALGORITHMS and JCF- Principal component analysis,
linear discriminant analysis, minimal polynomial and Jordan canonical form
Unt 4:
CALCULUS – Basic concepts of calculus: partial derivatives, gradient, directional
derivatives, jacobian, hessian, convex sets, convex functions and its properties
Unit 5:
OPTIMIZATION – Unconstrained and Constrained optimization, Numerical
optimization techniques for constrained and unconstrained optimization:
Newton’s method, Steepest descent method, Penalty function method
Unit 6:
PROBABILITY – Basic concepts of probability: conditional probability, Bayes’
theorem, independence, theorem of total probability, expectation and variance, few
discrete and continuous distributions, joint distributions and covariance.
Online Resorces:
Online cource: Essential Mathematics for Machine Learning:
https://nptel.ac.in/courses/111/107/111107137/
Course
Course Name Course Category L-T-P Credits
Code
CS3183 Operating System Lab PCC 0-0-3 1.5
Career Objectives:
5. To understand the design aspects of operating system.
6. To study the process management concepts & Techniques.
7. To study the paging and segmentation concepts.
8. To familiarize students with the Linux environment
List of Experiments:
1. Introduction to system calls – implementation of open(), creat(),close(), write(), read(), lseek()
2. Implementation of fork (), wait (), exec() and exit () system calls
3. Write a program to simulate the following non-preemptive CPU scheduling algorithms to find
turnaround time and waiting time.
a) FCFS b) SJF
4. Write a program to simulate the following preemptive CPU scheduling algorithms to find
turnaround time and waiting time.
a) Round Robin b) Priority
5. Write a program to simulate producer-consumer problem using multi-threading.
6. Write a program to simulate Bankers algorithm for the purpose of deadlock avoidance.
7. Write a program to simulate the following contiguous memory allocation techniques
a) Worst-fit b) Best-fit c) First-fit
8. Write a program to simulate paging technique of memory management.
9. Write a C program to simulate page replacement algorithms
a) FIFO b) LRU
10. Write a C program to simulate disk scheduling algorithms
a) FCFS b) SCAN c) C-SCAN
11. Study and practice of Unix/Linux general purpose utility command list
man,who,cat, cd, cp, ps, ls, mv, rm, mkdir, rmdir, echo, more, date, time, kill, history,
chmod, chown, finger, pwd, cal, logout, shutdown.
12. Write a C program that makes a copy of a file using standard I/O, and system calls
13. Write a C program to emulate the UNIX ls –l command.
14. Write a C program that illustrates how to execute two commands concurrently
with a command pipe.
Ex: - ls –l | sort
15. a) Study of Bash shell, Bourne shell and C shell in Unix/Linux operating system.
b) Study of Unix/Linux file system (tree structure).
c) Study of .bashrc, /etc/bashrc and Environment variables.
At the end of this lab session, the student will be able
Course Outcomes:
CO 1 To use Unix utilities and perform basic shell control of the utilities
CO 2 To use the Unix file system and file access control.
CO 3 To use of an operating system to develop software
CO 4 To use Linux environment efficiently
Assessment Method
Assessment Experiments Report/Viva-Voce/ Total
Tool Quiz/MCQ/Lab project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
*****************************************************************************
Course Code Course Name Course Category L-T-P Credits
List of Experiments:
2. Lab No 1: Understanding and using of commands like ifconfig, netstat, ping, arp, telnet, ftp,
finger, traceroute, whois etc..
3. Lab No 2: Understanding packet tracer and independent components in packet tracer
4. Lab No 3: Understanding the subnetting concept and types, Fixed Length subnet Masking
(FLSM)and Variable length subnet masking (VLSM).
5. Lab No 4: To implement Static Routing using FLSM & VLSM.
6. Lab No 5: To configure DHCP as a pool router & Service Server.
7. Lab No 6: To implement Dynamic Routing using RIP version 1
8. Lab No 6: To implement Dynamic Routing using RIP version 2
9. Lab No 7: To implement Dynamic Routing using OSPF single area network
10. Lab No 8: To implement Dynamic Routing using OSPF multi area network
11. Lab No 9: To implement NAT(Network Address Translation) ,PAT(Port Address
Translation)
12. Lab No 10: To implement VLAN
13. Lab No 11: Implementation of Socket program (Client server chat application using JAVA)
14. Lab No 12: Implementation FTP application to transfer multimedia
Course Outcomes
At the end of the course, the student will be able to
CO 1 Understand details and functionality of Network Devices and Network commands
Assessment Method
Assessment Experiments Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
**********************************************************************
Course Course
Course Name L-T-P Credits
Code Category
CS3182 Software Engineering Laboratory PCC 0-0-3 1.5
List of Experiments:
1. Identify the Objective and Abstract of the project based on the given Scenarios
2. Prepare Software Requirement Analysis document to respective project
3. Compute function point of the selected project
4. Prepare System Design & Architecture design
5. UML based design diagrams
6. Prepare Data Flow Diagrams of the selected project
7. Complete design part of the selected project
8. Design of the Test Cases of the selected project
9. On completion of coding prepare test cases and perform black-box testing , record the defects and
its time of identification
10. Do vulnerability analysis of the selected project
Course Outcomes
At the end of the course, the student will be able to
CO 1 Objective and Abstract of the project
CO 2 SRS document which contains detailed information about the given project
Design document which contains detailed diagrams of System design and
CO 3
System Architecture of the given project
Design document which contains detailed diagrams of Use case, Class,
CO 4
Sequence, Activity, State, State transition Diagrams
CO 5 E-R diagram, data-flow diagram, state-transition diagram for the project
Understanding about Unit testing, regression testing, integration testing,
CO 6
validation and system testing
Implementing the given project with Advanced Java programming according to
CO 7
MVC Architecture
Assessment Method
Assessment Experiments Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
***************************************************************************
Course Course
Course Name L–T-P Credits
Code Category
EG3184 English Lab III HSMC 0L: 0T: 3 P 1.5 credits
learning.
2. To help the students cultivate the habit of reading passages from the computer monitor, thus
providing them with the required facility to face computer-based competitive exams such
3. To enable them to learn better pronunciation through stress on word accent, intonation, and
rhythm.
4. To initiate them into greater use of the computer in resume preparation, report writing,
Unit 1
2. Speaking
2.1 British Council – B1 – Modules – 6-8 – Text Material
2.2 At The Tailors – Spoken English – EFLU
3. Reading
3.1 A Poster AT Work
3.2 A Poster For Exam Candidates
4. Writing
4.1 Learning About Collocations
5. Communicative Grammar
5.1 Intonation
7. Life Skills – Mega living! Achieving Mastery of the mind, body and
character
7.1 Your Mind And Its Unlimited Potential
7.2 The nature of The Mind-The Ultimate Super Power
Unit 2
3. Speaking
1. British Council – B1 – Modules – 9-11 – Text Material
2. At The Chemists– Spoken English – EFLU
4. Reading
1. A Message To a New Friend
2. An Email From a Friend
5. Writing
1. Grammatical Aspects of Collocations
6. Communicative Grammar
5.1 Intonation
8. Life Skills – Mega living! Achieving Mastery of the mind, body and character
6.1 Discipline And Will Power-The Golden Keys
Unit 3
2. Speaking
2.1 British Council – A 2 – Modules – 12-14 – Text Material
2.2 At The Railway Station– Spoken English – EFLU
3. Reading
3.1 An End of term report
3.2 An Invitation to a Job Interview
4. Writing
4.1 Special Aspects of Collocations
5. Communicative Grammar
5.1 Intonation
7. Life Skills – Mega living! Achieving Mastery of the mind, body and
character
6.1 The Feel Good Principle And Beliefs: How To Unleash vitality
Unit 4
2. Speaking
2.1 British Council – B1 – Modules – 15-17 – Text Material
2.2 At The Tea Stall – Spoken English – EFLU
3. Reading
3.1 Choosing a Conference Venue
3.2 English Course Prospectus
4. Writing
4.1 Travel and the Environment
5. Communicative Grammar
5.1 Intonation
7. Life Skills – Mega living! Achieving Mastery of the mind, body and
character
7.1 Mega Things And The Enhancement of Positivity
Unit 5
2. Speaking
2.1 British Council – B 1 – Modules – 18-20– Text Material
2.2 An Interview– Spoken English – EFLU
3. Reading
3.1 Professional Profile Summaries
3.2 Study Skills Tips
4. Writing
4.1 People and Relationships
5. Communicative Grammar
5.1 Intonation
6. Communicative Grammar
5.1 Intonation
8. Life Skills – Mega living! Achieving Mastery of the mind, body and
character
8.1 The Magic of Goals: Your Visions of Excellence
Resources
Text
4. British Council A2 Level Book
5. Spoken English : A Self Learning Guide To conversation Practice –
By: V.Sasi Kumar
PV Dhamija
6. English Collocations in Use – Michael Mc Carthy and Felicity O’Dell
7. Mega Living
By: Robin Sharma
8. A Communicative Grammar of English – Geoffrey Leech and Jan Svartvik
Web
Listening
2. https://learnenglish.britishcouncil.org/pre-intermediate-a2-listening/morning-briefing
3. https://learnenglish.britishcouncil.org/pre-intermediate-a2-listening/invitation-party
4. https://learnenglish.britishcouncil.org/pre-intermediate-a2-listening/changing-meeting-time
5. https://learnenglish.britishcouncil.org/pre-intermediate-a2-listening/changing-plans
6. https://learnenglish.britishcouncil.org/pre-intermediate-a2-listening/four-conversations
7. https://learnenglish.britishcouncil.org/pre-intermediate-a2-listening/leaving-message
8. https://learnenglish.britishcouncil.org/pre-intermediate-a2-listening/missing-class
9. https://learnenglish.britishcouncil.org/pre-intermediate-a2-listening/understanding-
explanation
10. https://learnenglish.britishcouncil.org/pre-intermediate-a2-listening/whos-who-office
11. https://learnenglish.britishcouncil.org/intermediate-b1-listening/phone-call-customer
Reading
3. https://learnenglish.britishcouncil.org/beginner-a1-reading/poster-work
4. https://learnenglish.britishcouncil.org/beginner-a1-reading/poster-exam-candidates
5. https://learnenglish.britishcouncil.org/pre-intermediate-a2-reading/message-new-friend
6. https://learnenglish.britishcouncil.org/pre-intermediate-a2-reading/email-friend
7. https://learnenglish.britishcouncil.org/pre-intermediate-a2-reading/end-term-report
8. https://learnenglish.britishcouncil.org/pre-intermediate-a2-reading/invitation-job-interview
9. https://learnenglish.britishcouncil.org/pre-intermediate-a2-reading/choosing-conference-
venue
10. https://learnenglish.britishcouncil.org/pre-intermediate-a2-reading/english-course-
prospectus
11. https://learnenglish.britishcouncil.org/pre-intermediate-a2-reading/professional-profile-
summaries
12. https://learnenglish.britishcouncil.org/pre-intermediate-a2-reading/study-skills-tips
Assessment Method
Course Content:
Unit 1: (10 Contact hours)
Introduction to security attacks, services and mechanism, introduction to cryptography -
Conventional Encryption: Conventional encryption model, classical encryption techniques -
substitution ciphers and transposition ciphers, cryptanalysis, stream and block ciphers ,Modern
Block Ciphers: Block ciphers principals, Shannon’s theory of confusion and diffusion, fiestal
structure, data encryption standard(DES), strength of DES, differential and linear crypt analysis of
DES, block cipher modes of operations, triple DES, AES.
Reference Books:
6. W. Mao, “Modern Cryptography – Theory and Practice”, Pearson Education.
7. Charles P. Pfleeger, Shari Lawrence Pfleeger – Security in computing –
Prentice Hall of India.
Web resources:
1. http://nptel.ac.in/courses/106105031/ lecture by Dr. Debdeep Mukhopadhyay IIT
Kharagpur
2. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-033-
computer-system-engineering-spring-2009/video-lectures/ lecture by Prof. Robert Morris and
Prof. Samuel Madden MIT.
Course Outcomes: At the end of the course, the student will be able to
CO 1 Implement security of the data over the network.
CO 4 Demonstrate how to protect any network from the threats in the world.
Course Course
Course name L-T-P Credits
code Category
Artificial Intelligence PEC 3-1-0 4
Text Books:
Elaine Rich, Kevin Knight, “Artificial Intelligence”, 3rd Edition, Tata McGraw-Hill, 2009.
Dan W. Patterson, “Introduction to Artificial Intelligence & Expert Systems”, PHI, 1990.
References:
10. Stuart Russel and Peter Norvid, “ Artificial Intelligence : A Modern Approach”, Pearson
Education, 3rd Edition
Web References
5. Berkley University, “Artificial Intelligence”,
https://courses.edx.org/courses/BerkeleyX/CS188.1x-4/1T2015/course/
6. MIT, “Artificial Intelligence”, FALL 2010
https://www.youtube.com/playlist?list=PLUl4u3cNGP63gFHB6xb-kVBiQHYe_4hSi
7. “Introduction to Artificial Intelligence”, https://classroom.udacity.com/courses/cs271
Course Outcomes: At the end of this course, the student should be able to
CO 1 Identify problems that are amendable to solution by AI methods
CO 2 Identify appropriate AI methods to solve a given problem
CO 3 Formalise a given problem in the language / framework of different AI
methods
CO 4 Implement basic AI algorithms
CO 5 Design and carry out an empirical evaluation of different algorithms on a
problem formalization, and state the conclusions that the evaluation
supports.
Objectives:
• To understand the basic theory underlying machine learning.
• To be able to formulate machine learning problems corresponding to different applications.
• To understand a range of machine learning algorithms along with their strengths and weaknesses.
• To be able to apply machine learning algorithms to solve problems of moderate complexity.
Course Outcomes:
• Ability to understand what is learning and why it is essential to the design of intelligent machines.
• Ability to design and implement various machine learning algorithms in a wide range of real-world
applications.
UNIT I: INTRODUCTION
Learning Problems – Perspectives and Issues - A brief introduction to Machine Learnin`g, Supervised
Learning, Unsupervised Learning, Reinforcement Learning – Concept Learning – Version Spaces and
Candidate Eliminations – Inductive bias – Decision Tree learning
Probability Learning – Sample Complexity – Finite and Infinite Hypothesis Spaces – Mistake Bound Model.
Learning Sets of Rules – Sequential Covering Algorithm – Learning Rule Set – First Order Rules – Sets of
First Order Rules.
TEXT BOOKS:
1. Machine Learning – Tom M. Mitchell, - MGH
2. Machine Learning: An Algorithmic Perspective, Stephen Marsland, Taylor & Francis
REFERENCE BOOKS
19. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani, Trevor Hastie,” An Introduction to
Statistical Learning: with Applications in R”, Springer, First Edition.
20. Kevin Murphy, “Machine learning: a probabilistic perspective”, MIT Press, First Edition.
21. Christopher Bishop, “pattern recognition and machine learning”, Springer, First Edition.
LIST OF PROFESSIONAL ELECTIVES COURSE(PEC)
Elective group-1
Course
Course Code Course Name L-T-P Credits
Category
CS3121 Data Mining PEC 3-0-0 3
Course Learning Objectives
22. Interpret the contribution of data warehousing and data mining to the decision-support level
of organizations
23. Categorize and carefully differentiate between situations for applying different data-mining
techniques: frequent pattern mining, association, correlation, classification, prediction, and
cluster and outlier analysis
24. Design and implement systems for data mining
25. Evaluate the performance of different data-mining algorithms
26. Propose data-mining solutions for different applications
Course Content:
Unit - I: (6 Contact hours)
Data Mining: Data mining functionalities, Integration of a data mining system with a database or
data warehouse systems, Classification of data mining systems, Data mining task primitives,
Major issues in data mining. Data Processing: Data cleaning, Data integration and transformation,
Data reduction, Discretization and concept hierarchy generation.
Unit-II: (9 Contact hours)
Data Warehouse and OLAP Technology: Differences between operational database systems and
data warehouses, A Multidimensional data model, Data warehouse architecture, Data warehouse
implementation - Efficient computation of data cubes, From Data warehousing to data mining.
Unit - III: (9 Contact hours)
Association Rules in Large Databases: Basic concepts of association rule mining, Efficient and
scalable frequent itemset mining methods. Mining Multilevel Association Rules: Mining
multidimensional association rules from relational databases and data warehouses, From
Association mining to correlation analysis, Constraint based association mining.
Unit – IV: (7 Contact hours)
Cluster Analysis: Basic of cluster analysis, Types of data in cluster analysis, A categorization of
major clustering methods, Partitioning methods – k-Means and k-Medoids, Hierarchical method -
Agglomerative vs. divisive hierarchical clustering, Distance measures in algorithmic methods,
BIRCH, Chameleon, Density based clustering: DBSCAN,
Outlier analysis :
Introduction to outlier detection, design and implementation of naïve methods related to data
mining techniques.- Statistical distribution based outlier detection, Distance based outlier detection.
Learning resources:
Text book:
Jiawei Han, MichelineKamber,“Data Mining: Concepts and Techniques”, Morgan
Kaufmann Publishers editor, 2006.
Pang-Ning Tan, Michael Steinbach, and Vipin Kumar. Introduction to Data Mining.
David J. Hand, HeikkiMannila, PadhraicSmyth ,“Principles of Data mining” MIT Press
Parteek Bhatia “Data Mining and Data Warehousing “ 1/e, Cambridge,19
Reference Books:
11. “Advances in Knowledge Discovery and Data Mining”. AAAI/MIT Press, 1996. Selected
papers from conferences and journals, conference tutorials.
12. Jiawei Han, Micheline Kamber, and Jian Pei. Data Mining:Concepts and Techniques (3rd
ed.). Morgan Kaufmann, 2012. eText ISBN: 9780123814807.
Web resources:
http://nptel.ac.in/courses/106106093/35
Course outcomes: At the end of the course, the student will be able to
Discover interesting pattern from large amount of data to analyze and extract
CO 1
patterns to solve problems make predictions of outcomes.
CO 2 Evaluate systematically supervised models and algorithms w.r.t their accuracy.
Evaluate and implement a wide range of emerging and newly-adopted
CO 3
methodology and technologies to facilitate the knowledge discovery.
Design and implement of a data mining applications using sample, realistic data
CO 4
sets and modern tools.
Evaluate and select appropriate data mining algorithms apply, interpret and
CO 5
report the output appropriately.
************************************************************************
Learning resources
Text book:
1. Ajay D. Kshemkalyani, Mukesh Singhal , “Distributed Computing: Principles, Algorithms, and
Systems Reissue Edition”,
2. Sukumar Ghosh, Distributed Systems: An Algorithmic Approach, Second Edition
Reference Books:
1. Distributed OS by Pradeep K. Sinha (PHI)
2. Tanenbaum S.: Distributed Operating Systems, Pearson Education
3. Tanenbaum S. Maarten V.S.: Distributed Systems Principles and Paradigms, (Pearson
Education)
4. George Coulouris, Jean Dollimore. Tim Kindberg: Distributed Systems concepts and design.
Web resources:
https://eclass.uoa.gr/modules/document/file.php/D245/2015/DistrComp.pdf
Course outcomes: At the end of the course, the student will be able to
CO 1 Study software components of distributed computing systems.
Know about the communication and interconnection architecture of multiple
CO 2
computer systems.
Recognize the inherent difficulties that arise due to distributed-ness of
CO 3
computing resources.
Understanding of networks & protocols, mobile & wireless computing and
CO 4
their applications to real world problems
CO 5 Able to use pointers in C programming
For Theory courses only:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
Course Content:
UNIT – I (10 Contact hours)
Introduction and Pipelinig: Defining computer architecture; Trends in Technology, power in
Integrated Circuits and cost; Dependability; Measuring, reporting and summarizing Performance;
Quantitative Principles of computer design;Pipeline hazards; Implementation of pipeline; What
makes pipelining hard to implement?
Learning resources
Text book:
1. John L Hennessey and David A Patterson, “Computer Architecture A Quantitative
Approach”, Morgan Kaufmann/ Elsevier, Fifth Edition, 2012
Reference Books:
1. Kai Hwang and Faye Briggs, “Computer Architecture and Parallel Processing”, Mc
Graw-Hill International Edition, 2000.
2. Sima D, Fountain T and Kacsuk P, ”Advanced Computer Architectures: A Design
Space Approach”, Addison Wesley, 2000.
Web resources:
Higher Performance Computer Architecture, NPTEL Course
https://nptel.ac.in/courses/106105033/1
Course outcomes: At the end of the course, the student will be able to
Evaluate performance of different architectures with respect to various
CO 1
parameters
CO 2 Analyze performance of different ILP techniques.
CO 3 Identify cache and memory related issues in multi-processors
Design the overall organization of cache and virtual memories, and pipelined
CO 4
processors.
Describe the challenges faced in the implementation of these high performance
CO 5
system
CO 6 Improve application performance for different cpu architectures
Objectives:
• To understand the basic theory underlying machine learning.
• To be able to formulate machine learning problems corresponding to different applications.
• To understand a range of machine learning algorithms along with their strengths and weaknesses.
• To be able to apply machine learning algorithms to solve problems of moderate complexity.
Course Outcomes:
• Ability to understand what is learning and why it is essential to the design of intelligent machines.
• Ability to design and implement various machine learning algorithms in a wide range of real-world
applications.
UNIT I: INTRODUCTION
Learning Problems – Perspectives and Issues - A brief introduction to Machine Learnin`g, Supervised
Learning, Unsupervised Learning, Reinforcement Learning – Concept Learning – Version Spaces and
Candidate Eliminations – Inductive bias – Decision Tree learning
Probability Learning – Sample Complexity – Finite and Infinite Hypothesis Spaces – Mistake Bound Model.
Learning Sets of Rules – Sequential Covering Algorithm – Learning Rule Set – First Order Rules – Sets of
First Order Rules.
TEXT BOOKS:
1. Machine Learning – Tom M. Mitchell, - MGH
2. Machine Learning: An Algorithmic Perspective, Stephen Marsland, Taylor & Francis
REFERENCE BOOKS
27. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani, Trevor Hastie,” An Introduction to
Statistical Learning: with Applications in R”, Springer, First Edition.
28. Kevin Murphy, “Machine learning: a probabilistic perspective”, MIT Press, First Edition.
29. Christopher Bishop, “pattern recognition and machine learning”, Springer, First Edition.
Course Course
Course Name L-T-P Credits
Code Category
OBJECT ORIENTED ANALYSIS
CS3226 PEC 3-0-0 3
& DESIGN(OOAD)
Course Content:
Learning resources:
Text Books:
1. Grady Booch, James Rumbaugh, Ivar Jacobson: ‘The Unified Modeling Language User
Guide’, Pearson Education.
Refernce books:
1. Meilir Page-Jones, ‘Fundamentals of Object Oriented Design in UML’, Pearson Education.
2. AtulKahate, ‘Object Oriented Analysis & Design’, The McGraw-Hill Companies
Web resources:
1. IIT Kharagpur, July 22 2016, ‘Foundations of the Object Model’,
a. URL:https://nptel.ac.in/courses/106105153/10
2. IIT Kharagpur, August 12 2016, ‘Overview of UML’,
a. URL: https://www.youtube.com/watch?time_continue=31&v=iN4Ft6loL7o
3. IIT Kharagpur, July 29 2016, ‘Relationship among objects’,
a. URL: https://nptel.ac.in/courses/106105153/20
Course outcomes: At the end of the course, the student will be able to
CO 1 Define basic terms necessery for modeling computer systems
CO 2 Collect requirements and prepare their scenarios
CO 3 Draw diagrams by UML
CO 4 Prepare and use of design patterns
CO 5 Prepare supporting documentation.
CO 6 Create a New Models as per requirements.
*************************************************************************
Course Course
Course Name L-T-P Credits
Code Category
Object Oriented Analysis and
CS3267 PEC 0-0-2 1
Design Laboratory
Course outcomes
At the end of the course, the student will be able
CO 1 Show the importance of systems analysis and design in solving complex
problems
CO 2 how the object-oriented approach differs from the traditional approach to
systems analysis and design.
CO 3 Construct various UML models (including use case diagrams, class diagrams,
interaction diagrams, state chart diagrams, activity diagrams, and implementation
diagrams) using the appropriate notation
CO 4 Recognize the difference between various object relationships: inheritance,
association, whole-part, and dependency relationships
CO 5 Show the role and function of each UML model in developing object-oriented
software
Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
***************************************************************************
Credit
Course Category L-T-P
Course Code Course Name s
CS3227 DISTRIBUTED SYSTEMS PEC 3-0-0 3
Course Contents:
UNIT I (7 Contact hours)
Definition of distributed systems, Goals of distributed system, types of distributed systems,
Architectural Styles , types of architectures
UNIT II (8 Contact hours)
Threads in Distributed Systems ,Virtualization, clients , servers , client server design issues, code
migration.
UNIT III (8 Contact hours)
Distributed systems communication fundamentals, RPC,Message-Oriented Communication Stream-
Oriented Communication , Multicast communication .
DISTRIBUTED SYSTEMS
CS3268 PEC 0-0-2 1
LAB
Course outcomes
At the end of the course, the student will be able
CO 1 Familiarity with key Real-Time Operating System terms and concepts
CO 2 Ability to program using system calls in a uC/OS-II environment.
CO 3 Ability to demonstrate Task Management
CO 4 Ability to demonstrate Inter-Task communication
Assessment Method
Assessment Experiments Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
*********************************************************************
Course Code Course Name Course Category L-T-P Credits
Course Content:
Unit – I (8 Contact hours)
Introduction to Embedded Systems: Definition, Applications of ES, Embedded Hardware Units and
Devices, Embedded Software, Design Metrics in ES, Challenges in ES Design.
Unit- II (7 Contact hours)
Architecture of 8051: 8051 Micro controller Hardware, Input/output Ports and Circuits, External
Memory, Counter and Timers, Serial data Input/output, Interrupts and Programming 8051.
UNIT –III (8 Contact hours)
ARM- Embedded Processor: History, Architecture, Interrupt vector, Programming the ARM,
ARM Assembly language, Instruction set, Conditional Execution, Arithmetic and Logical Compare.
UNIT – IV (8 Contact hours)
ARM PROGRAMMING: Assembly programming, General structure of assembly language,
Writing programs, Branch instructions, Loading constrains, load and store instructions, Readonly
and read/write Memory, Multiple Register Load and Store.
UNIT – V (8 Contact hours)
REAL TIME OPERATING SYSTEMS: Introduction, Tasks and Task States, Tasks and Data,
Reentrancy, Semaphores and Shared Data, Inter Process Communication-Message Queues,
Mailboxes and Pipes.
UNIT – VI (7 Contact hours)
REAL TIME OPERATING SYSTEMS-I : Timer Functions, Events, Memory Management, Interrupt
Routines in an RTOS Environment.
TEXT BOOKS:
1. Raj Kamal, “Embedded Systems”, 2nd edition, Tata McGraw Hill, 2009.
2. Lyla B Das, “Embedded Systems an Integrated Approach”, 1st edition, Pearson, 2012.
3. David E. Simon, “An Embedded Software Primer”, 1st edition, Pearson Education, 2008.
REFERENCE BOOKS:
1. Wayne Wolf, “Computers as Components-principles of Embedded Computer system
Design”, 1st edition, Elseveir, 2009.
2. Labrosse, “Embedding system building blocks”, 2rd edition, CMP Publishers, 2007.
3. Kenneth J. Ayala and Thomson, “The 8051 Microcontroller”, 3rd edition, Thompson
Delmar, Learning, 2008.
4. Frank Vahid, Tony Givargis and John Wiley, “Embedded System Design,
Microcontrollers”, 3rd edition, Pearson Education, 2008. 5. Michael J. Pont, “Embedded C”,
Addison Wesley, 2002
Course outcomes: At the end of the course, the student will be able to
Understand the concept of embedded system, microcontroller, different
CO 1
components of microcontroller and their interactions
Get familiarized with programming environment to develop embedded
CO 2
solutions
CO 3 Program ARM microcontroller to perform various tasks.
Understand the key concepts of embedded systems such as I/O, timers,
CO 4
interrupts and interaction with peripheral devices
***************************************************************************
Course Course
Course Name L-T-P Credits
Code Category
CS3270 Embeded System laboratory PEC 0-0-2 1
Week – 1
1. Write a program to toggle all the led to port and with some time delay using ARM7
Week – 2
2.Write a program to interface LCD with ARM7
Week – 3
3.Write a program to interface 4*4 matrix keypad with ARM7
Week – 4
4.Write a program for interfacing LED and PWM and to verify the output in the ARM7
Week – 5
5.Write a program to interface Stepper motor with ARM7
Week – 6
6.Write a program for interfacing of DC motor with ARM7
Week – 7
7.Write a program to study and characteristics of the programmable gain amplifier (PGA)
Week – 8
8.Write a Program realization of low pass, high pass and band pass filters and their characteristics
Week – 9
9.Write a program to interface ADC and DAC with PSOC
Week - 10
10. Write a program for digital function implementation using digital blocks A. Counter for
blinking LED B. PWW C. Digital buffer and digital inverter
Week – 11
11. Write a program to verify Timer operation in different modes
Week – 12
12. Write a Program to interface stepper motor with PSOC
Course outcomes
At the end of the course, the student will be able
CO 1 An ability to apply the knowledge of mathematics, science, engineering
fundamentals in ECE to various areas, like Analog & Digital Electronic Systems,
Signal & Image Processing, VLSI & Embedded systems, Microwave & Antennas,
wired & wireless communication systems etc., in the design and implementation of
complex systems.
CO 2 An ability to solve complex Electronics and communication engineering problems,
using latest hardware and software tools, along with significant analytical
knowledge in Electronics and Communication Engineering
CO 3 Acquire necessary soft skills, aptitude and technical skills to work in the software
industry and/or core sector and able to participate and succeed in competitive
examinations.
Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
***************************************************************************
Course Code Course Name Course Category L-T-P Credits
Course Objectives:
1. To describe the image fundamentals and mathematical transforms necessary for image
processing.
2. To explain the image enhancement techniques
3. To analyze images in the frequency domain using various transforms.
4. To explain image restoration procedures.
5. To describe Image Compression and Segmentation used in digital image processing.
6. To describe image feature extraction methods.
Course Outcomes:
1. Be able to apply, design and implement solutions for digital image processing
problems.
2. Be able to discuss the strengths and limitations of DIP applications in solving
problems with both professional peers and lay clients.
Course content:
UNIT I (8 Content hours)
Digital image fundamentals – Electromagnetic spectrum and imaging, Image acquisition, image
formation. Digitization-sampling and quantization, Resolution-pixel, gray scale, spatial, basic
relationship between pixels, Distance measure, Mathematical operations on image, Geometrical and
spatial transformation.
UNIT II (8 Content hours)
Intensity transformation and spatial filtering: Image enhancement, log transformation, Gamma
transformation, Histogram processing, Histogram matching, Special filtering- spatial correlation
and convolution, generating spatial filter mask, mage smoothing, Image sharpening-Laplacian filter,
Highboost filter. Edge detection- gradient filter, Morphological image processing-erosion, Dilation,
opening and closing operations, Boundary extraction, Hole Filling, Extraction of connected
components, Thinning, and thickening.
UNIT III (7 Content hours)
Image Restoration-Noise model, Restoration-Mean filter, Geometric filter, median filter, adaptive
filter, band pass filter, Notch filter, least mean square filters. Color fundamental-RGB color model,
CMY color model, HSI color model. Converting RGB to HSI and vice-versa.
UNIT IV (7 Content hours)
Filtering in Frequency domain-Preliminary concept: Fourier series, Fourier transform, convolution,
Sampling, DFT, Enhancement in frequency domain, low pass filter, high pass filter. Computing
IDFT from DFT.
UNIT V (8 Content hours)
Image compression fundamental, coding, temporal and spatial redundancy, Error-free (Lossless)
and Lossy compression. Image segmentation, Point-line-edge detection. Image gradients operator,
canny edge detection, Edge linking and boundary detection, local processing, thresholding, variable
thresholding, Region Growing, Texture Segmentation; Region oriented segmentation.
UNIT VI (8 Content hours)
Feature Extraction: Edges – Canny, Sobel; Line detectors, Corners - Harris, Orientation Histogram,
SIFT, SURF, Scale-Space Analysis- Image Pyramids, Haar transform. Decision-theoretic and
structure descriptors.
Textbooks:
1. Digital Image processing – R.C. Gonzalez & R.E. Woods, Addison Wesley/ Pearson
education, 3rd edition.
2. D. A. Forsyth, J. Ponce, Computer Vision: A Modern Approach, PHI Learning 2009.
3. Milan Soanka, Vaclav Hlavac and Roger Boyle, Digital Image Processing and Computer
Vision, Cengage Learning.
REFERENCES:
Fundamentals of Digital Image processing – A.K.Jain , PHI
For Theory courses only:
Course Nature Theory
Assessment Method
Assessment Tool Weekly tests Monthly tests End Semester Test Total
Weightage (%) 10% 30% 60% 100%
***************************************************************************
Course Code Course Name Course Category L-T-P Credits
Digital image Processing
CS3271 PEC 0-0-2 1
Laboratory
Course
Course name L-T-P Credits
Course code Category
Syllabus:
Course Objective:
Describe those aspects of mobile programming that make it unique from programming for
other platforms,
Critique mobile applications on their design pros and cons,
Utilize rapid prototyping techniques to design and develop sophisticated mobile interfaces,
Program mobile applications for the Android operating system that use basic and advanced
phone features, and
Deploy applications to the Android marketplace for distribution.
UNIT I: ( 6 Hours )
J2ME Overview: Java 2 Micro Edition and the World of Java, Introduction to Mobile app
Development, Reasons to Build Mobile App, Mobile Application Development Today, Myths of
Mobile Application Design. Diving into Mobile: App or Website? Mobile Web Presence
UNIT II : ( 12 Hours )
Android Platform and Development Environment: Intro to Android, Create your First Android App,
Layouts, Views and Resources. Text and Scrolling Views. Activities and Intents. Debugging and
Testing your App
SQLite Primer, Store Data using SQLite, Content Providers, Using Loaders to Load and Display
Data, Permissions, Performance and Security.
UNIT VI : (10 Hours)
Kotlin : Introduction to kotlin, Environment Setup , Architecture, Functions, Classes, Visibility
Control, Inheritance and Interfaces, Extensions, Data and Sealed Classes, Delegation, Example to
build basic apps using Kotlin.
Text Books
1. Professional Mobile Application Development by Jeff McWherter, Scott Gowell Wiley
india pvt.ltd 2013
2. https://google-developer-training.gitbooks.io/android-developer-fundamentals-course-
practicals/content/en/
3. https://developers.google.com/training/courses/android-fundamentals
4. https://kotlinlang.org/docs/tutorials/edu-tools-learner.html
CO 2
Will be able to design mobile applications
Understand that how to get input from the user, implement navigation strategies,
CO 4
use themes and styles, test your user interface, and follow Material Design
principles
CO 6 Understand the difference between other languages and kotlin, how to build apps
using kotlin.
Course Course
Course Name L-T-P Credits
Code Category
Mobile Application Development
ESC 0-0-2 1
CS3272 Laboratory
List of Experiments:
LAB No Name of Assignment
1 Research document on Mobile Application Development
2 Understanding and Exploring Android Studio Tool
3 Working with Layouts, Views and Resources
4 Adding the Activities and Intents
5 Debugging and Testing your App
6 Adding the User Input Controls
7 Working with Menus
8 Implementing the Screen Navigation
9 Recycler View
10 Working with Async Task and Loaders
11 Working with Databases Transferring Data
12 Shared Preference
Course Outcomes
At the end of the course, the student will be able to
CO 1 Survey on Existing Mobile Operating Systems
CO 2 Understanding about Install and use the Android IDE, Create an Android
project from a basic app template
CO 3 Using Layouts, Working with TextView Elements
CO 4 Create and Start Activities, Understand the activity lifecycle, and Implicit
Intents
CO 5 Understanding about Run your app in debug mode in an emulator or on a
device
CO 6 Understanding about Using Keyboards, Input Controls, Alerts, and Pickers
CO 7 Understanding about Using an Options Menu
CO 8 Understanding about Using the App Bar and Tabs for Navigation
CO 9 Understanding about the Use of RecyclerView class to display items in a
scrollable list
CO 10 understanding the benefits and drawbacks of using AsyncTask for
background tasks
CO 11 Understanding about SQLite database with an SQLiteOpenHelper
Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
***************************************************************
LIST OF PROFESSIONAL ELECTIVES COURSE(PEC)
Elective group -3
CO 1 Ability to identify Data Base Management systems and data ware houses
Ability to use knowledge of data structures and indexing methods in information
CO 2
retrieval Systems
Ability to choose clustering and searching techniques for different data base
CO 3
systems
Ability to Explain different types of search algorithms like Hardware text search
CO 4
systems and software text search systems
CO 5 understand the underlined problems related to IR
4 Retrieval Models
1. Case study: Washington Post news index
2. Documents ranking with Lukens’s retrieval models
3. Vector Space Model (Cosine TF-IDF)
4. Best Model 25 (BM 25)
5. Language Model with Dirichlet Smoothing (LMD)
6. Discussion
7. Advanced discussion
5 Query Expansion
1. Linguistic query expansion
2. Corpus-based query expansion
3. Pseudo-relevance feedback
4. Discussion
2. Design, develop, code and run the program in any suitable language to solve the commission
problem. Analyze it from the perspective of boundary
value testing, derive different test cases, execute these test cases and discuss the test results.
ALGORITHM
STEP 1: Define lockPrice=45.0, stockPrice=30.0, barrelPrice=25.0
STEP2: Input locks
STEP3: while(locks!=-1) „input device uses -1 to indicate end of data
goto STEP 12
STEP4:input (stocks, barrels)
STEP5: compute lockSales, stockSales, barrelSales and sales
STEP6: output(“Total sales:” sales)
STEP7: if (sales > 1800.0) goto STEP 8 else goto STEP 9
STEP8: commission=0.10*1000.0; commission=commission+0.15 * 800.0;
commission = commission + 0.20 * (sales-1800.0)
STEP9: if (sales > 1000.0) goto STEP 10 else goto STEP 11
STEP10: commission=0.10* 1000.0; commission=commission + 0.15 *
(sales-1000.0)
STEP11: Output(“Commission is $”, commission)
STEP12: exit
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
int main()
{
int locks, stocks, barrels, t_sales, flag = 0;
float commission;
clrscr();
printf("Enter the total number of locks");
scanf("%d",&locks);
if ((locks <= 0) || (locks > 70))
{
flag = 1;
}
printf("Enter the total number of stocks");
scanf("%d",&stocks);
if ((stocks <= 0) || (stocks > 80))
{
flag = 1;
}
printf("Enter the total number of barrelss");
scanf("%d",&barrels);
if ((barrels <= 0) || (barrels > 90))
{
flag = 1;
}
if (flag == 1)
{
printf("invalid input");
getch();
exit(0);
}
t_sales = (locks * 45) + (stocks * 30) + (barrels * 25);
if (t_sales <= 1000)
{
commission = 0.10 * t_sales;
}
else if (t_sales < 1800)
{
commission = 0.10 * 1000;
commission = commission + (0.15 * (t_sales - 1000));
}
else
{
commission = 0.10 * 1000;
commission = commission + (0.15 * 800);
commission = commission + (0.20 * (t_sales - 1800));
}
printf("The total sales is %d \n The commission is %f",t_sales, commission);
getch();
return;
}
Test Report:
3. Design, develop, code and run the program in any suitable language to implement the NextDate
function. Analyze it from the perspective of boundary value testing, derive different test cases,
execute these test cases and discuss the test results.
ALGORITHM
STEP 1: Input date in format DD.MM.YYYY
STEP2: if MM is 01, 03, 05,07,08,10 do STEP3 else STEP6
STEP3:if DD < 31 then do STEP4 else if DD=31 do STEP5 else
output(Invalid Date);
STEP4: tomorrowday=DD+1 goto STEP18
STEP5: tomorrowday=1; tomorrowmonth=month + 1 goto STEP18
STEP6: if MM is 04, 06, 09, 11 do STEP7
STEP7: if DD<30 then do STEP4 else if DD=30 do STEP5 else
output(Invalid Date);
STEP8: if MM is 12
STEP9: if DD<31 then STEP4 else STEP10
STEP10: tomorrowday=1, tommorowmonth=1,
tommorowyear=YYYY+1; goto STEP18
STEP11: if MM is 2
STEP12: if DD<28 do STEP4 else do STEP13
STEP13: if DD=28 & YYYY is a leap do STEP14 else STEP15
STEP14: tommorowday=29 goto STEP18
STEP15: tommorowday=1, tomorrowmonth=3, goto STEP18;
STEP16: if DD=29 then do STEP15 else STEP17
STEP17: output(“Cannot have feb”, DD); STEP19
STEP18: output(tomorrowday, tomorrowmonth, tomorrowyear);
STEP19: exit
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
main( )
{
int
month[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int d,m,y,nd,nm,ny,ndays;
clrscr( );
printf("enter the date,month,year");
scanf("%d%d%d",&d,&m,&y);
ndays=month[m-1];
if(y<=1812 && y>2012)
{
printf("Invalid Input Year");
exit(0);
}
if(d<=0 || d>ndays)
{
printf("Invalid Input Day");
exit(0);
}
if(m<1 && m>12)
{
printf("Invalid Input Month");
exit(0);
}
if(m==2)
{
if(y%100==0)
{
if(y%400==0)
ndays=29;
}
else if(y%4==0)
ndays=29;
}
nd=d+1;
nm=m;
ny=y;
if(nd>ndays)
{
nd=1;
nm++;
}
if(nm>12)
{
nm=1;
ny++;
}
printf("\n Given date is %d:%d:%d",d,m,y);
printf("\n Next day‟s date is %d:%d:%d",nd,nm,ny);
getch( );
}
Test Report:
4. Design and develop a program in a language of your choice to solve the triangle problem defined
as follows: Accept three integers which are supposed to be the three sides of a triangle and
determine if the three values represent an equilateral triangle, isosceles triangle, scalene triangle, or
they do not form a triangle at all. Assume that the upper limit for the size of any side is 10. Derive
test cases for your program based on equivalence class partitioning, execute the test cases and
discuss the results.
ALGORITHM:
Step 1: Input a, b & c i.e three integer values which represent three sides of
the triangle.
Step 2: if (a < (b + c)) and (b < (a + c)) and (c < (a + b) then
do step 3
else
print not a triangle. do step 6.
Step 3: if (a=b) and (b=c) then
Print triangle formed is equilateral. do step 6.
Step 4: if (a ≠ b) and (a ≠ c) and (b ≠ c) then
Print triangle formed is scalene. do step 6.
Step 5: Print triangle formed is Isosceles.
Step 6: stop
PROGRAM CODE
#include<stdio.h>
#include<ctype.h>
#include<conio.h>
#include<process.h>
int main()
{
int a, b, c;
clrscr();
printf("Enter three sides of the triangle");
scanf("%d%d%d", &a, &b, &c);
if((a > 10) || (b > 10) || (c > 10))
{
printf("Out of range");
getch();
exit(0);
}
if((a<b+c)&&(b<a+c)&&(c<a+b))
{
if((a==b)&&(b==c))
{
printf("Equilateral triangle");
}
else if((a!=b)&&(a!=c)&&(b!=c))
{
printf("Scalene triangle");
}
else
printf("Isosceles triangle");
}
else
{
printf("triangle cannot be formed");
}
getch();
return 0;
}
Test Report:
Design, develop, code and run the program in any suitable language to solve the commission
problem. Analyze it from the perspective of equivalence class testing, derive different test cases,
execute these test cases and discuss the test results.
ALGORITHM
STEP 1: Define lockPrice=45.0, stockPrice=30.0, barrelPrice=25.0
STEP2: Input locks
STEP3: while(locks!=-1) „input device uses -1 to indicate end of data goto
STEP 12
STEP4:input (stocks, barrels)
STEP5: compute lockSales, stockSales, barrelSales and sales
STEP6: output(“Total sales:” sales)
STEP7: if (sales > 1800.0) goto STEP 8 else goto STEP 9
STEP8: commission=0.10*1000.0; commission=commission+0.15 * 800.0;
commission = commission + 0.20 * (sales-1800.0)
STEP9: if (sales > 1000.0) goto STEP 10 else goto STEP 11
STEP10: commission=0.10* 1000.0; commission=commission + 0.15 *
(sales-1000.0)
STEP11: Output(“Commission is $”, commission)
STEP12: exit
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
int main()
{
int locks, stocks, barrels, t_sales, flag = 0;
float commission;
clrscr();
printf("Enter the total number of locks");
scanf("%d",&locks);
if ((locks <= 0) || (locks > 70))
{
flag = 1;
}
printf("Enter the total number of stocks");
scanf("%d",&stocks);
if ((stocks <= 0) || (stocks > 80))
{
flag = 1;
}
printf("Enter the total number of barrelss");
scanf("%d",&barrels);
if ((barrels <= 0) || (barrels > 90))
{
flag = 1;
}
if (flag == 1)
{
printf("invalid input");
getch();
exit(0);
}
t_sales = (locks * 45) + (stocks * 30) + (barrels * 25);
if (t_sales <= 1000)
{
commission = 0.10 * t_sales;
}
else if (t_sales < 1800)
{
commission = 0.10 * 1000;
commission = commission + (0.15 * (t_sales - 1000));
}
else
{
commission = 0.10 * 1000;
commission = commission + (0.15 * 800);
commission = commission + (0.20 * (t_sales - 1800));
}
printf("The total sales is %d \n The commission is %f",t_sales,
commission);
getch();
return;
}
Test Report:
6. Design, develop, code and run the program in any suitable language to implement the NextDate
function. Analyze it from the perspective of equivalence class value testing, derive different test
cases, execute these test cases and discuss the test results.
ALGORITHM
STEP 1: Input date in format DD.MM.YYYY
STEP2: if MM is 01, 03, 05,07,08,10 do STEP3 else STEP6
STEP3:if DD < 31 then do STEP4 else if DD=31 do STEP5 else
output(Invalid Date);
STEP4: tomorrowday=DD+1 goto STEP18
STEP5: tomorrowday=1; tomorrowmonth=month + 1 goto STEP18
STEP6: if MM is 04, 06, 09, 11 do STEP7
STEP7: if DD<30 then do STEP4 else if DD=30 do STEP5 else
output(Invalid Date);
STEP8: if MM is 12
STEP9: if DD<31 then STEP4 else STEP10
STEP10: tomorrowday=1, tommorowmonth=1, tommorowyear=YYYY+1;
goto STEP18
STEP11: if MM is 2
STEP12: if DD<28 do STEP4 else do STEP13
STEP13: if DD=28 & YYYY is a leap do STEP14 else STEP15
STEP14: tommorowday=29 goto STEP18
STEP15: tommorowday=1, tomorrowmonth=3, goto STEP18;
STEP16: if DD=29 then do STEP15 else STEP17
STEP17: output(“Cannot have feb”, DD); STEP19
STEP18: output(tomorrowday, tomorrowmonth, tomorrowyear);
STEP19: exit
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
main( )
{
int month[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int d,m,y,nd,nm,ny,ndays;
clrscr( );
printf("enter the date,month,year");
scanf("%d%d%d",&d,&m,&y);
ndays=month[m-1];
if(y<=1812 && y>2012)
{
printf("Invalid Input Year");
exit(0);
}
if(d<=0 || d>ndays)
{
printf("Invalid Input Day");
exit(0);
}
if(m<1 && m>12)
{
printf("Invalid Input Month");
exit(0);
}
if(m==2)
{
if(y%100==0)
{
if(y%400==0)
ndays=29;
}
else if(y%4==0)
ndays=29;
}
nd=d+1;
nm=m;
ny=y;
if(nd>ndays)
{
nd=1;
nm++;
}
if(nm>12)
{
nm=1;
ny++;
}
printf("\n Given date is %d:%d:%d",d,m,y);
printf("\n Next day‟s date is %d:%d:%d",nd,nm,ny);
getch( );
}
Test Report:
Course outcomes:
At the end of the course, the student will be able
CO 1 To formulate the algorithms for simple problems
CO 2 To translate the given algorithms to a working and correct program
CO 3 To identify and correct logical errors encountered at run time
CO 4 To write iterative as well as recursive programs
CO 5 To run scripts on Selenium and in other tools.
CO 6 To decompose a problem into functions and synthesize a complete program
CO 7 To generate test reports and identify errors
Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab
Total
Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
***************************************************************************
Course Content:
UNIT II: Mobile Internet Protocol And Transport Layer (9 Contact hours)
Overview of Mobile IP – Features of Mobile IP – Key Mechanism in Mobile IP – route
Optimization – DHCP. Overview of TCP/IP – Architecture of TCP/IP- Adaptation of TCP Window
– Improvement in TCP Performance.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning
Pvt. Ltd, New Delhi – 2012
Jochen Schiller, “Mobile Communications”, PHI, Second Edition, 2003.
Reference Books:
Dharma Prakash Agarval, Qing and An Zeng, “Introduction to Wireless and Mobile systems”,
Thomson Asia Pvt Ltd, 2005.
Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile
Computing”, Springer, 2003.
William. C. Y. Lee, “Mobile Cellular Telecommunications-Analog and Digital Systems”, Second
Edition, TataMcGraw Hill Edition ,2006.
C. K. Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson Education, 2002.
Course outcomes: At the end of the course, the student will be able to
CO 1 Explain the basics of mobile telecommunication systems
CO 2 Illustrate the generations of telecommunication systems in wireless networks
Determine the functionality of MAC, network layer and Identify a routing
CO 3 protocol for a given Ad hoc network
***************************************************************************
Course Course
Course Name L-T-P Credits
Code Category
CS3275 Mobile Computing Laboratory PEC 0-0-2 1
Course Objectives:
1. Define compression; understand compression as an example of representation.
2. Understand the idea of lossless and lossy compression.
3. Understand the most common file formats for image, sound and video.
4. Distinguish the basic techniques of lossless compression.
Course Content:
Unit 1: (6 Contact hours)
Introduction: Mathematical Preliminaries, Lossy and Lossless compression, Measure of
performances, Application of compression, Introduction to information theory.
Learning Resources
Text books:
1. Khalid Sayood, “Introduction to Data Compression”, Elsevier, Fifth edition
Reference Books:
1. Mark Nelson, “The Data Compression book”, BPB Publications, First edition
2. Colt McAnlis, “Understanding Compression::Data Compression for Modern Developers”
PublishShroff Publishers & Distributors Pvt Ltd,First edition
Web resources:
1. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-050j-information-
and-entropy-spring-2008/videos-homework-and-readings/unit-2-lecture-1/
2. https://nptel.ac.in/courses/106102064/19
3. https://www.ics.uci.edu/~dan/pubs/DataCompression.html.
Course Outcomes: At the end of the course, the student will be able to
CO 1 Explain lossless and lossy compression and correlating them with
mathematical concepts.
CO 2 Implement Huffman encoding, LZW, LZ77 and LZ78 in various projects.
CO 3 Discuss the concept of Information theory and its relation to data
compression.
CO 4 Use the standards like zip, bzip etc. according to the requirements.
CO 5 Perform image and video compression according to the real world project
requirements.
CO 6 Use the concepts like wavelet transform and quantization.
Assessment Method:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
L-T-
Course Code Course Name Course Category Credits
P
OBJECTIVES:
1. Gain knowledge about graphics hardware devices and software used. ∙ Understand the two
dimensional graphics and their transformations.
2. Understand the three dimensional graphics and their transformations. ∙ Appreciate
illumination and color models.
3. Be familiar with understand clipping techniques.
Course Content:
UNIT I INTRODUCTION (8 Contact hours)
Survey of computer graphics, Overview of graphics systems – Video display devices, Raster scan
systems, Random scan systems, Graphics monitors and Workstations, Input devices, Hard copy
Devices, Graphics Software; Output primitives – points and lines, line drawing algorithms, loading
the frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and object
geometry, filled area primitives.
UNIT II Two Dimensional Graphics (8 Contact hours)
Two dimensional geometric transformations – Matrix representations and homogeneous
coordinates, composite transformations; Two dimensional viewing – viewing pipeline, viewing
coordinate reference frame; widow-to-viewport coordinate transformation, Two dimensional
viewing functions; clipping operations – point, line, and polygon clipping algorithms.
UNIT III Three Dimensional Graphics (8 Contact hours)
Three dimensional concepts; Three dimensional object representations – Polygon surfaces- Polygon
tables- Plane equations – Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby
objects; Spline representations – Bezier curves and surfaces -B-Spline curves and surfaces.
TRANSFORMATION AND VIEWING: Three dimensional geometric and modeling
transformations – Translation, Rotation, Scaling, composite transformations; Three dimensional
viewing – viewing pipeline, viewing coordinates, Projections, Clipping; Visible surface detection
methods.
UNIT IV Illumination And Colour Models (7 Contact hours)
Light sources – basic illumination models – halftone patterns and dithering techniques; Properties
of light – Standard primaries and chromaticity diagram; Intuitive colour concepts – RGB colour
model – YIQ colour model – CMY colour model – HSV colour model – HLS colour model; Colour
selection.
UNIT V Animations & Realism 10 Animation Graphics (8 Contact hours)
Design of Animation sequences – animation function – raster animation – key frame systems –
motion specification –morphing – tweening. COMPUTER GRAPHICS REALISM: Tiling the plane
– Recursively defined curves – Koch curves – C curves – Dragons – space filling curves – fractals –
Grammar based models – fractals – turtle graphics – ray tracing.
UNIT –VI Multimedia System: (8 Contact hours)
An Introduction, Multimedia hardware, Multimedia System Architecture. Data & File Format
standards. i.e RTF, TIFF, MIDI, JPEG, DIB, MPEG,Audio: digital audio, MIDI, processing sound,
sampling, compression. Video: Avi, 3GP,MOV, MPEG .
Text Books:
1. John F. Hughes, Andries Van Dam, Morgan Mc Guire ,David F. Sklar , James D. Foley,
Steven K. Feiner and Kurt Akeley ,”Computer Graphics: Principles and Practice”, , 3rd
Edition, Addison- Wesley Professional,2013. (UNIT I, II, III, IV).
2. Donald Hearn and Pauline Baker M, “Computer Graphics”, Prentice Hall, New Delhi,
2007 (UNIT V).
References:
1. Donald Hearn and M. Pauline Baker, Warren Carithers,“Computer Graphics With Open
GL”, 4th Edition, Pearson Education, 2010.
2. Jeffrey McConnell, “Computer Graphics: Theory into Practice”, Jones and Bartlett
Publishers, 2006.
3. Hill F S Jr., “Computer Graphics”, Maxwell Macmillan” , 1990.
4. Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik Reinhard,
KelvinSung, and AK Peters, Fundamental of Computer Graphics, CRC Press, 2010.
5. William M. Newman and Robert F.Sproull, “Principles of Interactive Computer Graphics”,
Mc GrawHill 1978. http://nptel.ac.in/
Outcomes:
CO1 Design two dimensional graphics.
CO2 Apply two dimensional transformations.
CO3 Design three dimensional graphics.
CO4 Apply three dimensional transformations.
CO5 Apply Illumination and color models.
CO6 Apply clipping techniques to graphics.
CO7 Design animation sequences.
Computer Graphics 1
CS3277 PEC 0-0-2
Laboratory
Course Objective:
1. Learn the basic principles of 3-dimensional computer graphics..
2. Given a computational problem, identify and abstractthe programming task involved.
3. Approach how to transform the shapes to fit them as per the picture definition.
4. Provide an understanding of mapping from a world coordinates to device coordinates,
clipping, and projections.
5.To be able to discuss the application of computer graphics concepts in the development of
computer games.
Hardware Requirements:
❖ Intel® Pentium® 4, Intel Centrino®, Intel Xeon®, or Intel Core™ Duo (or
compatible)processor.
❖ Microsoft® Windows® 7 (64 bit) or Windows 8 (64 bit)
❖ 4GB of RAM
❖ 2.5GB of available hard-disk space for installation; additional free space require during
installation (cannot install on removable flash storage devices)
❖ 1024x768 display (1280x800 recommended)
❖ QuickTime 10.x software recommended
Course outcomes
At the end of the course, the student will be able
CO 1 Concepts of 2D & 3D object representation.
CO 3 2D modeling.
Assessment Method
Report/Viva-Voce/
Assessment Tool Experiments Quiz/MCQ/Lab Total
project
40%
Weightage (%) 25% 15%
60%
End Semester Examination weightage (%)
***************************************************************************
LIST OF PROFESSIONAL ELECTIVES COURSE(PEC)
Elective group -4
Course Code Course Name Course Category L-T-P Credits
Course Objectives:
1. To analyze, characterize empirically complex data;
2. To describe relevant statistical quantities and quantify their confidence intervals;
3. To explain sensible models and to parameterize and validate these models;
4. To quantify inter-dependency/causality structure between different variables;
Course Outcomes:
At the end of the course the students will be able to
To develop practical data analysis skills, which can be applied to practical problems?
To explain how math and information sciences can contribute to building better algorithms
and tools.
To develop applied experience with data science software, programming, applications and
processes.
Course Content:
UNIT – I (10Contact
hours)
Introduction to Data Science: Introduction to data science, exploratory data analysis, introduction
to machine learning, supervised and unsupervised learning, linear regression, model selection and
evolution.
UNIT-II (12
Contact hours)
Data structures, files and data plotting, Arrays & Matrices, Making Tables, Lists, Data frames,
Conversion of Numeric Data frames into Matrices. Reading Excel Files, and text files, Plotting
function, multiple plots, Scatter plot matrices. Basics on data acquisition, integration, cleaning,
filtering, transformation.
UNIT-III (9 Contact hours)
Feature selection. Dimensionality Reduction: PCA and SVD, forward and backward feature
selection, Measures of dependency. Cause and effect, spurious correlations and regularization.
Probability: Probability distributions, Marginal probability, joint probability and conditional
probability. Empirical estimation of probability distributions.
1. R AS CALCULATOR APPLICATION:
a. Using with and without R objects on console
b. Using mathematical functions on console
c. Write an R script, to create R objects for calculator application and save in a specified location in disk
2. DESCRIPTIVE STATISTICS IN R
a. Write an R script to find basic descriptive statistics using summary, str, quartile function on mtcars&
cars datasets.
b. Write an R script to find subset of dataset by using subset (), aggregate () functions on iris dataset.
3. READING AND WRITING DIFFERENT TYPES OF DATASETS
a. Reading different types of data sets (.txt, .csv) from web and disk and writing in file in
specific disk location.
b. Reading Excel data sheet in R.
c. Reading XML dataset in R.
4. VISUALIZATIONS
a. Find the data distributions using box and scatter plot.
b. Find the outliers using plot.
c. Plot the histogram, bar chart and pie chart on sample data.
Course
Course Code Course Name L-T-P Credits
Category
CS3237 Unixand Shell Programming PEC 3-0-0 3
Course Content:
UNIT I – Introduction to UNIX (8 Contact hours)
Architecture of Unix, Features of Unix , Unix Commands – PATH, man, echo, printf, script,
passwd, uname, who, date, stty, pwd, cd, mkdir, rmdir, ls, cp, mv, rm, cat, more, wc, lp, od, tar,
gzip,cpio,ln
UNIX Utilities: (8 Contact hours)
Process utilities, disk utilities,networking commands, unlink, du, df, mount, umount, find, unmask,
ulimit, ps, w, finger, arp, ftp, telnet, rlogin.Text processing utilities and backup utilities , detailed
commands to be covered are tail, head , sort, uniq, grep, egrep, fgrep, cut, paste, join, tee, pg,
comm, cmp, diff, tr, awk.
UNIT II - File Management (6 Contact hours)
Introduction to unix file system, vi editor, file handling utilities, security by file permissions,File
Structures, System Calls for File Management – create, open, close, read, write, lseek, link,
symlink, unlink, stat, fstat, lstat, chmod, chown, Directory API – opendir, readdir, closedir, mkdir,
rmdir, umask.
UNIT III – Introduction to Shells & Filters (7 Contact hours)
Introduction to Shells : Unix Session, Standard Streams, Redirection, Pipes, Tee Command,
Command Execution, Command Line Editing, Quotes, Command Substitution, Job Control,
Aliases, Variables, Predefined Variables, Options, Shell/Environment Customization.
Filters: Filters and Pipes, Concatenating files, Display Beginning and End of files, Cut and Paste,
Sorting, Translating Characters, Files with Duplicate Lines, Count Characters, Words or Lines,
Comparing Files.
UNIT IV – grep, sed, awk (7 Contact hours)
grep : Operation, grep Family, Searching for File Content.
sed : Scripts, Operation, Addresses, commands, Applications, grep and sed.
awk: Execution, Fields and Records, Scripts, Operations, Patterns, Actions, Associative Arrays,
String Functions, String Functions, Mathematical Functions, User – Defined Functions, Using
System commands in awk, Applications, awk and grep, sed and awk.
UNIT V – Korn shell programming (7Contact hours)
Interactive Korn Shell: Korn Shell Features, Two Special Files, Variables, Output, Input, Exit
Status of a Command, eval Command, Environmental Variables, Options, Startup Scripts,
Command History, Command Execution Process.
Korn Shell Programming: Basic Script concepts, Expressions, Decisions: Making Selections,
Repetition, special Parameters and Variables, changing Positional Parameters, Argument
Validation, Debugging Scripts, Script Examples.
UNIT VI – C shell programming (7Contact hours)
Interactive C Shell: C shell features, Two Special Files, Variables, Output, Input, Exit Status of a
Command, eval Command, Environmental Variables, On-Off Variables, Startup and Shutdown
Scripts, Command History, Command Execution Scripts.
C Shell Programming: Basic Script concepts, Expressions, Decisions: Making Selections,
Repetition, special Parameters and Variables, changing Positional Parameters, Argument
Validation, Debugging Scripts, Script Examples.
Learning resources
Text Book:
1. Behrouz A. Forouzan & Richard F. Gilberg, “Unix and Shell Programming”, 1 st edition, Cengage
Learning, 2003
Reference Books:
1. Sumitabha Das, “Your Unix: The Ultimate Guide”, 1st edition, Tata Mcgraw hill, 2001
2. Graham Glass, King Ables, “Unix for programmers and Users”, 3rd edition, Pearson Education,
2003
3. Kernighan & Pike, “The UNIX Programming Environment”, 1st edition, Pearson Education
India, 2015
4. Ken Rosen, James Farber, Rachel Klee, Douglas Host, and Dick Rosinski, “ Unix: The Complete
Reference”, 2nd edition, McGraw Hill Education, 2007
Web resources:
1.Essential Linux/Unix Commands – GeeksforGeekshttps://www.geeksforgeeks.org/essential-
linuxunix-commands/
2.Introduction to Linux Shell and Shell Scripting - GeeksforGeeks
https://www.geeksforgeeks.org/introduction-linux-shell-shell-scripting/
3. UNIX /LINUX TUTORIAL
https://www.tutorialspoint.com/unix/
Course outcomes: At the end of the course, the student will be able to
Assessment Method:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
**************************************************************************
Course Course
Course Name L-T-P Credits
Code Category
Unix Shell Programming
PEC 0-0-2 1
CS3279 Laboratory
1. a) Study of Unix general purpose utility command list man,who,cat, cd, cp, ps, ls, mv,
rm, mkdir, rmdir, echo, more, date, time, kill, history, chmod, chown, finger, pwd, cal,
logout, shutdown.
b) Study of vi editor.
c) Study of Bash shell, Bourne shell and C shell in Unix operating system.
d) Study of Unix/Linux file system (tree structure).
e) Study of .bashrc, /etc/bashrc and Environment variables.
2. Write a C program that makes a copy of a file using standard I/O, and system calls.
Course outcomes
At the end of the course, the student will be able
CO 1 To use Unix utilities and perform basic shell control of the utilities
CO 2 To use the Unix file system and file access control.
CO 3 To use of an operating system to develop software
CO 4 Students will be able to use Unix environment efficiently
CO 5 Solve problems using bash for shell scripting
CO 6 Construct various shell scripts for simple applications.
CO 7 Will be able to explain the process management using system calls Unix
environment
Assessment Method
Assessment Experiment Report/Viva-Voce/ Quiz/MCQ/Lab Total
Tool s project
Weightage (%) 25% 15% 40%
End Semester Examination weightage (%) 60%
Course Code Course Name Course Category L-T-P Credits
Course Objectives
1. To make
understand the student the introductory concepts of Very Large Scale Integrated
Circuits design such as HDLs, CMOS circuit design, Layout techniques and
fabrication
Course Content:
1. To get a
practical exposure on the concepts present in Introductory to VLSI Theory course
and thereby acquiring sufficient knowledge in designing basic analog and digital
VLSI systems
List of Experiments
Assessment Method
************************************************************************
Cridet
Course Coded Course Name Course Category L-T-P
s
Learning resources:
Text books:
1. S.N.Sivanandam and S.N.Deepa, “Principles of soft computing”, Wiley India.
2. Timothy J.Ross, “Fuzzy Logic with engineering applications”, Wiley India.
Reference Books:
1. N.K. Sinha and M.M Gupt, Soft Computing & Intelligent Systems: Theory & Applications-
Academic Press /Elsevier.2009.
2. Simon Haykin, Netural Network- A Comprehensive Foundation- Prentice Hall
International,Inc.
3. R.Eberhart and Y. Shi,Computational Intelligence: Concepts to Implementation, Morgon
Kaufman/Elsevier,2007.
4. Drainkov T.j. “Fuzzy Logic With Engineering Applications” McGraw Hill.
5. Bart KOsko, “Neural Network and Fuzzy Systems-Prentice”Hall,Englewood Cliffs.
6. Goldberg D.E, “Genetic Algorithms in Search,Optimization,and Machine Learing
Web resources:
1. https://www.scribd.com/document/250449108/Definition-of-Soft-Computing
2.
https://bookboon.com/en/introduction-to-soft-computing-ebook
Course outcomes: At the end of the course, the student will be able to
Knowledge about fuzzy logic and concept of fuzziness involved in various
CO 1
systems and fuzzy set theory.
Knowledge about fuzzy sets, representing fuzzy rules, approximate reasoning,
CO 2
fuzzy inference systems and fuzzy logic,
Knowledge about fundamental theory of neural networks, neural network
CO 3
architectures, algorithms, applications and their limitations.
Knowledge for appropriate learning rules for each of the architectures and
CO 4
learn several neural network paradigms and its applications.
Knowledge of revealing different applications of these models to solve
CO 5
engineering and other problems.
S oft Computing
CS3281 PEC 0-0-2 1
Laboratory
Course outcomes: At the end of the course, the student will be able
1. Understand file structures including sequential, indexed, indexed sequential, hashed file
structures
2. Apply object-oriented concepts to design file systems
3. Understand B+-trees to implement file systems
4. Implement file operations including read, write, update and search
5. Develop and analyse external sorting methods
1. Michael j. Folk, Greg Riccardi, Bill Zoellick; File Structures: An Object Oriented Approach
with C++, 3/e Pearson Publishers.
2. Suggested Reading
Course outcomes: At the end of the course, the student will be able to
Understand file structures including sequential, indexed, indexed sequential,
CO 1
hashed file structures
CO 2 Apply object-oriented concepts to design file systems
CO 3 Implement file operations including read, write, update and search
CO 4 Develop and analyze external sorting methods
********************************************************************
Course
Course code
Course name Category L-T-P Credits
HSXY04 Aptitude and Reasoning MC 2: 0: 0 0
2. Arun Sharma, Meenakshi Upadhyay, ' Verbal Ability and Reading Comprehension' ,
McGraw Hill publications
Reference books:
Web resources:
1. https://unacademy.com/
Course outcomes: At the end of the course, the student will be able to
CO 1 Improve aptitude, problem solving skills and reasoning abilities
CO 2 Improve Verbal ability skills, Data interpretation skills
CO 3 Understand the basic techniques required for solving Reading Comprehension
Familiarize with the written tests of competitive exams, campus placements and
CO 4
PSUs
CO 5 Collectively solve problems in teams and group
CO 6 Adopt and acquire new techniques in solving problem
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%)
Nil Nil 100 100
Course Content:
Unit - I (8 Contact hours)
Introduction to Big Data Analytics:Big Data Overview, State of the Practice in Analytics, Key
Roles for the New Big Data Ecosystem, Examples of Big Data Analytics.
Data Analytics Lifecycle:Data Analytics Lifecycle Overview, Discovery, Data Preparation, Model
Planning, Model Building, Communicate Results, Operationalize.
Unit - II (8 Contact hours)
Advanced Analytical Theory and Methods- Clustering: Overview of Clustering, K-means,
Additional Algorithms Advanced Analytical Theory and Methods-Association Rules: Overview,
Apriori Algorithm, Evaluation of Candidate Rules, Applications of Association Rules, An Example:
Transactions in a Grocery Store, Validation and Testing, Diagnostics.
Learning resources
Text book:
1. Dunlop, Dorothy D., and Ajit C. Tamhane. ‘Statistics and data analysis: from elementary to
intermediate’. Prentice Hall, 2000.
2. EMC Education Services “Data Science and Big Data Analytics: Discovering, Analyzing,
Visualizing and Presenting Data” Wiley Publishers.
3. Tom White “ Hadoop: The Definitive Guide” Third Edition, O‟reilly Media, 2011.
4. Prajapati, "V. Big data analytics with R and Hadoop",Packt Publishing Ltd, 2013.
Reference Books:
1. Ohlhorst, Frank J. ‘Big data analytics: turning big data into big money’. John Wiley & Sons,
2012.
2. W.N. Venables, D.M Smith, ‘An introduction to R’, Network Theory Ltd.
3. Nina Zumel, John Mount, ‘Practical Data Science with R’, Manning Publications, 2014
4. Tom Plunkett, Mark Hornick, ‘Using R to Unlock the Value of Big Data: Big Data Analytics with
Oracle R Enterprise and Oracle R Connector for Hadoop’, McGraw-Hill/Osborne Media (2013),
Oracle press.
Web resources:
1. Implementing big data analysis, 19 Dec 2017 URL https://aiodex.com/?ref=5b45a599c7165
2. Big data and Hadoop introduction 17 Jul 2014 URL http://www.simplilearn.com/big-data-a
3. Big data and analytics 17 Jul 2014 URL https://www.simplilearn.com/resources
Course outcomes: At the end of the course, the student will be able to
CO 1 Have a clear idea about the big data flow and its ecosystem.
Apply the tools and techniques on big data while applying data mining
CO 2
techniques.
CO 3 Use statistical tool and statistical methods that can be applied on big data.
CO 4 Have a clear idea about how to represent the unstructured data in the data bases
Understand the common Hadoop ecosystem components, Hadoop Architecture,
CO 5
HDFS, Anatomy of File Write and Read, Rack Awareness.
CO 6 Have a clear idea about social media data,text mining,mobile analytics.
For Theory courses only:
**************************************************************************
Course Code Course Name Course Category L-T-P Credits
Course Objectives
Course Outcomes
Text books
***********************************************************
Course outcomes: At the end of the course, the student will be able to
CO 1 Develop and deploy cloud application using popular cloud platforms,
Design and develop highly scalable cloud-based applications by creating and
CO 2
configuring virtual machines on the cloud and building private cloud.
CO 3 Explain and identify the techniques of big data analysis in cloud.
CO 4 Identify the technological drivers of cloud computing paradigm.
CO 5 Identify the security issues in cloud computing
CO 6 Develop cloud services using popular cloud platforms
***************************************************************************
Credit
Course Code Course Name Course category L-T-P
s
CS4145 Computer Vision PEC 3-0-0 3
Web References:
1. University of Central Florida, Sept 2012, “Computer Vision”
https://www.youtube.com/watch?v=715uLCHt4jE&list=PLd3hlSJsX_Imk_BPmB_H3AQjF
KZS9XgZm
2. University of Pennsylvania, FALL 2007, “ Introduction to Computer Vision”,
a. http://www.cse.psu.edu/~rtc12/
3. Stanford University, Fall 2016-17, “ Computer Vision : Foundations and Applications”
4. http://vision.stanford.edu/teaching/cs131_fall1617/schedule.html
Course outcomes: At the end of the course, the student will be able to
identify basic concepts, terminology, theories, models and methods in the field
CO 1
of computer vision
describe basic methods of computer vision related to multi-scale
CO 2
representation, edge detection
CO 3 detection of other primitives, stereo, motion and object recognition,
CO 4 suggest a design of a computer vision system for a specific problem
Assessment Method:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
Course Course
Course Name L-T-P Credits
Code Category
CS4146 Optimization Techniques PEC 3-0-0 3
Course Learning Objectives:
1. To define an objective function and constraint functions in terms of design variables,
And then state the optimization problem.
2. To state single variable and multi variable optimization problems, without and with
Constraints.
3. To explain linear programming technique to an optimization problem, define slack
And surplus variables, by using Simplex method.
4. To state transportation and assignment problem as a linear programming problem to
Determine Simplex method.
5. To study and explain nonlinear programming techniques, unconstrained or
6. Constrained, and define exterior and interior penalty functions for optimization problems.
7. To explain Dynamic programming technique as a powerful tool for making a
Sequence of interrelated decisions.
Course Content:
UNIT – I (8 Contact hours)
Introduction and Classical Optimization Techniques: Statement of an Optimization problem –
design vector – design constraints – constraint surface – objective function – objective function
surfaces – classification of Optimization problems.
UNIT – II (8 Contact hours)
Learning resources
Text books:
1. S.S.Rao - “Engineering optimization : Theory and practice”, New Age International (P)
Limited, 3rd edition, 1998.
2. H.S. Kasene & K.D. Kumar “Introductory Operations Research” , Springer (India), Pvt.
LTd.
Reference Books
1. K.V. Mital and C. Mohan -“Optimization Methods in Operations Research and systems
Analysis” , New Age International (P) Limited, Publishers, 3rd edition, 1996.
2. Dr. S.D.Sharma, Kedarnath, Ramnath & Co -Operations Research
3. G. Hadley “Operations Research : An Introduction” – by H.A.Taha,PHI pvt. Ltd., 6th
edition Linear Programming.
Course outcomes: At the end of the course, the student will be able to
State and formulate the optimization problem, without and with constraints, by
CO 1
using design variables from an engineering design problem
Apply classical optimization techniques to minimize or maximize a multi-
CO 2 variable objective function, without or with constraints, and arrive at an
optimal solution.
Formulate a mathematical model and apply linear programming technique by
CO 3 using Simplex method. Also extend the concept of dual Simplex method for
optimal solutions
Solve transportation and assignment problem by using Linear programming
CO 4
Simplex method.
Apply gradient and non-gradient methods to nonlinear optimization problems
CO 5 and use interior or exterior penalty functions for the constraints to derive the
optimal solutions.
Formulate and apply Dynamic programming technique to inventory control,
CO 6 production planning, engineering design problems etc. to reach a final optimal
solution from the current optimal solution.
***************************************************************************
Course Course
Course name L-T-P Credits
code Category
CS4158 Artificial Intelligence PEC 3-0-0 3
UNIT V (6 Hours)
Knowledge Presentation & Inference – Knowledge based Agents, Propositional Logic, First-Order
Logic, Inference Rules, Theorem Proving by Resolution, Forward & Backward Chaining
Classical Planning – Definition, Forward (Progression) Search and Backward (Regression) Search,
Hierarchical Planning, Multi Agent Planning
UNIT VI (9 Hours)
Planning under Uncertainty – Introduction to Probability Theory, Bayes Theory & its use, Bayesian
Networks, Hidden Markov Models, Markov Decision Processes, Value Iteration, Policy Iteration,
Partially Observable MDPS.
Text Books:
1. Stuart Russel and Peter Norvid, “ Artificial Intelligence : A Modern Approach”, Pearson
Education, 3rd Edition
References:
1. Elaine Rich, Kevin Knight and Shiva Shankar B.Nair, “ Artificial Intelligence”, McGraw
Hill Education, 3rd Edition
2. Dan W. Patterson, “ Introduction to Artificial Intelligence and Expert Systems”, PHI
Learning, 2012
Web References
1. Berkley University, “Artificial Intelligence”,
https://courses.edx.org/courses/BerkeleyX/CS188.1x-4/1T2015/course/
2. MIT, “Artificial Intelligence”, FALL 2010
https://www.youtube.com/playlist?list=PLUl4u3cNGP63gFHB6xb-kVBiQHYe_4hSi
3. “Introduction to Artificial Intelligence”, https://classroom.udacity.com/courses/cs271
Course Outcomes: At the end of this course, the student should be able to
CO 1 Identify problems that are amendable to solution by AI methods
CO 2 Identify appropriate AI methods to solve a given problem
CO 3 Formalise a given problem in the language / framework of different AI
methods
CO 4 Implement basic AI algorithms
CO 5 Design and carry out an empirical evaluation of different algorithms on a
problem formalization, and state the conclusions that the evaluation
supports.
***************************************************
Learning Resources:
Text Book:
9. Hoang Pham, ‘System Software Reliability, (Springer Series in Reliability Engineering)’
10. Min Xie, ‘Software Reliability Modeling, World Scientific’
11. J.D Musa, ‘Software Reliability; Measurement, Prediction, Application, TMH’
12. A.K Pandey and N K Goyal, ‘Early Software Reliability Prediction- Studiesin Fuzziness and
Soft Computing, Springer’
Reference Books:
1. Min Xie, ‘Software Reliability Modeling, World Scientific’
2. J.D Musa, ‘Software Reliability; Measurement, Prediction, Application, TMH’
3. A.K Pandey and N K Goyal, ‘Early Software Reliability Prediction- Studiesin Fuzziness and
Soft Computing, Springer’
Web Resources:
1. https://www.scribd.com/document/82318155/Reliability-Engineering-Notes
2. https://pdfs.semanticscholar.org/9e8e/bffabba60a5c58ed796e988e91335ba726b2.pdf
3. https://slideplayer.com/slide/4922909/
4. Primary Producer: IIT Bombay, December 2009
https://nptel.ac.in/courses/112101005/downloads/Module_5_Lecture_3_final.
Course Outcomes: At the end of the course the students will be able to
Knows the process and basic activities of software reliability engineering,
CO1 causes of failure appearance, software reliability metrics and models, methods
for ensuring, evaluation and enhancing of software reliability.
CO2 Is able to detect, to analyze and to evaluate software faults, failures and errors
using appropriate CASE tools.
Is able to implement different software reliability models and to evaluate the
CO3
reliability of developed tool using different methods and tools.
Is able to select an appropriate reliability model, to collect necessary data
CO4 during testing, to perform an evaluation of software reliability and in case of
necessity to enhance reliability.
CO5 To understand the software reliability and its various model
CO6 To understand the metrics used for software reliability and maintainability
Assessment Method:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
***********************************************************************
Course
Course Code Course Name LTP Credits
Category
AD-HOC SENSOR
CS4149 PEC 3-0-0 3
NETWORKS
Course Objectives
Course Outcomes
Course Content:
Reference Books:
https://nptel.ac.in/courses/106105160/
***************************************************************************
Course
Course Code Course Name LTP Credits
Category
CS4150 BIO-METRIC SECURITY PEC 3-0-0 3
Course Content:
UNIT-I (8 Contact hours)
Biometrics- Introduction- benefits of biometrics over traditional authentication systems -benefitsof
biometrics in identification systems-selecting a biometric for a system –Applications -
Key.biometric terms and processes - biometric matching methods -Accuracy in biometric systems.
UNIT-II ( 8 Contact hours)
Physiological Biometric Technologies: Fingerprints - Technical description –characteristics -
Competing technologies - strengths – weaknesses – deployment - Facial scan - Technical
description - characteristics - weaknesses-deployment - Iris scan - Technical description –
characteristics - strengths – weaknesses – deployment - Retina vascular pattern.
UNIT-III ( 8 Contact hours)
Technical description – characteristics - strengths – weaknesses – deployment - Hand scan -
Technical description-characteristics - strengths – weaknesses deployment – DNA biometrics.
UNIT-IV (7 Contact hours)
Behavioral Biometric Technologies: Handprint Biometrics - DNA Biometrics.
UNIT-V (7 Contact hours)
signature and handwriting technology - Technical description – classification – keyboard /
keystroke dynamics- Voice – data acquisition - feature extraction - characteristics - strengths –
weaknesses-deployment.
UNIT-VI (7 Contact hours)
Multi biometrics and multi factor biometrics - two-factor authentication with passwords - tickets
and tokens – executive decision - implementation plan.
Course Outcomes:
1. 1.Demonstrate knowledge of the basic physical and biological science and
engineering principles underlying biometric systems.
2. 2.Understand and analyze biometric systems at the component level and be able to
analyze and design basic biometric system applications.
3. 3.Be able to work effectively in teams and express their work and ideas orally and in
writing.
4. 4.Identify the sociological and acceptance issues associated with the design and
implementation of biometric systems.
5. 5.Understand various Biometric security issues.
TEXT BOOKS:
1. 1.Samir Nanavathi, Michel Thieme, and Raj Nanavathi : “Biometrics-Identity
verification in a network”, 1st Edition, Wiley Eastern, 2002.
2. 2.John Chirillo and Scott Blaul : “Implementing Biometric Security”, 1st Edition,
Wiley Eastern Publication, 2005.
REFERENCES:
John Berger: “Biometrics for Network Security”, 1st Edition, Prentice Hall, 2004.
For Theory courses only:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
********************************************************************************
*
Course
Course Code Course Name LTP Credits
Category
CS4151 Human Computer Interaction PEC 3-0-0 3
Course Objective:
1. The Main Objective is the student to think constructively and analytically
about how to design and evaluate interactive technologies.
2. Student can clearly understand the importance of the user interface
design.
3. IT give an introduction to the key areas, approaches and developments in
the field.
4. Basically, the course will introduce them to key areas, theoretical
frameworks, approaches and major developments in HCI.
5. The main objective is to get student to think constructively and
analytically about how to design and evaluate interactive technologies.
Course Content:
UNIT-I: Introduction and Graphical User Interface (9 Contact hours )
Importance of user Interface – definition, importance of good design. Benefits of good design. A
brief history of Screen design.
The graphical user interface – popularity of graphics, the concept of direct manipulation,
graphical system, Characteristics, Web user – Interface popularity, characteristics- Principles of
user interface
UNIT-II: Design Process (7 Contact hours )
Human interaction with computers, importance of human characteristics human consideration,
Human interaction speeds, understanding business junctions.
UNIT-III: Screen Designing (9 Contact hours )
Design goals – Screen planning and purpose, organizing screen elements, ordering of screen data
and content – screen navigation and flow – Visually pleasing composition – amount of information
– focus and emphasis – presentation information simply and meaningfully – information retrieval
on web – statistical graphics – Technological consideration in interface design.
UNIT-IV: Windows ( 7 Contact hours )
New and Navigation schemes selection of window, selection of devices based and screen
based controls.
UNIT-V: Components (7 Contact hours )
Text and messages, Icons and increases – Multimedia, colors, uses problems, choosing colors.
UNIT-VI: Software Tools and Interaction Devices (7 Contact hours )
Specification methods, interface – Building Tools; Keyboard and function keys – pointing devices –
speech recognition digitization and generation – image and video displays – drivers.
Text Books:
1. Wilbert O Galitz,”The essential guide to user interface design”, Wiley DreamaTech.
2. Ben Shneidermann ,”Designing the user interface”, Pearson Education Asia 3rd Edition,.
References:
1. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg “Human – Computer
Interaction”, Pearson, Third Edition.
2. Prece, Rogers, Sharps ,“Interaction Design” ,Wiley Dreamtech , Third Edition.
3. Soren Lauesen ,“User Interface Design”,Pearson Education.
Web resources:
1. Dr. Samit Bhattacharya , Dept. of Computer Science and Engineering, IIT Guwahati
URL: http://nptel.ac.in/courses/106103115
Course outcomes: At the end of the course, the student will be able to
Explain the capabilities of the both humans and computers from the view point
CO 1
of human Information processing
Describe typical human-computer Interaction (HCI) models styles and various
CO 2
historic HCI paradigms.
Apply an interactive design process and universal design principles to
CO 3
designing HCI system.
CO 4 Describe and use HCI design principles, standards and guidelines.
Analyze and identify user models ,user support ,socio-organizational issues,
CO 5
and stakeholder requirements of HCI system.
Design tasks and dialogs of relevant HCI system based on task analysis and
CO 6
dialog design.
Assessment Method
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
LIST OF PROFESSIONAL ELECTIVES COURSE (PEC)
Elective group-7
Course Code Course Name Course Category L-T-P Credits
Service Oriented
CS4252 PEC 3-0-0 3
Architecture
OBJECTIVES:
1. To learn fundamentals of XML
2. To provide an overview of Service Oriented Architecture and Web services and their
importance
3. To learn web services standards and technologies
4. To learn service oriented analysis and design for developing SOA based applications
Course Content:
UNIT I XML (8 Contact hours)
XML document structure – Well-formed and valid documents – DTD – XML Schema – Parsing
XML using DOM, SAX – XPath – XML Transformation and XSL – Xquery.
Course Outcomes:Upon Successful Completion Of This Course, The Students Will Be Able
To:
TEXTBOOKS:
1. Thomas Erl, ― Service Oriented Architecture: Concepts, Technology, and Design, Pearson
Education, 2005
2. Sandeep Chatterjee and James Webber, ―Developing Enterprise Web Services: An
Architect’s Guide, Prentice Hall, 2004
REFERENCES:
1. James McGovern, Sameer Tyagi, Michael E Stevens, Sunil Mathew, ―Java Web
Services Architecture, Elsevier, 2003.
2. Ron
Schmelzer et al. ― XML and Web Services, Pearson Education, 2002.
3. Frank P.Coyle, ―XML, Web Services and the Data Revolution, Pearson
Education, 2002
**************************************************************
Course Code Course Name Course Category L-T-P Credits
CS41XX INTERNET OF THINGS PEC 3-0-0 3
Course Outcomes:
Familiarity with the essential protocols of IoT and their operations
Design and implementation of IoT networks
Identifying various design parameters for developing IoT applications
UNIT-1
Introduction: Definition and functional requirements, History of IoT, Architecture, Major
components of IOT devices, Enabling technologies of IoT, Four pillars of IoT, DNA of IoT,
Overview of wireless communication technologies, Internet and Web 3.0 View of IoT, Ubiquitous
IoT applications, Toolkit approach for End-user participation in IoT.
UNIT-2
Programming the Microcontroller for IoT: Basics of Sensors and actuators, Examples and working
principles of sensors and actuators, Arduino/Equivalent microcontroller platform, Setting up the
board, Programming for IoT; Reading from Sensors Communication: Connecting microcontroller
with mobile devices, Communication through bluetooth and USB, Connection with the internet
using wi-fi/ethernet.
UNIT-3
IoT-Middleware and Protocols: Overview of middleware, Communication middleware for IoT, LBS
and surveillance middleware, IoT information security, Protocol standardization for IoT, Efforts,
M2M and WSN protocols, SCADA and RFID protocols, Issues with IoT standardization, Unified
data standards, Protocols, IEEE 802.15.4, BACNet protocol, Modbus, KNX,
Zigbee,Zwave,6LOWPAN, Architecture, Network layer, APS layer, Security.
UNIT-4
Web of Things:WoTvs. IoT, Two pillars of the Web, Architecture Standardization for WoT, Platform
middleware for WoT, Unified Multitier WoT architecture, WoT portals and business intelligence.
UNIT - 5:
Cloud of Things: Grid/SOA and cloud computing, Cloud middleware, Cloud standards, Cloud
providers and systems, IoT and cloud computing, Set up cloud environment - Send data from
microcontroller to cloud, Mobile cloud computing, Cloud of things architecture.
UNIT-6
IoT Physical Servers and Cloud Offerings: Introduction to Cloud Storage models and
communication APIs, Webserver – Web server for IoT, Cloud for IoT, Python web application
framework, Designing a RESTful web API.
Text Book:
Honbo Zhou, “The Internet of Things in the Cloud: A Middleware Perspective”, CRC Press, 2012.
Reference Books:
30. Hakima Chaouchi, “The Internet of Things, Connecting objects to the web”, ISTE & Wiley
Publications, 2010.
31. Dieter Uckelmann, Mark Harrison, Florian Michahelles, “Architecting the Internet of Things”,
Springer Science & Business Media, 2011.
32. Charalampos Doukas, “Building Internet of Things with the Arduino”, Create space, 2002.
33. Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stefan Aves and, Stamatis Karnouskos,
David Boyle, “From Machine-to-Machine to the Internet of Things: Introduction to a New
Age of Intelligence”, 1st Edition, Academic Press, 2014.
Course Code Course Name Course Category L-T-P Credits
Course Content:
Unit - I (8 Contact hours)
History of Information Security, Understanding security, CNSS security model, Security in SDLC,
Types of threats and attacks, Principles of Information Security, Laws and Ethics for Information
Security, Introduction to IT ACT, International Laws and Legal bodies.
Unit - II (8 Contact hours)
Asset, Asset classification, Understanding the basics of Information Security Policy, Standards and
Practices, Types of Policies, Policy development process, ISO 27001, Business Continuity
Planning, Disaster Recovery, Maintaining Backups.
Unit - III (8 Contact hours)
Identification, Assessment, Analysis, Control of Risk, Quantitative vs Qualitative Risk
Management, FAIR approach to risk assessment, NIST Risk management framework,
Authentication vs Authorization, Types of authentication, Understanding different types of Access
Controls(ACLs, RBAC, RUBAC etc.).
Unit - IV (8 Contact hours)
Overview of Firewalls, VPNs, DMZs, IDS, IPS, Honeypots, Detection methods, various network
analysis tools.
Unit - V (8 Contact hours)
OS security, OWASP Top 10 web application security vulnerabilities, Mobile Devices risks,
OWASP Top 10 mobile application security vulnerabilities.
Unit – VI (5 Contact hours)
Physical Vulnerability Assessment, Securing Assets, Physical Intrusion Detection, Procedures and
Methods to maintain the implemented information Security.
Learning resources
Text book:
1. Whitman, Michael E., and Herbert J. Mattord, ‘Principles of Information Security’, Cengage
Learning India Private Limited, 5th edition
Reference Books:
1. Mark Rhodes and Ousley, ‘Information Security: The Complete Reference’, McGraw-Hill
Education; 2nd edition.
2. Stuart McClure , Joel Scambray and George Kurtz, ‘Hacking Exposed 7’, McGraw- Hill
Education; 7th edition.
Course outcomes: At the end of the course, the student will be able to
CO 1 Analyze any organization for information security loopholes.
CO 2 Create and implement information security policies for any organization.
CO 3 Create and maintain information asset register.
CO 4 Implement Information Security framework for an organization.
Identify the Information security risk, estimate its severity and recommend
CO 5
solutions.
CO 6 Test any application (system, web and mobile) for the technical risks.
Assessment Method:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
***************************************************************************
Course Code Course Name Course Category L-T-P Credits
Course Content:
UNIT I (Introduction to Robotics) (7 Contact hours)
What is robot and robotics, already designed robots, Manual and Autonomous robots, Different
types of industrial ARM robots, and arm design, Coordinate transformations for more motor
moments, Electrical connections of different boards and modules: How to connect closed circuit,
digital and analog pins connections.
UNIT II (Robotic Principles) (7 Contact hours)
Robotic functions Geometrical commands, Edit commands. Selecting robot views, standard Robot
part, using the parts in a simulation.
UNIT III (Robotic Motion ) (7 Contact hours)
Types of motion, velocity and acceleration, Types of simulation motion Harmonic motion,
parabolic motion, uniform motion velocity and acceleration analysis for robots.
UNIT IV (Actuators and sensors) (7 Contact hours)
Introduction to Arduino, Actuators, Sensors, Wired and wireless communication, I/O
communication through USB cable, Bluetooth HC05, RF modules, DTMF module, Xbee modules.
UNIT V (Robotics Simulation) (8 Contact hours) Simulation
packages, Loading the simulation, Simulation editors, delay, Resume commands. Slide commands,
program flow control. Robot motion control, Analysis of robot elements, Robotic linkages.
UNIT VI (Basic robots and Raspberry pi) (10 Contact hours)
Line follower: Line follower robot design and control with Arduino board, Obstacles avoider:
Obstacle avoider robot with IR sensors and Arduino board, Mobile controller: Mobile controller
robot with DTMF module and HC05 module, Introduction to Raspberry pi: What is raspberry and
differences between Arduino and raspberry pi, Applications of robotics.
Learning resources:
Text book:
1. Robotics for engineers by Yoram Koren
2. John J. Craig - Introduction to Robotics: Mechanics and Control, Pearson, Upper Saddle
River, NJ, 2005.
3. Marco Schwartz - Internet of Things with Arduino Cookbook.
4. P.A. Janaki Raman, Robotics and Image Processing an Introduction, Tata Mc Graw Hill
Publishing company Ltd., 1995.
5. Richard D. Klafter, Thomas .A, Chri Elewski, Michael Negin, Robotics Engineering an
Integrated Approach, Phi Learning., 2009.
6. Mikell P Groover & Nicholas G Odrey, Mitchel Weiss, Roger N Nagel, Ashish Dutta,
Industrial Robotics, Technology programming and Applications, Tata McGraw-Hill
Education, 2011.
Reference Books:
1. Myke Predko, “Programming Robot Controllers” – McGrawHill, 1st edition, 2003.
2. Murphy Robin R,” Introduction to AI Robotics”, MIT Press, 2000.
3. Siegwart R and Nourbakhsh I.R, “Introduction to Autonomous mobile Robots”, Prentice Hall
India, 2005.
Web resources:
https://ieeexplore.ieee.org/document/833572/ by K Taylor - 2000
https://www.iste.org/explore/articleDetail?articleid=846&category=In-the.Nov 1, 2016
www.ieee-ras.org/...resources.../educational-material-in-robotics-and-automation2015 - SyRoTek -
System for robotic e-learning
Course outcomes: At the end of the course, the student will be able to
****************************************************************
Course Code Course Name Course Category L-T-P Credits
CS4256 Computer Forensics PEC 3-0-0 3
Course Content:
**************************************************************************
LIST OF OPEN ELECTIVES (OEC)
Course Course
Course Name L-T-P Credits
code Category
Object Oriented Programing
CSXX61 OEC 3-0-0 3
through JAVA
Course Outcomes: At the end of the course, the student will be able to
CO 1 Explain OOP Principles and Write Basic Java Programs.
CO 2 Defining Classes and Objects. Identify classes, objects, members of a class
and relationships among them needed for a specific problem
CO 3 To be able to write Java Programs to demonstrate method overloading and
Demonstrate the concepts of polymorphism and inheritance. Discuss method
overriding V/s method overloading.
CO 4 Explain the benefits of JAVA’s Exceptional handling mechanism compared to
other Programming Language
CO 5 To be able to write Java Programs to demonstrate Packages and Threading
concepts.
CO 6 Discuss and Demonstrate the AWT Concepts and develop the AWT
Applications.
Assessment Method
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
***************************************************************************
Course Course
Course name L-T-P Credits
code Category
CSXX62 Database Management Systems OEC 3-0-0 3
Course Content:
Unit I (8 Contact hours)
Introduction to database systems, File System vs. Database Systems, Database system structure,
Views of data in a database system, Data models and Database languages.
Introduction to Entity-Relationship data model, Elements of an ER model, Constructing ER
diagrams, Modelling of constraints, Reduction of ER diagrams to tables.
Unit II (6 Contact Hours)
Basics of relational model, ER diagrams to relational design, Relational algebra: Simple operations
and extended operations, writing relational algebra expressions for queries, Introduction to tuple
relational calculus and writing basic queries using tuple calculus
Unit III (9 Contact Hours)
Basic structure of SQL queries, Writing simple queries, Complex queries and nested Subqueries in
SQL, Aggregate functions in SQL, Effect of NULL values on result, Defining a Relational Schema,
View definitions and constraints, types of keys.
Unit IV (7 Contact hours)
Features of Good Relational Designs, Atomic Domains and First Normal Form, Problems
encountered in bad schema design, Motivation for normal forms, Dependency theory-functional
dependencies, Armstrong’s Axioms for FD, Closure of a set of FD’s, Minimal Cover, Definition of
1NF, 2NF, 3NF and BCNF, Decomposition and desirable properties of them, Algorithms for 3NF
and BCNF normalization.
Unit V (6 Contact hours)
Storing data in disk and files and the memory hierarchy, RAID, Disk space management, Buffer
manager, File organization and indexes.
Unit VI (9 Contact hours )
Transaction concept, ACID properties, Concurrency in a DBMS, Serializability and Recoverability,
Concurrency control Protocols (lock-based and time-stamp based)
Text Books
1. Silberschatatz, H. F. Korth and S. Sudarshan, Database System Concepts, 5/e, McGraw
Hill,2006
2. R. Ramakrishnan and J. Gehrke, Database System Concepts, 3/e, McGraw Hill, 2003
Reference Books
1. Ramez Elmasri, Shamkant B. Navathe , Fundamentals of Database (7th Edition),
Paperback, 2007
2. Theorey T J, Database Modeling & Design, 2/e, Morgan Kaufmann Publishers, 1994.
3. H. GarciaMolina, J. D. Ullman and J. Widom, Database Systems The Complete Book, 1/e,
Pearson Education, 2007
Web resources:
Department of CS&E, IIT M, “Introduction to Database Sytems and Design”,
https://nptel.ac.in/courses/106106095/
Indian Institute of Technology, Kharagpur, “ Database Management Systems”,
https://nptel.ac.in/courses/106105175/
Course outcomes: At the end of the course, the student will be able to
CO 1 Demonstrate the basic elements of a relational database management system,
CO 2 Ability to identify the data models for relevant problems.
Ability to design entity relationship and convert entity relationship diagrams
CO 3
into RDBMS and formulate SQL queries on the respect data.
CO 4 Apply normalization for the development of application software
CO 5 Ability to learn about Disk Management, Buffer management
CO 6 Ability learn about transaction management
For Theory courses only:
Course Nature Theory
Assessment Method
Assessment Weekly tests Monthly tests End Semester Test Total
Tool
Weightage (%) 10% 30% 60% 100%
**************************************************************
Course
Course Code Course Name L-T-P Credits
Category
Digital Image
CSXX65 OEC 3-0-0 3
Processing
Course Objectives:
1. To study the image fundamentals and mathematical transforms necessary for image
processing.
2. To study the image enhancement techniques
3. To analyze images in the frequency domain using various transforms.
4. To study image restoration procedures.
5. To study Image Compression and Segmentation used in digital image processing.
6. To study image feature extraction methods.
Course Content:
UNIT I (9 Contact hours)
Digital image fundamentals – Electromagnetic spectrum and imaging, Image acquisition, image
formation. Digitization-sampling and quantization, Resolution-pixel, gray scale, spatial, basic
relationship between pixels, Distance measure, Mathematical operations on image, Geometrical and
spatial transformation.
Course Outcomes:
1. Be able to apply, design and implement solutions for digital image processing problems.
2. Be able to discuss the strengths and limitations of DIP applications in solving problems with
both professional peers and lay clients.
Course Outcomes:
34. Understand the architectural components of a block chain system
35. Understand the inner workings of smart contracts as means for developing decentralized
applications
36. understand the details of interactions between the enclosed smart contract network and the
external world, be aware of further implications these interactions pose to the aspect of
decentralization
UNIT-1
Introduction to Block chain: The story of a transaction, From Transactions to Blocks, Blocks and
Distributed Consensus, Design Primitives Protocols, Security, Consensus, Permissions, Privacy
Block chain Architecture and Design Basic crypto primitives of Hash, Signature, Hash chain to
Block chain Basic mechanisms, Introduction to major block chain platforms.
UNIT-2
Development environments in block chain: Requirements for the consensus protocols, Proof of
Work, Scalability aspects of Block chain consensus protocols, Permission Block chains Design
goals; Block chain deployment, Mining and forking, Segregated Witness Block chain architectures-
Abstract Architecture, Introduction to major block chain platforms.
UNIT-3
Block chain in Multitude of clients in Ethereum, Production and test networks in Ethereum, Public,
private and development deployments; Solidity in depth, Building blocks popular contracts already
in deployment; Consensus protocols for Permissioned Block chains; Hyperledger Fabric I:
Decomposing the consensus process, Hyperledger fabric components, Chain code Design and
Implementation; Hyperledger Fabric II: Beyond Chain code: fabric SDK and Front End
Hyperledger composer tool.
UNIT- 4
Block chain in Financial Software and Systems Settlements KYC, Capital markets, Insurance Block
chain in trade/supply chain, and Provenance o Block chain for Government: Digital identity, land
records and other kinds of public distribution system / social welfare systems; Conceptual
distinction between a payment system and a decentralized applications platform. Differences in
their architectures from security-first aspect to a rich feature set, Future roadmap for them,
following their own paths with probable interconnections.
UNIT-5
Block chain Cryptography: Privacy and Security on Block chain, Research aspects: Secure
cryptographic protocols on Block chain; Secured Multi-party Computation;
UNIT-6
Block chain for science making better use of the data-mining network; Considerations for
production deployment a) Quality of decentralized applications in Code patterns, Security Other
smart contract platforms, Discussion of future prospects.
Text Books
Robert C. Hackney, “Lawyer's Guide to Block chain Technology: What it is and how it will disrupt
the practice of law”, Kindle Edition, O’Reilly Publishing, 2017.
Reference Books
Andreas Antonopoulos, “Mastering Bit Coin”, O’Reilly Publishing, 2014.
Stephan Fleming, “Block chain Technology & Micro services Architecture: A Non-Programmer’s
Handbook “Kindle Edition, Neha Dubey, 2018.