Ug Cse Co With Syllabus
Ug Cse Co With Syllabus
Ug Cse Co With Syllabus
AFFILIATED INSTITUTIONS
B.E. COMPUTER SCIENCE AND ENGINEERING
REGULATIONS – 2017
CHOICE BASED CREDIT SYSTEM
2. Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex engineering
activities with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
1
11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one‘s own work, as a member
and leader in a team, to manage projects and in multidisciplinary environments.
12. Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.
To apply software engineering principles and practices for developing quality software for scientific
and business applications.
To adapt to emerging Information and Communication Technologies (ICT) to innovate ideas and
solutions to existing/novel problems.
2
PEOs
3
7. Environment and sustainability:
Understand the impact of the professional
engineering solutions in societal and
environmental contexts, and demonstrate the 2 1
knowledge of, and need for sustainable
development.
PSOs
1. Analyze, design and develop computing solutions by applying foundational concepts of
3 1
computer science and engineering.
2. Apply software engineering principles and practices for developing quality software for
3 1
scientific and business applications.
3. Adapt to emerging information and communication technologies (ICT) to innovate ideas
1 3
and solutions to existing/novel problems.
4
MAPPING OF COURSE OUTCOMES WITH PROGRAMME OUTCOMES
A broad relation between the Course Outcomes and Programme Outcomes is given in the
following table
Technical English √ √ √ √
Engineering √ √ √ √
Mathematics II
Physics for √ √ √
Information
Science
Basic Electrical, √ √ √
Electronics and
Measurement
Engineering
Environmental √ √ √ √
√ √ √ √
Science and
Engineering
Programming in C √ √ √ √ √ √ √
Engineering √ √ √ √ √ √ √
√ √ √
Practices
Laboratory
C Programming √ √ √ √ √ √ √
Laboratory
5
PROGRAMME OUTCOME (PO)
COURSE
1 2 3 4 5 6 7 8 9 10 11 12
TITLE
Discrete √ √ √ √
Mathematics
Digital
√ √ √
Principles and
Design
Data Structures √ √ √
Object Oriented √ √ √
Programming
Communication √ √ √
Engineering
Data Structures √ √ √ √
√ √ √
Laboratory
Object Oriented
√ √ √ √
Programming √ √ √
Laboratory
Digital Systems √ √ √ √ √
√ √ √
Laboratory
Interpersonal
√ √ √ √
Skills/Listening
&Speaking
Probability and
√ √ √
Queueing √ √ √
Theory
Computer √ √ √
Architecture
Database
Management √ √ √
Systems
Design and
√ √ √
Analysis of √ √ √
Algorithms
Operating
√ √ √
Systems
Software √ √ √ √ √ √ √
√ √
Engineering
Database
Management √ √ √
√ √ √ √
Systems
Laboratory
Operating
√ √ √
Systems √ √ √ √
Laboratory
Advanced
√ √ √ √
Reading and
Writing
6
Algebra and √
√ √ √
Number Theory
Computer
√ √ √
Networks
Microprocessors
and √ √ √
Microcontrollers
Theory of
√ √ √
Computation
Object Oriented
√
Analysis and √ √ √
Design
Open Elective I
Microprocessors
and √ √ √ √ √ √ √
Microcontrollers
Laboratory
Object Oriented
Analysis and √ √ √ √ √
√ √ √ √
Design
Laboratory
Networks √ √ √
√ √ √ √
Laboratory
Internet √ √ √ √ √ √ √
Programming
Artificial √ √ √
Intelligence
Mobile √ √ √
Computing
Compiler Design √ √ √ √ √ √ √
Distributed √ √ √
Systems
Professional
Elective I
Internet
√ √ √ √ √ √ √ √
Programming
Laboratory
Mobile
Application √ √ √ √ √ √ √ √ √
Development
Laboratory
Mini Project √ √ √ √ √ √ √ √ √ √ √ √
Professional
Communication
Principles of √ √ √ √
SEMESTER VII
YEAR IV
Management
Cryptography
√ √ √
and Network
Security
Cloud Computing √ √ √
Open Elective II
Professional
7
Elective II
Professional
Elective III
Cloud Computing √ √ √ √ √ √ √ √
Laboratory
Security √ √ √ √ √ √ √ √
Laboratory
Professional
SEMESTER VIII
Elective IV
Professional
Elective V
Project Work
√ √ √ √ √ √ √ √ √ √ √ √
8
PROFESSIONAL ELECTIVES
9
ANNA UNIVERSITY, CHENNAI
AFFILIATED INSTITUTIONS
B.E. COMPUTER SCIENCE AND ENGINEERING
REGULATIONS – 2017
CHOICE BASED CREDIT SYSTEM
I - VIII SEMESTERS CURRICULA AND SYLLABI
SEMESTER I
SI. COURSE CONTACT
COURSE TITLE CATEGORY L T P C
No CODE PERIODS
THEORY
1. HS8151 Communicative English HS 4 4 0 0 4
2. MA8151 Engineering
BS 4 4 0 0 4
Mathematics - I
3. PH8151 Engineering Physics BS 3 3 0 0 3
4. CY8151 Engineering Chemistry BS 3 0 0 3
3
5. GE8151 Problem Solving and
ES 3 3 0 0 3
Python Programming
6. GE8152 Engineering Graphics ES 6 2 0 4 4
PRACTICALS
7. GE8161 Problem Solving and ES 4
Python Programming 0 0 4 2
Laboratory
8. BS8161 Physics and Chemistry BS 4
0 0 4 2
Laboratory
TOTAL 31 19 0 12 25
SEMESTER II
COURSE CONTACT
SI.No COURSE TITLE CATEGORY L T P C
CODE PERIODS
THEORY
1. HS8251 Technical English HS 4 4 0 0 4
2. MA8251 Engineering BS
4 4 0 0 4
Mathematics - II
3. PH8252 Physics for Information BS
3 3 0 0 3
Science
4. BE8255 Basic Electrical, ES
Electronics and
3 3 0 0 3
Measurement
Engineering
5. GE8291 Environmental Science HS
3 3 0 0 3
and Engineering
6. CS8251 Programming in C PC 3 3 0 0 3
PRACTICALS
7. GE8261 Engineering Practices ES 4
0 0 4 2
Laboratory
8. CS8261 C Programming PC 4
0 0 4 2
Laboratory
TOTAL 28 20 0 8 24
10
SEMESTER III
COURSE CONTACT
Sl.No COURSE TITLE CATEGORY L T P C
CODE PERIODS
THEORY
1. MA8351 Discrete Mathematics BS 4 4 0 0 4
2. Digital Principles and
CS8351 ES 4 4 0 0 4
System Design
3. CS8391 Data Structures PC 3 3 0 0 3
4. Object Oriented
CS8392 PC 3 3 0 0 3
Programming
5. Communication
EC8395 ES 3 3 0 0 3
Engineering
PRACTICALS
6. Data Structures
CS8381 PC 4 0 0 4 2
Laboratory
7. Object Oriented
CS8383 PC 4 0 0 4 2
Programming Laboratory
8. Digital Systems
CS8382 ES 4 0 0 4 2
Laboratory
9. Interpersonal
HS8381 Skills/Listening EEC 2 0 0 2 1
&Speaking
TOTAL 31 17 0 14 24
SEMESTER IV
Sl. COURSE CONTACT
COURSE TITLE CATEGORY L T P C
No CODE PERIODS
THEORY
1. MA8402 Probability and Queueing BS
4 4 0 0 4
Theory
2. CS8491 Computer Architecture PC 3 3 0 0 3
3. CS8492 Database Management PC
3 3 0 0 3
Systems
4. CS8451 Design and Analysis of PC
3 3 0 0 3
Algorithms
5. CS8493 Operating Systems PC 3 3 0 0 3
6. CS8494 Software Engineering PC 3 3 0 0 3
PRACTICALS
7. CS8481 Database Management PC
4 0 0 4 2
Systems Laboratory
8. CS8461 Operating Systems PC
4 0 0 4 2
Laboratory
9. HS8461 Advanced Reading and EEC
2 0 0 2 1
Writing
TOTAL 29 19 0 10 24
11
SEMESTER V
Sl. COURSE CONTACT
COURSE TITLE CATEGORY L T P C
No CODE PERIODS
THEORY
1. MA8551 Algebra and Number
BS 4 4 0 0 4
Theory
2. CS8591 Computer Networks PC 3 3 0 0 3
3. EC8691 Microprocessors and
PC 3 3 0 0 3
Microcontrollers
4. CS8501 Theory of Computation PC 3 3 0 0 3
5. CS8592 Object Oriented Analysis
PC 3 3 0 0 3
and Design
6. Open Elective I OE 3 3 0 0 3
PRACTICALS
7. EC8681 Microprocessors and
PC 4 0 0 4 2
Microcontrollers Laboratory
8. CS8582 Object Oriented Analysis
PC 4 0 0 4 2
and Design Laboratory
9. CS8581 Networks Laboratory PC 4 0 0 4 2
TOTAL 31 19 0 12 25
SEMESTER VI
12
SEMESTER VII
SEMESTER VIII
13
HUMANITIES AND SOCIAL SCIENCES (HS)
14
PROFESSIONAL CORE (PC)
Sl. COURSE COURSE TITLE CATEGORY CONTACT L T P C
NO CODE PERIODS
1. CS8251 Programming in C PC 3 3 0 0 3
2. CS8261 C Programming Laboratory PC 4 0 0 4 2
3. CS8391 Data Structures PC 3 3 0 0 3
4. CS8392 Object Oriented
PC 3 3 0 0 3
Programming
5. CS8381 Data Structures Laboratory PC 4 0 0 4 2
6. CS8383 Object Oriented
PC 4 0 0 4 2
Programming Laboratory
7. CS8491 Computer Architecture PC 3 3 0 0 3
8. CS8492 Database Management
PC 3 3 0 0 3
Systems
9. CS8451 Design and Analysis of
PC 3 3 0 0 3
Algorithms
10. CS8493 Operating Systems PC 3 3 0 0 3
11. CS8494 Software Engineering PC 3 3 0 0 3
12. CS8481 Database Management
PC 4 0 0 4 2
Systems Laboratory
13. CS8461 Operating Systems
PC 4 0 0 4 2
Laboratory
14. CS8591 Computer Networks PC 3 3 0 0 3
15. EC8691 Microprocessors and
PC 3 3 0 0 3
Microcontrollers
16. CS8501 Theory of Computation PC 3 3 0 0 3
17. CS8592 Object Oriented Analysis
PC 3 3 0 0 3
and Design
18. EC8681 Microprocessors and
PC 4 0 0 4 2
Microcontrollers Laboratory
19. CS8582 Object Oriented Analysis
PC 4 0 0 4 2
and Design Laboratory
20. CS8581 Networks Laboratory PC 4 0 0 4 2
21. CS8651 Internet Programming PC 3 3 0 0 3
22. CS8691 Artificial Intelligence PC 3 3 0 0 3
23. CS8601 Mobile Computing PC 3 3 0 0 3
24. CS8602 Compiler Design PC 5 3 0 2 4
25. CS8603 Distributed Systems PC 3 3 0 0 3
26. CS8661 Internet Programming
PC 4 0 0 4 2
Laboratory
27. CS8662 Mobile Application
PC 4 0 0 4 2
Development Laboratory
28. CS8792 Cryptography and Network
PC 3 3 0 0 3
Security
29. CS8791 Cloud Computing PC 3 3 0 0 3
30. CS8711 Cloud Computing
PC 4 0 0 4 2
Laboratory
31. IT8761 Security Laboratory PC 4 0 0 4 2
15
PROFESSIONAL ELECTIVES (PE)
SEMESTER VI
ELECTIVE - I
SI. COURSE CONTACT
COURSE TITLE CATEGORY L T P C
No CODE PERIODS
1. CS8075 Data Warehousing and
PE 3 3 0 0 3
Data Mining
2. IT8076 Software Testing PE 3 3 0 0 3
3. IT8072 Embedded Systems PE 3 3 0 0 3
4. CS8072 Agile Methodologies PE 3 3 0 0 3
5. CS8077 Graph Theory and
PE 3 3 0 0 3
Applications-
6. IT8071 Digital Signal Processing PE 3 3 0 0 3
7. GE8075 Intellectual Property
PE 3 3 0 0 3
Rights
SEMESTER VII
ELECTIVE - II
SI. COURSE CONTACT
COURSE TITLE CATEGORY L T P C
No CODE PERIODS
1. CS8091 Big Data Analytics PE 3 3 0 0 3
2. CS8082 Machine Learning
PE 3 3 0 0 3
Techniques
3. CS8092 Computer Graphics and
PE 3 3 0 0 3
Multimedia
4. IT8075 Software Project
PE 3 3 0 0 3
Management
5. CS8081 Internet of Things PE 3 3 0 0 3
6. IT8074 Service Oriented
PE 3 3 0 0 3
Architecture
7. GE8077 Total Quality Management PE 3 3 0 0 3
SEMESTER VII
ELECTIVE - III
SI. COURSE CONTACT
COURSE TITLE CATEGORY L T P C
No CODE PERIODS
1. CS8083 Multi-core Architectures and
PE 3 3 0 0 3
Programming
2. CS8079 Human Computer
PE 3 3 0 0 3
Interaction
3. CS8073 C# and .Net Programming PE 3 3 0 0 3
4. CS8088 Wireless Adhoc and Sensor
PE 3 3 0 0 3
Networks
5. CS8071 Advanced Topics on
PE 3 3 0 0 3
Databases
6. GE8072 Foundation Skills in
Integrated Product PE 3 3 0 0 3
Development
7. GE8074 Human Rights PE 3 3 0 0 3
8. GE8071 Disaster Management PE 3 3 0 0 3
16
SEMESTER VIII
ELECTIVE - IV
SI. COURSE CONTACT
COURSE TITLE CATEGORY L T P C
No CODE PERIODS
1. EC8093 Digital Image Processing PE 3 3 0 0 3
2. CS8085 Social Network Analysis PE 3 3 0 0 3
3. IT8073 Information Security PE 3 3 0 0 3
4. CS8087 Software Defined Networks PE 3 3 0 0 3
5. CS8074 Cyber Forensics PE 3 3 0 0 3
6. CS8086 Soft Computing PE 3 3 0 0 3
7. GE8076 Professional Ethics in
PE 3 3 0 0 3
Engineering
SEMESTER VIII
ELECTIVE - V
SI. COURSE CONTACT
COURSE TITLE CATEGORY L T P C
No CODE PERIODS
1. CS8080 Information Retrieval
PE 3 3 0 0 3
Techniques
2. CS8078 Green Computing PE 3 3 0 0 3
3. CS8076 GPU Architecture and
PE 3 3 0 0 3
Programming
4. CS8084 Natural Language Processing PE 3 3 0 0 3
5. CS8001 Parallel Algorithms PE 3 3 0 0 3
6. IT8077 Speech Processing PE 3 3 0 0 3
7. GE8073 Fundamentals of Nano
PE 3 3 0 0 3
Science
17
SUMMAR
Y
1. HS 4 7 3 14 7.60%
2. BS 12 74 4 4 31 16.8%
3. ES 9 59 23 12.5%
4. PC 5
10 19 18 20 10 82 44.5%
5. PE 3 6 6 15 8.15%
6. OE 3 3 6 3.3%
7. EEC 1 1 2 10 14 7.65%
Total 25 24 24 24 25 25 22 16 185
Non Credit /
8.
Mandatory
HS8151 L T P C
COMMUNICATIVE ENGLISH
4 0 0 4
OBJECTIVES:
To develop the basic reading and writing skills of first year engineering and technology
students.
To help learners develop their listening skills, which will, enable them listen to lectures and
comprehend them by asking questions; seeking clarifications.
To help learners develop their speaking skills and speak fluently in real contexts.
To help learners develop vocabulary of a general kind by developing their reading skills
OUTCOMES:
AT THE END OF THE COURSE, LEARNERS WILL BE ABLE TO:
• Read articles of a general kind in magazines and newspapers.
• Participate effectively in informal conversations; introduce themselves and their friends
and express opinions in English.
• Comprehend conversations and short talks delivered in English
• Write short essays of a general kind and personal letters and emails in English.
OUTCOMES:
Upon completion of the course, students will be able to:
Write, test, and debug simple Python programs.
Implement Python programs with conditionals and loops.
Develop Python programs step-wise by defining functions and calling them.
Use Python lists, tuples, dictionaries for representing compound data.
Read and write data from/to files in Python.
BS8161
PHYSICS AND CHEMISTRY LABORATORY L T P C
(Common to all branches of B.E. / B.Tech Programmes) 0 0 4 2
OBJECTIVES:
To introduce different experiments to test basic understanding of physics concepts applied in optics,
thermal physics, properties of matter and liquids.
LIST OF EXPERIMENTS: PHYSICS LABORATORY (Any 5 Experiments)
1. Determination of rigidity modulus – Torsion pendulum
2. Determination of Young‘s modulus by non-uniform bending method
3. (a) Determination of wavelength, and particle size using Laser
(b) Determination of acceptance angle in an optical fiber.
4. Determination of thermal conductivity of a bad conductor – Lee‘s Disc method.
5. Determination of velocity of sound and compressibility of liquid – Ultrasonic interferometer
6. Determination of wavelength of mercury spectrum – spectrometer grating
7. Determination of band gap of a semiconductor
8. Determination of thickness of a thin wire – Air wedge method
OUTCOMES:
Upon completion of the course, the students will be able to
TOTAL: 30 PERIODS
Apply principles of elasticity, optics and thermal properties for engineering applications.
OBJECTIVES:
To make the student to acquire practical skills in the determination of water
quality parameters through volumetric and instrumental analysis.
To acquaint the students with the determination of molecular weight of a
polymer by viscometery.
1. Estimation of HCl using Na2CO3 as primary standard and Determination of alkalinity in water
sample.
2. Determination of total, temporary & permanent hardness of water by EDTA method.
3. Determination of DO content of water sample by Winkler‘s method.
4. Determination of chloride content of water sample by argentometric method.
5. Estimation of copper content of the given solution by Iodometry.
6. Determination of strength of given hydrochloric acid using pH meter.
7. Determination of strength of acids in a mixture of acids using conductivity meter.
8. Estimation of iron content of the given solution using potentiometer.
9. Estimation of iron content of the water sample using spectrophotometer (1, 10-
Phenanthroline / thiocyanate method).
10. Estimation of sodium and potassium present in water using flame photometer.
11. Determination of molecular weight of polyvinyl alcohol using Ostwald viscometer.
12. Pseudo first order kinetics-ester hydrolysis.
13. Corrosion experiment-weight loss method.
14. Determination of CMC.
15. Phase change in a solid.
16. Conductometric titration of strong acid vs strong base.
OUTCOMES:
The students will be outfitted with hands-on knowledge in the quantitative chemical analysis
of water quality related parameters.
TOTAL: 30 PERIODS
HS8251 L T P C
TECHNICAL ENGLISH
4 0 0 4
OBJECTIVES:
The Course prepares second semester engineering and Technology students to:
• Develop strategies and skills to enhance their ability to read and comprehend engineering
and technology texts.
• Foster their ability to write convincing job applications and effective reports.
• Develop their s p e a k i n g skills to make technical presentations, participate in
group discussions.
•Strengthen their listening skill which will help them comprehend lectures and talks in their
areas of specialization.
UNIT I INTRODUCTION TECHNICAL ENGLISH 12
Listening- Listening to talks mostly of a scientific/technical nature and completing information-gap
exercises- Speaking –Asking for and giving directions- Reading – reading short technical texts
from journals- newsapapers- Writing- purpose statements – extended definitions – issue- writing
instructions – checklists-recommendations-Vocabulary Development- technical vocabulary
Language Development –subject verb agreement - compound words.
OUTCOMES:
At the end of the course learners will be able to:
Read technical texts and write area- specific texts effortlessly.
Listen and comprehend lectures and talks in their area of specialization successfully.
Speak appropriately and effectively in varied formal and informal contexts.
Write reports and winning job applications.
MA8251 ENGINEERING MATHEMATICS – II L T P C
4 0 0 4
OBJECTIVES:
This course is designed to cover topics such as Matrix Algebra, Vector Calculus, Complex
Analysis and Laplace Transform. Matrix Algebra is one of the powerful tools to handle practical
problems arising in the field of engineering. Vector calculus can be widely used for modelling the
various laws of physics. The various methods of complex analysis and Laplace transforms can be
used for efficiently solving the problems that occur in various branches of engineering disciplines.
UNIT I MATRICES 12
Eigenvalues and Eigenvectors of a real matrix – Characteristic equation – Properties of
Eigenvalues and Eigenvectors – Cayley-Hamilton theorem – Diagonalization of matrices –
Reduction of a quadratic form to canonical form by orthogonal transformation – Nature of quadratic
forms.
TOTAL: 45 PERIODS
OUTCOMES:
Environmental Pollution or problems cannot be solved by mere laws. Public participation is an
important aspect which serves the environmental Protection. One will obtain knowledge on
the following after completing the course.
Public awareness of environmental is at infant stage.
Ignorance and incomplete knowledge has lead to misconceptions
Development and improvement in std. of living has lead to serious environmental disasters
CS8251 PROGRAMMING IN C LT P C
3 0 0 3
OBJECTIVES:
To develop C Programs using basic programming constructs
To develop C programs using arrays and strings
To develop applications in C using functions , pointers and structures
To do input/output and file handling in C
OUTCOMES:
Upon completion of the course, the students will be able to
Develop simple applications in C using basic constructs
Design and implement applications using arrays and strings
Develop and implement applications in C using functions and pointers.
Develop applications in C using structures.
Design applications using sequential and random access file processing.
BUILDINGS:
(a) Study of plumbing and carpentry components of residential and industrial buildings.
Safety aspects.
PLUMBING WORKS:
(a) Study of pipeline joints, its location and functions: valves, taps, couplings, unions,
reducers, elbows in household fittings.
(b) Study of pipe connections requirements for pumps and turbines.
(c) Preparation of plumbing line sketches for water supply and sewage works.
(d) Hands-on-exercise:
Basic pipe connections – Mixed pipe material connection – Pipe connections with
different joining components.
BASIC MACHINING:
(a) Simple Turning and Taper turning
(b) Drilling Practice
ELECTRICAL
1. Assorted electrical components for house wiring 15 Sets
2. Electrical measuring instruments 10 Sets
3. Study purpose items: Iron box, fan and regulator, emergency lamp 1 each
4. Megger (250V/500V) 1 No.
5. Power Tools: (a) Range Finder 2 Nos
(b) Digital Live-wire detector 2 Nos
ELECTRONICS
1. Soldering guns 10 Nos.
2. Assorted electronic components for making circuits 50 Nos.
3. Small PCBs 10 Nos.
4. Multimeters 10 Nos.
5. Study purpose items: Telephone, FM radio, low-voltage power
supply
CS8261 C PROGRAMMING LABORATORY LTPC
0 042
OBJECTIVES:
To develop programs in C using basic constructs.
To develop applications in C using strings, pointers, functions, structures.
To develop applications in C using file processing.
LIST OF EXPERIMENTS:
1. Programs using I/O statements and expressions.
2. Programs using decision-making constructs.
3. Write a program to find whether the given year is leap year or Not? (Hint: not every
centurion year is a leap. For example 1700, 1800 and 1900 is not a leap year)
4. Design a calculator to perform the operations, namely, addition, subtraction, multiplication,
division and square of a number.
5. Check whether a given number is Armstrong number or not?
6. Given a set of numbers like <10, 36, 54, 89, 12, 27>, find sum of weights based on the
following conditions.
5 if it is a perfect cube.
4 if it is a multiple of 4 and divisible by 6.
3 if it is a prime number.
Sort the numbers based on the weight in the increasing order as shown below
<10,its weight>,<36,its weight><89,its weight>
7. Populate an array with height of persons and find how many persons are above the
average height.
8. Populate a two dimensional array with height and weight of persons and compute the Body
Mass Index of the individuals.
9. Given a string ―a$bcd./fg‖ find its reverse without changing the position of special
characters.
(Example input:a@gh%;j and output:j@hg%;a)
10. Convert the given decimal number into binary, octal and hexadecimal numbers using user
defined functions.
11. From a given paragraph perform the following using built-in functions:
a. Find the total number of words.
b. Capitalize the first word of each sentence.
c. Replace a given word with another word.
12. Solve towers of Hanoi using recursion.
13. Sort the list of numbers using pass by reference.
14. Generate salary slip of employees using structures and pointers.
15. Compute internal marks of students for five different subjects using structures and
functions.
16. Insert, update, delete and append telephone details of an individual or a company into a
telephone directory using random access file.
17. Count the number of account holders whose balance is less than the minimum balance
using sequential access file.
Mini project
18. Create a ―Railway reservation system‖ with the following modules
Booking
Availability checking
Cancellation
Prepare chart
TOTAL: 60 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
Develop C programs for simple applications making use of basic constructs, arrays and
strings.
Develop C programs involving functions, recursion, pointers, and structures.
Design applications using sequential and random access file processing.
UNIT II COMBINATORICS 12
Mathematical induction – Strong induction and well ordering – The basics of counting – The
pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear
recurrence relations – Generating functions – Inclusion and exclusion principle and its applications
Apply the different linear and non-linear data structures to problem solutions.
Critically analyze the various sorting algorithms.
OUTCOMES:
At the end of the course, the student should be able to:
TOTAL: 45 PERIODS
Ability to comprehend and appreciate the significance and role of this course in the present
contemporary world
Apply analog and digital communication techniques.
Use data and pulse communication techniques.
Analyze Source and Error control coding.
TOTAL: 60 PERIODS
OUTCOMES:
At the end of the course, the students will be able to:
Write functions to implement linear and non-linear data structure operations
Suggest appropriate linear / non-linear data structure operations for solving a given
problem
Appropriately use the linear / non-linear data structure operations for a given problem
Apply appropriate hash functions that result in a collision free scenario for data storage and
retrieval
LIST OF EXPERIMENTS
1. Develop a Java application to generate Electricity bill. Create a class with the following
members: Consumer no., consumer name, previous month reading, current month reading,
type of EB connection (i.e domestic or commercial). Compute the bill amount using the
following tariff.
If the type of the EB connection is domestic, calculate the amount to be paid as follows:
First 100 units - Rs. 1 per unit
101-200 units - Rs. 2.50 per unit
201 -500 units - Rs. 4 per unit
> 501 units - Rs. 6 per unit
If the type of the EB connection is commercial, calculate the amount to be paid as follows:
First 100 units - Rs. 2 per unit
101-200 units - Rs. 4.50 per unit
201 -500 units - Rs. 6 per unit
> 501 units - Rs. 7 per unit
2. Develop a java application to implement currency converter (Dollar to INR, EURO to INR, Yen
to INR and vice versa), distance converter (meter to KM, miles to KM and vice versa) , time
converter (hours to minutes, seconds and vice versa) using packages.
3. Develop a java application with Employee class with Emp_name, Emp_id, Address, Mail_id,
Mobile_no as members. Inherit the classes, Programmer, Assistant Professor, Associate
Professor and Professor from employee class. Add Basic Pay (BP) as the member of all the
inherited classes with 97% of BP as DA, 10 % of BP as HRA, 12% of BP as PF, 0.1% of BP for
staff club fund. Generate pay slips for the employees with their gross and net salary.
4. Design a Java interface for ADT Stack. Implement this interface using array. Provide
necessary exception handling in both the implementations.
5. Write a program to perform string operations using ArrayList. Write functions for the following
a. Append - add at end
b. Insert – add at particular index
c. Search
d. List all string starts with given letter
6. Write a Java Program to create an abstract class named Shape that contains two integers and
an empty method named print Area(). Provide three classes named Rectangle, Triangle and
Circle such that each one of the classes extends the class Shape. Each one of the classes
contains only the method print Area () that prints the area of the given shape.
7. Write a Java program to implement user defined exception handling.
8. Write a Java program that reads a file name from the user, displays information about whether
the file exists, whether the file is readable, or writable, the type of file and the length of the file
in bytes.
9. Write a java program that implements a multi-threaded application that has three threads. First
thread generates a random integer every 1 second and if the value is even, second thread
computes the square of the number and prints. If the value is odd, the third thread will print the
value of cube of the number.
10. Write a java program to find the maximum value from the given type of elements using a
generic function.
11. Design a calculator using event-driven programming paradigm of Java with the following
options.
a) Decimal manipulations
b) Scientific manipulations
12. Develop a mini project for any application using Java concepts.
OUTCOMES
Upon completion of the course, the students will be able to
TOTAL : 60 PERIODS
LIST OF EXPERIMENTS
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits
using basic gates for arbitrary functions, code
converters.
3. Design and implement Half/Full Adder and Subtractor.
4. Design and implement combinational circuits using MSI devices:
4 – bit binary adder / subtractor
Parity generator / checker
Magnitude Comparator
Application using multiplexers
OUTCOMES:
Upon Completion of the course, the students will be able to:
Implement simplified combinational circuits using basic logic gates
Implement combinational circuits using MSI devices
Implement sequential circuits like registers and counters
Simulate combinational and sequential circuits using HDL
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
LABORATORY REQUIREMENT FOR BATCH OF 30 STUDENTS HARDWARE:
1. Digital trainer kits - 30
2. Digital ICs required for the experiments in sufficient numbers
SOFTWARE:
1. HDL simulator.
HS8381 INTERPERSONAL SKILLS/LISTENING&SPEAKING L T P C
0 0 2 1
OBJECTIVES:
The Course will enable learners to:
•Equip students with the English language skills required for the successful undertaking of
academic studies with primary emphasis on academic speaking and listening skills.
• Provide guidance and practice in basic general and classroom conversation and to engage in
specific academic speaking activities.
•improve general and academic listening skills
•Make effective presentations.
UNIT
I
Listening as a key skill- its importance- speaking - give personal information - ask for personal
information - express ability - enquire about ability - ask for clarification Improving pronunciation -
pronunciation basics taking lecture notes - preparing to listen to a lecture - articulate a complete
idea as opposed to producing fragmented utterances.
UNIT II
Listen to a process information- give information, as part of a simple explanation - conversation
starters: small talk - stressing syllables and speaking clearly - intonation patterns - compare and
contrast information and ideas from multiple sources- converse with reasonable accuracy over a
wide range of everyday topics.
UNIT III
Lexical chunking for accuracy and fluency- factors influence fluency, deliver a five-minute informal
talk - greet - respond to greetings - describe health and symptoms - invite and offer - accept -
decline - take leave - listen for and follow the gist- listen for detail
UNIT IV
Being an active listener: giving verbal and non-verbal feedback - participating in a group
discussion - summarizing academic readings and lectures conversational speech listening to and
participating in conversations - persuade.
UNIT V
Formal and informal talk - listen to follow and respond to explanations, directions and instructions
in academic and business contexts - strategies for presentations and interactive communication -
group/pair presentations - negotiate disagreement in group work.
OUTCOMES:
At the end of the course Learners will be able to:
Listen and respond appropriately.
Participate in group discussions
Make effective presentations
Participate confidently and appropriately in conversations both form
TOTAL :30PERIODS
MA8402 PROBABILITY AND QUEUING THEORY L T P C
4 0 0 4
OBJECTIVES:
To provide necessary basic concepts in probability and random processes for
applications such as random signals, linear systems in communication engineering.
To understand the basic concepts of probability, one and two dimensional
random variables and to introduce some standard distributions applicable to
engineering which can
describe real life phenomenon.
To understand the basic concepts of random processes which are widely used in IT
fields.
To understand the concept of queueing models and apply in engineering.
To understand the significance of advanced queueing models.
To provide the required mathematical support in real life problems and
develop probabilistic models which can be used in several areas of science and
engineering.
COURSE OUTCOMES:
Upon successful completion of the course, students should be able to:
Understand the fundamental knowledge of the concepts of probability and have
knowledge of standard distributions which can describe real life phenomenon.
Understand the basic concepts of one and two dimensional random variables and
apply in engineering applications.
Apply the concept of random processes in engineering disciplines.
Acquire skills in analyzing queueing models.
Understand and characterize phenomenon which evolve with respect to
time in a probabilistic manner.
UNIT IV PARALLELISIM 9
Parallel processing challenges – Flynn‘s classification – SISD, MIMD, SIMD, SPMD, and
Vector Architectures - Hardware multithreading – Multi-core processors and other Shared
Memory Multiprocessors - Introduction to Graphics Processing Units, Clusters, Warehouse
Scale Computers and other Message-Passing Multiprocessors.
TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
Classify the modern and futuristic database applications based on size and complexity
Map ER model to Relational model to perform database design effectively
Write queries using normalization criteria and optimize queries
Compare and contrast various indexing strategies in different database systems
Appraise how advanced databases differ from traditional databases.
UNIT I INTRODUCTION 9
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types–
Fundamentals of the Analysis of Algorithmic Efficiency –Asymptotic Notations and their
properties. Analysis Framework – Empirical analysis - Mathematical analysis for Recursive and
Non-recursive algorithms - Visualization
UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER 9
n
Brute Force – Computing a – String Matching - Closest-Pair and Convex-Hull Problems
-Exhaustive Search - Travelling Salesman Problem - Knapsack Problem - Assignment problem.
Divide and Conquer Methodology – Binary Search – Merge sort – Quick sort – Heap Sort -
Multiplication of Large Integers – Closest-Pair and Convex - Hull Problems.
OUTCOMES:
On Completion of the course, the students should be able to:
Identify the key activities in managing a software project.
Compare different process models.
Concepts of requirements engineering and Analysis Modeling.
Apply systematic procedure for software design and deployment.
Compare and contrast the various testing and maintenance.
Manage project schedule, estimate project cost and effort required.
OBJECTIVES:
To understand data definitions and data manipulation commands
To learn the use of nested and join queries
To understand functions, procedures and procedural extensions of data bases
To be familiar with the use of a front end tool
To understand design and implementation of typical database applications
1. Data Definition Commands, Data Manipulation Commands for inserting, deleting, updating
and retrieving Tables and Transaction Control statements
2. Database Querying – Simple queries, Nested queries, Sub queries and Joins
3. Views, Sequences, Synonyms
4. Database Programming: Implicit and Explicit Cursors
5. Procedures and Functions
6. Triggers
7. Exception Handling
8. Database Design using ER modeling, normalization and Implementation for any application
9. Database Connectivity with Front End Tools
10. Case Study using real life database applications
TOTAL: 60 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
Use typical data definitions and manipulation commands.
Design applications to test Nested and Join Queries
Implement simple applications that use Views
Implement applications that require a Front-end Tool
Critically analyze the use of Tables, Views, Functions and Procedures
CS8461 OPERATING SYSTEMS LABORATORY LTPC
0 042
OBJECTIVES
To learn Unix commands and shell programming
To implement various CPU Scheduling Algorithms
To implement Process Creation and Inter Process Communication.
To implement Deadlock Avoidance and Deadlock Detection Algorithms
To implement Page Replacement Algorithms
To implement File Organization and File Allocation Strategies
LIST OF EXPERIMENTS
1. Basics of UNIX commands
2. Write programs using the following system calls of UNIX operating system
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
3. Write C programs to simulate UNIX commands like cp, ls, grep, etc.
4. Shell Programming
5. Write C programs to implement the various CPU Scheduling Algorithms
6. Implementation of Semaphores
7. Implementation of Shared memory and IPC
8. Bankers Algorithm for Deadlock Avoidance
9. Implementation of Deadlock Detection Algorithm
10. Write C program to implement Threading & Synchronization Applications
11. Implementation of the following Memory Allocation Methods for fixed partition
a) First Fit b) Worst Fit c) Best Fit
12. Implementation of Paging Technique of Memory Management
13. Implementation of the following Page Replacement Algorithms
a) FIFO b) LRU c) LFU
14. Implementation of the various File Organization Techniques
15. Implementation of the following File Allocation Strategies
a) Sequential b) Indexed c) Linked
TOTAL: 60 PERIODS
OUTCOMES:
At the end of the course, the student should be able to
Compare the performance of various CPU Scheduling Algorithms
Implement Deadlock avoidance and Detection Algorithms
Implement Semaphores
Create processes and implement IPC
Analyze the performance of the various Page Replacement Algorithms
Implement File Organization and File Allocation Strategies
L T P C
HS8461 ADVANCED READING AND WRITING
0 0 2 1
OBJECTIVES:
• Strengthen the reading skills of students of engineering.
• Enhance their writing skills with specific reference to technical writing.
• Develop students‘ critical thinking skills.
• Provide more opportunities to develop their project and proposal writing skills.
UNIT I
Reading - Strategies for effective reading-Use glosses and footnotes to aid reading
comprehension- Read and recognize different text types-Predicting content using photos and title
Writing-Plan before writing- Develop a paragraph: topic sentence, supporting sentences,
concluding sentence –Write a descriptive paragraph
UNIT II
Reading-Read for details-Use of graphic organizers to review and aid comprehension Writing-
State reasons and examples to support ideas in writing- Write a paragraph with reasons and
examples- Write an opinion paragraph
UNIT III
Reading- Understanding pronoun reference and use of connectors in a passage- speed reading
techniques-Writing- Elements of a good essay-Types of essays- descriptive-narrative- issue-
based-argumentative-analytical.
UNIT IV
Reading- Genre and Organization of Ideas- Writing- Email writing- visumes – Job application-
project writing-writing convincing proposals.
UNIT V
Reading- Critical reading and thinking- understanding how the text positions the reader- identify
Writing- Statement of Purpose- letter of recommendation- Vision statement
TOTAL: 30 PERIODS
OUTCOMES:
At the end of the course Learners will be able to:
Write different types of essays.
Write winning job applications.
Read and evaluate texts critically.
Display critical thinking in various professional contexts.
MA8551 ALGEBRA AND NUMBER THEORY L T P C
4 0 0 4
OBJECTIVES:
To introduce the basic notions of groups, rings, fields which will then be used to solve
related problems.
To introduce and apply the concepts of rings, finite fields and polynomials.
To understand the basic concepts in number theory
To examine the key questions in the Theory of Numbers.
To give an integrated approach to number theory and abstract algebra, and provide a firm
basis for further reading and study in the subject.
UNIT III 9
NETWORK LAYER
Network Layer Services – Packet switching – Performance – IPV4 Addresses –Forwarding of
IP Packets - Network Layer Protocols: IP, ICMP v4 – Unicast Routing Algorithms –
Protocols – Multicasting Basics – IPV6 Addressing – IPV6 Protocol.
UNIT IV MICROCONTROLLER 9
Architecture of 8051 – Special Function Registers(SFRs) - I/O Pins Ports and Circuits - Instruction
set - Addressing modes - Assembly language programming.
UNIT V UNDECIDABILITY 9
Non Recursive Enumerable (RE) Language – Undecidable Problem with RE – Undecidable
Problems about TM – Post‘s Correspondence Problem, The Class P and NP.
TOTAL :45PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
Construct automata, regular expression for any pattern.
Write Context free grammar for any construct.
Design Turing machines for any language.
Propose computation solutions using Turing machines.
Derive whether a problem is decidable or not.
CS8592 OBJECT ORIENTED ANALYSIS AND DESIGN LTPC
3 003
OBJECTIVES:
To understand the fundamentals of object modeling
To understand and differentiate Unified Process from other approaches.
To design with static UML diagrams.
To design with the UML dynamic and implementation diagrams.
To improve the software design with design patterns.
To test the software against its requirements specification
UNIT V TESTING 9
Object Oriented Methodologies – Software Quality Assurance – Impact of object orientation on
Testing – Develop Test Cases and Test Plans
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the students will be able to:
Express software design with UML diagrams
Design software applications using OO concepts.
Identify various scenarios based on software requirements
Transform UML based software design into pattern based design using design patterns
Understand the various testing methodologies for OO software
LIST OF EXPERIMENTS:
8086 Programs using kits and MASM
1. Basic arithmetic and Logical operations
2. Move a data block without overlap
3. Code conversion, decimal arithmetic and Matrix operations.
4. Floating point operations, string manipulations, sorting and searching
5. Password checking, Print RAM size and system date
6. Counters and Time Delay
SOFTWARE:
Intel Desktop Systems with MASM - 30 nos
8086 Assembler
8051 Cross Assembler
Draw standard UML diagrams using an UML modeling tool for a given case study and map design
to code and implement a 3 layered architecture. Test the developed code and validate whether the
SRS is satisfied.
1. Identify a software system that needs to be developed.
2. Document the Software Requirements Specification (SRS) for the identified system.
3. Identify use cases and develop the Use Case model.
4. Identify the conceptual classes and develop a Domain Model and also derive a Class
Diagram from that.
5. Using the identified scenarios, find the interaction between objects and represent them
using
UML Sequence and Collaboration Diagrams
6. Draw relevant State Chart and Activity Diagrams for the same system.
7. Implement the system as per the detailed design
8. Test the software system for all the scenarios identified as per the usecase diagram
9. Improve the reusability and maintainability of the software system by applying appropriate
design patterns.
10. Implement the modified system and test it for various scenarios
HARDWARE REQUIREMENTS
Standard PC
SOFTWARE REQUIREMENTS
1. Windows 7 or higher
2. ArgoUML that supports UML 1.4 and higher
3. Selenium, JUnit or Apache JMeter
LIST OF EXPERIMENTS
1. Learn to use commands like tcpdump, netstat, ifconfig, nslookup and traceroute. Capture
ping and traceroute PDUs using a network protocol analyzer and examine.
2. Write a HTTP web client program to download a web page using TCP sockets.
3. Applications using TCP sockets like:
Echo client and echo server
Chat
File Transfer
4. Simulation of DNS using UDP sockets.
5. Write a code simulating ARP /RARP protocols.
6. Study of Network simulator (NS) and Simulation of Congestion Control Algorithms using
NS.
7. Study of TCP/UDP performance using Simulation tool.
8. Simulation of Distance Vector/ Link State Routing algorithm.
9. Performance evaluation of Routing protocols using Simulation tool.
10. Simulation of error correction code (like CRC).
TOTAL: 60 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able to:
Implement various protocols using TCP and UDP.
Compare the performance of different transport layer protocols.
Use simulation tools to analyze the performance of various network protocols.
Analyze various routing algorithms.
Implement error correction codes.
SOFTWARE:
1. C / C++ / Java / Python / Equivalent Compiler 30
2. Network simulator like NS2/Glomosim/OPNET/ Packet Tracer / Equivalent
OUTCOMES:
At the end of the course, the students should be able to:
Construct a basic website using HTML and Cascading Style Sheets.
Build dynamic web page with validation using Java Script objects and by applying
different event handling mechanisms.
Develop server side programs using Servlets and JSP.
Construct simple web pages in PHP and to represent data in XML format.
Use AJAX and web services to develop interactive web applications
UNIT I INTRODUCTION 9
Introduction–Definition - Future of Artificial Intelligence – Characteristics of Intelligent Agents–
Typical Intelligent Agents – Problem Solving Approach to Typical AI problems.
UNIT V APPLICATIONS
9
AI applications – Language Models – Information Retrieval- Information Extraction – Natural
Language Processing - Machine Translation – Speech Recognition – Robot – Hardware –
Perception – Planning – Moving
TOTAL :45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able
to:
Use appropriate search algorithms for any AI problem
Represent a problem using first order and predicate logic
Provide the apt agent strategy to solve a given problem
Design software agents to solve a problem
Design applications for NLP that use Artificial Intelligence.
OBJECTIVES:
To learn the various phases of compiler.
To learn the various parsing techniques.
To understand intermediate code generation and run-time environment.
To learn to implement front-end of the compiler.
To learn to implement code generator.
LIST OF EXPERIMENTS:
1. Develop a lexical analyzer to recognize a few patterns in C. (Ex. identifiers, constants,
comments, operators etc.). Create a symbol table, while recognizing identifiers.
2. Implement a Lexical Analyzer using Lex Tool
3. Implement an Arithmetic Calculator using LEX and YACC
4. Generate three address code for a simple program using LEX and YACC.
5. Implement simple code optimization techniques (Constant folding, Strength reduction and
Algebraic transformation)
6. Implement back-end of the compiler for which the three address code is given as input and
the 8086 assembly language code is produced as output.
PRACTICALS 30 PERIODS
THEORY 45 PERIODS
TOTAL : 75 PERIODS
OUTCOMES:
On Completion of the course, the students should be able to:
Understand the different phases of compiler.
Design a lexical analyzer for a sample language.
Apply different parsing algorithms to develop the parsers for a given grammar.
Understand syntax-directed translation and run-time environment.
Learn to implement code optimization techniques and a simple code generator.
Design and implement a scanner and a parser using LEX and YACC tools.
UNIT I INTRODUCTION 9
Introduction: Definition –Relation to computer system components –Motivation –Relation to
parallel systems – Message-passing systems versus shared memory systems –Primitives for
distributed communication –Synchronous versus asynchronous executions –Design issues and
challenges. A model of distributed computations: A distributed program –A model of distributed
executions –Models of communication networks –Global state – Cuts –Past and future cones of
an event –Models of process communications. Logical Time: A framework for a system of logical
clocks –Scalar time –Vector time – Physical clock synchronization: NTP.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of this course, the students will be able to:
Elucidate the foundations and issues of distributed systems
Understand the various synchronization issues and global state for distributed systems.
Understand the Mutual Exclusion and Deadlock detection algorithms in distributed systems
Describe the agreement protocols and fault tolerance mechanisms in distributed systems.
Describe the features of peer-to-peer and distributed shared memory systems
LIST OF EXPERIMENTS
1. Create a web page with the following using HTML
a. To embed a map in a web page
b. To fix the hot spots in that map
c. Show all the related information when the hot spots are clicked.
2. Create a web page with the following.
a. Cascading style sheets.
b. Embedded style sheets.
c. Inline style sheets. Use our college information for the web pages.
3. Validate the Registration, user login, user profile and payment by credit card pages using
JavaScript.
4. Write programs in Java using Servlets:
i. To invoke servlets from HTML forms
ii. Session tracking using hidden form fields and Session tracking for a hit count
5. Write programs in Java to create three-tier applications using servlets for conducting on-
line examination for displaying student mark list. Assume that student information is
available in a database which has been stored in a database server.
6. Install TOMCAT web server. Convert the static web pages of programs into dynamic web
pages using servlets (or JSP) and cookies. Hint: Users information (user id, password,
credit card number) would be stored in web.xml. Each user should have a separate
Shopping Cart.
7. Redo the previous task using JSP by converting the static web pages into dynamic web
pages. Create a database with user information and books information. The books
catalogue should be dynamically loaded from the database.
8. Create and save an XML document at the server, which contains 10 users Information.
Write a Program, which takes user Id as an input and returns the User details by taking
the user information from the XML document
SOFTWARE REQUIRED:
Dream Weaver or Equivalent, MySQL or Equivalent, Apache Server, WAMP/XAMPP
REFERENCES:
1. Build Your Own Security Lab, Michael Gregg, Wiley India
UNIT I
Introduction to Soft Skills-- Hard skills & soft skills - employability and career Skills—Grooming as a
professional with values—Time Management—General awareness of Current Affairs
UNIT II
Self-Introduction-organizing the material - Introducing oneself to the audience – introducing the topic –
answering questions – individual presentation practice–– presenting the visuals effectively – 5 minute
presentations
UNIT III
Introduction to Group Discussion— Participating in group discussions – understanding group dynamics
- brainstorming the topic -– questioning and clarifying –GD strategies- activities to improve GD skills
UNIT IV
Interview etiquette – dress code – body language – attending job interviews– telephone/skype
interview -one to one interview &panel interview – FAQs related to job interviews
UNIT V
Recognizing differences between groups and teams- managing time-managing stress- networking
professionally- respecting social protocols-understanding career management-developing a long-term
career plan-making career changes
TOTAL : 30 PERIODS
OUTCOMES:
At the end of the course Learners will be able to:
• Make effective presentations
• Participate confidently in Group Discussions.
• Attend job interviews and be successful in them.
• Develop adequate Soft Skills required for the workplace
Recommended Software
1. Globearena
2. Win English
UNIT II PLANNING 9
Nature and purpose of planning – planning process – types of planning – objectives – setting
objectives – policies – Planning premises – Strategic Management – Planning Tools and
Techniques – Decision making steps and process.
UNIT III ORGANISING 9
Nature and purpose – Formal and informal organization – organization chart – organization
structure – types – Line and staff authority – departmentalization – delegation of authority –
centralization and decentralization – Job Design - Human Resource Management – HR Planning,
Recruitment, selection, Training and Development, Performance Management , Career planning
and management
UNIT IV DIRECTING 9
Foundations of individual and group behaviour – motivation – motivation theories – motivational
techniques – job satisfaction – job enrichment – leadership – types and theories of leadership –
communication – process of communication – barrier in communication – effective communication
–communication and IT.
UNIT V CONTROLLING 9
System and process of controlling – budgetary and non-budgetary control techniques – use of
computers and IT in Management control – Productivity problems and management – control and
performance – direct and preventive control – reporting.
TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, students will be able to have clear understanding of
managerial functions like planning, organizing, staffing, leading & controlling and have same
basic knowledge on international aspect of management
UNIT I INTRODUCTION 9
Security trends - Legal, Ethical and Professional Aspects of Security, Need for Security at
Multiple levels, Security Policies - Model of network security – Security attacks, services and
mechanisms – OSI security architecture – Classical encryption techniques: substitution
techniques, transposition techniques, steganography- Foundations of modern cryptography:
perfect security – information theory – product cryptosystem – cryptanalysis.
UNIT II SYMMETRIC KEY CRYPTOGRAPHY 9
MATHEMATICS OF SYMMETRIC KEY CRYPTOGRAPHY: Algebraic structures - Modular
arithmetic-Euclid‟s algorithm- Congruence and matrices - Groups, Rings, Fields- Finite
fields- SYMMETRIC KEY CIPHERS: SDES – Block cipher Principles of DES – Strength of
DES – Differential and linear cryptanalysis - Block cipher design principles – Block cipher
mode of operation – Evaluation criteria for AES – Advanced Encryption Standard - RC4 –
Key distribution.
OUTCOMES:
At the end of the course, the student should be able to:
Understand the fundamentals of networks security, security architecture, threats and
vulnerabilities
Apply the different cryptographic operations of symmetric cryptographic algorithms
Apply the different cryptographic operations of public key cryptography
Apply the various Authentication schemes to simulate different applications.
Understand various Security practices and System security standards
LIST OF EXPERIMENTS
1. Perform encryption, decryption using the following substitution techniques
(i) Ceaser cipher, (ii) playfair cipher iii) Hill Cipher iv) Vigenere cipher
2. Perform encryption and decryption using following transposition techniques
i) Rail fence ii) row & Column Transformation
3. Apply DES algorithm for practical applications.
4. Apply AES algorithm for practical applications.
5. Implement RSA Algorithm using HTML and JavaScript
6. Implement the Diffie-Hellman Key Exchange algorithm for a given problem.
7. Calculate the message digest of a text using the SHA-1 algorithm.
8. Implement the SIGNATURE SCHEME - Digital Signature Standard.
9. Demonstrate intrusion detection system (ids) using any tool eg. Snort or any other s/w.
10. Automated Attack and Penetration Tools
Exploring N-Stalker, a Vulnerability Assessment Tool
11. Defeating Malware
i) Building Trojans ii) Rootkit Hunter
TOTAL: 60 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able to:
Develop code for classical Encryption Techniques to solve the problems.
Build cryptosystems by applying symmetric and public key encryption algorithms.
Construct code for authentication algorithms.
Develop a signature scheme using Digital signature standard.
Demonstrate the network security system using open source tools
REFERENCES:
1. Build Your Own Security Lab, Michael Gregg, Wiley India
UNIT I INTRODUCTION 9
Testing as an Engineering Activity – Testing as a Process – Testing Maturity Model- Testing
axioms – Basic definitions – Software Testing Principles – The Tester‘s Role in a Software
Development Organization – Origins of Defects – Cost of defects – Defect Classes – The Defect
Repository and Test Design –Defect Examples- Developer/Tester Support of Developing a Defect
Repository.
UNIT II TEST CASE DESIGN STRATEGIES 9
Test case Design Strategies – Using Black Box Approach to Test Case Design – Boundary Value
Analysis – Equivalence Class Partitioning – State based testing – Cause-effect graphing –
Compatibility testing – user documentation testing – domain testing - Random Testing –
Requirements based testing – Using White Box Approach to Test design – Test Adequacy Criteria –
static testing vs. structural testing – code functional testing – Coverage and Control Flow Graphs –
Covering Code Logic – Paths – code complexity testing – Additional White box testing
approaches- Evaluating Test Adequacy Criteria.
UNIT II 9
Trees -Properties- Distance and Centres - Types - Rooted Tree-- Tree Enumeration-
Labeled Tree - Unlabeled Tree - Spanning Tree - Fundamental Circuits- Cut Sets -
Properties - Fundamental Circuit and Cut-set- Connectivity- Separability -Related
Theorems.
UNIT III 9
Network Flows - Planar Graph - Representation - Detection - Dual Graph - Geometric and
Combinatorial Dual - Related Theorems - Digraph - Properties - Euler Digraph.
UNIT IV 9
Matrix Representation - Adjacency matrix- Incidence matrix- Circuit matrix - Cut-set matrix -
Path Matrix- Properties - Related Theorems - Correlations. Graph Coloring - Chromatic
Polynomial - Chromatic Partitioning - Matching - Covering - Related Theorems.
UNIT V 9
Graph Algorithms- Connectedness and Components- Spanning Tree- Fundamental
Circuits- Cut Vertices- Directed Circuits- Shortest Path - Applications overview.
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of this course, the students should be able to
Understand the basic concepts of graphs, and different types of graphs
Understand the properties, theorems and be able to prove theorems.
Apply suitable graph model and algorithm for solving applications.
L T P C
IT8071 DIGITAL SIGNAL PROCESSING 3 0 0 3
OBJECTIVES:
To understand the basics of discrete time signals, systems and their classifications.
To analyze the discrete time signals in both time and frequency domain.
To design lowpass digital IIR filters according to predefined specifications based on analog
filter theory and analog-to-digital filter transformation.
To design Linear phase digital FIR filters using fourier method, window technique
To realize the concept and usage of DSP in various engineering fields.
UNIT I INTRODUCTION 9
Introduction to IPRs, Basic concepts and need for Intellectual Property - Patents, Copyrights,
Geographical Indications, IPR in India and Abroad – Genesis and Development – the way from
WTO to WIPO –TRIPS, Nature of Intellectual Property, Industrial Property, technological
Research, Inventions and Innovations – Important examples of IPR.
OUTCOMES:
Upon completion of the course, the students will be able to:
Work with big data tools and its analysis techniques
Analyze data by utilizing clustering and classification algorithms
Learn and apply different mining algorithms and recommendation systems for large
volumes of data
Perform analytics on data streams
Learn NoSQL databases and management.
UNIT I INTRODUCTION 9
Learning Problems – Perspectives and Issues – Concept Learning – Version Spaces and
Candidate Eliminations – Inductive bias – Decision Tree learning – Representation – Algorithm –
Heuristic Space Search.
OBJECTIVES:
To develop an understanding and awareness how issues such as content, information
architecture, motion, sound, design, and technology merge to form effective and
compelling interactive experiences for a wide range of audiences and end users.
To become familiar with various software programs used in the creation and
implementation of multi- media
To appreciate the importance of technical ability and creativity within design practice.
To gain knowledge about graphics hardware devices and software used.
To understand the two-dimensional graphics and their transformations.
To understand the three-dimensional graphics and their transformations.
To appreciate illumination and color models
To become familiar with understand clipping techniques
To become familiar with Blender Graphics
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of the course, the student should be able to:
Explain the concept of IoT.
Analyze various protocols for IoT.
Design a PoC of an IoT system using Rasperry Pi/Arduino
Apply data analytics and use cloud offerings related to IoT.
Analyze applications of IoT in real time scenario
UNIT I INTRODUCTION 9
Introduction - Need for quality - Evolution of quality - Definitions of quality - Dimensions of product
and service quality - Basic concepts of TQM - TQM Framework - Contributions of Deming, Juran
and Crosby - Barriers to TQM - Customer focus - Customer orientation, Customer satisfaction,
Customer complaints, Customer retention.
UNIT I 9
Human Rights – Meaning, origin and Development. Notion and classification of Rights – Natural,
Moral and Legal Rights. Civil and Political Rights, Economic, Social and Cultural Rights;
collective / Solidarity Rights.
UNIT II 9
Evolution of the concept of Human Rights Magana carta – Geneva convention of 1864. Universal
Declaration of Human Rights, 1948. Theories of Human Rights.
UNIT III 9
Theories and perspectives of UN Laws – UN Agencies to monitor and compliance.
UNIT IV 9
Human Rights in India – Constitutional Provisions / Guarantees.
UNIT V 9
Human Rights of Disadvantaged People – Women, Children, Displaced persons and Disabled
persons, including Aged and HIV Infected People. Implementation of Human Rights – National
and State Human Rights Commission – Judiciary – Role of NGO‘s, Media, Educational
Institutions, Social Movements.
TOTAL: 45 PERIODS
OUTCOME:
Engineering students will acquire the basic knowledge of human rights.
TOTAL 45 PERIODS
Know and understand the basics and fundamentals of digital image processing, such as
digitization, sampling, quantization, and 2D-transforms.
Operate on images using the techniques of smoothing, sharpening and enhancement.
Understand the restoration concepts and filtering techniques.
Learn the basics of segmentation, features extraction, compression and recognition
methods for color models.
UNIT I INTRODUCTION 9
Introduction to Semantic Web: Limitations of current Web - Development of Semantic Web -
Emergence of the Social Web - Social Network analysis: Development of Social Network Analysis
- Key concepts and measures in network analysis - Electronic sources for network analysis:
Electronic discussion networks, Blogs and online communities - Web-based networks -
Applications of Social Network Analysis.
UNIT I INTRODUCTION 9
History, What is Information Security?, Critical Characteristics of Information, NSTISSC
Security Model, Components of an Information System, Securing the Components, Balancing
Security and Access, The SDLC, The Security SDLC
UNIT I INTRODUCTION 9
History of Software Defined Networking (SDN) – Modern Data Center – Traditional Switch
Architecture – Why SDN – Evolution of SDN – How SDN Works – Centralized and
Distributed Control and Date Planes
UNIT V SDN 9
Juniper SDN Framework – IETF SDN Framework – Open Daylight Controller – Floodlight
Controller – Bandwidth Calendaring – Data Center Orchestration
TOTAL :45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
Analyze the evolution of software defined networks
Express the various components of SDN and their uses
Explain the use of SDN in the current networking scenario
Design and develop various applications of SDN
TOTAL 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
Understand the basics of computer forensics
Apply a number of different computer forensic tools to a given scenario
Analyze and validate forensics data
Identify the vulnerabilities in a given network infrastructure
Implement real-world hacking techniques to test system security
OUTCOMES:
Upon completion of the course, the student should be able to apply ethics in society,
discuss the ethical issues related to engineering and realize the responsibilities and
rights in the society.
OUTCOMES:
Upon completion of the course, the students will be able to:
Use an open source search engine framework and explore its capabilities
Apply appropriate method of classification or clustering.
Design and implement innovative features in a search engine.
Design and implement a recommender system.
UNIT I FUNDAMENTALS 9
Green IT Fundamentals: Business, IT, and the Environment – Green computing: carbon
foot print, scoop on power – Green IT Strategies: Drivers, Dimensions, and Goals –
Environmentally Responsible Business: Policies, Practices, and Metrics.
UNIT I INTRODUCTION 9
Origins and challenges of NLP – Language Modeling: Grammar-based LM, Statistical LM -
Regular Expressions, Finite-State Automata – English Morphology, Transducers for lexicon and
rules, Tokenization, Detecting and Correcting Spelling Errors, Minimum Edit Distance
OUTCOMES:
Upon completion of the course, the students will be able to:
To tag a given text with basic Language features
To design an innovative application using NLP components
To implement a rule based system to tackle morphology/syntax of a language
To design a tag set to be used for statistical processing for real-time applications
To compare and contrast the use of different statistical approaches for different types
of NLP applications.
UNIT I INTRODUCTION 9
Need for Parallel Processing - Data and Temporal Parallelism - Models of Computation - RAM and
PRAM Model – Shared Memory and Message Passing Models- Processor Organisations - PRAM
Algorithm – Analysis of PRAM Algorithms- Parallel Programming
Languages.
OUTCOMES:
Upon completion of this course, the students should be able to
Develop parallel algorithms for standard problems and applications.
Analyse efficiency of different parallel algorithms.
IT8077 L T P C
SPEECH PROCESSING
3 0 0 3
OBJECTIVES:
To understand the fundamentals of the speech processing
Explore the various speech models
Gather knowledge about the phonetics and pronunciation processing
Perform wavelet analysis of speech
To understand the concepts of speech recognition
UNIT I INTRODUCTION 9
Introduction - knowledge in speech and language processing - ambiguity - models and algorithms
- language - thought - understanding - regular expression and automata - words & transducers –
N grams
OUTCOMES:
On Successful completion of the course ,Students will be able to
Create new algorithms with speech processing
Derive new speech models
Perform various language phonetic analysis
Create a new speech identification system
Generate a new speech recognition system
UNIT I INTRODUCTION 8
Nanoscale Science and Technology- Implications for Physics, Chemistry, Biology and
Engineering-Classifications of nanostructured materials- nano particles- quantum dots, nanowires-
ultra-thinfilms-multilayered materials. Length Scales involved and effect on properties:
Mechanical, Electronic, Optical, Magnetic and Thermal properties. Introduction to
properties and motivation for study (qualitative only).
UNIT V APPLICATIONS 7
NanoInfoTech: Information storage- nanocomputer, molecular switch, super chip, nanocrystal,
Nanobiotechlogy: nanoprobes in medical diagnostics and biotechnology, Nano medicines,
Targetted drug delivery, Bioimaging - Micro Electro Mechanical Systems (MEMS), Nano Electro
Mechanical Systems (NEMS)- Nanosensors, nano crystalline silver for bacterial inhibition,
Nanoparticles for sunbarrier products - In Photostat, printing, solar cell, battery.
TOTAL: 45 PERIODS
OUTCOMES:
Will familiarize about the science of nanomaterials
Will demonstrate the preparation of nanomaterials
Will develop knowledge in characteristic nanomaterial