B.Tech.

Computer Engineering
(Software Engineering)

Department of Engineering and Physical Sciences

Academic Year 2021-22

INSTITUTE OF ADVANCED RESEARCH

GANDHINAGAR

1
 INDEX

PART- I: Preamble Page No.

Introduction 5
Course(s) Offered 6
Choice Based Credit Program 7
Curriculum Structure 7
Teaching and Learning Process 8
Eligibility Criteria 9
Examination and Credit Distribution 9
Plagiarism 10
PART- II: Course Structure 11
B. Tech. Program 13
Semester wise Courses and credit Distribution 13
PART- III: Course Contents 15
Compulsory Subjects 16
English 16
Communication Skills 18
Introduction to Computers & Programming using 'C' 21
Environmental Science 24
Project – I 28
Project – II 29
Project Management 30
Basic Sciences 32
Mathematics – I 32
Mathematics – II 33
Physics 35
Fundamental Chemistry 38
Introductory Biology 41
Basic Engineering Sciences 44
Basic Electrical and Electronics Engineering 44
Engineering Graphics 47
Engineering Workshop 48
Material Science 49
Management Subjects 52
Management I (Business and Organizational Management) 52
Management II (Entrepreneurship and Business Development) 54
Branch (Computer Engineering) Specific Core 56
Data Structure and Algorithms 57
Object Oriented Programming 59
Discrete Mathematics 61
Fundamental of Electronics 63
Computer System Architecture 64
Database Management System 68

2
Programming in JAVA 71
Python Programming 75
Network Analysis and Analog Electronics 77
Theory of Computation 81
Computer Network 82
Operating System 84
Advanced Java Technology 87
Software Engineering 88
Software Design 92
Cryptography and Information Security 93
Distributed Computing 95
Software Architecture 96
Software Testing 97
Compiler Design 98
Software Quality Management 99
Machine Learning-1 100
Machine Learning-II 101
Cloud computing 102
Digital Signal Processing 103
Note: Subject List may be added or removed as per requirement

3
PART-I PREAMBLE

4
1. INTRODUCTION

The Institute of Advanced Research (IAR) is an innovative modern university, which offers
professionally focused undergraduate, postgraduate and research degree programs. IAR was
established in 2006 with the support of the President of India Dr A P J Abdul Kalam, who
inaugurated the Institute, and the Prime Minister, Shri Narendra Modi, who was then the Chief
Minister of Gujarat. The University is financially supported by the Puri Foundation for
Education in India, established by Professor Nathu Ram Puri, who is a leading industrialist in the
UK with manufacturing and other businesses worldwide. The University is a not-for-profit
institution and its sole purpose is to promote world-leading education, research and innovation
for young people nationally and internationally.

IAR was awarded the university status under the Gujarat Private Universities Amendment Act,
2011. The University commenced offering educational programs in 2014 and currently has
around 500 students in several undergraduate, masters and research degree programs.

Vision
The leader in intellectual and professional influence for the benefit of the society and the
economy

Mission
To provide outstanding professionally focused educational opportunities with a broadly-based
curriculum and co-curricular programs that ensure our students will be most sought after by
employers.

We will achieve this through world class research and innovation-led academic programs in
partnership with employers through student centered learning strategies and cutting edge leaning
environments.

Department of Engineering and Computing

In the Department of Engineering and Computing, we offer high-quality professional education

in engineering, computer science and information technology, integrated with the University’s
acclaimed strength in physical sciences, biotechnology, business and management. Our students
focus not just on the acquisition of technical knowledge, but on design and professional practice
throughout the programs. A distinctive focus at our department is in preparing students for a
lifelong learning and development. Our graduates are prepared not only for the first job, but for
career growth and advancement throughout their careers.

We are a young and rapidly growing department, allowing us to create a unique learning
environment in which knowledge and application are integrated. We believe that learning outside
the classroom is as important as it is within the classroom. Therefore we create opportunities for
our students to undertake experiential learning whether it is through internships, industry visits or
occasional lectures from industry leaders.

5
Our faculty are highly accomplished and inspire our students to aim for higher achievement
including participation in research and design projects including at the undergraduate programs.
Our education philosophy revolves around educating our students to be well rounded
professionals regardless whether they choose to take up jobs in industry upon graduation or
progress towards higher academic achievement.

We have exciting research programs developing in the department. These currently focus on
energy, biotechnology and bioprocess engineering, modelling and simulation, and environmental
engineering.

2. COURSES OFFERED

The Department of Physical Sciences and Engineering offers Doctoral, Postgraduate and
Undergraduate Programs. Students are offered a wide range of subjects in different streams
spread over 4 years depending on the choice of the Degree. The University offers the
following engineering degree programs:-

Undergraduate Programs:

 B. Tech (Computer Engineering ) - 4 years (8 semesters)

 B. Tech (Information Technology ) - 4 years (8 semesters)
 B. Tech (Chemical Engineering) - 4 years (8 semesters)
 B. Tech (Biotechnology) - 4 years (8 semesters)
 B. Tech (Electronics & Instrumentation) - 4 years (8 semesters)
 B. Tech (Information & Communication Tech.) - 4 years (8 semesters)

3. EDUCATIONAL CALENDAR

The University follows a semester system. The odd summer semester will commence in July and
will end by December every year. The even semester would commence in January and conclude
in May every year. The exact dates will be as notified by the University from term to term. Each
semester will have a teaching duration of 15 weeks. In addition, a total of three weeks would be
dedicated for examinations for each semester; one week for internal and two weeks for semester
end final examinations (theory and practical).

4. CHOICE BASED CREDIT SYSTEM (CBCS) PROGRAM

The University undertakes a choice based credit system (CBCS) laid down by University
Grant Commission (UGC), New Delhi, India.

6
 1. Credit Based Semester System (CBSS): Under the CBSS, the requirement for awarding a
degree is prescribed in terms of number of credits to be completed by the students as per
UGC norms.
2. Credit: A unit by which the course work is measured. It determines the number of hours of
instructions required per week. One credit is equivalent to one hour of teaching (lecture or
tutorial) or two hours of practical work/field work per week. A unit credit means 15 hours of
learning process. This may include theory, practical classes, and tutorials or visits to the
industrial units.

5. CURRICULUM STRUCTURE

1. Academic Year: Academic year defines two consecutive (one odd + one even) semesters
constitute one academic year.
2. Course: Usually referred to, as ‘papers’ is a component of a programed. All courses do not
require carrying the same weight. The courses define learning objectives and learning
outcomes. A course has been designed to comprise lectures/tutorials/laboratory work/ field
work/ outreach activities/ project work/ vocational training/viva/ seminars/term
papers/assignments/ presentations/ self-study etc. or a combination of some of these.
3. Course Structure: The Students are expected to earn a minimum of 160-164 credits from
minimum eight semesters for qualifying for B. Tech programme. The University will lay
down the list of subjects for award of degree as per guidelines of UGC. Refer to Part-II of
this document to learn about subjects offered and credits required for a specific
program/course. The curriculum of the courses can be broadly placed in following parts.

a) Branch Specific Core Courses (C): These courses arecompulsorily studied by a

student as a core requirement to complete the credit requirement of a programme in a
said discipline of study. Also the course designed for papers under this category aim
to cover the basics that a student is expected to imbibe in that particular discipline.
b) Branch Specific Elective Course (BE): Generally a course which can be chosen
from a pool of courses and which may be very specific or specialized or advanced or
supportive to the discipline/subject of study or which provides an extended scope or
which enables an exposure to some other discipline/subject/domain or nurtures the
candidate’s proficiency/skill.
c) Basic Engineering Courses (E): These courses based upon the content that leads to
knowledge enhancement in other fields of engineering, i.e. engineering graphics,
Basic Electrical and Electronic Engineering and ii. Engineering workshop. These are
mandatory for all disciplines.
d) Compulsory Courses (CC): CC courses are used to enhance the skills of
engineering students in communication and computational skills through subjects like
English and Introduction to Computer using “C”. Environmental Science is also
added to aware students regarding environmental impact of various processes.These
are mandatory for all disciplines
e) Open Elective Courses (O): These courses are choose by students based on their
interest area. These subjects may be from same or different departments running in
same semester. The objective to introduce these subjects is to help student to explore
more in the area of his/her interest. These are also mandatory for all disciplines
f) Management Subjects (M): These subjectsare taught to students to enhance their
management skills. These includes Business and Organizational Management,
Entrepreneurship and Business Development.These are mandatory for all disciplines

7
 g) Practical/tutorials. Each core and discipline specific electives have practical or
tutorial of 2 credits. The list of practical provided is suggestive in nature and each
department has the freedom to add/subtract/edit practical from the list depending on
their faculty and infrastructure available. Addition will however be of similar nature.
h) Project work/Dissertation is considered as a special course involving application of
knowledge in solving / analysing /exploring a real life situation / difficult problem. A
Project/Dissertation work would be of 6 credits. A project/Dissertation work may be
given in lieu of a discipline specific elective paper.
i) Additional Credits: Additional credits are provided for seminars, assignments and
industrial visits. These need to be preferably from the chosen core/elective courses.
These subjects help motivate students to carry out self-study and develop
communication and presentation skills, provide hands-on experience and increase
confidence and leadership skills.

4. Course Contents: All the subjects offered, their course content and the credits they carry
have been mentioned in Part-III of this document. Each subject has been designed to
include Course description, Learning outcomes, prerequisite(s) if any, Text/Reference
books, Teaching schedule, and Evaluation procedure. The university will offer a range of
subjects depending on availability of faculty, demand and course requirements. The list
of subjects offered may vary from semester to semester. The Dean, Course & Subject
Coordinator will be responsible for the conduct of the education program. To ensure
systemic teaching, learning and understanding of the subject they may modify the laid
down course content by 25% if considered necessary.

6. TEACHING AND LEARNING PROCESS

a. The mode of teaching will include a combination of lectures, practicals, seminars, audio-
visual presentations by faculty members, post-docs and doctoral scholars. Guest lectures and
seminars by external experts and scientists, academic and industry experts will also be
organized from time to time depending on the availability and requirement of the particular
course.
b. The learning process shall also include assignments in each subject. The assignments will be
reviewed, evaluated and would carry suitable marks.
c. Study tours to industry and institutes will also be arranged where necessary and feasible.
d. In addition to these, students will also be required to present a seminar related to their project
/ subject topics. The seminar serves as a way to improve presentation skills, practice for oral
exams ahead, and spread the awareness among the students of the exciting research projects
going on in other areas / subjects / groups.
e. Coursework is also part of the teaching-learning process. Students will be assigned some task
for self-learning purpose. The task(s) will include reading, writing, experimentation, making
reports etc.
f. During the final semester, students may be required to undertake research project in one of
the research areas. The project work can be done at the University or at any other Research
Institute, University or Industry. Project work provides opportunities to students to learn
several important aspects that cannot be taught in a class room or laboratory. Apart from
deeper understanding of the subject, students also learn problem solving, how to think
independently and work as a team etc.
g. Students are exposed to continuous evaluation process. Students identified as slow learner via
class tests, oral tests, classroom interactions, are put on special assistance program. This
includes extra support from faculty in the form of tutorials, extra classes, advices and
continuous assistance.

8
7. ELIGIBILITY CRITERIA
The minimum qualification for enrolment for the undergraduate program is qualifying 10+2
examination. The minimum qualification for enrolment for the postgraduate program is
qualifying a suitable Bachelor degree. Student will be enrolled on the basis of merit. The
University may lay down suitable selection procedure to enrol students.

8. EXAMINATION AND EVALUATION PROCESS

The conduct of examinations and evaluation process is regulated by the Office of the
Controller of Examinations. In each semester there will be one Midterm and one semester
end examination (Theory and Practical). The assessement will also include the
assignments. The breakup of the marks for midterm exams, practicals, assignments and
final exams for each semester will be laid down by the Controller of Examination time to
time. Each paper will be of 100 marks. The sum of maximum marks of all assessment
components for all
subjects/papers will be 100, irrespective of no of credits. The university has adopted the
grading system. The assessment/evluation criterion is given in the tables below. More
details can be found in the University’s Assessment and Examination Policiy and
Procedure documents.

For Theory Papers/Subjects:

S. No. Component Weighage Marks

1.0 Internal assessment
1.1 Assignment/s 40% 20
1.2 Midterm examination (Theory) 20
2.0 External Assessment
2.1 Semester end examination (Theory) 60% 60
Total Marks 100% 100

For Practical Papers/Subjects:

S. No. Component Weighage Marks

1.0 Internal assessment
1.1 Continuous evaluation 40% 40
2.0 External assessment
2.1 Semester end examination (Practical) 60% 60
Total Marks 100% 100
For Project work:

S. No. Component Weighage Marks

1.0 Internal assessment

9
 1.1 Report 50% 50
2.0 External assessment
2.1 Presentation 50% 50
Total Marks 100% 100

Note: A minimum passing marks is 40% in every subject.

9. PLAGIARISM

The University intends to develop and promote original work. Taking another person's
words or ideas and using them as if they were your own or Plagiarism, as it is called, is
taken very seriously at the University. Plagiarism may be deliberate or accidental.

Actions that constitute Plagiarism

1. Downloading and turning in a paper from the Web including a Web page or a paper from
an essay writing service.
2. Copying and pasting phrases, sentences, or paragraphs into your paper without showing a
quotation and adding proper citation.
3. Paraphrasing or summarizing a source’s words or ideas without proper citation.
4. Including a graph, table or picture from a source without proper citation.
5. Getting so much help from a tutor or writing helper that the paper or part of the paper is
no longer honestly your own work.
6. Turning in previously written work when that practice is prohibited by your instructor.

Students are advised to acknowledge whenever they take others work in their assignments,
reports, publications, research work etc. Reports of plagiarism will invoke strict penalties either in
repetition of the work, reflecting in examination and evaluation process where no credits or marks
are admissible, suspension from course or lead to expulsion from the university.

10
PART – II: COURSE STRUCTURES

11
B. TECH CURRICULUM

Abbreviations:

C : Compulsory Subjects S : Basic Science Subjects

E : Basic Engineering Subjects BC: Branch Specific Core
BE: Branch Specific Electives M: Management Subjects
O: Open Electives

Distribution of Credits in various categories

Category Credits

Humanities and Social Sciences including Management courses (M) 08

Basic Science courses (S) 24

Engineering Science courses including workshop, drawing, basics of 18

electrical/mechanical/computer etc. (E)
62
Professional core courses (BC)

Professional Elective courses relevant to chosen specialization / branch (BE) 08

Open subjects – Electives from other technical and / or emerging subjects (O) 8/12*

English, Computer, Project work, Internship in industry or elsewhere (C) 38

Total 166-170

12
B.Tech.(Computer Engineering specialization Software Engineering )

Semester-1
S.N Code Subject Name Theory Practical Total
1 CH201 Fundamentals of Chemistry 4 2 6
Introduction to Computers &
2 COM101 Programming Using 'C' 3 1 4
3 EM201 Mathematics–I 4 0 4
4 ENG101 English Communication 2 0 2
5 PHY201 Engineering Physics 4 2 6
Total Total 22
Semester-2
S.N Code Subject Name Theory Practical
1 ENV101 Environmental Science 2 0 4
2 EM202 Engineering Mathematics – II 4 0 3
3 BIO501 Introductory Biology 4 0 4
Basic Electrical and Electronics
4 EEE201 Engineering 3 1 4
5 EGS201P Engineering Graphics 0 3 3
6 EWP201P Engineering Workshop 0 2 2
Total 20

Semester-3
S.N Code Subject Name Theory Practical
1 CE301 Data Structure and Algorithms 3 1 4
2 CE302 Object Oriented Programming 3 1 4
3 CE303 Discrete Mathematics 3 0 3
4 MTL301 Material Science 4 2 6
5 CE 304 Fundamental of Electronics 3 1 4
Total 21
Semester-4

S.N Code Subject Theory Practical Total Credit

1 CE310 Computer System Architecture 3 1 4
2 CE311 Database Management System 3 1 4
3 CE312 Programming in JAVA 3 1 4
4 CE313 Python Programming 3 1 4
Network Analysis and Analog
4
5 ELTR301 Electronics 3 1
Total 20

13
 Semester-5
S.N Code Subject Theory Practical Total Credit
1 CE401 Theory of Computation 3 0 3
2 CE402 Computer Network 3 1 4
3 CE404 Operating System 3 1 4
4 CE405 Advanced Java Technology 3 1 4
5 CE406 Software Engineering 3 0 3
6 CE407 Software Design 3 0 3
Total 21
Semester-6
Theory Practical
S.N Code Subject Credit Credit Total Credit
1 Management-I (Business And
BOM401 Organizational Management) 4 0 4
2 Cryptography and Information
CE412 Security 3 1 4
3 CE411 Distributed Computing 3 0 3
4 SE401 Software Architecture 3 0 3
5 SE402 Software Testing 3 1 4
6 Elective I 3 1 4
CE421 Machine Learning-1
CE423 Digital Signal Processing
Total 22

Semester-7
1 CE502 Project – I 0 4 4
Management – II (Entrepreneurship
2 EBD 501 and Business Development) 4 0 4
3 PRM 501 Project Management 2 0 2
4 CE503 Compiler Design 3 0 3
5 SE501 Software Quality Management 3 0 3
Elective II 3 1 4
CE511 Machine learning-2
CE512 Cloud computing
Total 20

Semester 8
SN code Subject Theory Practical Total
1 CE520 Project-2(Industrial Project ) 0 20 20

14
PART – III: COURSE CONTENTS

15
----------------------------------------------------------------------------------------------------------------
COMPULSORY SUBJECTS
----------------------------------------------------------------------------------------------------------------

English

Course Detail
Preamble:

(a) To understand currents of Business and Scientific communication by introduction of basic

research documentation through technical writing.
(B) To enable learners to appreciate use of English language in real situation.
(c) To enhance various English language skills and abilities of the learners.

Level: Undergraduate
Language: English
Prerequisite: Basic knowledge of English grammar, vocabulary and an interest in English
language skills and communication practice in real situation.

2. Course Resources:

Reference Books
Locker and Kaczmarek, Business Communication: Building Critical Skills, TMH.
AAS, Hornby and Joanna, Turnbull (Eds.). Oxford Advanced Learners’ Dictionary.
New Delhi: OUP, 2010.
Wren, PC and Martin, H. High School English Grammar and Composition.
New Delhi: S. Chand and Co., 2007.
Gimson, AC and Susan, Ramsaran. An Introduction to the Pronunciation of English. London:
Edward Arnold ELBS, 2012.
Balasubramaniam, T. A Text book of English Phonetics for Indian Students.
New Delhi: Macmillan, 1981.
O Brien, Terry. Little Red Book Idioms and Phrases. New Delhi: Rupa and Co., 2011.

3. Teaching Schedule

Theory/Practical

Unit/Module I
Language Skills: Four basic Language Skills – LSRW, Classification of Language Skills, Forms
of Language, Language as Skill, Language in Practice and Production, English Language as a
Means of Everyday Communication and Expression: Talk about Self, family, neighbors,
college/work group, weather, places, Entertainment, Subjects of study.

Unit/Module II

16
Comprehension: Theory and Practice of Comprehension, Developing Reading skill, Listening
Audio Clips and Reading Paragraph, Review and Analysis, Technique of paraphrasing

Unit/Module III
Vocabulary Building and Pronunciation: Vocabulary Building Techniques, Word Formation
Process, Greek and Latin Root Words and Extensions, Story Association, Suffixes, Prefixes, use
of Thesaurus and Internet Resources, Words often confused and misspell

Unit/Module IV
Grammar – Verb Forms, Modal Auxiliary, Forming Questions, Parts of Speech, Sentence
Pattern, Active and Passive Voice, Degrees of Comparison, Subject Verb Agreement

Unit/Module V
Writing Skill - I: Composition, Précis Writingand Story
Composition/ Paragraph Writing: Topic Sentence, Developing Paragraph, Composition (150
words),
Précis Writing: Theory and Exercise, Review and Analysis
Developing Story: Developing uncompleted story, developing story from Points given.

Unit/Module VI
Writing Skill - II: Business Letters, Layout/ Format, Elements of Letter, Types of Letters:
Inquiry Letter, Reply to Inquiry Letter, Order Letter, Reply to Order Letter, Formal Language for
Business Communication.

4. Plagiarism

The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

17
Communications Skills

Course Details
Preamble:
(a)To enable the learners to understand the urge, need and desire of communication as a
spontaneous process.
(b)To impart knowledge of communication skills and proficiency of both verbal and non-verbal
communication to learners as per the need and desire of real situations.
(c)To enable learners to think critically and understand and appreciate communication hierarchy
in organization.
(d)To provide an understanding of the global demands of communication.
(e) To enable learners to adapt communication strategies.

Level: Undergraduate
Language: English
Pre-requisite: Proficiency in English and Language Skills

Reference books:
Baron, RA; Branscombe, NR; Byrne, D and Bhardwaj, G. Fundamentals of Social Psychology.
Noida: DK India Pvt. Ltd, 2009.
Clarkson, P. Transactional Analysis Psychotherapy: an Integrated Approach. London: Routledge,
2013.
Goleman, D. Social Intelligence: The New Science of Human Relationships. London: Random
House Large Print, 2011.
Goleman, D. Emotional Intelligence: Why it can matter more than IQ. London: Bloomsbury,
2011.
Ludlow, R. and Panton, F. The Essence of Effective Communications. New Delhi: Prentice Hall
ofIndia Pvt. Ltd, 1992.
Monipally, Matthukutty M. Business Communication Strategies. New Delhi: Tata-McGraw-
Hills,
2001
Lesikar, R.V. & Flatley, M.E. Kathryn Rentz; Business Communication Making Connections in
Digital World, 11th ed., McGraw Hill Education, 2009.

3. Teaching Schedule

Theory/Practical

Unit/ Module- I
Communication in Organizations: Basics of Communication, Process of Communication,
Upward Downward Communication, Sharing Information through Channels, Feedback
Mechanism, Written and Oral Communication, Formal-Informal Communication, Preparing
Oneself for Formal Meetings

Non-verbal Communication: Body language and Its Effect on Words, Gestures and Postures and
Their Meaning, Positive Body language, Voice Modulations and Facial Expressions.

18
Unit/Module II
Interpersonal Skills: Transactional Analysis for Interpersonal Relations, Analysis of Different
Ego States (parent, adult, child) –Analysis of Transactions (complementary, crossed, ulterior),
Analysis of Strokes (reward and punishment), Analysis of Life positions.

Unit/Module III
Communication in Groups/Teams: Communication in a Peer group: Handling Peer Pressure,
Where to draw the line and say no, Understanding Cultural Differences and Making
Adjustments, Overcoming Gender Biases, Stereotypical Behavior and Prejudices amongst Group
Members, Business Letters (Job Application, Resume and Cover Letter), Email Etiquettes,
Telephone Etiquettes, Using Networking Sites: Dos and Don’ts.

UNIT/MODULE IV
Leadership Skills: Understanding Group Dynamics, Leader vs. Follower, Categories of Leaders
(entrepreneurial, administrative and political), Leadership Styles (situational leadership),
Identification of Individual Leadership Styles and Construction of Personal Leadership Style
Profiles, Problem Solving and Decision Making.

UNIT/MODULE V
Conflict Management and Negotiation Skills: Concept of Conflict, Goal Conflict, Cognition
Conflict, Emotional Conflict, Conflict Management Styles based on Thomas Kilman, Conflict
Mode Instrument, Negotiation Skills, Give and Take, Developing Assertiveness over
Aggression.

UNIT/MODULE VII
Speaking Skill: Medium forEffective Communication, AvoidingMiscommunication, Interview
Skills, Public Speaking, Presentation Skill, Using Non verbal with Speaking, Analyzing
Audience, Introduction to English Phonetics; Spoken Language Mechanics: pronunciation,
vocabulary, grammar and word order.

UNIT/MODULE VIII
Interview Techniques and Group Discussions: Preparing Oneself for an Interview, FAQs,
Handling Stress Interviews – Telephonic Interviews; Group Discussions: Group Discussion as a
Technique of Screening, Preparation, Role of Emotional Quotient while Handling Sensitive
Topics.

UNIT/MODULE IX
Dissertations and Reports: Chronology of Headings, Subheadings, Structure Experiment and
Data Collection: Putting them in words/tables/graphs, Studies, references, bibliography, Results
and conclusions, Acknowledgement, certifications etc.

Plagiarism

19
The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

20
Introduction to Computers & Programming Using ‘C’

1. Course Detail

1.1 Course Description

The students will be able to understand the fundamentals and importance of Computer and
programming language and the concepts of Binary arithmetic.
To develop understanding in to basic computer programming, aspect and algorithm

1.2 Learning Targets/Outcomes

This course provides basic fundamentals of Computer and C Programming language and is most
suited to the graduate students. The Student should have basic logical and reasoning capacity for
learn the programming.

1.3 Course Organization

There will be 3-hours lecture per week, 1-hour tutorial/discussion and 2 hours Laboratory session
each week. Please note that some of the tutorial/discussion sessions may be converted to lectures
if need be. Students are expected to attend all lectures and to participate in class discussions

Reference Books
ANSI C E. Balaguruswami - TMH Publications
Programming in C, 2/e - Ashok Kamthane – Person Publication
Computer Fundamentals – By P. K.Sinha.

3. Teaching Schedule

3.1 Introduction to Computers

3.1.1 History of Computer, Types and generations of Computers Basic Computer Organization
3.1.2 Characteristics of Computers and Uses of computers, Units of a computer
3.1.3 CPU, ALU memory hierarchy, registers, I/O devices

3.2 Introduction to PC Architecture

3.2.1 Study of PC-AT/ATX System
3.2.2 Pentium, Core, Core 2 Cord, Core 2 Duo
3.2.3 I3, I5, I7 Processor, Motherboards, Chipset and Controllers, BIOS and the Boot Process,
Computer Memory
3.2.4 IDE and SATA Devices: Hard Disk Drive and CD/DVDs Drives
3.2.5 SCSI Devices, Floppy Disk, Zip Drive, Backup Drive,
3.2.6 Expansion Cards- LAN Card, IDE Card, VGA and SVGA Cards, Sound Card, Interface
Cards, I/O cards, Video Cards, USB Card, Fire-Wire Cards, Internal Ports, Cables and Connector
Types.

3.3 External Components of PC

3.3.1 Monitors: - CRT, LCD and LED Displays,
3.3.2 Printers: - Dot-Matrix Printer, Inkjet Printer, Laser Printer
3.3.3 Scanner: - Photo Scanner, Documents Scanner, Bar Cord Scanner

21
3.3.4 Keyboards, Mouse, External Modem, Ports and Connectors, Batteries, Power supply, Pen
Drives, SCSI interface devices, Laptop Computers, Digital Advance storage technology.

3.4 Network Components

3.4.1 Introduction of Network Cable like UTP, STP, Fiber Optics, Hub, Unmanageable Switch,
Manageable Switch,
3.4.2 Router, Modem, Wi-Fi, Access Point, PCI Wireless Card, USB Wireless Device, Print
Server, USB Network Sharer, Backup Device, Server Hardware etc.

3.5 Overview of C
3.5.1 Sample c programs basic structure of c programs, programming style, Flowchart, decision
table, algorithms ,executing c program, Structured programming concepts programming
methodologies viz,
3.5.2 Top-down programming; Bottom-up programming Constants, Variables and Data Types,
and Character set of c, Tokens, keywords Identifiers, constants
3.5.3 Documentation, defining symbolic constants, Arithmetic Operators, Relational Operators
Logical operator’s assignment, Increment-decrement, conditional, bit-wise and special

3.6 Arithmetic expressions

3.6.1 Evaluation of expressions
3.6.2 Precedence of arithmetic operators
3.6.3 Type conversions in expressions
3.6.4 Mathematical functions

3.7 Managing Input Output Operators and Decision Making with branching
3.7.1 Operator precedence and associatively, Reading and writing a character, formatted input-
output, Looping statements
3.7.2 What is Array? Types of Array

3.8 Handling of Character Strings

3.8.1 Declaring and initializing string variables
3.8.2 Reading string from terminal, writing string to screen
3.8.3 Arithmetic operations on character
3.8.4 Putting string together, comparison of two strings

3.9 String handling functions

3.9.1 Table of strings
3.9.2 User-Defined Functions, types of UDF
3.9.3 Need for user-defined functions
3.9.4 Need for user-defined functions

3.10 Structures and Unions

3.10.1 Structure definition
3.10.2 Giving values to members
3.10.3 Giving values to members
3.10.4 Structure initialization

3.11 Comparison of structures

22
3.11.1 Arrays of structures
3.11.2 Arrays within structures
3.11.3 Structures within structures
3.11.4 Structures within structures

3.12 Structures, Unions, Pointers

3.12.1 Structures and functions unions
3.12.2 Size of structures, Bit fields
3.12.3 Definition of Pointer, Notation
3.12.4 Pointers and arrays

3.13Array of pointers
3.13.1 Pointers and functions
3.13.2 Call by value and call by reference
3.13.3 Pointers and strings

4. Plagiarism

The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

23
Environmental Science

1. Course Detail

1.1 Course Description

This course aims to introduce environmental science as a discipline, and as a way of thinking to
define sustainability – a complex and contested concept. A holistic and interdisciplinary
approach is needed to understand both local as well as global environmental issues. This course
will briefly introduce the fundamentals and processes that are important to environmental
science. This course also introduces topics that will be studied in detail during this programme.
So, this course serves as a prerequisite for most courses required for Environmental Science
major.

Students will study environmental topics in detail through other courses such as Natural
Resource Management, Environmental Physics, Environmental Chemistry, Environmental
Biology, Environmental Law, Environment and Society, and many more.

1.2 Learning Targets/Outcomes

The key objectives of this course are to enable students to:

Acquire basic knowledge and understanding of the fundamentals of environmental Science

Understand physical, chemical, and biological processes affecting the environment

Become informed of major environmental challenges

Understand how the scientific method is applied to solve/mitigate these issues

Strengthen their ability to integrate and communicate about complex environmental issues and
how humans respond to these problems effectively

1.3 Course Organization

There will be 2-hours lectures per week. There will be 3 hours field work during the semester.
Students are expected to attend all lectures and to participate in class discussions.

2. Reference book:

2.1 Course Textbook

G. Tyler Miller and Scott E. Spoolman (2013), Environmental Science, 14th Edition 2013.,
Brooks/Cole Cengage Learning.

Sharma P.D. (2013), Ecology and Environment- 11th Edition, Rastogi Publication

2.2 Course Reference Textbook

24
Odum, E. P., Odum, H. T., & Andrews, J. (1971). Fundamentals of ecology (Vol. 3).
Philadelphia: Saunders.

Singh, J.S., Singh, S.P. and Gupta, S.R. 2014. Ecology, Environmental Science and
Conservation. S.Chand Publishing, New Delhi.

3. Teaching Schedule

Unit/Module I
3.1 Introduction to environmental studies (2 lectures)
3.1.1 Multidisciplinary nature of the environmental studies

3.1.2 Scope and importance of environmental science

3.1.3 Definition of environment, sustainability and Sustainable development
3.2 Ecosystems (2 lectures)

3.2.1Definition of ecosystem, Components of ecosystem

3.2.2 Structure and function of ecosystem: Ecological pyramids, food chain and food webs,
energy flow in an ecosystem
3.2.3 Productivity in ecosystems

Unit/Module II
3.3 Study of Major Ecosystem and its components (2 lectures)
3.3.1 Forest Ecosystem
3.3.2 Grassland Ecosystem

3.3.3 Desert Ecosystem

3.3.4 Aquatic Ecosystem (Lentic & Lotic)
3.4NaturalResources:RenewableandNon‐renewableResources (2 lectures)
3.4.1 Natural resources and its classification

3.4.2 Land resources and land use change; Land degradation, kinds of soil erosion, and agents
3.4.3 Water: Use and over-exploitation of surface and groundwater, floods, droughts

Unit/Module III
3.5 Natural resources and its conservation (2 lectures)

3.5.1Deforestation: Causes and impacts due to mining, dam building,; Desertification.

3.5.2 Conservation of Forests: Afforestation, Social Forestry, Joint Forest Management

3.5.3 Energy resources: Renewable and non-renewable energy sources, use of alternate energy
sources, growing energy needs, case studies.
3.6 Introduction to Biodiversity (2 lectures)

3.6.1Definition and Levels of biological diversity: genetic, species and ecosystem diversity;.

25
3.6.2Biogeographiczones of India; Biodiversity patterns and global biodiversity hot spots
3.6.3Indiaasa mega---biodiversity nation; Endangered and endemic species of India

Unit/Module VI
3.7 Biodiversity and its conservation (2 lectures)
3.7.1. Biodiversity categories in IUCN RED Data book
3.7.2. Threats to biodiversity: Habitat loss, poaching of wildlife, man-wildlife conflicts,
biological invasions

3.7.3 Conservation of biodiversity: In-situ (Protected areas: Sanctuaries, National Parks,

Biosphere reserves and Tiger reserves) and Ex- situ (Botanical gardens, Zoo, Gene Bank, Seed
Bank, Cryopreservation) conservation of biodiversity.

3.8EnvironmentalPollution (2 lectures)

3.8.1Environmentalpollution: types, causes, effects and controls; Air, water, soil and noise
pollution

3.8.2 Nuclear hazards and human health risks

3.8.3 Pollution case studies
3.9 Solid waste management (2 lectures)

3.9.1 Sources and Generation of solid waste

3.9.2 Management of Municipal solid waste: Collection, Segregation, Storage, Transportation

and disposal
3.9.3 Introduction to Landfill sites

Unit/Module V
3.10 Environmental Issues, Policies & Practices (2 lectures)
3.10. 1 Major environmental issues and its impacts:
Climate Change and Global Warming
Ozone layer depletion
Acid rain

3.10.2 Nature reserves, tribal populations and rights

3.10.3 Human wildlife conflicts in Indian context

3.11 Environmental Legislation (2 lectures)

3.11.1Introduction to Environment Laws:

Environment Protection Act;
Air (Prevention & Control of Pollution) Act;
Water(Prevention and control of Pollution) Act;

Wildlife Protection Act; Forest Conservation Act.

3.11.2 International agreements:

26
Montreal Protocol

Kyoto protocols
Conventionon Biological Diversity(CBD).

Unit/Module VI
3.12Human Communities and the Environment (2 lectures)

3.12.1 Human population growth: Impacts on environment, human health and welfare.

3.12.2 Resettlement and rehabilitation of project affected persons; case studies.

3.12.3Environmental ethics: Role of Indian and other religions and cultures in environmental
conservation.
3.12.4 Environmental movements: Chipko, Silent valley, Bishnois of Rajasthan.

Unit/Module VII
3.13 Environmental Hazards and Disasters (2 lectures)

3.13.1 Definition, Types of Disasters

3.13.2 Natural Disasters: Floods, Earthquake, Cyclones and Landslides
3.13.2 Disaster Risk Management

3.14Environment Overview and Revision (1 lecture)

3.14.1 Class overview and revision
3.14.1 Final revision and career opportunities

4. Plagiarism

The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

27
PROJECT – I

1. Course Details

Course Objectives
The aim is to evaluate the quality and competence developed by the student to implement
theoretical concepts in terms of research/practical project/technical-report and to introduce
Principles of project management to effectively implement available resources in stipulated
period.
1.2 Learning Targets/Outcomes
Apply the relevant knowledge and skills to solve problem related to project work. Identify how
the research methodologies were used to answer the key questions and try to explore the
alternative methodologies. Do critical assessment of own results obtained based on experimental
findings. Analysis of cost-effective feasibility bases on detailed project report. To strategize and
design a study for their dissertation.
1.3 Course Organization
Project will be allotted to students either individually or in groups and will have one guide from
Institute. Students may choose co-guide from the industry. Students are expected to spend 3
hours or more each week to accomplish assigned project work, experimentation, etc. It is
recommended that student should meet respective guide regularly during the course of project.
Student should maintain a record notebook/file where they can include a record of their
discussions with guide, literature survey details, derivations etc. This will allow easy and quick
access to the details and chronology of the work done by student.
The project proposal should be submitted to the respective coordinators and later a detailed
presentation followed by any revisions have to be carried out. Students are expected to attend all
the seminars and to participate in discussions. There has document submission and seminar
presentation by the learners.
2. Course Instructor: Course coordinator and nominated member/s.
3. Teaching Schedule
3.1 The project proposal
Should be prepared and submitted in the format of synopsis report with all the relevant
guidelines.
3.2 Proposal presentation
The seminars should be presented with details on the title, objective, genesis of the concept,
methodologies, expected deliverables and limitations.
3.3 Revision (If suggested)
A revised report to be submitted if required.

4. Evaluation
The learner and presenter should opt for a topic relevant to the Major’s degree. Emphasis should
be given on the research methodologies and the approach used. The presentation should reflect
conceiving a small proposal based on the presented topic and techniques used. A write-up of 2-3
pages relevant to the topic should be submitted along with the hand-out of the presentation. In
the presentation and the report, citations should be used to refer to supporting material (e.g.,

28
Miller and Spool man, 2013). A full bibliography of cited material should be included. List of
potential topics for presentation: Can be agreed after discussion with the concerned faculty
member.

PRJ 702: PROJECT - II

Credits: 0+20 OR 4+16=20

1. Course Details

1.1 Course Objectives

Application of systematic project management processes and practical techniques, tools and
resources to actual industrial problems. Evaluation of the research carried out by the students to
the solution of well-defined engineering problems during the project dissertation. Introduce
student to Principles of project management for efficient completion of the project in optimum
duration with efficient use of available resources.

1.2 Learning Targets/Outcomes

To grasp the key findings of the background research forming the platform for their
dissertation.
To identify how the research methodologies were used to answer the key questions and try to
explore the alternative methodologies.
To strategize and design a study for their dissertation.
To explore various statistical tools used to analyze the research data.

1.3 Course Organization

Industry-based project work drives the students to apply their knowledge and skills to actual
industrial problems identified by industrial partners. Such projects create valuable experiences
for the students. The last semester of the program is dedicated to Industry-based projects either in
Industry or In-House and preparation of the dissertation thesis which would follow a presentation
to evaluate the work.

2. Course Instructor: Subject coordinator and nominated member/s.

3. Learning Schedule
3.1 Research Work
In-House
Students should find out a problem statement/research topic or assisted by course instructor, opt
a coursework relevant to the research topic and carry research on the selected topic.
Industry-based project
Students should find out industry of their own choice or suggested by course instructor.
Student should gain experience according to the title considered. For e.g.
Projects carried out
Supervisory works
Problems encountered
Problems solved

3.2 Dissertation report

29
Should be prepared and submitted in the format of dissertation thesis with all the relevant
guidelines.

3.3 Project presentation

The seminars should be presented with details on the title, objective, genesis of the concept,
Methodologies used, Results, Future prospects and the hurdles encountered.

4. Evaluation
The student should be evaluated throughout their dissertation. The dissertation thesis would be
evaluated, followed by presentation of the work and extensive viva. In the presentation and the
thesis, citations should be used to refer to supporting material (e.g., Miller and Spoolman, 2013).
A full bibliography of cited material should be included.

List of potential topics for presentation

Dissertation research.

Project Management
 Introduction to Project Management
What is project management
Exploring opportunities in the project management field
Skills for project management
Different types of projects
Difference between project and program
 Business and Financial Issues
Understanding the importance of a business case
Developing a business case
Identifying project costs
Calculating return on investment (ROI)
Calculating a payback period
Determining net present value (NPV)
 Role of Planning in Project Management
Planning a project
Identifying and delivering on priorities
Managing stakeholders
Developing a project management plan
RACI Matrix
Managing the project scope

30
 Assessing the feasibility of a project
Identifying and managing risks
 People in the Project
Assembling your project team
Planning resources for project team
Managing your project team
Managing conflict within the team
Communications
Project leadership and fostering teamwork
 Implementing a Project
Structuring a contract
Managing a project
Setting up a project database
Creating an effective work schedule
Monitoring of progress and reporting
Conducting effective project meetings
Identifying and Managing change

 Project Management Techniques

Identifying organisational structures
Estimating costs and budgeting
Using critical path project management tools (eg. WBS, Gantt chart, Project Network
Diagram)
Establishing the critical path
Tracking project milestones
Using the program evaluation and review technique
Using process improvement tools (eg. Fishbone, SIPOC)
Managing time
Controlling cost and quality
 Project Lifecycle
Identifying the life cycle of a project
handing over a project

31
 Closing a project
Reviewing a project
----------------------------------------------------------------------------------------------------------------
BASIC SCIENCES
----------------------------------------------------------------------------------------------------------------
Mathematics – I (Calculus)

1. Course Details
1.1 Course Description
Calculus is the fundamental of any mathematical analysis. With this we get the ability to find the
effect of changing conditions on the system and it provide ability to model and control the
system under investigation. This course emphasizes fundamental concepts from differential
calculus and to use it as a tool for understanding functions.

1.2 Learning Targets/Outcomes

The key objectives of this course are to enable students:
The students will be able to understand the fundamentals and importance of Differential
Calculus.
To learn how Differential Calculus can be extended to other mathematical areas.

1.3 Course Organization

There will be 4-hours lecture per week, 2-hours tutorial/discussion and presentation session each
week. Please note that some of the tutorial/discussion sessions may be converted to lectures if
need be. Students are expected to attend all lectures and to participate in class discussions.

2. Course Resources
2.1 Course Textbook
Differential Calculus by Shanti Narayan and Dr. P.K. Mittal
Thomas’s Calculus by George B. Thomas, Maurice D. Weir and Joel R. Hass
Mathematical Methods for Physics and Engineering by K.F. Riley, M.P. Hobson and S.J. Bence

2.2 Course Reference Book

Kreysizg, E., Advanced Engineering Mathematics, 8th Edition, John Wiley & Sons, Inc., 2010.
Thomas, G.B., Finney, R.L., Calculus and Analytical Geometry, 9th Ed., Addison Wesley, 1996.
Jain, R.K. &Iyengar, S.R.K., Advanced Engineering Mathematics, 3rd Edition, Narosa, 2008.
3. Teaching Schedule
3.1 Course Content
Functions, Limits and Continuity
Functions of single variable, Limit of a function, indeterminate forms, L’Hospital’s rule,
continuity, intermediate value theorem for continuous functions, discontinuity.

Differentiation
Tangents and the derivative at a point, the derivative as a function, derivatives of trigonometric
functions, chain rule.

3. Mean Value Theorems

32
Rolle’s Theorem, Lagrange’s mean-value theorem, Cauchy’s mean-value theorem, Generalized
mean value theorem (Taylor’s theorem, Taylor’s series).

4. Maxima and Minima

Maximum and minimum value of a function, necessary and sufficient conditions for extreme
values, use of second order derivatives, Lagrange’s method of undetermined multipliers.

5. Partial Differentiation
Partial derivatives, homogeneous functions, Euler’s theorem on homogeneous functions, theorem
on total differentials, composite functions, implicit functions.

6. Integration and Applications of Definite Integrals

The definite integral, indefinite integrals and the substitution method, area between curves,
volumes using cross-sections: method of slicing, the disk method, and the washer method, area
of surfaces of revolution, improper integrals.

7. Vector Calculus
Gradient, Divergence and Curl, Vector identities, Directional derivatives, Line, Surface and
Volume integrals, Stokes, Gauss and Green’s theorems

Mathematics – II (Differential Equations)

1. Course Details

Course Description
Most of the mathematical models are formulated in terms of the equations involving functions
and their derivatives. Such equations are called differential equations. Differential equation is of
utmost important in the field of physics and engineering. This course aims to introduce the
concept and importance of elementary differential equations and it provides basic fundamentals
of differential equations for modeling physical and other phenomenon.

Learning Targets/Outcomes
The key objectives of this course are to enable students:
Acquire basic knowledge and understanding of basic fundamentals differential equation.
Will be able to explain the concept of differential equations and solve different form of
differential equation.
To be familiar from the ODE and PDE

1.3 Course Organization

There will be 4-hours lecture per week, 2-hours tutorial/discussion and presentation session each
week. Please note that some of the tutorial/discussion sessions may be converted to lectures if
need be. Students are expected to attend all lectures and to participate in class discussions.

2. Course Resources
2.1 Course Textbook
Elementary Differential Equations by Earl D. Rainville and Phillip E. Bedient
Mathematical Methods in Physical Sciences by M. L. Boas
Ordinary and Partial Differential Equation by Dr. M. D. Raisinghania

33
2.2 Course Reference Book
Jain, R.K. &Iyengar, S.R.K., Advanced Engineering Mathematics, 3rd Edition, Narosa,2008.
Kachot, K.R., Higher Engineering Mathematics, Mahajan Publishing House, 2012.
Kreysizg, E., Advanced Engineering Mathematics, 8th Edition, John Wiley & Sons, Inc.,2010.
Elementary Differential Equations and Boundary Value Problems by William E. Boyce and
Richard C. DiPrima

3. Teaching Resources
Differential Equations of Order One
Types of Differential Equations, Formation of differential equations, Separation of variables,
Homogeneous functions, Exact equations, General solution of linear equation, Determination of
integrating factors, Bernoulli’s equation.

Linear Differential Equations

Linear independence, Wronskian, General solution of a homogeneous and non-homogeneous
equation, Initial-Value and Boundary-Value problems

Higher Order Linear Differential Equations with Constant coefficients

The auxiliary equations: distinct roots, repeated roots, imaginary roots.

Non-Homogeneous Equations and Variation of parameters

Solution of a non-homogeneous equation, the method of undetermined coefficients, Reduction of
Order, Variation of parameters, solution of y” + y = f(x)

Partial Differential Equations

Introduction to PDE, Derivation of PDEs by the elimination of arbitrary constants, Linear PDEs
of order one: Lagrange’s method of solving, non-linear PDEs of order one: Charpit’s method,
Heat and wave equation and Laplace equation.

Complex Variables
Real and Imaginary part of a complex number, polar form of complex number, complex algebra
and infinite series, Analytic Functions.

Laplace Transform
Introduction, Laplace transform of elementary functions, inverse Laplace transform, operational
properties, application of Laplace transform to solve differential equation.

34
Physics (Mechanics)

1. Course Details

1.1 Course Description

This course is designed to teach students Newton’s law of motion, energy & momentum, Laws
of Gravitation, concept of simple harmonic oscillations, and elastic property in matter. This
course provides platform for understanding the upcoming relatively advanced physics subjects.
An introduction to the mathematical tools required for the course is given.

1.2 Learning Targets/Outcomes

On successful completion of the course students should:
Understand the Newton's laws and applying them in calculations of the motion of simple
systems.
Understand the rotating motion.
Understand the Gravitation and Kepler's laws of planetary motion.
Understand the concepts of simple harmonic and damped harmonic motion.
Understand the elasticity and its applications.

1.3 Course organization

There will be 3-hours lecture per week and 3 hours lab/project each week. How the lab/project or
fieldtrip section is carried out within the semester is at the discretion on the unit coordinator.
Students are expected to attend all lectures and to participate in class discussions.

2. Course Resources

2.1 Reference Books:

Advanced Practical Physics for students, B.L.Flint and H.T.Worsnop, 1971, Asia Publishing
House.
Advanced level Physics Practicals, Michael Nelson and Jon M. Ogborn, 4th Edition, reprinted
1985, Heinemann Educational Publishers.
Engineering Practical Physics, S.Panigrahi & B.Mallick,2015, Cengage Learning India Pvt. Ltd.
A Text Book of Practical Physics, Indu Prakash and Ramakrishna, 11th Edition, 2011, Kitab
Mahal, New Delhi.

3. Teaching Schedule
3.1 Vectors
3.1.1 Vector algebra.
3.1.2 Scalar and vector products.
3.1.3 Derivatives of a vector with respect to a parameter - I
3.1.4 Derivatives of a vector with respect to a parameter – I

35
3.2 Ordinary Differential Equations
3.2.1 Introduction to Differential equations.
3.2.2 First order homogeneous differential equations.
3.2.3 Second order homogeneous differential equations
3.2.4 Second order homogeneous differential equations with constant coefficients.

3.3 Laws of Motion

3.3.1 Frames of reference.
3.3.2 Introduction of Newton’s Laws of motion.
3.3.3 Newton 1st law of motion

3.4.1 Newton 2nd law of Motion

3.4.2 Newton 3rd law of motion
3.4.3 Problem on Newton’s Laws of motion.

3.5.1 Newton’s first, second and third law and their explanation
3.5.2 Dynamics of a system of particles.
3.5.3 Centre of Mass.

3.6 Momentum and Energy

3.6.1 Conservation of momentum.
3.6.2 Work and energy.
3.6.3 Work done by gravitational force

3.7.1 Work done by sping & applied force

3.7.2 Conservation of energy.
3.7.3 Motion of rockets.

3.8 Rotational Motion

3.8.1 Angular velocity
3.8.2 Angular momentum.
3.8.3 Torque,Conservation of angular momentum.

3.9 Gravitation
3.9.1 Newton’s Law of Gravitation
3.9.2 Motion of a particle in a central force field (motion is in a plane, angular momentum is
conserved, areal velocity is constant).
3.9.3 Kepler’s Laws (statement only).

3.10.1 Satellite in circular orbit

3.10.2 Satellite in circular orbit applications.
3.10.3 Geosynchronous orbits.

3.11.1 Weightlessness.
3.11.2 Basic idea of global positioning system (GPS).
3.11.3 GPS application

3.12 Oscillations

36
3.12.1 Simple harmonic motion.
3.12.2 Differential equation of SHM and its solutions.
3.12.3 Kinetic and Potential Energy, Total Energy and their time averages & Damped
oscillations.

3.13 Elasticity
3.13.1 Hooke’s law –
3.13.2 Stress-strain diagram
3.13.3 Elastic moduli-Relation between elastic constants

3.14.1 Poisson’s Ratio

3.14.2 Expression for Poisson’s ratio in terms of elastic constants
3.14.3 Work done in stretching

3.15.1 Work done in twisting a wire - Twisting couple on a cylinder

3.15.2 Determination of Rigidity modulus by static torsion
3.15.3 Torsional pendulum - Determination of Rigidity modulus and moment of inertia.

PHYSICS LAB: DSC 1A LAB: MECHANICS

Lectures

Measurements of length (or diameter) using Vernier calliper, screw gauge and traveling
microscope.
To determine the Height of a Building using a Sextant.
To determine the Moment of Inertia of a Flywheel.
To determine the Young's Modulus of a Wire by Optical Lever Method.
To determine the Modulus of Rigidity of a Wire by Maxwell’s needle.
To determine the Elastic Constants of a Wire by Searle’s method.
To determine g by Bar Pendulum.
To determine g by Kater’s Pendulum.
To determine g and velocity for a freely falling body using Digital Timing Technique
To study the Motion of a Spring and calculate (a) Spring Constant (b) Value of g

37
Fundamental Chemistry

Section A: Inorganic Chemistry-1

1. Course Details

Course Description
This course aims to introduce the concept and importance of fundamental chemistry in physical
and biological science which will be required for all the science major degree. It covers
microscopic and macroscopic concepts, atomic structure, chemical reactivity and bonding,
structure and reactivity, reactive intermediate and organic reaction. The laboratory portion
includes an introduction to identification of organic compounds through thin layer
chromatography and volumetric analysis.

1.2 Learning Targets/ Outcome

The main objectives of this course are to empower students to
Understand the concept of origin of chemistry
To identify the arrangement of elements in the periodic table, trends in periodic properties, mole
concept and molecular structure
To know the methods of naming organic compounds and reactive intermediates and their
properties in organic chemistry
To prepare the student for the study of chemistry by introducing general concepts and methods
this will be applied throughout the course.

1.3 Course Organization

There will be 3-hours lecture per week, 2 hours lab each week and 1-hours tutorial or equivalent
to 60 hours per semester. However the lab work is carried out within the semester at the
prudence of the unit coordinator. Students are expected to attend all lectures and to participate in
class discussions.

2. Course Resources

2.1 Course Text Books

F. A. Cotton, G. Wilkinson and P. L. Guas, Basic Inorganic Chemistry, 3rd ed., John Wiley,
1994.
Morrison, Robert Thornton & Boyd, Robert Neilson Organic Chemistry, Dorling Kindersley
(India) Pvt. Ltd. (Pearson Education), Sixth Edition, 2003.
Finar, I. L. Organic Chemistry (Volume 1), Dorling Kindersley (India) Pvt. Ltd. (Pearson
Education), Sixth Edition, 2003.
Organic chemistry by Mehta & Mehta Organic Chemistry; ArunBahl and B. S. Bahl.
Atkins, P.W. & Paula, J.D. Physical Chemistry, 9th Ed., Oxford University Press 2011.
Advanced physical chemistry; Gurdeep Raj Vogel’s Textbook of Quantitative Inorganic
Analysis, John Wiley & Sons, NY, V Edition1989.

2.2 Reference Books

P. Atkins, T. Overton, J. Rourke, M. Weller & F. Armstrong. Shriver and Atkins Inorganic
Chemistry, Oxford University Press (2006).J. D. Lee, Concise Inorganic Chemistry, 5th ed.,
Blackwell Science, London, 1996.

38
Harris, D.C. Quantitative Chemical Analysis, Freeman, W.H. & Co. Inc. NY, VII Edition, 2007.
Vogel’s Qualitative Inorganic Analysis, A.I. Vogel, Prentice Hall, 7th Edition.
Vogel’s Quantitative Chemical Analysis, A.I. Vogel, Prentice Hall, 6th Edition.
Textbook of Practical Organic Chemistry, A.I. Vogel , Prentice Hall, 5th edition.
Practical Organic Chemistry, F. G. Mann. & B. C. Saunders, Orient Longman, 1960.

3. Teaching Schedule

3.1 Atomic Structure

History and emergence of atoms and molecules
Bohr’s theory, its limitations and atomic spectrum of hydrogen atom
De Broglie equation, Heisenberg uncertainty principle and its significance
What is Quantum mechanics? Concept of shells and subshells, Quantum numbers, Wave
mechanical model

Radial and angular parts of the hydogenicwavefunctions (atomic orbitals) and their variations
Radial and angular nodes and their significance
quantum numbers and significance of quantum numbers
orbital angular momentum and quantum numbers ml and ms, Shapes of s, p and d orbitals

3.3.1 Discovery of spin, spin quantum number(s) & magnetic spin quantum number(ms)
3.3.2 Pauli exclusion principles and Hund’s rule of maximum multiplicity
3.3.3 Rules for filling electrons in orbitals-Aufbau principle and its Limitations
3.3.4 Concept of extra stability of half-filled and completely filled orbitals Variation of
orbital Energy with atomic number

3.4.1 Concept of exchange energy and Relative energies of atomic orbitals

Anomalous electronic configurations
Chemical Bonding and Molecular Structure
Ionic Bonding: General characteristics of ionic bonding
Statement of Born-Landé equation for calculation of lattice energy

Born-Haber cycle and its applications,

Fajan’s rules, ionic character in covalent compounds, bond moment, dipole moment and
percentage ionic character
Bond moment, dipole moment and percentage ionic character
Covalent bonding:VB Approach

Shapes of some inorganic molecules and ions on the basis of VSEPR

Hybridization with suitable examples of linear, trigonal planar, square planar, tetrahedral,
trigonalbipyramidal and octahedral arrangements
3.6.3 Concept of resonance and resonating structures in various inorganic and organic
compounds
3.6.4 MO Approach: Rules for the LCAO method

3.7.1 Bonding and antibonding MOs and their

3.7.2 Characteristics for s-s, s-p and p-p combinations of atomic orbitals
3.7.3 Nonbonding combination of orbitals

39
3.7.4 MO treatment of homonuclear diatomic molecules of 1st and 2nd periods
(Including idea of s-p mixing)

3.8.1 MO treatment of heteronuclear diatomic molecules such as CO, NO and NO+

Comparison of VB and MO approaches.

Section B: Organic Chemistry-1

Chemical Bonding and Molecular Structure

3.8.3 Physical Effects
3.8.4 Electronic Displacements: Inductive Effect, Electromeric Effect, Resonance
And Hyper conjugation

3.9.1 Cleavage of Bonds

3.9.2 Structure, shape and reactivity of organic molecules
3.9.3 Reactive Intermediates: Carbocations, Carbanions
3.9.3 Reactive Intermediates: free radicals

3.10.1 Strength of organic acids and bases

3.10.2 Aromaticity: Benzenoids and Hückel’s rule
3.10.3 Conformations with respect to ethane, butane and cyclohexane
3.10.4 Interconversion of Wedge Formula

3.11.1 Newmann, Sawhorse and Fischer representations

3.11.2 Concept of chirality
3.11.3 Configuration: Geometrical and Optical isomerism
3.11.4 Enantiomerism

3.12.1 Diastereomerism and Meso compounds)

3.12.2 Threo and erythro
3.12.3 D and L; cis- trans nomenclature
3.12.4 CIP Rules: R/ S (for upto 2 chiral carbon atoms) and E / Z Nomenclature
(for upto two C=C systems)

3.13.1 Aliphatic Hydrocarbons

3.13.2 Alkanes: (Upto 5 Carbons). Preparation: Catalytic hydrogenation, Wurtz
reaction, Kolbe’s synthesis, from Grignard reagent
3.13.3 Alkanes Reactions: Free radical Substitution: Halogenation
3.13.4 Alkenes: (Upto 5 Carbons) Preparation: Elimination reactions: Dehydration
of alkenes and dehydrohalogenation of alkyl halides (Saytzeff’s rule)

3.14.1 Cis alkenes (Partial catalytic hydrogenation) and trans alkenes (Birch reduction)
3.14.2 Reactions: cis-addition (alk. KMnO4) and trans-addition (bromine), Addition
of HX (Markownikoff’s and anti- Markownikoff’s addition),
3.14.3 Hydration, Ozonolysis, oxymecuration-demercuration, Hydroboration-oxidation
3.14.4 Alkynes: (Upto 5 Carbons) Preparation: Acetylene from CaC2 and conversion into higher
alkynes

40
3.15.1 Bydehalogenation of tetra halides and dehydrohalogenation of vicinaldihalides
3.15.2 Reactions: formation of metal acetylides
3.15.3 Addition of bromine and alkaline KMnO4
3.15.4 ozonolysis and oxidation with hot alk. KMnO4

4.Practical Syllabus

Section A: Inorganic Chemistry - Volumetric Analysis

1. Estimation of sodium carbonate and sodium hydrogen carbonate present in a mixture.
2. Estimation of oxalic acid by titrating it with KMnO4.
3. Estimation of water of crystallization in Mohr’s salt by titrating with KMnO4.
4. Estimation of Fe (II) ions by titrating it with K2Cr2O7 using internal indicator.
5. Estimation of Cu (II) ions iodometrically using Na2S2O3.

Section B: Organic Chemistry

1. Detection of extra elements (N, S, Cl, Br, I) in organic compounds (containing uptotwo extra
elements)

2. Separation of mixtures by Chromatography: Measure the Rf value in each case

(Combination of two compounds to be given):
Identify and separate the components of a given mixture of 2 amino acids (glycine, aspartic acid,
glutamic acid, tyrosine or any other amino acid) by paper
Chromatography
(b) Identify and separate the sugars present in the given mixture by
Paperchromatography.

Introductory Biology

1.Course details
1.1 Course description
It is basic subject for the students of B.Tech Bio-technology. Biotechnology deals with the entire
living organism and this subject provides overview of evolution of organisms and major
processes occurring in these organisms. This course is specially designed for the engineering
students having non-biological background. This course provides basic fundamental of concept
and integrated knowledge of biology including plants and animals that provide a strong scaffold
in learning of biological concepts of Nature.
Prerequisites: Basic concepts of Biology
Suggestion:This course is recommended for B. Tech Biotechnology students

1.2 Learning Targets/ Outcome

The key objectives of this course is to enable students to
Develop an understanding of basic biological concepts
Develop an understanding diversity of the Nature
Understand the morphology, structure and functions plants
Understand the process of evolution of lower to higher animals.

41
1.3 Course Organization
There will be 3 hours lecture and 1 hrs laboratory work per week or equivalent to -- hours per
semester. Please note that some of the tutorial/discussion sessions may be converted to lectures if
need be. Students are expected to attend all lectures and to participate in class discussions.

2. Course resources:

2.1 Course Text Book

Biology Textbook for class XI & XII, NCERT.
2.2. Reference Book:
Concepts of Biology, by Samantha Fowler et al. (Online PDF available)

3. Teaching Schedule
3.1 Basic Concept of the Biology
3.1.1 Importance of the Biology
3.1.2 Introduction of Biodiversity
3.1.3 Biological methods, Hypothesis and communication

3.2 Origin of life

3.2.1 Fundamental properties of life and level of organization
3.2.2 Origin of life and theories about origin of life
3.2.3 Cell theory, difference between Prokaryotes, Eukaryotes
3.2.4 Difference between Plant cells and animal cells

3.3 Evolution
3.3.1 Evolution
3.3.2 Micro and Macro Evolution
3.3.3 Theories of Evolution: Darwin’s and Lamark’s theory of evolution

3.4 Chemical concepts to living systems

3.4.1 General properties of the living system
3.4.2 Bio molecules & their importance
3.4.3 Importance of Water & Carbon in life

3.5 Taxonomy
3.5.1 Definition of taxonomy and relationship with systematic
3.5.2 Taxonomic characters: Morphological, Embryological, Cytogenetical
3.5.3 Phylogeny and the tree of life

3.6 Nomenclature & Classification

3.6.1 Nomenclature: Binomial and Trinomial nomenclature
3.6.2 Biological Classification: Different Kingdom system of classification
3.6.3: General characters and classification of animal phylum including invertebrates and
vertebrates

3.7 Homeostasis and Osmoregulation

3.7.1 Homeostasis
3.7.2 Thermoregulation

42
3.7.3 Hypothalamic Regulation of Temperature
3.7.4 Osmoregulation
3.8 & 3.9 General Concept of Plant BiologyImportance & Scope
3.8.1 Algae & Fungai
3.8.2Occurrence and thallus organization.
3.8.3 Modes of reproduction.
3.9.1 Thallus organization in Fungi.
3.9.2. Mode of nutrition & reproduction.
3.9.3 Economic importance of Algae & Fungi

3.10 & 3.11 Bryophyta, Pteridophyta& Gymnosperm

3.10.1 General characters of Bryophytes.
3.10.2 Evolution & Adaptation of Land Life.
3.10.3 General characters of Pteridophytes
3.11.1 Steler Evolution in Pteridophytes
3.11.2 General feature of Gymnosperm
3.11.3 Concept of naked seed

3.12 & 3.13 Angiosperm (General Concept)

3.12.1Life forms a general concept (Herbs, Shrub & Tree)
3.12.2 Leaf: Simple & Compound, Phyllotaxy
3.12.3 Root: General feature & Function
3.13.1 Flower- Complete, incomplete, actinomorphic, zygomorphic, irregular.
3.13.2 Inflorescence- Racemose, Cymose
3.13.3 Class Test

3.14 Plants and environment

3.14.1 Introduction, Scope and Branches of Ecology
3.14.2 Ecosystems: Kinds of Ecosystem: Natural, Artificial
3.14.3 Structure and Functions of Ecosystems
3.14.4 Ecological Pyramids, Productivity of an Ecosystem, Energy flow in an Ecosystem

4. Practical Syllabus

4.1 A list of potential topics for essay (internal assessment)

Origin of life & Cellular level of organization
Theories of evolution
Animal Classification and taxonomy
Characteristics of Chordates and Non-chordates
Homeostasis & Osmoregulation
Diversity of Plants
Morphology of vegetative organs
Morphology of reproductive organs in plants
Theories of organization

4.2 A list of potential laboratory/project work

43
Identification of General properties of Non-chordates including Protozoans, Poriferans,
Cnidarians, Ctenophorans, Platyhelminths, Nematodes, Annelids, Arthropods, Molluscs,
Echinoderms;Hemichordates.
Identification of General properties of chordates including Fishes, Amphibians, Reptiles, Birds,
Mammals
Anatomy – Section – Microtomy of leaf
Seed germination
Plant Cell – Onion peel
Field visit to identify the plants

Note:A minimum passing marks is Grade Point 4 as per UGC CBCS guideline.
If, any course don’t have credit for practical; in that conditions semester end examination theory
could be 60 marks.
If, any course has only practical credit, then also continuous evolution system will be followed as
internal assessment and semester end examination in 40:60 ratio.

5. Plagiarism
The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

----------------------------------------------------------------------------------------------------------------
BASIC ENGINEERING SCIENCES
----------------------------------------------------------------------------------------------------------------
EEE 201: Elements of Electrical And Electronics Engineering
Credits: 3+1=4

1. Course Details
1.1 Course Description
The aim of the course is to enable the students to acquire the knowledge of basic ac and dc
circuits, its analysis. This course covers basic of transformer, introduction to electrical machines,
basic aspects of analog and digital electronics.

Prerequisites: Basic knowledge of current, voltage, series/parallel connection of resistors, diode,

transistor, number systems and logic gates.
Suggestion: This course is recommended for B.Tech. 1st year students.

1.2 Learning Targets/Outcomes

After successful completion of the course, the students will be able to:
Learn the analysis of complex circuits using network theorems.
Illustrate the role of circuit elements in different system conditions.
Recognize the functions of electronic devices and basic circuits.
Apply the concepts of number based conversion and Boolean algebra for digital logic design.

1.3 Course Organization

44
There will be 3-hours lectures and two hours laboratory per week in current semester. Students
have to submit assignment time to time from the course content. Some of the tutorial/discussion
sessions may be carried out during lectures if need be. Students are expected to attend all lectures
and to participate in class discussions.

2. Course Resources
2.1 Course Textbook
B. L. Theraja, “Electrical Technology – Part I and II”, S. Chand and Co. 2012.
Robert Boylestad, and Louis Nashelsky, Electronics Devices and Circuit Theory, Pearson.
M. Morris Mano, Digital Logic and Computer Design, PHI.

2.2 Reference Textbook

Basic Electrical Engineering - Nagsarkar and Sukhija, Oxford University Press.
U. A. Patel, Textbook of Elements of Electrical Engineering, Mahajan Publishing House,
Ahmedabad.
D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill, 2010.
V. D. Toro, “Electrical Engineering Fundamentals”, Prentice Hall India, 1989.
D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill, 2009.

3. Teaching Schedule

DC Circuits
3.1.1 Electrical circuit elements (R, L and C), voltage and current sources
3.1.2 Kirchhoff’s current and voltage laws, methods of analysis
3.2.1 Star-delta circuits
3.2.2 Superposition theorem
3.3.1 Thévenin and Norton theorems

AC Circuits
3.3.2 Representation of sinusoidal waveforms, peak and RMS values
3.4.1 Phasor representation of AC quantities, real power, reactive power, apparent power, power
factor
3.4.2 Analysis of single-phase ac circuits consisting of R, L, C
3.5.1 RL, RC
3.5.2 RLC combinations (series and parallel)
3.6.1 Series and parallel resonance
3.6.2 Three phase balanced circuits
3.7.1 Voltage and current relations in star and delta connections, power measurement in three
phase circuits

Transformer
3.7.2 Construction and working principle
3.8.1 Ideal and practical transformer, applications

Electrical Machines
3.8.2 Elementary concept of electrical machines
3.9.1 Dc generator
3.9.2 Dc motor

45
3.10.1 Types of rotating electrical machines

Analog Electronics
3.10.2 Half and full wave rectifiers
3.11.1 Special purpose diodes
3.11.2 Regulator
3.12.1 BJT and its applications
3.12.2 Amplifier

Digital Electronics
3.13.1 Number systems and its arithmetic, binary codes
3.13.2 Boolean-algebra & simplification of Boolean expression
3.14.1 Logic gates, concept of universal logic
3.14.2 Implementation of Boolean expressions using logic gates
3.15.1Application of digital circuits (e.g. adder, subtractor, multiplexer, de-multiplexer, analog to
digital converter, digital to analog converter)
3.15.2 Application of digital circuits

5. Plagiarism
The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

6. Practical:

Introduction and use of measuring instruments – voltmeter, ammeter, multi-meter, oscilloscope,

Resistors, Capacitors and Inductors.
To verify the DC circuit currents and voltages by calculations and actual measurements.
To verify the Kirchhoff’s current and voltage laws.
To verify the Network theorems.
To obtain sinusoidal steady state response of R-L and R-C circuits – impedance calculation and
verification. Observation of phase differences between current and voltage.
To verify the resonance in R-L-C circuits.
To measure the power in three phase circuits using two wattmeter method.
To verify the current and voltage relationships in three phase star and delta connections.
Design a half wave rectifier circuit.
Design a full wave rectifier circuit.
Design a voltage regulator circuit.
Verify the truth table of logic gates.
Verify the functionality of given Boolean expression by implementing it with AND-OR-NOT
gates and NAND gates.

46
Engineering Graphics

Credits: 0+4=4

Objective: To familiarize and develop an understanding of the techniques and principles in

acquiring skills in engineering drawings in 2D models.
Level: Undergraduate.
Language: English.
Prerequisite: Knowledge of Basic Computing and Interest in Visualization and Engineering
Drawing

1. Course Details

1.1 Course description:

Students would be introduced to methods to aid visualization of engineering objects and
communicating the same to other professionals. This includes engineering drawings, CAD
systems and tools for processing and presentation of time evolving systems in the form of
animation, free-hand sketching of engineering objects and interpretation of drawings as a
visualization and communication tool. Design of simple assemblies would be involving theory of
constraints, generation of assembly views from part drawings, animation of assemblies. Use of
3D models of rigid and soft systems in conjunction with physics engines for representation of
time evolving system.

Course Objectives:
1. Introduction to graphic science and visualization (2P)
2. Free hand sketching of isometric & orthographic views and interpretation of drawings (4P)
3. Projections of Points, Lines & solids (4P)
4. Orthographic & isometric Projection (4P)
5. Constraints and assembly drawings (3P)
6. Introduction to Computer Aided Drawing: Basis commands for 2D drawing, Inserting Charts,
Drawing in 2D, Plotting and Layouts, Creating Complex 3D Surface. (4P)
7. Engineering animation including motion curves, coordinating multiple moving parts under
joint-constraints and the notion and impact of lighting and camera (4P)

2. Reference Books:
Bhatt N. D. Elementary Engineering Drawing, Charotar Publishing House.
A text book of Engineering Drawing by R.K.Dhawan, S.Chand & Company Ltd., New Delhi.
Gill P. S. Engineering Drawing & Engineering. Graphics, S. K. Kataria & Sons.
Lakshminarayan L.V. and Vaish R. S. Engineering Graphics, Jain Brothers.
Seidler, Douglas R. Digital Drawing for Designers: A Visual Guide to AutoCAD 2015. London:
Bloomsbury, 2014.
Gladfelter, Donnie. AutoCAD 2015 and AutoCAD LT 2015: Indianapolis: Autodesk Official
Press, 2014.
3. Practical Evaluation:
No less than 4 assignment based on drafting work and no less than 3 assignments and 1 case
study based on Computer Aided Drawing must be given on different topics.

47
Engineering Workshop

1. Course Details
The Workshop will cover some of the practices mentioned below. A revised syllabus will be
produced.

Machine shop
1. Demonstration of job on Lathe machine
2. Demonstration of job on Drilling machine
3. Study of different types of power tools

Fitting Shop
Hands on Practice and job making in Fitting shop
Welding shop
1. Hands on Practice and job making using Electric arc Welding / Resistance welding process
2. Hands on Practice and job making using Soldering process

Casting
Demonstration of Pattern Making by sand molding
Plastic molding & Glass Cutting

For Electrical
1. Measure voltage, current, frequency, phase difference, power, power factor for single and
three phase supply
2.Wire fan, tube light, two-way control (staircase wiring).
3. Wire MCB, ELCB for a given load circuit
4. Preparing the drawing for wiring a newly built room, without any electrical wiring along with
a bill of materials with specifications; the room may be a class-room, an office, a shop, a clinic, a
small workshop etc.
5. Identify and rectify open circuit, and short circuit faults in PCB/System
6. Solder and de-solder electronic components on different types of PCB
7. Identify various types of ports and connectors

For Electronics
1) Introduction to basic electronics components and its testing: Resistors, Inductors, Capacitor,
Diode, BJT
2) Introduction to testing and Measurement Instruments: Power Supply, Function Generator,
Oscilloscope

IOT
Arduino starter kits or raspberry pi
i.e. Arduino Starter kit mostly includes following:, Similarly for Raspberry pi use whatever
required
1. An Arduino or Raspberry
2. Jumper wires
3. Resistors

48
4. Breadboard
5. LEDs
6. Buttons

Case Studies/Demonstration
1. Arduino LED On/Off
2. Or Raspberry LED/On
3. Arduino alarm system which detects movement of an intruder with a high pitched alarm
sounds and flashing lights.
4. Arduino Trafiic Light Controller
5. raspberry pi on screen keyboard app.

Software Tools & OS Commands

Dream weaver Web development Tool
Student Has to build his own Web Site consisting of basic profile about his department,his
own personnel profile and basic Institute Details

OS (Windows,Linux,Unix,MacOS,Apple,Android)
To learn basic Windows and Linux/Ubuntu shell commands and have to develop simple shell
script.

Note: Journal is to be prepared covering the topics of demonstration and report about process /
methodology / inspection for making jobs.

MTL 501:Material Science (Introduction to Materials Science)

Credits: 4+2=6

1. Course Details

1.1 Course Description

The aim of the course is to give fundamental knowledge about type of materials and their
structure, which are important in engineering design. It is also aimed to give a theoretical and
practical background about the analysis of behavior of engineering materials by emphasizing
important relationships between internal structure and properties.

1.2. Learning Outcome

On successful completion of this course students will be able to understand the variety of
materials their structure and applications. Students will have knowledge of different types of
materials their advanced applications.

1.3. Course Organization

There will be 4 hour lecture per week, 4 hour lab each week or equivalent to 60 hours per
semester. However the lab work is carried out within the semester at the prudence of the unit
coordinator. Students are expected to attend all lectures and to participate in class discussions.

2. Teaching Resources

49
2.1 Reference Books

William D. Callister, Jr. Materials Science and Engineering: An Introduction, 5th or any other
upgrade edition, John Wiley and Sons, 2000
Askeland D.R.,& P. P. Fullay (2007), The Science and Engineering of Materials –4th Cengage
Learning Publishers 45
A.S. Edelstein and R.C. Cammarata Ed.(1998), Nano Materials: Synthesis, Properties and
Applications, Inst. Of Physics Publishing, UK
Raghavan V (2007), Materials Science and Engineering - A First Course, Prentice Hall, India
James F. Shackelford (1996), Introduction to Materials Science for Engineers, Prentice Hall,
India

3. Teaching Schedule

3.1 Introduction of Materials

3.1.1 Metallic Material

3.1.2 Ceramic Material Polymers
3.1.3 Nanomaterials
3.1.4 Biomaterials

3.2.1 Composite Materials

3.2.2 Rubber: Natural, Synthetic
3.2.3 Crystal Structure
3.2.4 Crystallography

3.3.1 Atomic structure

3.3.2 Structure of crystalline solids Lattices, unit cells Crystal systems
3.3.3 Crystal systems, Bravais lattices
3.3.4 Indexing of directions and planes

3.4 Ceramic and Polymeric Materials

3.4.1 Structure and properties of Ceramic
3.4.2 Silicate Ceramics, Carbon
3.4.3 Imperfections and phase diagram of ceramics
3.4.4 Structure and properties of Polymeric Materials

3.5.1 Glasses: Introduction and Properties

3.5.2 Glass- Ceramics, Clay Products
3.5.3 Refractories : Fireclay, Silica, Basic, Special
3.5.4 Application and Processing Methods: Abrasives, Cements, Advance Ceramics, Powder
Pressing, Tape Casting

3.6.1 Types of Polymerization

3.6.2 Addition, condensation and co-polymerization
3.6.3 Ageing vulcanization
3.6.4 Cross-linking and Branching

50
3.7 Composite Materials
3.7.1 Introduction and classification
3.7.2 Particle Reinforced Composite
3.7.3 Fibre Reinforced Composite
3.7.4 Influence of fibre length, orientation and concentration

3.8.1 Fibre phase, Matrix Phase

3.8.2 Metal Matrix Composite
3.8.3 Ceramic Matrix Composite
3.8.4 Polymer matrix composites

3.9.1 Carbon- Carbon Composite

3.9.2 Hybrid Composite
3.9.3 Processing of Fibre Reinforced Composites
3.9.4 Structural Composites: Laminar Composites, Sandwich Panel

3.10 Metallic Materials

3.10.1 Definition and basic concepts of Phases
3.10.2 Equilibrium and Phase diagrams
3.10.3 Binary Isomorphous Systems
3.10.4 Binary Eutectic Systems

3.11.1 Purely eutectic binary phase diagram

3.11.2 Partial eutectic binary phase diagram
3.11.3 The Gibbs Phase Rule
3.11.4Solid solution – Hume Rothery Rules

3.12 Corrosion and Degradation of Materials

3.12.1 Introduction to Surface degradation and Corrosion
3.12.2 Types of corrosion – Dry and Wet corrosion
3.12.3 Corrosion of Industrial Component
3.12.4 Purpose of Corrosion testing

3.13.1 Protecting Methods

3.13.2 Organic, Inorganic and Metallic Coating
3.13.3 Electro and Electroless plating and Anodizing
3.13.4 Cathodic Protection

3.14 Electrical & Electronic Materials

3.14.1 Introduction
3.14.2 Intrinsic and Extrinsic Semi conductivity
3.14.3 Dielectric material
3.14.4 Piezo-electric materials

3.15 Magnetic Materials

3.15.1 Introduction of magnetic materials
3.15.2 Classification of magnetic materials

51
3.15.3 Soft magnetic materials
3.15.4 Hard magnetic materials.

4. PRACTICAL:
Study of microscope and sample preparation.
Determination of hardness of standard steel specimen by Rockwell hardness testing.
Comparison of hardness of different materials using Brinell and Rockwell testing.
Study of Microstructure of various Non- ferrous alloys using metallurgical microscope.
Demonstration of Heat treatment of a metallic sample.
Study of effects of heat treatment on microstructure and hardness of a sample.

Learning outcomes: On successful completion of this course students will be able to understand
the variety of materials their structure and applications. Students will have knowledge of
different types of materials their advanced applications.

Suggested for: Students who want to do major in Physics, Chemistry, Computer Science and
Biosciences.

------------------------------------------------------------------------------------------------
MANAGEMENT SUBJECTS
------------------------------------------------------------------------------------------------

Management I (Business and Organizational Management)

1. Course Details
1.1 Course Description
This course aims to expose the student to the basic principles in business organization and to
illustrate with its applications. The objective of this course is to give an overview of business
management and its related area.

1.2 Course organization

There will be 4-hours lectures per week. Please note that some of the tutorial/discussion sessions
may be converted to lectures if need be. Students are expected to attend all lectures and to
participate in class discussions.

2. Reference Books

2.1 Course Textbook

Marketing Management – Philip Kotler , Prentice Hall India , (New edition)
Strategy and Structure – Alfred C .Chandler
Strategic Management – Alex Miller and Irwin
Human Behaviour at Work – Keith Davis ; Organizational Design for Excellence – Khandawalla

3. Teaching Schedule
3.1 An introduction to Management
3.1.1 Introduction
3.1.2 Functions of Management

52
3.1.3 Scope of Management
3.1.4 Process of Planning, Organizing, Staffing and Controlling
3.1.5 Basic Forms of Business Ownership

3.2 Organizational Behavior and Change Management

3.2.1 Introduction
3.2.2 Types of Organization Structure
3.2.3 Understanding Organizational behavior and Culture
3.2.4 Basic Theories of Leadership
3.2.5 Theories of Motivation

3.3 Human Resource Management

3.3.1 Definitions
3.3.2 Human Resource Planning (HRP)
3.3.3 Job Analysis, Job Evaluation, Job Description, Job Specification
3.3.4 Process of Recruitment and Selection
3.4 Strategic Management
3.4.1 Introduction
3.4.2 Strategy vs. structure
3.4.3 Elements of business strategy
3.4.4 Strategic management Process
3.4.5 Issues in Corporate governance
3.4.6 Business Ethics and Corporate Social Responsibility (CSR)

3.5 Business Environment Analysis

3.5.1 Strategically relevant components of Internal and external environment
3.5.2 Industry and competitive analysis
3.5.3 Analysis of resource and competitive capabilities
3.5.4 Michael Porter’s 5 forces model

3.6 Principles of Finance

3.6.1 Introduction to financial management
3.6.2 Accounting terminologies
3.6.2 Overview of final accounts (P&L a/c, Income and Expenses a/c, Balance Sheet)
3.6.3 Financial Ratio’s for managerial decision making
3.6.4 Cash flow statement

3.7 Consumer Behaviour

3.7.1 Introduction
3.7.2 Types and classification of product and services
3.7.3 Product Life Cycle (PLC)
3.7.4 Consumer and Buyers Behaviour Process
3.7.5 Marketing mix

3.8 Business and Organization Management Overview and Revision

3.8.1 Class overview and revision
3.8.2 Final revision and careers

53
This course has a final examination, and two internal tests. The first internal test covers first half
of the course material. The second internal test will focus on the second half of course material.
An internal assessment (assignment) is 1000 words essay on selected topics related to Indian
environment. A list of topics will be suggested by the course instructor. In the text, citations
should be used to refer to supporting material (e.g., Miller and Spoolman, 2013). A full
bibliography of cited material should be included in the paper.

Management II (Entrepreneurship and Business Development)

1. Course Detail

1.1 Course Description

This course aims to expose the student to the fundamentals of Entrepreneurship and Business
Development and to illustrate with its applications. The objective of this course is to give an
overview of Entrepreneurship, IPR, raising and acquiring funds for the business.

1.2 Course organization

There will be 4-hours lectures per week. Please note that some of the tutorial/discussion sessions
may be converted to lectures if need be. Students are expected to attend all lectures and to
participate in class discussions.

2. Reference Books
2.1 Course Textbook
Entrepreneurship– Prof .T .V .R a o
Entrepreneurship- Mathew J Mani mala
Business Law for Managers- P. K. Goel, Wiley
Business Law for Management – K.R.Bulchandani

3. Teaching Schedule
3.1 Foundation of Entrepreneurship
3.1.1 Meaning, Concept and Nature of Entrepreneurship
3.1.2 Social and Cultural factors in nurturing entrepreneurship
3.1.3 Institutional Support for promoting entrepreneurship in India
3.1.4 Entrepreneurial decision process
3.1.4 Skills required being entrepreneur
3.1.5 Case study of incubation

3.2 Business Planning

3.2.1 Meaning and Significance of business plan
3.2.2 Idea generation for business plan
3.2.3 Component of Business Plan
3.2.4 Feasibility Study
3.2.5 Exercises in preparation of business plan

3.3 Venture Capital

3.3.1 Value and importance of venture financing
3.3.2 Stages of Venture development and financing
3.3.3 Venture Capital Firms

54
3.3.4 Venture Capital Strategies

3.4 Launching of new venture

3.4.1 Choosing Legal form of new venture
3.4.2 Protection of IPR (Intellectual Property Rights)
3.4.3 Marketing the new venture

3.5 Capital Budgeting

3.5.1 Introduction and Objectives
3.5.2 The Investment Issues
3.5.3 Capital Investment and Firm Value
3.5.4 Stages in Capital Budgeting Process
3.5.5 Importance of Capital Investment Decisions
3.5.6 Types of Investment Decision

3.6 Intellectual Property Rights

3.6.1 Introduction
3.6.2 An overview of Patent and Trade Marks Act
3.6.2 Copyright Act
3.6.3 Geographical Appellation

3.7 Entrepreneurship and Business Development Overview and Revision

3.7.1 Class overview and revision
3.7.2 Final revision and careers

This course has a final examination, and two internal tests. The first internal test covers first half
of the course material. The second internal test will focus on the second half of course material.
An internal assessment (assignment) is 1000 words essay on selected topics related to Indian
environment. A list of topics will be suggested by the course instructor. In the text, citations
should be used to refer to supporting material (e.g., Miller and Spoolman, 2013). A full
bibliography of cited material should be included in the paper.

Note: A minimum passing marks is Grade Point 4 as per UGC CBCS guideline.

55
PART – III: CORE SUBJECT

56
DATA STRUCTURES AND ALGORITHMS

1.1 Course Description

An algorithm is an outline of the steps that a program or any computational procedure has to
take. A program on the other hand is an implementation of an algorithm and it could be in any
programming language. Data structure is the way we need to organize the data, so that it can be
used effectively by the program.In short it is a way of collecting and organizing data in such a
way that we can perform operations on these data in an effective way. It is also about rendering
data elements in terms of some relationship, for better organization and storage.

1.2 Learning Targets/Outcomes

1. To impart the basic concepts of data structures and algorithms.

2. To understand concepts about searching and sorting techniques
3. To understand basic concepts about stacks, queues, lists, trees and graphs.
4. To enable them to write algorithms for solving problems with the help of
fundamental data structures

1.3 Course Organization

There will be 3-hours lecture and 2 hours Laboratory session each week. Students are expected
to attend all lectures,practicals and to participate in class actively.

2. Books:
1. Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by Mark
Allen Weiss, Addison-Wesley Publishing Company
2. “How to Solve it by Computer”, 2nd Impression by R.G. Dromey, Pearson Education.
3. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, SartajSahni,
Computer Science Press.

3. Teaching Schedule

3.1 INTRODUCTION TO DATA STRUCTURE

Basic Terminology, Internal representation of Primitive Data structure: Integers, Floating
point numbers,Decimal, Characters, Unions,Structures and Pointers.

3.2 DATA TYPES Arrays

Definition, Memory organization, Various Operations on Arrays: Insertion, Deletion,

Traversing ,Updating, Resizing

3.3 Stacks

57
Basic operations, Stack, Dstack and its applications
3.4 Queues

Operations of queues, Circular Queue, Priority Queue, Dequeue, Applications of queues

data structure.

3.5Linked list

Singly linked lists and its memory representation, Operations of Link list (Searching, Insertion,
Deletion, Traversing, inversion, concatenation, copying and comparison, allocation and
deallocation), Doubly linked list and its operations, Circular Link list and Multilevel link list

3.6 TREES

Introduction, Binary Trees and their representation, Operations on Binary trees: Creation,
transformation of trees into binary trees, traversal, Searching, Insertion and Deletion. Type of
trees: Complete Binary trees, Extended binary trees, General trees, AVL trees, Threaded trees, B
trees Application: Arithmetic expression evaluation, infix-prefix-postfix notation conversion.

3.7 GRAPH

Formal Introduction, types of graph, Representation of graphs: Sequential, List structure,

Adjacency list, multilinked representation, Search in directed and undirected graphs, BFS, DFS,
Transversal Connected Component and Spanning trees,
Shortest path and Transitive Closure, Activity Networks, Topological Sort and Critical Paths.

3.8 ALGORITHMS

Sorting (Bubble, Selection, Quick, Radix, Bucket sort, Heap sort), Dictionaries,
hashing, analysis of collision resolution techniques, Searching-Linear & Binary,
Character String and different string operations .

4.Plagiarism

This course has a one mid semester internal examination and one semester end examination. The
continuous evaluation process will be conducted for practical, assignments. The examination
and evaluation component has been described below.

58
Object-Oriented Programming

1.1 Course Description

This course gives the the basic principles of object-oriented programming, design
1.2 Learning Targets/Outcomes
The Student will able to
 To understand the basic components of an object-oriented program including methods
and attributes,
 The distinction between classes and instances
 The relevance of the design process and basic object-oriented design notation,.

Course Organization
There will be 4-hours lectures per week and 4-hours lab/project section each week. Please note
that some of the tutorial/discussion sessions may be converted to lectures if need be. Students are
expected to attend all lectures and to participate in class discussions.

2.1Text Books
1.Object Oriented programming with C++ by E. Balagurusamy, TMH

2.2 ReferenceBooks:
1. Complete Reference C++ by Herbert Schildt McGraw Hill Publications
2. Object Oriented programming in C++ by Robert Lafore, Pearson Education

3. Course Content

3.1. Introduction of Classes and Objects

3.1.1Keywords, Data Types,
3.1.2The Operators,The Conditional structures
3.1.3 Looping Constructs,
3.1.4 The Difference between class and struct ,

3.2.1The difference between class and Union

3.2.1 Static Data members of a class
3.2.3 Static Data members of a class
3.2.4The local classes.

3.3. Functions
3.3.1 Introduction to function
3.3.2The inline function
3.3.3 Default Arguments of the function
3.3.4Functions with object as Object as parameters to function

3.4.1 Call by reference

3.4.2Function Overloading,

59
3.4.3Friend functions,Static functions
3.4.4 Private and Public functions.

3.5 Constructors and Destructors

3.5.1 Constructors Introduction
3.5.2Type of constructors,Constructors with default arguments
3.5.3 Dynamic Initialization
3.5.4 Constructor with dynamic allocation,Destructors.
3.6 Overloading of Operator
3.6.1Introduction, Unary Operators
3.6.2 Binary Operators,
3.6.3Using Friends as operator functions
3.6.4 Overloading other Operators, The need for user defined conversion, user defined
conversions

3.7. Templates
Function Templates
Non Generic (Non Type) Parameters in Template functions
Template function and specialization
Overloading a template function

3.8.1 Using Default Arguments, Class Templates

3.8.2 Classes with multiple generic data types, Static data members,
3.8.3Primary and Partial Specialization, The Export Keyword,
3.8.4The other use of typename

3.9. Inheritance
3.9.1The need of Inheritance, Writing derived class using one base class
3.9.2 Public, private and protected access modifiers,
3.9.3 The Access Control, The Access Declaration, The multiple-inheritance
3.9.4 Abstract classes, Composite objects (container objects)

3.10.Polymorphism
3.10.1Compile Time and Runtime Polymorphism, Pointers to Objects,
3.10.2This pointer,Derived and base class pointers, The subobject concept, Virtual functions,
Static invocation of virtual function,
3.10.3Default arguments to virtual functions,
3.10.4 Virtual destructors, Pure virtual functions, Run Time Type Identification

3.11 Exception Handling

3.11.1Introduction Exception Handling and its Need , Components of exception handling
mechanism,
3.11.2Rethrowing an exception,
3.11.3Terminate and Unexpected functions,
3.11.4Drawbacks of exception handling ,the exception Class.

3.12 IO Streams
3.12.1 Basics of streams, Comparisionof C++ I/O and C IO

60
3.12.2 The C++ Predefined streams,
3.12.3Formatting IO, Formatting using ios members
3.12.4 Manipulators, Creating our own manipulator
3.13 Files and IO
3.13.1Introduction of IO,Binary and Text streams
3.13.2 Opening and closing files, Text files Binary files
3.13.3 Random Access using seek,
3.13.4File Modes, Error Handling .

3.14. The Standard Template Library

3.14.1Introduction of STL (Standard Template Library)
3.14.2Generic Algorithms, Generic Software
3.14.3Components,GenericProgramming,Iterators
3.14.4Containers, Algorithms

3.15 Namespaces
3.15.1Introduction
3.15.2Using syntax, Defining namespaces, Extending the namespace
3.15.3Unnamed namespaces, Nested Namespaces, Namespace aliases,
3.15.4The std namespace, The Koenig lookup, Overhead with namespaces )

4. Plagiarism
The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

Discrete Mathematics

1.1 Course Description

This course is developed keeping in mind the basics of computer science and the fundamental in
the development of digital electronics. Set, relations functions, logics are the base for all modern
programming languages. Algebraic Systems, Lattice are the parts of Boolean algebra, which
plays important role for in all modern programming languages. In mathematics and computer
science, graph theory is the study of graphs, which are mathematical structures used to model
pair wise relations between objects. Graphs are one of the prime objects of study in discrete
mathematics and used to model many types of relations and processes in physical, biological,
social and information systems. Many practical problems can be represented by graphs.

1.2 Learning Targets/Outcomes

The key objectives of this course are:
 To introduce the techniques, algorithms and reasoning process involved in the study of
discrete mathematical structures.
 To understand the basic concepts of number theory and Boolean algebra.
 To develop understanding of graphs and their applications.

1.3 Course organization

61
There will be 4-hours lecture per week and 2-hours tutorial/discussion/presentation each week.
Please note that some of the tutorial/discussion sessions may be converted to lectures if need be.
Students are expected to attend all lectures and to participate in class discussions.

2.1 Course Instructor:

2.2 Textbook
 Lipschutz, S., Lipson, M., Schaum's Outline of Discrete Mathematics (Schaum's) 2nd
Edition, McGraw-Hill; 2 edition
 Richard J. Trudeau, Introduction to Graph Theory, Dover Publications; 2nd edition

Reference book
 Kreysizg, E., Advanced Engineering Mathematics, 8th Edition, John Wiley & Sons, Inc.,
2010.
 Rosen, Kenneth H, “Discrete Mathematics and Its Applications”, Tata Mc-Graw Hill,
New Delhi, 2007
 Liu, C. L., Elements of Discrete Mathematics, 2nd Ed. Tata McGraw-Hill, 1985
 Deo, N., Graph Theory, Prentice Hall 1980
 Kolman B., Busby R. C. And Ross S., Discrete Mathematical Structures, Prentice Hall,
1996

3.1 Discrete mathematics:

Unit I
Sets Theory and Mathematical Logic: Basic Definitions, Set operations, Finite and Infinite
Sets, Uncountable Infinite Sets, Principle of Inclusion and Exclusion, Propositionsand
Computability, Propositions and Related Concepts, Rules of Inferential Logic, Methods of
Proof, mathematical induction
Unit II
Relations and Functions: Relations and their properties, n-array relations and their
applications, representing relations, closure of relations, equivalence of relations, partial
ordering relation and lattice. Types of functions
Counting: The basics of counting, the pigeonhole principle, permutations and combination,
Discrete Probability Theory
Unit III
Graphs and Trees: Basic Terminology, Multi graphs and Weighted Graphs, Paths and
Circuits Shortest Paths in Weighted Graphs, Euclidian Paths and Circuits, Hamiltonian
Paths and Circuits, The Traveling Salesperson Problem, Factors of a Graph, Planar Graphs,
Trees, Rooted Trees, Path Lengths in Rooted Trees, Prefix Codes, Binary Search Trees,
Spanning Trees and Cut-Sets, Minimum Spanning Trees
Unit IV
Analysis of Algorithms Time Complexity of Algorithms: A Shortest-Path Algorithms,
Complexity of Problems, Tractable and Intractable Problems, Numeric Functions,
Asymptotic Behavior of Numeric Functions.
Unit V
Recurrence Relations and Recursive Algorithms: Recurrence Relations, Linear Recurrence
Relations with Constant Coefficients, Homogeneous Solutions, Particular Solutions, Total
Solutions.

62
Fundamental of Electronics

UNIT–I SEMICONDUCTOR DEVICES:

Diode applications: Half-wave rectifier, Full-wave rectifier (with and without filter), Clipper and
Clamper, Voltage multiplier and SMPS. Special purpose diodes and their applications: Working
principle and application of Zener diode, Varactor diode, LED, PIN diode and Laser diode.
Digital display devices: 7 segment display and LCD.

UNIT–II TRANSISTOR AND ITS APPLICATIONS

Physical structure and operation modes, active region of operation of transistor, DC analysis of
transistor circuits, biasing of BJT, construction and characteristics of FET, and MOSFET, CMOS
application.

UNIT–III OPTOELECTRONIC DEVICES

Overview of photonics, difference optoelectronic devices.

UNIT IV: OPERATIONAL AMPLIFIER

Fundamentals of operational amplifier, ideal op-amp, Feedback configurations of operational
amplifiers, Op-amp parameters, practical op-amp circuits: inverting and non-inverting etc.

TEXT BOOKS:
A Textbook of Electronic Circuits by Dr. R. S. Sedha.
Robert Boylestad, Electronic devices and circuit theory, Pearson Education.
M. Morris Mano, Digital Logic and Computer design, PHI publication.

REFERENCE BOOKS
1. Electronic Devices and Circuits by S.Salivahanan, N.Suresh Kumar and A.Vallavaraj.
2. Integrated Electronics by Millman and Halkias.
3. A.S. Sedra and K.C. Smith, “Microelectronic Circuits”, 6th Edition, Oxford University Press,
2006
4. Norman Balabanian and Bradley Carlson, Digital Logic Design Principles, Wiley Student
Edition.

63
COMPUTER SYSTEM ARCHITECTURE
1.1 Course Description
The course provide students with a fundamental understanding of the functional components of a
computer system, and how they are organized. The emphasis of the module is on the hardware
aspects of a system, and how hardware is used during the execution of software. This is a core
component of all computer science related degree courses. Practical skills will also be developed
in the use and construction of computer components, and their interfacing to microprocessors.
1.2 Learning Targets/Outcomes
By learning this course Student will able to
• Draw the functional block diagram of a single bus architecture of a computer and
describe the function of the instruction execution cycle, RTL interpretation of
instructions, addressing modes, instruction set.
• Write assembly language program for specified microprocessor for computing
16 bit multiplication, division and I/O device interface (ADC, Control circuit, serial port
communication).
• Write a flowchart for Concurrent access to memory and cache coherency in Parallel
Processors and describe the process.
• Given a CPU organization and instruction, design a memory module and analyze its
operation by interfacing with the CPU.
• Given a CPU organization, assess its performance, and apply design techniques to
enhance performance using pipelining, parallelism and RISC methodology

1.3 Course Organization

There will be 3-hours lecture and 2 hours Laboratory session each week. Students are expected
to attend all lectures and to participate in class actively.

2.1 Text Book

1. “Computer Organization and Design: The Hardware/Software Interface”, 5th Edition by
David A. Patterson and John L. Hennessy, Elsevier.
2. M. Mano, Computer System Architecture, Pearson Education

2.2 Reference Text Books

1 A. J. Dos Reis, Assembly Language and Computer Architecture using C++ and JAVA,
Course Technology, 2004

2 W. Stallings, Computer Organization and Architecture Designing for Performance, 8th

Edition, Prentice Hall of India ,2009

64
 3“Computer Architecture and Organization”, 3rd Edition by John P. Hayes, WCB/McGraw-
Hill
4 Fundamentals of Digital Circuits (3rd Ed). A. Anand Kumar. (2014). PHI Learning
Private Limited, Delhi

3. Course Content
3.1 Introduction
3. 1.1 Logic gates
3. 1.2 Boolean algebra
3. 1.3 Combinational circuits,Circuit simplification

3.2 Introduction
3.2.1 Flip-flops
3.2.2 Sequential circuits
3.2.3 Decoders,Multiplexers

3.3 Introduction
3.3.1 Registers
3.3.2 Counters
3.3.3 Memory

3.4 Data Representation and basic Computer Arithmetic

3.4.1 Number systems,Complements
3.4.2 fixed and floating point representation
3.4.3 character representation

3.5 Data Representation and Basic Computer Arithmetic

3.5.1 Addition
3.5.2 Subtraction
3.5.3 Magnitude comparison

3.6 Basic Computer Organization and Design

3.6.1 Computer Registers
3.6.2 Bus system
3.6.3 Instruction Set

3.7 Basic Computer Organization and Design

3.7.1 Timing and control
3.7.2 Instruction cycle
3.7.3 Memory Reference,Input-output and Interrupt

3.8 Central Processing Unit

3.8.1 Register organization
3.8.2 Arithmetic and Logical Micro-operations
3.8.3 Stack Organization,Micro programmed control

65
3.9 Programming the Basic Computer
3.9.1 Instruction formats,Addressing modes
3.9.2 Instruction codes, Machine language
3.9.3 Assembly language and Input output programming
3.10 Input-output Organization
3.10.1 Peripheral devices
3.10.2 I/O interface
3.10.3 File System Structure:Modes of data transfer

3.11 Pipelining:
3.11.1 Basic concepts of pipelining, throughput and speedup
3.11.2 Pipeline hazards.
3.11.3 Parallel Processors: Introduction to parallel processors, Concurrent access to memory and
cache coherency.

3.12 Memory organization:

3.12.1 Memory interleaving, concept of hierarchical memory organization, cache memory, cache
size vs. block size
3.12.2 Mapping functions, replacement algorithms, write policies.
3.12.3 Overview of I/O Systems:Direct memory access

66
Computer System Architecture Lab
A list of potential Laboratory Practical’s
1. To design a combinational logic system for a specified Truth Table and design it using
logic gate ICs.

2. Implement Half Adder and Full Adder using logic gate ICs.

3. Implement Half Subtractor and Full Subtractorusing logic gate ICs.

4. To build JK Master-slave flip-flop using Flip-Flop ICs

5. To build a Counter using D-type/JK Flip-Flop ICs and study timing diagram

6. Write a program in assembly language to add two 8-bit numbers

7. Write a program in assembly language to perform multiplication for unsigned positive

numbers

8. Write a program in assembly language to print input string and print it.

9. Simulate the machine to determine the contents of AC, E, PC, AR and IR registers in
hexadecimal after the execution of each of following register reference instructions:
a. CLA e. CIR i. SNA
b. CLE f. CIL j. SZA
c. CMA g. INC k. SZE
d. CME h. SPA l. HLT

10. Simulate the machine for the following memory-reference instructions with I= 0 and
address part = 082. The instruction to be stored at address 022 in RAM. Initialize the
memory word at address 082 with the operand B8F2 and AC with A937. Determine
the contents of AC, DR, PC, AR and IR in hexadecimal after the execution.

a. ADD f. BSA
b. AND g. ISZ
c. LDA
d. STA
e. BUN

67
DATABASE MANAGEMENT SYSTEM

1.1Course Description
Provides fundamental knowledge of, and practical experience with, database concepts.Includes study of
information concepts and the realization of those concepts using the relational data model. Practical
experience gained designing and constructing data models and using SQL to interface to both multi-user
DBMS packages and to desktop DBMS packages.

1.2 Learning Targets/Outcomes

Upon successful completion of the course, the student will be able to:
 Differentiate database systems from file systems by enumerating the features provided by
database systems and describe each in both function and benefit.
 Define the terminology, features, classifications, and characteristics embodied in database
systems.
 Analyze an information storage problem and derive an information model expressed in the
form of an entity relation diagram and other optional analysis forms, such as a data
dictionary.
 Demonstrate an understanding of the relational data model.
 Transform an information model into a relational database schema and to use a data
definition language and/or utilities to implement the schema using a DBMS.

1.3 Course Organization

There will be 3-hours lecture per week, 1-hours tutorial/discussion and 2 hours Laboratory
session each week. Please note that some of the tutorial/discussion sessions may be converted to
lectures if need be. Students are expected to attend all lectures and to participate in class
discussions.

2.1 Text Book

th
 Silberschatz, H.F. Korth, S. Sudarshan, Database System Concepts 6 Edition, McGraw
th
 Hill, 2010.R. Elmasri, S.B. Navathe, Fundamentals of Database Systems 6 Edition, Pearson
Education, 2010.

1.3 Reference Books

rd
 R. Ramakrishanan, J. Gehrke, Database Management Systems 3 Edition, McGraw-Hill, 2002.
 R. Elmasri, S.B. Navathe Database Systems Models, Languages, Design and application
th
Programming, 6 Edition, Pearson Education,2013.

3. Course content
3.1 Introduction
3.1.1 Database-system Application, Purpose of Database System, View of Data
3.1.2 Database Languages, Relational Database, Database Design, Data Storage and Query
3.1.3 Database Users and Administrator, History of Database Systems

68
3.2 Introduction to the Relational Model
3.2.1 Structure of Relational Databases, Database Schema, Keys
3.2.2 Schema Diagrams
3.2.3 Relational Query Languages, Relational Operations

3.3 Overview of the SQL Query Language

3.3.1 SQL Data Definition, Basic Structure of SQL Queries
3.3.2 Additional Basic Operations, Set Operations
3.3.3 Aggregate Functions, Nested Sub queries

3.4 Intermediate SQL

3.4.1 Join Expressions, Views
3.4.2 Transactions, Integrity Constraints
3.4.3 SQL Data Types and Schemas, Authorization

3.5 Advanced SQL

3.5.1Accessing SQL from a Programming Language
3.5.2 Functions and Procedures - I
3.5.3 Functions and Procedures -II

3.6 Advance SQL-II

3.6.1 Functions and Procedures - III
3.6.2 Triggers
3.6.3 Advanced Aggregation Features

3.7 Database Design and the E-R Model

3.7.1 Overview of the Design Process
3.7.2 The Entity-Relationship Model, Constraint, Removing Redundant Attributes inEntity Sets
3.7.3 Entity-Relationship Diagrams, Entity-Relationship Design Issues

3.8 E-R Model and E-R Diagram

3.8.1 Extended E-R Features
3.8.2 Alternative Notations for Modeling Data.
3.8.3 Other Aspects of Database Design

3.9 Relational Database Design

3.9.1 Features of Good Relational Designs
3.9.2 Atomic Domains and First Normal Form
3.9.3 Decomposition Using Functional Dependencies

3.10 Relational Database Design - II

3.10.1 Functional-Dependency Theory
3.10.2 Algorithms for Decomposition
3.10.3 Decomposition using multivalued Dependencies

3.11 Relational Database Design - III

3.11.1 Third Normal Form, Fourth Normal Form
3.11.2 Fifth Normal Form, BCNF
3.11.3 Database-Design Process

69
3.12 Transactions-I
3.12.1 Transaction Concept
3.12.2 A Simple Transaction Model
3.12.3 Transaction Atomicity and Durability

3.13 Transactions-II
3.13.1 Transaction Isolation
3.13.2 Serializability, Transaction Isolation and Atomicity
3.13.3 Validation-Based Protocols, Snapshot Isolation

3.14 Concurrency Control

3.14.1 Lock-Based Protocols
3.14.2 Deadlock Handling
3.14.3 Multiple Granularities, Timestamp-Based Protocols

3.15 Recovery System

3.15.1 Failure Classification
3.15.2 Recovery and Atomicity, Recovery Algorithm
3.15.3 Buffer Management

4. Plagiarism
The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

70
PROGRAMMING IN JAVA

1.2 Course Description

The aim of the course is to give a thorough grounding in object-oriented techniques for Java, as
well as to examine the major uses of Java – internet programming, design pattern, user interfaces
and Networking.

1.3 Learning Targets/Outcomes

The Student will able to
 Understand and apply the object oriented concept like Classes and Objects, encapsulation,
Inheritance, Polymorphisms
 Understand the importance of modelling and modelling languages.
 Understand and derive the design pattern.
 Demonstrate java object models
 Handle the exception cases, understand the I/O operations

1.3 Course Organization

There will be 3-hours lecture per week, 1-hours tutorial/discussion and 2 hours Laboratory
session each week. Please note that some of the tutorial/discussion sessions may be converted to
lectures if need be. Students are expected to attend all lectures and to participate in class
discussions.

2.1 Text Books

 Programming with JAVA - E Balagurusamy Latest Edition(TATA McGraw-HILL)
 Complete Reference JAVA – Herbert Schildt Latest Edition(TATA McGraw-HILL)

2.2 Reference Books

 Programming in Java 2 – K SomsundramJaico Publishing House, Latest Edition

3. Course Content
3.1 Introduction to Java and Object Oriented Programming Concept
3.1.1 Features of Java
3.1.2 JDK Environment
3.1.3 Overview of Programming
3.1.4 Paradigm

3.2 Object Oriented Programming Concept

3.2.1 Classes
3.2.2 Abstraction
3.2.3 Encapsulation, Inheritance
3.2.4 Polymorphism, Difference between C++ and JAVA

3.3 Java Programming Fundamental

3.3.1 Structure of java program
3.3.2 Data types, Variables
3.3.3 Operators, Keywords, Naming Convention
3.3.4. Decision Making (if, switch),Looping(for, while) ,Type Casting

71
3.4 Classes and Objects
3.4.1 Creating Classes and objects
3.4.2 Memory allocation for objects
3.4.3 Constructor
3.4.4 Implementation of Inheritance

3.5 Classes and Objects

3.5.1 Implementation of Polymorphism
3.5.2 Method Overloading,
3.5.3 Method Overriding
3.5.4 Nested and Inner classes

3.6 Arrays and Strings

3.6.1 Arrays
3.6.2 Creating an array
3.6.3 Types of Arrays
3.7.4 String class Methods, StringBuffer methods.

3.7 Abstract Class,

3.7.1 Modifiers and Access Control
3.7.2 Modifiers and Access Control..continue
3.7.3 Abstract classes
3.7.4 Abstract method

3.8 Interface and Packages

3.8.1 Interfaces
3.8.2 Packages Concept
3.8.3 Packages Concept..continue
3.8.4 Creating user defined packages

3.9 Exception Handling

3.9.1 Exception types
3.9.2 Exception types..continue
3.9.3 Using try catch and multiple catch
3.9.4 Using try catch..continue

3.10 Exception Handling

3.10.1 Nested try, throw
3.10.2 Throws
3.10.3 Finally
3.10.4 Creating User defined Exceptions

3.11 File Handling

3.11.1 Byte Stream
3.11.2 Byte Stream..continue
3.11.3 Character Stream
3.11.4 Character Stream..continue

72
3.12 File Handling
3.12.1 File IO Basics
3.12.2 File IO Basics..continue
3.12.3 File Operations
3.12.4 File Operations..continue

3.13 11 File Handling

3.13.1 Creating file
3.13.2 Reading file
3.13.3 2 Reading file
3.13.4 Writing File

3.14 Applet Programming

3.14.1 Introduction
3.14.2 Types Applet
3.14.3 Applet Life cycle
3.14.4 Applet Life cycle..continue

3.15 Applet Programming

3.15.1 Creating Applet
3.15.2 Creating Applet
3.15.3 Applet tag
3.15.4 Applet tag

4.Plagiarism
The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

73
PROBLEM SOLVING USING COMPUTERS(Python Programming)

1.1 Course Description

Provides fundamental knowledge of, and practical experience of the python.Subject also provides the
various techniques of solving various computer problem.

1.2 Learning Targets/Outcomes

Upon successful completion of the course, the student will be able to:
 Analyze a specific problem situation requiring the development of a computer application
 Implement a computer application using wisely the elements of the python language;
 Can Make an application of reduced scale, but correct, modular, readable, and well
documented ;
1.3 Course Organization
There will be 4-hours lecture per week, 2 hours Laboratory session each week. Please note that
some of the tutorial/discussion sessions may be converted to lectures if need be. Students are
expected to attend all lectures and to participate in class discussions.

2.1 Text Book

1. P. K. Sinha&PritiSinha , “Computer Fundamentals”, BPB Publications, 2007.
2. T. Budd, Exploring Python, TMH, 1st Ed, 2011

2.2 Reference Book

 Dr. Anita Goel, Computer Fundamentals, Pearson Education, 2010.
 Python Tutorial/Documentation www.python.org2010
 Allen Downey, Jeffrey Elkner, Chris Meyers , How to think like a computer scientist

3. Teaching Schedule
3.1 Computer Fundamentals
3.1.1 Introduction to Computers:
3.1.2 Characteristics of Computers,
3.1.3 Uses of computers,
3.1.4 Types and generations of Computers.

3.2 Basic Computer Organization

3.2.1Units of a computer, CPU
3.2.2 ALU, memory hierarchy
3.2.3 Registers
3.2.4 I/O devices
3.3 Planning the Computer Program
3.3.1 Concept of problem solving
3.3.2 Problem definition, Program design,
3.3.3 Debugging,

74
3.3.4 Types of errors in programming, Documentation

3.4 Techniques of Problem Solving

3.4.1Flowcharting, decision table,
3.4.2 Algorithms,
3.4.3 Structured programming concepts,
3.4.4 Programming methodologies viz. top-down and bottom-up programming.

3.5Overview of Programming
3.5.1 Structure of a Python Program
3.5.2 Elements of Python
3.5.3 Introduction to Python:
3.5.3 Python Interpreter

3.6 Introduction to Python

3.6.1Using Python as calculator
3.6.2Python shell,
3.6.3Indentation.
3.6.4Atoms

3.7 Introduction to Python

3.7.1Identifiers and keywords
3.7.2Identifiers and keywords ….contd
3.7.3Literals, Strings ….contd

3.8 Introduction to Python

3.8.1 Operators-Arithmetic operator, Relational
3.8.2 Logical or Boolean operator, Assignment Operator, Ternary operator,
3.8.3 Bit wise operator, Increment or Decrement operator
3.9 Creating Python Programs
3.9.1 Input and Output Statements
3.9.2 Input and Output Statements…Continue
3.9.3 Control statements (Looping-whileLoop)
3.9.4 Control statements (Looping-whileLoop)-Contimue

3.10 Creating Python Programs

3.10.1 For Loop
3.10.2 Loop Control Conditional Statement- if...else,
3.10.3 Difference between break,
3.10.4 Continue and pass

3.11 Structures
3.11.1 Numbers, Strings, Lists
3.11.2 Numbers, Strings, Lists…Continue
3.11.3 Tuples,
3.11.4 Dictionary,

75
3.12 Structures
3.12.1 Date & Time,
3.12.2 Date & Time…Continue
3.12.3 Modules
3.12.4 Modules---Continue

3.13 Structures
3.13.1 Defining Functions
3.13.2Defining Functions..Continue
3.13.3 Exit function
3.13.4Ddefault arguments.

3.14 Introduction to Advanced Python

3.14.1 Objects and Classes
3.14.2 Objects and Classes
3.14.3 Inheritance,
3.14.4 Inheritance --Continue

3.15 Introduction to Advanced Python

3.15.1 Regular Expressions
3.15.2 Event Driven Programming,
3.15.3 GUI Programming
3.15.4 GUI Programming..continue

4.Plagiarism
The University intends to develop and promote original work. Taking another person's words or
ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

Software Lab using Python:

Section: A ( Simple programs)
1. Write a menu driven program to convert the given temperature from Fahrenheit to
Celsius and vice versa depending upon user’s choice.
2. WAP to calculate total marks, percentage and grade of a student. Marks obtained in each
of the three subjects are to be input by the user. Assign grades according to the following
criteria :
Grade A: Percentage >=80
Grade B: Percentage>=70 and <80
Grade C: Percentage>=60 and <70
Grade D: Percentage>=40 and <60
Grade E: Percentage<40
3. Write a menu-driven program, using user-defined functions to find the area of
rectangle, square, circle and triangle by accepting suitable input parameters from
user.
4. WAP to display the first n terms of Fibonacci series.

76
 5. WAP to find factorial of the given number.
6. WAP to find sum of the following series for n terms: 1 – 2/2! + 3/3! - - - - - n/n!
7. WAP to calculate the sum and product of two compatible matrices.
Section: B (Visual Python):
All the programs should be written using user defined functions, wherever possible.
1. Write a menu-driven program to create mathematical 3D objects
I. curve
II. sphere
III. cone
IV. arrow
V. ring
VI. Cylinder.
2. WAP to read n integers and display them as a histogram.
3. WAP to display sine, cosine, polynomial and exponential curves.
4. WAP to plot a graph of people with pulse rate p vs. height h. The values of p and h are to
be entered by the user.
5. WAP to calculate the mass m in a chemical reaction. The mass m (in gms) disintegrates
according to the formula m=60/(t+2), where t is the time in hours. Sketch a graph for t vs.
m, where t>=0.
6. A population of 1000 bacteria is introduced into a nutrient medium. The population p
grows as follows:
P(t) = (15000(1+t))/(15+ e)
where the time t is measured in hours. WAP to determine the size of the population at
given time t and plot a graph for P vs t for the specified time interval.
7. Input initial velocity and acceleration, and plot the following graphs depicting equations
of motion:
I. velocitywrt time (v=u+at)
II. distancewrt time ( s=u*t+0.5*a*t*t)
III. distancewrt velocity ( s=(v*v-u*u)/2*a )

Network Analysis and Analog Electronics

1.1 COURSE DESCRIPTION
The aim of the course is to enable the students to acquire knowledge about the basics of circuit
analysis, network theorems, and semiconductor devices and its application. This course covers
the analysis and design of basic transistor amplifier circuits and tuned amplifiers circuits.

1.2 LEARNING TARGETS/OUTCOMES

After successful completion of the course, the students will be able to:
 Learn the analysis of complex circuits using mesh current and nodal voltage methods.
 Analyze complex circuits using network theorems.
 Understand the different parameters of two port networks.
 Learn the biasing methods of transistors.
 Understand the various advantages and method of analysis of feedback.

1.3 COURSE ORGANIZATION

There will be 4-hours lecture and 2 hrs Practical per week in current semester. Practicals will be
carried out within the semester. Students have to submit assignment time to time from the course

77
content. Some of the tutorial/discussion sessions may be carried out during lectures if need be.
Students are expected to attend all lectures and to participate in class discussions.

2.1 COURSE TEXT BOOKS

th
 Electronic Devices and Circuit Theory (10 Edition). Robert L. Boylestad and Louis
 Nashesky. Pearson Prentice Hall, 2009.
rd
 Electronic Devices and Circuits (3 Edition). David A. Bell. Prentice Hall Publications,
1986.
  Integrated Electronics. J. Millman and C. C. Halkias. Tata McGraw Hill (2001)
 Network Analysis. M.E.VanValkenburg. Prentice-Hall, Third Edition, 1974

2.2 COURSE REFERENCE BOOKS

 Electric Circuits, S. A. Nasar, Schaum’s outline series, Tata McGraw Hill (2004)
 Electrical Circuits, M. Nahvi& J. Edminister, Schaum’s Outline Series, Tata
McGraw-Hill (2005)
 Electrical Circuits, K.A. Smith and R.E. Alley, 2014, Cambridge University Press
 Network, Lines and Fields, J.D.Ryder, Prentice Hall of India.
th
 Electronic Devices and Circuits, David A. Bell, 5 Edition 2015, Oxford University
 Press.
 Electronic Circuits: Discrete and Integrated, D.L. Schilling and C. Belove,
Tata McGraw Hill
 Electrical Circuit Analysis, Mahadevan and Chitra, PHI Learning
t
 Microelectronic circuits, A.S. Sedra, K.C. Smith, A.N. Chandorkar, 2014, 6
h
Edn., Oxford University Press.

3. COURSE CONTENTS

Circuit Analysis
3.1.1 Concept of voltage and current sources
3.1.2 Kirchhoff’s current law, Kirchhoff’s voltage law
3.1.3 Mesh Analysis
3.1.4 Node Analysis

3.2.1 Star and Delta networks, Star-Delta conversion

3.2.2 Principal of Duality
3.2.3 Superposition Theorem
3.2.4 Thevenin’s Theorem

3.3.1 Norton’s Theorem

3.3.2 Reciprocity Theorem
3.3.3 Maximum Power Transfer Theorem
3.3.4 Two port networks

3.4.1 h, y and z parameters and their conversion

3.4.2 h, y and z parameters and their conversion
Junction Diode and its applications
3.4.3 PN junction diode (Ideal and practical)-constructions

78
3.4.4 Formation of Depletion Layer, Diode Equation and I-V characteristics

3.5.1 Idea of static and dynamic resistance

3.5.2 Dc load line analysis, Quiescent (Q) point
3.5.3 Zener diode
3.5.4 Reverse saturation current

3.6.1 Zener and avalanche breakdown

3.6.2 Qualitative idea of Schottky diode
3.6.3 Rectifiers- Half wave rectifier, Full wave rectifiers (center tapped and bridge),
3.6.4 Circuit diagrams

3.7.1Working and waveforms

3.7.2Ripple factor and efficiency
3.7.3Filter-Shunt capacitor filter
3.7.4Its role in power supply

3.8.1Output waveform, and working

3.8.2Regulation- Line and load regulation
3.8.3Zener diode as voltage regulator
3.8.4Explanation for load and line regulation

Bipolar Junction Transistor

3.9.1 Review of the characteristics of transistor in CE and CB configurations
3.9.2 Regions of operation (active, cut off and saturation)
3.9.3 Current gains α and β

79
3.9.4 Relations between α and β
3.10.1 dc load line and Q point
Amplifiers
3.10.2 Transistor biasing and Stabilization circuits
3.10.3 Fixed Bias and Voltage Divider Bias
3.10.4 Thermal runaway

3.11.1 Stability and stability factor S

3.11.2 Transistor as a two port network
3.11.3 h-parameter equivalent circuit
3.11.4 Small signal analysis of single stage CE amplifier

3.12.1 Input and Output impedance

3.12.2 Current and Voltage gains
3.12.3 Class A, B and C Amplifiers
Cascaded Amplifiers
3.12.4 Two stage RC Coupled Amplifier
3.13.1 Its Frequency Response

Feedback in Amplifiers
3.13.2 Concept of feedback, negative and positive feedback
3.13.3 Advantages of negative feedback (Qualitative only)

Sinusoidal Oscillators
3.13.4 Barkhausen criterion for sustained oscillations

3.14.1 Phase shift

3.14.2 Colpitt’s oscillator
3.14.3 Determination of Frequency
3.14.4 Condition of oscillation

Unipolar Devices
3.15.1 JFET, Construction
3.15.2 Working and I-V characteristics (output and transfer), Pinchoff voltage
3.15.3 UJT, basic construction
3.15.4 Working, equivalent circuit and I-V characteristics

4. EVALUATION
This course has a one mid-term exam, one class test, and one final examination. The mid-
term covers the first half of the course material. The final examination will cover the
complete course material.

80
THEORY OF COMPUTATION

1.Course Details

1.1 Course Description

Theory of computation are the concepts of automata, formal languages, grammar,
algorithms, computability, decidability, and complexity. Theory provides a simple, elegant
view of the complex machine that we call a computer. Theory possesses a high degree of
permanence and stability, in contrast with the ever-changing paradigms of the technology,
development, and management of computer systems.

1.2Learning Outcome:
After successful completion student will be able to:
Understand formal language theory and its application .
Design simple computational machine using this concepts of language theory
Correlate computability with formal computational machines

2 Course Resourse

References:
1. A.V. Aho, Ravi Sethi, J. D. Ullman, Compiler tools Techniques, Addison Wesley
publication
2. John C. Martin, Introduction To Languages and Theory of Computation, TMH
3. Introduction to Automata theory, Languages and Computation, J.E.Hopcraft,
R.Motwani, and Ullman. 2nd edition, Pearson Education Asia

3. Course Content
Basics of Mathematical Terms and Theory: Basic Mathematical Notations and Set
Theory, LogicFunctions and Relations, Language Definitions, Mathematical Inductions and
Recursive definitions
Finite Automata: Deterministic and Non Deterministic Finite Automata, Ù-Transitions,
Conversionfrom NFA to DFA, Kleene’s Theorem, Regular and Non Regular Languages

Regular expression (RE) , Definition, Operators of regular expression and their precedence,
Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA to
Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for regular
Languages . Application of Pumping Lemma, Closure properties of Regular Languages,
Decision properties of Regular Languages, FA with output: Moore and Mealy machine,
Equivalence of Moore and Mealy Machine, Applications and Limitation of FA.

Pushdown Automata, CFL and NFL: Introduction To PDA, Definition, DPDA, PDA
correspondingto CFG, CFG Corresponding To PDA, Introduction To CFL, Intersections and
Complements of CFL, Decisions Problems and CFL
Turing Machines, Recursive Language: Model of Computation and Church Turning
Thesis,Definition of Turing Machine, TM and Language Acceptors, Variations of TM, Non

81
Deterministic TM, Universal TM, Enumerable and Language, Recursive and Non Recursive
Enumerable Computation Functions, Measuring, Classifications and Complexity, Primitive
Recursive Functions, Halting Problem, Recursive Predicates and Some Bounded Operations

Computer Networks
1.1 Course Description
The principles and practice of computer networking, with emphasis on the Internet. The
structure and components of computer networks, packet switching, layered architectures,
TCP/IP, physical layer, error control, window flow control, local area networks (Ethernet,
Token Ring; FDDI), network layer, congestion control, quality of service, multicast.

1.2 Learning Targets/Outcomes

 Analyze the requirements for a given organizational structure and select the most
appropriate networking architecture and technologies;
 Specify and identify deficiencies in existing protocols, and then go onto formulate
new and better protocols;
 Analyze, specify and design the topological and routing strategies for an IP based
networking infrastructure
 Have a working knowledge of datagram and internet socket programming

1.3 Course Organization

There will be 3-hours lectures per week, 1-hour tutorial/discussion session and 2-hours
lab/project section each week. Please note that some of the tutorial/discussion sessions may
be converted to lectures if need be. Students are expected to attend all lectures and to
participate in class discussions.

2.1 Course Text Book

 A.S. Tanenbaum, Title: Computer Networks, Publishers: Pearson Education, Delhi,
Fourth Edition or latest

2.2 Reference Text Books

 Behnouz A. Forouzan, “Data Communication and networking”, 2nd Ed.,Tata
McGraw Hills 2003
 Black U, “Computer Networks-Protocols, Standards and Interfaces”, PHI 1996
 Comer E. Doughlas, “Computer Networks and Internets”, 2nd Ed., Pearson, 2000
 W. Stallings, “Data and Computer Communications”, 7th Ed., Pearson, 2002.

3. Teaching Schedule
3.1 Basic concepts
3.1.1 Components of data communication
3.1.2 Standards and organizations
3.1.3 NetworkClassification
3.1.4 Network Topologies

3.2 Basic concepts

3.2.1 Network Protocol
3.2.2 Layered Network Architecture
3.2.3 Overview of OSI reference model

82
3.2.4 Overview of TCP/IP protocol suite

3.3 Physical Layer

3.3.1 Cabling, Network Interface Card
3.3.2 Transmission Media Devices- Repeater
3.3.3 Hub, Bridge
3.3.4 Switch, Router, Gateway

3.4 Data Link Layer

3.4.1 Framing techniques
3.4.2 Error Control
3.4.3 Flow Control Protocols
3.4.4 Shared media protocols - CSMA/CD and CSMA/CA

3.5 Network Layer

3.5.1 Virtual Circuits and Datagram approach
3.5.2 IP addressing methods
3.5.3 IP addressing methods..contine
3.5.4 IP addressing methods…continue

3.6 Network Layer

3.6.1 Subnetting
3.6.2 Subnetting ..continue
3.6.3 Routing Algorithms (adaptive and non-adaptive)
3.7.4 Routing Algorithms (adaptive and non-adaptive)..continue
3.7 Transport Layer
3.7.1 Transport services
3.7.2 Transport Layer protocol of TCP
3.7.3 Transport Layer protocol of TCP..continue
3.7.4 Transport Layer protocol of UDP
3.8 Application Layer
3.8.1 Application layer protocols and services -Domain name system
3.8.2 HTTP,
3.8.3 WWW, telnet
3.8.4 FTP, SMTP
3.9 Network Security : Common Terms, Firewalls, Virtual Private Networks
3.9.1 Common Terms
3.9.2 Firewalls
3.9.3 Virtual Private Networks
3.9.4 Virtual Private Networks..continue

4.Plagiarism
The University intends to develop and promote original work. Taking another person's words
or ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

Software Lab based on Computer Networks:

Implement the concepts of Computer Networks such as:
1. Simulate Checksum Algorithm.

83
2. Simulate CRC Algorithm
3. Simulate Stop &amp; Wait Protocol.
4. Simulate Go-Back-N Protocol.
5. Simulate Selective Repeat Protocol.

OPERATING SYSTEMS
1.1 Course Description
This course is intended to introduce the concepts, structure, features, trends and design
Mechanism of Operating system. The Operating System has seen consistent innovations and
developments like other fields of computer science. In this course efforts have been to
capture these changes. The trend is towards GUI based free, platform independent, secure and
network-based operating system

1.2 Learning Targets/Outcomes

By learning this course Student will able to
 Understand common Unix command
 Understand vital Operating system concept like process management, memory management, File
System and I/O.

1.3 Course Organization

There will be 3-hours lecture per week, 1-hours tutorial/discussion and 2 hours Laboratory
session each week. Please note that some of the tutorial/discussion sessions may be converted
to lectures if need be. Students are expected to attend all lectures and to participate in class
discussions.

2.1 Text Book

 Silberschatz, Abraham and Galvin, Peter B. Operating System Concepts. 9thEdition. John
Wiley Sons

2.2 Reference Text Books

 Milan Milenkovic, Operating Systems Concepts and Design, McGrow Hill 1987
 Tanenbaum, S Andrew, Operating Systems – Design and Implementation, PHI,2001.

3. Course Content
3.1 Introduction
3.1.1 System Software
3.1.2 Resource Abstraction
3.1.3 OS strategies
3.1.4 OS strategies…Continue

3.2 Types of operating Systems

3.2.1 Multiprogramming,
3.2.2 Multiprogramming…continue
3.2.3 Batch, Time Sharing
3.2.4 Batch, Time Sharing…continue

3.3 Types of operating systems

3.3.1 Single user and Multiuser
3.3.2 Single user and Multiuser..continue

84
3.3.3 Process Control
3.3.4. Real Time Systems

3.4 Operating System Organization

3.4.1 Factors in operating system design
3.4.2 Factors in operating system design..continue
3.4.3 Basic OS functions
3.4.4 Basic OS functions..continue
3.5 Operating System Organization
3.5.1 implementation consideration
3.5.2 process modes
3.5.3 Methods of requesting system services – system
3.5.4 Methods of requesting system services – system..continue

3.6 Process Management

3.6.1 System view of the process and resources
3.6.2 System view of the process and resources..contine
3.6.3 Initiating the OS
3.7.4 Initiating the OS..continue

3.7 Scheduling
3.7.1 Scheduling Mechanisms
3.7.2 Scheduling Mechanisms…continue
3.7.3 Strategy selection
3.7.4 Strategy selection…continue

3.8 Scheduling
3.8.1 Non-pre-emptive strategies
3.8.2 Non-pre-emptive strategies …contine
3.8.3 Pre-emptive strategies
3.8.4 Pre-emptive strategies..continue

3.9 Memory Management

3.9.1 Mapping address space to memory space
3.9.2 Mapping address space to memory space..continue
3.9.3 Memory allocation strategies
3.9.4 Memory allocation strategies …continue

3.10 Memory Management

3.10.1 Fixed partition
3.10.2 Fixed partition
3.10.3 Variable partition
3.10.4 Paging, virtual memory

3.11 Shell introduction and Shell Scripting:

3.11.1 What is shell and various type of shell, Various editors present in linux
3.11.2 What is shell and various type of shell, Various editors present in linux..continue
3.11.3 Different modes of operation in vi editor
3.11.4 What is shell script

85
3.12 Multiple Partitioned of management
3.12.1 Writing and executing the shell script
3.12.2 Writing and executing the shell script..continue
3.12.3 Shell variable (user defined and system variables)
3.12.4 Shell variable (user defined and system variables)…continue

3.13 File System

3.13.1 System calls,
3.13.2 System calls..continue
3.13.3 Using system calls Pipes and Filters
3.13.4 Using system calls Pipes and Filters..continue

3.14 File System Structure

3.14.1 Decision making in Shell Scripts (If else, switch)
3.14.2 Loops in shell
3.14.3 Loops in shell …continue
3.14.4 Functions

3.15 Overview of I/O Systems

3.15.1 Utility programs (cut, paste, join, tr , uniq utilities)
3.15.2 Utility programs (cut, paste, join, tr , uniq utilities)..continue
3.15.3 Pattern matching utility (grep)
3.15.4 Pattern matching utility (grep)..continue

4. Plagiarism
The University intends to develop and promote original work. Taking another person's words
or ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

Software Lab based on Operating Systems

1. Usage of following commands:
ls, pwd, tty, cat, who, who am I, rm, mkdir, rmdir, touch, cd.
2. Usage of following commands:
cal, cat(append), cat(concatenate), mv, cp, man, date.
3. Usage of following commands:
chmod, grep, tput (clear, highlight),
bc.
4. Write a shell script to check if the number entered at the command line is prime or
not.
5. Write a shell script to modify “cal” command to display calendars of the specified
months.
6. Write a shell script to modify “cal” command to display calendars of the specified
range of months.
7. Write a shell script to accept a login name. If not a valid login name display message
– “Entered login name is invalid”.

86
 8. Write a shell script to display date in the mm/dd/yy format.
9. Write a shell script to display on the screen sorted output of “who” command along
with the total number of users .
10. Write a shell script to display the multiplication table any number,

Advanced Java Technology

1.1 Course Description

The aim of the course is to study the advanced java concepts and its extended capability.

1.2 Learning Targets/Outcomes

By learning this course Student will able to
 Use various tools, and Validation techniques, use of different templates available in
IntelliJ IDEA,
 Implementation and testing strategies in real time applications.
 Use advanced concepts related to Web Services, spring and Hibernate

1.3 Course Organization

There will be 3-hours lecture per week and 2 hours Laboratory session each week. Please
note that some of the tutorial/discussion sessions may be converted to lectures if need be.
Students are expected to attend all lectures and to participate in class discussions

2. Course Resource

References Books
1. Bryan Basham;KathySierra;Bert Bates, Head first Servlets and JSPs, O’Rilley Media
2. Black Book, Java Server Programming, Dreamtech Press
3.Complete Reference -mcgraw publication

3.Course Content

Java Server Page(JSP)

Introduction- Servlet and JSP, JspLifeCycle, Jsp Implicit Objects & Scopes,. JspDirectives
.Jsp Scripting Elements,JspActions, . JSTL & Tag Library
Java Servlet Programming
HTTP request, HTTP response, Directory structure of web application, Servlets and CGI,
container responsibilities, servlet life cycle, Get and Post Requests, Deployment Descriptor,
various names for servlet referencing, Request and Response Objects, Request forwarding,
Servlet init parameters, Servlet Request parameters, context parameters, Servlet Listeners,
various servlet attributes and its scopes Java beans, databases, Session management Cookie
management, Servlet Filters
Java Database Connectivity(JDB) Introduction, Java.Sql Package JdbcArchitecture,Types of
Drivers,Statement ,ResultSet ,Read Only ResultSet,UpdatableResultSet,Forward Only
ResultSet,ScrollableResultSet,.PreparedStatement, CallableStatement, BLOB & CLOB, ,
Introduction To RMI, and CORBA
4.Plagiarism

87
The University intends to develop and promote original work. Taking another person's words
or ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

SOFTWARE ENGINEERING

1.1 Course Description

Software Engineering is an introductory survey course on the fundamental concepts and
principles that underlie current and emerging methods, tools, and techniques for the cost-
effective engineering of high-quality software systems. Software engineering (SE) is
concerned with all aspects of software development, from the early stages of system
specification to maintaining the system after it has gone into use. This includes technical
processes of software development as well as activities such as software project management
and the development of tools, methods, and theories to support software development.

1.2 Learning Targets/Outcomes

 To understand principles, concepts, methods, and techniques of the software
engineering approach to producing quality software (particularly for large, complex
systems).
 To organize and manage medium-sized software development project, including
project plan and documentation, schedule and cost estimates, and quality assurance
activities.
 To make effective technical oral and written presentations
 To function effectively as a member of a team engaged in technical work.
 To think critically about ethical and social issues in software engineering.

1.3 Course Organization

There will be 4-hours lectures per week, 4-hours lab/project section each week. Please
note that some of the tutorial/discussion sessions may be converted to lectures if need
be. Students are expected to attend all lectures and to participate in class discussions.

2.1 Course Text Book

 Roger S Pressman: “Software Engineering”, 7th Edition

2.2 Reference Text Books

 Ian Sommerville:“Software Engineering”, Pearson Education Asia,
 PankajJalote, Narosa:“An Intergraded Approach to Software Engineering”
 Carlo Ghezzi, Mehdi Jazeryeri and Dino Mandrioli: Fundamentals of Software Engg.

3. Teaching Schedule
3.1 Software Process
3.1.1 Introduction
3.1.2 S/W Engineering Paradigm
3.1.3 Life cycle models (water fall,incremental, spiral, evolutionary, prototyping, object
oriented)
3.1.4 System engineering

88
3.2 Software Process
3.2.1 Computer based system, verification
3.2.2 verification, validation
3.2.3 life cycle process
3.2.4 development process, system engineering hierarchy.
3.3 Software requirements
3.3.1 Functional and non-functional
3.3.2 User, system, requirement engineeringprocess
3.3.3 Feasibility studies

3.3.4 Requirements, elicitation

3.4 Software requirements

3.4.1 Validation and management
3.4.2 Software prototyping
3.4.3 Prototyping in the software process
3.4.4 Rapid prototyping techniques

3.5 Software requirements

3.5.1 user interface prototyping
3.5.2 S/W document
3.5.3 Analysis and modeling, data
3.5.4 Software requirements

3.6 Scheduling Algorithms

3.6.1 Behavioral models
3.6.2 Behavioral models
3.6.3 Structured analysis
3.7.4 Data dictionary

3.7 Design Concepts and Principles

3.7.1 Design process and concepts, modular design
3.7.2 designheuristic, design model and document
3.7.3 Architectural design
3.7.4 Software architecture, Data design

3.8 Design Concepts and Principles

3.8.1 Architectural design
3.8.2 Transform and transaction mapping
3.8.3 User interface design
3.8.4 User interface design principles, Real time systems

3.9 Design Concepts and Principles

3.9.1 Real time software design
3.9.2 System design, real time executives
3.9.3 Data acquisition system
3.9.4 Monitoring and control system.

3.10 Software Configuration Management

3.10.1 The SCM process

89
3.10.2 Version control
3.10. Change control
3.10.4 Configuration audit, SCM standards

3.11 Software Project Management

3.11.1 Measures and measurements
3.11.2 S/W complexity and sciencemeasure
3.11.3 Size measure, data and logic structure measure, information flow measure
3.11.4Estimations,for Software Projects, Empirical Estimation Models, Project Scheduling.

3.12 Testing
3.12.1 Taxonomy of software testing
3.12.2 Levels, test activities
3.12.3 Types of s/w test
3.12.4 Black box testing

3.13 Testing
3.13.1 Testing boundary conditions
3.13.2 Structural testing, test coverage criteria based on data flow, mechanisms
3.13.3 Regression testing
3.13.4 Testing in the large

3.14 Testing
3.14.1 S/W testing strategies
3.14.2 Strategic approach and issues
3.14.3 Unit testing, integration testing
3.14.4 Validation testing, system testing and debugging

3.15 Trends in Software Engineering

3.15.1 Reverse Engineering and Re-engineering–wrappers
3.15.2 Case Study of CASE tools
3.15.3 Case Study of CASE tools..continue
3.15.4 Case Study of CASE tools..continue

4.Plagiarism
The University intends to develop and promote original work. Taking another person's words
or ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

Lab based on Software Engineering

1. Practical Title
• Problem Statement,
• Process Model
2. Requirement Analysis
• Creating a Data Flow
• Data Dictionary,
• Use Cases
3. Project Management

90
• Computing FP
• Effort
• Schedule, Risk Table, Timeline
chart 4. Design Engineering
• Architectural Design
• Data Design, Component Level Design
5. Testing
• Basis Path
Testing Sample Projects

• DTC Route Information: Online information about the bus routes and their frequency
and fares

• Car Pooling: To maintain a web based intranet application that enables the
corporate employees within an organization to avail the facility of carpooling
effectively.
• Patient Appointment and Prescription Management System
• Organized Retail Shopping Management Software
• Parking Allocation System
• Wholesale Management System

91
Software Design

Course Description

The student will gain practical knowledge on methods, practice, languages and tools to develop a
software project of medium size using the Object Oriented paradigm. This knowledge will be
acquired in practice through the realization of a project in a working team.

UNIT 1.-
Requirements
Requirements elicitation for medium-size applications, Requirements representation and analysis
using flow-oriented and scenario-oriented notations

UNIT 2.-
Design
Architectural high-level design of software applications, Structural and behavioural design of
software applications, using the Object Oriented paradigm

UNIT 3.-
Implementation and Unit Testing
Implementation of a medium-size software application using Java, working in a team, Design of test
suites guaranteeing a certain level of confidence in the software quality, Good practices in Software
Engineering, and testing tools like JUnit

UNIT 4.-
Testing
Integration testing, system testing and acceptance testing.

Reference book
1. Software engineering a practitioner's approach, 7ªed. Roger Pressman. McGraw Hill Higher
Education, 2010. INF/681.3.06/PRE. Available in Spanish.
2. Software engineering, 9ª ed. Addison Wesley. Ian Sommerville. INF/681.3.06/SOM. Available in
Spanish.
3. Software requirements styles and techniques. Lauesen, Soren. Addison-\Wesley, 2002.
INF/C6000/LAU.

92
CRYPTOGRAPHY & INFORMATION SECURITY

3.1 Course Description

Information Security is a comprehensive study of the principles and practices
of computer system security including , network security ,operating system security, web
securityand software security.
1.2 Learning Targets/Outcomes
The Student will able to
 What are the common threats faced today
 What are the foundational theory behind information security
 What are the basic principles and techniques when designing a secure system
 How today's attacks and defenses work in practice
1.3 Course Organization
There will be 3-hours lectures per week, 2-hours lab/project section each week. Please note
that some of the tutorial/discussion sessions may be converted to lectures if need be. Students
are expected to attend all lectures and to participate in class discussions.
2.1Text Books:
1. William Stallings, Cryptography and Network Security, 4th Edition, Pearson
Education/PHI. 2006
2.2ReferenceBooks:
1. Charlie Kaufman, Radia Perlman, Mike Speciner, Network Security: Private
Communication in Public World, 2nd Edition,2011, Pearson Education.
2. Atul Kahate, Cryptography and Network Security, TMH. (2003)

3 Teaching Schedule
3.1 Module1
3.1.1 Symmetric Ciphers - Overview
3.1.2Services,Mechanisms and Attacks
3.1.3The OSI Security Architecture

3.2.1A Model of Network Security

3.2.2Classicial Encryption Techniques : Symmetric Cipher Model
3.2.3Substitution Techniques, Transposition Techniques
3.3.1Rotor Machines, Steganography.
3.3.2Block Cipher and the Data Encryption Standard : Simplified DES
3.3.3 Block Cipher Principles,

3.4.1 The DES, The Strength of DES, Differential and Linear Cryptanalysis. Symmetric
Ciphers 3.4.2 Triple DES, Blowfish. Confidentiality using Conventional Encryption :
Placement of Encryption Function,
3.4.3Traffic Confidentiality, Key Distribution, Random Number Generation.

3.5Module2
3.5.1Public Key Encryption,
3.5.2Digital Signatures -Number Theory, Prime Numbers
3.5.3Format‟s and Euler‟s Theorems, Testing for Primality

3.6.1 Public Key Cryptography and RSA :

3.6.2Principles of Public Key Cryptosystems
93
 3.6.3The RSA Algorithms, Key Management, Diffie Hellman Key Exchange.
3.7Module3
3.7.1 Authentication Protocols - Message Authentication :
3.7.2 Authentication Requirements, Authentication Functions
3.7.3Message Authentication Codes

3.8.1 MD5 Message Digest Algorithms

3.8.2Digital Signatures and Authentication Protocols : Digital Signatures, Authentication
3.8.2Protocols, Digital Signature Standards.

3.9Module4
3.9.1 Network Security - Authentication Applications :
3.9.2 Kerberos, X.509 Directory Authentication Service.
3.9.3 Electronic Mail Security : Pretty Good Privacy.

3.10.1IP Security : Overview, IP Security Architecture

3.10.2Authentication Header,
3.10.3Encapsulation Security Payload.

3.11.1Web Security : Web Security Requirements

3.11.2Secure Sockets Layer and Transport Layer Security
3.11.3Secure Electronic Transaction.

3.12Module5
3.12.1 System Security- Intruders, Malicious Software,
3.12.2Viruses and Related Threats,
3.12.3Counter Measures, Firewalls and its Design Principles.
4.Plagiarism
The University intends to develop and promote original work. Taking another person's words
or ideas and using them as if they were your own or Plagiarism, as it is called, is taken very
seriously at the University. Plagiarism may be deliberate or accidental.

94
DISTRIBUTED COMPUTING
Course Description
The aims of this module are to help students understand the fundamental issues of designing
and engineering distributed systems with reference to partial failure, heterogeneity,
scalability, concurrency and asynchrony
Fundamentals:
Introduction, Distributed Computing Models, Software Concepts, Issues in Designing
Distributed Systems, Client Server Model, Case Studies
Inter-Process Communication:
Message Passing, Group Communication, Case Studies

Remote Procedure Calls:

Introduction, RPC Basics, RPC Implementation, RPC Communication, Issues,
Overview of RMI, Case Studies

Synchronization:
Introduction, Clock Synchronization, Logical Clocks, Global State, Mutual Exclusion,
Election Algorithms, Deadlocks in Distributed Systems, Case Studies

Distributed System Management:

Introduction, Resource Management, Task Assignment Approach, Load Balancing
Approach, Load Sharing Approach, Process Management in a Distributed
Environment, Process Migration, Threads, Fault Tolerance.

Distributed Shared Memory:

Introduction, Basic Concepts of DSM, Hardware DSM, Design Issues in DSM
Systems, Issues in Implementing DSM Systems, Heterogeneous and Other DSM,
Case Studies.

Distributed File System

Introduction, File Models, Distributed File System Design, Semantics of File Sharing,
DFS Implementation, File Caching, Replication, Case Studies
Naming:
Introduction, Desirable features, Basic Concepts
Applications & Emerging Trends
Overview of Distributed Operating Systems, Distributed Database Management
Systems, Grid Computing, SOA, Cloud Computing

References:
1.Mahajan S., Shah S., “Distributed Computing”, Oxford University Press, India.
2.Steen, Maarten Van, Tanenbaum A.S., “Distributed Systems – Principles and
Paradigms”, Prentice Hall India.
3. P K Sinha, “&quot;Distributed System: Concepts and Design”,PHI

95
Software Architectures

Course Description

Understand software architectural requirements and drivers

Be exposed to architectural styles and views
Be familiar with architectures for emerging technologies

UNIT I :
Introduction and Architectural Drivers
Introduction – What is software architecture? – Standard Definitions – Architectural structures –
Influence of software architecture on organization-both business and technical – Architecture
Business Cycle- Introduction – Functional requirements – Technical constraints – Quality Attributes.

UNIT II :
Quality Attribute Workshop
Quality Attribute Workshop – Documenting Quality Attributes – Six part scenarios – Case studies

UNIT III :
Architectural Views Introduction
Standard Definitions for views – Structures and views – Representing views-available notations –
Standard views – 4+1 view of RUP, Siemens 4 views, SEI’s
perspectives and views – Case studies

Reference book
1. Len Bass, Paul Clements, and Rick Kazman, “Software Architectures Principles andPractices”, 2nd
Edition, Addison-Wesley, 2003
2. Paul Clements, Felix Bachmann, Len Bass, David Garlan, James Ivers, Reed Little,Paulo Merson,
Robert Nord, and Judith Stafford, “Documenting SoftwareArchitectures. Views and Beyond”, 2nd
Edition, Addison-Wesley, 2010.

96
Software Testing

Course Description
Study fundamental concepts of software testing and its application in various scenarios with
the help different testing strategies, methods and tools.

UNIT I
Introduction: Software Testing, Importance of testing, Roles and Responsibilities, Testing
Principles, Attributes of Good Test, V-Model, Test Case Generation , SDLC Vs STLC,
Software Testing Life Cycle-in detail.

UNIT II
Types of Testing: Testing Strategies: Unit Testing, Integration Testing, System Testing,
Smoke, Regression Testing, Acceptance Testing. Clean Room Software Engineering.
Functional/Non Functional Testing. Testing Tools, Categorization of testing methods:
Manual Testing, Automation Testing and Automated Testing Vs. Manual Testing.

UNIT III
Non Functional Testing: Performance Test, Memory Test , Scalability Test, Compatibility
Test, Security Test, Cookies Test, Session Test, Recovery Test, Installation Test, Ad-hoc
Test, Risk Based Test, Compliance Test. McCall’s Quality Factors, FURPS.

UNIT IV
Software Testing Methodologies: Validation & Verification, White/Glass Box Testing, Black
Box Testing, Grey Box Testing, Statement Coverage Testing, Branch Coverage Testing, Path
Coverage Testing, Conditional Coverage Testing, Loop Coverage Testing, Boundary Value
Analysis, Equivalence Class Partition, State Based Testing, Cause Effective Graph, Decision
Table, Use Case Testing, Exploratory testing and Testing Metrics, Testing GUI.

UNIT V
Software Testing Life Cycle: Requirements Analysis/Design, Traceability Matrix, Test
Planning, Objective, Scope of Testing, Schedule, Approach, Roles & Responsibilities,
Assumptions, Risks & Mitigations, Entry & Exit Criteria, Test Automation, Deliverables.

References book:
1. Roger S.Pressman, Software engineering- A practitioner’s Approach, McGraw-Hill
International Editions
2. Ian Sommerville, Software engineering, Pearson education Asia
3. Software Testing Techniques, 2nd edition, Boris Beizer, 1990

97
Compiler Design

Objective: Compiler Design is a fundamental/core subject of Computer Engineering. It

teaches how Compiler of a Programming Language works. It also focuses on various designs
of Compiler and structuring and optimizing various phases of a Compiler.

Content
1.Overview of the Translation Process, A Simple Compiler,Difference between interpreter,
assembler and compiler. Overview and use of linker and loader, types of Compiler, Analysis
of the Source Program, The Phases of a Compiler, Cousins of the Compiler, The Grouping of
Phases, Lexical Analysis, Hard Coding and Automatic Generation Lexical Analyzers, Front-
end and Back-end of compiler, pass structure
2.Lexical Analyzer
Introduction to Lexical Analyzer, Input Buffering, Specification of Tokens, Recognition of
Tokens, A Language for Specifying Lexical Analyzers, Finite Automata From a Regular
Expression,Design of a Lexical Analyzer Generator, Optimization of DFA
3.Parsing Theory
Top Down and Bottom up Parsing Algorithms, Top-Down Parsing,Bottom-Up Parsing,
Operator-Precedence Parsing, LR Parsers,Using Ambiguous Grammars, Parser Generators,
Automatic Generation of Parsers. Syntax-Directed Definitions, Construction of Syntax Trees,
Bottom-Up Evaluation of S-Attributed Definitions, L-Attributed Definitions, syntax directed
definitions and translation schemes
4.Error Recovery
Error Detection & Recovery, Ad-Hoc and Systematic Methods
5.Intermediate Code Generation
Different Intermediate Forms, Syntax Directed Translation Mechanisms And Attributed
Mechanisms And Attributed Definition.
6.Run Time Memory Management
Source Language Issues, Storage Organization, Storage-Allocation Strategies, and Access to
Non local Names, Parameter Passing,Symbol Tables, and Language Facilities for Dynamic
Storage Allocation, Dynamic Storage Allocation Techniques.
7.Code Optimization
Global Data Flow Analysis, A Few Selected Optimizations like Command Sub Expression
Removal, Loop Invariant Code Motion, Strength Reduction etc.
8.Code Generation
Issues in the Design of a Code Generator, The Target Machine,Run-Time Storage
Management, Basic Blocks and Flow Graphs, Next-Use Information, A Simple Code
Generator, Register Allocation and Assignment, The DAG Representation of Basic Blocks,
Peephole Optimization, Generating Code from DAGs, Dynamic Programming Code-
Generation Algorithm, Code-Generator Generators.

Reference Books:
1.Compilers: Principles, Techniques and Tools By Aho, Lam, Sethi, and Ullman, Second
Edition, Pearson, 2014
2.Compilers: Principles, Techniques and Tools By Aho, Sethi, and Ullman, Addison-Wesley,
1986
3.Compiler Design in C By Allen I. Holub, Prentice-Hall/Pearson

98
Software Quality Management

Course Description
The aim and objective of this course is to teach students the concepts and skills needed for
SQA and Testing. Software quality assurance (SQA or simply QA) is viewed as an activity
that runs through the entire development process.

UNIT I
Quality Management
What is Software, Quality Dimensions The SQ Dilemma Achieving Software Quality
UNIT II
Review Techniques
Software Defects , Defect amplification and removal, Review Metrics and their use Informal
Reviews
Formal technical reviews, Review reporting and record keeping

UNIT III
Software Quality Assurance

Elements of SQA, SQA Task, Goals and Metrics, Formal Approaches to SQA , Statistical
SQA,
Software Reliability, The ISO 9000 Quality Standards , The SQA Plan

UNIT IV
Software Testing Strategies
The Strategic Approach for ST , Verification and Validation, Criteria for Completing of Testing,
Strategic Issues

UNIT V
Testing Strategies for Conventional Software’s

Unit Testing, Integration Testing , Strategies for OOS, Testing in OO context, Integration
Testing in OO context, Strategies for Web Apps, Validation Testing, Alpha and Beta Testing

Reference book :
Software Engineering - A Practitioner's Approach ( 7th edition ) by Roger S. Pressman. ISBN
13. 9780073375977

99
MACHINE LEARNING-I

Unit 1
Introduction and Basic Concepts Supervised Learning and Unsupervised Learning. Definition
of learning systems. Goals and applications of machine learning. Aspects of developing a
learning system: training data, concept representation, function approximation.
Unit 2
Probability Basics Linear Algebra
Statistical Decision Theory – Regression & Classification Bias – Variance Linear Regression
Multivariate Regression
Unit 3
Dimensionality Reduction
Subset Selection, Shrinkage Methods, Principle Components Regression Linear
Classification, Logistic Regression, Linear Discriminant Analysis Optimization,
Classification-Separating Hyperplanes Classification
Unit 4
Artificial Neural Networks
Artificial Neural Networks (Early models, Back Propagation, Initialization, Training &
Validation) Parameter Estimation (Maximum Likelihood Estimation, Bayesian Parameter
Estimation), Multilayer networks and backpropagation
Evaluation Measures, Hypothesis Testing Ensemble Methods, Graphical Models
Unit 5
Clustering and Unsupervised Learning
Learning from unclassified data. Clustering. Hierarchical Aglomerative Clustering. k-means
partition clustering. Expectation maximization (EM) for soft clustering. Semi-supervised
learning with EM using labeled and unlabled data. Clustering, Gaussian Mixture Models,
Spectral Clustering Ensemble Methods

100
Machine Learning 2

Unit I
Decision Tree Learning
Representing concepts as decision trees. Recursive induction of decision trees. Picking the
best splitting attribute: entropy and information gain. Searching for simple trees and
computational complexity. Occam's razor. Overfitting, noisy data, and pruning
Naive bayes
Learn the Bayes rule, and how to apply it to predicting data using the Naive Bayes algorithm
Train models using Bayesian Learning, Use Bayesian Inference to create Bayesian Networks
of several variables
Support vector machines
Learn to train a Support Vector Machine to separate data linearly Use Kernel Methods in
order to train SVMs on data that is not linearly separable
Unit II
Machine learning to Deep learning
The basics of deep learning, including softmax, one-hot encoding, and cross entropy. Basic
linear classification models such as Logistic Regression, and their associated error function.
Unit III
Deep neural networks
Neural Network Activation functions, sigmoid, tanh, and Rules. train a neural network using
backpropagation and the chain rule. improve a neural network using techniques such as
regularization and dropout.Convolutional neural networks
Convolutional Neural Network CNNs are used in image recognition.

Text Books:
 E. Alpaydin, Introduction to Machine Learning, 3rd Edition, Prentice Hall (India)
2015.
 R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification, 2nd Edn., Wiley India,
2007.
 J. Shawe-Taylor and Nello Cristianini, Kernel Methods for Pattern Analysis,
Cambridge University Press, 2004.
 Mining of Massive Datasets: Jure Leskovec, Anand Rajaraman, Jeff Ullman.
 Deep Learning: Ian Goodfellow and Yoshua Bengio and Aaron Courville
 Understanding Machine Learning: From Theory to Algorithms: Shai Shalev-Shwartz
and Shai Ben-David

Reference Books:
 C. Bishop, Pattern Recognition and Machine Learning (Information Science and
Statistics), Springer, 2006.
 T. Hastie, R. Tibshirani, J. Friedman. The Elements of Statistical Learning, 2e, 2008.
 Christopher Bishop. Pattern Recognition and Machine Learning. 2e.
 S. O. Haykin, Neural Networks and Learning Machines, 3rd Edition, Pearson
Education (India), 2016.
 I. Goodfellow, Y. Bengio , A. Courville, Deep Learning, MIT Press, 2017.

101
Cloud Computing
Course Contents

Unit – 1
Introduction- Objectives, From collaborative to the Cloud – A short history Client –
Server Computing, Peer-to-Peer Computing, Distributed Computing, Collaborative
Computing, Cloud Computing, Functioning of Cloud Computing, Cloud Architecture,
Cloud Storage, Cloud Services, Industrial Applications.

Unit – 2
Business Values, Introduction-Objectives, Service Modeling, Infrastructure Services,
Platform Services, Software Services - Software as service modes- Massively scaled
software as a service- Scale of Economy, Management and Administration.

Unit–3
Inside Cloud Computing- Introduction- Objectives, Feeling Sensational about
Organization, Making Strategy Decisions- Governance Issues- Monitoring Business
Processes- IT Cost Management,

Unit–4
Cloud Service Administration- Service Level Agreements and Monitoring-Support
Services- Accounting Services, Resource Management- IT Security- Performance
Management- Provisioning- Service Management, Untangling Software Dependencies.

Unit–5
Cloud Computing Technology- Introduction-Objectives, Clients – Mobile – Thin –
Thick, Security - Data Linkage - Offloading Work - Logging - Forensics -
Development – Auditing, Network- Basic Public Internet- The Accelerated Internet-
Optimised Internet Overlay- Site-to-Site VPN- Cloud Providers- Cloud Consumers -
Pipe Size- Redundancy, Services- Identity- Integration- Mapping- Payments- Search.

Unit–6
Accessing the Cloud- Introduction-Objectives, Platforms- Web Application
Framework- Web Hosting Services- Proprietary Methods, Web Applications- API’s
in Cloud Computing, Browsers for Cloud Computing- Internet Explorer- Mozilla
Firefox- Safari- Chrome.

Unit–7
Data Management- Introduction- Objectives, Data Security- Data Location- Data
Control- Securing data for transport, Scalability and Cloud Services- Large Scale Data
Processing- Databases and Data Stores- Data Archival.

Unit–8
Information Storage in Cloud Computing- Introduction- Objectives, Storage as a
Service, Storage Providers- Amazon Simple Storage Service- Nirvanix- Google
Bigtable Datastore- MobileMe- Live Mesh, Storage Security, Merits and Demerits of
Storage.

102
Reference Books:
1. Cloud Computing Bible. Barrie Sosinsky. John Wiley & Sons. ISBN-13: 978-
0470903568.
2. Rajkumar Buyya, Cloud Computing: Principles and Paradigms, John Wiley & Sons,
First Edition
3. Cloud Computing Design Patterns by Thomas Erl, Prentice Hall, ISBN-10:
0133858561, ISBN-13: 978-0133858563

DIGITAL SIGNAL PROCESSING

Discrete-Time Signals and Systems: Classification of Signals, Transformations of the

Independent Variable, Periodic and Aperiodic Signals, Energy and Power Signals, Even and
Odd Signals, Discrete-Time Systems, System Properties. Impulse Response, Convolution
Sum; Graphical Method; Analytical Method, Properties of Convolution; Commutative;
Associative; Distributive; Shift; Sum Property System Response to Periodic Inputs,
Relationship Between LTI System Properties and the Impulse Response; Causality; Stability;
Invertibility, Unit Step Response.
Discrete-Time Fourier Transform: Fourier Transform Representation of Aperiodic
Discrete-Time Signals, Periodicity of DTFT, Properties; Linearity; Time Shifting; Frequency
Shifting; Differencing in Time Domain; Differentiation in Frequency Domain; Convolution
Property.
The z-Transform: Bilateral (Two-Sided) z-Transform, Inverse z-Transform, Relationship
Between z-Transform and Discrete-Time Fourier Transform, z-plane, Region-of-
Convergence; Properties of ROC, Properties; Time Reversal; Differentiation in the z-
Domain; Power Series Expansion Method (or Long Division Method); Analysis and
Characterization of LTI Systems; Transfer Function and Difference-Equation System.
Solving Difference Equations

Filter Concepts: Phase Delay and Group delay, Zero-Phase Filter, Linear-Phase Filter,
Simple FIR Digital Filters, Simple IIR Digital Filters, All pass Filters, Averaging Filters,
Notch Filters.
Discrete Fourier Transform: Frequency Domain Sampling (Sampling of DTFT), The
Discrete Fourier Transform (DFT) and its Inverse, DFT as a Linear transformation,
Properties; Periodicity; Linearity; Circular Time Shifting; Circular Frequency Shifting;
Circular Time Reversal; Multiplication Property; Parseval’s Relation, Linear Convolution
Using the DFT (Linear Convolution Using Circular Convolution), Circular Convolution as
Linear Convolution with aliasing

Fast Fourier Transform: Direct Computation of the DFT, Symmetry and Periodicity
Properties of the Twiddle factor (WN), Radix-2 FFT Algorithms; Decimation-In-Time (DIT)
FFT Algorithm; Decimation-In-Frequency (DIF) FFT Algorithm, Inverse DFT Using FFT
Algorithms.
Realization of Digital Filters: Non Recursive and Recursive Structures, Canonic and Non
Canonic Structures, Equivalent Structures (Transposed Structure), FIR Filter structures;
Direct-Form; Cascade-Form; Basic structures for IIR systems; Direct-Form I.
Finite Impulse Response Digital Filter: Advantages and Disadvantages of Digital Filters,
Types of Digital Filters: FIR and IIR Filters; Difference Between FIR and IIR Filters,

103
Desirability of Linear-Phase Filters, Frequency Response of Linear-Phase FIR Filters,
Impulse Responses of Ideal Filters, Windowing Method; Rectangular; Triangular; Kaiser
Window, FIR Digital Differentiators.
Infinite Impulse Response Digital Filter: Design of IIR Filters from Analog Filters, IIR
Filter Design by Approximation of Derivatives, Backward Difference Algorithm, Impulse
Invariance Method
Reference Books:
 Digital Signal Processing, Tarun Kumar Rawat, 2015, Oxford University Press, India
 Digital Signal Processing, S. K. Mitra, McGraw Hill, India.
 Principles of Signal Processing and Linear Systems, B.P. Lathi, 2009, 1stEdn. Oxford
University Press.
 Fundamentals of Digital Signal processing using MATLAB, R.J. Schilling and S.L.
Harris, 2005, Cengage Learning.
 Fundamentals of signals and systems, P.D. Cha and J.I. Molinder, 2007, Cambridge
University Press.
 Digital Signal Processing Principles Algorithm & Applications, J.G. Proakis and D.G.
Manolakis, 2007, 4thEdn., Prentice Hall.

LAB: DIGITAL SIGNAL PROCESSING (60

Lectures)
At least 06 experiments from the following using Scilab. Introduction to Numerical
computation software Scilab be introduced in the lab.
1. Write a program to generate and plot the following sequences: (a) Unit sample
sequence(𝑛) , (b) unit step sequence 𝑢(𝑛), (c) ramp sequence 𝑟(𝑛) , (d) real
valued exponential sequence 𝑥𝑛 = (0.8n)𝑢(𝑛) for 0 ≤ 𝑛 ≤ 50.

2. Write a program to compute the convolution sum of a rectangle signal (or gate
function) with itself for N = 5

3. An LTI system is specified by the difference equation

(𝑛) = 0.8(𝑛– 1) + (𝑛)
(a) Determine (𝑒jw).
(b) Calculate and plot the steady state response 𝑦ss(𝑛) to
(𝑛) = cos (0.5𝜋𝑛)(𝑛)

4. Given a casual system

(𝑛) = 0.9(𝑛– 1) + (𝑛)
(a) Find (𝑧) and sketch its pole-zero plot
(b) Plot the frequency response|(𝑒jw)| and ∠𝐻(𝑒jw)

5. Design a digital filter to eliminate the lower frequency sinusoid of (𝑡) =sin 7𝑡 + sin200𝑡.
The sampling frequency is 𝑓s = 500 𝐻𝑧. Plot its pole zerodiagram, magnitude response, input
and output of the filter.
6. Let (𝑛) be a 4-point sequence:

Compute the DTFT 𝑋𝑒!" and plot its magnitude

104
(a) Compute and plot the 4 point DFT of (𝑛)
(b) Compute and plot the 8 point DFT of (𝑛) (by appending 4 zeros)
(c) Compute and plot the 16 point DFT of 𝑥𝑛 (by appending 12 zeros)

7. Let (𝑛) and ℎ(𝑛) be the two 4-point sequences,

Write a program to compute their linear convolution using circular convolution.

8. Using a rectangular window, design a FIR low-pass filter with a pass-band gain of unity,
cut off frequency of 1000 Hz and working at a sampling frequency of 5 KHz. Take the length
of the impulse response as 17.

9. Design an FIR filter to meet the following specifications:

passband edge 𝐹p = 2 𝐾𝐻𝑧
stopband edge 𝐹s = 5 𝐾𝐻𝑧
Passband attenuation 𝐴p = 2 𝑑𝐵
Stopband attenuation s = 42
Sampling frequency s = 20
10. The frequency response of a linear phase digital differentiator is given by
( jw) = -jτ |w| ≤
Using a Hamming window of length M = 21, design a digital FIR differentiator.
Plot the amplitude response.
Reference Books:
 Digital Signal Processing, Tarun Kumar Rawat, Oxford University Press, India.
 A Guide to MATLAB, B.R. Hunt, R.L. Lipsman, J.M. Rosenberg, 2014, 3rdEdn.,
Cambridge University Press
 Fundamentals of Digital Signal processing using MATLAB, R.J. Schilling and S.L.
Harris, 2005, Cengage Learning.
 Getting started with MATLAB, RudraPratap, 2010, Oxford University Press.
 Modern Digital Signal Processing includes Signals and Systems, Udayashankara, 2ndEdn.,
PHI Learning.
 Digital Signal Processing, S. K. Mitra, McGraw Hill, India.
 Fundamentals of signals and systems, P.D. Cha and J.I. Molinder, 2007, Cambridge
University Press.

105
106