Computer Science and Engineering

Transcription

B.E. (Computer Science and Engineering)
2011 Regulations (Revision 2013), Curriculum & Syllabi
BANNARI AMMAN INSTITUTE OF TECHNOLOGY
(An Autonomous Institution Affiliated to Anna University, Chennai
Approved by AICTE - Accredited by NBA New Delhi, NAAC with ‗A‘ Grade and ISO 9001:2008 Certified)
SATHYAMANGALAM – 638 401 Erode District Tamil Nadu
Phone : 04295 226000 Fax : 04295 226666
Web:www.bitsathy.ac.in E-mail : [email protected]
CONTENTS
Page No.
Regulations
I
PEOs
XI
POs
XI
Mapping of PEOs and POs
XII
Curriculum 2011
XIII
Syllabi (I- VIII semester)
1
Electives
165
Department of Computer Science and Engineering, Bannari Amman Institute of Technology | Regulation 2011|Revision 2013
Approved in 9th Academic Council Meeting
I
RULES AND REGULATIONS
B. E. /B. Tech. Programmes
(for the batches of candidates admitted in Academic year 2011-2012 and subsequently)
NOTE: The regulations hereunder are subject to amendments as may be decided by the Academic Council
of the Institute from time to time. Any or all such amendments will be effective from such date and to such
batches of students (including those already in the middle of the programme) as may be decided by the
Academic Council.
1.
Conditions for Admission
Candidates for admission to the B.E. / B.Tech. degree programmes will be required to satisfy the conditions
of admission thereto prescribed by the Anna University of Technology, Coimbatore and the Government of
Tamil Nadu.
2.
Duration of the Programme
(i)
For purposes of these regulations, the academic year will be normally spanning from June to May.
Each academic year will be divided into Two semesters, the odd semester normally spanning from
June to November and the even semester from December to May.
(ii)
Minimum Duration: The Programme will extend over a period of Four years with Eight semesters
(3 years with six semesters for lateral entry) leading to the Degree of Bachelor of Engineering
(B.E.) / Bachelor of Technology (B.Tech.) of the Anna University of Technology, Coimbatore.
(iii) Maximum Duration: The candidate shall be required to successfully complete all the requirements to
qualify for the award of B.E./B.Tech. degree programme within a maximum period of 7 years (6 years
for lateral entry), these periods reckoned from the commencement of the semester to which the
candidate was first admitted to the programme.
3.
Branches of Study
B. E. Programmes
I Aeronautical Engineering
II Civil Engineering
III Computer Science and Engineering
IV Electrical and Electronics Engineering
V Electronics and Communication Engineering
VI Electronics and Instrumentation Engineering
VII Mechanical Engineering
B. Tech. Programmes
I
II
III
IV
4.
Biotechnology
Information Technology
Textile Technology
Textile Technology (Fashion Technology)
Structure of Programmes
i.
The curriculum will consist of courses of study (Theory, Practical, Project) and Personality
Development Programme and syllabi as prescribed by the respective Boards of Studies from time to
time.
III
ii.
Based on the language proficiency in the first semester, the students will be divided into two
categories. The students who show good proficiency in English can opt for German / Japanese /
French / Hindi and the remaining students will study Advanced Communicative English in II
Semester.
iii. Every student will be required to opt for six electives from the list of electives. Under Choice
Based Credit System (CBCS), students can opt for any course as elective in consultation with
respective HoDs during VIth & VIIth Semesters from any branches of B.E / B.Tech. Programme
including electives pertaining to Physical Sciences. (not more than two from Physical Sciences)
iv. Candidates can also opt for one credit courses of 20 hours duration which will be offered at our
institution from industry / other institution / our institution on specialised topics. Candidates can
complete such one credit courses during the semesters III to VI as and when these courses are
offered by different departments. A candidate will also be permitted to register for the one credit
courses of other departments provided the candidate has fulfilled the necessary pre-requisites of the
course being offered subject to approval by both the Heads of Departments. Credits will be
indicated for these courses in the grade sheet, but it will not be considered for computing CGPA.
However, if a candidate wishes to avail exemption of electives V or elective VI of the VIII
Semester, he/she can do so by exercising his/her option in writing to the respective Head of the
Department during the beginning of the VIII Semester by following the equivalence norm that one
elective in the VIII Semester is equivalent to three one credit courses completed by the candidate
during the previous semesters.
v.
Every student will be required to undertake a suitable project work in Industry / Department during
VII semester in consultation with the Head of the Department and the faculty guide and submit the
project report Phase I and thereon submit the project report Phase II at the end of the VIII Semester
on dates announced by the Institute/Department.
vi. A candidate can register for Self-Study Elective(s) over and above the electives from any branch of
Engineering / Technology one per semester starting from V semester onwards provided he/she
maintains a Cumulative Grade Point Average(CGPA) of 7.5 or above till the previous semesters
with no standing arrears. Credits will be indicated for these courses in the grade sheet, but it will
not be considered for computing CGPA.
5.
Special Courses:
Students can opt for any one of the special courses as self-study in addition to the courses specified
in the curriculum in V, VI and VII semesters to get exposure in the recent research areas, under the
guidance of the faculty provided he/she maintenance a minimum CGPA of 7.5 till the previous
semester with no standing arrears. The credits obtained will be indicated in the grade sheet, but will
not be considered for CGPA.
6.
Certificate Courses:
Students can opt for any one of the certificate courses offered in the various departments in IV, V, VI
and VII semesters. A separate certificate will be issued on successful completion of the course.
7.
Requirements of Attendance and Progress
(I)
Minimum Attendance: A candidate will be deemed to have completed the requirements of study of
any semester only if:
a)
He / she has kept not less than 70% of attendance in each course and at least 80% of attendance on an
average in all the courses in that semester put together.
IV
[However, a candidate who secures less than 70% of attendance in any subject(s) will not be permitted to
appear for the examinations in those subject(s).He / she will be allowed to makeup the shortage of the
attendance immediately after that particular semester examinations, as prescribed by the subject faculty,
HoD and Principal. The candidate will be allowed to appear for the examination in the respective
subjects(s) at the next opportunity and such an appearance will be considered as second attempt
a candidate who has secured attendance between 70% & 79% in the current semester due to medical
reasons (hospitalization / accident/ specific illness) or due to participation in Institute/ University/ State/
National/ International level sports events with prior permission from the Principal shall be given
exemption from the prescribed attendance requirements and he/she shall be permitted to appear for the
current semester examinations.]
b) His / her academic progress and conduct have been satisfactory
(II)
Personality Development : Every candidate shall be required to undergo a minimum of 40 hours of
Personality Development Programme viz, NSS / NCC / YRC / YOGA / Sports and Games activities
during the first year failing which he/she will not be permitted to appear for the Semester - End
examinations of semester III onwards. Such candidates are permitted to appear for the Semester End examinations of semester III onwards only after completing the above mentioned requirement.
The record of attendance for Personality Development Programmes shall be maintained and sent to
the Academic Section at the end of 1st and 2nd Semesters.
National Cadet Corps (NCC) will have parades.
National Service Scheme (NSS) will have social service activities in the community and camps.
Youth Red Cross (YRC) society activities will include peace time activities like health and
hygiene, international friendship, awareness camps, etc.
Yoga will be practiced through Yoga master
Sports and Games will include preparation for Intra Institute and inter-collegiate sports events.
8.
Procedure for Completing Programme
(i)
A candidate will be permitted to proceed to the courses of study of any semester only, if he / she has
satisfied the requirements of attendance and progress in respect of the preceding semester and had
registered for the highest semester examination for which he / she was eligible to register. vide Clause 7.
In the case of project work, no candidate will be permitted to appear for the project work examination
unless he /she had submitted the project report not later than the prescribed date.
(ii)
A candidate who is required to repeat the study of any semester for want of attendance / unsatisfactory
progress and conduct or who desires to rejoin the course after a period of discontinuance or who upon his /
her own request is permitted by the authorities to repeat the study of any semester, may join the semester
for which he / she is eligible or permitted to rejoin, only at the time of its normal commencement for a
regular batch of candidates and after obtaining the approval from the Director of Technical Education and
Anna University of Technology, Coimbatore. No candidate will however be enrolled in more than one
semester at any time. In the case of repeaters, the earlier assessment in the repeated courses will be
disregarded.
9.
V
Assessment
(i)
The assessment will be based on the performance in the Semester - End examinations and / or continuous
assessment, carrying marks as specified in Clause 12.
(ii)
At the end of each semester, final examinations will normally be conducted during October/November and
during April / May of each year. Supplementary examinations may also be conducted at such times as
may be decided by the Institute.
(iii)
(a) Continuous Assessment Marks will be awarded on the basis of Continuous Evaluation made during
the semester as per the scheme given in Clause 12.
(Credit assignment: Each course is normally assigned with certain number of credits @ 1 credit per one
hour of lecture, 0.5 credit per one hour of tutorial/practical per week.)
(b) The letter grade and the grade point are awarded based on the percentage of marks secured by a
candidate in individual course as detailed below:
Range of Percentage of
Total Marks
90 to 100
80 to 89
70 to 79
60 to 69
55 to 59
50 to 54
0 to 49
Incomplete
Withdrawal
Absent
Letter
grade
S
A
B
C
D
E
RA
I
W
AB
Grade
Point (g)
10
9
8
7
6
5
0
0
0
0
RA − Reappearance in the course.
(A candidate who fails in the Semester - End Examination in any course(s) including
Project Work after having registered for the same, shall be awarded grade RA.)
I
− Incomplete (as per clause 7 (I) & (II)) and hence prevented from writing
Semester – End Examination.
W − Withdrawal from the Semester - End Examination
vide clause 11
AB − Absent
(A candidate who is eligible but fails to register and also fails to appear after
registration for the Semester - End examination will be awarded the grade AB.)
(c) After completion of the programme, the Cumulative Grade
Point Average (CGPA) from the I
Semester to VIII Semester (from III to VIII semester for lateral entry)is calculated using the
formula:
 g *C
C
n
CGPA
=
1
i
n
1
where
i
i
g i : Grade Point secured corresponding to the course.
VI
Ci : Credit allotted to the course.
n : Total number of courses for the entire programme.
10. (a). Passing Requirements and Provisions
i.
The minimum number of total credits to be earned by a candidate to qualify for the award of degree in
the various branches of study as prescribed by the respective Boards of Studies is given below:
Branch of Study
BE Programmes
Aeronautical Engineering
Civil Engineering
Computer Science and Engineering
Electrical and Electronics Engineering
Electronics and Communication Engineering
Electronics and Instrumentation Engineering
Mechanical Engineering
B Tech Programmes
B.Tech. Biotechnology
B.Tech. Information Technology
B.Tech. Textile Technology
B.Tech. Textile Technology (Fashion Technology)
Minimum Credits
entry at
lateral entry
first
at third
semester
semester
193
193
192
193
193
192
193
141
141
142
143
141
142
143
192
193
192
193
143
143
143
141
(Students Migration- Credit Accounting)
Normalisation of the credits will be carried out in consultation with the BoS chairman of the concerned
branch & approval by the chairman of Governing Council to the students migrating from other institutions
to Bannari Amman Institute of Technology
ii. A candidate who secures a minimum of 50% marks in the Semester - End Examinations of a course and
a minimum Grade point 5 with internal assessment and Semester - End Examination put together will be
declared to have passed that course.
iii. A candidate, who absents or withdraws or is disqualified to appear (as per clause 7 (I) and (II)) or
secures a letter grade RA (Grade Point 0) or less than 50% in the Semester - End Examination in any
course carrying Internal Assessment and Semester - End Examination Marks, will retain the already
earned Internal Assessment Marks for two subsequent attempts only of that course and thereafter he /
she will be solely assessed by Semester - End examination marks..
iv. A candidate shall be declared to have qualified for award of B.E/B.Tech. degree if
(i) He/she successfully completed the courses requirement (vide clause 7 ) and has passed all the prescribed
courses of study of the respective programme listed in clause 13 within the duration specified in
clause 2 and
(ii) No disciplinary action is pending against him/her.
VII
(b). Classification of degree
i. First Class with Distinction : A candidate who qualifies for the award of the Degree (vide clause 10
a (iv) ) having passed all the courses of study of all the eight semesters (six semesters for lateral entry
candidates) at the first opportunity, within eight consecutive semesters (six consecutive semesters for
lateral entry candidates) after the commencement of his /her study and securing a CGPA of 8.5 and
above (vide clause 9c) shall be declared to have passed in First Class with Distinction. For this
purpose the withdrawal from examination (vide clause 11) will not be construed as an opportunity for
appearance in the examination.
ii. First Class : A candidate who qualifies for the award of the Degree (vide clause 10 a (iv)) having
passed all the courses of study of all the eight semesters (six semesters for lateral entry candidates)
within maximum period of ten consecutive semesters (eight consecutive semesters for lateral entry
candidates) after the commencement of his /her study and securing a CGPA of 6.50 and above shall be
declared to have passed in First Class.
iii. Second Class : All other candidates who qualify for the award of the degree shall be declared to
have passed in Second Class.
11. Withdrawal from the Examination
(i)
A candidate may, for valid reasons, be granted permission by Principal to withdraw from appearing for
the examination in any course or courses of only one semester examination during the entire duration of
the degree programme. Also, only ONE application for withdrawal is permitted for that semester
examination in which withdrawal is sought.
(ii)
Withdrawal application shall be valid only if the candidate is otherwise eligible to write the examination
and if it is made prior to the commencement of the examination in that course or courses and also
recommended by the Head of the Department.
(iii)
Withdrawal shall not be construed as an opportunity for appearance in the examination for the
eligibility of a candidate for First Class with Distinction.
12. Scheme of Assessment
(a) (i) THEORY
Semester - End Examination
Internal Assessment
: 50 Marks
: 50 Marks
Distribution of marks for Internal Assessment:
Assignments
Test 1
Test 2
Model Examination
10
10
10
20
---50
---An optional test will be conducted in the respective test portion after the second test, to the students who opt,
on valid reasons
(ii) THEORY - ONE CREDIT COURSE
TOTAL 100 Marks
Internal Assessment
: 50 Marks
: 50 Marks
Distribution of Marks for Internal Assessment:
Assignment (Two Assignments)
10
Test I
15
Test II
15
Viva voce
10
---50
---(b) (i) PRACTICAL (Without Mini Project)
: 50 Marks
Internal Assessment
: 50 Marks
Distribution of Marks for Internal Assessment
Preparation
10
Observation & Results
15
Record
10
Model Examination & Viva-Voce
15
---50
---(ii) Practical (With Mini Project)
Internal Assessment
: 50 Marks
: 50 Marks
Distribution of Marks for Internal Assessment
Preparation
05
10
Record
10
Mini Project Report
10
Model Examination & Viva-Voce
15
---50
---(c) THEORY WITH LABORATORY COMPONENT
Semester - End Theory Examination
Internal Assessment
Theory
Test I
Test II
Model (Theory)
Practical
Model Practical
: 50 Marks
: 50 Marks
10.0
10.0
15.0
5.0
10.0
----50.0
-----
VIII
(d) SPECIAL COURSES
Internal Assessment: 100 Marks
State of Art
Preparation
Presentation
Discussion & Conclusion
Viva - voce
(e) SELF STUDY ELECTIVES
Internal Assessment
Assignments (minimum 2 Nos)
Test I
Test II
Model
20
15
10
15
40
---100
---: 50 Marks
: 50 Marks
15
10
10
15
---50
----
(f) LANGUAGE ELECTIVES
Test 1
Test 2
Listening Test
Speaking Test
Final Examination
(g) PROJECT WORK
i) PHASE – I
Internal Assessment
: 15 Marks
: 15 Marks
: 10 Marks
: 10 Marks
: 50 Marks
-------: 100 Marks
--------
: 50 Marks
: 50 Marks
Distribution of Marks for Internal assessment
Literature survey (one seminar)
10
Problem formulation
10
Approach (one seminar)
15
Progress (one seminar)
15
-----Total
50
------
IX
X
Distribution of Marks for Semester - End Examination
Report Preparation & Presentation
25
Viva-Voce
25
----50
----ii) PHASE – II
Internal Assessment
: 100 Marks
: 100 Marks
Distribution of Marks for Internal assessment
Continuation of Approach & Progress
(Two seminars – 2x20)
Findings, Discussion & Conclusion
(Two seminars - 2x30)
Total
40
60
----100
-----
Distribution of Marks for Semester - End Examination
Report Preparation & Presentation
Viva Voce
50
50
----100
-----
(h) TECHNICAL SEMINAR
Internal Assessment: 100 Marks
Two Seminars (2 X 50)
Distribution of Marks Each Seminar
Report Evaluation
Presentation
Viva – voce
100
10
20
20
---50
---(A team of 2 members and HOD constituted by the Principal, will evaluate the seminar report and conduct
the viva-voce for assessment.)
XI
PROGRAMME EDUCATIONAL OBJECTIVE(S) (PEOs)
I.
Provide engineering insight to problem solving to succeed in Technical Profession through precise education
and to prepare students to excel in postgraduate programs.
II. To provide students with fundamental knowledge and ability to expertise in Computer Science and
Engineering.
III. Prepare students with good scientific and engineering breadth so as to analyze, design and create products,
solutions to problems in the area of Computer Science and Engineering.
IV. To inculcate in students professional, effective communication skills, team work, multidisciplinary approach
and an ability to relate engineering issues to broader social context.
V. Prepare students to be aware of excellence, leadership, written ethical codes and guidelines and lifelong
learning needed for successful professional career by providing them with an excellent academic
environment.
PROGRAM OUTCOME(S) (POs)
Graduating student of computer science and engineering programme will be able to
a)
Apply basic principles and practices of computing grounded in mathematics and science to successfully
complete software related projects to meet customer business Objective(s) and/or productively engage in
research.
b) Apply their knowledge and skills to succeed in a computer science career and/or obtain an advanced degree.
c)
Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize
computing works under given constraints.
d) Demonstrate problem solving and design skills including the ability to formulate problems and their
solutions, think creatively and communicate effectively.
e)
Develop software as per the appropriate software life cycle model.
f)
Organize and maintain the information of an organization.
g) Exhibit teamwork, communication, and interpersonal skills which enable them to work effectively with
interdisciplinary teams.
h) Provide an excellent education experience through the incorporation of current pedagogical techniques,
understanding of contemporary trends in research and technology, and hands-on laboratory experiences that
enhance the educational experience.
i)
Demonstrate an ability to engage in life-long learning.
j)
Function ethically and responsibly, and to remain informed and involved as full participants in our
profession and our society.
XII
MAPPING OF PEOs AND POs
Programme Educational Objective(s)
Program Outcome(s)
Provide engineering insight to problem solving to succeed in
PEO :
I
Technical Profession through precise education and to
(a) and (b)
prepare students to excel in postgraduate programs.
PEO :
II
To provide students with fundamental knowledge and ability
to expertise in Computer Science and Engineering
(c) and (d)
Prepare students with good scientific and engineering breadth
PEO :
III
so as to analyze, design and create products, solutions to
(e) and (f)
problems in the area of Computer Science and Engineering.
To
PEO :
IV
inculcate
in
students
professional,
effective
communication skills, team work, multidisciplinary approach
and an ability to relate engineering issues to broader social
(g) and (h)
context.
Prepare students to be aware of excellence, leadership,
written ethical codes and guidelines and lifelong learning
PEO :
V
needed for successful professional career by providing them
with an excellent academic environment.
(i) and (j)
XIII
B. E. COMPUTER SCIENCE AND ENGINEERING
(Minimum credits to be earned: 192)
First Semester
Code No.
11O101
11O102
11O103
Course
Engineering Mathematics I*
Engineering Physics*
*
Engineering Chemistry

11O105
11Z106
11Z107
Language Elective-I
Basics of Electrical and Electronics Engineering+
Computational Problem Solving
Computational Problem Solving Laboratory
11O108
Engineering Physics Laboratory#
11O109
Engineering Chemistry Laboratory#
PEOs
I
POs
a, b
L
3
T
1
P
0
C
3.5
I
a, b
3
0
0
3.0
I
a, b
3
0
0
3.0
IV
g, h
3
0
0
3.0
III
I,II,III
I,II,III
e, f
a, b, c, d
a, b, c, d
4
3
0
0
1
0
0
0
3
4.0
3.5
1.5
I
I
a, b
a, b
0
0
0
0
2
2
1.0
1.0
19
2
7
23.5
Total
Second Semester
Code No.
Course
11O201
Engineering Mathematics II
11O202
Environmental Science *
11Z204
Language Elective-II
Materials Science1
*

**
PEOs
I
POs
a, b
L
3
T
1
P
0
C
3.5
III
e, f
3
0
0
3.0
IV,V
g, h, i
3
1
0
3.5
III
e, f
3
0
0
3.0
f, g
c, d
c, d
f, g
4
4
0
2
0
0
0
0
0
0
3
2
4.0
4.0
1.5
3.0
f, g
0
0
2
1.0
Total
22
2
7
26.5
11O205
11Z206
11Z207
Basics of Civil and Mechanical Engineering
Structured Programming
Structured Programming Laboratory
11O208
Engineering Graphics$
III,IV
II
II
III,IV
11Z209
Workshop Practice
III,IV
*

+
#
1
**
$
Common for all branches of B.E./B.Tech
Common for all branches of B.E./B.Tech (continuous assessment)
Common for all branches of B.E./B.Tech except ECE,EEE & EIE Common for AE, CSE, FT & IT (I Semester); CE, ME, BT & TT (II Semester)
Common for AE, CE, CSE, ECE & EIE (I Semester); EEE, ME, BT, FT, IT & TT (II Semester)
Common to CSE EEE,ECE,E&I and IT
Common for all branches of B.E./B.Tech except AE & CE , ECE, EIE, ME, BT & TT (I Semester);CSE, EEE, FT, IT & TT (II Semester)
Common for EEE, ME, BT, FT, IT & TT (I Semester); AE, CE, CSE, ECE & EIE (II Semester)
XIV
Third Semester
Code No.
11Z301
Course
Numerical and Statistical methods
PEOs
POs
L
T
P
C
I,III
a, b, e, f
3
1
0
3.5
c, d
3
1
0
3.5
11Z302
System Software
II
11Z303
Object Oriented Programming
II
c, d
3
0
0
3.0
11Z304
Data Structures
II
c, d
3
1
0
3.5
c, d, e, f
3
1
0
3.5
11Z305
Digital System Design
II,III
11Z306
Software Engineering
II,IV
c, d, f
3
1
0
3.5
11Z307
Object Oriented Programming Laboratory
II
c, d
0
0
3
1.5
11Z308
Data Structures Laboratory
II
c, d
0
0
3
1.5
11Z309
Digital System Design Laboratory
II,III
c, d, e, f
0
0
3
1.5
18
5
9
25.0
Total
Fourth Semester
Code No.
Course
PEOs
POs
L
T
P
C
a, b, c, d
3
1
0
3.5
11Z401
Discrete Mathematics
I,II
11Z402
Computer Architecture
III
e, f
3
1
0
3.5
11Z403
Concurrent Programming
II
c, d
3
0
0
3.0
11Z404
Operating Systems
II
a, c, d
3
1
0
3.5
11Z405
Database Management System
II,III
c, d, e, f
3
0
0
3.0
c, d
3
1
0
3.5
0
0
3
1.5
11Z406
Design and Analysis of Algorithms
II
11Z407
System Software and Operating System
Laboratory
II
c, d
11Z408
Concurrent Programming Laboratory
II
c, d
0
0
3
1.5
11Z409
Database Management System Laboratory
II,III
c, d, e, f
0
0
3
1.5
18
4
9
24.5
Total
XV
2
Fifth Semester
Code No.
Course
PEOs
POs
L
T
P
C
11Z501
Mobile Communications
III
e, f
3
1
0
3.5
11Z502
Graphics and Multimedia
II
c, d
3
0
0
3.0
11Z503
Microprocessors and Microcontroller
III
e, f
3
0
0
3.0
I,II,III
a, c, d
3
1
0
3.5
II
c, d
3
0
0
3.0
-
-
-
3.0
11Z504
Theory of Computation
11Z505
Computer Networks
Elective I
II, III
c, d
0
0
3
1.5
Microprocessors and Microcontroller Laboratory
III
e, f
0
0
3
1.5
11Z509
Computer Networks Laboratory
II
c, d
0
0
3
1.5
11Z510
Technical Seminar - I
IV,V
g, h, i, j
-
-
-
1.0
-
-
-
24.52
11Z507
Graphics and Multimedia Laboratory
11Z508
Total
Sixth Semester
Code No.
Course
PEOs
POs
L
T
P
C
11Z601
Web Technology
II
c, d
3
0
0
3.0
11Z602
Compiler Design
II,III
a,b,c,d
3
1
0
3.5
11Z603
Digital Image Processing
III
b, c
3
0
0
3.0
c, d, e
3
0
1
3.5
3
1
0
3.5
11Z604
.NET Technologies
II,III
11Z605
Cryptography and Network Security
II,III
c, d, e
-
-
-
3.0
c, d
0
0
3
1.5
Elective II
11Z607
Web Technology Laboratory
II
11Z608
Compiler Design Laboratory
II,III
c, d, e, f
0
0
3
1.5
11Z609
Technical Seminar - II
IV.V
g, h, i, j
-
-
-
1.0
-
-
-
23.52
Total

Minimum credits to be earned. The maximum number of credits as well as the total number of L T P hours may vary depending upon the
electives offered.
XVI
Seventh Semester
Code No.
Course
*
PEOs
POs
L
T
P
C
V
i, j
3
0
0
3.0
11O701
Engineering Economics
11Z702
Distributed Computing Systems
II,III
c, d, e, f
3
1
0
3.5
11Z703
Object Oriented Analysis and Design
II,III
c, d, e, f
3
0
0
3.0
11Z704
Business Component Technology
II,III
c, d, e, h
3
0
0
3.0
Elective III
-
-
-
3.0
Elective IV
-
-
-
3.0
11Z707
Case tools Laboratory
II,III
c, d, e, f
0
0
3
1.5
11Z708
Business Component Technology Laboratory
II,III
c, d, e, h
0
0
3
1.5
11Z709
Project Work Phase I
II,III,IV
c, d, e, f,
g, h
-
-
-
3.0
Total
-
-
-
24.5
Eighth Semester
PEOs
POs
L
T
P
C
IV,V
g, h, i, j
2
0
0
2.0
Elective V
-
-
-
3.0
Elective VI
-
-
-
3.0
c, d, e, f,
g, h
-
-
-
12.0
Total
-
-
-
20.02
Code No.
11O801
11Z804

Course
Professional Ethics*
Project Work Phase II
II,III,IV
Minimum credits to be earned. The maximum number of credits as well as the total number of L T P hours may vary depending upon the
elective courses opted.
*
Common for all branches of B.E./B.Tech
ELECTIVES
LANGUAGE ELECTIVES
Language Elective I
L
T
P
C
11O10B
Basic English I
3
0
0
3.0
11O10C
Communicative English
3
0
0
3.0
Language Elective II
11O20B
Basic English II
3
1
0
3.5
11O20C
Advanced Communicative English
3
1
0
3.5
11O20G
German
3
1
0
3.5
11O20J
Japanese
3
1
0
3.5
11O20F
French
3
1
0
3.5
11O20H
Hindi
3
1
0
3.5
DISCIPLINE ELECTIVES
11Z001
Advanced Computer Architecture
3
0
0
3.0
11Z002
Parallel Processing
3
0
0
3.0
11Z003
Grid and utility computing
3
0
0
3.0
11Z004
Embedded Systems
3
0
0
3.0
11Z005
Real Time Operating Systems
3
0
0
3.0
11Z006
Human Computer Interaction
3
0
0
3.0
11Z007
Machine learning techniques
3
0
0
3.0
11Z008
XML and Web Services
3
0
0
3.0
11Z009
TCP/IP
3
0
0
3.0
11Z010
Visual Programming Using VC++
3
0
0
3.0
11Z011
Unix Internals
3
0
0
3.0
11Z012
Internet Security
3
0
0
3.0
XVII
11Z013
Free and Open Source Software
3
0
0
3.0
11Z014
Management Information Systems
3
0
0
3.0
11Z015
Software Project Management
3
0
0
3.0
11Z016
Software testing and Quality Assurance
3
0
0
3.0
11Z017
E - Commerce
3
0
0
3.0
11Z018
Enterprise Computing
3
0
0
3.0
11Z019
Soft Computing
3
0
0
3.0
11Z020
Artificial Intelligence
3
0
0
3.0
11Z021
Data warehousing and Data mining
3
0
0
3.0
11Z022
Probability and Queuing Theory
3
0
0
3.0
11Z023
Cloud Architectures and Services
3
0
0
3.0
11Z024
Information Storage Management
3
0
0
3.0
11Z025
Web Services and Service Oriented Architecture
3
0
0
3.0
PHYSICS ELECTIVES
11O0PA
Nano Science and Technology
3
0
0
3.0
11O0PB
Laser Technology
3
0
0
3.0
11O0PC
Electro-Optic Materials
3
0
0
3.0
11O0PD
Vacuum Science and Technology
3
0
0
3.0
11O0PE
Semi Conducting Materials and Devices
3
0
0
3.0
CHEMISTRY ELECTIVES
11O0YA
Polymer Chemistry and Processing
3
0
0
3.0
11O0YB
Energy Storing Devices and Fuel Cells
3
0
0
3.0
11O0YC
Chemistry of Nano Materials
3
0
0
3.0
11O0YD
Corrosion Science and Engineering
3
0
0
3.0
3
0
0
3.0
ENTREPRENEURSHIP ELECTIVES$
11O001
Entrepreneurship Development I
$ Entrepreneurship Development electives will be offered only during V and VI semesters.
XVIII
11O002
Entrepreneurship Development II€
3
0
0
3.0
ONE CREDIT COURSES
11Z0XA
Cloud Computing
-
-
-
1.0
11Z0XB
Quantum Computing
-
-
-
1.0
11Z0XC
Extreme Programming
-
-
-
1.0
11Z0XD
Mobile Operating Systems
-
-
-
1.0
11Z0XE
Green Computing
-
-
-
1.0
11Z0XF
Internet Marketing
-
-
-
1.0
11Z0XG
Advanced Big data Analytics
-
-
-
1.0
11Z0XH
Matlab for Engineers
-
-
-
1.0
11Z0XI
ASP .NET
-
-
-
1.0
11Z0XJ
PYTHON Programming
-
-
-
1.0
SPECIAL COURSES
€

11Z0RA
Semantic Web
-
-
-
3.0
11Z0RB
Search Engine Optimization
-
-
-
3.0
11Z0RC
J2ME
-
-
-
3.0
Prerequisite for this course is Entrepreneurship Development I.
Classes to be conducted for 20 hours duration.
XIX
1
11O101 ENGINEERING MATHEMATICS-I
(Common to all Branches)
3 1 0 3.5
Objective(s)
 Acquire knowledge in matrix theory a part of linear algebra which has wider application in engineering
problems.
 To make the student knowledgeable in the area of infinite series and their convergence so that the students
will be familiar with infinite series approximations for solutions arising in mathematical modelling and to
solve first and higher order differential equations and to use Laplace transform to solve differential equations
using only algebraic operations.
Programme Outcome(s)
k) Apply basic principles and practices of computing grounded in mathematics and science to successfully
research.
i.
An ability to apply the basic concepts of mathematics to solve the engineering problems
ii.
An ability to demonstrate their ability to solve technical problems via technical approaches, self
study, team work and life long learning approaches.
iii.
An ability to become equipped with the knowledge and analytical skills necessary for entry-level
placement.
Course Outcome(s)
1. Acquire more knowledge in basic concept of engineering mathematics.
2. Improvement in problem evaluation technique.
3. Choose an appropriate method to solve a practical problem.
Assessment pattern
1
Bloom’s
Taxonomy
(New Version)
Remember
2
3
4
5
Understand
Apply
Analyze/ Evaluate
Create
S. No
Total
Test I3
Test II3
Model
Examination3
20
40
20
40
20
40
End Semester
Examination
Examination
20
40
30
10
00
30
10
00
30
10
00
30
10
00
100
100
100
100
Remember
1 State Cayley Hamilton theorem.
2 Define Eigen value and Eigen vectors of the matrix.
3. Write the definition of Convergence & Divergence of the sequence.
4. State the necessary & sufficient condition for the differential equation to be exact.
5. Write the Radius of curvature in cartesian coordinates.
6. Define Evolute,Centre of curvature & Circle of curvature.
7. Write the Leibneitz‘s form of linear equation in y and in x.
3
The marks secured in Test I and II will be converted to 20 and model examination will be converted to 20. The
remaining 10 marks will be calculated based on assignments. Accordingly, internal assessment will be calculated for
50 marks.
8. Write the general form of Euler‘s & Legendre linear differential equation.
9. Define Convolution of two functions.
10. State the existence conditions for Laplace transforms.
Understand
 2 2 0


1. Find the eigen values and eigen vectors of A =  3 5 1 
 8 1 3


2. Find the radius of Curvature at ( a,0) on the curve xy2 = a3 – x3
3. Find the Circle of Curvature of the parabola Y2 = 12x at the point ( 3.6)
4. Solve cos2 x
dy
+ y = tanx
dx
5 Solve y (2xy + ex ) dx = ex dy.
6. Find evolute of the parabola x2 =4ay
7. Solve ( D2 + .4 ) y = x2
8 Solve ( D – 3 )2 y = x e-2x
9. Find the Laplace transform of e2t sin3t
10. Find the laplace transform of e2t cos4t
Apply
3 1 1 


1. Diagonalise the matrix A= 1 3  1 by means of an orthogonal transformation


1  1 3 
1 3 7


2.Use Cayley Hamilton theorem find inverse of A =  4 2 3  .
1 2 1


3 3.4 3.4.5
3. Test the convergence of the series
+
+
+ .....
4 4.6 4.6.8
1
4. Use Convolution theorem find inverse Laplace transform of
( s  1)( s  2)
5. Use method of variation of parameters ,solve (D2+4)y = tan 2x
6. Use Laplace transform solve ( D2 + 4D + 13) = e-t sint Y = 0 and DY = 0 at t = 0
7. Test for convergence of the series
x
1 x
8. Use Bernoulli1 s equation solve xy ( 1 + xy2 )
dy
=1
dx
dy
 y  e 2 x ( x  1) 2
dx
 t
e (sin 3t )
dt
10. Use Laplace Transform to evaluate, 
t
0
9. UseLeibnitz‘s linear equation
( x  1)
2
3
Analyze / Evaluate
2
2
2
1. Reduce the quadratic form 8x 1 +7x 2 +3x 3 -12x 1 x 2 -8x 2 x 3 +4x 3 x 1 to canonical form by
orthogonal transformation and find the rank, signature, index and the nature.
2
2
2
2.Reduce 3x +5y +3z -2yz+2zx-2xy to its canonical form through an orthogononal transformation and
find the rank, signature, index and the nature
3.Find the evolute of the cycloid : x = a(  +sin  ) ; y = a(1 - cos  )
4.Find the circle of curvature of
a a
x  y   at  , 
4 4
5. Discuss the convergence of the series 1 / 3.4.5 + 2 / 4.5.6 + 3 / 5.6.7 +…...
 2 1 1 


6.Verify Cayley-Hamilton theorem for A=  1 2  1 . Hence find its inverse.


 1  1 2 
7.Using the method of variation of parameters, solve (D 2 + a 2)y = tan ax.
8. Solve [x2D2 + 4xD + 2]y = x2 +
1
.
x2
9. Find the envelope of the straight line
x y
  1 , here a and b are connected by the relation a2 + b2 = c2
a b
10. Find the Laplace transform of the following functions
(1). (t + 2t2)2 (2) sin2 2t (3). sin 3t cos 2t (4). Cos (at+b)
Unit I
Matrices
Characteristic equation - eigen values and eigen vectors of a real matrix - properties of eigen values - Cayley–
Hamilton theorem- Reduction of a real matrix to a diagonal form- Orthogonal matrices- Quadratic form -Reduction
of a quadratic form to a canonical form by orthogonal transformation-application to engineering problems.
9 Hours
Unit II
Series and Differential Calculus
Series- Convergences and divergence- Comparison test– Ratio test - Curvature in Cartesian Coordinates- Centre and
radius of curvature - Circle of curvature – Evolutes –Envelopes – application to engineering problems.
9 Hours
Unit III
Differential Equation of First Order
Linear differential equation of first order-exact-integrating factor- Euler‘s equation-Bernoulli‘s-modeling-application
to engineering problems.
9 Hours
Unit IV
Differential Equations of Higher Order
Linear differential equations of second and higher order with constant and variablecoefficients - Cauchy‘s and
Legendre‘s linear differential equations - method of variation of parameters –application of engineering problems.
9 Hours
4
Unit V
Laplace Transforms : Laplace Transform- conditions for existence(statement only) -Transforms of standard
functions – properties(statement only) - Transforms of derivatives and integrals - Initial and Final value
theorems(statement only) - Periodic functions - Inverse transforms - Convolution theorems(statement only) Applications of Laplace transforms for solving the ordinary differential equations up to second order with constant
coefficients-application to engineering problems.
9 Hours
Total: 45+15=60 Hours
Textbook(s):
1. B S Grewal ., Higher Engineering Mathematics , Khanna Publications , New Delhi 2000 .
2. K A Lakshminarayanan ,K.Megalai, P.Geetha and D.Jayanthi ,Mathematics for Engineers, Volume I, Vikas
Publishing House, New Delhi. 2008.
Reference Books:
1. P. Kandasamy, K. Gunavathy and K. Thilagavathy, Engineering Mathematics , Volume I , S.
Chand & Co., New Delhi-2009.
2.. T. Veerarajan , Engineering Mathematics , Tata McGraw Hill Publications , New Delhi 2008.
3. E. Kreyszig, .Advanced Engineering Mathematics , 8th Edition , John Wiley & Sons, Inc,
Singapore 2008.
4. C. RayWylie and C. Louis . Barrett, Advanced Engineering Mathematics, Tata McGraw-Hill
Publishing Company Ltd, 2003.
11O102 ENGINEERING PHYSICS
(Common to all branches)
3 0 0 3.0
Course Objective(s)
 To impart fundamental knowledge in the areas of acoustics, crystallography and new engineering materials.
 To apply fundamental knowledge in the area of LASERS and fiber optics
 To use the principles of quantum physics in the respective fields
 At the end of the course the students are familiar with the basic principles and applications of physics in
various fields.
Program Outcome(s)
a. An ability to apply knowledge of mathematics, science, computer programming and engineering.
Course Outcome(s)
At the end of the course, the student will be able to


learn the basic concepts of acoustics and ultrasonics.
develop applications for real world problems such as designing acoustic buildings and study the basics and
applications of crystal physics.
 analyze the construction, working and applications of laser.
 gain knowledge in practical applications of fiber optics.
 expand their knowledge towards new engineering materials such as metallic glasses, ceramics, shape
memory alloys and nanomaterials.
5
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s
Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test 1
Test 2
Model
Examination
25
25
20
20
10
100
25
25
20
20
10
100
20
25
20
20
15
100
End
Semester
Examination
Examination
20
25
20
20
15
100
Remember
1. Give the classifications of sound.
2. Write a note on loudness.
3. Define decibel.
4. What is meant by reverberation time?
5. Define magnetostriction effect.
6. Give the classification of crystals.
7. Define Miller indices.
8. Define lattice and unit cells.
9. Mention the applications of X-ray diffraction.
10. Write a short note on air wedge.
11. List the applications of air wedge method.
12. Give the applications of LASER.
13. Give the classification of laser based on refractive index.
14. Write a note on holography.
15. Draw the block diagram of fiber optic communication system.
16. Define the term Compton effect.
17. What is the physical significance of wave function?
18. What are metallic glasses?
19. Write a note on shape memory alloys.
20. Mention the merits of nano materials.
21. List the advantages of ceramic materials.
Understand
1. How Weber-Fechner law is formulated?
2. Explain the characteristics of loudness.
3. Elucidate the significance of timber.
4. How the magnetostriction effect is utilized in the production of ultrasonic waves?
5. What is the importance of reverberation time in the construction of building?
6. Give the importance of lattice and lattice planes in a crystal.
7. How do you measure the d-spacing?
8. How do you calculate the packing factor of BCC structure?
9. How air wedge is used in determining the flatness of a thin plate?
10. Give the importance of optical pumping in the production of LASER.
11. What are the various steps involved in holography?

The marks secured in Test I and II will be converted to 20 and Model Examination will be converted to 20. The
remaining 10 marks will be calculated based on assignments. Accordingly internal assessment will be calculated for
50 marks.
12.
13.
14.
15.
16.
17.
Apply
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
6
How can you derive the acceptance angle in fiber?
Why the wave function is called as probability density?
Why the wave function is finite inside the potential well?
Why the particle is not escaping through the walls of the well?
How ceramic materials are prepared by slip casting technique?
What are the advantages of nano materials?
Discuss the factors affecting the acoustics of buildings.
Ultrasonic waves are electromagnetic waves. Justify.
Sketch the circuit diagram for piezo electric oscillator.
How can you determine the velocity of ultrasonic by acoustic grating?
Explain how Miller indices are used in crystal structures?
How do you calculate the packing factor for FCC structure?
Draw the crystal lattice for (110) plane.
Why does air wedge occur only in the flat glass plates?
Explain the various steps involved in holography techniques.
Discuss the particle in a one dimensional box by considering infinite length of well.
Explain how shape memory alloy change its shape?
How can you prepare the nano materials synthesized by sol gel technique?
Analyze/ Evaluate
1. Compare magnetostriction and piezo-electric method in the production of ultrasonic waves.
2. Differentiate musical sound and noises.
3. Compare the packing factor of BCC, FCC and HCP structures.
4. Distinguish between photography and holography.
5. Compare slip casting and isostatic pressing.
Unit I
Acoustics and Ultrasonics
Acoustics: Classification of sound – characteristics of musical sound – loudness – Weber – Fechner law – decibel –
absorption coefficient – reverberation – reverberation time – Sabine‘s formula (growth & decay). Factors affecting
acoustics of buildings and their remedies. Ultrasonics: Ultrasonic production – magnetostriction - piezo electric
methods. Applications: Determination of velocity of ultrasonic waves (acoustic grating) - SONAR.
9 Hours
The phenomenon of cavitation.
Unit II
Crystallography
Crystal Physics: Lattice – unit cell – Bravais lattices – lattice planes – Miller indices – ‗d‘ spacing in cubic lattice –
calculation of number of atoms per unit cell – atomic radius – coordination number – packing factor for SC, BCC,
FCC and HCP structures - X-ray Diffraction: Laue‘s method – powder crystal method.
9 Hours
Crystal defects.
Unit III
Waveoptics
Interference: Air wedge – theory – uses – testing of flat surfaces – thickness of a thin wire. LASER: Types of lasers –
Nd – YAG laser – CO2 laser – semiconductor laser (homojunction). Applications: Holography – construction –
reconstruction – uses. Fiber Optics: Principle of light transmission through fiber - expression for acceptance angle
and numerical aperture - types of optical fibers (refractive Index profile, mode) fiber optic communication system
(block diagram only)
9 Hours
Laser gas sensors .
7
Unit IV
Modern Physics
Quantum Physics: Development of quantum theory – de Broglie wavelength – Schrödinger‘s wave equation – time
dependent – time independent wave equations – physical significance – applications – particle in a box (1d). X-rays:
Scattering of X-rays – Compton Effect – theory and experimental verification.
9 Hours
Degenerate and non degenerate.
Unit V
New Engineering Materials
Metallic glasses: Manufacturing – properties – uses. Shape Memory Alloys: Working principle – shape memory
effect – applications. Nanomaterials: Preparation method – sol gel technique – mechanical – magnetic characteristics
– uses. Ceramics: Manufacturing methods – slip casting – isostatic pressing – thermal and electrical properties - uses.
9 Hours
Carbon nano tubes and applications.
Total: 45 Hours
Textbook(s)
1. V. Rajendran, Engineering Physics, Tata McGraw-Hill, New Delhi, 2011.
2. P. K. Palanisami, Physics for Engineers, Vol. 1, Scitech Pub. (India) Pvt. Ltd., Chennai, 2002.
Reference(s)
1. M. N. Avadhanulu and P. G. Kshirsagar, A Textbook(s) of Engineering Physics, S. Chand & Company Ltd.,
New Delhi, 2005
2. S. O. Pillai, Solid State Physics, New Age International Publication, New Delhi, 2006.
3. V. Rajendran and A. Marikani, Physics I, TMH, New Delhi, 2004.
4. Arthur Beiser, Concepts of Modern Physics, TMH, 2008.
5. R. K. Gaur and S. L. Gupta, Engineering Physics, Dhanpat Rai Publishers, New Delhi, 2006
11O103 ENGINEERING CHEMISTRY
3 0 0 3.0
Course Objective(s):
 Imparting knowledge on the principles of water characterization, treatment methods and industrial
applications.
 Understanding the principles and application of electrochemistry and corrosion science.
 Basic information and application of polymer chemistry, nanotechnology and analytical techniques.
Program Outcome(s)
a) An ability to apply knowledge of mathematics, science, computer programming and engineering.
Course Outcome(s)
 differentiate hard and soft water, understand the disadvantages of using hard water domestically and
industrially, select and apply suitable treatments.
 gain an understanding of oxidation and reduction reactions as they relate to engineering applications such as
batteries and electroplating.
 comment on design of a metallic part which shows resistance to corrosion and analyze losses incurred due to
corrosion.
 select a polymer by considering their engineering requirement and identify the importance of nanomaterials.
 carry out chemical analysis using various analytical instruments.
8
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
Test II
20
20
30
20
10
100
20
20
30
20
10
100
Model
Examinatio
n
10
20
30
20
20
100
End Semester
Examination
Examination
10
20
30
20
20
100
Remember
1. Distinguish between alkaline and non alkaline hardness.
2. What is meant by priming? How it is prevented?
3. What is meant by caustic embrittlement?
4. What is the role of calgon conditioning in water treatment?
5. What is break point chlorination?
6. Write the significances of EMF series.
7. Define single electrode potential of an electrode.
8. Differentiate between electrochemical and electrolytic cells.
9. What are the advantages of H2-O2 fuel cell?
10. What are reference electrodes?
11. Mention the various factors influencing the rate of corrosion.
12. State Pilling-Bedworth rule.
13. What are the constituents of water repellant paints?
14. What is pitting corrosion?
15. Write any four applications of galvanic series.
16. Differentiate between nanocluster and nanocrystal.
17. List the monomers of nylon -6 and nylon-11.
18. Define functionality of a monomer.
19. What are the monomers of epoxy resin?
20. Differentiate between addition and condensation polymers.
21. What are auxochromes? Give examples.
22. Give any two applications of IR spectroscopy.
23. State Beer-Lambert‘s law.
24. Write any two applications of flame photometry.
25. What are the limitations of Beer-Lambert‘s law?
Understand
1. Soft water is not demineralized water whereas demineralized water is soft water- Justify.
2. Why sodium carbonate conditioning is not advisable for high pressure boilers?
3. Boiling cannot give protection to water for all time – Reason out.

The marks secured in the Test I and II will be converted to 20 and Model Examination will be converted to 20. The
50 marks
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
Apply
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
9
What are the significances of RO method of water treatment?
Compare reversible and irreversible cells?
Reason out why do the properties of materials change at nanoscale?
Why calomel electrode is called as secondary reference electrode?
A steel screw in a brass marine hardware corrodes. Why?
What is the action of brine solution on iron rod?
Why magnesium element is coupled with underground pipe line?
Which is the easier way to control corrosion?
Lithium battery is the cell of future- Justify.
Iron corrodes at a faster rate than aluminium- Give reason.
Differentiate between electro and elctroless platting.
How thermoplastics differ from thermosetting plastics?
TEFLON is superior to other addition polymers-Justify.
Write any two advantages of free radical polymerization.
Calculate the degree of freedom of water molecule.
Differentiate between AAS and flame photometry.
What is the role of thiocyanide solution in the estimation of iron by colorimetry?
A water sample contains 204 mgs of CaSO4 and 73 mgs of Mg(HCO3)2 per litre. Calculate the total hardness
in terms of CaCO3 equivalence.
100 ml of sample water has hardness equivalent to 12.5ml of 0.08N MgSO4. Calculate hardness in ppm.
What is the single electrode potential of a half cell of zinc electrode dipped in a 0.01M ZnSO4 solution at
250C? E0Zn/Zn2+ = 0.763 V, R=8.314 JK-1Mol-1, F= 96500 Coulombs.
Calculate the reduction potential of Cu2+/Cu=0.5M at 250C. E0Cu2+/ Cu= +0.337V.
Mention the type of corrosion that takes place when a metal area is covered with water.
Bolt and nut made of the same metal is preferred in practice. Why?
Caustic embrittlement is stress corrosion- Justify.
Metals which are nearer in electrochemical series is preferred in practice. Why?
What are the disadvantages of NICAD battery?
What are the requirements of a good paint?
What information can you get from DP?
What is degree of polymerization? Calculate the degree of polymerization of polypropylene having
molecular weight of 25200.
How the functionality of monomer influences the structure of polymer?
Mention the commercial applications of epoxy resins.
On what basis polyamide is named as NYLON?
Why UV spectroscopy is called as electronic spectra?
IR spectrum is called as vibrational spectrum- Justify.
How absorption spectrum is differing from emission spectrum?
Analyze/Evaluate
1. Distinguish between hardness and alkalinity.
2. Distinguish between battery and cell.
3. Corrosion phenomenon is known as thousand dollar thief - reason out.
4. What is the basic difference between polymers and oligomers?
5. How do you identify an organic molecule using IR spectrum?
10
Unit I
Chemistry of Water and its Industrial Applications
Hardness of water: Equivalents of calcium carbonate - Units of hardness - Degree of hardness and its estimation
(EDTA method) - Numerical problems on degree of hardness - pH value of water. Use of water for industrial
purposes: Boiler feed water-scale-sludge - caustic embrittlement. Softening of hard water: External conditioning –
zeolite - ion exchange methods - internal conditioning – calgon - phosphate methods. Desalination: Reverse osmosis electrodialysis. Use of water for domestic purposes: Domestic water treatment - Disinfection of water - break point
chlorination.
Characterization of your campus water.
9 Hours
Unit II
Electrochemistry for Materials Processing
Introduction – emf - Single electrode potential - Hydrogen electrode - Calomel electrode - Glass electrode - pH
measurement using glass electrode - Electrochemical series. Cells: Electrochemical cells – Cell reactions- Daniel cell
– Reversible cells and irreversible cells - Difference between electrolytic cells and electrochemical cells. Concept of
electroplating: Electroplating of gold - electroless plating (Nickel). Batteries: Secondary batteries - lead acid, nickel cadmium and lithium batteries. Fuel cell: Hydrogen - oxygen fuel cell.
Electricity assisted painting.
9 Hours
Unit III
Chemistry of Corrosion and its Control
Corrosion: Mechanism of corrosion- – Chemical and electrochemical - Pilling-Bedworth rule - Oxygen absorption –
Hydrogen evolution - Galvanic series. Types of corrosion: Galvanic corrosion - Differential aeration corrosion Examples - Factors influencing corrosion. Methods of corrosion control: Sacrificial anodic protection - Impressed
current method. Protective coatings: Paints - Constituents and Functions. Special paints: Fire retardant - Water
repellant paints.
Applications of vapour phase inhibitors.
9 Hours
Unit IV
Introduction to Polymer and Nanotechnology
Polymers: Monomer - functionality - Degree of polymerization - Classification based on source - applications. Types
of polymerization: Addition, condensation and copolymerization. Mechanism of free radical polymerization.
Thermoplastic and thermosetting plastics - Preparation, properties and applications: Epoxy resins, TEFLON, nylon
and bakelite. Compounding of plastics. Moulding methods: Injection and extrusion. Nanomaterials: Introduction –
Nanoelectrodes - Carbon nanotubes - Nanopolymers - Application.
A detailed survey on application of polymer in day to day life.
9 Hours
Unit V
Instrumental Techniques of Chemical Analysis
Beer – Lambert‘s law - Problems. UV visible and IR spectroscopy: Principle- Instrumentation (block diagram only) Applications. Colorimetry: Principle – Instrumentation (block diagram only) - Estimation of iron by colorimetry.
Flame photometry: Principle - Instrumentation (block diagram only) - Estimation of sodium by flame photometry.
Atomic absorption spectroscopy: Principle - Instrumentation (block diagram only) - Estimation of nickel by atomic
absorption spectroscopy.
Applications of analytical instruments in medical field.
9 Hours
Total: 45 Hours
11
Textbook(s)
1. P. C. Jain and M. Jain, Engineering Chemistry, Dhanpat Rai Publications., New Delhi, 2009.
2. R. Sivakumar and N. Sivakumar, Engineering Chemistry, TMH, New Delhi, 2009.
3. B. R. Puri, L. R. Sharma and Madan S. Pathania, Principles of Physical Chemistry, Shoban Lal Nagin Chand
& Co., 2005.
Reference(s)
1. Sashi Chawla, Textbook(s)of Engineering Chemistry, Dhanpat Rai Publications, New Delhi, 2003.
2. B. S. Bahl, G. D. Tuli and Arun Bahl, Essentials of Physical Chemistry, S. Chand & Company, 2008.
3. J. C. Kuriacose and J. Rajaram, Chemistry in Engineering & Technology, Vol. 1&2, TMH, 2009.
4. C. P. Poole Jr., J. F. Owens, Introduction to Nanotechnology, Wiley India Private Limited, 2007.
5. Andre Arsenault and Geoffrey A. Ozin, Nanochemistry: A Chemical Approach to
Nanomaterials, Royal Society of Chemistry, London, 2005.
6. D. A. Skoog, D. M. West, F. James Holler &S. R. Crouch, Fundamentals of Analytical Chemistry, Wiley,
2004.
LANGUAGE ELECTIVE-I
3 0 0 3.0
Vide page number 159
11O105 BASICS OF ELECTRICAL AND ELECTRONICS ENGINEERING
(Common to all branches except EEE, ECE, EIE)
4 0 0 4.0
Objective(s)
 To understand the basics concepts of electric circuits & magnetic circuits
 To learn the operations of electrical machines
 To impart knowledge in the concepts of Communication systems
Program Outcome(s)
e) Develop software as per the appropriate software life cycle model.
f) Organize and maintain the information of an organization.
Course Outcome(s)
1. Analyze the power in single phase AC systems
2. Derive an equation for self and mutual inductance
3. Determine the characteristics of Bipolar junction transistors
4. Diagnose the operation of half wave and full wave rectifier
5. Design of an operational amplifier
Assessment Pattern
S.
Bloom’s Taxonomy
(New Version)
No.
1
Remember
2
Understand
3
Apply
4
Analyze / Evaluate
5
Create
Total
Remember
1. What is an inductor?
2. State Ohm‘s law.
†
Test I†
Test II†
10
20
30
40
100
10
20
30
40
100
Model
Examination†
10
20
30
40
100
End Semester
Examination
10
20
30
40
100
The marks secured in Test I and II will be converted 20 and Model Examination will be converted to 20. The
remaining 10 marks will be calculated based on assignments. Accordingly internal assessment will be calculated
for 50 marks
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
12
State the operating principle of a transformer.
Draw the circuit symbols of i] step up transformer ii] step down transformer.
What is resistor? Give its symbol.
What are impurities?
Draw the neat-labelled I-V characteristics of zener diode.
Draw circuit symbol of diode and zener diode,
Which process is used to convert the material into extrinsic?
What is junction barrier?
Define the term rectification and efficiency
What is done in the base region of a transistor to improve its operation.
What is BJT?
List the needs for modulation.
Draw symbol of 2-input NOR gate & write its truth table.
Understand
1. Explain Ohm‘s law relating to (V), (I) and (R).
2. Explain the working principle of a transformer.
3. Explain the working principle of an induction motor.
4. Discuss intrinsic semiconductor are pure semiconductors.
5. Explain pentavalent impurities with example.
6. Explain trivalent impurities with example.
7. Explain in brief, knee voltage of diode.
8. Explain in brief, breakdown voltage of diode.
9. Explain the operation of P-N Junction diode when forward and reverse bias.
10. Explain the formation of depletion region in P-N Junction.
11. Explain Zener diode as voltage regulator.
12. With a neat circuit diagram explain the working of a half wave rectifier.
13. Derive an expression for the efficiency of a half wave rectifier.
14. With a neat circuit diagram, explain the working of full wave rectifier.
15. What is Ex-OR gate? Explain its working & tabulate the truth table.
Apply
1. Why opamp is called as linear amplifier?
2. Why impurities are used?
3. Calculate the value of resistance having co lour code sequence Red , Yellow, orange and
Gold.
4. Why do we use transformer in rectifier circuit?
5. Which impurity play important role in formation of P type semiconductor?
6. Calculate the % ripple factior, if the dc output voltage 20 V and ac voltage 2V.
7. Three resistors are connected in series across a 12V battery. The first resistance has a value of 2 Ω, second
has a voltage drop of 4V and third has power dissipation of 12 W. Calculate the value of the circuit current.
8. A 25 Ω resistor is connected in parallel with a 50 Ω resistor. The current in 50 Ω resistor is 8A. What is
the value of third resistance to be added in parallel to make the total line current as 15A.
9. A toroidal air cored coil with 2000 turns has a mean radius of 25cm, diameter of each turn being 6cm. If the
current in the coil is 10A, find mmf, flux, reluctance, flux density and magnetizing force.
10. The self inductance of a coil of 500turns is 0.25H.If 60% of the flux is linked with a second coil of 10500
turns. Calculate a) the mutual inductance between the two coils and b) emf induced in the second coil when
current in the first coil changes at the rate of 100A/sec.
11. 2.An air cored toroidal coil has 480 turns, a mean length of 30cm and a cross-sectional area of 5
cm2.Calculate a)the inductance i\of the coil and b) the average induced emf, if a current of 4 A is reversed in
60 milliseconds
Analyze / Evaluate
1. Why inductor is referred as a choke?
2. Why single phase induction motor are not self starting?
13
3.
How the barrier potential is developed across the P-N Junction, what are the approximate
values this potential for Germenium and Silicon?
4. Trivallent impurity is called as donor impurity, comment.
5. Distinguish with diagram, then solid material on the basis of band diagram.
6. How a zener diode can be used for voltage regulation in power supply?
7. How voltage source is converted into current source and vice versa?
8. Differentiate P type and N type semiconductor
9. Distinguish between metal, semiconductor and insulator. Give examples of each.
10. Distinguish between half wave and full wave rectifier
Create
1. Design a half wave uncontrolled rectifier and calculate the ripple factor.
2. Design a full wave uncontrolled rectifier and calculate the efficiency.
Unit I
Electric Circuits
Definition of Voltage, Current, Power & Energy, Ohm‘s law, Kirchoff‘s Law & its applications – simple problems,
division of current in series & parallel circuits, generation of alternating EMF, definition of RMS value, average
value, peak factor, form factor. Power in single phase AC – three phase system.
Star to delta and delta to star transformations, R-L and R-C series circuit
12 Hours
Unit II
Magnetic Circuits
Definition of MMF, Flux, Reluctance, Properties of Flux lines, Self & Mutual Inductance, Ampere Turns, Series &
parallel magnetic circuits, Comparison between Electric & magnetic circuits, Law of Electromagnetic induction,
Fleming‘s Right & Left hand rule.
Magnetic impedance, Effective resistance, Magnetic capacitivity
12 Hours
Unit III
Electrical Machines
Construction, Type, Principle of Operation & Working Principle of DC Generator, DC Motor, Transformer,
Induction Motor, Induction type single phase energy meter, Domestic wiring practice, Tube light circuit, Earthing &
earthing methods.
Characteristics of DC generators and DC motors,
12 Hours
Unit IV
Electronics Engineering
PN Junction diode & Zener diode – Characteristics – Half wave and full wave rectifier – Bipolar junction transistors
– CB,CE, CC Configurations and characteristics – basic concepts of amplifiers and oscillators – Logic gates –
Inverting, Non inverting amplifiers and Operational amplifiers- Basic Computer organization – Block diagram of
Microprocessors (8085).
Semiconductor theory, Diode clippers, op-amp parameters and applications
12 Hours
Unit V
Communication Engineering
Introduction to communication systems – Need for modulation – Types- Block Diagram representation only – Block
diagram of TV system – Introduction to cellular & mobile telephony- Block diagram of Optical and Satellite
communication systems.
Analog and digital signals, Transmission medium, Digital communication
12 Hours
Total: 60 Hours
Textbook(s)(s)
1. T. K. Nagsarkar and M. S. Sukhija, Basic of Electrical Engineering, Oxford Press, 2005
2. R. Muthusubramaninan, S. Salivahanan and K. A. Muraleedharan, Basic Electrical,
Computer Engineering, Tata McGraw Hill, 2004
14
Electronics and
Reference(s)
1. J. A. Edminister, Electric Circuits, Schaum‘s Series, McGraw Hill, 2005
2. Van Valkenbergm, Electric Circuits and Network Analysis, Prentice Hall (India) Pvt. Ltd., 2005
3. Smarjith Ghosh, Fundamentals of Electrical and Electronics Engineering, Prentice Hall (India) Pvt. Ltd.,
2005
11Z106 COMPUTATIONAL PROBLEM SOLVING
3 1 0 3.5
Objective(s)



To develop the problem solving ability for real life problems
To learn the basic concepts of developing an algorithm
To understand the concept of pseudo-code
Program Outcome(s)
a) Apply basic principles and practices of computing grounded in mathematics and science to successfully
complete software related projects.
b) Apply the knowledge and skills acquired to succeed in a computer science career and to pursue higher
studies.
c) Demonstrate problem solving and design skills including the ability to formulate problems and their
Course Outcome(s)
 Demonstrate the functional behavior of flow charts
 Determine the relationship between the mathematical modeling and algorithms
 Develop flow charts using Raptor Tool
Assessment Pattern
S. No.
1
2
3
4
5
6
Bloom’s Taxonomy
Test I†
(New Version)
Remember
30
Understand
20
Apply
20
Analyze
10
Evaluate
10
Create
10
Total
100
Test II†
20
20
20
20
10
10
100
Model
Examination†
20
20
20
20
10
10
100
End Semester
Examination
20
10
20
20
10
20
100
Remember
1. List the requirements of problem solving.
2. What is top down design?
3. What is program testing?
†
remaining 10 marks will be calculated based on assignments. Accordingly internal assessment will be calculated
for 50 marks
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
15
List the steps involved in improving the efficiency of algorithms.
What are the applications of exchanging the values?
List the application area of factorial computation.
Mention the application areas of reversing a number.
Define base conversion
List the applications of character to number conversion.
What is oscillating convergence?
List the steps involved in computing the prime factors.
List the applications of pseudorandom numbers.
Define an array
Understand
1.
2.
3.
4.
Describe the steps involved in implementation of algorithms
Explain the concepts of analysis of algorithms
Write an algorithm for exchanging two values
Write an algorithm for reversing a number
Apply
1.
2.
3.
Develop an algorithm to find the summation of a set of numbers.
Construct a flow chart to generate pseudo random numbers.
Illustrate the pseudo code for generation of Fibonacci sequence.
Analyze
1.
2.
Analyze the algorithm for reversing the numbers in a set.
Analyze the pseudo code for finding the nth Fibonacci number.
Evaluate
1. Defend the steps involved in sorting.
2. Evaluate the guidelines for finding average of n numbers.
3. Evaluate the need for flow charts.
Create
1. Demonstrate an algorithm for text line length adjustment with an example.
2. Generate the pseudo code for text line editing.
3. Depict the purpose and necessities of linear pattern search.
Unit I
Introduction to Computer Program
Introduction – Algorithm – Flowchart - Pseudo code - Program Control Structures - Programming Paradigms Programming Languages - Generations of Programming Languages – Computer Software – Software Definition –
Categories of Software – Installing and Uninstalling Software – Software Piracy
9 Hours
Software Terminologies
Unit II
Computer Problem Solving
The Problem-solving Aspect - Top-down Design-implementation of Algorithms- Program Verification - The
Efficiency of Algorithms. Fundamental Algorithms - Exchanging the values of Two Variables - Counting Summation of a set of Numbers - Factorial Computation-Sine function computation - Generation of the Fibonacci
sequence - Reversing the Digits of an Integer
9 Hours
Base Conversion-Character to Number Conversion
16
Unit III
Factoring Methods
Finding the square Root of a number - The Smallest Divisor of an Integer - The Greatest Common Divisor of Two
Integers - Generating Prime Numbers - Computing the Prime Factors of an Integer Raising a Number to a Large
Power - Computing the nth Fibonacci Number.
9 Hours
Generation of Pseudo - random Numbers
Unit IV
Array Techniques
Array Order Reversal-Array Counting or Histogramming - Finding the Maximum Number in a Set - Partitioning an
Array – Finding the kth Smallest Element - Longest Monotone Subsequence.
9 Hours
Removal of Duplicates from an Ordered Array
Unit V
Text Processing and Pattern Searching
Text Line Length Adjustment - Left and Right Justification of Text -Text Line editing - Linear Pattern Search - Sub
linear Pattern Search.
9 Hours
Keyword Searching in Text
Total: 45 Hours
Textbook(s)(s)
1. R.G.Dromey, ―How to Solve it by Computer”, Pearson Education, India, 2009.
2. ITL Educational Solutions Limited, ―Introduction to Information Technology”, Pearson Education, India,
2006.
Reference
1. Seymour Lipschutz, ―Essentials computer Mathematics”, Schaums‘ outlines series, Tata McGrawHill
Edition, 2004.
2. Ellis Horowitz, ―Fundamentals of Programming languages‖ Galgotia publications, 1984
3. G. Polya, ―How to Solve It: A New Aspect of Mathematical Method‖ Princeton University Press, 2008
11Z107 COMPUTATIONAL PROBLEM SOLVING LABORATORY
0 0 3 1.5
Objective(s)
 To learn the text processing using word processor.
 To calculate the different values using spread sheets
 To prepare a slideshow using power point.
 To generate the flow charts for different problems.
Program Outcome(s)
research.
c) Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize
17
Skill Set
 Demonstrate text formatting.
 Prepare presentations using slides
 Demonstrate the application of spread sheet
 Draw flowcharts using Raptor tool
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Preparation
Observation and Results
Record
Mini- Project / Model
Examination / Viva Voce
Total
Remember
1. What is a flowchart?
2. What is text processing?
3. What is presentation?
4. What is font and font size?
5. What is searching?
6. List the buttons available in text formatting
Internal
Assessment
10
15
10
End Semester
Examination
15
20
-
15
15
50
50
Understand
1. Classify different formula available in Excel.
2. Discuss the steps involved in drawing graphs using Excel
3. How to fill a series in a particular column?
Apply
1.
2.
3.
Sort the given values using both in ascending and descending order in Excel.
65 70 75 80 85 60 55 50 45
Demonstrate the steps involved in finding the sum and average of the following list.
12 14 16 19 91 99 81 36 42
Illustrate various text alignment techniques with an example.
Analyze / Evaluate
1. Differentiate the steps involved in finding the sum in MS Word & Excel.
2. Experiment the flow chart for finding the factorial of given number using the step evaluation method.
3. Test the flowchart for finding the greatest among three numbers with different combination of values.
Create
1. Design the flow chart for finding the average of n numbers
2. Develop an algorithm for decimal to binary conversion.
List of Experiments
1. Create documents using MS_WORD and convert it into PDF
2. Apply different formatting options in a MS word Document
3. Create a presentation using MS_POWERPOINT by importing data from MS Excel
4. Create a consolidate report using MS EXCEL by getting data from different spread sheets.
5. Draw different types of charts for analyzing the performance of any system using MS EXCEL
6. Create simple flowcharts using Raptor tool
7. Construct flowcharts using decision making in Raptor tool
8. Construct flowcharts using pretest loop in Raptor tool
9. Draw the flow chart for a post test loop using Raptor tool
Total: 45 Hours
18
Design Experiments
Application Oriented Experiments
S.No
Experiment
Hours
3
3
3
6.
Create documents using MS_WORD and convert it into PDF
Apply different formatting options in a MS word Document
Create a presentation using MS_POWERPOINT by importing data from
MS Excel
Create a consolidate report using MS EXCEL by getting data from
different spread sheets.
Draw different types of charts for analyzing the performance of any
system using MS EXCEL
Create simple flowcharts using Raptor tool
7.
8.
9.
10.
11.
Construct flowcharts using decision making in Raptor tool
Construct flowcharts using pretest loop in Raptor tool
Draw the flow chart for a post test loop using Raptor tool
Design Experiments
3
3
3
3
3
1.
2.
3.
4.
5.
3
6
3
11O108 ENGINEERING PHYSICS LABORATORY
0 0 2 1.0
Course Objective(s)




To know how to execute experiments properly, presentation of observations and arrival of conclusions.
It is an integral part of any science and technology program.
To view and realize the theoretical knowledge acquired by the students through experiments
At the end of the course, the students able to realize the theoretical knowledge acquired through
experiments.
Course Outcome(s)
1. Observation and analytical skills are developed
2. Various properties of matter can be known.
3. Different optical properties can be analyzed.
Program Outcome(s)
an ability to apply knowledge of mathematics, science, computer programming and engineering.
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Internal
Assessment
Semester
End Examination
Preparation
10
15
Execution
10
15
Record
Model Examination
Viva Voce
10
5
10
5
15
5
Total
50
50
19
List of Experiments
1.
Determination of moment of inertia and rigidity modulus of wire using torsion pendulum (symmetrical
masses method).
2. Comparison of Young‘s moduli of two different materials subjected to non-uniform bending.
3. Determination of thermal conductivity of a bad conductor using Lee‘s disc.
4. Determination of frequency of a vibrating rod subjected to a.c voltage by longitudinal and transverse
modes of vibration.
5. Determination of viscosity of a liquid - Poiseulle‘s method.
6. Determination of thickness of a thin wire - air wedge method.
7. Determination of wavelength of mercury spectrum – grating.
8. Determination of refractive index of a liquid and solid using traveling microscope.
9. Determination of energy band gap of a semiconductor diode.
10. Determination of wavelength of LASER and particle size of a given powder.
Total: 30 Hours
11O109 ENGINEERING CHEMISTRY LABORATORY
0 0 2 1.0
Course Objective(s)
 Imparting knowledge on basic concepts and its applications of chemical analysis.
 Training in chemical and instrumental methods.
 Develop skills in estimation of a given sample by chemical and instrumental methods.
Course Outcome(s)
 Students will able to identify and estimate quantitatively the certain impurities present in water, which will
be useful in industry.
 Basic knowledge about the conductance, rate of corrosion, pH, molecular weight of polymer and potential
which will find application in industry.
Program Outcome(s)
(a) an ability to apply knowledge of mathematics, science, computer programming and engineering.
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Internal
Assessment
Semester
End Examination
Preparation
10
15
Execution
10
15
Record
Model Examination
Viva Voce
10
5
10
5
15
5
Total
50
50
List of Experiments
1. Preparation of molar and normal solutions of the following substances – oxalic acid, sodium carbonate, sodium
hydroxide, hydrochloric acid.
2. Water quality of BIT campus – River/Bore well water with respect to Hardness, TDS and pH.
3. Comparison of alkalinities of the given water samples.
4.
5.
6.
7.
8.
9.
10.
20
Conductometric titration of mixture of acids.
Determination of strength of iron by potentiometric method using potassium dichromate.
Determination of molecular weight of a polymer by viscometry method.
Estimation of iron (thiocyanate method) in the given solution by spectrophotometric method.
Determination of strength of hydrochloric acid by sodium hydroxide using pH meter.
Determination of sodium and potassium ions in water sample by flame photometric method.
Determination of corrosion rate and inhibition efficiency by weight loss measurements.
Total: 30 Hours
11O102 ENGINEERING MATHEMATICS II
3 1 0 3.5
Objective(s)
•
•
Acquire knowledge to use multiple integrals to find area and volume of surface and solids respectively.
Have a good grasp of analytic functions, complex integration and their interesting properties and its
applications.
l)
Apply basic principles and practices of computing grounded in mathematics and science to successfully
research.
i)
The graduates will become familiar with fundamental concepts of mathematics such as
differentiation and integration.
ii) The graduates will be able to apply the basic concepts of mathematics to solve the engineering
problems
iii) The graduates will demonstrate their ability to solve technical problems via technical approaches,
self study, team work and life long learning approaches.
iv) Graduates will become equipped with the knowledge and analytical skills necessary for entry-level
placement.
Course Outcome(s)
2. Improvement in problem evaluation technique.
3.
Choose an appropriate method to solve a practical problem.
Assessment pattern
S.
No
Bloom’s
Taxonomy
(New Version)
Test II1
Model
Examinatio
n1
End Semester
Examination
1
Remember
20
20
20
20
2
Understand
40
40
40
20
3
Apply
30
30
30
30
4
Analyze/ Evaluate
10
10
10
20
5
Create
-
-
-
-
100
100
100
100
Total
4
Test I4
50 marks.
21
Remember
1. Define Jacobian in two dimensions.
2. State Green‘s theorem.
3. Define directional derivative of a vector point function.
4. Define analytic function.
5. What is the formula for finding the residue of a double pole?
6. State Cauchy‘s integral formula.
7. Write the necessary condition for a function f (z) to be analytic.
8. Write the formula for unit normal vector?
9. Write all the types of singularities.
10. State the sufficient conditions for a function of two variables to have an extremum at a point.
Understand
(u, v)
.
( x, y)
yx zx
u
u
u
2. If u  f (
,
) showthat x 2
 y2
 z2
0.
xy
xz
x
y
z
1. If
u  2 xy, v  x 2  y 2 , x  r cos  , y  r sin  compute
 y
3. Transform the integral
  f ( x, y)dxdy to polar coordinates.
0 0
2 x
  f x, y dydx .
4.
Change the order of integration in
5.
Find a, such that (3x-2y+z)i+(4x+ay-z)j+(x-y+2z)k is solenoidal.
6.
7.
What is the greatest rate of increase of   xyz at (1,0,3)?
Test the analyticity of the function w = sin z.
0 0
2
dw
given w = tan z.
dz
dz
9. Evaluate 
where c is the circle z  1
2
(
z

3
)
c
4
10. Find the residues of the function f ( z )  3
at its simple pole.
z ( z  2)
8.
Find
Apply
u  x 4  y 4  2 x 2  4 xy  2 y 2 for extreme values.
x y
xy
,v
2. Check if u 
are functionally dependent. If so find the relationship between them.
x y
x  y 2
1. Examine the function
3. By transforming into cylindrical polar coordinates evaluate
   x
2

 y 2  z 2 dxdydz taken over the
 y 2  1 and 0  x  1 .





2
4. Using Gauss divergence theorem evaluate  F  nˆds where F  4 xz i  y j  yzk and S is the surface
region of space defined by x
2
s
of the cube bounded by x=0,y=0,z=0,x=1,y=1,z=1.
22
5. When the function f(z) = u + iv is analytic, show that U = constant and V = constant are orthogonal.
6. Determine the image of 1<x<2 under the mapping
w
1
.
z
7. Find the area of the cardiod r = 4 ( 1+ cos ) using double integral.
8. Apply Green‘s theorem in the plane to evaluate
 (3x
2
 8 y 2 )dx  (4 y  6 xy )dy
c
Where c is the boundary of the region defined by x=0, y=0 and x+y=1.
9. If
u  log( x 2  y 2 ) , find v and f (z) such that f (z) =u+iv is analytic.

10. Using Cauchy‘s integral formula evaluate
C
e z dz
where C is the Circle z  3 .
( z  2 ) ( z  1) 2
Analyze / Evaluate
x
1. Prove that
2. If
u
v
w
,y
,z 
vw
wu
u v
are functionally dependent.
g ( x, y)  (u, v) where u  x  y , v  2 xy prove that
2
2
2
2g 2g
 2
2
2  



4
(
x

y
)

 u 2 v 2
x 2 y 2

3. Evaluate the integration
   xyzdxdydz

 .

taken throughout the volume for which
x, y, z  0 and
x2  y 2  z 2  9 .
4. Evaluate the following integral by changing to spherical coordinates
1
1 x 2
1 x 2  y 2
0
0
0
 
dxdydz

1  x2  y 2  z 2
F  x 2i  y 2 j  z 2 k
5. Verify Gauss divergence theorem for
where S is the surface of the cuboid
formed by the planes x=0, x=a, y=0, y=b, z=0 and z=c.
6. Determine the bilinear transformation that maps the points -1, 0, 1 in the z-plane onto the points 0, i, 3i in the
w-plane.
2
cos 2
0 5  4 cos  d
7. Evaluate
.

8. Using contour integration, evaluate

0
9. Expand
f ( z) 
z
z  1z  3
x2
dx
x2  9 x2  4


as Laurent‘s series valid in the regions:
1  z  3 and 0  z  1  2
10. Show that
F  (6 xy  z 3 )i  (3x 2  z ) j  (3xz 2  y)k is irrotational vector and find the scalar
potential function
 such that F  
23
Unit I
Functions of Several Variables
Functions of two variables - Partial derivatives - Total differential - Derivative of implicit functions - Maxima and
minima - Constrained Maxima and Minima by Lagrangian Multiplier method - Jacobians-application to engineering
problems.
9 Hours
Unit II
Multiple Integrals
Double integration in cartesian and polar co-ordinates - Change of order of integration - change of variables- Area
and volume by multiple integral- application to engineering problems.
9 Hours
Unit III
Vector Calculus
Gradient - divergence - curl- line - surface and volume integrals - Green‘s - Gauss divergence and Stokes‘
theorems(statement only) - applications to engineering problems.
9 Hours
Unit IV
Analytic Functions
Analytic functions- Necessary condition of analytic function-Sufficient condition of analytic function(statement
only)- properties - Determination of analytic function using Milne Thomson‘s method, conformal mappings Mappings of w= z + a, az, 1/z, ez- bilinear transformation -- application to engineering problems.
9 Hours
Unit V
Complex Integration
Cauchy‘s fundamental theorem (statement only)- and application of Cauchy‘s integral formula(statement only) –
Taylor‘s and Laurent‘s series- classification of singularities – Cauchy‘s residue theorem (statement only)- Contour
integration - circular and semi circular contours ( excluding poles on the real axis )- application to engineering
problems
9 Hours
Total:45+15=60 Hours
Textbook(s)(s)
1. B. S. Grewal , Higher Engineering Mathematics , Khanna Publications , New Delhi, 2000.
2. K .A . Lakshminarayanan ,K. Megalai, P. Geetha and D. Jayanthi , Mathematics for Engineers, Volume II,
Vikas Publishing House, New Delhi. 2008.
Reference(s)
1. P. Kandasamy, K. Gunavathy and K. Thilagavathy, Engineering Mathematics , Volume II, S. Chand &
2. Co., New Delhi, 2009.
3. T. Veerarajan, Engineering Mathematics , Tata McGraw Hill Publications , New Delhi, 2008.
4. E. Kreyszig, Advanced Engineering Mathematics , John Wiley & Sons, Inc, Singapore, 2008.
5. C. RayWylie and Louis .C. Barrett, Advanced Engineering Mathematics , Tata McGraw Hill
6. Publications, 2003.
11O202 ENVIRONMENTAL SCIENCE
3 0 0 3.0
Course Objective(s)
 Imparting knowledge on principles of environmental science and engineering.
 Understanding the concepts of ecosystem, biodiversity and impact of environmental pollution.
 Awareness on value education, population and social issues.
Program Outcome(s)
24
Course Outcome(s)
 comprehend the importance of environment, its purpose, design, exploitation of natural resources and
perspectives.
 understand fundamental physical and biological principles that govern natural processes and role of
professionals in protecting the environment from degradation.
 understand current environmental challenges like pollution and its management.
 design and evaluate strategies, technologies and methods for sustainable management of environmental
systems.

classify and understand the relation between human population and environment.
Assessment Pattern
S.N
o
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
Test II
25
25
20
20
10
100
25
25
20
20
10
100
Model
Examination
15
25
20
20
20
100
End Semester
Examination
15
25
20
20
20
100
Remember
1. Give the scope and importance of environmental studies.
2. Distinguish between renewable and non- renewable resources.
3. Explain the impacts of mining on forests.
4. Explain why fresh water is a precious resource and classification of different water pollutants?
5. What are the Impacts of modern agriculture?
6. State the two energy laws and give examples that demonstrate each law.
7. List the physical, chemical, and biological factors responsible for soil formation.
8. Give examples of point and nonpoint sources of pollution.
9. Draw a food web that includes ten or more aquatic organisms.
10. Distinguish between primary and secondary pollutants.
11. Identify the four parts of the atmosphere.
12. Describe secondary and primary succession with suitable examples.
13. Define the term extinction.
14. Relate the concept of food web and food chain to trophic levels.
15. Describe energy flow in a ecosystem.
16. Define the roles of producers, herbivore, carnivore, omnivore, scavenger, parasite and
decomposer.
17. List some of the components of an ecosystem.
18. Distinguish between the biotic and abiotic factors in an ecosystem.

50 marks.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
Give some impacts of water pollution.
Explain the source and effects of e waste.
What is the loudest sound possible?
What are the laws regarding noise pollution?
What is rainwater harvesting?
Discuss the concept and reactions of acid rain.
Describe the salient features of Wildlife (protection) Act, 1972.
What is 3R approach?
Give the effects of nuclear fallout.
Differentiate between mortality and natality.
What is exponential growth and zero population growth?
What are the Objective(s) and elements of value education?
Understand
1. Explain why providing adequate food for all of the world's people is so difficult?
2. Rank the five major sources of energy used to produce electricity and classify the energy sources
as renewable or nonrenewable.
3. Describe the causes of desertification and its preventive measures.
4. Describe the advantages and disadvantages of the green revolution.
5. Explain the relationship between technology and global warming.
6. Describe any three health effects of air pollution.
7. Identify "greenhouse gases" and explain how they cause the "greenhouse effect".
8. Identify a few plants and animals with the various biomes.
9. Explain the importance of primary species.
10. Explain the five major types of species interactions and give examples of each.
11. Environmental problems involve social, political, and economic issues—Justify.
12. What problems does noise pollution cause to animals?
13. What type of pollution threatens wetlands?
14. What are the major measures to attain sustainability?
15. Why is urban energy requirement more than rural requirement?
16. What are the major limitations to successful implementation of our environmental legislation?
17. Explain the concept of Malthusian theory.
18. How age-structure pyramids serve as useful tools for predicting population growth trends of a nation?
19. Discuss various issues and measures for women and child welfare at international and national level.
Apply
1.
2.
3.
Compare the energy efficiencies of any two inventions.
Name some alternatives to pesticides.
Identify four different habitats found in bodies of water and give examples of organisms that live
in each habitat.
4. Explain how we could reduce air pollution?
5. What are the measures to be taken to reduce your own noise pollution?
6. List the top ten polluted countries in the world?
7. Identify the grants available for rain water harvesting in buildings?
8. What are the major implications of enhanced global warming?
9. Discuss the methods implemented by government to control HIV/AIDS.
10. What is the role of an individual in prevention of pollution?
25
26
Analyze/ Evaluate
1. List reasons why it is important that we seek alternatives to fossil fuels.
2. Explain why fresh water is often in short supply?
3. Give examples of human-made sources of radiation and explain how human-made sources differ
from natural sources of radiation.
Unit I
Introduction to Environmental Studies and Natural Resources
Environment: Definition- scope - importance – need for public awareness. Forest resources: Use –over exploitationdeforestation - case studies- mining - effects on forests and tribal people. Water resources: Use – over utilization of
surface and ground water- floods – drought - conflicts over water. Mineral resources: Use – exploitation environmental effects of extracting and using mineral resources - case studies. Food resources: World food problems
- changes caused by agriculture and overgrazing - effects of modern agriculture- fertilizer-pesticide problems - water
logging - salinity -case studies. Energy resources: Growing energy needs - renewable and non renewable energy
sources. Land resources: Land as a resource - land degradation - soil erosion. Role of an individual in conservation of
natural resources.
Documentation of the effect of degradation of forest resource.
9 Hours
Unit II
Ecosystems and Biodiversity
Concept of an ecosystem: Structure and function of an ecosystem – producers - consumers -decomposers – energy
flow in the ecosystem – ecological succession – food chains - food webs and ecological pyramids. Types of
ecosystem: Introduction - characteristic features - forest ecosystem - grassland ecosystem - desert ecosystem aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries). Biodiversity: Introduction– definition (genetic species –ecosystem) diversity. Value of biodiversity: Consumptive use - productive use – social values – ethical
values - aesthetic values. Biodiversity level: Global - national - local levels- India as a mega diversity nation- hotspots
of biodiversity. Threats to biodiversity: Habitat loss - poaching of wildlife – man wildlife conflicts – endangered and
endemic species of India. Conservation of biodiversity: In-situ and ex-situ conservation of biodiversity - field study.
Documentation of the endangered flora and fauna in your native place.
9 Hours
Unit III
Environmental Pollution
Pollution: Definition –air pollution - water pollution - soil pollution - marine pollution - noise pollution - thermal
pollution - nuclear hazards. Solid waste management: Causes - effects - control measures of urban and industrial
wastes. Role of an individual in prevention of pollution - pollution case studies. Disaster management: Floods –
earthquake - cyclone - landslides. Electronic wastes.
Investigation on the pollution status of Bhavani river.
9 Hours
Unit IV
Social Issues and Environment
Sustainable development : Unsustainable to sustainable development – urban problems related to energy. Water
conservation - rain water harvesting - watershed management. Resettlement and rehabilitation of people.
Environmental ethics: Issues - possible solutions – climate change - global warming and its effects on flora and fauna
- acid rain - ozone layer depletion - nuclear accidents - nuclear holocaust - wasteland reclamation - consumerism and
waste products. Environment protection act: Air (Prevention and Control of Pollution) act – water (Prevention and
control of Pollution) act – wildlife protection act – forest conservation act – issues involved in enforcement of
environmental legislation.
Analyze the recent steps taken by government of India to prevent pollution.
9 Hours
27
Unit V
Human Population and Environment
Human population: Population growth - variation among nations – population explosion – family welfare programme
and family planning – environment and human health – Human rights – value education – HIV / AIDS, Swine flu –
women and child welfare . Role of information technology in environment and human health.
Population explosion in India, China – the present and future scenario.
9 Hours
Total: 45 Hours
Textbook(s)
1. T. G. Jr. Miller, Environmental Science, Wadsworth Publishing Co., 2004.
2. Raman Sivakumar, Introduction to Environmental Science and Engineering, Tata McGraw Hill Education
Private Limited, New Delhi, 2010.
Reference(s)
1. Bharucha Erach, The Biodiversity of India, Mapin Publishing Pvt. Ltd., Ahmedabad India, 2010 .
2. S. Divan, Environmental Law and Policy in India, Oxford University Press, New Delhi, 2001.
3. K. D. Wager, Environmental Management, W. B. Saunders Co., Philadelphia, USA, 1998.
4. W. P. Cunningham, Environmental Encyclopedia, Jaico Publising House, Mumbai, 2004.
5. S. K. Garg, R. Garg, R. Garg, Ecological & Environmental Studies, Khanna Publishers, Delhi, 2006.
6. http://www.ipcc.ch/index.html
7. http://unfccc.int/2860.php
LANGUAGE ELECTIVE-II
3 1 0 3.5
Vide page number 163
11Z204 MATERIALS SCIENCE
(Common to CSE, EEE, ECE, EIE and IT)
Course Objective(s)
 To explain the properties of conducting, semiconducting and dielectric materials.
 To impart fundamental knowledge in optical materials.
 To enable the students to understand the magnetic materials.
Program Outcome(s)
a. An ability to apply knowledge of mathematics, science, computer programming and engineering
Course Outcome(s)
 understand how conducting materials are influencing engineering design.
 demonstrate magnetic and electrical properties of materials.
 gain the fundamentals of polarizable solids.
 familiarize with the basics of optoelectronic materials and their applications.
 identify the suitability of magnetic materials for its specific application.
3 0 0 3.0
28
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test 1
Test 2
Model
Examination
End Semester
Examination
25
25
20
20
10
-
25
25
20
20
10
-
20
25
20
20
15
-
20
25
20
20
15
-
100
100
100
100
Remember
1. Define relaxation time and collision time.
2. Give the postulates of free electron theory.
3. Give the drawbacks of classical free electron theory.
4. Define drift velocity.
5. State Drude-Lorentz theory.
6. What is the probability function f(E) of an electron occupying an energy level E?
7. What are intrinsic and extrinsic semiconductors?
8. Give the broad classification of semiconductors based on carriers.
9. State Hall effect.
10. Define photovoltaic effect.
11. Mention the applications of pin photo diode.
12. Write a short note on dipole and dipole moment.
13. List the properties of dielectrics.
14. Write the expressions for electronic and ionic polarization.
15. What is meant by local field in solid dielectrics?
16. Write the Clausius-Mosotti equation for a solid dielectric.
17. Define dielectric breakdown.
18. Define the term fluorescence.
19. What is the sufficient condition for the phosphorescence?
20. What is the principle of LED?
21. Define plastic encapsulation.
22. Write a note on liquid crystal state.
23. Write the drawbacks of LCD.
24. List the advantages of CD-ROM.
25. What is meant by magnetic flux density?
26. Write notes on (i) retentivity (ii) coercivity
27. What is meant by domain?
28. Mention the applications of soft magnetic materials.
29. Mention some materials used for magnetic recording.

50 marks.
29
Understand
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
How the free electron theory proved to be wrong in terms of thermal conductivity by Wiedemann-Franz
law?
Explain the variation of Fermi-Dirac distribution function with temperature.
Elucidate the significance of probability function when (i) f(E)=1 (ii) f(E)=0 (ii)f(E)=0.5
Calculate the density of electron at 0K.
What are the importances of Fermi energy?
Why the extrinsic semiconductors are preferred over intrinsic semiconductors?
Prove that the Fermi level lies at the middle of the energy gap in intrinsic semiconductor.
Give the importance of band gap energy.
What are the differences between donor ad acceptor energy level?
Is it possible to measure the magnetic field using Hall Effect? Explain.
How the photo voltaic effect is utilized in solar cells?
All the dielectrics are insulators, but why all the insulators are not dielectrics?
Why the orientation polarization occurs only in polar molecules?
Prove that the internal field of the atoms is larger than the applied field.
Why the chemical and electrochemical breakdowns have close relationship with thermal breakdown?
What are the changes observed in BaTiO3 with change in temperature?
How can you increase the emission time in luminescence?
How the electroluminescence is used in LED?
Why the wavelength of the emitted photons in LED depends on energy gap in the semiconductor?
Why LCD comes under passive display device?
How the data in CD-ROM is read out?
What are the advantages of CD-ROM?
Give the origin of magnetic moment in magnetic materials.
Why the susceptibility of diamagnetic material is negative?
What is the reason for the magnetic lines of forces are highly attracted towards the centre of the
ferromagnetic material?
Why hard magnetic materials cannot be easily magnetized?
Give the reason for using soft magnetic materials in transformers.
How the soft magnetic materials are used in magnetic bubbles?
Apply
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
Discuss the reasons for the failure of classical free electron theory.
What is the reason for low contribution of electrons to the heat capacity of metals?
Sketch the variation of Fermi level with temperature.
Explain how phosphorous atoms donate electrons to the conduction band?
Where are the donor and acceptor levels located in an impurity semiconductor? Why?
Explain how photo pin diodes are used in fiber optical communication?
Graphically explain frequency dependence of dielectrics.
Why at low temperature the total polarization is maximum?
Deduce Clausius-Mosotti relation and explain its use in predicting the dielectric constant of the solids.
Why phosphorescence is called delayed fluorescence?
Explain the reason for the formation of domain in ferromagnetism and how the hysteresis curve is explained
on the basis of the domain theory?
12. Discuss the bearing of domain theory in soft and hard magnetic materials.
13. Give an account of the origin of atomic magnetization and which source is important in the ferromagnetic
materials?
14. Explain the spontaneous magnetization possessed by ferromagnetic material below Curie point.
30
Analyze/ Evaluate
1. Compare intrinsic and extrinsic semiconductors.
2. Differentiate p-type and n-type semiconductors.
3. Compare dia, para and ferromagnetic materials.
4. Differentiate soft and hard magnetic materials.
5. Compare LED and LCD.
Unit I
Electrical properties of Metals
Introduction - Derivation of microscopic form of Ohm‘s law- postulates of classical free electron theory- derivation
of electrical conductivity of metals (Drude- Lorentz theory)- merits and demerits. Derivation of thermal conductivity
– Wiedemann-Franz law- verification. Electron energies in metal and Fermi energy- Fermi-Dirac distribution
function and its variation with temperature- density of energy states- calculation of density of electron and fermi
energy at 0K- average energy of free electron at 0K- Importance of fermi energy- problems.
9 Hours
Quantum free electron theory and Band theory of solids.
Unit II
Semiconducting Materials & Devices
Introduction - elemental and compound semiconductors - Intrinsic semiconductors: density of electrons - density of
holes- determination of carrier concentration and position of Fermi energy- band gap energy determination
(quantitative treatment). Extrinsic semiconductors: carrier concentration in p-type and n-type semiconductors. Hall
effect- theory of Hall effect- experimental determination of Hall voltage- applications. Semi conducting devices: solar
cells (Photovoltaic effect) – uses. Photo detectors: pin photo diodes – applications.
9 Hours
Variation of Fermi level with temperature and doping concentration in extrinsic semiconductors.
Unit III
Dielectrics
Introduction- fundamental definitions in dielectrics- expressions for electronic, ionic and orientation polarization
mechanisms- space charge polarization- Langevin- Debye equation- frequency and temperature effects on
polarization- dielectric loss- internal field- expression for internal field (cubic structure)- derivation of ClausiusMosotti equation – importance. Dielectric breakdown- various breakdown mechanisms with characteristicsapplications of dielectric materials and insulating materials- problems.
9 Hours
Charging and discharging of capacitors.
Unit IV
Optical Materials
Introduction-fluorescence and phosphorescence- technique of increasing the emission time. Light Emitting Diode:
principle, construction and working-applications. Liquid crystal display: general properties- dynamic scattering
display- twisted nematic display- applications- comparison between LED and LCD. Disk data storage recording and
read out of data in CD-ROM- principle - magneto optic disk.
9 Hours
Various data storage and retrieval techniques.
Unit V
Magnetic Materials
Introduction-orbital magnetic moment and spin magnetic moment-Bohr magneton-basic definitions –properties of
dia, para and ferro magnetic materials-domain theory of ferro magnetism-process of domain magnetization-reversible
and irreversible domains-explanation of hysteresis curve based on domain theory-hard and soft magnetic materials-
31
recording and read out process in floppy disk and magnetic bubble memory-comparison between floppy disk and
bubble memory-problems.
Magnetic shift register.
9 Hours
Total: 45 Hours
Textbook(s)
1. V. Rajendran, Materials Science, Tata Mc Graw Hill Publishers Company Ltd, New Delhi, 2011.
2. M. Arumugam, Physics II, Anuradha Publications, Kumbakonam, 2005.
Reference(s)
1. S. O. Pillai, Solid State Physics, New Age International Publications, New Delhi, 2006.
2. M.N. Avadhanulu and P.G. Kshirsagar, A Textbook(s)of Engineering Physics, S. Chand & Company Ltd.,
New Delhi, 2005.
3. P.K. Palanisami, Physics For Engineers, Scitech Publications (India) Pvt. Ltd, Chennai, 200
4. V. Raghavan, Materials Science and Engineering, Prentice Hall of India, New Delhi, 2009.
5. M. R. Srinivasan, Physics for Engineers, Reprint, New Age International Publications, New Delhi, 2002.
11O205 BASICS OF CIVIL AND MECHANICAL ENGINEERING
4
0
0
4.0
Objective(s)


To impart basic knowledge in the field of Civil Engineering focusing building materials, surveying,
foundation and transportation Engineering
To impart basic knowledge in the field of Mechanical Engineering focusing on generation of power from
various natural resources and to know about various types of Boilers and Turbines used for power
generation and to understand the working of IC engines and basic manufacturing processes
Program Outcome(s)
Course Outcome(s)
1. Able to understand the fundamental philosophy of Civil engineering and enable them to work together in a
multidisciplinary technical team.
2. Able to identify the nature of building components, functions, construction practices and material qualities
3. Able to demonstrate the manufacturing processes like casting, welding, machining operations
4. Able to demonstrate the construction and working of IC engines and refrigerators
5. Able to demonstrate the working principle of boilers, turbines and various power plants utilizing
conventional and non-conventional sources of energy
Assessment Pattern
Bloom’s Taxonomy
S. No.
(New Version)
1
Remember
2
Understand
3
Apply
4
Analyze / Evaluate
5
Create
Total
†
Test I
Test II†
40
30
20
100
40
30
20
100
†
Model
Examination†
40
30
20
100
End Semester
Examination
40
30
20
100
The marks secured in Test I and II will be converted 20 and Model Examination will be converted to 20. The remaining 10 marks will be
calculated based on assignments. Accordingly internal assessment will be calculated by giving equal weightage (50%) for both Civil and
Remember
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
48.
49.
50.
51.
52.
53.
What are the classifications of stones?
What is the frog in a brick?
What is quarrying?
What do you mean by dressing of stones?
What are the systems of bearing?
How the surveying is classified based on purpose?
Define Benchmark and state its effects.
What are the accessories used in chain surveying?
Define bearing of a line.
Define leveling & state its Objective(s).
State the Objective(s) and requirement of good foundation.
Mention the site improvement techniques.
Define bearing capacity of soil.
How stone masonry is classified?
Define Beam, Column and Lintel.
What are the basic forms of roof?
How floors are classified based on floor finish?
List the materials used for damp proofing.
How roads are classified?
What do you mean by W.B. M. road?
Define Gauge.
What is a permanent way?
How bridges are classified?
What are the advantages of railways?
What are docks?
Classify sleepers.
What are the requirements of a sleeper?
What are the types of traffic signs?
What are the advantages of road signs?
What are the prohibitory signs?
What is the main function of hangars?
What are the sources of Energy Generation?
What are the accessories used in a boiler?
Define Turbine.
Compare and contrast fire tube and water tube boiler?
List the types of steam Turbines?
Classify the I.C engine.
List out the Part of the I.C. Engine.
Define the terms: Top Dead Center, Bottom Dead Center.
Define the term: Compression Ratio.
What are the different sources of energy?
Name four non-renewable sources of energy.
Name some renewable sources of energy.
Name four solid/liquid/gaseous/ fuels.
Name two nuclear fuels.
What are the advantages of wind energy?
State some of the applications of steam boilers.
Classify different steam boilers.
What do you understand by Scavenging
What do you understand by the term IC engine?
What are the operations performed on a Lathe?
What is impulse turbine? Give example.
What is Reaction turbine? Give example.
32
54.
55.
56.
57.
58.
59.
Define Boiler.
Classify Boilers.
List out the Boiler Mountings and Accessories.
Define Refrigeration.
Define refrigerant. Give some examples of refrigerant.
Define C.O.P.
Understand
1. What are the qualities of good building stone?
2. What are the various stages of manufacturing brick?
3. What is mean by concrete?
4. State the properties of cement concrete.
5. What is curing of concrete?
6. What is water – cement ratio?
7. What is the difference between a plan and a map?
8. Differentiate between plane surveying and geodetic surveying.
9. State the principles of surveying.
10. What is the use of cross – staff?
11. What are the functions of foundation?
12. Differentiate between shallow foundation & deep foundation
13. What are the causes of failure of foundation?
14. Compare stone masonry and brick masonry.
15. Why bonding in brick wall is necessary?
16. State the special features of English and Flemish bond.
17. Define super elevation.
18. What are the uses of fish plates?
19. What are the necessities of highway drainage?
20. What are the three stages of construction of a new railway track?
21. Define the term visibility.
22. Define passenger flow.
23. Differentiate between wharf and jetty.
24. What are the requirements of a good harbour?
25. What are the requirements of a good naval port?
26. How Solar Energy is generated?
27. How Energy is Generated using steam Turbines?
28. How power plants are classified?
29. Compare and contrast reaction and impulse turbines.
30. How energy is generated from Diesel Power Plants?
31. What is the difference between renewable and non-renewable sources of energy?
32. Mention the applications of solar energy.
33. What is the function of a hydraulic turbine?
34. What is the function of a surge tank?
35. What is the function of a moderator?
36. What are the functions of a control rod?
37. Name of the important components of diesel power plant.
38. Name the important parts of gas turbine.
39. State the function of condenser in steam power plant.
40. What are the requirements of a good boiler?
41. What are the specific advantages of water-tube boilers?
42. What are the aims of pre-heating of air in a boiler?
43. State the function of economizer.
44. How does a fusible plug function as a safety device?
45. What is the function of a steam nozzle?
46. What is the function of flywheel?
47. What is the function of a spark plug?
33
48.
49.
50.
51.
52.
53.
54.
55.
56.
57.
58.
59.
60.
34
What is the function of a fuel injector in diesel engine?
Why is cooling necessary in an IC engine?
Define compression ratio of an IC engine.
List the ports used in a 2-stroke engine
What are the requirements of a good boiler?
What is the difference between impulse and reaction turbine?
How energy is generated from Nuclear Power Plants?
How energy is generated from Hydro Power Plants?
Compare and contrast 4 stroke and 2 stroke engine.
What is the Purpose of a fusible Plug?
Differentiate petrol & diesel engines.
How Taper Turning is carried out in Lathes?
Various Mechanical properties of Cast Iron, Steel and HSS.
Apply/Evaluate
1. What is Hardness?
2. What are the operations to be performed while setting up a plane table at a station?
3. Explain the steps involved in measuring vertical angle of an object using theodolite
4. Explain the methods to improve bearing capacity of soil
5. What are the points to be observed in the construction of brick masonry?
6. Explain the method of construction of cement concrete flooring.
7. What are the methods of applying surface dressing in bituminous roads?
8. Explain the construction steps in bituminous macadam road.
9. How can you express the hardness number of stones?
10. Apply the concept of power generation and saving from other energy sources
11. Apply the concept of Refrigeration in Heat removal and Heat addition
12. Draw the pressure-velocity diagram for a single stage impulse turbine.
Unit I
Introduction to Civil Engineering
History, development and scope of Civil Engineering - Functions of Civil Engineers. Construction Materials:
Characteristics of good building materials such as stones - Bricks, A.C. sheets - G.I. sheets and Ceramic tiles Timber, cement - Aggregates and concrete. Surveying: Definition and purpose – Classification – Basic principles –
Measurement of length by chains and tapes – Calculation of area of a plot – Measurement of bearings and angles
using a prismatic compass – Leveling – Contours
10 Hours
Application of contours
Unit II
General Concepts Relating to Buildings
Selection of site – Basic functions of buildings – Major components of buildings. Foundations: Purpose of foundation
– Bearing capacity of soils – Types of foundations. Proper methods of construction of: Brick masonry – Stone
masonry – Hollow Block masonry. Beams – Lintels – Columns – Flooring – Doors and windows – Roofing
10 Hours
Damp proof course – Surface finishes
Unit III
Transportation Engineering
Classification of Highways – Cross sections of water bound macadam - Bituminous and cement concrete roads –
Traffic signs and signals. Importance of railways - Gauges – Components of a permanent way – Classification of
bridges – Components of Airport
Examples of Marvelous Structures
10 Hours
35
Unit IV
Engineering Materials and Manufacturing Processes
Classification of Engineering materials, Mechanical properties and uses of cast iron, steel, and High Speed Steel.
Introduction to casting process, Green sand moulding - Pattern, Melting furnaces - Cupola and Electric Furnace.
Metal Forming - Forging Process. Introduction to Arc and Gas Welding. Centre Lathe - Specifications - Principal
parts - Operations - Straight turning, Step turning, Taper turning methods, Knurling, Thread cutting methods, Facing,
Boring, and Chamfering - Lathe tools and Materials. Drilling – Radial drilling machine - Specification and Operation
10 Hours
Milling operation
Unit V
Internal Combustion Engines and Refrigeration
Classification of IC engines, Main components of IC engines, working of a 4 stroke & 2 stroke petrol & diesel
engine, differences between 4 stroke and 2 stroke engine, Lubrication and Cooling systems in IC Engines.
Refrigeration: Working Principle of Vapour Compression & Vapour Absorption System, Domestic refrigerator
10 Hours
Domestic air conditioning
Unit VI
Alternate Sources of Energy, Power Plants and Boilers
Solar, Wind, Tidal, Geothermal and Ocean Thermal Energy Conversion (OTEC). Power Plant: Classification of
Power Plants- Steam - Nuclear, Diesel, and Hydro Power Plants. Types of Boilers – Simple Vertical, Babcock and
Wilcox and La-Mont Boiler, Differences between fire tube and water tube boiler. Types of steam turbines- working
of a single stage impulse and reaction turbines
10 Hours
Biomass and Biofuels in power generation
Total: 60 Hours
Textbook(s)
1. M. S. Palanichamy, Basic Civil Engineering, Tata McGraw-Hill Publishing Company Limited, New Delhi,
2009
2. G. Shanmugam & S. Ravindran, Basic Mechanical Engineering, Tata McGraw-Hill Publishing Company
Limited, New Delhi, 2010
Reference(s)
1. N. Arunachalam, Bascis of Civil Engineering, Pratheeba Publishers, 2000
2. B. K. Sarkar, Thermal Engineering, Tata McGraw-Hill Publishing Company Limited, New Delhi, 2008
3. P. N. Rao, Manufacturing Technology: Foundry, Forming and Welding, Tata McGraw-Hill Publishing
Company Limited, New Delhi, 2003.
4. S. R. J. Shantha Kumar, Basic Mechanical Engineering, Hi-tech Publications, Mayiladuthurai, 2000
5. http://www.tutorvista.co.in/content/science/science-ii/sources-energy/sources-energyindex.php
6. http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-ROORKEE/MANUFACTURING-PROCESSES/
index.htm
11Z206 STRUCTURED PROGRAMMING
(Common to CSE and IT)
4 0 0 4.0
Objective(s)
 To develop the programming skills of students
 To understand the basic concepts of pointers
 To implement file concepts and operations
Program Outcome(s)
a) Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize
b) Demonstrate problem solving and design skills including the ability to formulate problems and their
36
Course Outcome(s)
 Programming ability.
 Developing applications for real world problems.
Assessment Pattern
S. No.
1.
2.
3.
4.
5.
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze/ Evaluate
Create
Total
Test I
Test II†
20
30
30
20
0
100
20
20
30
20
10
100
†
Model
Examination†
15
15
30
20
20
100
End Semester
Examination
20
10
30
20
20
100
Remember
1. What is a Computer?
2. List five programming languages commonly used.
3. Define Algorithm and Flowchart.
4. What is structured programming?
5. What is the general structure of a C program?
6. List the rules for defining a variable.
7. What are the I/O functions in C?
8. What is a header file?
9. State the associativity property of an operator.
10. Define a ternary operator. Give example
11. What is an array and a pointer?
12. What is the significance of function?
Understand
1. Compare while loop with do – while Loop.
2. What are the advantages of using Macro?
3. Explain how recursive functions affect the run time efficiency.
4. Differentiate between Structure and Union in C.
5. How is memory managed in C?
6. How garbage collection is done in C?
Apply
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
†
Write a recursive function to calculate the factorial of number.
Write a C program to check whether the given number is palindrome or not
Write a program to check whether the given number is prime or not.
Write a C program to find the roots of quadratic equation ax 2+bx+c=0.
Write a C program to find average of „n‟ numbers.
Write a program to generate the pay slip of an employee using Structure.
Write a C program to search for a specified element in an array.
Write a program to compute Matrix Multiplication.
Write a program to perform swapping of two numbers using pointers.
Write a program to read the content of the file and copy it to another file.
The marks secured in Test I and II will be converted 20 and Model Examination will be converted to 20. The remaining 10 marks will be
calculated based on assignments. Accordingly internal assessment will be calculated by giving equal weightage (50%) for both Civil and
37
Analysis
1. Explain the difference between while and do-while statements
2. Why are pointers so powerful? Analyze their efficiency giving an example?
3. Is there any advantage of using recursion over looping control structures? Give a suitable example.
4. Illustrate the Limitation of array of pointers to strings using a sample example.
Evaluate
1. Differentiate the keywords BREAK and CONTINUE.
2. Justify the need for Type Casting over Type Conversion.
3. Compare and contrast I/O mapped I/O with Memory mapped I/O.
4. Summarize the various built in String functions.
Create
1. Create a structure to store the following details: Rollno, Name, Mark1, Mark2, Mark3, Total, Average, Result
and Class. Write a program to read Rollno, name and 3 subject marks. Find out the total, result
and class as follows:
a) Total is the addition of 3 subject marks.
b) Result is "Pass" if all subject marks are greater than or equal to 50 else "Fail".
c) Class will be awarded for students who have cleared 3 subjects
i. Class "Distinction" if average >=75
ii. Class "First" if average lies between 60 to 74 (both inclusive)
iii. Class "Second" if average lies between 50 & 59 (both inclusive)
d) Repeat the above program to manipulate 10 students' details and sort the structures as per rank obtained
by them.
Unit I
Introduction
Computer languages - Creating and Running Programs-System Development - Flowcharting - Introduction to C
language – background - C Programs - Identifiers-Types-Variables-Constants - Input/Output - Structure of C
Program-Expressions- Operator Precedence and Associatively -Type Conversion-Statements.
12 Hours
Study of various header files.
Unit II
Control Structures
Selection-Making Decisions-Logical data and Operators-Two Way Selection- Multiway Selection-More Standard
Functions-Incremental Development –Repetition –Concept of Loop-pretest and Post Test loops- Initialization and
Updating.
12 Hours
Evaluation of expression
Unit III
Arrays and Strings
Arrays-Concepts-Using arrays in C -array Applications-Sorting and Searching of Arrays-Two Dimensional ArraysMulti Dimensional Arrays-Strings-String Concepts -String Input/output Functions-Arrays of Strings-String
Manipulation Functions - Data Conversion.
12 Hours
Applications of array in real world problems
Unit IV
Functions and Pointers
Functions-Designing structured Programs- Functions in C- User Defined Functions-Standard Functions -Storage
classes and Type Qualifier-Pointers- Introduction- Pointers to Pointers- compatibility-Lvalue and Rvalue.
12 Hours
Dynamic memory allocation
38
Unit V
Structures, Union and Files
Structure and Union - Programming Application.-Text Input/Output-Files-streams-Standard Library Input/Output
Functions- Formatting Input/Output functions- Character Input/Output functions.
12 Hours
Manipulation of array and structures using pointers
Total: 60 Hours
Textbook(s)
1. Behrouz A.Forouzan and Richard F. Gilberg, Computer Science: A Structure program approach using C,
Cengage learning–2008.
Reference(s)
1. Byron S. Gottfried, Schaum's Outline of Programming with C, McGraw Hill, 1996.
2. D.M.Ritchie and B.W.Kernighan, C Programming Language, PHI, 2000.
3. Deitel & Deitel, C How to program, PHI, 2001.
4. Herbert Schildt, C- The complete Reference, McGraw Hill, 2010.
5. Gary J Bronson, First book of ANSI C, Thomson Learning, 2001.
11Z207 STRUCTURED PROGRAMMING LABORATORY
(Common to CSE and IT)
0 0 3 1.5
Course Objective(s)
 To understand the ways to write a C program effectively
 To impart the fundamental knowledge of C Programming methodologies to the students
 Make the students to understand the concepts of pointers
Program Outcome(s)
Skill Set
 Design the flowchart and write efficient code for problems like recursive and iterative programs.
 Comprehend the following terms in the context of problem solving by a computer: Problem specification,
input-output analysis, algorithm, flowchart, pseudo-program, programming language, assembly language,
machine language, compiler, assembler, program correctness.
 Create examples where arrays are better than pointers and examples where pointers are better than arrays.
 Create examples where iteration is better than recursion and recursion is better than iteration.
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Preparation
Record
Mini-Project/Model
Examination/Viva-Voce
Total
Internal
Assessment
10
15
10
15
End Semester
Examination
15
20
15
50
50
Remember
1. What is a Computer?
2. List five programming languages commonly used.
3.
4.
5.
6.
7.
8.
9.
10.
39
Define Algorithm and Flowchart.
What is structured programming?
What is the general structure of a C program?
List the rules for defining a variable.
What are the I/O functions in C?
What is a header file?
State the associativity property of an operator.
Define a ternary operator. Give example
Understand
1. Compare while loop with do – while Loop.
2. What are the advantages of using Macro?
3. Explain how recursive functions affect the run time efficiency.
4. Differentiate between Structure and Union in C.
5. How is memory managed in C?
6. What are the advantages of using Command line Arguments?
7. How garbage collection is done in C?
Apply
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Write a recursive function to calculate the factorial of number.
Write a C program to check whether the given number is palindrome or not
Write a program to check whether the given number is prime or not.
Write a C program to find the roots of quadratic equation ax 2+bx+c=0.
Write a C program to find average of „n‟ numbers.
Write a program to generate the pay slip of an employee using Structure.
Write a C program to search for a specified element in an array.
Write a program to compute Matrix Multiplication.
Write a program to perform swapping of two numbers using pointers.
Write a program to read the content of the file and copy it to another file.
Analysis
1. Explain the difference between while and do-while statements
2. Why are pointers so powerful? Analyze their efficiency giving an example?
3. Is there any advantage of using recursion over looping control structures? Give a suitable example.
4. Illustrate the limitation of array of pointers to strings using a sample example.
Evaluate
1. Differentiate the keywords BREAK and CONTINUE.
2. Justify the need for Type Casting over Type Conversion.
3. Compare and contrast I/O mapped I/O with Memory mapped I/O.
4. Summarize the various built in String functions.
Create
1. The Electricity Production company has to print up the bills for its customers at the following rate:
For the 1st 50 KWH
rate is Rs.2
For the next 100 KWH
rate is Rs.6
For the next 200 KWH
rate is Rs.7
For more than 350 KWH
rate is Rs.8
Write a program to do the above and the output should be in the following order Customer name, Number of
Units and the Total Bill.
2.
Define a structure that can describe the employees with the fields Eno, Ename. Basic. Write a program to
calculate DA = 32% of Basic. HRA = 15% of Basic. CCA = 10% of BASIC, PF = 150,0 of Basic and print
all details with Net pay All processing should be using pointer notation.
40
List of Experiments
Operators and Expressions
1. a) Read two integers from the user and perform all arithmetic operations on them and display the result
1. b) Find the greatest of three numbers using ternary operator
Conditional statements
2. a) Find the greatest of three numbers using if-else statement
2. b) Given the values for the coefficients of quadratic equation, find and display the type of its roots (Use switch
statement)
Looping statements
3. a) Find the sum of digits of the given number
3. b) Generate the following output
1
1 2
1 2
3
1 2
3
4
1 2
3
4
5
One dimensional arrays
4. Read a list of ‗n‘ numbers and find their sum and average
Two-dimensional arrays
5. Read the elements of two matrices and perform matrix multiplication
Strings
6.a) Count the number of vowels in the given line of text
6.b) Check whether the given string is palindrome or not
Functions
7.a) Find the factorial of given number
7.b) Do the same by defining recursive function
Structures
8. Design a structure to hold the following details of a student. Read the details of a student and display them in
the following format Student details: rollno, name, branch, year, section, cgpa
***************************************
NAME:
ROLL NO:
BRANCH:
YEAR:
SECTION:
CGPA:
****************************************
File Manipulation
9. Write a C program to read the content of the file and copy it to another file.
41
Command line arguments/Pointer
10.a) Read two integers as command line arguments and perform arithmetic operations on them. Display the
result
10. b) Swap the values of two variables using pointers
Mini Project
Total: 45 Hours
11O208 ENGINEERING GRAPHICS
(Common to ME, EE, BT, IT, TT & FT – [I Semester], CE, AE, CSE, ECE & EIE – [II Semester])
2 0 2 3.0
Objective(s)



Understand and appreciate the importance of Engineering Graphics in Engineering
Understand the basic principles of Technical/Engineering Drawing
Understand the different steps in producing drawings according to BIS conventions
Program Outcome(s)
Course Outcome(s)
 Projection of various components according to BIS specifications.
 Assembly of datas and information of various components in visualized way
 Interpretation of technical graphics assemblies
 2D modeling by AutoCAD
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Preparation
 Remember
 Understand
 Apply
 Analyze
 Evaluate
Record
Mini-project/
Model examination/
Viva-voce
Total
Remember
1. Define Graphic communication or Drawing.
2. List the different drawing instruments.
Internal
Assessment
End Semester
Examination
15
15
10
25
10
-
15
10
50
50
42
3. What is blueprint?
4. What are the applications of engineering graphics?
5. What are the two types of drawings?
6. What are the different types of projections?
7. Define Orthographic projection.
8. What do you mean by I angle projection?
9. What is III angle projection?
10. Define Plan.
11. What is Elevation?
12. List the various types of lines.
13. What do you mean by a Plane?
14. Name the five standard sizes of drawing sheets that are specified by BIS.
15. Give the BIS codes for Lettering, Dimensioning and lines.
16. State few important dimensioning rules.
17. What are the two types of Solids?
18. What is Representative Fraction (RF)?
19. What is a Frustum?
20. Define Truncation.
21. Define Section Plane and give its types.
22. What do you mean by development of surfaces?
23. State the principle of Isometric projection.
24. What is Isometric View?
25. Define Isometric scale.
Understand
1. When an object is said to be in III quadrant?
2. Why are the projectors perpendicular to the Projection Plane in the Orthographic projection?
3. What is the Shape of the section obtained when a cone is cut by a plane passing through the apex and center
of the base of the cone?
4. Why II and IV angle projections are not used in industries?
5. What are the differences between I angle and III angle projections?
6. Which method is suitable for developing a truncated prism?
7. Why is a hexagonal headed bolt and nut more common in use as compared to square headed bolt and nut?
8. Which is the most suitable method for drawing the Perspective Projection?
9. What are the prerequisites for Free hand sketching?
10. What are the two methods used to obtain the Isometric view of a circle?
11. Why CAD is preferred over Conventional drafting?
Apply/Evaluate
1.
2.
3.
4.
5.
6.
7.
8.
How will you project a point which is above HP and in front of VP?
How will you project a point which is below HP and behind VP?
What is the method used to determine the True length and inclination of a line inclined to both the planes?
How will you project a prism whose axis is inclined to HP and parallel to VP by Change of Position method?
How will you project a cylinder when the axis is inclined to VP and parallel to HP by change of position method?
How will you project a pyramid whose axis is inclined to HP and parallel to VP by Change of Position method?
How will you project a cone when the axis is inclined to VP and parallel to HP by change of position method?
How will you obtain the Sectional view of solids in simple vertical position cut by planes inclined to any one reference
plane?
9. How will you develop the lateral surfaces of simple and truncated solids?
10. How will you develop the complete surfaces of Frustums?
Create
1. Construct an isometric scale.
2. A cricket ball thrown from the ground level reaches the wicket keeper‘s gloves. Maximum height reached by the
ball is 5m. The ball travels a horizontal distance of 11m from the point of projection. Trace the path of the ball.
3. The Pictorial view of an object is shown below. Draw the following views to full size scale.
43
a) Elevation in the direction of arrow
b) Left end elevation
c) Plan
4.
Read the dimensioned drawing shown below. Redraw the figure to full size and dimension it as per Indian
Standards.
Unit I
Concepts and Conventions
Use of drafting instruments – BIS conventions and specifications – Size, layout and folding of drawing sheets –
Lettering and dimensioning. General principles of orthographic projection – First angle projection – Layout of views
44
– Projection of points, located in all quadrant and straight lines located in the first quadrant – Determination of true
lengths and true inclinations.
6 Hours
Conics: Different types and applications – Construction by Eccentricity method.
Unit II
Projections of Solids
Projection of simple solids like prisms, pyramids, cylinder and cone when the axis is inclined to one reference plane
by change of position method.
6 Hours
Projection of Planes inclined to any one reference plane.
Unit III
Sections of Solids and Development of Surfaces
Sectioning of solids like prisms, pyramids, cylinder and cone in simple vertical position by cutting planes inclined to
one Reference: plane – Obtaining the true shape of section. Development of lateral surfaces of simple solids – prisms,
pyramids, cylinders and cones.
6 Hours
Intersection of Solids.
Unit IV
Isometric Projection and Perspective Projection
Principles of isometric projection – isometric scale – isometric projections of simple solids, pyramids, cylinders and
cones. Orthographic projection - Systems of orthographic projection - First angle orthographic projection Conversion of pictorial to orthographic views (Free hand).
6 Hours
Perspective projections: Perspective projection of solids by vanishing point method.
Unit V
Introduction to AutoCAD and 2D Modelling
Starting AutoCAD – Interfaces – Menus – Tool bars – Coordinates – Limits – Units – 2D commands – Drawing
Commands - Creating a Point, Construction of Lines, Polyline, Multiline, Circles, Arcs, Rectangle, Polygon, Ellipse,
Hatch, Text, Mtext, Linetypes – Edit and Modify commands - Copy, Move, Erase, Mirror, Zoom, Pan, Arrays, Trim,
Break, Fillet, Chamfer, Redraw, Regen, Dimensioning, Colors, Layers – Exercises.
6 Hours
Introduction to 3D modeling.
Total: 30 Hours
Textbook(s)
K. V. Natarajan, A Textbook(s): of Engineering Graphics, Dhanalakshmi Publishers, Chennai, 2006.
Reference(s)
1. S. Julyes Jaisingh, Engineering Graphics, Tri Sea Publishers, 2010
2. V. Rameshbabu, Engineering Graphics, VRB Publishers Pvt Ltd., 2009.
3. K. Venugopal, Engineering Graphics, New Age International (P) Limited, 2002.
4. N. D. Bhatt, Engineering Drawing, Charotar publishing House 2003.
5. K. L. Narayana and P. Kannaiah, Engineering Graphics, Scitech Publications (Pvt) Limited-2002
List of Experiments
1. Projection of points located in all quadrants.
2. Projection of straight lines located in the first quadrant inclined to both the planes.
3. Determination of true lengths and true inclinations of Straight lines.
4. Projection of Solids like prisms, pyramids, cylinder and cone when the axis is inclined to one reference
plane by change of position method.
45
5.
Sectioning of solids in simple vertical position by cutting planes inclined to one reference plane and
obtaining true shape of section.
6. Development of lateral surfaces of simple and truncated solids like prisms, pyramids cylinder and cone.
7. Isometric Projections / Views of Solids like prisms, pyramids and Cylinders.
8. Orthographic Projection of various components from pictorial views.
9. Drawing of front, top and side views from given pictorial views using AutoCAD.
10. Drawing sectional views of prism, pyramid and cylinder using AutoCAD.
Practical Schedule
Sl.
No
Experiment
Hours
1
2
Projection of points located in all quadrants
3
Projection of straight lines located in the first quadrant inclined to both the planes.
3
3
4
Determination of true lengths and true inclinations of Straight lines
3
Projection of Solids when the axis is inclined to one reference plane by change of
position method.
3
5
Sectioning of solids in simple vertical position by cutting planes inclined to one
reference plane and obtaining true shape of section
3
6
7
8
9
Development of lateral surfaces of simple and truncated solids.
Isometric Projections / Views of Solids like prisms, pyramids and Cylinders.
Orthographic Projection of various components from pictorial views.
3
3
3
Drawing of front, top and side views from given pictorial views using AutoCAD.
3
10
Drawing sectional views of prism, pyramid and cylinder using AutoCAD.
3
11Z209 WORKSHOP PRACTICE
0 0 2 1.0
Objective(s)
 To learn the use of basic hand tools and
 To know the need for safety in work place
 To gain hands on experience on Carpentry, Fitting, Sheet metal, Plumbing, Arc welding, Foundry and Basic
electrical circuits
 To have the basic knowledge on working of domestic appliances.
Program Outcome(s)
Course Outcome(s)
 Perform basic Carpentry work
 Perform basic Fitting work
 Fabrication of Sheet metal objects
 Plumbing work
 Arc welding skill
 Preparing green sand mould
 Soldering skill
46
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Preparation
 Remember
 Understand
 Apply
 Analyze
 Evaluate
Record
Mini-Project/
Model Examination /
Viva-Voce
Total
Internal
Assessment
End Semester
Examination
20
25
5
10
10
-
15
15
50
50
Remember
1. What are the tools used in sheet metal work?
2. What are the types of joints in sheet metal work?
3. What is moulding?
4. What is green sand mould?
5. What is gas welding?
6. List out the types of flames in welding.
7. What is meant by carpentry?
8. What is the use of Saw?
9. What are the types of joints in pipe connection?
10. What is staircase wiring?
11. What is the working principle of centrifugal pump?
12. What are the types of valves in plumbing and where it is used?
13. List out the cutting tools used in carpentry with specification.
14. What are the necessary equipments used in Arc Welding?
15. What are the methods used in sheet metal work?
16. List out the types and components of Air- Conditioner.
Understand
1. Compare the Refrigeration system with air Condition system?
2. How the refrigeration system works?
3. How will you select the suitable welding process for various materials?
4. How will make a V joint in the given MS flat?
5. How will you make a green sand mould using solid pattern? How gadget like chair, sofa, table, cell phone
stand by using welding joints?
6. How will make English letters from A to Z by using carpentry tools with screw, bolt and nut?
7. How metals are manufactured by using casting process?
8. How cavity is formed by using pattern?
9. How the wires are joined by soldering?
Apply / Evaluate
1. Sketch the line diagram of the plumbing work carried out in your house.
2. Sketch the wiring diagram for a room consist of two fans ,three tubelights, and one plug point.
3. Sketch all the wooden furniture present in your house in three dimensional view.
4. How will make a connection of basic pipe lines, using PVC pipes, that includes valves and
5. How will form Staircase and Godown wiring?
taps?
47
Create
1. Prepare a hexagonal shape pen stand by using power tools.
2. Prepare a cover with handle by using sheet metal to cover a motor.
3. Prepare a small trolley to carry wastage by using welding work?
Common for all branches
1. Forming of simple objects using sheet metal
2. Preparing a V joint from the given MS flat
3. Demonstration of Assembly and Disassembly of centrifugal pump
4. Making simple gadget like chair, sofa, table, cell phone stand by using welding joints
5. Making simple gadget like pen stand, box, wooden box, cell phone stand etc., by using power tools
6. Making a connection of basic pipe lines, using PVC pipes, that includes valves and taps.
7. Demonstration of working of domestic appliances: Machine/ Refrigerator and Window Air-Conditioner
Department Specific
1. Computer Spares and Components – Study Experiment
2. Computer Assembly and Disassembly
3. Operating System Installation (Windows and Linux) and Peripheral Installation
4. Configuring Network on a Desktop Computer
5. Computer Trouble Shooting
Total: 30 Hours
11Z301
NUMERICAL AND STATISTICAL METHODS
3 1 0 3.5
Objective(s)
 Acquire the knowledge of finding approximate solutions of algebraic, transcendental, differential and
integral equations by numerical methods and interpolating the values of a function using Lagrange‘s and
Newton‘s polynomial approximations.
 To introduce statistical hypothesis test for making decisions using data.
m) Apply basic principles and practices of computing grounded in mathematics and science to successfully
research.
i. An ability to demonstrate basic competence in electronics and electrical engineering design and
analysis using applications of mathematics, physics and engineering principles.
ii. An ability to apply engineering tools and techniques to conduct engineering design/experiments
as well as to analyze and interpret data.
iii. An ability to develop confidence for self learning and lifelong learning.
iv. Manage resources like men, money, machinery and material with modern management tools.
v. An ability to participate and succeed in competitive examinations.
Course Outcome(s)
2. To improve problem evaluation technique.
3. Choose an appropriate method to solve a practical problem.
4. Applications of Numerical methods in computer field.
48
Assessment pattern
S.
No
Bloom’s
Taxonomy
(New Version)
Test I5
Test II1
Model
Examination1
End Semester
Examination
1
Remember
20
20
20
20
2
Understand
40
40
40
40
3
Apply
30
30
30
30
4
Analyze/
Evaluate
10
10
10
10
5
Create
-
-
-
-
100
100
100
100
Total
Remember
1. Define Algebraic and Transcendental equations.
2. Write the formula for Regula Falsi method and Newton‘s method.
3. What do you mean by Interpolation?
4. State Newton‘s Divided difference formula.
5. State the derivatives of Newton‘s Forward and Backward Interpolation formula .
6. Write the conditions for applying Trapezoidal and Simpson‘s rules.
7. Mention the multistep methods available for solving ordinary differential equation .
8. Write the formula for Euler‘s and Modified Euler‘s method.
9. When do we say the sample is a small sample?
10. What is the Level of Significance usually employed in testing of hypothesis.
Understand
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
What is a transcendental equation?
What is the condition of convergence of Regula Falsi position method?
State the order and condition of convergence of Newton‘s method.
What are the methods for solving simultaneous algebraic equations?
Write the differences between Direct and Iterative methods.
State the sufficient condition for solving Gauss seidel method.
What do you mean by Power method?
Write Milne‘s and Adam‘s Predictor, Corrector formula.
What are the errors in testing of hypothesis?
What is the importance of confidence limits in testing of hypothesis?
Apply
1. Obtain by power method, the numerically largest eigen value of the matrix
 15
A    10
 20
5
4
12
4
 3
1

(0)
with
the
starting
vector
 6
x  1 .Perform only 4 – iterations.
1
 2
50 marks.
2. Find
N , where N is a real number, by Newton‘s method.
3. Find the parabola of the form y=ax2+bx+c passing through the points (0,0) , (1,1) & (2,20).
4. A third degree polynomial passes through (0,-1), (1,1),(2,1) & (3,-2) find its value at x=4.
x:
f ' (8) from the table given below
5. Find the value of
6
7
9
12
f ( x) : 1.556 1.690 1.908 2.158
6. The table given below reveals the velocity V of a body during the time ‗t‘ specified. Find its acceleration
t:
at t = 1.1
1.0
1.1
1.2
1.3
1.4
v : 43.1 47.7 52.1 56.4 60.8
7. Solve dy/dx=y2 -x2 / y2+x2 with y(0)=1 at x=0.2 find y .
8. Using Eulers‘s method, find y(0.01) from dy/dx= -x, y(0)=1.
9
What is the importance of confidence limits in testing of hypothesis?
10. 40 people were attacked by a disease and only 36 survived. Will you reject the hypothesis that
the survival rate , if attacked by this disease is 85% in favour of the hypothesis that it is more , at 5%
level of significance.
Analyze / Evaluate
1. Using Newton‘s method, find the positive root of cos x = 3x - 1 .
2. Solve by Gauss-Elimination method : 6x + 3y +12z = 36; 8x - 3y +2z = 20; 4x +11y – z =33 .
3. Use Lagrange‘s interpolation formula to find the value of x when y = 20 for the following data.
X : 1
2
3
4
Y : 1
8
27
64
4. By Newton‘s divided difference formula find f (301).
5.
x
300
304
305
307
y
2.4771
2.4829
2.4843
2.4871
A rod is rotating in a plane. The following table gives the angle
various values of the time t seconds
2. 2 2.6
6. Evaluate
t: 0
0.2
0.4

0.6
through which the rod has turned for
0.8
 : 0 0.12 0.49 1.12 2.02 3.20
dydx
using Trapezoidal formula.
2
 y2
x
2
1
1
7. Given 5 x y  + y 2 – 2 = 0 ; y (4 ) = 1;
i) y ( 4.2 ) by Euler‘s method
iii) y ( 4.4 ) by Adam‘s method.
y (4.1) = 1.0049 find
ii) y (4.3) by Runge-kutta method
iv) y (4.5) by Milne‘s method.
49
50
8. Using Taylor series method, find the value of y (0.1), given dy /dx = x + y and y (0) =1 and correct
to 3 decimal places .
9. A certain drug is claimed to be effective in curing cold. In an experiment on
500 persons with cold,
half of them were given the drug and half of them were given the sugar pills. The patient‘s reaction to
the treatment is recorded in the following table.
Helped
Harmed
No effect
Drug
150
30
70
Sugar pills
130
40
80
On the basis of this data, can it be concluded that the drug and sugar pills differ significantly in curing
cold?
10. Random samples of 400 men and 600 women were asked whether they would like to have a school near
their residence. 200 men and 325 women were in favor of the proposal . Test the hypothesis that the
proportion of men and women in favor of the proposal are same, at 5% level of significance.
Unit I
Solution of Algebraic and Transcendental Equations
Newton Raphson method - Method of false position - Graffe‘s root squaring method - Bairstow‘s method. Solution
of system of linear equations : Gauss elimination method - crout‘s method and Gauss-seidel method . Eigen value of
a matrix by power method.
9 Hours
Unit II
Finite Differences and Interpolation
Interpolation : Difference table - Newton‘s forward and backward interpolation - Newton‘s divided difference
interpolation formula-Lagrange‘ s interpolation formula.
9 Hours
Unit III
Numerical Differentiation and Integration
Numerical differentiation using Newton ‗s forward and backward interpolation. Numerical integration- Two and
Three point Gaussian quadrature formulae .Trapezoidal rule and Simpson‘s 1/3 and 3/8 rules- Double integrals using
Trapezoidal rule and Simpson‘s rules
9 Hours
Unit IV
Initial Value Problems for Ordinary Differential Equations
Single step Methods: Taylor‘s series method for solving first and second order equations-Euler‘s and Modified
Euler‘s method -Fourth order Runge- Kutta method for solving first order equations-Multistep Methods: Milne‘s and
Adams- Bashforth predictor and corrector methods.
9 Hours
Unit V
Testing of Hypothesis
Sampling distributions – Testing of hypothesis for mean, variance, proportions and differences using normal, t, Chisquare and F distributions- Tests for independence of attributes and Goodness of fit.
9 Hours
Total: 45+15 Hours
MAT LAB: Invited Lectures on Mat lab and its applications on Numerical methods.
51
Textbook(s)
1.
2.
Grewal B. S, Numerical Methods in Engineering and Science with Programms in C & C++, Ninth Edition,
Khanna Publications, 2010.
Johnson R.A, Miller and Freund‘s Probability and Statistics for Engineers, Seventh Edition, Prentice Hall
of India, New Delhi, 2005.
Reference(s)
1.
2.
3.
4.
Jain M.K, Iyengar S.R.K , Jain R.K, Numericl Methods For Scientific & Engineering Computation, New
Age International ( P ) Ltd , New Delhi , 2005.
Gerald C.F and Wheatley P. O, Applied Numerical Analysis, Seventh Edition, Pearson Education, New
Delhi, 2004.
Burden R. L and Douglas Fairs J, Numerical Analysis Theory and Applications, Cengage Learning, 2005.
Gupta S.C and Kapur J.N, Fundamentals of Mathematical Statistics, S.Chand and Co., Ninth Edition, New
Delhi, 2008.
11Z302 SYSTEM SOFTWARE
3 1 0 3.5
Objective(s)
 To understand the relationship between system software and machine architecture.
 To know the design and implementation of assemblers, loaders and linkers.
 To understand macro processors and system software tools.
Program Outcome(s)
a) Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize
b) Demonstrate problem solving and design skills including the ability to formulate problems and their
Course Outcome(s)
 Design and implement system software.
 Analyze the generation of object codes.
 Determine the working of device drivers.
Assessment Pattern
S.No.
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
10
20
20
30
10
10
100
Test II
10
20
20
20
20
10
100
Model
Examinatio
n
10
20
20
20
20
10
100
End-semester
Examination
10
10
20
20
20
20
100
Remember
1. Define data Format
2. List the types of registers used in a system.
3. How input and Output operations are performed in PowerPC architecture?
4. What is Format3 and Format 4 instructions in SIC/XE machine?

The marks secured in test I and test II will be converted to 20 and model examination will be converted to 20. The remaining 10 marks will be
calculated based on assignments. Accordingly internal assessment will be calculated for 50 marks.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
How input and output operations are performed in SIC?
Give the instruction format of SIC/XE machine.
List the types of Assemblers.
What is load-and-go assembler?
What is multi-pass assembler?
What is MASM assembler?
What is near jump and far jump?
How assemblers handle forward reference instructions?
What are the functions of an absolute loader?
What are the disadvantages of an absolute loader or machine dependent loader?
What is a relocating or relative loader?
What is bit mask?
Define Linker
What are the activities of macro processing?
What is meant by conditional macro expansion?
Draw the structure of ARGTAB.
What is an interactive editor?
What is editing?
What are the elements on which editing is done?
What are the two fundamental types of editors?
What are the semantic routines that encompass the editor structure?
How is the editing area selected in an editor?
Understand
1. How communication with OS is established in SIC/XE while executing a program?
2. Explain the different instruction formats, instruction sets and addressing modes used in assembler.
3. Write the algorithm for Macro processor.
4. What are the other parts of the system to which the debugger should be related with?
Apply
1. Write the types of Assemblers.
2. Illustrate the Concept of Macro processors.
3. Demonstrate the functions of Pass 1 and Pass 2 of MS-Dos linker.
4. How is the starting point of the editing area selected for viewing?
Analyze
1. Compare and Contrast SIC, SIC/XE with programming examples.
2. In the following macro definition,
#define ABSDIFF(X,Y)[(X)>(Y)?(X)-(Y) : (Y)-(X)]
Give the expansion for ABSDIFF (I+1,j-5).
3. Substantiate the necessity for more than one passes in assembler.
4. Differentiate Assembler and Interpreter.
Evaluate
1. Expand the following Macro.
a. SUM MACRO &ID
b. LDA X&ID->1
c. ADD X&ID->2
d. ADD X&ID->3
e. STA X&ID->5
f. MEND
SUM A.
2. Give the implementation details of MS-DOS Linker.
Create
1. Write a program segment to indicate the arithmetic operation for the SIC machine.
2. Design MASM assembler.
52
53
Unit I
Introduction
System software and machine architecture – The Simplified Instructional Computer (SIC) – Traditional CISC
Machine - RISC Machine - Machine architecture - Data and instruction formats - addressing modes - Instruction sets
- I/O and programming.
9 Hours
Assembly language programming
Unit II
Assemblers
Basic assembler functions - A simple SIC assembler – Assembler algorithm and data structures – Machine dependent
assembler features - Instruction formats and addressing modes – Program relocation – Machine independent
assembler features – Literals – Symbol-defining statements – Expressions – One pass Multi pass Assembler.
9 Hours
MASM assembler
Unit III
Loaders and Linkers
Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader - Machine dependent loader
features - Relocation – Program Linking – Algorithm and Data Structures for Linking Loader - Machine-independent
loader features - Automatic Library Search – Loader Options - Loader design options- Linkage Editors – Dynamic
Linking – Bootstrap Loaders
9 Hours
Implementation example - MSDOS linker
Unit IV
Macro Processors
Basic macro processor functions - Macro Definition and Expansion – Macro Processor Algorithm and data structures
- Machine-independent macro processor features - Concatenation of Macro Parameters – Generation of Unique
Labels – Conditional Macro Expansion – Keyword Macro Parameters-Macro within Macro-Implementation example
- MASM Macro Processor
9 Hours
ANSI C Macro language
Unit V
Other System Software Tools
Database Management Systems-Basic Concepts of DBMS- Levels of data description- Use of a DBMS-Text editors Overview of the Editing Process - User Interface – Editor Structure. - Interactive debugging systems - Debugging
functions and capabilities – User- Interface Criteria.
9 Hours
Relationship with other parts of the system
Total: 45+15 Hours
Textbook(s)
Leland L. Beck, System Software – An Introduction to Systems Programming 3rd Edition,
Pearson Education Asia, 2007
Reference
1. Dhamdhere D M, Systems Programming and Operating Systems, Second Revised Edition, Tata McGrawHill, 1999
2. John J. Donovan Systems Programming, Tata McGraw-Hill Edition, 2001
54
11Z303 OBJECT ORIENTED PROGRAMMING
3 0 0 3.0
Objective(s)
 To understand the concepts of Object Oriented Programming.
 To gain thorough knowledge in programming with C++.
 To understand the concepts of files and pointers.
Program Outcome(s)
Course Outcome(s)
 Determine the needs of object oriented programming.
 Differentiate the functionalities of object oriented approach and procedural languages.
 Demonstrate the concepts of operator overloading and inheritance.
 Demonstrate the concepts of polymorphism and file streams.
 Design of Templates and Exception Handling.
Assessmet Pattern
S.No
1.
2.
3.
4.
5.
Bloom’s
Taxonomy
(New version)
Remember
Understand
Apply
Analyze/Evaluate
Create
Total
Test I
Test II
Model
Examination
10
20
20
40
10
100
10
20
20
40
10
100
10
20
20
40
10
100
EndSemester
Examination
10
20
20
40
10
100
Remember
1. Define object
2. Define Encapsulation
3. State the features of object-oriented programming.
4. Define Algorithm
5. Define Recursion
5. What are called binary operators?
6. What are called class members?
7. List the categories of static data members.
8. How constructor is declared and defined?
9. What do you mean by parameterized constructors?
10. Give the advantages of dynamic initialization
11. How the data object is deleted?
12. What is abstract class?
13. What are kinds of exceptions?
14. Mention the purpose of exception handling.
15. What is operator overloading?
16. Define virtual function
17. What are functionalities of file pointers?
18. How do you define friend function?
19. Define this pointer
20. Define templates

55
Understand
1. How can we determine errors while dealing with files?
2. What do you mean by dynamic initialization of variables?
3. How the objects are used as function argument?
4. What is function overloading?
5. When do you use bool data type?
6. When do you use this pointer?
7. Is it possible to overload a constructor? How?
8. How objects are initialized dynamically?
9. List out the operators that cannot be overloaded.
10. What is meant by casting operator?
11. Give few examples of multi-argument templates.
12. When is it not possible for the compiler to deduce the argument type?
13. How does the behavior of the static data members of a class template differ from the behavior of static data
members of a normal class?
14. Give any rules for Virtual Functions.
15. How will you create manipulators?
16. How to define our own namespace?
17. What is unnamed namespace?
18. What is dynamic polymorphism?
Apply
1. How do you handle the message passing in C++?
2. What does the pseudo code consist of?
3. How to represent the pointer?
4. How does C++ applies the operators in the arithmetic expression?
5. Give an example for class declaration.
6. Give the format for calling a member function.
7. How member functions are applied?
8. How constructor is declared?
9. How to create an array using new operator?
10. Write a class specifier that creates a class called leverage with one private data member Crowbar, of type
int and one public function whose declaration is void proxy().
11. Data items in a class must be private – Justify.
12. Which is the parameter that is added to every non-static member function when it is called?
13. How to implement the runtime polymorphism using C++?
14. How do you differentiate a constructor from an ordinary function?
Analyze / Evaluate
1. Demonstrate how a static data is accessed by a static member function.
2. Define a supplier class. Assume that the items supplied by any given supplier are different and varying in
number. Use dynamic memory allocation in the constructor function to achieve the solution.
3. Implement selection sort as a generic function
Create
1. Define an examiner class. Provide all necessary data and function members to provide the following: The
examiner must access answer sheets of at least one subject; He may examine answer sheets of multiple subjects;
The examiner represents a college and also a university; Most of the examiners are local and represent local
university; and have more than one constructor including one default and one with default argument. Provide a
meaningful copy constructor.
2. For a supermarket, define a bill class. All the bill objects will contain bill number, name of clerk preparing the
bill, each item with quantity and price and total amount to be paid. Total items in the bill are varying. Define
dynamic memory allocation constructor for bill class such that any number of items from 1 to 50 can be
accommodated in a single bill. There is an array describing each item with a price. The price is to be picked up
from that array. Now overload = operator and provide reason for the need of such operator.
56
Unit I
Introduction
Need for object oriented programming – Procedural Languages vs. Object oriented approach - Characteristics Object
oriented programming - C++ Programming Basics: Basic Program Construction - Output Using cout - Input with cin
- Data types-Variables and Constants – Operators - Control Statements-Manipulators-Type conversion.
9 Hours
Default arguments
Unit II
Objects and Classes
Simple Class - C++ Objects as Physical Objects – C++ Object as Data types- Constructors and Destructors- Object as
Function Arguments - Returning Objects from Functions - Structures and Classes - Arrays and Strings.
9Hours
Constructor with Dynamic Allocation
Unit III
Operator Overloading and Inheritance
Need of operator overloading- Overloading Unary Operators- Overloading binary Operators-Overloading Special
Operators-Data Conversion-Inheritance: Derived Class and Base Class-Derived Class Constructors-Overriding
Member Functions-Class Hierarchies-Public and Private Inheritance-Levels of Inheritance-Multiple Inheritance.
9 Hours
Introduction to Containership
Unit IV
Polymorphism and File Streams
Virtual Function – Friend Function – Static Function-Assignment and Copy Initialization- Streams – String I/O –
Character I/O – Object I/O – I/O with Multiple Objects – File Pointers – Disk I/O with Member Functions- Error
Handling in File I/O.
9 Hours
Command Line Arguments
Unit V
Templates and Exception Handling
Templates: Introduction - Function Templates - Overloading Function Templates - Class Templates - Exception
Handling – Syntax, multiple exceptions, exceptions with arguments.
9 Hours
UML and Templates
Total : 45 hours
Textbook(s)
Robert Lafore, Object Oriented Programming in-C++, Galgotia Publication, 2009
Reference(s)
1. Deitel & Deitel, C++ How to program, Prentice Hall,2005
2. D.S.Malik, C++ Programming, Thomson, 2007
3. K.R. Venugopal, Rajkumar and T.Ravishankar, Mastering C++, Tata McGraw Hill Publishing Co. Ltd., New
Delhi, 2006
11Z304
DATA STRUCTURES
3 1 0 3.5
Objective(s)
 To learn the basics of abstract data types.
 To learn the principles of linear and non linear data structures.
 To build an application using sorting and searching.
57
Program Outcome(s)
Course Outcome(s)
 Demonstrate the concept of linear and non linear data structures.
 Determine the efficiency of algorithms.
 Design of algorithms for various searching and sorting techniques.
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Test I
Test II
Model
Examination
10
20
30
20
10
10
100
10
20
30
20
10
10
100
10
20
30
20
10
10
100
EndSemester
Examination
10
20
30
20
10
10
100
Total
Remember
1. What is a data structure?
2. What is a non-linear data structure?
3. What is a linear data structure?
4. List the areas in which data structures are applied extensively.
5. Define stack
6. What is big O notation?
7. What is an ADT?
8. Specify the basic operations of stack and queue.
9. List the applications of stack and queue.
10. What is tree and List out few of the applications of tree data-structure?
11. Define graph
12. List the various types of sorting algorithms.
13. What is hashing?
14. List the various types of hashing methods.
16. Specify the properties of binary search tree.
17. What is minimum spanning tree?
18. What is the balance factor for AVL Trees?
19. What is the efficiency of binary search?
Understand
1. Why recursive algorithms are efficient than non-recursive algorithms?
2. What is the minimum number of queues needed to implement the priority queue?
3. Describe a situation where storing items in an array is clearly better than storing items on a linked list.

4.
58
Write a class definition that could be used to define a node in a doubly linked list. Include only the instance
variables, not the methods. Also write one sentence to describe a situation when a doubly linked list is
appropriate.
Sort the given values using Quick Sort : 65 70 75 80 85 60 55 50 45
Describe the time complexity of sorting and searching algorithms.
Classify the Hashing Functions based on the methods by which the key value is found.
What are the steps to insert a new item at the head of a linked list?
What is the suitable data structure for constructing a tree?
What is the condition for balancing an AVL tree?
Illustrate Binary Search with suitable example and algorithm.
How do you traverse a given tree using Inorder, Preorder and Postorder traversals?
How many null branches are there in a binary tree with 20 nodes?
How many different trees are possible with 10 nodes?
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
Apply
1. For the tree given below
a)
Find the Preorder, Inorder and Postorder traversals.
b)
Find the height of the tree, level of node 10 and degree of the node 20.
Convert the expression (a+b)*c/d-e into infix, prefix and postfix notations.
Demonstrate Djikstra‘s algorithm to find the shortest distance in a weighted graph.
2.
3.
Analyze
1. Differentiate linear and non linear data structure.
2. Contrast ADT implementation of array and linked list.
3. Compare internal and external sorting.
4. Differentiate between binary tree and binary search tree.
5. Compare linear and binary search.
6. Distinguish DFS and BFS.
Evaluate
1. Evaluate the best case and worst case complexity for searching algorithms.
2. Can stack be used to perform queue operations? Justify.
Create
1. Develop an application using a stack /Queue /List /Tree that reflects a real world problem.
Unit I
Introduction
Pseudo code–Abstract data types-Model for an ADT-ADT Implementations-Algorithm efficiency-Designing
recursive algorithms-Recursive examples.
9 Hours
Generic code for ADTs
Unit II
Stacks, Queues and Lists
Arrays – Basic stack operation- Stack ADT - Applications of stack – Queues operations- Queue ADT – Queue
applications -List ADT - Circular - Doubly linked list.
9 Hours
Applications of list
59
Unit III
Sorting and Searching Techniques
Sorting: Insertion Sort- Selection Sort- Bubble Sort - Merge sort – Quick sort –Heap sort-shell sort- External Sorts
Searching: Sequential search- Binary Search – Hashed list searches.
9 Hours
Bucket hashing
Unit IV
Non Linear List
Basic Tree concepts - Binary Trees – Tree Traversals – Expression Trees - Binary Search Trees – AVL Search Trees
- Heap concepts – Implementation - Heap ADT.
9 Hours
Heap Applications: Priority Queue
Unit V
Graphs
Definitions – Traverse Graph: Depth first Traversal-Breadth first Traversal-Shortest Path Algorithms: Unweighted
Shortest Paths – Dijkstra‘s Algorithm. Minimum Spanning Tree: Prim‘s Algorithm– Kruskal‘s Algorithm.
9 Hours
Introduction to NP Completeness
Total: 45+15 Hours
Textbook(s)
1. Richard F. Gilberg, and Behrouz A. Forouzan, Data Structures – A Pseudocode Approach with C, Thomson
2009
2. M.A.Weiss, Data Structures and Algorithm Analysis in C, Pearson Education Asia, 2007
Reference(s)
1. Y.Langsam, M.J.Augenstein and A.M.Tenenbaum, Data Structures using C, PHI, 2004
2. Aho, J.E.Hopcroft and J.D.Ullman, Data Structures and Algorithms, Pearson education, Asia, 2010
3. Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, Fundamentals of Data Structures in C, Silicon
Press, 2007
11Z305 DIGITAL SYSTEM DESIGN
3 1 0 3.5
Objective(s)
 To understand different methods used for the simplification of Boolean functions
 To design and implement combinational circuits
 To design and implement synchronous sequential circuits
Program Outcome(s)
Course Outcome(s)
 Determine the functional behavior and timing performance of combinational circuit and
sequential circuit.
 Design digital circuits to perform specified combinational and sequential functions.
 Describe, simulate and test combinational and sequential logic, and finite state machines in Verilog
through behavioral, data flow and structural models.
60
Assessment Pattern
S.No.
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
Test II
20
20
30
20
10
100
20
20
20
30
10
100
Model
Examination
20
20
20
20
10
10
100
End-semester
Examination
20
20
20
20
10
10
100
Remember
1. Define the term digital
2. What is meant by bit?
3. What is the best example of digital system?
4. Define byte
5. List the number systems.
6. State the sequence of operator precedence in Boolean expression.
7. What are the abbreviations of ASCII and EBCDIC code?
8. What is propagation delay?
9. What is Noise margin?
10. What is power dissipation?
11. What are the universal gates?
12. What are the different types of number complements?
13. Why complementing a number representation is needed?
14. How to represent a positive and negative sign in computers?
15. What is meant by Map method?
16. What is meant by two variable map?
17. What is meant by three variable map?
18. Which gate is equal to AND-inverter Gate?
19. Bubbled OR gate is equal to-------------20. Bubbled AND gate is equal to-------------21. What is the use of Don‘t care conditions?
22. Which gate is equal to OR-inverter Gate?
23. What is the algebraic function of Exclusive-OR gate and Exclusive-NOR gate?
24. Define Positive Logic
25. Define Negative Logic
26. List the characteristics of digital ICs.
27. Why parity checker is needed?
28. What is meant by parity bit?
29. What is an IC?
30. What are the methods adopted to reduce Boolean function?
Understand
1. Different methods used for the simplification of Boolean functions
2. To design and implement combinational circuits
3. To design and implement synchronous sequential circuits

Apply
1.
61
Design a logic circuit for a children's math toy to teach number theory. A child enters two numbers, each
from 0 to 20. The indicator light should be on if the two numbers are equal or if the first number is greater.
Analyze
1. Explain why unused states generate don‘t-care terms when translating a state table to a transition table?
Illustrate your response with a sample state table.
2. Explain why J-K flip-flops produce more don‘t-care terms than the other flip-flop types, even when all of
the states are specified.
Evaluate
1. Design a synchronous circuit that has a single input variable and single output variable. The input data are
received serially. The output Z is to change only when three consecutive input bits have the same value.
Decide whether a Moore or a Mealy performs better.
2. Design a serial bit pattern detector that will detect the input sequence 01010 in a longer bit string. If the
pattern is detected, then cause output Q to be active high. If a 011 bit pattern occurs within the same serial
data string, cause output P to be active high. If the 011 pattern occurs, cause the state machine to initialize
and start over looking for the 01010 pattern. Overlapping sequences can occur. Compare the performance
of the circuit for a Moore and Mealy configurations.
Create
1. Design a Mealy sequential machine that will detect the following input sequences x = 01101 or 01111. If
input sequence x=01101 is met, cause z1 = 1. If x = 01111, cause z2 = 1. Each input sequence may overlap
with itself or other sequence. Document the whole procedure.
2. Design a special hardware comparator that would keep track of the maximum and minimum of a series of
numbers. The numbers are presented to the hardware one at a time beginning with the count of numbers
followed by the numbers themselves.
Unit I
Boolean Algebra and Logic Gates
Number systems (radix 2,8,10 and 16)- Binary arithmetic – Binary codes – Boolean algebra and theorems -Boolean
functions – Simplifications of Boolean functions using Karnaugh map–Implementation of Boolean function using
logic gates.
9 Hours
Simplifications of Boolean functions using Tabulation method.
Unit II
Combinational Logic
Combinational circuits – Analysis and design procedures - Circuits for arithmetic operations – Magnitude comparator
–Hardware Description Language (HDL).
9 Hours
BCD addition (add two BCD numbers to produce a valid BCD result).
Unit III
Design with MSI Devices
Decoders and encoders - Multiplexers and demultiplexers - Memory and programmable logic - HDL for
combinational circuits.
9 Hours
Design of BCD-to-7-segment display.
Unit IV
Synchronous Sequential Logic
Sequential circuits – Flip flops – Analysis and design procedures - State reduction and state assignment -Shift
registers – Counters - HDL for sequential circuits.
9 Hours
Familiarization with 7493 (mod-16 counter) and 7490 (mod-10 counter).
62
Unit V
Asynchronous Sequential Logic
Analysis and design of asynchronous sequential circuits - Reduction of state and flow tables – Race-free state
assignment – Hazards.
9 Hours
Essential hazards
Total: 45+15 Hours
Text book
M.Morris Mano and Michael D Ciletti, Digital Design, Pearson Education, 2008
Reference(s)
1. Charles H.Roth, Fundamentals of Logic Design, Jaico Publishing House, 2000
2. Donald D.Givone, Digital Principles and Design, Tata McGraw- Hill, 2007
3. Thomas. C. Bartee ,Digital Computer Fundamentals, Tata McGraw- Hill, 2004
11Z306 SOFTWARE ENGINEERING
3 1 0 3.5
Objective(s)
 To understand the different life cycle models.
 To understand the requirements collection process.
 To learn the various software testing techniques.
Program Outcome(s)
Course Outcome(s)
 Identify the customer requirements.
 Determine the appropriate life cycle model based on the project.
 Develop an effective design for implementation.
 Apply the suitable testing methodology.
Assessment pattern
S.No.
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
Test II
30
30
10
10
10
10
100
20
30
10
20
10
10
100
Model
Examination
20
20
10
20
10
20
100
End- Semester
Examination
20
20
10
20
10
20
100
Remember
1. Define software Engineering
2. List the different types of process models.
3. List the stake holders of software.
4. What is agile process?

5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
Define software metrics
List the metrics for software quality.
What are the ground works for requirements collection?
What is software project estimation?
What are the decomposition techniques?
What are the software design concepts?
What is design model?
What is architectural design?
List the interface design steps.
What is flow oriented modeling?
What is software risk?
List the factors associated with software risk.
What is software testing?
List the testing fundamentals.
What is unit testing?
State the advantages of debugging.
What is software quality assurance?
What are the goals of software quality assurance?
What is software review?
List the software review techniques.
Define software reliability
Understand
1. Why do we need life cycle model?
2. How do you select and use the software metrics?
3. Explain the incremental process model.
4. Describe the agile process in software development.
5. Discuss about of metrics in software quality.
6. How do we measure software?
7. Explain the steps in requirements analysis.
8. Why should we use requirements model?
9. How to estimate software project?
10. Explain the decomposition techniques for software project.
11. Describe the empirical estimation models.
12. Why should we use make/ buy decision?
13. How to build a design model?
14. Explain the architectural and interface design.
15. Why should we use user analysis and interface analysis?
16. Explain the steps in interface design.
17. How the flow oriented modeling is being used in requirements modeling?
18. Explain software risk management.
19. Describe the integration testing.
20. Explain the metrics of software quality assurance.
Apply
1. Find the cost of airline reservation system using cost estimation techniques.
2. How to test a software using white box testing?
Analyze
1. Analyze the requirements for banking system.
2. Analyze and select the software testing tool for hotel management system.
3. Differentiate formal and informal reviews.
4. Differentiate unit testing and integration testing.
5. Compare white box testing with black box testing.
63
64
Evaluate
1. Evaluate the e-attendance system using validation testing.
2. Evaluate the payroll management system using system testing.
Create
1. Develop a software for library management system.
2. Develop a software for inventory control.
3. Write the steps in software debugging.
Unit I
The Process
Software Engineering the nature of Software -Software Process Models: Waterfall Model-Incremental process
models- Evolutionary process models: Prototyping-Spiral model – Concurrent model- Introduction to Agile processMetrics in the Process and Project Domains-Software Measurements-Metrics for Software Quality.
9 Hours
The Capability Maturity Model Integration (CMMI)
Unit II
Requirements Analysis
Requirements Engineering-Establishing the groundwork-Eliciting requirements-Building the requirements modelRequirements analysis- Software Project Estimation- Decomposition Techniques- Empirical Estimation Models- The
Make/Buy Decision.
9 Hours
Developing Use cases
Unit III
Design Concepts and Principles
The Design concepts-The Design model-Architectural design-User interface design: user analysis and design,
Interface analysis, Interface design steps-Requirements modeling: Flow oriented modeling- Software risk
management - Coding principles.
9 Hours
Designing Class-Based Components
Unit IV
Software Testing Techniques
Software Testing Fundamentals – Internal and External views of testing - White-Box Testing –Basic Path TestingControl Structure Testing- Black Box Testing- Software Testing Strategies – A Strategic Approach to Software
Testing- Unit Testing- Integration Testing- Validation Testing - System Testing- The Art o Debugging.
9 Hours
Performance Testing
Unit V
Software Quality Assurance
Elements of Software Quality Assurance- SQA Tasks, Goals and Metrics- Software Review Techniques: Informal
reviews-Formal Technical Reviews-Software Reliability- Software Configuration Management-The SCM ProcessVersion Control-Change Control-Configuration Audit.
9 Hours
The ISO 9000 Quality Standards
Total: 45+15 Hours
Textbook(s)
Roger S. Pressman, Software Engineering: A Practitioner Approach, McGraw-Hill, 2010
Reference(s)
1. Ian Sommerville, Software Engineering, Pearson Education, 2007
2. David Gustafson, Software Engineering, Schaum‘s outlines, Tata McGraw-Hill, 2002
3. Pankaj Jalote, An Integrated approach to Software Engineering, Narosa Publishing house, 2005
65
11Z307 OBJECT ORIENTED PROGRAMMING LABORATORY
0 0 3 1.5
Objective(s)
 To understand the usage of class and objects.
 To implement the concepts of inheritance and operator overloading.
 To learn the problem solving with object oriented approach.
Program Outcome(s)
Skill Set
 Demonstrate the concepts of object oriented programming.
 Demonstrate the importance of implementing abstract data types.
 Design of applications using constructors and destructors.
Assessment pattern
Bloom’s Taxonomy
(New Version)
Preparation
Observation and results
Record
Mini Project/Model
Examination/Viva-voce
Total
Internal
Assessment
10
15
10
15
End Semester
Examination
15
20
15
50
50
Remember
1. Define a class
2. Define Algorithm
3. Define Recursion
4. What are called class members?
5. What are functionalities of file pointers?
6. Define this pointer
7. What is operator overloading?
Understand
1. When do you use bool data type?
2. When do you use this pointer?
3. How the objects are initialized dynamically?
4. What is unnamed namespace?
5. How can we define our own namespace?
6. How to create manipulators?
Apply/Analyze/ Evaluate
1. How to implement function overloading
2. How to implement default argument function?
3. How to implement dynamic objects and use constructors and destructors?
4. How to implement array of objects?
5. How to implement operator overloading?
66
Create
1. Design library management system by using the concepts of object oriented programming.
2. Create a package for Student Information System.
List of Experiments
1. Define a class to represent a bank account to include the following members.
Data Members: Name of the depositors, Account number, Type of account, Balance amount in the account.
Member functions: To initialize values to data members, To deposit an amount, To withdraw an account
after checking the balance, To display the name and the balance.
Note: Try to use all types of constructors
2. Apply function overloading and operator overloading to the given problems.
3. Implement the concept of default argument function.
4. Implement the concept of array of objects.
5. Apprehend a class with dynamic objects and use constructors and destructors.
6. Execute the concept of Inheritance.
7. Illustrate the use of static data member and static member functions by keeping track of number of instances of
object that are created and alive.
8. Implement friend functions and friend classes to add the private data member of two different classes.
9. Exercise the file handling concepts Copy the content of one file to another file by removing unnecessary spaces
between words.
10. Realize the following concepts:
(i) Class templates and Function templates
(ii) Exception Handling
Design Experiments
Mini Project
Total: 45 Hours
Practical Schedule
S.No
1
2
3
4
5
6
7
8
9
10
Experiment
Define a class to represent a bank account to include the following members.
Data Members: Name of the depositors, Account number, Type of account, Balance
amount in the account.
Member functions: To initialize values to data members, To deposit an amount, To
withdraw an account after checking the balance, To display the name and the balance.
Implement function overloading (eg. Write functions to add 2 or 3 numbers of different
data types.)
Implement the concept of default argument function.
Implement the concept of array of objects.
Implement a class with dynamic objects and use constructors and destructors.
Implement the concept of Inheritance.
Illustrate the use of static data member and static member functions by keeping track of
number of instances of object that are created and alive.
Implement friend functions and friend classes to add the private data member of two
different classes.
Exercise the file handling concepts Copy the content of one file to another file by
removing unnecessary spaces between words.
Realize the following concepts:
(i) Class templates and Function templates
(ii) Exception Handling
Hours
6
6
3
3
6
3
3
6
3
6
67
11Z308 DATA STRUCTURES LABORATORY
0 0 3 1.5
Objective(s)
 To learn the basics of abstract data types.
 To learn the principles of linear and non linear data structures.
 To build an application using sorting and searching.
Program Outcome(s)
Skill Set
 Demonstrate the concept of linear and non linear data structures.
 Determine the efficiency of algorithms.
 Design of algorithms for various searching and sorting techniques.
Assessment Pattern
End
Bloom’s Taxonomy
Internal
Semester
(New Version)
Assessment
Examination
10
15
Preparation
Record
Mini- Project / Model Examination /
Viva Voce
Total
15
10
20
-
15
15
50
50
Remember
1. What is data structure?
2. What is an array?
3. What is a linked list?
4. What is queue front and queue rear?
5. What is big O notation?
6. What is an ADT?
7. Specify the basic operations of stack and queue.
8. List the applications of stack and queue.
9. List the applications of tree data-structure.
10. List the various types of sorting algorithms.
12. Specify the properties of binary search tree.
13. What is minimum spanning tree?
Understand
1. What is the minimum number of queues needed to implement the priority queue?
2. When does stack overflow and underflow condition occur?
3. When does queue overflow and underflow condition occur?
4. If you are using C language to implement the heterogeneous linked list, what type of pointer will be used?
5. How will you implement stack and queue using array and linked list?
6. Describe a situation where storing items in an array is clearly better than storing items on a linked list.
7. Describe the operations of creating, inserting, searching and deleting a node in singly and doubly linked list.
8. What are the steps to insert a new item at the head of a linked list?
9. Describe the time complexity of sorting and searching algorithms
10. What is the suitable efficient data structure for constructing a tree?
11. How do you traverse a given tree using Inorder, Preorder and Postorder traversals.
12. Describe the traversals followed in DFS and BFS.
68
Apply
1.
Sort the given values using Quick Sort, Heap sort, Selection and bubble sort
a. 65 70 75 80 85 60 55 50 45
2. Search the following list using binary and linear search.
a. 25 63 1 0 9 55 2 96
3. Build a heap structure for the following list
a. 42 23 74 11 65 58 94 36 99 87
Analyze / Evaluate
1. How to traverse in a singly and doubly linked list?
2. Identify the shortest distance between nodes in a graph using BFS & DFS.
3. Trace the shortest path in a graph using Dijkstra‘s algorithm.
Create
1. Write a program implementing stack and queue operations.
2. Write a program to evaluate the given expression using stack and queue operations.
3. Write a program to perform the following operations:
a. Infix to postfix
b. Infix to prefix
4. Write a program to perform the polynomial addition & multiplication using linear linked list.
5. Write a program to insert & delete a node in a binary tree.
6. Write a program for Inorder, preorder and, Postorder traversal of binary tree.
7. Develop a mini project on applications of stack
8. Develop a component implementing rat in the maze.
List of Experiments
1. Array Implementation of stack and queue.
2. Linked List Implementation of stack and queue.
3. Program to perform various operations such as creation, insertion, deletion, search of node and display on
singly linked list.
4. Program to perform various operations such as creation, insertion, deletion, search of node and display on
doubly linked list.
5. Program to sort the elements in ascending order using selection sort and bubble sort
6. Implementation of quick sort.
7. Implementation of descending order to sort the elements using Heap sort.
8. Develop a program to perform linear and binary search
9. Program to construct an expression tree for a given expression and perform various tree traversal methods
10. Implement Prim‘s algorithm for graph in minimum spanning tree
Design Experiments
Practical schedule
S.No
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Total: 45 Hours
Experiment
Array Implementation of stack and queue.
Linked List Implementation of stack and queue.
Program to perform various operations such as creation, insertion, deletion, search of
node and display on singly linked list.
Program to perform various operations such as creation, insertion, deletion, search of
node and display on doubly linked list.
Program to sort the elements in ascending order using selection sort and bubble sort
Implementation of quick sort.
Implementation of descending order to sort the elements using Heap sort.
Develop a program to perform linear and binary search
Program to construct an expression tree for a given expression and perform various tree
traversal methods
Implement Prim‘s algorithm for graph in minimum spanning tree
Hours
6
6
3
3
6
3
3
3
6
6
69
11Z309 DIGITAL SYSTEM DESIGN LABORATORY
0 0 3 1.5
Objective(s)
 To understand different methods used for the simplification of Boolean functions
 To design and implement combinational circuits
 To design and implement synchronous sequential circuits
Program Outcome(s)
Skill Set
 Design digital circuits to perform specified combinational and sequential functions.
 Describe, simulate and test combinational and sequential logic, and finite state machines in Verilog
through behavioral, data flow and structural models.
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Preparation
Preparation and Results
Record
Mini Project/Model
Total
Internal
Assessment
10
15
10
End-semester
Examination
15
20
-
15
50
15
50
Remember
1. Define the term digital.
2. What is meant by bit?
3. What is the best example of digital system?
4. Define byte.
5. List the number systems.
6. State the sequence of operator precedence in Boolean expression.
7. What are the abbreviations of ASCII and EBCDIC code?
8. What is propagation delay?
9. What is Noise margin?
10. What is power dissipation?
11. What are the universal gates?
12. What are the different types of number complements?
13. Why complementing a number representation is needed?
14. How to represent a positive and negative sign in computers?
15. What is meant by Map method?
16. What is meant by two variable map?
17. What is meant by three variable map?
18. Which gate is equal to AND-inverter Gate?
19. Bubbled OR gate is equal to-------------20. Bubbled AND gate is equal to-------------21. What is the use of don‘t care conditions?
22. Which gate is equal to OR-inverter Gate?
70
23. What is the algebraic function of Exclusive-OR gate and Exclusive-NOR gate?
24. Define Positive Logic.
25. Define Negative Logic.
26. List the characteristics of digital ICs.
27. Why parity checker is needed?
28. What is meant by parity bit?
29. What is an IC?
30. What are the methods adopted to reduce Boolean function?
Understand
1. Different methods used for the simplification of Boolean functions
2. To design and implement combinational circuits
3. To design and implement synchronous sequential circuits
4. Differentiate between a truth table and an excitation table
5. Differentiate between a combinational circuit and a sequential circuit
Apply
1. Design a logic circuit for a children's math toy to teach number theory. A child enters two numbers, each from 0
to 20. The indicator light should be on if the two numbers are equal or if the first number is greater.
2. Design an elevator controller for a building that has four floors. There are four buttons in the elevator, one
for each floor. As people enter the elevator, the Engineering buttons are being pushed. Design a circuit that
determines which floor it should go next when the doors are closed.
Analyze
1. Explain why unused states generate don‘t-care terms when translating a state table to a transition table? Illustrate
your response with a sample state table.
2. Explain why J-K flip-flops produce more don‘t-care terms than the other flip-flop types, even when all of the
states are specified.
Evaluate
1. Design a synchronous circuit that has a single input variable and single output variable. The input data are
received serially. The output Z is to change only when three consecutive input bits have the same value. Decide
whether a Moore or a Mealy performs better.
2. Design a serial bit pattern detector that will detect the input sequence 01010 in a longer bit string. If the pattern is
detected, then cause output Q to be active high. If a 011 bit pattern occurs within the same serial data string,
cause output P to be active high. If the 011 pattern occurs, cause the state machine to initialize and start over
looking for the 01010 pattern. Overlapping sequences can occur. Compare the performance of the circuit for a
Moore and Mealy configurations.
Create
1. Design a Calculator with advanced functions.
2. Design a Phone book (using keyboard and LCD).
List of Experiments
1. Boolean laws and theorems verification using digital logic gates.
2. Design and implementation of combinational circuits using basic gates.
3. Implementation of parity generator / checker using basic gates.
4. Device a code converter.
5. Application using multiplexers and Demultiplexers.
6. Realization of Encoder and Decoder using logic gates.
7. Execution of Synchronous and Asynchronous counters.
8. Devise the implementation of Shift registers.
9. Implementation of simple combinational circuit using HDL.
10. Implementation of simple sequential circuit using HDL
Design Experiments
Practical schedule
Total: 45 Hours
S.No
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Experiment
Boolean laws and theorems verification using digital logic gates.
Design and implementation of combinational circuits using basic gates.
Implementation of parity generator / checker using basic gates.
Device a code converter.
Application using multiplexers and Demultiplexers.
Realization of Encoder and Decoder using logic gates.
Execution of Synchronous and Asynchronous counters.
Devise the implementation of Shift registers.
Implementation of simple combinational circuit using HDL.
Implementation of simple sequential circuit using HDL
11Z401 DISCRETE MATHEMATICS
71
Hours
6
3
6
3
3
3
3
6
6
6
3 1 0 3.5
Objective(s)

To construct correct simple mathematical proofs and posses the ability to verify them and to solve counting
problems involving the multiplication rule, permutations and combinations.
 To provide students with the understanding of the terms cardinality, finite and countably infinite and
determine which of these characteristics is associated with a given set and various types of graphs including
Eulerian graphs and Hamiltonian graphs.
Program Outcome(s)
n) Apply basic principles and practices of computing grounded in mathematics and science to successfully
research.
i. Graduates will be skilled in propositional logic, including modeling English description with
propositions and connectives and doing truth table analysis and will be conversant in predicate logic.
ii. Able to create proofs using mathematical induction.
iii. Apply the underlying unifying structures of mathematics (i.e. sets, relations and functions) and the
relationships among them.
iv. Able to solve counting and combinatoric problems.
Course Outcome(s)
1. Check the validity of the arguments.
2. Understand how to construct correct mathematical arguments.
3. Design of computers and electrical circuit.
4. Check whether a particular combination of words is a valid sentence or not
Assessment pattern
S.
No
6
Bloom’s
Taxonomy
(New Version)
Test I6
Test II1
Model
Examination1
End Semester
Examination
1
Remember
20
20
20
20
2
Understand
40
40
40
20
3
Apply
30
30
30
30
4
Analyze/
Evaluate
10
10
10
20
50 marks.
5
Create
Total
-
-
-
-
100
100
100
100
72
Remember
1. Define a biconditional statement and draw its truth table
2. Show that P  Q  P  Q is a tautology without constructing truth table.
3. Write the expression ―Some men are clever‖ in symbolic form
4. If A has 3 elements and B has 2 elements how many functions are there from A to B.
5. Let A={1,2,3,4} and R={(x,y)/x > y}. Draw the graph of the relation
6. Define pigeonhole principle.
7. What is principle of counting?
8. Define recursive function.
9. Define isomorphic graphs.
10. Define a null graph.




Understand
1. Estimate the PCNF and PDNF of the formula given by
 P  R  Q  P
2.
Discuss this  Q, P  Q, P  R  R by indirect method
3.
Show that
4.
5.
6.
7.
A  B  A  B'



 

Let A,B,C are any three sets Prove that A  B XC  AXC  BXC
Let f(x)=x+2, g(x)=x-2,h(x)=3x, for x∈R, where R is the set of real numbers. Find
f  g , f  f , g  g , f  g  h and also write the corresponding matrix.
Prove that the sum of the degrees of the vertices of any finite graph is even.
If A – B = {1,2}, B – A = {6,7} and A  B = {3,4,5} find A and B.
 0 1 0


8. If the matrix representation of a relation R on {1,2,3} is given by M R   1 1 0  list
 0 1 0


the ordered pairs in the relation.
9. Draw a complete undirected graph with four vertices. How many edges does it have?
10. Define a Tournament graph and give an example of tournament with 6 vertices.
Apply
1.
 p  q  r   q  r    p  r   r
2. Show that d can be arrived from the premises a  b a  c , b  c , d  a .
Show that
Prove that the premises ― One student in this class knows how to write programs in JAVA‖ and ―Everyone
who knows how to write program in JAVA can get a high paying job ― imply the conclusion ―Someone in
this class get a high paying job‖.
4. Show that the relation R= {(1,2), ( 4,3), (2,2), (2,1), (3,1)} on A = {1,2,3,4} is not transitive.
5. Obtain the closed form expression of generating function for the sequence {3 0, 31,32, 33…….}
6. Find the number of different arrangements that can be made out of the letters of the word ―TRIANGLE‖ if
the vowels are to come together.
7. Can a simple undirected graph with four vertices have forty edges excluding self loops?
8. Obtain the number of permutations of all the letters of the words. (i) Committee (ii) Engineering.
9. Show that following implication P  Q  R  P  Q  P  R
10. Solve S(k)-4S(k-1)+4S(k-2)=3k+2k, S(0) = 1, S(1) = 1.
3.







73
Analyse
1. Show that the following premises are inconsistent :
If Rama gets his degree, he will go for a job. If he goes for a job, he will get married soon. If he goes for
higher study, he will not get married. Rama gets his degree and goes for higher study.
n2n  12n  1
3
n  k n  k  1 edges.
3. Prove that a simple graph with n vertices and k components can have at most
2
2.
Prove by mathematical induction that 1  3  5  .......  (2n  1) 
2
2
2
2
4.
5.
6.
7.
Draw all possible simple digraphs having three nodes.
How many different bit strings are there of length seven?
Find the recurrence relation foe Fibonacci sequence.
Let R denote a relation on the set of ordered pairs of integers such that (x,y) R (u,v) iff xv = yu. Show that R
is an equivalence relation.
8. Show that S R is tautologically implied by P  Q  P  R  Q  S using automatic theorem
proving .
9. Show that if n people attend a party and some shake hands with others (but not with themselves), then at the
end, there are at least two people who have shaken hands with the same number of people.
10. Find the number of different arrangements that can be made out of the letters of the word
‗TRIANGLE‘ if the vowels are to come together.
Unit I
Propositional Calculus

 
 

Propositions- Logical connectives-Compound propositions-Conditional and biconditional propositions- Truth tables –
Tautologies and Contradictions – Logical and equivalences and implications-DeMorgan‘s Laws-Normal formsPrincipal conjunctive and disjunctive normal forms –Rules of inference-Arguments-Validity of arguments.
9 Hours
Unit II
Predicate Calculus
Predicates-Statement Function –Variables-free and bound variables- Quantifiers-Universe of discourse-Logical
equivalences and implications for quantified statements-Theory of inference- The rules of universal specification and
generalization-Validity of arguments.
9 Hours
Unit III
Set Theory and Functions
Set Operations-properties-Power set-Relations-Graph and matrix of a relation- Partial Ordering- Equivalence
relations-Partitions- Functions –Types of Functions- composition of relation and functions- inverse functions.
9 Hours
Unit IV
Combinatorics
Basics of Counting – Counting arguments- Pigeonhole Principle- Permutations and Combinations- Recursion and
recurrence relations-Generating Functions- Mathematical Induction- Inclusion –Exclusion
9 Hours
Unit V
Graph Theory
Introduction to Graphs-Graph operations- Graph and Matrices-Graph Isomorphism-Connected Graphs-Euler GraphsHamilton paths and circuits- Shortest path problem.
9 Hours
Total: 45+15=60 Hours
Text Book(s)
1.
1.T. Veerarajan, Discrete Mathematics with graph theory and Combinatorics , Tata McGraw Hill Pub.
Co. Ltd, New Delhi, 2007.
2.
74
P. Geetha , Discrete Mathematics, Second Edition, Scitech Publication Chennai , 2009.
Reference(s)
1.
2.
3.
J P Trembly and R Manohar , Discrete Mathematical Structures with Applications to computer
Science, Tata McGraw Hill Publications Co. Ltd., New Delhi 2003.
P
Ralph Girmaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, Fourth
Edition, Pearson education Asia, Delhi 2002.
Kenneth H. Rosen, Discrete Mathematical and its Applications, Fifth Edition, Tata McGraw- Hill Pub.
Co. Ltd, New Delhi, 2003.
11Z402 COMPUTER ARCHITECTURE
3 1 0 3.5
Objective(s)
1. To understand the basic structure and operation of a digital computer.
2. To study the concepts of pipelining.
3. To learn the hierarchical memory system including cache memories and virtual memory.
Program Outcome(s)
Course Outcome(s)
 Demonstrate the instruction sets with various addressing modes.
 Determine the performance of cache in commercial processors.
 Demonstrate the interfacing of peripheral devices.
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
Test II
20
20
30
20
10
100
20
20
30
20
10
100
Model
Examination
20
20
30
20
10
100
End-Semester
Examination
20
20
30
10
20
100
Remember
1. What are the basic operational concepts?
2. How the clock rate can be increased?
3. Define Bus
4. List the techniques used to overcome hazards.
5. Is Pentium processor a RISC or CISC processor?
6. What is the use of buffer register?
7. What is an assembly language?
8. Define response time and throughput
9. What is index register?

75
10. Give the basic performance equation.
11. Define MFC
12. What is meant by branch instruction?
13. List the four steps in pipelining.
14. What is delayed branching?
15. What is deadlock?
16. Define memory access time
17. What are asynchronous DRAMs?
18. What are the features of PROM?
19. What are pages?
20. What is dirty or modified bit?
21. What is booting?
Understand
1. What is the difference between machine language and assembly language?
2. Write the difference between different types of addressing modes used in the instruction set design?
3. Identify the symbol of a full adder circuit for a single stage addition.
4. Describe the representation for n bit ripple carry adder.
5. Explain the Booth‘s algorithm.
6. What are the two ways to detect overflow in an n-bit adder?
7. What are the two approaches to reduce delay in adders?
8. Explain the various types of Adders.
9. Explain hardwired control.
10. What are the two techniques for speeding up the multiplication operation?
11. Explain bit-O-Ring technique.
12. Describe the two control signals used for register transfer.
13. What is the drawback of assigning one bit position to each control signal?
14. What is the use of cache memory?
15. Explain the Tomasulo‘s approach.
16. Describe about score boarding concept.
17. What are the characteristics of semiconductor RAM memories?
Apply
1. Perform division on the following 5-bit unsigned integer using Restoring and NonRestoring division: 10101
/ 00101
2. Express the decimal values 0.5.-0.123,-0.75 as signed 6-bit fractions.
3. Draw the organization of a single-bus processor and give the control sequences for fetching a word from
memory, storing a word in memory, executing a complete instruction and unconditional and conditional
branch.
4. Construct an example to show that three guard bits are needed to produce the correct answers when two
positive numbers are subtracted.
5. Write assembly codes for floating point multiply and divide. Write machine language equivalent.
Analyze
1. Write down the steps for restoring division and non-restoring division.
2. Perform the steps needed to execute the machine instruction Add LOCA, R0
3. Given a binary pattern in some memory locations, is it possible to tell whether this pattern represents a
machine instruction or a number?
4. Compare vertical organization with horizontal organization.
5. Compare static RAM with dynamic RAM.
6. In some computers, the processor responds only to the leading edge of the interrupt-request signal on one of
its interrupt-request lines. What happens if two independent devices are connected to this line?
Evaluate
1. A memory byte location contains the pattern 00101100. what does this pattern represent when interpreted as
a binary number? What does it represent as an ASCII code?
2. What is the formula for calculating the average access time experienced by the processor in a system with
two levels of caches?
3.
4.
5.
76
Compare different policies available to update cache memory, when there is a read or write miss.
Using manual methods, perform the operation AXB and A/B on the 5-bit unsigned numbers A-10101 and
B=00101.
The input status bit in an interface circuit is cleared as soon as the input data buffer is read. Why is it
important?
Create
1. Design a BCD digit adder using a 4-bit binary adder and external logic gates as needed. The inputs are
A3A2A1A0, B3B2B1B0 and a carry-in. the outputs are the sum digit S3S2S1S0 and the carry-out.
2. Design a half adder as a two-level AND-OR circuit.
Unit I
Structure of computers & Machine Instruction
Functional units - Basic operational concepts - Bus structures - Software - performance – Memory locations and
addresses – Memory operations – Instruction and instruction sequencing – Addressing modes – Assembly language –
Basic I/O operations – Stacks and queues.
9 Hours
Memory-Reference Instructions
Unit II
Arithmetic Operations
Addition and subtraction of signed numbers – Design of fast adders – Multiplication of positive numbers - Signed
operand multiplication and fast multiplication – Integer division.
9 Hours
Design of Accumulator Logic
Unit III
Basic Processing Unit & Pipelining
Fundamental concepts – Execution of a complete instruction – Multiple bus organization – Hardwired control –
Micro programmed control – Pipelining: Basic concepts – Data hazards – Instruction hazards – Influence on
Instruction sets – Data path and control consideration – Superscalar operation.
9 Hours
Instruction Level Parallelism
Unit IV
Input/Output Organization & Devices
Accessing I/O devices – Interrupts – Direct Memory Access – Buses – Interface circuits – Standard I/O Interfaces
(PCI, SCSI, USB) - Computer Peripherals: Input Devices – Output Devices.
9 Hours
Asynchronous data Transfer
Unit V
Memory Unit
Basic concepts – Semiconductor RAMs - ROMs – Speed - size and cost – Cache memories - Performance
consideration – Virtual memory- Memory Management requirements – Secondary storage
9 Hours
Memory Management Hardware
Total: 45+15 Hours
Textbook(s)
Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Computer Organization, McGraw-Hill, 2002
Reference(s)
1. William Stallings, Computer Organization and Architecture – Designing for Performance, Pearson
Education, 2010
2. David A.Patterson and John L.Hennessy, Computer Organization and Design: The hardware / software
interface, Morgan Kaufmann, 2002
3. John P.Hayes, Computer Architecture and Organization, McGraw Hill, 2002
77
11Z403 CONCURRENT PROGRAMMING
3 0 0 3.0
Objective(s)
 To impart the fundamental concepts of core JAVA.
 To enable the students to gain programming skills in JAVA.
 To gain the built in knowledge of standalone and web applications.
Program Outcome(s)
d) Demonstrate problem solving and design skills including the ability to formulate problems and their solutions,
think creatively and communicate effectively.
Course Outcome(s)
 Solve the basic design problems using object and classes.
 Demonstrate the concepts of OOPs.
 Design programs using applet and event handling.
Assessment Pattern
S. No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze / Evaluate
Create
Total
Test I
Test II
Model
Examination
End Semester
Examination
20
30
20
20
10
100
20
30
20
20
10
100
20
30
20
20
10
100
20
30
20
20
10
100
Remember
1. What is JDK?
2. Define byte code
3. Define JVM
4. What are the static members?
5. What is a default constructor?
6. What are wrapper classes?
7. What is class path variable?
8. Give the name of some built in exceptions.
9. What is the use of ALT key?
10. What is a canvas?
Understand
1. Describe the benefits of packages.
2. Identify the steps required to add an applet to a HTML document.
3. What is Synchronization?
Apply
1. Write a method to accept a number and return its cube using object and classes.
2. Write a program to compute Nth term in the Fibonacci sequence using interface.
Analyze / Evaluate
1. Write a Program to demonstrate iterators with different containers.
2. What are the differences between java and C++?
3. Compare interface and classes.

78
Create
1. Create JDBC applications to access and query a database.
2. Develop an applet to displays five concentric outlined rectangles of decreasing sizes.
3. Create distributed applications using threads.
Unit I
Java Basics
The Genesis of Java - Overview of Java - Data Types, Variables, and Arrays - Operators - Control Statements Introducing Classes - Methods and Classes.
9 Hours
The Java Buzzwords
Unit II
OOPS and Multithreaded Programming in Java
Inheritance: Basics - Using Super – Creating a Multilevel Hierarchy - Method overriding – Using Abstract Classes Packages and Interfaces: Packages - Access Protection - Importing Packages- Interfaces Definitions and
Implementations - Exception Handling: Types - Try and Catch - Throw - Multithreaded Programming: Creating
Threads - Inter Thread Communication.
9 Hours
Synchronization Methods
Unit III
I/O and Exploring Java.io
I/O Basics - Reading Console Input -Writing Console output - Native Methods - I/ O Classes and Interfaces - File The Byte Streams - The Character Streams - Using Stream I/ O - Serialization.
9 Hours
InetAddress and Factory Methods
Unit IV
String Handling
String Handling: Special String operations and Methods - Sting Buffer - Exploring java.lang: Simple type Wrappers System - Math - Collections Framework: Collections Interfaces and Classes - Utility Classes: String Tokenizer - Date
and Time.
9 Hours
The Legacy Classes and Interface
Unit V
Applets, Event Handling and AWT
Applet Basics - Applet Architecture - Applet Display Methods - Parameter Passing - Event Handling Mechanisms Event Classes - Event Listener - Working with Windows , Graphics , Colors and Fonts - AWT Controls - Layout
Managers and Menus - JDBC Concepts.
9 Hours
Introduction to Java Beans
Total: 45 Hours
Textbook(s)
 Herbert Schildt, Java 2-Complete Reference, Tata Mc Graw Hill, 2011
Reference(s)
1. Deitel & Deitel, Java How to Program, Prentice Hall of India, 2010
2. Gary Cornell and Cay S.Horstmann, Core Java Vol.1 and Vol.2, Sun Microsystems Press, 2008
3. Herbert Schildt, Java, A Beginner's Guide, Tata McGraw Hill, 2007
11Z404 OPERATING SYSTEMS
3 1 0 3.5
Objective(s)
 To understand the basic concepts of operating system.
 To learn CPU Scheduling algorithms.
 To study the concepts of process synchronization and deadlocks.
79
Program Outcome(s)
complete software related projects
Course Outcome(s)
 Determine the efficiency of CPU Scheduling Algorithms.
 Demonstrate Disk Scheduling Algorithms.
 Demonstrate the schemes of Memory Management.
Assessment Pattern
Remember
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
S.No
Bloom’s Taxonomy
(New Version)
Test I
Test II
Model
Examination
End-Semester
Examination
1.
2.
3.
4.
5.
Remember
Understand
Apply
Analyze/Evaluate
Create
Total
40
30
10
10
10
100
30
30
10
20
10
100
20
20
10
30
20
100
20
10
10
40
20
100
What is an operating system?
What is kernel?
Define batch system
What do you mean by system call?
What is meant by context switch?
What are the allocation methods of a disk space?
What are the advantages of contiguous memory allocation?
List the file attributes.
What are the various file operations?
What is logical address space and physical address space?
What is a thread?
What is thread cancellation?
What are the different ways in which a thread can be cancelled?
What is a process state and mention the various states of a process?
What is meant by client-server model?
Define throughput
What is turnaround time?
Define race condition
What is critical section problem?
Define target thread
Understand
1. Give the advantages of multiprocessor system?
2. Identify the advantages of multiprocessor system
3. Classify the different ways in which a thread can be cancelled.
4. Describe the various scheduling criteria for CPU scheduling.

5.
6.
7.
8.
9.
10.
Apply
1.
2.
3.
4.
5.
80
Explain the methods for handling deadlocks.
Explain the common strategies to select a free hole from a set of available holes.
Describe the various Page Replacement algorithms.
Explain the methods for Handling Deadlocks.
Classify the Allocation of Frames in Virtual Memory.
Illustrate the Continuous Memory allocation with necessary diagram.
Demonstrate the classical problems of synchronization.
Illustrate the schemes for defining the logical structure of a directory.
Summarize the various disk scheduling techniques.
Demonstrate the Bankers Algorithm.
Given memory partitions of 100k, 500k, 200k, 300k and 600k (in order). How would each of the first fit,
best fit and worst fit algorithm place process of 412k, 317k, 112k and 326k (in order)?
Analyze
1. Differentiate tightly coupled systems and loosely coupled system.
2. Compare user threads with kernel threads.
Evaluate
1. Consider the following page reference string.
1,2,7,8,3,4,2,1,4,2,5,6.How many page fault would occur for the following page replacements algorithms,
assuming an allocation of 3 frames?
(i)LRU
(ii)FIFO
(iii)Optimal
2. Assume that following jobs have arrived in the order 1,2,3,4 and 5:
Job
Arrival Time
Burst Time
Priority
1
0
15
2
2
2
3
1
3
5
5
5
4
6
8
4
5
7
12
3
Give Gantt chart and calculate Avg. Turnaround Time and Waiting Time for:
a. FCFS
b. SRTF and Preemptive priority algorithm
3. Consider the following snapshot of a system
Allocation
Max
ABCD
ABCD
Available
ABCD
P0
0012
0012
1520
P1
1000
1750
P2
1354
2356
P3
0632
0652
P4
0014
0656
Answer the following question using the banker‘s algorithm:
a. What is the content of matrix ―Need‖?
b. Is the System in a safe state?
c. If a request from process P1 arrives for (0, 4, 2, 0) can the request be granted immediately?
81
Create
1. Write a socket-based Fortune Teller Server. Your program should create a server that listens to a specified
port. When a client receives a connection, the server should respond with random fortune chosen from its
database of fortunes.
2. Write a multithreaded Pthread or Java program that generates the Fibonacci series.
Unit I
Introduction
Introduction : Mainframe systems – Desktop Systems – Multiprocessor Systems – Distributed Systems – Clustered
Systems – Real Time Systems – Handheld Systems - Hardware Protection - System Components – Operating System
Services – System Calls – System Programs - Process Concept – Process Scheduling – Operations on Processes –
Cooperating Processes
9 Hours
Inter-process Communication
Unit II
Process Management
Threads: Overview – Threading issues - CPU Scheduling: Basic Concepts – Scheduling Criteria – Scheduling
Algorithms – Process Synchronization: The Critical-Section Problem – Synchronization Hardware – Semaphores –
Classic problems of Synchronization – Critical regions – Monitors.
9 Hours
Communications in Client Server Systems
Unit III
Deadlock and Memory Management
System Model – Deadlock Characterization – Methods for handling Deadlocks -Deadlock Prevention – Deadlock
avoidance – Deadlock detection – Recovery from Deadlocks - Storage Management: Swapping – Contiguous
Memory allocation – Paging – Segmentation – Segmentation with Paging.
9 Hours
Memory Management in Linux System
Unit IV
Virtual Memory and File Sharing Interface
Virtual Memory: Demand Paging – Process creation – Page Replacement – Allocation of frames – Thrashing File System Interface: File Concept – Access Methods – Directory Structure – File System Mounting – File Sharing –
Protection.
9 Hours
Virtual Memory in various Operating Systems
Unit V
File System Structure and Storage Structure
File System Structure – File System Implementation – Directory Implementation – Allocation Methods – Free-space
Management- IO Systems- Kernel I/O Subsystems – Mass Storage Structure: Disk Structure – Disk Scheduling –
Disk Management – Swap-Space Management.
9 Hours
File System in Windows XP
Total: 45+15 Hours
Textbook(s)
Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating System Concepts, John Wiley & Sons
(ASIA) Pvt. Ltd, 2010
Reference(s)
1. Harvey M. Deitel, Operating Systems, Pearson Education Pvt. Ltd, 2007
2. Andrew S. Tanenbaum, Modern Operating Systems, Prentice Hall of India Pvt. Ltd, 2007.
3. William Stallings, Operating System, Prentice Hall of India, 2008
82
11Z405 DATABASE MANAGEMENT SYSTEM
3 0 0 3.0
Objective(s)
 To learn the data models, conceptualize and depict a database system using E-R diagram.
 To learn SQL & relational database design.
 To understand the internal storage structures using different file and indexing techniques.
 To know the concepts of transaction processing, concurrency control techniques and recovery
procedure.
Program Outcome(s)
Course Outcome(s)
 Construct an Entity Relationship(E-R) diagram for an application.
 Create a normalized relational database model and write queries to generate reports from it.
 Determine whether the transaction satisfies the ACID properties.
Assessment Pattern
S.No.
1
2
3
4
5
Bloom’s Taxonomy
( New Version)
Remember
Understand
Apply
Analyze / Evaluate
Create
Total
Test I
30
40
20
10
100
Test II
Model
Examination
End-semester
Examination
20
20
20
20
20
100
10
10
20
20
40
100
10
20
30
20
20
100
Remember
1. Define a Data model and specify its types.
2. Define Database Management System
3. Define an attribute
4. Define Primary Key
5. Define a view
6. Define a trigger
7. What are Functional Dependencies?
8. Define Full Functional Dependency
9. Name the primary and secondary storage devices.
10. Define Hashing and mention the types of it.
11. Define Indexing
12. List the ACID Properties.
13. Define locking and mention the types of it.
14. Enumerate the difference between Serialized and Concurrent execution.
Understand
1. Why we need to normalize a Database?
2. Explain the normal forms (upto BCNF) with necessary examples.
3. Write the applications of static hashing and dynamic hashing.
4. Explain the various indexing techniques.
5. Write an algorithm to insert an element in a B+ tree.

83
Apply
1. Illustrate the concept of Transaction with necessary example.
2. Demonstrate the concept of Concurrency control with necessary example.
Analyze / Evaluate
1. Differentiate File System and a Database Management System.
2. Compare Relational Model with E-R data model.
3. Identify whether the given table is normalized or not. If not, normalize the table by applying the various
Normal Forms (up to BCNF).
4. Create a database and analyze the same for the various Integrity Constraints.
Create
1. Draw an ER diagram to maintain the employee details of an organization.
2. Design a relational database system to implement the Railway Reservation System.
3. Create an application to implement the Library Management System.
Unit I
Introduction
Introduction: Database system application, purpose of database system - View of Data –Database Languages- Data
Storage and Querying-Database Architecture – Database design and E-R model: Overview of the design process- The
Entity – Relationship Model-Constraints- Removing redundant attributes in Entity Sets- Entity – Relationship
Diagram- Reduction to Relational Schemas-Entity Relationship Design Issues.
9 Hours
Extended E-R features
Unit II
Relational Model and Database design
Introduction to Relational Model – Formal Relational Query Languages - Introduction to SQL : Data definitionBasic structure of SQL Queries-Additional Basic operations - Set operations-Aggregate functions-Nested sub
queries- Intermediate SQL: Joins- Views – Integrity Constraints.
9 Hours
Advanced SQL: Accessing SQL from a Programming Language
Unit III
Database Design and Normal Forms
Functional Dependencies – Normal Forms Based on primary Keys- General Definition of Second and Third Normal
Form - Boyce Codd Normal Form – Algorithms for relational database schema design - Multivalued dependencies
and Fourth Normal Form.
9 Hours
Join Dependencies and Fifth Normal Form.
Unit IV
Data Storage and Query Processing
Overview of Physical Storage Media – Magnetic disk Flash storage- RAID - File and Record Organization –
Indexing and Hashing: Ordered Indices - B+ Tree Index File- Static Hashing – Dynamic Hashing- Query Processing:
Overview - measures of Query Cost.
9 Hours
Query Processing: Selection operation, Sorting
Unit V
Transaction Management
Transactions: Transaction concept– Transaction Atomicity and Durability- Transaction Isolation – Serializability Transaction Isolation and Atomicity - Transaction Isolation levels- Implementation of Isolation Levels - Concurrency
Control: Lock based protocols - Deadlock handling - Multiple Granularity - Time stamp based protocols - Recovery
system: Failure classification – Storage - Recovery and atomicity – Recovery Algorithms.
9 Hours
84
Concurrency control: Validation Based Protocol
Total: 45 Hours
Textbook(s)
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan, Database System Concepts, McGraw-Hill, 2011
2. Ramez Elmasri and Shamkant B. Navathe, Fundamental Database Systems, Pearson Education, 2008
Reference(s)
1. Raghu Ramakrishnan, Database Management System, Tata McGraw-Hill Publishing Company, 2003
2. C.J.Date, An Introduction to Database system, Pearson Education, 2006
3. Peter Rob and Corlos Coronel, Database System, Design, Implementation and Management, Thompson
Learning Course Technology, 2003
11Z406 DESIGN AND ANALYSIS OF ALGORITHMS
3 1 0 3.5
Objective(s)
 To learn various algorithm design techniques
 To impart knowledge on runtime analysis of algorithms
 To understand the limits of computation
Program Outcome(s)
Course Outcome(s)
 Design of algorithms and compare runtime efficiencies of algorithms
 Devise algorithms for problems that cannot be solved efficiently
 Study of problems that cannot be solved by computers
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze/Evaluate
Create
Total
Test I
Test II
10
20
20
40
10
100
10
20
20
30
20
100
Model
Examination
10
20
20
30
20
100
End-Semester
Examination
10
20
20
30
20
100
Remember
1. Define algorithm
2. Write the characteristics of algorithm.
3. What are the parts of an algorithm?
4. List the criterions used to identify the best algorithm.
5. Define time and space complexity
6. Give the differences between compile time and running time.
7. What are the various types of time complexity of algorithms?
8. State the difference between best case and worst case complexities.

9. Define asymptotic notation
10. Define conditional asymptotic notation
11. Define Big Oh notation
12. State smoothness rule.
13. What are the common running times for big Oh?
14. Define recurrence relation
15. Define Little Oh notation
16. Define Little Omega notation
17. Define substitution method
18. State Master‘s theorem.
19. Give the general plan for analyzing recursive algorithm.
20. Give the general plan for analyzing non-recursive algorithm.
21. List all methods available for solving recurrence relation.
22. List all common problem types.
23. What is order of growth?
24. What is meant by optimal solution?
25. Define divide and conquer strategy
26. Define optimal solution
27. Define greedy technique
28. Define feasible solution
29. What is dynamic programming?
30. What are the steps involved in dynamic programming?
31. Define exhaustive search
32. Define backtracking
33. Define implicit constraint
34. Define explicit constraint
35. Define n-queens problem
36. What is state space of problem?
37. Define solution state and answer state
38. Define state space tree
39. Define dynamic tree
40. Define live and dead node
41. Define graph traversal
42. Mention the types of tree traversal.
43. Compare DFS and BFS.
44. What is meant by connected component?
45. Define spanning tree
46. What is articulation point?
47. What is tree edge and cross edge?
48. What do you mean by least cost search?
49. What is branch and bound?
50. What is meant by Class NP complete?
Understand
1. Discuss the control abstraction of greedy technique.
2. Give examples of back tracking.
3. What are the types of search strategies in branch and bound technique?
Apply
1. Find the space complexity of the following algorithm.
void N()
{
int p,a,b,c;
p = a + b – c;
printf(―%d‖,p);
}
2. Derive the formula for Floyd‘s algorithm and calculate the running time of the algorithm.
85
86
3. How to derive the solution for 2-queen‘s problem?
Analyze
1. Write the DFS algorithm and analyze its run time efficiency.
2. Analyze the time complexity of sorting algorithms based on divide and conquer technique.
3. Compare LIFO and FIFO search.
4. Differentiate between deterministic and non deterministic problems.
Create
1. Design an algorithm to find the sum of first n numbers and analyze its time and space complexities.
2. Write the shortest path algorithms based on greedy techniques and analyze their efficiency.
Unit I
Introduction
Introduction – Fundamentals of Algorithmic Problem Solving – Important Problem types – Fundamental Data
structures.
9 Hours
Sets and Dictionaries
Unit II
Fundamentals of the Analysis of Algorithm Efficiency
Analysis Framework – Asymptotic notations - Basic Efficiency classes - Mathematical Analysis of Non-recursive
Algorithm – Mathematical Analysis of Recursive Algorithm – Example: Fibonacci Numbers – Empirical Analysis of
Algorithms
9 Hours
Algorithm visualization
Unit III
Analysis of Sorting and Searching Algorithms
Brute Force Strategy: Selection Sort and Bubble Sort, Sequential Search and Brute-force string matching – Divide
and conquer: Merge sort, Quick Sort, Binary Search, Binary tree Traversal and Related Properties – Decrease and
Conquer: Insertion Sort, Depth first Search and Breadth First Search.
9 Hours
Exhaustive search
Unit IV
Analysis of Graph Algorithms
Transform and conquer: Presorting, Balanced Search trees – AVL Trees, Heaps and Heap sort – Dynamic
Programming: Warshall‘s and Floyd‘s Algorithm, Optimal Binary Search trees – Greedy Technique: Prim‘s
Algorithm, Kruskal‘s Algorithm, Dijkstra‘s Algorithm – Huffman trees.
9 Hours
Knapsack problem and memory functions
Unit V
Algorithm Design Techniques to NP Complete Problems
Limitations of algorithm power: Lower-bound arguments – NP Complete problems – Backtracking: n-Queen‘s
Problem – Hamiltonian Circuit problem – Subset-Sum problem – Branch and bound: Assignment problem, Knapsack
problem – Traveling salesman problem.
9 Hours
Decision trees
Total: 45+15 Hours
Textbook(s)
Anany Levitin, Introduction to the Design and Analysis of Algorithms, Second Edition, Pearson Education
Asia, 2011
87
Reference(s)
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, PHI Pvt. Ltd., 2001
2. Sara Baase and Allen Van Gelder, Computer Algorithms –
Introduction to Design and Analysis,
Pearson Education Asia, 2010
3. A.V.Aho, J.E. Hopcroft and J.D.Ullman, The Design and Analysis of Computer Algorithms, Pearson
Education Asia, 2003
11Z407 SYSTEM SOFTWARE AND OPERATING SYSTEM LABORATORY
0 0 3 1.5
Objective(s)
 To understand the concepts of operating system.
 To learn the functions of assemblers, loaders and linkers.
 To understand the principles of concurrency, synchronization.
Program Outcome(s)
solutions, think creatively and communicate effectively
Skill Set
 Demonstrate the working of Assembler, Loader and Linker.
 Differentiate various Memory Management Schemes.
 Demonstrate various Disk Scheduling Algorithms.
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Preparation
Observation and Analysis of Results
Record
Mini-Project/Model
Examination/
Viva-Voce
Total
Internal
Assessment
10
15
10
15
End Semester
Examination
15
20
15
50
50
Remember
1. What is kernel?
2. What is forward reference?
3. Define load and go assembler
4. Define absolute loader
5. What is meant by bootstrap loader?
6. Write the two passes of a linking loader.
Understand
1. How the macro is processed using two passes?
2. How the nested macro calls are executed?
3. How to design the pass structure of a macro assembler?
4. Give the advantages of multiprocessor system?
5. How the index blocks are implemented in the indexed allocation scheme?
6. How the free-space is managed?
Apply
1.
2.
3.
4.
5.
What are the structures used in file-system implementation?
What are the functions of virtual file system (VFS)?
Why the production is needed in the file sharing system?
What are the methods for handling deadlocks?
Explain the classical problems of synchronization.
88
Analyze
1. Give the difference between linking loader and linkage editors.
2. Differentiate tightly coupled systems and loosely coupled system.
3. Compare user threads with kernel threads.
Evaluate
1. Given the following processes and burst times
Process
Burst Time
P1
10
P2
6
P3
23
P4
9
P5
31
P6
3
P7
19
Calculate the average wait time for the Non Pre-Emptive, First Come, and First Serve Round Robin, Shortest
Job First of the scheduling algorithms. Assume that a quantum of 8 is being used.
Create
1. Write a program to implement a single Pass Assembler.
2. Write a socket-based Fortune Teller Server. Your program should create a server that listens to a specified
port. When a client receives a connection, the server should respond with random fortune chosen from its
database of fortunes.
3. Write a multithreaded Pthread or Java program that generates the Fibonacci series.
List of Experiments (System Software)
1. Implementations of a symbol table with functions to create, insert, modify, search, and display.
2. Implementation of single pass assembler.
3. Implementation of a macro processor.
4. Implementation of a loader.
5. Implementation of a direct-linking loader.
6. Implementation of a simple text editor with features like insertion / deletion of a character, word.
List of Experiments (Operating System)
1. Implementation of CPU scheduling algorithms: FCFS, SJF, Round Robin & Priority Scheduling.
2. Implement the Producer – Consumer problem using semaphores.
3. Implementation of Banker‘s algorithm.
4. Implement some memory management schemes (First fit, Best fit & Worst fit) and some page replacement
algorithms (FIFO & LRU).
Design Experiments
Total: 45 Hours
Mini Project
Practical Schedule
S.No
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
Experiments
Symbol Table
Single Pass Assembler
Macro Processor
Loader
Direct-linking loader
Simple Text Editor
CPU scheduling algorithms: FCFS, SJF, Round Robin & Priority Scheduling
Producer – Consumer problem using semaphores
Banker‘s algorithm
Memory management schemes (First fit, Best fit & Worst fit)
Page replacement algorithms (FIFO & LRU)
Design Experiments
Hours
6
3
3
6
3
3
6
3
3
6
3
11Z408 CONCURRENT PROGRAMMING LABORATORY
0 0 3 1.5
Objective(s)
 To impart the fundamental concepts of core JAVA.
 To enable the students to gain programming skills in JAVA.
 To gain the built in knowledge of standalone and web applications.
Program Outcome(s)
Demonstrate an ability to use techniques, skills and modern computing tools to implement and organize
Skill Set
 Solve the basic design problems using object and classes.
 Demonstrate the concepts of OOPs.
 Design programs using applet and event handling.
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Preparation
Record
Mini-Project/Model
Total
Remember
1. Define final variable
2. What is method overriding?
3. What is an interface?
4. Define package
5. What is meant by exceptions?
6. What is Collection API?
Understand
1. Describe the step of creating an applet.
Internal
Assessment
10
15
10
15
End Semester
Examination
15
20
15
50
50
89
90
2. How to create a package with in a package?
3. Identify the use of method overriding?
Apply / Evaluate
1. Write a program to copy from one file to another file with line numbering.
2. Write a program to display the student‘s details using inheritance.
Create
1. Create a GUI based applet with following specifications: Scan your photograph using a scanner. See to it
your photograph is converted into a file with extension photoname.jpg. Place a copy of this file in your
computer. Display this file on frame:
a) Without scaling
b) With vertical scaling
c) With horizontal scaling
2. Develop a program with constructor to pass integer literal9999 as argument to constructor Genclass
<Integer> function and to pass the string literal ―New Delhi‖ to constructor Genclass <String> function.
List of Experiments
1. Classes and Methods.
2. Implementation of Inheritance.
3. Implement the concepts of Interfaces and Packages.
4. Exception handling Mechanisms.
5. Create a Multithreaded Programming.
6. String Handling Methods and Collections Classes.
7. Input / Output Streams.
8. Applet Programs.
9. Abstract Window Toolkit Classes and Event Classes.
10. Implementation of JDBC concepts.
Design Experiments
Total: 45 Hours
Practical Schedule
S. No.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
Experiment
Classes and Methods.
Implementation of Inheritance.
Implement the concepts of Interfaces and Packages.
Exception handling Mechanisms.
Create a Multithreaded Programming.
String Handling Methods and Collections Classes.
Input / Output Streams.
Applet Programs.
Abstract Window Toolkit Classes and Event Classes.
Implementation of JDBC concepts.
Mini project
Hours
3
3
6
3
3
6
3
3
3
6
6
11Z409 DATABASE MANAGEMENT SYSTEM LABORATORY
0 0 3 1.5
Objective(s)


To learn the fundamental concepts of SQL queries.
To understand the concept of designing a database with the necessary attributes.

91
To know the methodology of Accessing, Modifying and Updating data & information from the relational
databases
Program Outcome(s)
Skill Set
 Develop PL/SQL to perform insert, delete and update operations in a database.
 Create a database and write the necessary PL/SQL block to print the details from the database.
 Develop an application to implement a real time process.
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Preparation
Record
Mini Project/Model
Internal
Assessment
10
15
5
End-semester
Examination
15
20
-
20
50
15
50
Total
Remember
1. Define DBMS
2. Define the term SQL
3. Define DDL
4. Mention the syntax of the commands in DDL.
5. What are group functions?
6. List the Group (Aggregate) functions.
7. What are joins?
8. Enumerate the types of joins.
9. What do you mean by Integrity constraint?
10. How can we classify the Integrity constraint?
11. What is a PL/SQL block.
12. Define a cursor
13. List the database objects in PL/SQL.
14. What is an exception?
15. Differentiate natural join and Cartesian product.
Understand
1. Why we need to normalize a Database?
2. Explain the normal forms (upto BCNF) with necessary examples.
3. Write the applications of static hashing and dynamic hashing.
Apply
1.
Design a simple database system to depict that it satisfies the four normal forms.
Analyze / Evaluate
1. Create a database and analyze the same for the various Integrity Constraints.
2. Identify the second greatest mark from the given table and display all the information about that student.
Create
92
1. Create a Library Management System.
2. Develop an application to maintain the student‘s information of an institution.
3. Create a database system to implement the University result publication.
List of Experiments
1. Working with SQL commands like DDL, DML, TCL, DCL
2. Performing Single-row functions and group functions in SQL.
3. Execute simple queries using joins and Integrity constraints.
4. Creation and manipulation of database objects.
5. Simple programs using PL/SQL block.
6. Implementation of cursor in PL/SQL block.
7. Generate trigger in PL/SQL block.
8. Write PL/SQL block Programs using exception handling.
9. Design PL/SQL blocks using subprograms namely functions and procedures.
Mini Project: Database design and Implementation using MySQL and PHP.
Total: 45 Hours
93
Practical schedule
S. No
1
2
3
4
5
6
7
8
9
10
Experiment
Hours
Working with SQL commands like DDL, DML, TCL, DCL
Performing Single-row functions and group functions in SQL.
Execute simple queries using joins and Integrity constraints.
Creation and manipulation of database objects.
Simple programs using PL/SQL block.
Implementation of cursor in PL/SQL block.
Generate trigger in PL/SQL block.
Write PL/SQL block Programs using exception handling.
Design PL/SQL blocks using subprograms namely functions and procedures.
Mini Project
6
6
6
3
3
3
3
3
6
6
11Z501 MOBILE COMMUNICATIONS
3 1 0 3.5
Objective(s)



To impart the fundamental concepts of mobile communication systems.
To understand the issues relating to wireless applications.
To learn the working principles of Wireless LAN standards and Wireless Application Protocols.
Program Outcome(s)
e)
f)
Develop software as per the appropriate software life cycle model.
Organize and maintain the information of an organization.
Course Outcome(s)



Analyze the working of modern communication technologies.
Demonstrate the various routing algorithms.
Develop mobile content applications using Wireless Application Protocols.
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
10
20
20
30
10
10
100
Test
II
10
20
20
30
10
10
100
Model
Examination
10
20
20
30
10
10
100
End-Semester
Examination
10
20
20
30
10
10
100
Remember
1)
2)
3)
4)

What is mobile communication?
Define wavelength
Define delay spread
List the types of modulation techniques.
5)
6)
7)
8)
9)
10)
11)
12)
13)
14)
15)
16)
17)
18)
19)
20)
21)
22)
23)
94
What is ‗handoff‘?
What are the different types of services offered by GSM?
List out the applications of DECT system.
Specify the standards offered by TETRA.
What are the types of handover in UMTS?
List the different types of the satellite orbits.
Give any two advantages of GEO over LEO satellites.
What are the advantages and disadvantages of WLANS?
Mention the design goals of WLANS.
What are the three main management wings under IEEE 802.11 standard?
Give the basic access mechanisms defined for IEEE 802.11.
List the phases involved in HIPERLAN-1 EY-NPMA access scheme.
What is Piconet?
What are functions of p-savers and p-supporters in HIPERLAN?
What is Beacon?
What is Triangular Routing?
What is the function of Foreign Agent & Home Agent?
What are the requirements of mobile IP?
What are the additional messages needed in a mobile IP for optimization?
Understand
1)
2)
3)
4)
5)
6)
7)
8)
9)
10)
11)
12)
13)
14)
15)
16)
How does the digital signal vary from analog signal?
What is meant by near and far effect?
Why does CSMA/CD scheme fail in wireless networks?
Discuss about the four possible handover scenarios in GSM.
How is system security maintained in GSM?
How power management is done in IEEE 802.11 infrastructure based Adhoc networks?
How does a mobile node find a Foreign Agent?
Why routing is complicated in Adhoc networks when compared to other networks?
How does a Bluetooth device save battery power?
Explain briefly the frequency hopping used in Bluetooth.
How does push proxy gateway works in WAP?
How does hierarchical clustering helps routing in Adhoc networks?
How does asymmetric links affect routing in Adhoc networks?
When is reverse tunneling useful in Mobile IP?
What is mean by Care-of Address?
Recognize the fundamental difference of WML compared to HTML. Why is this difference important with
respect to handheld devices?
17) Explain the functions of transport layer in the WAP architecture.
18) Discuss briefly the role of a WTA server
Apply
1)
2)
3)
4)
5)
Illustrate the system architecture of GSM.
Sketch the architecture of IEEE 802.11 and explain its salient features.
Write notes on various encapsulation mechanisms used in mobile IP.
Outline the protocol stack of Bluetooth.
Illustrate the architecture of WAP version 1.x.
95
Analyze
1) Differentiate analog and digital signals.
2) Compare SDMA, TDMA, FDMA and CDMA.
3) Compare the security features of GSM, UMTS, DECT and IMT 2000.
4) Differentiate GEO, MEO and LEO satellites.
5) Compare IEEE 802.11 and HIPERLAN with regard to their Adhoc capabilities.
6) Compare the features of wired network with ad hoc network related to routing.
7) Differentiate between table-driven routing protocol & on-demand routing protocol.
8) Distinguish client-centric mode and server-centric mode in WTA.
9) Criticize the features present in WSP/B in addition to that present in WSP.
10) Contrast the functional behaviors of traditional TCP and classical TCP.
Evaluate
1) Evaluate the security features of WAP and find out the problems that will occur in WAP security layer.
2) Can the problems using TCP be solved by replacing TCP with UDP? Where could this be useful and why is
it quite often dangerous for network stability?
Create
1) Develop a simple mobile content application for telecommunication systems.
2) Design an architecture for a mobile computing based business application.
Unit I
Wireless Communication Fundamentals
Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation
– Multiplexing – Modulation – Spread Spectrum –Medium Access Control (MAC) – Space Division Multiple
Access(SDMA) –Frequency Division Multiple Access (FDMA) – Time Division Multiple Access (TMDA) – Code
Division Multiple Access(CDMA)
9 Hours
Comparison of Space/Time/Frequency/Code Division Multiple Access
Unit II
Wireless Telecommunication Networks
Telecommunication systems – Global System for Mobile (GSM)– Digital Enhanced Cordless Telecommunication
(DECT)–Terrestrial Trunked Radio (TETRA)– Universal Mobile Telecommunication System (UMTS) –
International Mobile Telecommunication 2000 (IMT-2000) – Satellite systems – Basics –Routing – Broadcast
Systems – Digital Audio Broadcasting (DAB) – Digital Video Broad casting (DVB).
9 Hours
Convergence of broadcasting and mobile communications
Unit III
Wireless LAN
Advantages and disadvantages of Wireless Local Area network (WLAN) – IEEE 802.11 – System Architecture –
Medium Access Control management (MAC) – High Performance Radio LAN (HIPERLAN)– Bluetooth
Architecture – Security.
9 Hours
IEEE 802.15
Unit IV
Mobile Network Layer
Mobile IP – Internet Protocol version 6 (IPv6) – Dynamic Host Configuration Protocol – Mobile ad-hoc networks –
Routing – Destination Sequence Distance Vector – Dynamic Source Routing.
9 Hours
Metrics in Mobile ad-hoc networks
96
Unit V
Transport and Application Layers
Traditional TCP – Classical TCP improvements – Wireless Application Protocol – Architecture – Wireless Datagram
Protocol (WDP) – Wireless Transport Layer Security(WTLS) –Wireless Session Protocol (WSP) – Wireless
Application Environment (WAE) – Wireless Markup Language (WML)– Wireless Markup Language Script (WML
Script) – Wireless Telephony Application (WTA) – Push architecture – Push/pull services.
9 Hours
Wireless Access Protocol 2.0
Total: 45 +15 Hours
Textbook(s)
Jochen H.Schiller, Mobile Communications, Pearson Education, 2007. (Reprint 2011)
Reference(s)
1.
2.
3.
4.
William Stallings, Wireless Communications and Networks, PHI/Pearson Education, 2002
Kaveh Pahlavan and Prasanth Krishnamoorthy, “Principles of Wireless Networks”, PHI/Pearson Education,
2003
Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, ―Principles of Mobile Computing”,
Springer, New York, 2003
Hazysztof Wesolowshi, ―Mobile Communication Systems”, John Wiley and Sons Ltd, 2002
11Z502 GRAPHICS AND MULTIMEDIA
3 0 0 3.0
Objective(s)
 To learn the basics of computer graphics.
 To understand the graphical algorithms.
 To design and implement an application which illustrates the use of 3D viewing model.
Course Outcome(s)
 Demonstrate the graphical algorithms.
 Design 2D and 3D graphics animation.
 Analyze the working of modern graphics technologies.
Assessment Pattern
S.No
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
20
30
20
20
2
Understand
20
20
25
25
3
Apply
20
20
20
20
4
Analyze/Evaluate
30
20
25
25
5
Create
10
10
10
10
Total
100
100
100
100
Remember
1. Define graphics
2. What is resolution?
3. Define pixel and frame buffer?
4. List the various attributes of a line?

97
5. Define Geometric Transformation
6. Define clipping
7. List the components of multimedia.
Understand
1. Describe the steps in DDA line drawing algorithm.
2. Explain the working principle of CRT.
3. Discuss the merits and demerits of DDA line drawing algorithm
4. Explain the steps in Bresenham's line drawing algorithm.
5. Discuss about flat panel displays devices.
6. Explain the scan conversion.
7. Describe the features of Inkjet printer.
8. What are the merits of page based authoring tools?
9. Mention the software tools used for manipulating images.
Apply
1. Demonstrate the Three Dimensional transformations technique with an example.
2. Illustrate the Liang – Barsky line clipping with an algorithm.
Analyze/ Evaluate
1. Determine the successive pixel positions of the line with end points (20, 10) and (30, 18) using Bresenham‘s
Line Drawing algorithm with the slope of 0.8.
2. Examine the midpoint circle algorithm by determining the positions along the circle with given radius
r=10.
Create
1. Design a polygon using DDA line drawing algorithm.
2. Design 2D Animation of a moving wheel and a pendulum.
Unit I
Overview of Graphics Systems
A survey of computer graphics : Computer Aided Design – Presentation Graphics – Computer Art – Entertainment
Education and Training – Visualization – Image processing – Graphical User Interface - Overview of Graphics
Systems : Video Display Devices - Raster Scan Systems and Random Scan Systems
9 Hours
Input devices & Graphics Software
Unit II
Output Primitives & Attributes
Output Primitives: Points and Lines – Line Drawing Algorithms – Loading the frame buffer - Circle generating
algorithms – Ellipse generating algorithms – Filled area primitives – Attributes of Output Primitives: Line attributes –
Curve Attributes – Color and Grayscale Levels – Area-Fill attributes – Character Attributes.
9 Hours
Antialiasing
Unit III
Geometric Transformations
Basic transformations – Matrix representations – Composite Transformations – Other Transformations - Affine
Transformations –Viewing Pipeline-Window–to-Viewport coordinate Transformation –Clipping Operations – Point
Clipping – Line Clipping – Polygon Clipping- Three Dimensional Geometric and Modeling Transformations.
9 Hours
Raster methods for Transformation
Unit IV
Text, Sound and Images
Text: Using Text in Multimedia- Computers and Text- Font Editing and Design Tools- Hypermedia and HypertextSound: Multimedia System Sounds- Digital Audio- Making MIDI Audio- MIDI Versus Digital Audio- Adding
Sound to Multimedia Project- Image: Making Still Images- Color- Image File Formats.
9 Hours
Music CD‟s
98
Unit V
Animation and Multimedia Software
Animation: Principles of Animation –Animation by Computer- Making Animations that Work- Video: How video
works – Digital Display Standards-Digital Video- Shooting and Editing Video- Basic Software Tools: Text, Image,
and Sound Editing Tools-Painting and Drawing Tools- Animation, Video and Digital Movie Tools.
9 Hours
Video Recording and Tape Formats
Total: 45 Hours
Textbook(s)
1. Donald Hearn and Pauline Baker, Computer Graphics C version, Pearson Education, 2008
2. Tay Vaughan, Multimedia: Making It Work, Tata McGraw Hill, 2008
Reference(s)
1. Foley, Vandam, Feiner and Huges, Computer Graphics: Principles & Practice, Pearson Education, 2003
2. Judith Jeffcoate, ―Multimedia in practice technology and Applications‖, PHI, 2008
11Z503 MICROPROCESSORS AND MICROCONTROLLER
3 0 0 3.0
Objective(s)
 To study the architecture of microprocessors and microcontrollers.
 To understand the instruction set of microprocessors.
 To learn the methods of interfacing microprocessors with various peripheral devices.
Program Outcome(s)
Course Outcome(s)
 Describe the working principles of microprocessors, microcontrollers.
 Demonstrate the interfacing of peripherals devices.
Assessment Pattern
S.No
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
10
10
10
10
2
Understand
20
20
20
20
3
Apply
20
20
20
20
4
Analyze/Evaluate
30
40
40
40
5
Create
20
10
10
10
Total
100
100
100
100
Remember
1. What is memory mapping?
2. What is interrupt? Mention its types.
3. What is vectored and non vectored interrupts?
4. What is the need for timing diagram?
5. Define T-state
6. What is masking?
7. What are the different addressing modes of 8085?
8. List the operation modes of 8255.
9. Define USART
10. What is key debouncing?
11. Define keyboard matrix
12. What is the output mode used in 8279?

99
13. Define pipelining
14. What are the predefined interrupts in 8086?
15. What are the different flags available in status register of 8086?
16. State the significance of LOCK signal in 8086.
17. What is an interrupt service routine?
18. List the advantages of microprocessors.
19. What is Microcontroller?
20. List the features of 8051 microcontroller.
Understand
1. Classify the instruction sets of 8086.
2. Draw the architecture of 8085 microprocessor.
3. Why the Building blocks of memories are evenly classified?
4. How 16 bit processor generates 20 bit addresses in 8086?
Apply
1. Write a program to find out whether a given bytes is in the string or not. If it is in the string, find out the
relative address of the byte from the starting location of the string.
2. Illustrate the differences in the flags set by adding 01H and by incrementing the accumulator contents.
Assume the accumulator holds the data byte FFH.
Analyze/Evaluate
1. Compare memory mapped I/O and I/O mapped I/O.
2. Write a program to subtract the contents of R1 of Bank0 from the contents of R0 of Bank2.
3. Write logical steps to add the following two Hex numbers. Both the numbers should be saved for future use.
Save the sum in the accumulator.
Numbers: A2H and 18H.
Create
1. Illustrate the interfacing circuits of 8255 with 8085 in traffic controller system.
2. Write a program to move a string of data words from offset 2000H to offset 3000H the length of the string is
0FH.
Unit I
The 8085 Microprocessor
Microprocessor Architecture and Microcomputer Systems: Microprocessor Architecture and Its Operations, 8085
Microprocessor Architecture And Memory Interfacing: The 8085 MPU – Introduction To 8085 Instructions: Data
Transfer Operations-Arithmetic Operations-Logic Operations-Branch Operations, Interrupts: The 8085 Interrupt,
8085 Vectored Interrupts.
9 Hours
Programming Techniques with Additional Instructions
Unit II
The 8086 Microprocessor
8086/8088 Microprocessor: Architecture, Pin Diagrams, Timing Diagrams: Register Organisation of 8086Architecture - Signal Descriptions of 8086 - Physical memory organization - General bus Operation - I/O Addressing
Capability - Special Processor Activities - Minimum Mode 8086 System and Timings - Maximum Mode 8086 system
and Timings –The Processor 8088, 8086 Instruction Set And Assembler Directives: Machine Language Instruction
Formats - Addressing Modes of 8086 - Instruction set of 8086.
9 Hours
Assembler Directives and Operators
Unit III
8086 system Design
The Art of Assembly Language Programming with 8086/8088:A few Machine Level Programs-Machine Coding the
programs-Programming with an Assembler, Special Architecture Features And Related Programming: Introduction to
stack-Stack Structure of 8086/88-Interrupt and Interrupt Service Routines-Interrupt Cycle of 8086/8088-Non
Maskable Interrupt-Maskable interrupt-Interrupt programming- MACROS.
9 Hours
Interrupt programming
100
Unit IV
I/O Interfacing
Special Purpose Programmable Peripheral Devices and their Interfacing: Programmable Interrupt Controller 8259AThe Keyboard/Display Controller 8279, DMA Controller 8257-DMA Transfers and Operations.
9 Hours
CRT controller 8275
Unit V
Microcontrollers
Architecture of 8051 – Signal Descriptions of 8051,Register Set Of 8051– Important Operational Features of
8051 – Memory And I/O Addressing by 8051– Interrupts of 8051- Instruction Set of 8051.
9 Hours
INTEL‟s 16-bit Microcontroller Family MCS-96
Total: 45 Hours
Textbook(s)
1. Ramesh S.Gaonkar, Microprocessor – Architecture, Programming and Applications with the 8085, Penram
International publishing private limited, 2008
2. A.K.Ray and K.M.Bhurchandi, Advanced Microprocessors and peripherals- Architectures, Programming
and Interfacing, TMH, 2009
Reference(s)
1. Douglas V.Hall, Microprocessors and Interfacing: Programming and Hardware, TMH, 2010
2. Yu-cheng Liu and Glenn A. Gibson, Microcomputer systems: The 8086 / 8088 Family architecture,
Programming and Design, PHI 2006
3. Mohamed Ali Mazidi, Janice Gillispie Mazidi, The 8051 microcontroller and embedded systems, Pearson
education, 2009
11Z504 THEORY OF COMPUTATION
3 1 0 3.5
Objective(s)
 To understand the mathematical models of computation
 To design grammars and recognizers for different formal languages
 To know the relation among regular language, context free language and the corresponding recognizers
 To determine the decidability and intractability of computational problems
Program Outcome(s)
complete software related projects
Course Outcome(s)
 Construct correct mathematical models.
 Synthesize finite automata with specific properties.
 Specify a well defined set of rules for syntax verification
 Analyze the undecidability of problems.
101
Assessment Pattern
S.No Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
30
20
20
20
2
Understand
20
20
20
20
3
Apply
20
30
30
30
4
Analyze/Evaluate
10
10
10
10
5
Create
20
20
20
20
Total
100
100
100
100
Remember
1. Define set and its operations
2. Enumerate the differences between NFA and DFA.
3. Define ε-NFA
4. State the pumping lemma for regular languages.
5. What are the three ways to simplify a context free grammar?
6. State pumping lemma for context-free languages.
7. Define Pushdown Automata
8. What is the significance of PDA?
9. Define the language acceptance methods of a PDA
10. What is a multi-tape Turing machine?
11. What is Church‘s Hypothesis?
12. Define Recursively enumerable language
13. Define Diagonalization Language
14. Define Phrase structure grammar
15. State Rice theorem.
Understand
1. Obtain a DFA to accept strings of a‘s and b‘s with atmost two consecutive a‘s.
2. Write the regular expression for all strings over {0, 1} with the substring ‗0101‘.
3. Give the classification of grammars for the various computational models.
4. Simplify the CFG: S →a | Ab | aBa, A →b | Є, B →b | A.
5. Find the transitions of a PDA to accept the language L = {0 nc12n}.
6. Explain the programming techniques of Turing machines.
7. Differentiate recursive and recursively enumerable languages.
8. Discuss the properties of recursive and recursively enumerable languages.
Apply
1. Prove the following by the principle of Induction
For all n ≥ 0 : ∑ i2 = n(n+1)(2n+1)
2. Illustrate the language acceptance of a DFA with an example.
3. If a language L is a CFL then prove that there exists a PDA M such that L = N(M) that is the language
accepted by an empty stack.
4. Write a CFG for the language L= {an b an | n>=1}.
5. Illustrate the conversion of a CFG into PDA with an example.
6. Demonstrate the encoding technique of Universal TM with an example.
7. Show that the halting problem of Turing Machine is undecidable.
8. Find whether the PCP with two lists x = (1, 10111, 10) and Y = (111, 10, 0 ) has a solution or not.
Analyze / Evaluate
1. Show that L = {0n | n is a perfect square} is not regular.
2. Check whether the PDA for the language L={wcwR/w in (0+1)*} is deterministic or not.
3. Using pumping lemma , examine the L={ an bn cn| n>=1} is a CFL or not
4. Show that the following grammar is unambiguous :S -> A1B, A -> 0A | ε, B -> 0B | B | ε

5.
6.
Create
1.
2.
102
Consider the CFG G defined by the productions S -> aSbS | bSaS | ε. Show that L(G) is the set of all strings
with an equal number of a‘s and b‘s.
Check whether Lu is recursively enumerable or recursive. Justify.
Construct an epsilon NFA for the regular expression ab(a/b)*aab
Write the corresponding regular expression for the following languages over the alphabet
{0,1}:


3.
4.
Set of all strings containing 1101 as a substring
Set of all strings with exactly three consecutive zero‘s
Construct an equivalent grammar G in CNF for the grammar G1 where
G1 = ({S, A, B}, (a,b), {S->bA/aB, A -> bAA/aS/a, B -> aBB /bS/b}, S).
Design a TM to accept the language L= { an bn | n >=1}.
Unit I
Automata
Introduction to formal proof – Additional forms of proof – Inductive proofs – Finite Automata (FA) – Deterministic
Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions.
9 Hours
Application of Finite Automata – Text Search
Unit II
Regular Expressions and Languages
Regular Expression – FA and Regular Expressions – Applications of Regular Expression –Algebraic Laws for
Regular Expression - Proving languages not to be regular – Closure properties of regular languages.
9 Hours
Decision Properties of Regular Languages
Unit III
Context-Free Grammar and Languages
Context-Free Grammar (CFG) – Parse Trees – Applications of Context-Free Grammar -Ambiguity in grammars and
languages – Definition of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown
automata and CFG.
9 Hours
Ambiguity Resolution in YACC
Unit IV
Context-Free Languages and Turing Machines
Normal forms for CFG – Pumping Lemma for CFL - Closure Properties of CFL – Turing Machines (TM) –
Programming Techniques for TM.
9 Hours
Extensions to the Basic Turing Machine
Unit V
Undecidability
A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Undecidable problems
about Turing Machine – Post‘s Correspondence Problem – Rice Theorem.
9 Hours
Total: 45+15 Hours
Introduction to classes P and NP
Textbook(s)
John E.Hopcroft, Rajeev Motwani and Jeffrey.D Ullman, Introduction to Automata Theory, Languages and
Computations, Pearson Education, Third Edition, 2009
103
Reference(s)
1.
2.
3.
4.
Harry R.Lewis and Christos.H.Papadimitriou, Elements of The theory of Computation, Pearson
Education/PHI, 2003
John C.Martin, Introduction to Languages and the Theory of Computation, TMH, 2007
Micheal Sipser, Introduction of the Theory and Computation, Thomson Brokecole, 2005
Peter Linz, An Introduction to formal languages and automata, Jones & Bartlett learning, 2006
11Z505 COMPUTER NETWORKS
3 0 0 3.0
Objective(s)
 To understand the state-of-the-art in network protocols, architectures and applications.
 To study the functions of different layers.
 To familiarize the various aspects of computer networks.
Program Outcome(s)
Course Outcome(s)
 Demonstrate the networking strategies.
 Identify the technical issues related to networking technologies.
 Design and build a network using routers.
Assessment Pattern
S.No
1
2
3
4
5
Remember
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.

Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze/Evaluate
Create
Total
Test I
Test II
30
20
20
10
20
100
20
20
30
10
20
100
Model
Examination
20
20
30
10
20
100
End-Semester
Examination
20
20
30
10
20
100
Define network
What are the key design issues of a computer network?
List the advantages of optical fiber.
What is circuit switching and what are its chief characteristics?
List the encapsulation involved in the creation of an Ethernet frame.
What is the difference between routable and non- routable protocols?
What is multicast routing?
What is a DNS resource record?
What are the two interfaces provided by protocols?
What is redundancy?
What are the functions of MAC?
What is a link?
Define node
What is meant by gateway?
What is point-to-point link?
104
16. Name the factors that affect the security of the network.
17. What is protocol?
18. What are the key elements of protocols?
19. Define routing
20. What is a peer-peer process?
21. What is semantic gap?
22. Define the terms Unicasting, Multi-casting and Broadcasting
23. List the layers of OSI.
24. What are the Data link protocols?
25. What is Forward Error Correction?
26. What is framing?
27. What is bit stuffing?
28. What is Stop-and-Wait Protocol?
29. What is sliding window?
30. Mention the categories of flow control.
31. What is meant by congestion?
32. Give the main idea of UDP.
33. Define TCP
34. What is meant by quality of service?
35. What are the two categories of QoS attributes?
36. Give the format of HTTP request message.
37. What is the purpose of Domain Name System?
Understand
1. How are the guided media differing from unguided transmission media?
2. Identify the address class of 123.167.23.20 and 250.10.24.96.
3. Can multiple circuits share a single optical fiber in a circuit-switched network?
4. Explain the data frame format of IEEE 802.11 Standard.
5. Write the subnet, broadcast address and valid host range for the following:
a) 172.16.10.5
255.255.255.128
b) 172.16.10.33
255.255.255.224
c) 172.16.10.65
255.255.255.192
d) 172.16.10.17
255.255.255.252
6. The Network address is 192.168.10.0 and the Subnet mask is 255.255.255.252.
Find out a) How many subnets?
b) How many hosts?
7. How many connections are required to connect 20 computers in a mesh network?
Apply
1. For the bit stream 100010100, draw the waveform for Manchester and Differential Manchester Coding and
also discuss the advantages of the coding schemes.
2. Calculate the latency of a packet transferred between two hosts A and B on a local network, where they are
connected via a cable of length 6.21 m, the packet size is 2024 bytes, and the capacity of the cable is 56 bps.
(Assume that queuing delays are not considered. Also recall that 1 byte = 8 bits, and the speed of light =
3.0x108 m/s.)
3. An end system sends 50 packets per sec using UDP protocol over a full duplex 100Mbps Ethernet LAN
connection. Each packet consists of 1600 bytes of Ethernet frames payload data. Compute the throughput at
UDP layer.
4. Convert a classless (CIDR) network address (e.g. 192.168.0.0/24) to its IP address/mask equivalent (e.g.
192.168.0.0 255.255.255.0) and vice versa
5. A collection of five routers is to be connected in a point-to-point subnet. Between each pair of routers, the
designers may put a high-speed line, a medium-speed line, or a low-speed line, or no line. If it takes 100 ms of
computer time to generate and inspect each topology, compute the time required to inspect all of them.
105
Analyze
1. Identify whether circuit switching system or a packet switching preferable for broadcasting a copy of a video
presentation. Why?
2. Switching can improve the efficiency of a network‘s link utilization, but may also cause problems. In a
packet-switched network, two particular problems are increased latency and data loss.
(i) Taking the IP packet-switching, explain how latency and loss might occur.
(ii) To what extent are the problems of latency and loss less significant in circuit-switched networks?
Evaluate
1. The switching process consists roughly of a demultiplexing stage, a routing stage and a remultiplexing stage.
For each of the following examples of switching, explain what is being demultiplexed, what routing
decisions are made, and how remultiplexing is performed:
(i)
packet switching in the postal network;
(ii)
packet switching in an Ethernet switch;
(iii)
packet switching in an IP router;
(iv)
circuit switching in the telephone network.
2. Given the extended LAN shown in the figure below, indicate which ports are not selected by the spanning
tree algorithm. The LAN‘s in the figure are labeled A-J and the bridges in the figure are labeled B1-B7. Hub
Bi has an ID of i which is used as the tie breaker.
Create
1. A routing protocol is a system used by routers to automatically maintain their forwarding tables. Outline a
simple routing protocol which might be used to maintain the table under shortest path routing policy.
Mention any additional information that you must store in the router, and any problems you notice.
2. A company has two LANs, one in Chennai with 300 hosts and another one in Madurai with 150 hosts. Could
it be possible to connect those networks to the Internet using only one Class C network addresses? Justify
the answer. If the answer is positive, create a network layout, assign IP addresses to every router and to one
host in the network, and specify the routing tables of all routers and the specified host.
Unit I
Introduction
Data Communications - Data Flow - Networks – The Internet - Protocols and Standards - Network Models: Layered
Tasks - The OSI Model - TCP/IP Protocol Suite - Addressing - Transmission Media – Connecting LANs, Backbone
Networks, and Virtual LANs: Connecting Devices.
9 Hours
Backbone Networks
Unit II
Data Link Layer
Introduction - Block Coding - Cyclic codes - Checksum – Data Link Control: Framing – Flow and Error Control –
Noiseless Channels – Noisy Channels –HDLC- Multiple Access: Random Access – Channelization -Wired LANs:
IEEE Standards- Standard Ethernet -Wireless LANs: IEEE 802.11
9 Hours
Bluetooth Architecture and Layers
106
Unit III
Network Layer
IPv4 Addresses- IPv6 Addresses - Internetworking - IPv4 - IPv6 – Transition from IPv4 to IPv6 – Network Layer:
Delivery, Forwarding, and Routing: Address Mapping – Internet Control Message Protocol (ICMP) – Internet Group
Management Protocol (IGMP) – Network Layer: Delivery, Forwarding, and Routing: Delivery - Forwarding Unicast Routing Protocol -Multicast Routing Protocols.
9 Hours
Concepts of ICMPv6
Unit IV
Transport Layer
Process-to-Process Delivery - User Datagram Protocol (UDP) - Transmission Control Protocol (TCP) – Stream
Control Transmission Protocol (SCTP) – Congestion Control and Quality of Service: Data Traffic - Congestion
Control - Quality of Services (QoS) - Techniques to improve QoS - Integrated Services - Differentiated Services.
9 Hours
QoS in Switched Networks
Unit V
Application Layer
Domain Name System (DNS): Domain Name Space – Distribution of Name Space – DNS in the Internet– WWW
and HTTP - Network Management: Simple Network Management Protocol (SNMP)
9 Hours
Cryptography: Introduction
Total: 45 Hours
Textbook(s)
1. Behrouz A.Forouzan, Data Communication and Networking, Tata McGraw-Hill, 2009
Reference(s)
1. James F.Kurose and Keith W.Ross, Computer Networking: A Top-Down Approach Featuring the Internet,
Pearson Education, 2005
2. Larry L.Peterson and Bruce S.Davie, Computer Networks, Elsevier, 2009
3. Andrew S.Tanenbaum, Computer Networks, Pearson Education, 2008
4. William Stallings, Data and Computer Communication, Pearson Education, 2007
5. Douglas E.Comer and M.S.Narayanan, Computer Networks and Internets, Pearson Education, 2008
11Z507 GRAPHICS AND MULTIMEDIA LABORATORY
0 0 3 1.5
Objective(s)
 To learn 2D and 3D animations.
 To implement translation and rotation algorithms.
 To design clipping algorithms
Program Outcome(s)
Skill Set
 Develop 2D and 3D animation
 Demonstrate the geometric transformations and clipping algorithms
107
Assessment Pattern
Bloom’s Taxonomy
(New Version)
Internal
Assessment
End Semester
Examination
Preparation
10
15
15
20
Record
Viva Voce
10
-
15
15
Total
50
50
Remember
1. Define setcolor function
2. What is the use of detectgraph?
3. Define pixel
4. List the functions of Circle.
5. What is resolution?
6. Name the functions of Ellipse.
Understand
1. Describe the steps in DDA line drawing algorithm.
2. Explain the steps in Bresenham's line drawing algorithm.
3. Classify the software standards
4. Explain the scan conversion
5. How color is used in the output screen?
Apply
1. Demonstrate the Line drawing Algorithms.
2. Implementation of Circle drawing Algorithm.
3. Describe the implementation of 2D and 3D transformations.
4. Design any movie with different effects using animation
Analyze / Evaluate
1. How to create simple shapes using graphics primitives?
2. How the 2D & 3D transformations are done on objects?
3. How to create 3D objects in a 2D transformational surface?
4. Compare various surface Detection Methods.
5. How virtual reality can be applied in any Applications?
Create
1. Develop a tic-tac-toe game in C program using the graphical functions.
2. Create an animation of bouncing ball, a man walking in the rain & car movement.
List of Experiments
Implement the following using C Language
1. Draw different shapes using DDA and Bresenham Line Drawing Algorithms.
2. Sketch a closed curve using Bresenham‘s circle and ellipse algorithms.
3. Apply two dimensional transformations on the different objects.
4. Eliminate the exterior lines using Cohen-Sutherland Line Clipping Algorithm.
5. Remove the exterior parts of the polygon using Sutherland-Hodgeman Polygon Clipping Algorithm.
6. Display an object present in Window to the user specified View port using 2D Conversion and visualize the
projection of 3D images.
7. Apply three dimensional transformations for various shapes.
8. Devise a routine to produce the animation effect using C Graphics for different objects.
9. Create shape tweening of an object and text.
10. Use various image painting tools in Adobe Photoshop.
a)
b)
c)
d)
Brush popup palette
Brushes palette
Pencil tool
Gradient and paint bucket tool
Design Experiments
Mini Project
Practical Schedule
S. No.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Total: 45 Hours
Experiments
Draw different shapes using DDA and Bresenham Line Drawing Algorithms.
Sketch a closed curve using Bresenham‘s circle and ellipse algorithms.
Apply two dimensional transformations on the different objects.
Eliminate the exterior lines using Cohen-Sutherland Line Clipping Algorithm.
Remove the exterior parts of the polygon using Sutherland-Hodgeman Polygon
Clipping Algorithm.
Display an object present in Window to the user specified View port using 2D
Conversion and visualize the projection of 3D images.
Apply three dimensional transformations for various shapes.
Devise a routine to produce the animation effect using C Graphics for different
objects.
Create shape tweening of an object and text.
Hours
6
6
6
3
Use various image painting tools in Adobe Photoshop.
a) Brush popup palette
b) Brushes palette
c) Pencil tool
d) Gradient and paint bucket tool
3
3
3
3
6
6
11Z508 MICROPROCESSORS AND MICROCONTROLLER LABORATORY
0 0 3 1.5
Objective(s)
 To understand the working of 85x86 microprocessors and 8051 microcontroller.
 To write and debug assembly language programs.
Program Outcome(s)
Skill Set
 Develop assembly language programs for microprocessors.
 Demonstrate the interfacing circuits with various peripheral devices.
Assessment Pattern
Bloom’s Taxonomy
Internal
End-semester
S. No
(New Version)
Assessment
Examination
1
Preparation
10
15
2
15
20
3
Record
10
Mini Project/Model Examination /
4
Viva-Voce
15
15
Total
50
50
Remember
1. Define microprocessor
2. What are machine and instruction cycles?
3. What are different gray and binary coded number systems?
4. What is the difference between packed and unpacked BCD numbers?
5. What is an interrupt?
108
109
6. What is the process of addition and subtraction of numbers in a microprocessor?
7. Why the operational codes are in hexadecimal system?
8. What are the different types of jump instructions in 8085 and 8086?
9. What are the main differences between microprocessor and microcontroller?
10. State the RAM organization of 8051.
11. State the significance of LOCK signal in 8086.
12. What are the functions of bus interface unit (BIU) in 8086?
13. What is clock frequency of 8086?
Understand
1. Explain the different instruction formats of 8085 microprocessor?
2. Recognize the interfacing circuits are connected with cross assembler.
3. Explain the different instruction formats of 8086 microprocessor?
4. Classify and explain the differences between near jump and far jump.
5. Explain the different instruction formats of 8051 microcontroller?
Apply
1. Write a program to convert a given 8-bit binary number into its Gray code equivalent.
2. Write a program to convert a given 8-bit binary number into its binary code equivalent.
Analyze
1. How will you multiply two given numbers in 8085 microprocessor?
2. How will you interface microprocessor to a stepper motor?
3. How do you estimated the time of execution of a program?
4. Write the formula to convert binary number to hexadecimal.
5. Compare the two key lockout and N-key rollover modes in 8279?
Evaluate
1.
2.
Write a program to change a sequence of sixteen 2-byte numbers from ascending to descending order.
The numbers are stored in the data segment. Store the new series at addresses starting from 6000H.Use
the LIFO property of the stack.
Evaluate the Hex codes for the following instructions, identify the opcodes and operands, and show
the order of entering the codes in memory.
a) STA 2050H
b) JNZ 2070H.
Create
1.
2.
Write a program for data transfer from memory block B1 to memory block B2 using 8085.
Specify the contents of the accumulator and the status of the CY flag when the
following instructions are executed.
MVI A, B7H
ORA A
RLC
List of experiments
1. 8085 – Arithmetic operations.
2. 8085-code conversion
3. 8085-matrix multiplication.
4. 8086-Arithmetic operations.
5. 8086 – String manipulation,
6. Interfacing with 8085/8086 – 8255, 8253,8279,8251
7. 8051-Arithmetic operations.
8. 8051 Microcontroller based experiments – Simple assembly language programs (cross assembler required)
9. 8051 Microcontroller based experiments – Simple control applications (cross assembler required)
10. Mini project
Total: 45 Hours
110
Practical schedule
Sl.No
1
2
3
4
5
6
7
8
9
10
Experiments
Hours
3
8085 – Arithmetic operations.
8085-code conversion
8085-matrix multiplication.
8086-Arithmetic operations.
8086 – String manipulation,
Interfacing with 8085/8086 – 8255, 8253,8279,8251
8051-Arithmetic operations.
8051 Microcontroller based experiments – Simple assembly language programs
(cross assembler required)
8051 Microcontroller based experiments – Simple control applications (cross
assembler required)
6
3
6
6
3
3
3
Mini project
6
6
11Z509 COMPUTER NETWORKS LABORATORY
0 0 3 1.5
Objective(s)
 To understand the overview of computer networks and data transmission.
 To understand the peer to peer communication application.
 To learn the socket programming to build a network application.
Program Outcome(s)
Skill Set
 Install and manage Windows, NetWare, and Linux/Unix server systems.
 Troubleshoot and repair network problems.
 Build a simple Web page/intranet.
Assessment Pattern:
Bloom’s Taxonomy
(New Version)
Preparation
Record
Viva Voce
10
15
10
End Semester
Examination
15
20
-
15
15
50
50
Internal Assessment
Total
Remember
1. What are the functions of different OSI layers?
2. What is meant by subnet?
3. What is meant by gateway?
4. What is an IP address?
5. What is MAC address?
6. Define Raw Socket
111
7. What is a fork command?
8. What is meant by port?
9. What are ephemeral port number and well known port numbers?
10. What is a socket?
11. What are the parameters of socket ()?
12. Reproduce bind (), listen (), accept (), connect (), send () and recv ().
13. What are system calls? Mention few of them.
14. What is IPC? Name three techniques.
15. What type of protocol is BGP?
16. What type of protocol is OSPF?
17. What is Distance Vector Routing?
18. What is three way handshake?
19. List the disadvantages of stop and wait protocol.
20. Define bridges.
21. Define switches.
22. What is a router?
23. What is routing?
24. What is the role of DNS?
25. What type of transport protocol is used for DNS?
Understand
1. Explain the CSMA/CD protocol with binary exponential back off algorithm used on internet.
2. Explain the DNS in terms of name space, resource record and name server.
3. Assume that a network can cover a distance of 5000 meters and the RTT is 100 sec of the network operates
at a speed of 20Mbps. What should be the minimum frame size to employ CSMA / CD?
4. Given three IP addresses are 32.46.7.3, 200.132.110.35 and 140.75.8.92. Find their classes, network
addresses, broadcast address and their subnet marks.
5. Draw the UDP header and explain its fields.
6. Explain the architecture of WWW as on client / server application.
7. Describe the various fields of TCP header.
Apply / Analyze / Evaluate
1. Differentiate between broadcast networks and point to point networks.
2. Compare OSI and TCP / IP reference models on form of their merits and demerits.
3. How can we compute the host part of an IP address? Give an example with the IP address of your computer
and its associated net mask.
4. Test the characteristics of an IP address.
5. Write a program to trace the port of a particular host.
6. Write a program to implement the daytime protocol.
7. Write a program to implement the echo client.
8. Demonstrate TCP/IP protocol.
9. Demonstrate UDP protocol.
10. Implement a chat server using TCP/IP protocol.
Create
1. Given the class C network of 204.15.5.0/24, subnet the network in order to create the network in figure with
the host requirements.
2.
Create a VPN to connect to branch office of the department. What would be the
preliminary requirement?
112
List of Experiments
1. Study of Color coding Jack RJ45 and do the following Cabling works in a network
a. Cable Crimping
b. Standard Cabling
c. Cross Cabling and
d. Establish a LAN connection using three systems using any topology.
2. Configure IP Address in a system in LAN (TCP/IP Configuration) and Implement the client server
communication using socket connection
3. Write a program for transferring a file between nodes in a network.
4. Perform Bit Stuffing and CRC computation.
5. By varying the no of frames, design the Sliding Window Protocol.
6. Simulation of ARP/RARP
7. Display the routing table for the nodes in a network using Distance Vector Routing (DVR) algorithm.
8. Find the minimum cost in the node to node communication by Open Shortest Path First (OSPF) protocol.
9. Write a program for downloading a file from HTTP server.
10. Develop a client that contacts a given DNS server to resolve a given host name.
Design Experiments
Total: 45 Hours
Practical Schedule
S.No
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Experiment
Study of Color coding Jack RJ45 and do the following Cabling works in a network
a. Cable Crimping
b. Standard Cabling
c. Cross Cabling and
d. Establish a LAN connection using three systems using any topology.
Configure IP Address in a system in LAN (TCP/IP Configuration) and Implement the client
server communication using socket connection
Write a program for transferring a file between nodes in a network.
Perform Bit Stuffing and CRC computation.
By varying the no of frames, design the Sliding Window Protocol.
Simulation of ARP/RARP
Display the routing table for the nodes in a network using Distance Vector Routing (DVR)
algorithm.
Find the minimum cost in the node to node communication by Open Shortest Path First
(OSPF) protocol.
Write a program for downloading a file from HTTP server.
Develop a client that contacts a given DNS server to resolve a given host name.
Hours
3
3
6
3
6
6
3
6
3
6
11Z510 TECHNICAL SEMINAR - I
- - - 1.0
11Z601 WEB TECHNOLOGY
3 0 0 3.0
Objective(s)
 To study the scripting languages - XHTML, XML Java Script and PHP.
 To understand the server technologies.
 To understand the web services.
Program Outcome(s)
113
Course Outcome(s)
 Develop web based applications.
 Demonstrate the basics of web services.
 Demonstrate database connectivity.
Assessment Pattern
S.No Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
10
10
10
10
2
Understand
20
20
20
20
3
Apply
20
20
20
20
4
Analyze
20
10
10
10
5
Evaluate
10
10
10
10
6
Create
20
30
30
30
Total
100
100
100
100
Remember
1. What is XHTML?
2. What are the differences between XML and HTML?
3. What is XHTML Validation?
4. How to create XHTML pages?
5. What are the advantages of XHTML?
6. State XHTML DTD?
7. How to convert most HTML pages to XHTML?
8. What is an XHTML element attribute?
9. What is the latest XHTML specification?
10. How to enter element content?
11. How to close an XHTML element?
12. What is the relation between XHTML and SGML?
13. What is the relation between XHTML and HTTP?
Understand
Identify and correct the errors in the following JavaScript code
var x=1, total;
while (x <=10)
{
Total += x;
++x;
}
1. Describe session tracking in ASP.
2. Discuss the overview of XHTML and tools for creating XHTML document.
3. Discuss syntactic different between HTML and XHTML
Apply
1.
2.
3.

Write a JavaScript for the following statements.
1. Declare variables sum and x
2. Assign 1 to variable x
Write a CSS that makes all text 1.5 times larger than the base font and color is red.
Write PHP script to count the number of visitors and display it on webpage every time it is loaded.
114
Analyze / Evaluate
1. Compare HTML, DHTML and XHTML.
2. Discriminate the overview of JavaScript and PHP.
Create
1. Create an XHTML document using tags <p>, <strong>, <img>, hyperlink and <hr>
2. Build a web form that displays data from a database.
Unit I
Introduction to XHTML and XML
Introduction – Editing XHTML – Headings – Linking - Images - Special characters and Horizon rules - Lists –
Tables - Forms – Internal Linking- Meta Elements –Cascading Style Sheets – Introduction to XML – Structuring
data – XML Namespaces – DTD – XML Name schema documents – XML Vocabularies – Extensible stylesheet
language and XSL Transformations – DOM.
9 Hours
XML and E-Commerce
Unit II
JavaScript
Introduction to scripting – Control statements I, II – Functions: Definition – Random Number Generation – Global
function – Recursion – Arrays: Declaring and allocating arrays – Multidimensional arrays – Objects : Math object –
String object – Date object – Boolean, Number object – Document object –Window object - Events.
9 Hours
JavaScript Example
Unit III
Internet Application Server Technologies
Web server (IIS and Apache): Multitier Architecture – Client/ Server side scripting – Accessing web services –
Microsoft IIS – Apache HTTP server – Database: Relational database - SQL – PHP: Basics – String and Form
Processing – connecting to database – Ruby on Rails – Rail framework – Database driven web application.
9 Hours
Introduction to MySQL
Unit IV
ASP .Net
Introduction – creating and running a simple web form - Web controls – session tracking - case study: Connecting to
a database in ASP.NET – ASP.NET Ajax.
9 Hours
Case study: Secure books database application
Unit V
Web Services
Introduction – Java web services Basics – Creating Publishing, Testing and describing web service – Consuming web
service – SOAP – Session Tracking in web services – Consuming a Database driven web service from a web
application – Passing an object of a User defined type to a web service
9 Hours
REST – Based web services in ASP .Net
Total: 45 Hours
Textbook(s)
P.J. Deitel AND H.M. Deitel, Internet and World Wide Web – How to Program, Pearson Education, 2009
Reference(s)
1. Deitel, Deitel and Nieto, Internet and World Wide Web – How to Program, Pearson Education, 2002
2. Uttam K.Roy, Web Technologies,Oxford University Press, 2010
3. Rajkamal, Web Technology, Tata McGraw-Hill, 2009
115
11Z602 COMPILER DESIGN
3 1 0 3.5
Objective(s)
 To understand, design and implement a lexical analyzer.
 To understand, design and implement a parser.
 To understand, design code generation schemes.
 To understand optimization of codes and runtime environment.
Program Outcome(s)
research.
c)
Course Outcome(s)
 Design lexical and syntax analysis phases of complier.
 Demonstrate the basic notions and techniques for programming language translation
 Demonstrate the basic notions and techniques for intermediate code generation.
Assessment Pattern
S.No
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
20
20
20
20
2
Understand
30
20
20
20
3
Apply
20
30
30
30
4
Analyze/Evaluate
20
20
20
20
5
Create
10
10
10
10
Total
100
100
100
100
Remember
1. What is compiler?
2. List down the parts of Compiler
3. What is the role of the parser?
4. What are the different types of parsers?
5. What is a silicon compiler?
6. Define Rational Preprocessors
7. What is Loader?
8. What is DAG?
9. Define function preserving transformation
10. Define Handle pruning

116
Understand
1. Explain the phases of a compiler
2. Summarize compiler construction tools.
3. Describe Predictive parser.
4. Convert the regular expression (a|b)*abb into DFA.
5. Outline the cousins of compiler.
6. Explain different types of three address code implementation.
Apply
1. Consider the grammar
A  aBcC
A  aBb
A aB A a, A
Find the FIRST() and FOLLOW()
S(L)|a
LL,S|S
Find parse tree for the (a, (a, a))
3. Consider a grammar
S  cAd
A  ab | a
Construct the recursive decent parser for the word ‗cad‘
4. Consider the following grammar
E E+T|T
TTF|F
F  F* | a
Construct the SLR Parsing table for the grammar
5. Construct the Canonical LR Parser for the following grammar
S  CC
C  cC
Cd
6. Construct a DAG for the expression a * (b-c) + (b-c) / d
Analyze / Evaluate
1. Show that the grammar
S(L)|a
L  L , S | S is LL(1)
2. Differentiate Phase and Pass.
3. Distinguish NFA and DFA.
Create
1. Construct minimum state DFA for the regular expression (a*|b*)*
2. Construct NFA for the following regular expression (a|b)*abb(a|b)*
3. Create DFA using direct method for the regular expression ((|a)b*)*
Unit I
Introduction to Compiler
Compilers – Analysis of the source program – Phases of a compiler – Cousins of the Compiler – Grouping of Phases
– Compiler construction tools – Lexical Analysis – Role of Lexical Analyzer – Input Buffering.
9 Hours
Symbol tables
Unit II
Lexical Analysis
Specification and Recognition of Tokens -Finite automata - Regular expression to finite automation- LEX Implementation of lexical analyzer using LEX-Optimization of DFA based Pattern Matchers.
9 Hours
State minimization in lexical analyzers
117
Unit III
Syntax Analysis
Role of the parser –Writing Grammars –Context-Free Grammars –Top Down parsing – Recursive Descent Parsing –
Predictive Parsing – Bottom-up parsing – Shift Reduce Parsing – Operator Precedent Parsing – LR Parsers – SLR
Parser – Canonical LR Parser – LALR Parser.
9 Hours
Parser generator –YACC
Unit IV
Intermediate Code Generation
Intermediate languages – Declarations – Assignment Statements – Boolean Expressions – Case Statements – Back
patching – Procedure calls.
9 Hours
Syntax-directed definitions
Unit V
Code Generation & Code Optimization
Issues in the design of code generator – The target machine – Runtime Storage management – Basic Blocks and Flow
Graphs – Next-use Information – A simple code generator – Principal Sources of Optimization – Optimization of
basic Blocks – Loops in flow graphs.
9 Hours
Peephole optimization
Total: 45+15 Hours
Textbook(s)
Alfred Aho, Ravi Sethi and Jeffrey D Ullman, Compilers Principles, Techniques and Tools, Pearson
Education Asia, 2008
Reference(s)
1. Allen I. Holub, Compiler Design in C, Prentice Hall of India, 2003
2. C. N. Fischer and R. J. LeBlanc, Crafting a compiler with C, Benjamin Cummings, 2003
3. J.P. Bennet, Introduction to Compiler Techniques, Tata McGraw-Hill, 2003
4. Henk Alblas and Albert Nymeyer, Practice and Principles of Compiler Building with C, PHI, 2001
5. Kenneth C. Louden, Compiler Construction: Principles and Practice, Thompson Learning, 2003
11Z603 DIGITAL IMAGE PROCESSING
3 0 0 3.0
Objective(s)
 To study the image fundamentals and mathematical transforms.
 To study the image enhancement techniques.
 To learn about image compression techniques.
Program Outcome(s)
c)
Course Outcome(s)
 Specify the properties of the Image Transforms.
 Design and implement various filtering techniques.
 Determine the convolution and morphological operations.
118
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze/Evaluate
Create
Total
Test I
Test II
20
30
20
20
10
100
20
30
20
20
10
100
Model
Examination
20
30
20
20
10
100
End-Semester
Examination
20
30
20
20
10
100
Remember
1. Define Image
2. List various morphological operations.
3. What is color model?
4. List the hardware oriented color models.
5. Give the applications of color models.
6. Specify the elements of DIP system.
7. Define weber ratio
8. Name the types of derivative filters.
9. Identify the properties of two-dimensional Discrete Fourier Transform.
10. State one dimensional convolution theorem.
11. What are the properties of Haar transform?
12. Define histogram.
13. Give the mask used for high boost filtering.
Understand
1. Explain the categories of digital storage.
2. Explain the types of connectivity.
3. Explain separability property in two Dimensional Fourier transform.
4. Explain the categories of image enhancement.
5. Explain homogeneity property in Linear Operator.
6. Outline the various image representation approaches.
7. Summarize the measures used in region descriptors.
Analyze
1. Classify data compression techniques.
2. Derive the relation for one dimensional discrete wavelet transform.
3. Derive the formula for correlation of 1D continuous function.
4. Derive the relation for one dimensional DCT.
5. Differentiate photopic and scotopic vision.
6. Differentiate linear spatial filter and non-linear spatial filter.
7. Give the difference between Enhancement and Restoration.
Evaluate
1. Find the number of bits required to store a 256 X 256 image with 32 gray levels?
2. Determine whether the system described by the following input-output relation is linear or not.
y (n1,n2)=nx(n1,n2)
Create
1. Read an image and perform histogram equalization of the input image and analyze the result.
2. Read a grayscale image and convert it into a binary image using hard thresholding. Make the threshold value
as a user-defined parameter. Vary the threshold and observe the result.

3.
4.
5.
6.
119
Write the steps involved in frequency domain filtering.
Write the expression to find the number of bits to store a digital image.
Write an equation for singular value decomposition of an image.
Write the formula for negative and log transformation.
Unit I
Digital Image Fundamentals
Introduction –origins- fundamental steps in digital image processing – components of an image processing – elements
of visual perception – Image sensing and acquisition – image sampling and quantization – Relationships between
pixels – mathematical tools in digital image processing
9 Hours
Examples of Fields that uses Digital Image Processing
Unit II
Image Enhancement
Intensity Transformation Functions – Histogram processing – spatial filtering – Smoothing spatial filtering: linear and
nonlinear filters – sharpening spatial filtering: Laplacian- Unsharp Masking.
9 Hours
Combining Spatial Enhancement Methods
Unit III
Image Restoration
Image Degradation/ Restoration Process – Noise Models – Mean filters – order statistic filters- adaptive filters – noise
reduction by frequency domain filtering – Linear, position - Invariant degradations – Estimating degradation function
– Inverse filtering – wiener filtering –Constrained least squares filtering – Geometric mean filter.
9 Hours
Color Transformations
Unit IV
Image Segmentation
Fundamentals – Point Detection – Line Detection – Edge Detection – Thresholding – region Based segmentation:
Region Growing – Region Splitting and Merging – Morphological watershed segmentation.
9 Hours
The use of Motion in Segmentation
Unit V
Image Representation and Description
Boundary Following - chain codes – Polygonal Approximations using Minimum Perimeter Polygons – other
Polygonal Approximation Approaches – Signatures – Boundary Segments – Skeletons - Boundary descriptors –
Regional Descriptors – Principal components for Description – Relational Descriptors.
9 Hours
Recognition Based on Decision Theoretic Methods
Total: 45 Hours
Textbook(s)
Rafael C Gonzalez, Richard E Woods, Digital Image Processing, 3rd Edition, Pearson Education, 2009
Reference(s)
1.
2.
3.
4.
William K Pratt, Digital Image Processing, John Willey, 2007
Milan Sonka, Vaclav Hlavac, Roger Boyle, Image Processing Analysis and Machine Vision, Thompson
Learning, 2008
S.Jayaraman, S.Esakkirajan and T.Veerakumar, Digital Image Processing, Tata McGraw Hill Education
Private Limited, 2009
Bhabatosh Chanda, D. Dutta Majumder, Digital Image Processing and Analysis, Prentice Hall of India,
2011
120
11Z604 .NET TECHNOLOGIES
3 0 1 3.5
Objective(s)
 To impart the fundamental concepts of C# and .NET
 To learn to create and populate windows forms.
 To use .NET components in a windows forms application.
 To incorporate accessibility features to a Windows forms application.
Program Outcome(s)
computing works under given constraints
think creatively and communicate effectively
Course Outcome(s)

Solve the basic design problems using object and classes in C#.

Demonstrate the concepts of OOPs.

Design application programs using .Net Components.
Assessment Pattern
S.No
Bloom’s Taxonomy
Model
Test I
Test II
(New Version)
Examination
1
Remember
20
20
20
2
Understand
20
20
20
3
Apply
30
30
30
4
Analyze/Evaluate
20
20
20
5
Create
10
10
10
Total
100
100
100
Remember
1. What is .NET framework?
2. What is an alias?
3. Define numeric formatting.
4. Give two example of typical use of enum type values.
5. What is nesting of structures?
Understand
1. Describe the benefits of delegates.
2. Identify the steps required to creating window forms.
3. What is the use of inclusion polymorphism?
End-Semester
Examination
20
20
30
20
10
100
Apply
1. Develop a method to accept a number and return its cube using object and classes.
2. Write a program to compute Nth term in the Fibonacci sequence using interface.
Analyze / Evaluate
1. Write a Program to demonstrate multicast delegates with events.
2. How does C# differ from C++?
3. Compare private constructors and copy constructors.
Create
1. Create console based application using two classes.
2. Write a windows application in C# for emulating very basic calculator operations.
3. Create a program to retrieving environment information using ADO.NET.

121
Unit I
Basics of C# and .NET
Introducing C#: The .NET Framework - Language Style - Basic Programming Techniques: Simple C# Program Namespaces and Types - Comments - Variables - Expressions - Flow Control - Iteration Statements - Methods Abstracting Ideas with Classes and Structs: Divide and Conquer - Defining Classes - Constructors - Overloading.
Static Constructors
9 Hours
Unit II
C# and OOPS
Extensibility and Polymorphism: Replacing Methods - Inheritance -Interfaces - Delegates: Functional Composition Generic Actions and Predicates - Lambda Expressions - Properties – Notifying Clients with Events - Dealing with
Errors - Arrays.
9 Hours
Boxing and Unboxing
Unit III
Collection Classes and Files & Streams
Collection Classes - String: Formatting Data Output - Composing Strings - Manipulating Text - Encoding Characters
- Files and Streams: Manipulating File Path - I/O Files - Streams - Stream Buffers.
Asynchronous File Operations
9 Hours
Unit IV
Networking and Database
Networking: Network Technology - Windows Communication Foundation - Databases: The .NET Data Access Entity Data Model - Queries - Object Context - Attributes and Reflection.
9 Hours
WFC Data Services
Unit IV
Web Programming and Windows Forms
Windows Presentation Foundation and Silverlight: Xaml and Objects - Elements and Controls - Control Templates Data Binding - Programming ASP.NET - Windows Forms: Creating and Controls.
9 Hours
Data Templates
Total: 45 +15 Hours
Textbook(s)
Jesse Liberty, Programming C# 4.0, O‘Reilly Publications, 2010
Reference(s)
1. Herbert Schildt, C# 4.0: Complete Reference, Tata McGraw Hill, 2010
2. E.Balagurusamy, Programming in C#, Tata McGraw Hill, 2010
3. Ben Albahari and Joseph Albahari, C#, O‘Reilly Publications, 2010
11Z605 CRYPTOGRAPHY AND NETWORK SECURITY
3 1 0 3.5
Objective(s)
 To know the principles and methods of conventional and advanced encryption algorithms.
 To learn the techniques used for message authentication and confidentiality maintenance.
 To understand the network security tools and applications.
122
Course Outcome(s)
 Demonstrate the functionalities of Network Security Application.
 Analyze and implement the cryptographic algorithms and protocols.
 Demonstrate the concepts of public key cryptosystems.
 Design algorithms for Internet security.
Assessment Pattern
S.No
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
10
10
10
10
2
Understand
20
20
20
20
3
Apply
20
20
20
20
4
Analyze/Evaluate
40
40
40
40
5
Create
10
10
10
10
Total
100
100
100
100
Remember
1. Define cipher text
2. What are the essential ingredients of a symmetric cipher?
3. What are the two basic functions used in encryption algorithms?
4. What is the difference between a block cipher and a stream cipher?
5. When an encryption algorithm is said to be computationally secure?
6. Define Caesar cipher
7. What is the difference between differential and linear cryptanalysis?
8. What is traffic padding?
9. State fermat‘ s theorem.
10. Specify the application of public key cryptography.
11. What is message authentication?
12. Differentiate MAC and Hash function
13. Define Kerberos
14. What are the services provided by PGP?
15. Define key Identifier
16. Define S/MIME
17. Name the elements of MIME?
Understand
1. How many keys are required for two people to communicate via a cipher?
2. What are the two approaches of attacking a cipher?
3. Mention the importance of feistel cipher?
4. Why is it not practical to use an arbitrary reversible substitution cipher?
5. How many bytes in State are affected by Shift Rows?
6. Why is it not desirable to reuse a stream cipher key?
7. List ways in which secret keys can be distributed to two communicating parties.
8. Differentiate public key encryption and conventional encryption.
Apply
1. Determine the gcd(24140,16762) using Euclid‘s algorithm.

123
2.
3.
Perform encryption and decryption using RSA algorithm. For the following.P=7; q=11; e=17; M=8.
User A & B exchange the key using Diffie-Hellman algorithm. Assume a=5 q=11 XA=2 XB=3.
Find YA, YB, K
4. List the evaluation criteria defined by NIST for AES.
5. Show that if K>0, then GCD (ka,kb)=K GCD (a,b)
Analyze / Evaluate
1. Apply the MAC on the cryptographic checksum method to authenticate build confidentiality of the message
where the authentication is tied to message .M=8376, K1=4892, K2=53624071.
2. Perform encryption/decryption using RSA algorithm for the following: p=3, q=11, e=7, m=5.
3. Given the key "MONARCHY" apply play fair to pain text "FACTIONALISM" to ensure confidentially at
the destination, decrypt the cipher text and establish authenticity.
Create
1. Construct firewall mechanism for ensuring the protection of nodes in IP based Environment.
Unit I
Introduction
Computer Security Concepts - OSI Security Architecture - Security Attacks – Services – Mechanisms - Model for
Network Security - Classical Encryption Techniques - Symmetric Cipher Model - Substitution - Transposition
Techniques - Basic Concepts in Number Theory and Finite Fields - Divisibility and Division Algorithm - Euclidean
Algorithm - Modular Arithmetic - Polynomial Arithmetic.
9 Hours
Digital Watermarking and Steganography
Unit II
Symmetric Ciphers
Block Cipher Principles - Data Encryption Standard (DES) - DES Example - Strength of DES - Differential and
Linear Cryptanalysis - Block Cipher Design Principles - Advanced Encryption Standard(AES) – Structure - Round
Functions - Key Expansion - AES Example - Pseudorandom Number Generation and Stream Ciphers - RC4.
9 Hours
International Data Encryption Algorithm (IDEA)
Unit III
Asymmetric Ciphers & Key Management
Prime Numbers - Fermat's and Euler's Theorems - Testing for Primality - Discrete Logarithms - Public-Key
Cryptography and RSA - Diffie-Hellman Key Exchange - Key Management and Distribution - Symmetric Key
Distribution Using Asymmetric Encryption - Distribution of Public Keys - X.509 Certificates - Public Key
Infrastructure.
9 Hours
Chinese reminder theorem
Unit IV
Cryptographic Data Integrity Algorithms
Cryptographic Hash Functions - Applications - Two Simple Hash Functions - Requirements and Security Hash
Functions based on Cipher Block Chaining - Secure Hash Algorithm (SHA) - SHA-3 - Message Authentication
Codes - Requirements – Functions - Security of MACs - MACs based on Hash Functions: HMAC - Digital
Signatures - Digital Signature Standard (DSS) - Kerberos.
9 Hours
Electronic Commerce Security
Unit V
Network and Internet Security
Transport Level Security - Web Security Issues - Secure Sockets Layer (SSL) - Transport Layer Security (TLS)HTTPS - Secure Shell (SSH) - Electronic Mail Security - Pretty Good Privacy (PGP) - S/MIME - IP Security Firewalls.
9 Hours
Viruses and worms
Total: 45 +15 Hours
124
Textbook(s)
William Stallings, Cryptography and Network security Principles and Practices, 5th edition, Pearson
Education, 2010
Reference(s)
1. William Stallings, Network security essentials – application and standards, Prentice Hall of India , 2010
2. Charles P.Fleeger, Shari Lawrence P.Fleeger, Security in computing, Prentice Hall of India, 2009
3. W. Mao, Modern Cryptography – Theory and Practice, Pearson Education, 2007
4. Wade Trappe, Lawrence C Washington, Introduction to Cryptography with coding theory, Pearson
Education, 2007
11Z607 WEB TECHNOLOGY LABORATORY
0 0 3 1.5
Objective(s)
 To provide an opportunity to practice various Scripts like HTML, XML and JavaScript.
 To design the Web application using CSS and Built in functions.
 To enable the students to work with server side programming using Servlets.
Program Outcome(s)
Skill Set
 Develop XHTML, XML, Java Script and PHP.
 Develop web applications.
 Demonstrate database connectivity.
Assessment Pattern
Bloom’s Taxonomy
Internal
End-semester
(New Version)
Assessment
Examination
Preparation
10
15
15
20
Record
10
MiniProject
/
Model
15
15
Examination / Viva Voce
50
50
RememberTotal
1. What is Hyper Text Markup Language?
2. Define extensible HTML
3. What is Dynamic HTML?
4. What is style sheet?
5. List the different types of style sheets.
6. What is Java Script?
7. Give the difference between HTML and XHTML
8. Define client side scripting
9. What is server side scripting?
Understand
1. How to develop a web page?
2. Classify the different filters and transitions.
3. Compare relative URL and absolute URL.
4. How to validate the form using scripting?
5. Describe the implementation of the filter and transition effects.
6. How does java script useful in web page creation?
7. How will you use cookies in server side programming?
Apply
1.
2.
3.
4.
125
Describe the usage of input tags used in a XHTML form with example.
Demonstrate the XHTML tags used for formatting text and Table.
Design XML to maintain Library information.
Find the error with the following, while repetition structure in JavaScript code.
While (z>=0)
Sum += z;
Analyze / Evaluate
1. Differentiate application server and web server.
2. Criticize a servlet program to open a Text file for reading it from the client side.
3. Evaluate the administration of IIS.
4. Compare HTML and XML
5. Distinguish the difference between JDBC and ODBC.
Create
1. Develop a mini project for any web application.
2. Design a XHTML document by connecting with Database.
List of Programs
1. Develop the XHTML document using Text styling, Linking, Images, Lists, Table.
2. Create an XHTML document that has a form with text box, Radio Button, Selection box, Checkbox,
Submit and reset buttons
3. Implement Cascading Style Sheets using XHTML document.
4. Write JavaScript for control statements
5. Generate JavaScript for arrays and functions
6. Create and save an XML document at the server, which contains 10 users information. Write a program
which takes User Id as input and returns the user details by taking the user information from the XML
document.
7. Write AJAX program
a. Displaying text file
b. XML file
8. Program with ASP .net by connecting with SQL
a. Create login form to enter into website
b. Building web form that displays data from a database
9. Process XHTML Forms using PHP program by GET and POST methods
10. Creating, Publishing, Testing and describing a web service.
Total: 45 Hours
Practical Schedule
S.No
Experiment
Hours
1. Develop the XHTML document using Text styling, Linking, Images, Lists, Table.
2. Create an XHTML document that has a form with text box, Radio Button, Selection box, Checkbox,
Submit and reset buttons
3. Implement Cascading Style Sheets using XHTML document.
4. Write JavaScript for control statements
5. Generate JavaScript for arrays and functions
6. Create and save an XML document at the server, which contains 10 users information. Write a
program which takes User Id as input and returns the user details by taking the user information from
the XML document.
7. Write AJAX program
a. Displaying text file
b. XML file
8. Program with ASP .net by connecting with SQL
a. Create login form to enter into website
b. Building web form that displays data from a database
9. Process XHTML Forms using PHP program by GET and POST methods
6
3
10. Creating, Publishing, Testing and describing a web service.
6
3
3
3
3
3
6
3
126
11Z608 COMPILER DESIGN LABORATORY
0 0 3 1.5
Objective(s)
 To understand, design and implement a lexical analyzer.
 To understand, design and implement a parser.
 To understand and design code generation schemes.
Program Outcome(s)
Skill Set
 Design lexical and syntax analysis phases of complier.
 Demonstrate the basic notions and techniques for programming language translation
 Demonstrate the basic notions and techniques for intermediate code generation.
Assessment Pattern
Bloom’s Taxonomy
Internal
End Semester
(New Version)
assessment
Examination
Preparation
10
15
15
20
Record
10
Mini –Project/Model
15
15
Total
50
50
Remember
1. What is DAG?
2. Define Tokens, Pattern and Lexemes.
3. What is a method to build a lexical analyzer?
4. What is the purpose of attributes for tokens?
5. Write the different approaches to the implementation of lexical analyzer
6. Write the different intermediate code representations
Understand
1. Explain the phases of a compiler
2. Summarize compiler construction tools
3. Convert the regular expression (a|b)*abb into DFA.
4. Outline the cousins of compiler
Apply
A  aBcC
A  aBb
A aB A a, A
Find the FIRST() and FOLLOW()
2. Consider the following grammar
E E+T|T
T  T *F | F
F  (E) | id
Construct the Predictive parser table for the grammar
3. Construct the Canonical LR Parser for the following grammar
S  CC
C  cC
Cd
4. Construct a DAG for the expression a * (b-c) + (b-c) / d
5. Translate the expression –(a+b) * (c+d) into quadruples
127
Analyze/Evaluate
1. Show that the grammar
S(L)|a
L  L , S | S is LL(1)
2. Show that the following grammar
S  Aa | bAc | Bc | bBa
Ad
B  d is Canonical LR(1).
3. Compare SLR, CLR and LALR parsers
Create
1. Construct minimum state DFA for the regular expression (a*|b*)*
2. Construct NFA for the following regular expression (a|b)*abb(a|b)*
3. Create DFA using direct method for the regular expression ((|a)b*)*
List of Experiments
1. Implementation of Simple Lex and Yacc programs
2. Implementation of Lexical Analyzer using C
3. Finding the FIRST and FOLLOW of the non-terminals in a grammar
4. Construction of Top-Down Predictive Parsing Table for a grammar
5. Show the execution of Shift Reduce Parsing Algorithm for an input
6. Identify the leading and trailing symbols of non-terminals in an operator grammar
7. Construct the precedence relationship table of an arithmetic expression using operator precedence algorithm
8. Generation of Intermediate Code for an expression
9. Construction of DAG representation for an expression
Design Experiments
Mini Project
Total: 45 Hours
Practical Schedule
SI.No
Experiment
Hours
1. Implementation of Simple Lex and Yacc programs
3
2.
3.
4.
5.
10.
6.
11.
7.
12.
8.
13.
9.
10.
Implementation of Lexical Analyzer using C
Finding the FIRST and FOLLOW of the non-terminals in a grammar
Construction of Top-Down Predictive Parsing Table for a grammar
Show the execution of Shift Reduce Parsing Algorithm for an input
Identify the leading and trailing symbols of non-terminals in an operator
grammar
Construct the precedence relationship table of an arithmetic expression
using operator precedence algorithm
Generation of Intermediate Code for an expression
Construction of DAG representation for an expression
Mini project
6
3
3
6
3
6
6
3
6
11Z609 TECHNICAL SEMINAR - II
- - - 1.0
11O701 ENGINEERING ECONOMICS
3 0 0 3
Objective(s)
 To understand the basics of Micro and Macro Economics.
 To understand the methods by which Demand Forecasting, Cost Analysis, Pricing and Financial Accounting
are done in the Industry.
128
a) Demonstrate an ability to engage in life-long learning.
b) Function ethically and responsibly, and to remain informed and involved as full participants in our
Course Outcome(s)s
 Costing of products and services.
 Market Analysis.
Assessment pattern
S.
No.
Bloom’s Taxonomy
(New Version)
Test I
Test II†
Model
Examination†
End Semester
Examination
1
2
3
4
5
Remember
Understand
Apply
Analyze/ Evaluate
Create
Total
20
30
20
20
10
100
20
30
20
20
10
100
20
30
20
20
10
100
20
30
20
20
10
100
†
Remember
1. Define Economics
2. Define Managerial Economics
3. What are the branches of Economics?
4. What are the two methodologies used for Investigation in Economics?
5. Name the other disciplines which are linked to Managerial Economics.
6. List the theories that explain the basic Objective(s) of a firm.
7. What are the basic concepts in Decision making?
8. What are the types of decisions a manager is expected to make?
9. What are the techniques used in the process of decision making?
10. What is opportunity cost?
11. What is Demand?
12. What are the types of Demand?
13. What are the variations in the nature of Demand?
14. State the law of Demand.
15. What are the factors determining Demand?
16. Define Elasticity of Demand.
17. State the different degrees of elasticity of Demand?
18. What are the factors determining Elasticity of Demand?
19. State the Law Of Diminishing Marginal Utility.
20. What is Consumer Equilibrium?
21. List the factors effecting Demand Forecasting.
22. What methods will you use for forecasting demand for a new product?
23. Define Cost.
24. What is a semi variable cost?
25. What are fixed costs?
26. Define Short Run and Long Run costs.
27. Define Optimum Size of a Firm.
28. Define Replacement Cost and Historic Cost.
†
50 marks
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44.
What is a Monopoly?
What is an Oligopoly?
What is Price Discrimination?
What are the reasons for Price Discrimination?
What are the advantages of Price Discrimination?
Define Oligopoly in terms of market share.
Name the two types of Oligopoly.
What are the Objective(s) of Pricing?
What are the two basic methods of Pricing?
What is Market Skimming?
What is sealed bid pricing?
Define Accounting.
What are the uses of accounting?
What is a Balance Sheet?
Definitions of key words used in Financial Statements.
What is inflation?
Understand
1. Explain the nature and scope of Economics.
2. Differentiate between Macro and Micro economics
3. List and explain the focus areas of Managerial economics.
4. Give reasons why Mangers aim to Maximize Sales even at the cost of a lower profit.
5. Explain the steps in the decision making process.
6. Differentiate between Mechanistic and Analytical Decision making with examples.
7. Explain Giffens Paradox.
8. Explain with examples, exceptions to the Law of Demand.
9. Explain the nature of Demand.
10. Differentiate between Extension and Increase in Demand.
11. What is the significance of Elasticity of Demand?
12. Differentiate between Point and Arc Elasticity of Demand.
13. What are the assumptions made when talking about the Law of Diminishing Marginal Utility?
14. Explain the characteristics of the Indifference Curve with examples.
15. Explain the concepts of consumer‘s equilibrium and consumers‘ surplus with examples.
16. Can Demand Forecasting principles be applied to Services? Substantiate your answer with an example.
17. What is the difference between Accounting Cost and Economic Cost? Explain with an example.
18. Match the following type of question between Cost Concepts and their Basis of Distinction
19. Why is a study of Cost-Output Relationship necessary for a good Manager?
20. How is Incremental cost different from Sunk Cost?
21. Differentiate between Monopoly and Monopolistic Competition.
22. Explain the concept of a Perfect Market and its features.
23. Explain Total Revenue, Average Revenue and Marginal Revenue.
24. Distinguish between Cost and Price.
25. Explain with an appropriate diagram, the mechanism of pricing in a Perfectly Competitive Market.
26. Explain the role of Time in price determination.
27. Under what conditions can a firm charge different prices for the same products?
28. What are the characteristic features of an oligopoly industry ?
29. What causes Oligopoly?
30. Why does a firm need to have a Pricing Policy?
31. Explain the types and features of Cost Based Pricing.
32. Explain the types and features of Demand Based Pricing.
33. Explain the types and features of Strategy Based Pricing.
34. Under what conditions does a company go in for Cross Subsidization pricing?
35. Explain the Business Entity concept.
36. What are the advantages of Double-entry Book-keeping?
37. What is the role of the Central bank in controlling inflation?
129
130
Apply
1.
2.
3.
4.
5.
6.
Compare the merits and demerits of the Deductive Method and the Inductive Method of Investigation.
Explain decisions based on the degree of certainty of the outcome with examples.
Problems involving Marginal and Incremental Costs.
Problems concerning Elasticity of Demand.
Problems using statistical methods for Demand Forecasting.
Problem – Calculate and plot Average Variable Cost, Average Total Cost, Marginal Cost and find the
optimal production volume.
7. Give examples of products falling under the various kinds of Competition, and the reasons they are able to
survive in the market.
8. Give six examples of products that fall under Monopolistic Competitive pricing.
9. Give six examples of products that fall under Oligopolistic pricing.
10. Pick any six Consumer Items and based on your knowledge of the markets, explain the pricing method that
you think is most likely to have been followed for each of these items.
11. Compare the types of information that one can derive from a Balance Sheet and a P&L Statement.
Analyze
1. ―The per-capita income of farmers in the country has to be raised by 20% this year to prevent their migration
to cities‖. Analyze this statement from the point of view of Positive and Normative Economics.
2. Decision making improves with age and experience. Discuss.
3. Do a survey of the automotive (only cars) industry and analyze the reasons and timing for discounts offered
from the point of view of elasticity of demand.
4. What are the methods you would adopt to forecast demand for an industrial product? Assuming that the
actual demand versus forecast is very high, what would the most likely reason be for failure of the forecast?
5. ―Most of the cost concepts are overlapping and repetitive‖. Yes or No? Substantiate your answer with
reasons.
6. How would you modify a sealed bid pricing system to take care of different technical approaches by
different bidders for a project for which bids are called for, given that the cost varies depending on the
technical approach?
7. What are the steps you would take to control inflation?
Create
1. Create a matrix consolidating the definitions of the word ―Economics‖ as defined by the leading Economists
in the prescribed Textbook(s). Using this define economics the way you understand it, in less than 50
words.
2. Study the price of a commodity over a period of one year and explain the possible reasons for the
fluctuations from an economist‘s point of view.
3. You are in a job which is paying you adequately. You are called for an interview for a job that double your
salary. Unfortunately you miss the only train that will take you in time for the interview. How will you
justify the cost of taking a flight considering the cost concepts you have learnt.
4. Due to cancellation of an export order, you are stuck with a huge stock of jeans of international quality.
Device a pricing strategy for disposing this stock without incurring a loss, considering that it is a very
competitive market.
(Question paper will contain at least 50% marks on numerical problems)
Unit I
Introduction
Introduction to Economics, Kinds of Economic Systems, Production Possibility Frontier, Opportunity Cost, Objective
of Organizations, Kinds of Organizations, Business Decision Making,
Legal rights and responsibilities of types of Organizations.
9 Hours
Unit II
Demand and Supply
Functions of Demand & Supply, Law of Demand and Supply, Elasticity of Demand, Demand Forecasting Methods,
Price Equilibrium
Role of logistics in managing supply and demand.
9 Hours
131
Unit III
Production and Cost
Production Function, Returns to Scale, Economies & Diseconomies of scale, Fixed Cost, Variable Cost, Average
Costs, Cost Curves, Break Even point, Law of diminishing Marginal Utility
Costing of a product during the stages of its life cycle
9 Hours
Unit IV
Pricing & Market Structure
Components of Pricing, Methods of Pricing, Return on Investment, Payback Period, Market Structure and Pricing,
Perfect Competition, Monopoly, Oligopoly, Monopolistic, Non price competition, E-commerce.
The secure payment process in e-commerce.
9 Hours
Unit V
Introduction to Macro Economics & Financial Accounting
National Income – GDP, Per Capita Income, Inflation, Stagflation, Deflation, Business Cycle, Stabilization Policies,
Direct Taxes, Indirect Taxes, Balance of Payment. Accounting - Terminology, Book Keeping, P&L, Balance Sheet.
Role of Central Excise and Customs
9 Hours
Total: 45 Hours
Textbook(s)
1. A. Ramachandra Aryasri and V V Ramana Murthy, Engineering Economics and Financial Accounting, Tata
McGraw Hill Publishing Company Limited , New Delhi, 2006.
Reference(s)
1. V L Samuel Paul and G S Gupta, Managerial Economics – Concepts and Cases, Tata McGraw Hill
Publishing Company Limited, New Delhi, 1981.
2. S N Maheswari, Financial and Management Accounting, Sultan Chand.
3. R Kesavan, C Elanchezhian and T Sunder Selwyn, Engineering Economics and Financial Accounting, Laxmi
Publication (P) Ltd , New Delhi, 2005.
11Z702 DISTRIBUTED COMPUTING SYSTEMS
3 1 0 3.5
Objective(s)
 To know the various distributed computing system strategies.
 To understand the levels of message passing and call semantics.
 To learn the architecture of Remote Procedure Call.
 To be aware of the transaction models and deadlocks.
 To understand the purpose and categories of clock synchronization.
Program Outcome(s)
solutions, think 0creatively and communicate effectively.
Course Outcome(s)
 Determine the basic client server communication.
 Design and implement a distributed system over other networks.
 Diagnose the cause of defects in the deadlocks.
132
Assessment pattern
S.No
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
10
10
10
10
2
Understand
20
20
20
20
3
Apply
20
20
20
20
4
Analyze/Evaluate
30
30
30
30
5
Create
20
20
20
20
Total
100
100
100
100
Remember
1. Define distributed systems
2. List the types of transparencies.
3. What are the uses of web services?
4. Why we need openness?
5. What is meant by interprocess Communication?
6. Illustrate how thin client are implemented
7. What are the characteristic of network hidden by stream abstraction?.
8. Give examples of distributed systems.
9. Define domain name
10. What are the different types of distributed file system available?
11. Define directory services.
12. What is meant by Berkeley algorithm?
13. What is referred as closure mechanism?
14. List the uses of linking mounting.
15. Define global State
16. What are the layers present in name space distribution?
17. State the advantages of user level threads.
18. What is the principle of server management?
19. What is stub generation?
20. Define metadata.
Understand
1. Compare intranet and internet.
2. Explain in detail about marshalling.
3. How process allocation strategies can be divided?
4. Explain in detail about Remote Procedure call with a case study.
5. Describe the principles involved in group communication?
6. Explain about file server architecture.
7. Write the short notes on distributed mutual exclusion and elections.
8. How Lock Management is done in distributed DBMS?
9. How the Capture step is implemented?
10. Explain several refinements suggested by the observations made by Two-Phase commit protocol
Apply
1. Write the various ways of doing caching in client memory.
2. Illustrate the trends in DFS.
3. What are the three basic observations made by Two-Phase commit protocol in detail?
4. Why we need Gate way Protocol? Give some examples.
5. Write the characteristic of network hidden by stream abstraction.
6. Demonstrate in detail about the election algorithm

133
Analyze
1. Differentiate networking and internetworking.
2. Differentiate RMI and RPC.
3. Write some of the potential bottlenecks that should be avoided in very large distributed systems.
4. What are the Characteristics of Centralized algorithms?
5. Difference between monolithic and micro kernels
6. How remote procedure call is made.
7. What is stub? How is it generated?
8. What are the elements involved in the implementation of RPC?
Evaluate
1. Explain the buffered vs. unbuffered primitives in detail
2. Explain the different types of addressing used in a client server model
3. Why do we need Synchronization in Distributed Systems?
Create
1. Discuss in detail about domain name services
2. Based on what conditions we can assign time to all the events in a Distributed Systems.
3. Discuss how the thread packages are implemented.
4. Write the short notes Distributed mutual exclusion and elections
Unit I
Basic Concepts
Characterization of Distributed Systems – Examples – Resource Sharing and the Web – Challenges – System Models
– Architectural and Fundamental Models – Networking and Internetworking – Types of Networks – Network
Principles- Internet Protocols.
9 Hours
Ethernet and WiFi
Unit II
Interprocess Communication and Distributed Objects
Interprocess Communication – The API for the Internet Protocols – External Data Representation and Marshalling –
Client –Server Communication – Group Communication – Case Study – Distributed Objects and Remote Invocation
– Communication Between Distributed Objects – Remote Procedure Call – Events and Notifications.
9 Hours
Interprocess communication in UNIX and Java RMI
Unit III
Distributed Transactions and Concurrency Control
Transactions - Locks - Optimistic Concurrency Control - Timestamp Ordering - Comparison - Flat and Nested
Distributed Transactions - Atomic Commit Protocols - Concurrency Control in Distributed Transactions - Distributed
Deadlocks - Transaction Recovery.
9 Hours
Transactions with replicated data
Unit IV
Resource Management
Time and Global States-Introduction-Clocks, Events and Process states-Synchronizing physical clocks-Logical time
and logical clocks-Global states-Distributed debugging-Coordination and Agreement-Introduction-Distributed mutual
exclusion-Elections Algorithm- Multicast communication-Consensus and related problems.
9 Hours
Amoeba- Mach.
Unit V
Distributed File System and Name Services
Distributed File Systems-Introduction-File service architecture-Network File System- Name Services – introduction Name Services and the Domain Name System-Directory Services.
Sun network file system – Global name service
9 Hours
Total: 45 +15 Hours
134
Textbook(s)
George Coulouris, Jean Dollimore and Tim Kindberg, Distributed Systems Concepts and Design,
Reference(s)
1. Andrew S. Tanenbaum, Maartenvan Steen, Distibuted Systems, Principles and Paradigms,
2. Mugesh Singhal, Niranjan G Shivaratri, Advanced Concepts in Operating Systems, Tata McGraw Hill
Edition, 2001
3. M. L. Liu, Distributed Computing Principles and Applications, Pearson Education, 2004
11Z703 OBJECT ORIENTED ANALYSIS AND DESIGN
3 0 0 3.0
Objective(s)
 To learn how to identify objects, relationships, services and attributes through UML .
 To get familiarized on object oriented design process.
 To built a conceptual model during analysis and design.
Program Outcome(s)
Course Outcome(s)
 Demonstrate the functional behavior of UML diagrams
 Recognize the concepts and notations used for finding Objects and classes
 Depict the utility of Object Oriented Methodologies
 Determine the factors of Object Oriented Design Process
Assessment Pattern
Model
Bloom’s Taxonomy
End-semester
S.No.
(New Version)
Test I Test II Examination
Exam
1
Remember
10
10
20
20
2
Understand
20
20
10
10
3
Apply
30
20
20
20
4
Analyze
20
20
20
20
5
Evaluate
10
20
10
10
6
Create
10
10
20
20
Total
100
100
100
100
Remember
1. Define object
2. What is unified approach?
3. What is generalization?
4. Define class hierarchy
5. What are object relationship and associations?
6. Define object persistence

135
7. Define meta-class
8. Define collaboration
9. What is meant by Pattern?
10. What is frame work?
11. List the steps involved in Macro development process of Booch methodology
12. What is meant by persistence?
13. Name the UML graphical diagrams.
14. What is a Package?
15. Define use-case
16. List the approaches used to identify classes.
17. Mention the guidelines for naming a class.
Understand
1. Describe the various Object Oriented Concepts.
2. Describe the Object oriented Systems Development life cycle.
3. Summarize the Rumbaugh‘s Object Modeling Technique.
4. Explain the concepts of Booch Methodology.
5. Explain the importance of Noun phrase approach.
Apply
1. Design an Interaction diagram for checking the deposit of the banking system.
2. Construct the use case and class diagrams for Library management system.
Analyze
1. Construct a state transition diagram to depict the following: A telephone can be idle or active. Initially it is
idle. When it is lifted off the hook by a valid subscriber, the dial tone starts playing and the telephone
becomes active. When it is active the dial tone plays or in the midst of connecting/talking.
2. Identify and describe the steps for preparing a use-case model.
3. Recognize the concepts and notations used for finding Objects and Classes.
4. Illustrate the application of generalization and specialization principles to discover super class/subclass
relationships.
Evaluate
1. Evaluate the concept and importance of unified approach.
2. Evaluate the need of UML diagrams in the real time Applications
Create
1. Create the model-proceedings of view layer classes in design phase.
2. Generate the test cases and impacts of object orientation on testing.
Unit I
Introduction
Overview of Object Oriented Systems Development-Orthogonal views of the software- object oriented system
development methodology- object orientation - unified approach - Object Basics – Object Oriented Systems
Development Life Cycle.
9 Hours
Use case driven approach, Identification of potential Objects and Classes.
Unit II
Object Oriented Methodologies
Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns – Frameworks – Unified
Approach – Unified Modeling Language – Use case - class diagram - Interactive Diagram - Package Diagram Collaboration Diagram - State Diagram - Activity Diagram.
9 Hours
UML extensibility and meta model, Shaler/Mellor - Coad/Yourdon methodologies
Unit III
Object Oriented Analysis
Identifying use cases - Object Analysis- Classification Theory –Approaches for identifying classes –Noun phrase
approach-common class patterns approach- use case driven approach-classes, responsibilities and collaborators Identifying Object relationships - Attributes and Methods.
9 Hours
136
Development of prototypes and validation
Unit IV
Object Oriented Design
Object oriented Design process and Design axioms - Corollaries - Design patterns - Designing Classes – OOD
philosophy – process - UML object constraint - Class visibility – Refining Attributes – Designing methods and
protocols - Access Layer - Object Storage - Object Interoperability.
9 Hours
Object oriented database management systems
Unit V
Software Quality and Usability
View layer - Designing Interface Objects – User interface design as a creative process- Designing View layer classes
– Macro level process – Micro level process – Purpose of view layer interface - Software Quality Assurance – System
Usability.
9 Hours
Measuring User Satisfaction, Managing Object Oriented Development
Total: 45 Hours
Textbook(s)
Ali Bahrami, Object Oriented Systems Development, Tata McGraw-Hill, 2010
Reference(s)
1. James Rumbaugh, Ivar Jacobson and Grady Booch, The Unified Modeling Language Reference Manual,
Addison Wesley, 2006
2. Martin Fowler, UML Distilled, PHI/Pearson Education, 2002
3. Stephen R. Schach, Introduction to Object Oriented Analysis and Design, Tata McGraw-Hill, 2003
4. Hans-Erik Eriksson, Magnus Penker, Brain Lyons and David Fado, UML Toolkit, OMG Press Wiley Publishing
Inc., 2004
11Z704 BUSINESS COMPONENT TECHNOLOGY
3 0 0 3.0
Objective(s)
 To impart in-depth knowledge of JAVA, CORBA and .Net Components.
 To understand the fundamental properties of components, technology, architecture and middleware.
 To understand the Component Frameworks and development Architecture.
Program Outcome(s)
e) Develop software as per the software life cycle model.
h) Provide an excellent education experience through the incorporation of current pedagogical techniques and
hands-on laboratory experiences that enhances the educational experience.
Course Outcome(s)
 Design of components using JAVA, CORBA and .Net.
 Analyze the complexity of the components and their relativity.
 Develop middleware components.
Assessment Pattern
S.no
Bloom’s Taxonomy
(New Version)
1
Remember
2
Understand
3
Apply
4
Analyze /Evaluate
5
Create
Test I
Test II
10
30
30
20
10
10
30
30
20
10
Model
Examination
10
30
30
20
10
Total
100
100
100
Remember
1. What is Software Component?
2. What are objects?
3. Write down the notes of Middleware components.
4. Give the details about the java beans.
5. Define the object realization.
6. Give an example of middleware. Give details of JAR Files.
7. List out the Active x controls.
8. What is OLE Containers and servers?
9. What is black box component based development?
10. Give the details about component testing tools.
11. Define software component
12. State the need of callbacks.
13. Define thread with an example
14. What is introspection? Where it is used?
15. What is ORB?
16. Give account on IDL.
17. List the benefits of COM.
18. What is reflection?
19. How contexts are created in a .NET framework?
20. List the components of EJB containers.
21. What is the reusable component technology?
22. What are the fundamental properties of the component development?
Understand
1. How the software component tested?
2. Give the details about the Enterprise Java Beans development.
3. Compare the DOM vs. DCOM.
4. What is meant by Appdomains?
5. Give the details of the cross development environments.
6. List out the component development tools.
7. Write down the various components development stage.
8. Give the details about the component framework.
9. Explain in detail about component architecture
10. Discuss in detail about the characteristics of components
11. What is the use of interfaces? Why we need it? Explain with example
12. Explain in detail about distributed object model.
13. Write in detail about CORBA component model.

137
End-Semester
Examination
10
30
30
20
10
100
138
14. Write about .NET components.
15. Write a note on dispatch interfaces
16. Discuss in detail about Black Box component framework
17. Draw the Object Management Architecture and explain in detail the CORBA services.
18. Explain in detail about distributed object model
19. Name the different types of components available.
20. What is meant by COM?
21. Define remote reference
22. Give the meaning of persistence of object.
23. What is factory component? Give example.
24. Mention the salient features of CORBA.
25. What is the use of ATL?
26. What is meant by object clustering?
27. Explain DSI, DII, OLE, ROI and RMI.
28. What is meant by concurrency in server objects?
29. Distinguish between Java and CORBA.
30. What is IDL?
31. What is Object Request Broker? Explain in detail.
32. What is System Object Model?
33. What is Portable Object Adapter?
34. What are CORBA services?
35. What is application Server?
36. What is DCOM?
37. How is DCOM different from COM.?
Apply
1. How can CBD improve the business process?
2. How does CBD differ from previous approaches and technologies?
3. Briefly explain how a JAVA ORB application is developed
4. What are the different types of factory components available? Explain them in detail
5. How to build applications using COM?
6. How will you develop an application using Enterprise Beans?
7. State and explain about COM facilities and services.
8. Design the COM and DCOM using Microsoft visual C++ environments.
9. Design the component based on application environments.
Analyze / Evaluate
1. Design a Activex Control to display the welcome message based on the time.
2. Design a Activex Timer Control
3. Design a Activex Control to find the number of hosts in a given net id and subnet mask.
4. Develop a java RMI program for Stock quote.
5. Develop a CORBA program to demonstrate the Stringification of objects.
Create
1. Design .net based components with perform the arithmetic operations.
2. Develop a java RMI application to find the top ten songs of your favorite channel using the weight age given to the
songs. The songs are stored in the database.
3. Design an ATL COM to convert the given inches to feet, centimeter, meter.
4. Design a java RMI application to find the details of the given product ID. Where the details are stored in a
database?
Unit I
Introduction
Software Components – objects – fundamental properties of Component technology – modules – interfaces – callbacks –
directory services – component architecture – components and middleware.
9 Hours
Polymorphism
139
Unit II
Java Based Component Technologies
Overview of java component technologies- Threads – Java Beans –Basic Java Services–Component verity – Advanced
Java services- JXTA and Jini- Java and Web Services –Sun ONE.
9 Hours
Exception Handling, Synchronization and Garbage collection
Unit III
CORBA Component Technologies
Java and CORBA – Interface Definition language – Object Request Broker – system object model – CORBA services –
CORBA component model – CORBA facilities – model driven architecture.
9 Hours
CORBA –Compliant implementations
Unit IV
.Net Based Component Technologies
COM object reuse – interfaces and polymorphism–COM services – Compound documents and OLE –Contextual
composition and services– .NET framework– Common language framework.
9 Hours
Assemblies – the .NET components
Unit V
Enterprise Java Beans
Introduction-EJB Architecture – Types of Enterprise Beans –Lifecycle of Beans –Steps in Developing an EJB –
Componentized Application Development using EJB.
9 Hours
Difference between EJB 3.0 and EJB 2.0
`
Total: 45 Hours
Textbook(s)
1. Clemens Szyperski, Component Software: Beyond Object-Oriented Programming, Pearson Education
publishers, 2010
2. G Sudha Sadasivam, ―Distributed Component Architecture‖, Wiley India Edition, 2008
Reference(s)
1.
Ed Roman, Mastering Enterprise Java Beans, John Wiley & Sons Inc., 1999
2.
Mowbray, Inside CORBA, Pearson Education, 2003
3.
Hortsamann, Cornell, CORE JAVA Vol-II Sun Press, 2002
4.
Freeze, Visual Basic Development Guide for COM & COM+, BPB Publication, 2001
11Z707 CASE TOOLS LABORATORY
0 0 3 1.5
Objective(s)
 To learn how to identify objects, relationships, services and attributes through UML.
 To get familiarized on object oriented design process.
 To built a conceptual model during analysis and design.
Program Outcome(s)
Skill Set
 Demonstrate the functional behavior of UML diagrams
 Recognize the concepts and notations used for finding Objects and classes
 Depict the utility of Object Oriented Methodologies
 Determine the factors of Object Oriented Design Process
140
Assessment Pattern
Bloom’s Taxonomy
Internal
End Semester
(New Version)
Assessment
Examination
10
15
Preparation
15
20
10
Record
15
15
Viva Voce
Total
50
50
Remember
1. Define object
2. What is unified approach?
3. What is generalization?
4. Define class hierarchy
5. What are object relationship and associations?
6. Define object persistence
7. Define meta-class
8. Define collaboration
9. What is meant by Pattern?
10. What is frame work?
11. List the steps involved in Macro development process of Booch methodology
12. What is meant by persistence?
13. Name the UML graphical diagrams.
14. What is a Package?
15. Define use-case
Understand
1. Describe Program Analysis and Project Planning
2. Describe Software testing and validation
Apply
1. Design an Interaction diagram for checking the deposit of the banking system.
2. Construct the use case and class diagrams for Library management system.
Analyze
1. Construct a state transition diagram to depict the following: A telephone can be idle or active. Initially it is
idle. When it is lifted off the hook by a valid subscriber, the dial tone starts playing and the telephone
becomes active. When it is active the dial tone plays or in the midst of connecting/talking.
2. Describe the steps for preparing a use-case model.
3. Illustrate the application of generalization and specialization principles to discover super class/subclass
relationships.
Evaluate
1. Draw UML diagrams for the real time Applications.
Create
1. Generate the test cases and impacts of object orientation on testing.
List of Experiments
1.
Prepare the following documents for two or three of the experiments listed below and develop the
Software engineering methodology.
2. Program Analysis and Project Planning.
Thorough study of the problem – Identify project scope, Objective(s), Infrastructure.
3. Software requirement Analysis
Describe the individual Phases / Modules of the project, Identify deliverables.
4. Data Modeling
Use work products – Data dictionary, Use diagrams and activity diagrams, build and test Class
diagrams, Sequence diagrams and add interface to class diagrams.
141
5. Software Development and Debugging
6. Software Testing Prepare test plan, perform validation testing, Coverage analysis, memory leaks,
Develop test case hierarchy, Site check and Site monitor.
Suggested List of Applications
1. Student Marks Analyzing System
2. Online Quiz System
3 Online Railway Ticket Reservation Systems
4. Payroll System
5. Course Registration System
6. Expert System for Medical Diagnosis System
7. ATM Systems
8. Stock Maintenance
9. Real Time Scheduler for Elevator Systems
Design Experiments
Total: 45 Hours
Practical schedule
S.No
Experiment
1. Prepare the following documents for two or three of the experiments listed below and
develop the software engineering methodology.
2. Program Analysis and Project Planning.
Thorough study of the problem – Identify project scope, Objective(s), Infrastructure.
3. Software requirement Analysis
Describe the individual Phases / Modules of the project, Identify deliverables
4. Data Modeling
Use work products – Data dictionary, Use diagrams and activity diagrams, build and test
Class diagrams, Sequence diagrams and add interface to class diagrams
5. Software Development and Debugging
6. Software Testing Prepare test plan, perform validation testing, Coverage analysis, memory
leaks, develop test case hierarchy, Site check and Site monitor
7. Design Experiments
Hours
6
6
6
6
6
6
9
11Z708 BUSINESS COMPONENT TECHNOLOGY LABORATORY
0 0 3 1.5
Objective(s)
 To make the students understand the JAVA RMI, CORBA and .Net Applications.
 To make the students to design the components using technology frameworks.
Program Outcome(s)
c) Demonstrate problem solving and design skills including the ability to formulate problems and their
d) Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize
142
Course Outcome(s)
 Design of components using JAVA, CORBA and .Net Components.
 Develop middleware components.
 Analyze complexity of the components and their relativity.
Assessment Pattern
Bloom’s Taxonomy
Internal
End-semester
(New Version)
Assessment
Examination
Preparation
10
15
15
20
Record
10
Mini-Project / Model Examination/
15
15
Viva-Voce
Total
50
50
Remember
1.What are Software Components?
2. What are Objects?
3. Distinguish between the components and the object?
4. What are modules?
5. How are modules different from Components?
6. What are Interfaces? Explain with types.
7. What are Callbacks?
8. What is the role of Directory Services?
9. Distinguish Components and middleware.
10. What are the features of components and objects?
Understand
1.What are threads and state their uses and disadvantages.
2. What are Java Beans? Explain with examples.
3. What is events and connections?
4. What are properties?
5. What are Introspection and Reflection?
6. Why JAR files are used and state their usage.
7. What is Object Serialization?
8. Why EJB is needed?
9. What is RMI?
10. What is RMI-IIOP?
Apply/Analyze /Evaluate
1. Design an Activex Control to display the welcome message based on the time.
2. Design an Activex Control to find the number of hosts in a given net id and subnet mask.
3. Develop an ATL COM to find the Density, given mass and volume (m/v).
4. Develop a java RMI application to find the top ten songs of your favorite channel using the weight age
given to the songs. The songs are stored in the database.
5. Develop a CORBA program to demonstrate the Stringification of objects.
Create
1. Develop a java RMI application to find the details of the given product ID. Where the details are stored in
a database.
2. Design a Stock Server using RMI Application.
List of Experiments
1. COM COMPONENT: Development of simple com components in VB and use them in applications.
[2 Experiments]
2. Enterprise java beans: Deploying EJB for simple arithmetic operator
3. RMI: Deploying RMI for client server applications. [2 Experiments]
4. Creation of DLL Using VB and Deploy it in Java. [2 Experiments]
5. Naming Services In CORBA
6. DSI, DII in CORBA
143
7.
8.
9.
Inter ORB in Communication [IIOP, IOR] Jac ORB & Visi broker ORB
Studying J2EE Server
Simple Application using CORBA
10. Case study on .Net frameworks.
Design Experiments
Total: 45 Hours
Practical Schedule
Sl.No
Experiment
1
Development of simple COM components in VB and use them in applications
2
Deploying EJB for simple arithmetic operator
3
Creation of DLL Using VB and Deploy it in Java
4
RMI: Deploying RMI for client server Applications
5
Naming Services in CORBA
6
DSI, DII in CORBA
7
Studying J2EE Server
8
Simple Application using CORBA
9
Inter ORB in Communication [IIOP, IOR] Jac ORB & Visi broker ORB
10
Case study on .Net Frameworks
11O801 PROFESSIONAL ETHICS
Hours
3
3
3
3
3
3
3
3
3
3
2 0 0 2.0
Objective(s)
 To study the basic issues in Professional Ethics.
 To appreciate the rights of others and to instill moral, social values and loyalty.
 To enable the student in their engineering profession who explore the ethical issues in technological society.
Program Outcome(s)
i) Demonstrate an ability to engage in life-long learning.
j) Function ethically and responsibly, and to remain informed and involved as full participants in our profession
and our society
Course Outcome(s)
 Ability to propose possible solutions using articulated ethical theories.
 Ability to form opinions based on reasoned ethical positions, supported with facts and evidence.
 Increase in awareness of the ethical component of daily engineering decisions.
Assessment Pattern
Bloom’s
S.
Model
End Semester
Taxonomy
Test I†
Test II†
No.
Examination†
Examination
(New Version)
1
Remember
30
30
30
30
2
Understand
40
40
40
40
3
Apply
30
30
30
30
4
Analyze/Evaluate
5
Create
Total
100
100
100
100
144
7
Remember
1. Define Human Values.
2. What are Morals and Values?
3. What do you mean by Civic virtue and Respect for others?
4. Write the various meanings of ―Spirituality‖?
5. List four different types of Virtues.
6. Mention different Human values.
7. What is meant by moral autonomy?
8. Classify the types of inquiry.
9. What are the steps needed in confronting moral dilemmas?
10. List the levels of moral development suggested by Kohlberg.
11. What do you understand by self-interest and ethical egoism?
12. What are the steps needed in confronting moral dilemmas?
13. What are the three virtues of religion?.
14. What are the professional responsibilities?
15. What is meant by ―Informed consent‖ when bringing an engineering product to market?
16. What is engineering experimentation?
17. What are the different roles and functions of ―Code of Ethics‖?
18. What are the Limitations of ―Code of Ethics‖?
19. Name some of the engineering societies which published ―codes of ethics‖.
20. What is meant by a disaster?
Understand
1. Which are the practical skills that will help to produce effective independent thought about moral issues?
2. Why does engineering have to be viewed as an experimental process?
3. Why isn‘t engineering possible to follow a random selection in product design?
4. Why is the ―code of ethics‖ important for engineers in their profession?
5. What does the Balanced Outlook on Law stress in directing engineering practice?
6. Are the engineers responsible to educate the public for safe operation of the equipment? How?
7. What kind of responsibility should the engineer have to avoid mistakes that may lead to accident due to the
design of their product?
8. What is the use of knowledge of risk acceptance to engineers?
9. Why is Environmental Ethics so important to create environmental awareness to the general public?
10. Why do the engineers refuse to do war works sometimes?
Apply
1. How does the consideration of engineering as a social experimentation help to keep a sense of autonomous
participation is a person‘s work?
2. How does the ―code of ethics‖ provide discipline among the engineers?
3. How would you classify the space shuttle Challenger case accident?
4. How does the manufacturer understand the risk in a product catalog or manual?
5. How does the knowledge of uncertainties in design help the engineers to access the risk of a product?
6. How can the quantifiable losses in social welfare resulting from a fatality be estimated? Give some examples.
7. How does the engineer act to safeguard the public from risk?
Unit I
Human Values
Morals, Values and Ethics – Integrity – Work Ethic – Service Learning – Civic Virtue – Respect for Others – Living
Peacefully – Caring – Sharing – Honesty – Courage – Valuing Time – Co-operation – Commitment – Empathy –
Self-Confidence
Character – Spirituality in business.
6 Hours
7 †
The marks secured Test I and Test II will be converted 20 and Model Examination will be converted to 20. The remaining 10 marks will be
145
Unit II
Engineering Ethics
Senses of 'Engineering Ethics' – Variety of moral issues – Types of inquiry – Moral autonomy – Kohlberg's theory –
Gilligan's theory – Consensus and controversy – Models of Professional Roles – Theories about right action
Self-interest – Uses of ethical theories.
6 Hours
Unit III
Engineering as Social Experimentation
Engineering as experimentation – Engineers as responsible experimenters – Codes of ethics – A balanced outlook on
law – The Challenger case study – Bhopal Gas Tragedy – The Three Mile Island and Chernobyl case studies
Safety aspects in Nuclear Power plants
6 Hours
Unit IV
Responsibilities and Rights
Fundamental Rights, Responsibilities and Duties of Indian Citizens – Collegiality and loyalty – Respect for authority
– Collective bargaining – Confidentiality – Conflicts of interest – Occupational crime – Professional rights –
Employee rights – Discrimination
Right to Information Act.
6 Hours
Unit V
Global Issues
Multinational corporations – Environmental ethics and Environmental Protection Act – Computer ethics – Engineers
as managers – Consulting engineers – Engineers as expert witnesses and advisors – Moral leadership – Sample code
of ethics like IETE, ASME, ASCE, IEEE, Institution of Engineers (India), Indian Institute of Materials Management
6 Hours
Weapons development.
Total: 30 Hours
Textbook(s)
1. M. Govindarajan, S. Natarajan and V. S. Senthil Kumar, Engineering Ethics, PHI Learning Private Ltd, New
Delhi, 2012.
Reference(s)
1. Charles D. Fleddermann, Engineering Ethics, Pearson Education/ Prentice Hall of India , New Jersey, 2004.
2. Mike W. Martin and Roland Schinzinger, Ethics in Engineering, Tata McGraw Hill Publishing Company
Pvt Ltd, New Delhi, 2003.
3. Charles E. Harris, Michael S. Protchard and Michael J. Rabins, Engineering Ethics – Concepts and Cases,
Wadsworth Thompson Learning, United States, 2005.
4. http://www.slideworld.org/slidestag.aspx/human-values-and- Professional-ethics
5. www.mne.psu.edu/lamancusa/ProdDiss/Misc/ethics.ppt
ELECTIVES
LANGUAGE ELECTIVES
Language Elective I
11O10B BASIC ENGLISH I
*
3 0 0 3.0
*
Subject to continuous assessment
146
Objective(s)
 To offer students the basics of the English Language in a graded manner.
 To promote efficiency in English Language by offering extensive opportunities for the development of four
language skills (LSRW) within the classroom.
 An intense focus on improving and increasing vocabulary.
 To improve Spelling and Pronunciation by offering students rigorous practice and exercises.
g. Exhibit teamwork, communication, and interpersonal skills which enable them to work effectively with
interdisciplinary teams
Course Outcome(s)
 Listening
 Reading
 Writing
 Speaking
Unit I
Module
1
2
3
4
5
Unit II
Module
6
7
8
9
10
Unit III
Modul
e
Vocabulary/ Grammar
Basic words- 12 most used words in
English, usage and pronunciation
Skills Sets
Starting a conversation and
talking about what one does
Basic words- 20 oft used words, usage
and pronunciation
Basic words with a focus on spelling
Basic words- 10 oft used words, usage
and pronunciation
Tutorial
Analyzing an action plan
Vocabulary/ Grammar
Basic words + greetings to be used at
different times of the day
Last 28 of the 100 most used words
Using the 14 target words to form
bigger words
Palindromes, greetings- good luck,
festivals
Tutorial
Vocabulary/ Grammar
11
Homophones
12
Homophone partners, matching
words with their meanings
Briefcase words- finding
smaller words from a big word
Compound words and
pronunciation pointers
Tutorial
13
14
15
Discriminative listening
Content listening and
Intonation
Skills Sets
Formal conversation
Informal conversation
between equals
Informal dialogues using
contracted forms
Placing a word within its
context- culling out meaning
Course Outcome(s)s
Sentence construction
bolstered by Mother
Tongue
Creating and presenting
ones own action plan
Informal conversation
Reading comprehension
Course Outcome(s)s
Intonation to be used in
formal address
Reading practice and peer
learning
Guided speaking- talking to
peers using contracted forms
Offering congratulations
Skills Sets
Course Outcome(s)s
Formal and informal
methods of self-introduction
Contracted forms of the –be
verbs, ‗ve and ‗s
Formal and informal ways of
introducing others
Giving personal details
about oneself
Let‘s Talk is a group activity that gives
them some important pointers of speech
Translating English sentences to Tamil
Team work- speaking activity involving
group work, soft skills
Using the lexicon
Unit IV
Module
16
Vocabulary/ Grammar
Proper and common nouns
17
Pronouns
18
Abstract and common nouns
19
Group names of animals, adjectives
20
Unit V
Module
21
Vocabulary/ Grammar
Determiners
Conjugation of the verb ‗to be‘positive and negative forms
23
Am/is/are questions
24
Present continuous tense-form
and usage
Tutorial
27
28
29
30
Course Outcome(s)s
Pronunciation pointers- an
informal introduction to the IPA
Reading aloud and
comprehension
Reading practice and
comprehension
Pronunciation pointers
Tutorial
22
25
Unit VI
Module
26
Skills Sets
Asking for personal
information and details
Telephone skills and
etiquette
Dealing with a wrong
number
Taking and leaving
messages on the telephone
147
Skills Sets
Interrupting a conversation
politely- formal and informal
Thanking and responding to
thanks
Giving instructions and
seeking clarifications
Making inquiries on the
telephone
Vocabulary/ Grammar
Words with silent ‗b‘
Present continuous questions
Words with silent ‗c‘
Simple present tense- form and usage
Simple present tense- rules
Words with silent ‗g‘
Questions in the simple present tense
Tutorial
Course Outcome(s)s
Pair work reading
comprehension
Comprehension questions that
test scanning, skimming and
deep reading
Small group activity that
develops dialogue writing
Finishing sentences with
appropriate verbs
Skills Sets
Calling for help in an
emergency
Making requests and
responding to them politely
Describing people
Describing places
Course Outcome(s)s
Dialogue writing
Identifying elements of
grammar in text extract
Guided writing
Filling in the blanks with
correct markers of tense
Total: 45 Hours
Resources:
1. BASIC ENGLISH PROGRAMME L&L Education Resources LLP, 2011.
11O10C COMMUNICATIVE ENGLISH
*
3 0 0 3.0
Objective(s)
1. To equip students with effective speaking and listening skills in English
2. To help the students develop speaking skills in Business English
Course Outcome(s):
 Students will develop the fluency and language competence of learners of Business English at the
lower intermediate level
*
148
Unit I
Grammar and Vocabulary
Vocabulary for describing different organisational structures and company hierarchy – Practice using wh – questions;
there is / there are, Definitions of Quality, Vocabulary of quality management – Using nouns and adjectives to form
group nouns – Phrases for offering and accepting help and invitations – Telephone terms – Verb tenses – Questions
and responses – Conditionals – Gap Filling Exercises.
9 Hours
Unit II
Listening
Business Presentation – Conversation between old friends; introducing a stranger – Quality Manager talks about his
work – Conversation between acquaintances – Sales talk at a sports equipment stand – Small talk among colleagues –
Tour of a factory in Italy – Lunch in the factory canteen – Meeting to improve the efficiency of internal
communication – Telephone conversation arranging to meet – Credit card salesman talks to the bank – Conversation
between business acquaintances - Management meeting about a recent merger – Conversation about a town, a
country and its people.
9 Hours
Unit III
Speaking
Pronunciation Practice – Describing organizations - Company presentation –– Practicing of conversation starters and
closers with friends and strangers – Practice of simple language and step – by – step procedures to describe complex
ideas – Explaining visual information – The language of increase and decrease applied to graphs and bar charts Presenting a work – related graph – Making a telephone call – Sports equipment buyer and a manufacturer‘s sales
representative talk business – Entertaining a visitor in your country – Short marketing meeting – Negotiating to meet
around a busy schedule – Pairs or small groups discuss the implications of problems at an electronics factory –
Finding out all you can about a partner – Chairing and holding meetings – Pairwork on questions and answers about
places and people.
9 Hours
Unit IV
Reading
Signalling the structure of a presentation – introducing, sequencing and concluding a presentation - Explaining
concepts and ideas – Pattern of phone call conversations – Giving, receiving and checking information – Common
Business phrases – Giving encouragement: phrases for positive feedback; more emphatic adjectives and adverbs –
Giving / providing facts and explaining functions and processes – Asking for and clarifying information – How to
state your point, agree and disagree – Practice of frequency, quantity and number - Short marketing meet –
Suggesting and agreeing times and places – Phrases for the Chairperson – People at work: their emotions, skills and
attitudes.
9 Hours
Unit V
Writing
Present and future conditional Phrases for stalling for time - Common telephone phrases and responses - Business
Communication – Calling for Quotation – (Letter asking for Clarification) – Transcoding – Rearranging the sentences
– Cloze – Explaining Visual Information – Explaining concepts and ideas – Giving, getting and checking information
– Business description – Informal negotiations.
9 Hours
Total: 45 Hours
149
Textbook(s)
1. Jeremy Comfort, Pamela Rogerson, Trish Stott, and Derek Utley, Speaking Effectively – Developing
Speaking Skills for Business English, Cambridge University Press, Cambridge, 2002
Reference(s)
1. Brook-Hart Guy, BEC VANTAGE: BUSINESS BENCHMARK Upper-Intermediate – Student‟s Book,
Cambridge University Press, New Delhi, 2006
2. Aruna Koneru, Professional Communication, Tata McGraw-Hill Publishing Company Limited, New Delhi,
2008
3. P. Kiranmai Dutt, Geetha Rajeevan and CLN Prakash, A Course in Communication Skills, Cambridge
University Press, New Delhi, 2008
4. Krishna Mohan Balaji, Advanced Communicative English, Tata Mc- graw-hill Education Private Limited,
New Delhi, 2009
Language Elective II
11O20B BASIC ENGLISH II
*
3 1 0 3.5
Objective(s)
 To promote fluency even downplaying accuracy
 A tacit acquisition of Basic English Grammar through ample listening, reading and writing inputs with direct
theory or wherever relevant
 Specific focus on speaking and conversation skills with an aim to increase speaking confidence
 To nurture the capacity to express lucidly and articulate their thoughts and impressions on a wide gamut of
topics both through speaking and writing
 To improve spelling and pronunciation by offering rigorous practice and exercises
 To correct common mistakes and to teach self-assessment techniques
Course Outcome(s)
 Listening
 Reading
 Writing
 Speaking
*
Unit I
Module
Vocabulary/ Grammar
Skills Sets
Course Outcome(s)s
31
Difference between present
continuous and simple present
tense.
Calling for help in an
emergency
Reporting an eventjournalistic style
32
Verbs ‗have‘ and ‗have got‘
Describing animals
Asking for and giving
directions
33
Simple past tense
Inviting people, accepting
and declining invitations
Self- enquiry and offering
ones opinion on a given topic.
34
Spelling rules & table of irregular
verbs
Tutorial
Refusing an invitation
Reading and practicing prewritten dialogues
35
Unit II
Vocabulary/ Grammar
Skills Sets
Course Outcome(s)s
Questions and the negative forms of the
simple past tense
Apologizing and
responding to an
apology
(Reading) conversation
practice
Asking questions in the simple past tense
Reading comprehension
Seeking, granting and
refusing permission.
38
Past continuous tense
Paying compliments
and responding to them
Pair work: writing
dialogues and presenting
them
39
Difference between simple past and past
continuous- when and where to use each
Tutorial
Describing daily
routines
Reading and
comprehension skills.
Module
36
37
40
Unit III
Module
41
Vocabulary/ Grammar
Skills Sets
Course Outcome(s)s
Simple future tense
Talking about the
weather
Making plans- applying grammar
theory to written work
Simple future tense- more aspects,
possessive pronouns
Talking about
possessions
Opening up and expressing one‘s
emotions
Future continuous
Talking about current
activities
Asking for the time
and date
Listening comprehension
42
43
44
45
Revision of future tense- simple and
continuous forms, prepositions used
with time and date
Tutorial
Discussion- analyzing and
debating a given topic.
150
151
Unit IV
Module
46
Vocabulary/ Grammar
Articles a/an
47
Singular- Plural (usage of a/an)
48
49
Countable and uncountable
nouns- a/an and some
Articles- the
50
Tutorial
Skills Sets
Writing, speaking and
presentation skills
Reading practiceindependent and shared
reading
Listening comprehension
Sequencing sentences in a
paragraph
Course Outcome(s)s
Transcribing dictation
Comprehension –logical analysis,
process analysis and subjective
expression
Vocabulary: using context tools
to decipher meaning
Listening to a poem being recited,
answer questions on it and
practice reciting the same
Unit V
Vocabulary/ Grammar
Skills Sets
Course Outcome(s)s
Articles- the: usage and
avoidance
Speaking: sharing stories
about family, village/town,
childhood etc. 10 students
52
avoidance with like and hate
53
avoidance with names of places
54
This/ that/ these and those
childhood etc.- 10 students
childhood etc.- 10 students
Writing a noticeannouncement
Listening: comprehend and
follow multiple step
instructions read out by the
teacher
Reading: make inferences
from the story about the plot,
setting and characters
Comprehension passage
55
Tutorial
Module
51
Speaking: Debate
Unit VI
Module
56
Vocabulary/ Grammar
One and ones
57
Capitalization and punctuation
58
59
Syntax and sentence constructionrearrange jumbled sentences
Cloze
60
Tutorial
Skills Sets
Collaborative learningproblem solving
Controlled writing
Guided writing
Free writing
Course Outcome(s)s
Writing short answers to
questions based on reading
Listen to a story and respond to
its main elements
Listen to a poem and discuss its
elements
Frame simple yet purposeful
questions about a given passage
45+15 Hours
Resources:
1. BASIC ENGLISH PROGRAMME L&L Education Resources LLP, 2011.
11O20C ADVANCED COMMUNICATIVE ENGLISH *
152
3 1 0 3.5
Objective(s)
 To learn about how to communicate in the business environment
 Listen to an explanation and respond
 Write a formal letter
 Read company literature
Course Outcome(s)
 Read graphs and charts
 Skim and scan texts like job adverts
 Read business articles for specific information
 Understand the structure of a text
Unit I
Grammar and Vocabulary
Comparison of adjectives and adverbs – tenses – simple and complex questions – countable/ uncountable nouns, -ing
forms and infinitives – conditionals – comparing and contrasting ideas – modal verbs – while and whereas for
contrasting ideas – passives – used to, articles, reported speech, relative pronouns and expressing cause and result –
workplace-related vocabulary.
9 Hours
Unit II
Listening
Prediction - Ability to identify information – Ability to spell and write numbers correctly – Ability to infer,
understand gist, topic, context, and function, and recognize communicative functions ( complaining, greeting,
apologizing etc.) – Ability to follow a longer listening task and interpret what the speakers say.
9 Hours
Unit III
Speaking
Ability to talk about oneself and perform functions such as agreeing and disagreeing – Ability to express opinions,
agree, disagree, compare and contrast ideas and reach a decision in a discussion – appropriate use of stress, rhythm,
intonation and clear individual speech sounds - take an active part in the development of the discourse - turn-taking
and sustain the interaction by initiating and responding appropriately
9 Hours
Unit IV
Reading
Ability to skim and scan business articles for specific details and information – To understand the meaning and the
structure of the text at word, phrase, sentence, and paragraph level – Ability to read in detail and interpret opinions
and ideas – to develop one‘s understanding and knowledge of collocations – Ability to identify and correct errors in
texts
9 Hours
* Subject to continuous assessment
153
Unit V
Writing
Ability to write concisely, communicate the correct content and write using the correct register – Ability to write
requests, instructions, explanations, and ask for information by using the correct format in business correspondences
like charts, memo, note, email, letter, fax, report, proposal – understanding formal and informal styles – responding to
written or graphic input
9 Hours
Total: 45+15 Hours
Text Book
Brook-Hart, Guy, Business Benchmark: Upper Intermediate – Student‘s Book, Cambridge University Press,
New Delhi, 2006
Reference(s)
1. Whitby, Norman, Bulats Edition: Business Benchmark, Pre-Intermediate to Intermediate – Student‘s Book,
Cambridge University Press, New Delhi, 2006
2. Cambridge Examinations Publishing, Cambridge BEC Vantage – Self-study Edition, Cambridge University
Press, UK, 2005
11O20G GERMAN *
3 1 0 3.5
Objective(s)
 To help students acquire the basics of German language
 To teach them how to converse in German in various occasions
Course Outcome(s)
 Listening
 Reading
 Writing
 Speaking
Unit I
Grammar & Vocabulary
Introduction to German language: Alphabets, Numbers – Nouns - Pronouns Verbs and Conjugations - definite and
indefinite article - Negation - Working with Dictionary – Nominative - Accusative and dative case – propositions adjectives - modal auxiliaries - Imperative case - Possessive articles.
9 Hours
Unit II
Listening
Listening to CD supplied with the books, paying special attention to pronunciation: Includes all lessons in the book –
Greetings - talking about name – country – studies – nationalities - ordering in restaurants - travel office - Interaction
with correction of pronunciation.
9 Hours
*
154
Unit III
Speaking
Speaking about oneself - about family – studies - questions and answers - dialogue and group conversation on topics
in Textbook(s) - talks on chosen topics.
9 Hours
Unit IV
Reading
Reading lessons and exercises in the class - pronunciation exercises: Alphabet – name – country – people –
profession – family – shopping – travel – numbers – friends – restaurant – studies - festivals
9 Hours
Unit V
Writing
Alphabets – numbers - words and sentences - Exercises in the books - control exercises - writing on chosen topics
such as one self – family – studies - country.
9 Hours
Total: 45+15 Hours
Textbook(s)
1. Grundkurs DEUTSCH A Short Modern German Grammar Workbook and Glossary, VERLAG FUR
DEUTSCH, Munichen, 2007.
2. Grundkurs, DEUTSCH Lehrbuch Hueber Munichen, 2007.
Reference(s)
1. Cassel Language Guides – German: Christine Eckhard – Black & Ruth Whittle, Continuum, London / New
York, 1992.
2. Kursbuch and Arbeitsbuch, TANGRAM AKTUELL 1 DEUTSCH ALS FREMDSPRACHE, NIVEAUSTUFE
AI/1, Deutschland, Goyal Publishers & Distributers Pvt. Ltd., New Delhi, 2005.
3. Langenscheidt Eurodictionary – German – English / English – German, Goyal Publishers & Distributers
Pvt. Ltd., New Delhi, 2009.
11O20J JAPANESE
*
3 1 0 3.5
Objective(s)
 To help students acquire the basics of Japanese language
 To teach them how to converse in Japanese in various occasions
 To teach the students the Japanese cultural facets and social etiquettes
Course Outcome(s)
 Listening
 Reading
 Writing
 Speaking
*
155
Unit I
Introduction to Japanese - Japanese script - Pronunciation of Japanese(Hiragana) - Long vowels - Pronunciation of
in,tsu,ga - Letters combined with ya,yu,yo - Daily Greetings and Expressions - Numerals. N1 wa N2 des - N1 wa
N2 ja arimasen - S ka - N1mo - N1 no N2 - …….san - Kanji - Technical Japanese Vocabulary (25 Numbers)
9 Hours
Unit II
Introduction - Kore - Sore - are - Kono N1 - Sono N1 - ano N1 - so des - so ja arimasen - S1 ka - S2 ka - N1 no N1 so des ka – koko - soko - asoko - kochira - sochira - achira - N1 wa N2 (Place) des – dhoko-N1 no N2 - Kanji-10 ima….ji…fun des - Introduction of verb - V mas - V masen - V mashitha - V masen deshitha - N1(Time) ne V - N1
kara N2 des - N1 tho N2 / S ne Kanji-10 - Technical Japanese Vocabulary (25 Numbers) – Dictionary Usage.
9 Hours
Unit III
- N1(Place) ye ikimas - ki mas - kayerimasu - Dhoko ye mo ikimasen - ikimasendheshitha - N1(vehicle) de ikimasu kimasu - kayerimasu - N1(Personal or Animal) tho V ithsu - S yo. - N1 wo V (Transitive) - N1 wo shimus - Nani wo
shimasu ka - Nan & Nani - N1(Place) de V - V masen ka - V masho - Oo……. Kanji-10 , N1( tool - means ) de V - ―
Word / Sentence ‖ wa …go nan des ka - N1( Person ) ne agemus - N1( Person ) ne moraimus - mo V shimashitha - ,
Kanji-10 – Japanese Typewriting using JWPCE Software, Technical Japanese Vocabulary (25 Numbers)
9 Hours
Unit IV
Introduction to Adjectives - N1 wa na adj des. N1 wa ii adj des - na adj na N1 - ii adj ii N1 - Thothemo - amari - N1
wa dho des ka - N1 wa dhonna N2 des ka - S1 ka S2 – dhore - N1 ga arimasu - wakarimasu - N1 ga suki masu - N1
ga kiraimasu - jozu des - hetha des - dhonna N1 - Usages of yoku - dhaithai - thakusan - sukoshi - amari - zenzen - S1
kara S2 - dhoshithe, N1 ga arimasu - imasu - N1(Place) ne N2 ga arimasu - iimasu - N1 wa N2(Place) ne arimasu iimasu - N1(Person,Place,or Thing ) no N2 (Position) - N1 ya N2, Kanji-10 - Japanese Dictionary usage using
JWPCE Software, Technical Japanese Vocabulary (25 Numbers)
9 Hours
Unit V
Saying Numbers , Counter Suffixes , Usages of Quantifiers -Interrogatives - Dhono kurai - gurai –Quantifier-(Period
) ne ….kai V - Quantifier dhake / N1 dhake Kanji - Past tense of Noun sentences and na Adjective sentences - Past
tense of ii-adj sentences - N1 wa N2 yori adj des - N1 tho N2 tho Dhochira ga adj des ka and its answering method N1 [ no naka ] de {nani/dhoko/dhare/ithsu} ga ichiban adj des ka - answering -N1 ga hoshi des - V1 mas form dhake
mas - N1 (Place ) ye V masu form ne iki masu/ki masu/kayeri masu - N1 ne V/N1 wo V - Dhoko ka - Nani ka –
gojumo - Technical Japanese Vocabulary (25 Numbers)
9Hours
Total: 45+15 Hours
Textbook(s)
1. Japanese for Everyone: Elementary Main Textbook(s) 1-1, Goyal Publishers and Distributors Pvt. Ltd., Delhi,
2007.
2. Japanese for Everyone: Elementary Main Textbook(s) 1-2, Goyal Publishers and Distributors Pvt. Ltd., Delhi,
2007.
Reference(s)
Software
1. Nihongo Shogo-1
2. Nihongo Shogo-2
3. JWPCE Software
156
Websites
1. www.japaneselifestyle.com
2. www.learn-japanese.info/
3. www.kanjisite.com/
4. www.learn-hiragana-katakana.com/typing-hiragana-characters/
11O20F FRENCH
*
3 1 0 3.5
Objective
 To help students acquire the basics of French language
 To teach them how to converse in French in various occasions
g.
Exhibit teamwork, communication, and interpersonal skills which enable them to work effectively with
Course Outcome(s)
 Listening
 Reading
 Writing
 Speaking
Unit I
Alphabet Français (alphabets) - Les accents français (the accents in French) – aigu – grave – circonflexe – tréma cédille - écrire son nom dans le français (spelling one‘s name in French)
9 Hours
Unit II
Les noms de jours de la semaine (Days of the week) - Les noms de mois de l'année (Months) - numéro 1 à 100
(numbers 1 to 100)
9 Hours
Unit III
Moyens de transport (transport) - noms de professions (professions) - noms d'endroits communs (places) nationalités (nationalities)
9 Hours
Unit IV
Pronoms (pronouns) - Noms communs masculins et de femme (common masculine and feminine nouns) - Verbes
communs (common verbs)
9 Hours
Unit V
Présentation - même (Introducing Oneself) - narration de son nom - l'endroit où on vit - son âge - date de naissance sa profession - numéro de téléphone - adresse (name - where one lives – age - date of birth – profession - telephone
number and address) - Narration du temps (tellling the time)
9 Hours
Total: 45+15 Hours
Textbook(s)
1. Angela Wilkes, French for Beginners, Usborne Language Guides, Usborne Publishing Ltd., Ohio, 1987.
*
157
Reference(s)
1. Ann Topping, Beginners French Reader, Natl Textbook(s) Co, 1975.
2. Stanley Applebaum, First French Reader, Dover Publications, 1998.
3. Max Bellancourt, Cours de Français, London: Linguaphone, 2000.
Software
1. Français Linguaphone, Linguaphone Institute Ltd., London, 2000.
2. Français I. Harrisonburg: The Rosetta Stone: Fairfield Language Technologies, 2001.
11O20H HINDI
*
3 1 0 3.5
Objective(s)
 To help students acquire the basics of Hindi
 To teach them how to converse in Hindi in various occasions
 To help learners acquire the ability to understand a simple technical text in Hindi
Course Outcome(s)
 Listening
 Reading
 Writing
 Speaking
Unit I
Hindi Alphabet
Introduction - Vowels - Consonants - Plosives - Fricatives - Nasal sounds - Vowel Signs - Chandra Bindu & Visarg Table of Alphabet -Vocabulary.
9 Hours
(Masculine & Feminine Nouns ending in – ā,і,ī, u,ū )- Masculine & Feminine – Reading Exercises.
Unit II
Nouns
Genders
9 Hours
Unit III
Pronouns and Tenses
Categories of Pronouns - Personal Pronouns - Second person (you & honorific) - Definite & Indefinite pronouns Relative pronouns - Present tense - Past tense - Future tense - Assertive & Negative Sentences - Interrogative
Sentences.
9 Hours
Unit IV
Classified Vocabulary
Parts of body – Relatives – Spices – Eatables – Fruits & Vegetables - Clothes - Directions – Seasons - Professions.
9 Hours
Unit V
Speaking
Model Sentences – Speaking practice for various occasions.
9 Hours
Total: 45+15 Hours
*
158
Textbook(s)
1. B. R. Kishore, Self Hindi Teacher for Non-Hindi Speaking People, Vee Kumar Publications (P) Ltd., New
Delhi, 2009.
Reference(s)
1. Syed, Prayojan Mulak Hindi, Rahamathullah Vani Prakasan, New Delhi, 2002.
2. Ramdev, Vyakaran Pradeep, Saraswathi Prakasan, Varanasi, 2004.
DISCIPLINE ELECTIVES
11Z001 ADVANCED COMPUTER ARCHITECTURE
3 0 0 3.0
Objective(s)
 To have a thorough understanding of the instruction level parallelism.
 To study the concept of multiprocessor architecture and thread level parallelism.
 To learn the hierarchical memory system including cache memories and virtual memory.
Program Outcome(s)
Course Outcome(s)
 Analyze the performance of different processors.
 Demonstrate the concepts of multiprocessor architecture.
 Identify the need of cache and virtual memory.
Assessment Pattern
S.No
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
20
10
10
10
2
Understand
20
30
30
30
3
Apply
30
30
30
30
4
Analyze /Evaluate
20
20
20
20
5
Create
10
10
10
10
Total
100
100
Remember
1. Define Response time and Throughput.
2. State Amdahl‘s law.
3. What is the principle of locality?
4. Comment the type and size of operands.
5. What is meant by loop unrolling?
6. What are the different types of control flow instructions?
7. What are the various addressing modes?
8. Specify the CPU performance equation.
9. What are the registers used for MIPS processors.
10. What is meant by Instruction Level Parallelism?
11. What is cache consistency?

100
100
159
Understand
1. Differentiate 1-bit and 2-bit branch predictors.
2. What are limitations of ILP?
3. What are the various methods available for static branch prediction?
4. What are the challenges involved in parallel processing?
5. What are the performance differences between write update and write invalidate protocols?
6. What is a directory protocol?
7. What is multiprocessor cache coherence?
Apply
1. Suppose that we are considering an enhancement to the processor of a server system used for web serving.
The new CPU is 10 times faster on computation in the web serving application than the original processor.
Assuming that the original CPU is busy with computation 40% of the time and is waiting for I/O 60% of the
time. What is the overall speedup gained by incorporating the enhancement? Fraction enhanced = 0.4
Speedup enhanced=10
2. Draw the state diagram for 2-bit branch prediction.
3. How loop unrolling and pipeline scheduling can be used with static multiple issue?
Analyze
1. Compare Pentium III and Pentium IV processors.
2. Compare Tomasulo‘s algorithm and hardware based speculation
Evaluate
1. Suppose if we want to achieve a speedup of 80 with 100 processors. What fraction of the original
computation can be sequential?
2. Assume that the hit time of a two-way set-associative first-level data cache is 1.1 times faster than
a four-way set-associative cache of the same size. The miss rate falls from 0.449 to .044 for an 8
KC data cache. Assume a hit is 1 clock cycle and that the cache is the critical path for the clock.
Assume the miss penalty is 10 clock cycles to the L2 cache for the two-way set associative cache
and that the L2 cache does not miss. Which has the faster average memory access time?
Create
1. Case study on: Simple, Bus-based Multiprocessor
2. Case study on: Snooping Protocols for a Switched Network.
Unit I
Fundamentals of Computer Design
Introduction-measuring and reporting performance- Quantitative principles of computer design-Instruction set
principles and examples- classifying instruction set architectures-memory addressing- type and size of operands.
9 Hours
Pipelining concepts
Unit II
Instruction Level Parallelism and its Exploitations
Instruction Level Parallelism :Concepts and challenges – overcoming data hazards with dynamic scheduling –
examples- reducing branch costs with prediction- hardware based speculation - Exploiting ILP with dynamic
scheduling, multiple issues and speculation -Limitations of ILP.
9 Hours
Software speculation
Unit III
Instruction Level Parallelism with Software Approaches
Basic compiler techniques for exposing ILP- Exploiting ILP with multiple issues and static scheduling – Advanced
techniques for Instruction delivery and speculation- Cross cutting issues: Hardware versus Software issues,
Multithreading: Using ILP support to exploit Thread-level parallelism, Intel Pentium IV architecture.
9 Hours
MIPS architecture
160
Unit IV
Multiprocessors and Thread Level Parallelism
Symmetric shared memory architectures-performance of symmetric shared memory multiprocessors – Distributed
shared memory architectures-synchronization- Models of memory consistency.
Software and hardware multithreading
9 Hours
Unit V
Memory Hierarchy Design
Eleven advanced optimizations of cache performance- Memory technology and optimizations- protection - memory
hierarchies- disk storage – real faults and failures – I/O performance- Reliability measures.
Intel Multi-core architecture
9 Hours
Total: 45 Hours
Textbook(s)
John L. Hennessey and David A. Patterson,Computer Architecture: A Quantitative Approach, Morgan
Kaufmann - Elsevier, 2007
Reference(s)
1. Hesham El-Rewini and Mostafa Abd-El-Barr, Advanced Computer Architecture and Parallel Processing,
Wiley Series on Parallel and Distributed Computing, 2005
2. D. Sima, T. Fountain and P. Kacsuk, Advanced Computer Architectures: A Design Space Approach,
International Computer Science Series-Addison Wesley, 2000
3. Kai Hwang Advanced Computer Architecture: Parallelism, Scalability, Programmability Tata McGraw Hill,
2001
4. Kain, Advanced Computer Architecture, Prentice Hall of India, 2007
11Z002 PARALLEL PROCESSING
3 0 0 3.0
Objective(s)
 To understand the technologies enabling parallel processing.
 To study the different parallel processing applications.
 To study the different parallel processing Processors.
Program Outcome(s)
b) Apply their knowledge and skills to succeed in a computer science career and/or obtain an advanced degree
Course Outcome(s)
 Illustrate the working principles of Parallel Processing.
 Demonstrate the concept of Interconnection Networks.
 Determine the performance of Multiprocessor Architecture.
Assessment Pattern
S.no
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
10
10
10
10
2
Understand
30
30
30
30
3
Apply
30
30
30
30
4
Analyze /Evaluate
20
20
20
20
5
Create
10
10
10
10
Total

100
100
100
100
161
Remember
1. What is Parallelism?
2. What are the advantages of Pipelining?
3. Why do we need Arithmetic Pipelines?
4. What is SIMD?
5. What is Multiprocessing?
6. What are the advantages of Vector Processing?
Understand
1. Discuss the concept of Interconnection Networks.
2. Classify the Multiprocessor Scheduling Strategies.
3. Describe the concept of System Deadlocks and Protection.
4. Identify the Parallel Algorithms for Array Processors.
5. How to avoid System Deadlocks?
Apply
1. Demonstrate the Multiprocessor Operating Systems.
2. Illustrate the types of Pipelined Computers.
3. Sketch the System Deadlocks functions.
4. Demonstrate the Parallel Computer Structures.
Analyze / Evaluate
1.
2.
3.
Create
1.
Compare various types of SIMD Array Processor.
Discriminate the overview of Interprocess Communication Mechanisms.
Differentiate CISC and RISC.
Write the SIMD Interconnection Networks.
Unit I
Introduction to Parallel Processing
Evolution of Computer Systems – Parallelism in Uniprocessor Systems – Parallel Computer Structures –
Architectural Classification Schemas – Parallel Processing Applications.
9 Hours
Input Output Subsystems
Unit II
Pipelining and Vector Processing
Pipelining –An Overlapped Parallelism – Instruction and Arithmetic Pipelines – Principles of Designing Pipelined
Processors – Vector Processing Requirements.
9 Hours
Recent vector processors
Unit III
Structures and Algorithms for Array Processors
SIMD Array Processors – SIMD Interconnection Networks – Parallel Algorithms for Array Processors – Associative
Array Processing.
9 Hours
SIMD Computers
Unit IV
Multiprocessor Architecture and Programming
Functional Structures – Interconnection Networks – Parallel Memory Organizations – Multiprocessor Operating
Systems – Operating system requirements.
Mainframe Multiprocessor Systems
9 Hours
Unit V
Multiprocessing Control and Algorithms
Interprocess Communication Mechanisms – System Deadlocks and Protection – Multiprocessor Scheduling
Strategies – Stochastic Scheduling Models.
VLSI Computing Structures
9 Hours
Total: 45 Hours
162
Textbook(s)
1. Kai Hwang and Feye A Briggs, "Computer Architecture and Parallel Processing", Tata McGraw Hill, New
Delhi, 2001
Reference(s)
1. Michael J Quinn, "Parallel Computing Theory and Practice", McGraw Hill, Second edition, Singapore, 2003
2. Seyed H Roosta. "Parallel Programming and Parallel Algorithms", Springer Series. New York.2001
3. Barry Wilkinson, "Parallel Programming‖, Pearson Education, USA, 2002
11Z003 GRID AND UTILITY COMPUTING
3 0 0 3.0
Objective(s)
 To understand the perception of grid and utility computing
 To know the application of grid computing
 To understanding the technology and tool kits to facilitated the grid and utility computing
Program Outcome(s)
b) Apply their knowledge and skills to succeed in a computer science career and/or obtain an advanced
degree.
computing works under given constraints
f) Organize and maintain the information of an organization
Course Outcome(s)
 Basic knowledge for OS, file systems and distributed systems
 Programming languages for implementation in grid computing
 Learning and applying different grid computing technique
 Analyze the performance of grid and utility computing
Assessment Pattern
S.no
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
10
10
10
10
2
Understand
30
30
30
30
3
Apply
30
30
30
30
4
Analyze /Evaluate
20
20
20
20
5
Create
10
10
10
10
Total
100
100
100
100
Remember
1. Define grid computing
2. Define Virtual Organization
3. Define NASA Information Power Grid
4. What are the fundamental components of SOAP?
5. What are the necessary security and encryption required across all levels in Semantic Web?
6. What is meant by WS-Secure Conversation?
7. Define SOA interaction pattern
8. Define OGSI

163
9. What are the fundamental components of SOAP?
10. Give any four examples of Grid portals.
11. Define NMI
12.What are the basic principles of autonomic computing?
13. Define Web service architecture
14. Define the use case of online media and entertainment
15. Define Policy Abstraction
16. Define utility computing
17. What are the features of Grid Service Container?
18. What is Grid Service Wrapper?
Understand
1. Explain Legion and Nimrod-G middleware Architecture.
2. Explain Commercial Data Center that Drive the OGSA.
3. How Client-side Programming pattern is interacting with an OGSI grid service?
4. How XML web service messages are packaged and enveloped?
5. Explain the relationship between Web Service and Grid Service.
6. Explain Grid Architecture layer and its relationship
Apply
1. Justify the role of any two organizations involved in the field of usage of grid for medical/physics application.
2. Map a computational grid to its analogue in real world.
3. How are real and abstract IT resources modeled and managed in OGSA?
Analyze / Evaluate
1. How does grid computing differ from cluster computing, P2P computing and desktop computing?
2. How XML messages are packaged and enveloped in a web service.
3. What is the purpose of OGSI? Describe the ports and interfaces defined in OGSI along with its inheritance
hierarchy.
Create
1. Write about remote execution of Condor-G on Globus managed resource using Globus job Manager.
Unit I
Introduction
Evolution of grid computing paradigm – Distributed, High Throughput, High Performance, P2P, Cluster, Grid,
Cloud, Grid vs Supercomputers, Definition of grid computing and utility computing, Dynamic Virtual organization,
scope, benefits, terms and concepts, Grid computing organizations and their role, grid topologies, applications, Types
of grids – data, computational, service grids.
9 hours
Grid applications
Unit II
Grid Architecture and platforms
Components of a grid, Evolution of grid computing - layered grid architecture –Service architecture – Grid
and web services, OGSA framework, OGSI- Port Type, service data elements, GSR, GSH, grid service life
cycle - WSRF
9 hours
Grid computing road map
Unit III
OGSA services
Infrastructure services, execution management services, selection services, data services, resource management
services, security services, information services
9 hours
Web Service Interoperability and the role of the WS-I Organization
164
Unit IV
Utility Computing
Computing as utility - cloud computing - Properties & Characteristics - Service models – Deployment models –
Virtualization.
9 hours
Case studies in cloud computing: costing policies
Unit V
Case studies - GT4
Case study – GT4- data management, resource management, information services, architecture, GT4 software
requirements- OGSA, WSRF and GT4 – Creation of a sample web service in GT4.
9 hours
OGSI.NET Middleware Solutions
Total: 45 Hours
Textbook(s)
1. Chitra A, Grid Computing, Sams Publications, 2010
2. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate
Online, Que Publishing, August 2008
Reference(s)
1. Joshy Joseph & Craig Fellenstein, Grid Computing, Pearson/PHI PTR-2008
2. Ahmar Abbas, Grid Computing: A Practical Guide to technology and Applications, Charles River media –
2003
3. P Venkata Krishna, M Rajasekara Babu, V saritha, Principles of Grid Computing, Anne Books, 2010
11Z004 EMBEDDED SYSTEMS
3 0 0 3.0
Objective(s)
 To understand the purpose and categories of embedded systems
 To learn the architecture of embedded systems
 To understand hardware and software aspects of embedded systems
Program Outcome(s)
b) Apply their knowledge and skills to succeed in a computer science career and/or obtain an advanced
degree.
Course Outcome(s)
 Ability to customize peripherals for embedded microprocessors
 Diagnose architecture of embedded processors, microcontrollers, and peripheral devices
 Analyze the performance of embedded programs
Assessment Pattern
S.no
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
10
10
10
10
2
Understand
30
30
30
30
3
Apply
30
30
30
30
4
Analyze /Evaluate
20
20
20
20
5
Create
10
10
10
10
Total
100
100
100
100

165
Remember
1. Define an Embedded system
2. What are the typical characteristics of an embedded system?
3. What are the main components of an embedded system?
4. Define embedded microcontroller
5. Define device driver
6. Define bus
7. What are the classifications of I/O devices?
8. Give some examples for serial input I/O devices.
9. List the characteristics of asynchronous communication
10. What are the features of SPI?
11. Define software timer
12. Define RTC
13. Define RTOS
14. Define task and task rates
15. Define CPU scheduling
Understand
1. Explain the applications of each type of embedded system.
2. Explain the internal serial communication devices.
3. How is Vx Works TCB helpful for tasks?
4. Compare user threads and kernel threads.
5. Write the syntax for function pointer.
6. Give the needs for memory management.
7. How does an RTOS semaphore protect data?
Apply
1. Justify the need for IDE in an Embedded Architecture.
2. Tabulate program elements: Macros and Functions and their uses.
3. How does an RTOS semaphore protect data? Explain by giving example.
Analyze / Evaluate
1. Formulate the functions of a typical parallel I/O interface.
2. How will you design a application to create a Smart Card in detail
3. Explain the scheduler in which RTOS insert into the list and the ready task for sequential execution in a
co-operative round robin model.
Create
1. Construct the basic system of an Video Accelerators
Unit I
Introduction to Embedded Systems
Definition and Classification – Overview of Processors and hardware units in an embedded system – Software
embedded into the system – Exemplary Embedded Systems – Embedded Systems on a Chip (SoC) and the use of
VLSI designed circuits.
9 hours
Components in an Exemplary SoC-Smart Card
Unit II
Devices and Buses for Devices Network
I/O Devices - Device I/O Types and Examples – Synchronous - Iso-synchronous and Asynchronous Communications
from Serial Devices - Examples of Internal Serial-Communication Devices - UART and HDLC - Parallel Port
Devices – Sophisticated interfacing features in Devices/Ports- Timer and Counting Devices - ‗I2C‘, ‗USB‘, ‗CAN‘
and advanced I/O Serial high speed buses - ISA, PCI, PCI-X.
9 hours
Advanced Parallel High Speed Buses
Unit III
Programming Concepts and Embedded Programming In C, C++
Programming in assembly language (ALP) vs. High Level Language - C Program Elements, Macros and functions -
166
Use of Pointers - NULL Pointers - Use of Function Calls – Multiple function calls in a Cyclic Order in the Main
Function Pointers – Function Queues and Interrupt Service Routines Queues Pointers – Concepts of embedded
programming in C++ - Objected Oriented Programming – Embedded Programming in C++, ‗C‘ Program compilers –
Cross compiler.
9 hours
Optimization of memory codes
Unit IV
Real Time Operating Systems – Part - 1
Inter Process Communication and Synchronisation of Processes, Tasks and Threads: Problems of Sharing data by
multiple tasks and routines – Inter Process Communications using Signals. Operating System Services - I/O
Subsystems – Interrupt Routines in RTOS environment - RTOS Task scheduling models, interrupt latency and
response times of the tasks as performance metrics.
9 hours
Precedence Assignment in the Scheduling Algorithms
Unit V
Real Time Operating Systems – Part - 1
Study of Micro C/OS-II and Vx Works or Any other popular RTOS – RTOS System Level Functions – Task Service
Functions – Time Delay Functions – Memory Allocation Related Functions – Semaphore Related Functions –
Mailbox Related Functions – Queue Related Functions – Case Studies of Programming with RTOS – Understanding
Case Definition – Multiple Tasks and their functions – Creating a list of tasks – Functions and IPCs – Exemplary
Coding Steps.
9 hours
Embedded system for a smart card
Total: 45 Hours
Textbook(s)
1. Raj kamal, Embedded Systems Architecture, Programming and Design, TATA McGraw-Hill, 2008
Reference(s)
1. Michael J. Pont, Embedded C, Pearson Education, 2007
2. Steve Heath, Embedded System Design, Elsevier, 2005
3. Wayne Wolf, Computers as Components; Principles of Embedded Computing System Design – Harcourt
India, Morgan Kaufman Publishers, 2008
11Z005 REAL TIME OPERATING SYSTEMS
3 0 0 3.0
Objective(s)
 To understand the fundamentals of real time operating systems
 To learn about the components and implementations of RTOS
 To know about the Commercial operating systems
Program Outcome(s)
Course Outcome(s)
 Implement the functions and concepts
 Identify potential applications
 Select appropriate techniques based on the domain and constraints
Assessment Pattern
S.no Bloom’s Taxonomy
(New Version)
1
Remember
2
Understand
3
Apply
4
Analyze /Evaluate
5
Create
Total
Remember
1.
2.
3.
4.
5.
6.
Test I
Test II
10
30
30
20
10
100
10
30
30
20
10
Model
Examination
10
30
30
20
10
End-Semester
Examination
10
30
30
20
10
100
100
100
167
Define real time operating systems
Name few commercial real time operating systems.
What is the need for RTOS?
Define priority inversion
Name the types of instruction sets in ARM-V5 architecture.
State the necessary conditions for deadlock occurrence.
Understand
1. Discuss the various processor modes in ARM-V5 architecture.
2. Illustrate the SROS solutions for deadlock avoidance with an example.
Apply
1.
2.
Identify the occurrence of deadlock inside a system using a resource allocation graph.
Examine the performance of interrupt handling mechanisms in RTOS.
Analyze / Evaluate
1. Compare the timer support implementation in SROS with RTOS.
2. Analyze the efficiency of processor scheduling mechanisms using basic rate monotonic analysis
method.
Create
1. Compile the SROS Solution to the Unbounded Priority Inversion problem.
2. Write a case study on exception handling mechanisms in VRTX.
Unit I
Introduction
RTOS and Need for it. Mutual exclusion-Thread synchronization and scheduling: Mutex implementation in SROSInterrupts handling in RTOS-Interrupt handler in SROS- Creation of thread in RTOS and SROS-RTOS initialization
and starting.
9 Hours
SROS Initialization and starting
Unit II
Implementations and Timer Support
List node-Memory management of list nodes in SROS- Insertion and deletion of list nodes in the linked lists used in
SROS. Semaphore: Semaphore implementation in SROS. Mailbox: Mailbox implementation in SROS, Timer
Support: Timer Support implementation in SROS and RTOS.
9 Hours
Example Application using SROS

168
Unit III
Priority Inversions and Deadlocks
Priority Inversions: Bounded Priority Inversion-Unbounded Priority Inversion-Solution to the Unbounded Priority
Inversion-SROS Solution to Priority Inversion. Deadlocks: Simple examples of deadlock scenarios-Resource
allocation graph-Necessary conditions for deadlocks-Dealing with deadlocks-SROS solutions for deadlock avoidance
- Schedulability of a real-time application: Basic Rate Monotonic Analysis-Extended Rate Monotonic Analysis.
9 Hours
Other Components of RTOS
Unit IV
ARM-V5 Architecture
Processor modes- Exceptions-ARM Instruction set – Condition Field- Affecting the condition flags-Notations used in
the descriptions – Data Processing instructions – Multiply instructions – Miscellaneous Arithmetic instructionsStatus register instructions – load and store instructions -Load and Store Multiple instructions – Semaphore
instructions.
9 Hours
Exception –Generating instructions and Branch instructions
Unit V
Commercial Real-Time Operating Systems
Features of real-time operating systems - Unix as a real-time operating systems – Unix based real-time operating
systems- Windows as a real-time operating systems – POSIX – A survey of contemporary real-time operating
systems.
9 Hours
Benchmarking real-time Systems
Total: 45 Hours
Text Book
1.
1. Chowdary Venkateswara Penumuchu, Simple Real-time Operating System: A Kernel Inside View for a
Beginner, Trafford Publising, 2007
Reference(s)
1. Jean J. Labrosse, MicroC OS II: The Real Time Kernel, Second Edition, CMP Books, 2002.
2. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Concepts, Eighth edition, John
Wiley and Sons Inc., 2009.
3. J. Archer Harris, Schaum's Outline of Theory and Problems of Operating Systems,
Mc-Graw Hill Companies, Inc., 2002.
4. Dr.Rajib Mall, Real –Time Systems: Theory and Practice, Pearson Education, 2006.
11Z006 HUMAN COMPUTER INTERACTION
3 0 0 3.0
Objective(s)

To understand the fundamentals of human computer interaction

To design various models for interaction.

To learn the design principles involved in the HCI patterns
Program Outcome(s)
c) Demonstrate an ability to use techniques, skills, and modern computing tools to implement and
organize computing works under given constraints.
d) Demonstrate problem solving and design skills including the ability to formulate problems and
their solutions, think creatively and communicate effectively
169
Course Outcome(s)
 Apply existing models and algorithms
 Select appropriate techniques based on the particular characteristics of the domains and
applications under consideration.
Assessment Pattern
S.no
Bloom’s Taxonomy
(New Version)
1
Remember
2
Understand
3
Apply
4
Analyze /Evaluate
5
Create
Test I
Test II
10
30
30
20
10
10
30
30
20
10
Model
Examination
10
30
30
20
10
Total
100
100
Remember
1. Name few display devices for 3D interaction.
2. List the uses of non-speech sounds.
3. What is meant by recency effect?
4. State the goals of evaluation techniques.
5. Define the methods for measuring memory capacity
Understand
1. Explain the different types of memory with its functions.
2. Elaborate on text entry devices.
3. Discuss about the various Linguistic models.
4. Describe the elements of WIMP interface.
Apply
1 Illustrate the various interaction styles with an example.
2. Show the role of usability engineering in an interactive system design.
100
End-Semester
Examination
10
30
30
20
10
100
Analyze / Evaluate
1. Compare the various types of reasoning methods.
2. Distinguish between simulation and prototype.
3. Examine the steps involved in the expert analysis with an example.
Create
1. Design an experiment to test whether adding color coding to an interface will improve accuracy.
2. Construct a cognitive walkthrough example for the video remote control design.
Unit I
Foundations
The Human – Input-output channels – Human Memory – Thinking – Emotions – Psychology and design of
interactive systems; Computer – Text entry devices- Positioning, Pointing & drawing – Display devices for Virtual
reality and 3D interaction.
9 Hours
Memory, Processing and networks.

170
Unit II
Interaction
Introduction- Models of introduction, Frameworks and HCI, Ergonomics, Interaction styles, Elements of the WIMP
interface, Interactivity. Interaction Design Basics: The process design, User focus, Scenarios, Navigation design,
Screen design and layout, Iteration and prototyping.
9 Hours
Paradigms for interaction
Unit III
Software Process and Design Rules
HCI in the software process: Introduction, The software life cycle, Usability engineering, Iterative design and
prototyping. Design Rules: Introduction- Principles to support Usability - Standards – Guidelines -Golden rules.
9 Hours
HCI patterns
Unit IV
Implementation Support and Evaluation Techniques
Implementation support – Windowing system elements – Using tool kits – User interface management ; Evaluation
techniques – Goals of Evaluation – Evaluation through expert analysis – Evaluation through User Participation Universal design principles- Multimodal interaction
9 Hours
Designing for diversity
Unit V
Models and Theories
Cognitive models – Goal & task hierarchies – Linguistic models – Physical and device models – Cognitive
architectures; Communication and collaboration Models – Face-to-Face communication – Conversation – Text based
communication – Group working;
9 Hours
Task analysis – Knowledge based analysis – ER based techniques
Total: 45 Hours
Text book(s)
1. Alan Dix , Janet Finlay, Gregory D.Abowd, Russell Beale, Human Computer Interaction, Third Edition,
Reference(s)
1. Julie A. Jacko and Andrew Sears, The human-computer interaction handbook: fundamentals, evolving
technologies, and emerging applications, Lawrence Erlbaum Associates, Inc., Publishers, 2003
2. Lloyd P. Rieber, Computers, Graphics, & Learning, Brown & Benchmark publishers, 2005
3. Yvonne Rogers, Helen Sharp, Jenny Preece, Interaction Design: beyond human-computer interaction,
Second Edition, John-Wiley and Sons Inc., 2009
4. Dov Te‘eni, Jane Carey, Ping Zhang, Human-Computer Interaction: Developing Effective Organizational
Information Systems, John-Wiley and Sons Inc., 2007
11Z007
MACHINE LEARNING TECHNIQUES
3 0 0 3.0
Objective(s)
 To understand the basic concepts and models of machine learning.
 To know the applications of machine learning models, paradigms and techniques
 To learn the concepts of training procedures
171
Program Outcome(s)
d) Demonstrate problem solving and design skills including the ability to formulate problems and
their solutions, think creatively and communicate effectively.
Course Outcome(s)
 Apply existing models and algorithms
 Select appropriate techniques based on the domain and constraints
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze /Evaluate
Create
Total
Test I
Test II
10
30
30
20
10
100
10
30
30
20
10
Model
Examination
10
30
30
20
10
End-Semester
Examination
10
30
30
20
10
100
100
100
Remember
1. What is reinforcement learning?
2. Name the dimensionality reduction techniques.
3. Enumerate the ways for choosing number of clusters.
4. Define Perceptron
5. Mention the drawbacks of k-Means clustering.
Understand
1. Explain the applications of machine learning.
2. Discuss the steps involved in the principal component analysis.
3. Describe the kernel dimensionality reduction techniques.
Apply
1. Illustrate the procedure for rule extraction from trees with an example.
2. Examine the basic problems of hidden markov models and provide solutions.
Analyze / Evaluate
1. Distinguish between classification trees and regression trees.
2. Analyze the training procedures of multilayer perceptrons with an example.
Create
1. Derive the update equations for an multilayer perceptrons with two hidden layers.
2. Write an expression for the likelihood p(D|a, b).

172
Unit I
Introduction
Machine Learning-Examples of machine learning Applications- Learning Associations – Classifications-RegressionUnsupervised learning - Reinforcement Learning . Bayesian Decision Theory – Introduction-Classification-Losses
and Risks-Discriminant Functions-Utility Theory – Bayesian Networks.
9 Hours
Association Rules
Unit II
Parametric Methods , Multivariate Methods and Dimensionality Reduction
Parametric Methods- Introduction-Maximum Likelihood estimation - Evaluating an Estimator: Bias and VarianceBaye‘s Estimator-Parametric Classification- Model Selection Procedures . Multivariate Methods – Multivariate data
– Parameter Estimation- Estimation of Missing Values-Dimensionality Reduction: Introduction-Subset SelectionPrincipal Component Analysis- Factor Analysis.
9 Hours
Multidimensional Scaling
Unit III
Clustering and Decision Trees
Clustering: Introduction – K-Means Clustering – Expectation-Maximization Algorithm-Supervised Learning after
clustering – Hierarchical Clustering – Choosing the number of Clusters. Decision Trees : introduction – Univariate
trees- Classification trees – regression Trees - Pruning – Rule Extraction from Trees.
9 Hours
Multivariate trees
Unit IV
Multilayer Perceptrons and Kernel machines
Multilayer Perceptrons - Introduction- The Perceptron – Training a Perceptron – Learning Boolean functions –
Multilayer Perceptrons – MLP as a Universal Approximator – Back propagation algorithm-Training procedures.
Kernel Machines: Introduction – Multiple Kernel Learning – Multiclass Kernel Machines-Kernel Machines for
Regression- One Class Kernel machines .
9 Hours
Kernel Dimensionality reduction
Unit V
Models and Learning Methods
Hidden Markov Models: Introduction – Discrete Markov Processes – Hidden Markov Models – Three Basic
Problems of HMMs. Graphical Models: Example graphical Models. Reinforcement learning: introduction – Single
state Case: k-Armed bandit –Elements of Reinforcement Learning – Model based Learning – Temporal Difference
learning.
9 Hours
Generalization and Partially Observable states
Total: 45 Hours
Text Book
1. Ethem Alpaydin, Introduction to Machine Learning, Second Edition, The Adaptive Computation and
Machine Learning Series, MIT press, 2010
Reference(s)
1. N.Sebe, Ira Cohen, Asthutosh Gorg, Thomas S. Huang, Machine Learning in Computer Vision, Springer,
2005
2. Stephen Marsland, Machine Learning: An algorithmic perspective, Chapman & Hall/CRC, Machine learning
& Pattern recognition series, 2009
3. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006
4. Matthieu Cord and Pádraig Cunningham, Machine Learning Techniques for Multimedia: Case Studies on
Organization and Retrieval, Springer, 2008
173
11Z008 XML AND WEB SERVICES
3 0 0 3.0
Objective(s)
 To understand the Web Service concepts and XML Technology.
 To study the functions of Distributed computing.
 To familiarize the various security in Web Service.
Program Outcome(s)
b) Apply their knowledge and skills to succeed in a computer science career and/or to obtain an advanced degree.
hands-on laboratory experiences that enhance the educational experience.
Course Outcome(s)
 Develop web based applications.
 Demonstrate the basics of web services.
 Design and build a web services.
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze/Evaluate
Create
Total
Test I
Test II
30
20
20
20
10
100
30
20
20
20
10
100
Model
Examination
30
20
20
20
10
100
End-Semester
Examination
30
20
20
20
10
100
Remember
1. What is HTML?
2. What are the differences between XML and HTML?
3. What are the advantages of XML?
4. How is XHTML better than HTML?
5. What is XHTML Validation?
6. How to create XSLT pages?
7. What are the advantages of XPointer?
8. What are web services?
9. What is SunONE?
10. List the steps involved in XML encryption
Understand
1. Discuss the overview of HTML and tools for creating CSS document.
2. Classify the XSLT elements.
3. Discuss syntactic different between HTML and XHTML.
4. Describe the concept of XML Path Language.
5. Identify the Transformation techniques.
6. Why do we need modular DTDs?
Apply
1. Write a CSS that makes all text three times larger than the base font and the font color is red.
2. Demonstrate the procedure to create an external DTD with an example.
3. Write the SOAP Encoding techniques.
4. Illustrate the types of XML signatures and cannibalization.
5. Write a DTD for mark statement of a student.

174
Analyze / Evaluate
1.
2.
3.
4.
Create
1.
2.
3.
Compare HTML, DHTML and XHTML.
Discriminate the overview of SOAP Communication.
Differentiate DTD and XML Schema.
Difference between SOAP and IIOP.
Create a HTML document using the following tags : <p>, <strong>, <img>, hyperlink and <hr>.
Develop a XML document using elements, attributes and CDATA section.
Create an application to implement the Library Management System using HTML and XML.
Unit I
Introduction
Introduction to Internet and WWW – Introduction to HTML – CSS - Creating Markup with XML - Document Type
Definition (DTD) – Attribute Types - Conditional Sections – Whitespace Characters.
9 Hours
XHTML and XForms
Unit II
XML Technology
Schemas – DOM - DOM Components - Simple API for XML (SAX)-XML Path Language - Extensible Stylesheet
Language Transformations (XSLT) - Introduction to Xlink, XPointer, XInclude and XBase.
9 Hours
Server Side Java Programming
Unit III
Web Services
Evolution of Distributed Computing – CORBA – Java RMI – Microsoft DCOM – Message Oriented Middleware Introduction to Web Services – Core Web Services Standards - Building Web Services Architecture – Web Services
Communication Models.
9 Hours
Developing Web Services Using J2EE
Unit IV
Developing Web Services Using SOAP
XML Based Protocols and SOAP - Anatomy of a SOAP message - SOAP Encoding - SOAP Message Exchange
Model – SOAP Communication - SOAP Security.
9 Hours
SOAP Binding for Transport protocols
Unit V
Web Services Security
Challenges of Securing Web Services – Rapid fire Cryptography - XML Encryption - XML Signature- Types of
XML Signature – Canonicalization – Implementations of XML Signature – XML key management specification.
9 Hours
Introduction to Sun ONE.
Total: 45 Hours
Textbook(s)
Deitel H M, Deitel P J, Nirto T R, Lin T M, XML How to Program, Pearson Edition, 2011
Reference(s)
1. Ramesh Nagappan , Robert Skoczylas and Rima Patel Sriganesh, Developing Java Web Services, Wiley
Publishing Inc., 2007
2. Steve Graham and Doug Davis, Building Web services with Java, Pearson education 2008
3. Charles F.Goldfarb and Paul Prescod, The XML Handbook, Pearson education asia, 2001
4. Etban carami, Web services Essential, O‘Reilly ,2006
175
11Z009 TCP / IP
3 0 0 3.0
Objective(s)
 To learn the Internetworking Concepts
 To understand the TCP/IP protocol suite
 To understand the interaction among the protocols in a protocol stack.
Program Outcome(s)
Course Outcome(s)
 Identify the technical issues related to TCP Design Techniques.
 Demonstrate the internetworking strategies.
 Design and build a wide area network using TCP/IP and router technologies.
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze/Evaluate
Create
Total
Test I
Test II
20
20
20
20
20
100
20
20
20
20
20
100
Model
Examination
20
20
20
20
20
100
End-Semester
Examination
20
20
20
20
20
100
Remember
1. Define internetworking
2. List the advantages of subnetting.
3. What are the advantages of ipv6?
4. What is Address Resolution Protocol?
5. List the advantages of Karn‘s algorithm.
6. What is Reverse Address Resolution Protocol?
7. What is the purpose of IP protocol?
8. Define routing
9. Define TCP
10. What are the services offered by TCP in application layer?
11. List the non-routable address spaces.
12. What is the purpose of TCP protocol?
13. Mention the fields in TCP header.
14. What is DNS?
15. What is UDP?
16. What is SMTP?
17. List the features of Firewall.
Understand
1. Identify the address class of 123.167.23.20 and 250.10.24.96.
2. Find the subnet, broadcast address and valid host range for the following:
a) 172.16.10.5
255.255.255.128
b) 172.16.10.33
255.255.255.224
c) 172.16.10.65
255.255.255.192
d) 172.16.10.17
255.255.255.252

3.
4.
5.
6.
7.
8.
9.
176
Explain the ARP package design.
The Network address is 192.168.10.0 and the Subnet mask is 255.255.255.252.
Find the following a) How many subnets?
b) How many hosts?
Discuss Internet Control Message Protocol.
Explain the services offered by TCP.
Describe the Karn‘s algorithm to avoid the problems of ambiguous
acknowledgement.
Explain Dynamic Host Configuration Protocol with an example.
Explain IPv6 message format.
Apply
1.
2.
3.
4.
5.
Convert the multicast IP address 230.43.14.7 to an Ethernet multicast physical address
Illustrate the header formats for the protocols in the TCP/IP protocol suite.
How does ARP resolve an IP address to an Ethernet MAC address?
Illustrate the concepts of IP subnet addressing and subnet masking, with an example
Draw the IP datagram header format.
Analyze
1. Differentiate OSI reference model and TCP/IP model.
2. Differentiate IPV4 and IPV6.
3. What is the difference between routable and non- routable protocols?
Evaluate
1. ―IP is an unreliable, best-effort, connectionless protocol.‖ Justify the statement.
2. Why does lost acknowledgement not particularly force the re-transmission of TCP data segment?
3. How does the name resolution take place in DNS?
Create
1. Write the characteristics of the User Datagram Protocol.
2. Write the characteristics of the Transmission Control Protocol.
3. Design a TCP client-server algorithm, where the client should prompt a user to type a line of text and send it
to the server. The server should print the text, number of characters in the text and the client‘s name on the
screen.
Unit I
Introduction
The TCP/IP internet – Internet Services – Internetworking Concept and Architectural Model – Classful internet
addresses – Mapping internet addresses to physical addresses(ARP) – Internet protocol : connectionless datagram
delivery(IPv4) – Forwarding IP Datagrams – Error and control messages(ICMP)
9 Hours
Congestion and datagram flow control
Unit II
Transmission Control Protocol
Classless and Subnet Address extension (CIDR) – Protocol layering – User Datagram protocol (UDP) – Reliable
Stream Transport Service (TCP) –Karn‘s algorithm and Timer Backoff.
9 Hours
TCP performance
Unit III
IP Routing
Routing Architecture: Cores, Peers, and Algorithms – Routing Between Peers (BGP) – Routing within AN
Autonomous System (RIP, OSPF) – Internet Multicasting.
9 Hours
Multicast Routing Protocols
177
Unit IV
Socket Interface
Private Network Interconnection – VPN Addressing and Routing – Network Address Translation - Client-Server
Model – The Socket Interface – Bootstrap and Auto configuration(DHCP) – The Domain Name System – Remote
Login and Desktop(TELNET,SSH).
9 Hours
Other Remote Access Technologies
Unit V
Protocols and firewall Design
File Transfer and access(FTP,TFTP,NFS) – Electronic Mail(SMTP,POP,IMAP,MIME) – World Wide Web(HTTP)
– Voice and Video Over IP(RTP,RSVP,QoS) – Network Management(SNMP): The level of Management Protocol –
Architectural Model – Message format – Internet Security and Firewall Design(IPSec,SSL) – A Next Generation
IP(IPv6).
Proposed IPv6 Address Space Assignment
9 Hours
Total: 45 Hours
Textbook(s)
1. Douglas E.Comer, Internetworking with TCP/IP Principles, Protocols and Architecture, Fifth Edition Vol.1
PHI, 2009
Reference(s)
1. Kevin R.Fall, W. Richard Stevens, TCP/IP Illustrated, Volume 1: The Protocols, 2/E Pearson Education,
2011
2. Forouzan, TCP/IP protocol suite, TMH, 2010
3. Dr.Sidnie Feit, TCP/IP, 2/ Education,TMH, 2008
11Z010 VISUAL PROGRAMMING USING VC++
3 0 0 3.0
Objective(s)
 To understand the concepts of windows programming.
 To study the concept of memory handling operations.
 To design the web based applications using VC++.
Program Outcome(s)
research.
organize computing works under given constraints.
solutions, think creatively and communicate effectively..
Course Outcome(s)
 Understand the uses of DLLs .
 Demonstrate the concepts of ActiveX controls.
 Identify the needs of multitask programming.
Assessment Pattern
S.No
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
20
20
20
20
2
Understand
20
20
20
20
3
Apply
20
20
20
20
4
Analyze/Evaluate
20
20
20
20
5
Create
20
20
20
20
Total
100
100
100
100

Remember
1. What is the top base class for MFC Framework?
2. Define application object
3. What is document-view architecture?
4. State the features of metafile.
5. What are the different types of metafile functions?
6. What are the various operations of virtual memory?
7. Specify the notation of playback hook.
Understand
1.
Classify the features of model and modeless dialog box
2.
List the various methods available for clearing data structures in the journal program
3.
State the challenges involved in launch operation of DLLs
4.
How to generate the container view class?
5.
What is meant by OLE?
Apply
1. Design an application for exporting a function from a Dynamic Linked Libraries.
2. Demonstrate the process for drawing anywhere on the screen using metafile graphics.
3. How to place a bitmap on the clipboard?
Analyze/ Evaluate
1. Compare the various CRedraw Class functions in metafile graphics.
2. How to capture the screen using mouse?
Create
1. Create an application for performing the multitasking operations using threads in VC++
2. Create an application for editor with the operations of reading the keys, deleting the characters
the data storage using VC++
178
and design
Unit I
Introduction to Visual Programming
C++ and windows-Hello Dlg-Creating the keys SDI Project-The Application Object-Main Window Object-The
Document Object-The View Object-Creating MDI program-Handling data in MDI-Coordinating MDI viewsScrolling MDI views- working with Multiple Menu and view types.
9 Hours
Simple window concepts
Unit II
Edit views, HTML Views and splitter windows
Rich text views-Form views-HTML views-Tree views-Splitter windows-Checkable Menu items-using submenusdisabling menu items-using menu accelerators-Bitmapped Menu items-modifying menu items at runtime-popup
menus-dockable toolbars- Status Bars.
9 Hours
Dialog boxes
Unit III
Metafile Graphics, Memory Handling and Internet
Screen capture-Metafiles-Overview of memory-memory functions-virtual memory-scanning process-memory
mapped files-HTTP protocol-FTP protocol-web browser.
9 Hours
Web browser control
Unit IV
Multitask Programming
Threads-multiple threads-Doubler DLLs-Shared memory in DLL- Journal program –keyboard hooks –containerCreating server- Creating ActiveX controls-subclass controls-ActiveX methods-Events.
9 Hours
Windows Registry
179
Unit V
Real-World Programming
Creating Editor-Serialization-Mouse support-Clipboard-printing from the editor program- printing header in each
program-using the registry-using the version resources.
9 Hours
Total: 45 Hours
Textbook(s)
Steve Holzner, Professional Visual C++ programming,Wiley India 2010
Reference(s)
1. Charles Petzold, ―Windows Programming‖, Microsoft press, 1996
2. David J.Kruglinski, George Shepherd and Scot Wingo, ―Programming Visual C++‖, Microsoft press, 1999
11Z011 UNIX INTERNALS
3 0 0 3.0
Objective(s)

To understand the architecture and data structures of Unix Kernel.

To know the concepts of Memory management and process management..

To learn the functions and implementations of various system calls.
Program Outcome(s)
Course Outcome(s)
 Identify the data structures for Unix Kernel.
 Describe the methods for managing a Buffer Cache.
 Illustrate the concept of Inter Process Communication
 Implement the various system calls for Unix OS.
Assessment Pattern
S.No
Bloom’s Taxonomy
Test I
Test II
(New Version)
1
Remember
30
30
2
Understand
30
20
3
Apply
20
30
4
Analyze/Evaluate
10
10
5
Create
10
10
Total
100
100
Remember
1. What is Kernel?
2. Define an Inode
3. Define Buffer cache
4. List the characteristics of a File System.
5. Define a Program
6. Define a Process
7. List the Services of Operating System.
8. List the contents of an executable file.

Model
Examination
20
20
30
10
20
100
End-Semester
Examination
20
20
30
10
20
100
9.
10.
11.
12.
13.
180
State the important fields of U area.
Define process state
Mention the types of states of a process.
Recall the syntax of read system call.
List the parameters used in write system call.
Understand
1. Describe the structure of Unix kernel.
2. Discuss the five scenarios of the kernel to allocate a buffer for a disk block.
Apply
1.
2.
3.
4.
Write an algorithm to implement file open system call.
Illustrate the concept of pipe system call with an algorithm.
Sketch the process state transition diagram.
Demonstrate the signals that are involved in process state transition.
Analyze / Evaluate
1. Differentiate User Mode and Kernel Mode.
2. Differentiate program and process.
3. Examine the fork system call algorithm with an example.
4. Compare Semaphore and Shared Memory Inter Process Communication mechanisms.
Create
1. Write an algorithm to convert a pathname into inode with an example.
2. Design an algorithm for process scheduling with its parameters.
Unit I
Kernel Data structures and Buffer Cache
History of Unix OS– System Structure- User Perspective- Operating System Services-User & Kernel ModesIntroduction to Kernel: Architecture –Introduction to system concepts. The Buffer Cache: Buffer Headers – Structure
of Buffer Pool- Scenarios for retrieval of a buffer- Advantages and Disadvantages of Buffer Cache.
9 Hours
Reading and writing disk blocks
Unit II
Files and System Calls for File System
Inode- Structure of a regular File- Directories-Conversion of pathname to an Inode- Super block –Inode ssignment to
a file- System calls for File System.
9 Hours
Allocation of Disk blocks
Unit III
Process Structure and Control
Structure of a process: Process states and transitions- Layout of System Memory-Context of a process- saving the
context- manipulation of process address space. Process Control: Process Creation- Signal.
9 Hours
Process Termination
Unit IV
Process Scheduling and Memory Management Policies
Process Scheduling: Scheduling-System calls for time and clock. Memory Management: Swapping – Demand
Paging.
9 Hours
Hybrid system with swapping and Demand Paging
181
Unit V
Drivers and Inter Process Communication
The I/O Subsystem: Driver Interfaces- Disk drivers-Terminal Drivers-Streams Inter Process Communication: Process
Tracing- System V IPC – Network Communications.
9 Hours
Sockets
Total: 45 Hours
Textbook(s)
Bach M.J. The Design of the Unix Operating System, Prentice Hall Of India, 2011
Reference(s)
1. Goodheart B. Cox J, The Magic Garden Explained, Prentice Hall of India, 1994
2. Leffler S.J., Mckusick M.K., Karels M.J. and Quarterman J.S., The Design and Implementation of the 4.3
BSD Unix Operating System, Addison Wesley, 1998
11Z012 INTERNET SECURITY
3 0 0 3.0
Objective(s)
 To introduce the fundamental techniques based on a TCP/IP and cryptography.
 To develop the foundations for analyzing the benefits of design options in secure networks and public key
infrastructures.
 To understand the disaster and potential solution.
Program Outcome(s)
organize
Course Outcome(s)
 Evaluate the commercial security products and its organizational policies.
 Analyze various security strategies.
 Identify the major security issues associated with Internet.
Assessment Pattern
S.No
Bloom’s Taxonomy
Model
End-Semester
Test I
Test II
(New Version)
Examination
Examination
1
Remember
10
10
10
10
2
Understand
30
30
30
30
3
Apply
30
30
30
30
4
Analyze/Evaluate
20
20
20
20
5
Create
10
10
10
10
Total
100
100
100
100
Remember
1. What is security policy?
2. Define security
3. What is denial of service attack?
4. What is distributed denial of service attack?
5. Define Electronic signature.
6. What are the important factors to be considered in overall security plan?
Understand
1. Classify the various attacks.
2. Explicate the concept of 'Incident handling' in a security plan relating to website.

3.
4.
5.
6.
7.
Apply
182
Discuss the types of virus.
Describe the various situations for the information leakage.
Explain the concept of protocol failures.
How does a protocol failure affect the security of a system?
Explain the various techniques for Stealing passwords.
1. Write the different strategies that can be used for securing the network.
2. Write about risk assessment, security policy and incident handling.
3. Demonstrate the different types of services given by application layer.
Analyze/ Evaluate
1. Compare symmetric and asymmetric key cryptography.
2. Compare the different types of services provided by application layer with respect to attack and protection of
individual services.
3. Differentiate active attacks and passive attacks.
Create
1. Generate a symmetric key using D-H algorithm for n=11and g=7.
2. Construct a simple columnar transposition technique by assuming the plain text and generate the
corresponding cipher text.
Unit I
The Internet and Security Review Process
The history of the internet-TCP/IP: The nails of the internet-Introduction to security review process -Review the state
of the business-Analyze the technology being used- Risk analysis- Plans and policies.
9 Hours
Implementation of a secure network
Unit II
Cryptography and Secure Networks
Cryptography: History-Key types-RSA: public and private key- PKI and business solutions -Secure Networks:
TCP/IP and OSI- Denial-of-service attacks-virtual private networks: point-to-point tunneling protocol, Layer 2
forwarding, Layer 2 tunneling protocol, IP security protocol- secure sockets layer.
9 Hours
Digital Certificate
Unit III
Protecting Intranet
Initial analysis of architectural requirements –Assessing the right type of firewall for enterprises-Firewall evaluation
guidelines- firewall product functional summaries-firewall buyer‘s assessment form-firewall vendors-SSL network
appliance overview-secure access.
9 Hours
Air gap-based filtering proxies
Unit IV
Authentication and Authorization,
Basics-Authentication-Authorization-smart cards – Public key infrastructure: PKI -Certificate Authority-certification
practice statements-certificate revocation list-key recovery-lightweight directory access protocol-public key
cryptography standards.
9 Hours
Public key infrastructure (X.509) standards
Unit V
Messaging Security and Disaster Recovery
Safe communication: messaging - junk mail- Risk analysis- Threats-technology security review- Disaster Recovery:
Introduction-incident handling requirements- incident handling processes- incident handling procedures- incident
handling team implementation.
9 Hours
Understand the issues and potential solution
Total: 45 Hours
183
Textbook(s)
Tim speed and Juanita Ellis, Internet Security-A jumpstart for Systems Administrators and IT Managers, Digital
press an imprint of Elsevier, 2006
Reference(s)
1. Kenneth Einar Himma, Internet Security-Hacking, Counter Hacking and Society, Jones and Bartlett
Publishers, 2007
2. William R.Cheswick, Steven M. Bellovin and Aviel D.Rubin, Internet Security-Repelling the Wily
hacker,2003
11Z013 FREE AND OPEN SOURCE SOFTWARE
3 0 0 3.0
Objective(s)
 To understand the basics of open source software.
 To gain the knowledge of working with Linux platform and different Linux distributions.
 To be familiar with different programming concepts in Linux.
 To understand the Linux administration.
Program Outcome(s)
b) Apply the knowledge and skills acquired to succeed in a computer science career and to pursue
higher studies.
d) Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize
e) Provide an excellent education experience through the incorporation of current pedagogical techniques and
Course Outcome(s)
 Able to install Linux operating system.
 Demonstrate the working of Linux commands.
 Ability to administer Linux.
 Configure different utilities in Linux.
 Develop programs using GTK, Python and Qt.
Assessment Pattern
S.no
Bloom’s Taxonomy
Test I
Test II
(New Version)
1
Remember
30
30
2
Understand
30
30
3
Apply
20
20
4
Analyze /Evaluate
10
10
5
Create
10
10
Total
Remember
1.
2.
3.
4.
5.

100
100
Model
Examination
30
30
20
10
10
End-Semester
Examination
30
30
20
10
10
100
100
Define FOSS
What is a log file?
How does an OS boots up?
How will you provide security of an operating system?
Mention some basic UNIX commands.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
Understand
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
Apply
1.
2.
3.
4.
5.
6.
What is a proxy server?
What is an XWindow?
What is the difference between client side and server side scripting?
What are the languages used for server side scripting?
What is the file system used in windows and linux?
Differentiate loader and linker.
What is a make file?
Why we go for source code versioning?
What type of security is provided in linux?
What is debugging?
What is the difference between static and dynamic linking?
What are graphical debuggers?
What is the use of awk?
What are the controls used in Qt programming?
Define localization
How to install a Linux distribution?
What are the basic commands in Linux?
How will you configure internet connection in a Linux system?
Draw and explain the X windows server architecture.
How to configure printer services in Linux?
What are the steps to create and manage users and groups in Linux?
How will you configure sound and display cards in linux?
Configure a web server using linux.
Set up file services using samba and NFS.
How will you set up proxy services in linux?
Explain the compiler collection tools in linux.
How will you implement source code versioning using tortoise SVN?
Explain debugging in linux.
Discuss about bash shell and its programming.
Explain about awk scripting.
How to configure a linux system with internet connection?
Write the steps add additional hardware to a machine having linux OS.
How will you connect a printer to a linux system and configure it?
What are the steps to access a printer connected to a windows machine from a linux machine by
Configuring Samba?
How to set up a firewall for a network using linux.
Install any Linux distribution.
Analyze
1.
Evaluate
1.
Create
1.
2.
3.
4.
5.
6.
Analyze the features of different linux distributions.
Evaluate the performance of linux OS with that of Windows OS.
Create users and groups in Linux and assign permissions to them.
Create a shell program to find if a number is even or odd.
Write a C program and compile it in a linux environment.
Create an application using Qt programming.
Create a window based application using GTK+ programming.
Create applications using python.
184
185
Unit I
Introduction
Introduction to Linux Operating System - Basic UNIX Commands - File Filters: File Related Commands - Piping Joining, awk and backup Commands - Processes in Linux: User Process and Terminal Handling.
9 Hours
Shell Programming
Unit II
Configuring Linux Services
Debian Linux Installation - Redhat Fedora Core Installation - Installing Apache: The Web Server - Samba Installation
and Configuration: File Sharing – Compiling from Sources – Installing - NFS - Installing SMTP Mail Server Installing Common Unix printing System.
9 Hours
Managing Printers
Unit III
Networks in Linux
Installing Squid Proxy and Firewalls - Users and Account Management: Configuration - Creating - Testing Removing - Allocating - System Logging: Logging - Accounting - Graphical Tools – Networks.
9 Hours
Services on Internet
Unit IV
Compiling and Debugging
Compiling C and C++ Programs under Linux - GNU Debugger: Debugger using GDB - Make: Syntax of makefiles Automake and Autoconf - Python: Invoking Python.
9 Hours
Control System
Unit V
Programming in Linux
Introduction to Perl - Ruby: OOPS through Ruby - Profiling - Calling UNIX System Calls from Ruby - X Windows
Architecture and GUI Programming: GTK Programming - Qt Programming.
Glade: Visual Designer Tool for GTK and GNOME
9 Hours
Total: 45 Hours
Textbook(s)
N. B. Venkateshwarlu, Introduction to Linux: Installation and Programming, B S Publishers; 2011. (An
NRCFOSS Publication)
Reference(s)
1. Matt Welsh, Matthias Kalle Dalheimer, Terry Dawson, and Lar Kaufman, Running Linux, O'Reilly
Publishers, December 2002, ISBN: 0-596-00272-6
2. Carla Schroder, Linux Cookbook, O'Reilly Cookbooks Series, November 2004, ISBN: 0-596-00650-3.
3. B.Mahendran, Understanding FOSS, GNU Developers, 2009
On-line materials
1. Open Sources: Voices from the Open Source Revolution, January 1999, ISBN: 1-56592-582-3.
2. URL: http://www.oreilly.com/catalog/opensources/book/toc.html.
3. The Linux Cookbook: Tips and Techniques for Everyday Use, Michael Stutz, 2001. URL:
http://dsl.org/cookbook/cookbook_toc.html.
4. The Linux System Administrators' Guide, Lars Wirzenius, Joanna Oja, Stephen Stafford, and Alex Weeks,
December 2003. URL: http://www.tldp.org/guides.html.
5. Using GCC, Richard Stallman et al. URL: http://www.gnu.org/doc/using.html.
6. An Introduction to GCC, Brian Gough. URL: http://www.network-theory.co.uk/docs/gccintro/.
186
7.
GNU Autoconf, Automake and Libtool, Gary V. Vaughan, Ben Elliston, Tom Tromey and Ian Lance Taylor.
URL: http://sources.redhat.com/autobook/.
8. Open Source Development with CVS, Karl Fogel and Moshe Bar. URL: http://cvsbook.red-bean.com/.
9. Advanced Bash Scripting Guide, Mendel Cooper, June 2005. URL: http://www.tldp.org/guides.html.
10. GTK+/GNOME Application Development, Havoc Pennington. URL:
http://developer.gnome.org/doc/GGAD/.
11. Python Tutorial, Guido van Rossum, Fred L. Drake, Jr., Editor. URL:
http://www.python.org/doc/current/tut/tut.html.
12. http://tortoisesvn.net/docs/release/TortoiseSVN_en/.
11Z014 MANAGEMENT INFORMATION SYSTEMS
3 0 0 3.0
Objective(s)
 To learn about the operating environment of an organization.
 To understand the roles of manager in an organization.
 To study about the different management techniques.
Program Outcome(s)
Course Outcome(s)
 Understand information systems
 Understand ethics in information society
 Analyze security for protecting information resources
Assessment Pattern
S.no
Bloom’s Taxonomy
(New Version)
1
Remember
2
Understand
3
Apply
4
Analyze /Evaluate
5
Create
Total
Test I
Test II
20
30
30
20
100
10
30
30
20
10
Model
Examination
10
30
30
20
10
End-Semester
Examination
10
30
30
20
10
100
100
100
Remember
1. What is an Information System?
2. What is the role of information systems function in a business?
3. What are business processes?
4. Define enterprise systems
5. List six reasons why information systems are so important for business today?
6. List five steps in ethical analysis.
7. Define malware
8. Define hacker
9. List application controls.
10. Define phishing
11. Define computer crime

187
12. List features of e-commerce
13. What is m-commerce?
14. Define Net marketplaces
15. Define knowledge management
16. Define an expert system
17. Define knowledge work systems
18. Define backward chaining
Understand
1. Describe the relationship between information systems and business processes.
2. Discuss current trends in computer hardware platform.
3. Discuss how internet has changed competitive forces and competitive advantage.
4. Classify the management challenges posted by strategic information systems.
5. Describe the organizational framework general controls.
6. Identify the roles of firewalls and antivirus software in promoting security.
7. Describe the relationship between security and control.
8. Paraphrase the examples of crime in computers.
9. Describe the roles played by web personalization.
10. Classify business trends and technology trends.
11. Describe the types of payment systems.
Apply
1.
2.
3.
4.
5.
6.
7.
8.
9.
Illustrate jetblue‘s response to the crisis. What solutions can be made and how to implement those solutions?
Explain how the internet and World Wide Web are related to other technology components of information
systems.
Explain why there is considerable organizational resistance to the introduction of information systems.
Illustrate Moore‘s law and law of mass digital storage.
Explain how Management Information System auditing promotes security and control.
Explain the function of risk assessment.
Explain how encryption protects information.
Explain knowledge management‘s value to business.
Employ internet business models for electronic commerce
Analyze / Evaluate
1. Compare the roles played by programmers, system analysts, chief information officer, chief security officer
and chief knowledge officer in information systems.
2. Distinguish between e-business and e-commerce.
3. Examine the network economics, declining communication costs and technology standards affecting IT
infrastructure.
4. Distinguish between fault tolerant and high availability computing.
5. Differentiate disaster recovery planning and business continuity planning.
6. Examine the role of encryption in public key infrastructure.
7. Compare data, knowledge, and wisdom and between tacit and explicit knowledge.
8. Judge the role of portals, wikis and social bookmarking in facilitating knowledge management.
Create
1. Formulate the management, organization, and technology issues that are encountered in setting up a website
for IPL teams.
2. Write management, technology factors for organizations to use software service providers for all their
software needs.
3. Develop a business continuity plan for a company.
Unit I
Introduction to Information Systems
Role of Information Systems in Business Today-Perspectives of Information Systems-Approaches to Information
Systems-Business Process and Information Systems- Types of Information Systems –Systems that span the enterprise
9 Hours
Information systems functions in business
188
Unit II
Information Systems, Organizations, Management and Strategy
Organizations and Information Systems – Impact of Information Systems – Ethics in an information society – IT
Infrastructure – Infrastructure Components – Hardware Platform Trends – Software Platform Trends
9 Hours
Moral dimensions of information systems
Unit III
Managing Data Resources
Organizing Data in Traditional File Environment - Database Approach to Data Management – Using Databases to
improve Business Performance and Decision Making
9 Hours
Data Warehouses
Unit IV
Security and Control
System Vulnerability – Business Value of Security and Control - Establishing Management Framework for Security
and Control – Technologies and Tools for Protecting Information Resources.
9 Hours
Ensuring Software Quality
Unit V
New IT Initiatives
Enterprise Systems – Supply Chain Management Systems- Customer Relationship Management Systems - Electronic
Commerce – Types of Electronic Commerce – M-Commerce – The Knowledge Management Landscape –
Enterprise-Wide Knowledge Management Systems.
9 Hours
E-Commerce Challenges
Total: 45 Hours
Textbook(s)
Kenneth C. Laudon, Jane Price Laudon and Rajanish Dass, Management Information Systems – Managing the
digital firm, Pearson Education, Asia, 2010
Reference(s)
1. Gordon Davis, Management Information System: Conceptual Foundations, Structure and Development,
Tata McGraw Hill, 2000
2. Turban, McLean and Wether, Information Technology for Management –Transforming Organisations in the
Digital Economy, John Wiley, 2008
3. Raymond McLeod and Jr. George P. Schell, Management Information Systems, Pearson Education, 2008
4. James O Brien, Management Information Systems – Managing Information Technology in the E-business
enterprise, Tata McGraw Hill, 2002
11Z015 SOFTWARE PROJECT MANAGEMENT
3 0 0 3.0
Objective(s)
 To provide a strong foundation on the concept of software project development
 To learn the concepts on project management and evaluation.
 To understand the principles of management and team organization
Program Outcome(s)
189
Course Outcome(s)
 Construct and realize software design or software deployment.
 Develop a budget, schedule or work plan.
 Understand the interdependencies between the processes of the system.
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze /Evaluate
Create
Test I
Test II
10
30
30
20
10
10
30
30
20
10
Model
Examination
10
30
30
20
10
End-Semester
Examination
10
30
30
20
10
Total
100
100
100
Remember
1. List the activities covered by software project management.
2. Define project
3. What are basic steps involved in building a program?
4. Recall the basic parameters of the software cost model?
5. List the three generations of software development?
6. Mention any three process available in improving software processes.
7. List the automatic code generators.
8. Delineate stake holders?
9. What are the Objective(s) of step wise project planning?
10. Define Control
Understand
1.
Identify major risks of payroll projects, and rank them according to their importance.
2.
Describe the factors needed for allocating a task.
3.
Clarify different motivation technique.
4.
Explain the concept of Leadership in detail.
5.
Elucidate the concept of selecting the right person for the job.
6.
Describe the steps to managing the contracts.
Apply
1. Illustrate the outline table of step wise project planning?
2. Write the formula used to calculate Return on investment & Net present value.
3. With neat sketch explain about Sequencing and scheduling Activities.
4. Draw the project control cycle model.
5. Demonstrate the process of collecting the data.
Analyze/ Evaluate
1. Distinguish between PFD and PBS.
2. Differentiate between Strategic Assessment and Technical Assessment?
3. Compare forward pass and backward pass.
4. Difference between ball charts and slip chart.
5. Compare and contrast product view and project view.
6. Differentiate Leaders and managers.

100
190
Create
1. Construct a comprehensive Project Plan by including Communication management, Risk, Assumptions,
Constraints, Issues and Activities.
Unit I
Introduction to Software Project Management
Project Definition – Contract Management – Activities Covered by Software Project Management –Plans, Methods
and Methodologies – Categorizing software projects-Management control-Traditional versus modern project
management- Overview of Project Planning.
9 Hours
Project success and Failure
Unit II
Program Management and Project Evaluation
Introduction- Program Management-Managing the allocation of resources within programmes - Strategic programme
management-Creating a programme - Aids to programme management-Benefits management-Evaluation of
individual projects- Cost Benefit Evaluation Techniques.
9Hours
Risk Evaluation
Unit III
Activity Planning
Objective(s) – Project Schedule – Sequencing and Scheduling Activities –Network Planning Models – Forward Pass
Backward Pass – Activity Float – Shortening Project Duration – Activity on Arrow Networks-Resource Allocation.
9 Hours
Identify the critical activities
Unit IV
Risk Management
Introduction-Categories of Risk –Framework for dealing with Risk–Risk Identification, Assessment, Planning,
Management-Evaluating Risks to the Schedule- Monitoring and control.
9 Hours
Software configuration management
Unit V
Managing People and Organizing Teams
Introduction – Understanding Behavior – Organizational Behaviour: A Background – Selecting The Right Person For
The Job – Instruction In The Best Methods – Motivation– The Oldman – Hackman Job Characteristics Model –
Working In Groups – Becoming a Team –Decision Making – Leadership – Organizational Structures – Stress –
Health and Safety
9 Hours
Case Study
Total: 45 Hours
Textbook(s)
Bob Hughes, Mikecotterell, Software Project Management, Tata McGraw Hill, 2012
Reference(s)
1.
2.
3.
Murali k. chemuturi, Thomas m cagly, Mastering software project management- best practices tools and
Techniques, j ross Publication, 2010
Richard E. Fairly, Managing and Leading Software projects, weilly and sons, 2009
Jalote, Software Project Management in Practice, Pearson Education, 2010
191
11Z016 SOFTWARE TESTING AND QUALITY ASSURANCE
3 0 0 3.0
Objective(s)
 To learn the various test design strategies.
 To understand the levels of testing and defect classes.
 To learn the testing and debugging policies with the types of review.
 To study about quality assurance plan.
Program Outcome(s)
Course Outcome(s)
 Determine the right testing tools for various applications.
 Develop a software plan.
 Demonstrate skills in designing and developing the software solutions.
 Identify the software standards for a software project.
Assessment Pattern
S.No
Bloom’s Taxonomy
Model
Test I
Test II
(New Version)
Examination
1
Remember
10
10
10
2
Understand
30
30
30
3
Apply
30
30
30
4
Analyze /Evaluate
20
20
20
5
Create
10
10
10
Total
100
100
Remember
1. Define software testing
2. What is the testing process?
3. Define unit testing
4. List the software testing guidelines.
5. What is meant by black box testing?
6. What is meant by white box testing?
7. Mention the testing internal controls.
8. What is life cycle testing?
9. What is meant by performance testing?
10. Name the different levels of testing.
11. Name some tasks in the test for software installation.
12. Mention the benefits of Software Validation.
13. What is acceptance testing?
14. What are the parts of workbench?
15. List the tasks in testing the changes in software.

100
End-Semester
Examination
10
30
30
20
10
100
192
16. Mention the tasks used for evaluating test effectiveness.
17. Define installation testing.
18. Define web based testing.
19. What is meant by stress testing?
20. What is meant by regression testing?
21. Define software quality assurance
22. Specify the need of automated tools in SCM.
Understand
1. Describe the challenges of risk identification process.
2. Explain the business perspective of testing.
3. Explain requirement phase testing.
4. Describe the various considerations in developing testing methodologies.
5. How to measure the overall test progress?
6. Describe the various white box testing techniques.
7. Explain the quality assurance plan.
8. Explain the components in software configuration audit.
9. Explain the principles of software defect prevention.
Apply
1. Demonstrate the procedure to implement unit testing for library management system.
2. How will you implement integration testing for railway management system?
3. Write the steps in software inspection.
Analyze/ Evaluate
1. Identify project and product risks.
2. Distinguish structural and functional testing
3. Differentiate pre-operational and post operational testing.
4. Identify challenges in the risk analysis process.
5. Examine the conditions while developing test data.
6. Compare verification and validation.
7. Distinguish between defect prevention and correction.
8. Justify the importance of software configuration management in software quality assurance.
Create
1. Construct a testing activity to expose defects in the interfaces.
2. Create functional testing process for bank ATMs.
3. Write the tasks for program phase testing.
4. Develop a sample test strategy for online ticket reservation.
5. Write the procedure for establishing software standards.
Unit I
Introduction
Building a Software Testing Environment – Minimizing Risks – Writing a policy – Building a structured
approach – Developing a test strategy – Building the software testing process – Software testing guidelines –
Customizing the software testing process.
9 Hours
Installing Software Testing Tools
Unit II
Organization and Development of Testing Approach
Overview of the software testing process – Organizing for testing – Developing Test plan – Profile the
software project – Understand project risk – Testing technique – Unit testing and analysis – Build and
Inspect Test Plan.
9 Hours
Software Development Methodologies
193
Unit III
Verification and Validation
Verification Testing - Requirement phase Testing – Design phase testing – Programming phase testing – Test
during requirement, Design and Programming Phase – Guidelines - Validation Testing - Build test data –
Execute Results - Record Test Results.
9 Hours
Testing Client/Server System
Unit IV
Implementation
Acceptance Testing and Operational Testing – Acceptance Testing – Define, Develop and Execute - Preoperational Testing - Test and Monitor – Post-Operational Testing – Develop and Test – Post Implementation
Analysis – Workbenches - Procedures.
9 Hours
Testing COTS and Contracted Software
Unit V
Quality Assurance
Quality management - Quality assurance plan- SCM support functions- SCM Tools- Establishing standards –
Guidelines- Basic inspection principles- Principles of software defect prevention- Process changes for defect
prevention -Defect prevention considerations.
Configuration accounting and audit
9 Hours
Total: 45 Hours
Textbook(s)
1. William E Perry, Effective Methods for Software Testing, John Wiley & Sons, USA, 2008
2. Watts S. Humphrey, Managing the software process, Addison Wesley, 2011
Reference(s)
1. Ali Behforooz, Frederick J Hudson, Software Engineering Fundamentals, Oxford University Press,
Newyork, 2003
2. Roger S Pressman, Software Engineering-A Practitioner‟s Approach, Mc Graw Hill International,
Singapore, 2010
3. Nina S Godbole ,Software Quality Assurance Principles and Practice , Narosa Publishing House Pvt. Ltd.,
2004
11Z017 E – COMMERCE
3 0 0 3.0
Objective(s)
 To know the basic concepts of E-Commerce.
 To know the approaches in business environment.
 To understand the role of ISP in an organization.
Program Outcome(s)
j) Function ethically and responsibly, and to remain informed and involved as full participants in our
194
Course Outcome(s)
 Understand various aspects of E-Commerce.
 Understand the role of Internet technology in E-Commerce.
 Understand the methodologies for online business dealings.
Assessment Pattern
S.No
Bloom’s Taxonomy
(New Version)
1
Remember
2
Understand
3
Apply
4
Analyze /Evaluate
5
Create
Test I
Test II
10
30
30
20
10
10
30
30
20
10
Model
Examination
10
30
30
20
10
Total
100
100
100
Remember
1. Define E-Commerce
2. Name the components of an effective business model.
3. List the major EDI standards used in E-Commerce.
4. State the generic business strategies required for achieving profitable business.
5. What is an application service provider?
6. What is reverse auction?
End-Semester
Examination
10
30
30
20
10
100
Understand
1. Discuss the unique features of E-commerce technology.
2. Explain the potential limitations of E-commerce.
3. Describe primary revenue modes used by E-commerce firms.
4. Classify the different type of information that can be shared through peer to peer sites.
5. Discuss the current and potential future impacts of E-commerce technology on publishing industry.
Apply
1. Illustrate the important factors that contribute to successful E-commerce site design.
2. Demonstrate the systematic approach for developing E-commerce website.
Analyze / Evaluate
1. Differentiate between internal and external value chains.
2. Compare disintermediation and reintermediation.
Create
1. Find certification authorities and compare features of each company‘s digital certificates.
2. Explain how cash transactions take place in E-Commerce. What special precautions should be taken by a
bank to ensure that a customer does not double spend the same electronic coins?
Unit I
Introduction
Electronic Commerce (E-Commerce) –Marks of Maturity – Drivers – Advantages & issues in E-Commerce –
Benefits & Limitations of the Internet – Role of E-Strategy- Value chain, integration and business model in ECommerce- World Wide Web: Making of the WWW- ISP- Web fundamentals.
9 Hours
Internet services and Languages

195
Unit II
Technology of E-Commerce
Internet Architecture: Network-Information Transfer-Network Hardware - Design considerations-Issues Intranets and
Extranets: Technical Infrastructure –Planning an Intranet – Email and Intranet - Hosting a Web Site: How ISPs work
– ISP structure and services - Choosing ISP Registering Domain name.
9 Hours
ASP infrastructure
Unit III
E- Strategies and Tactics
Building E-Presence – Internet Marketing : Online shopping- Internet Marketing Techniques – E-Cycle of Internet
Marketing –How to market Presence – Attracting and tracking customers – Customer relationship and Management Business-to-Business Commerce.
9 Hours
Business Challenge
Unit IV
Security Threats and Payment Systems
E- Security and USA Patriot Act: Security in Cyberspace- Designing for security – Security Protection and RecoveryEncryption: Basic Algorithm – Authentication and Trust- Managing Cryptographic Keys – Internet Security
Protocols and Standards.
9 Hours
Encryption Issues
Unit V
Managerial and Customer Related Issues
Getting Money: E-Money –Internet based payments – Types (Credit, Debit, Smart, Digicash, E-cash and E-wallet,
EFT) – Going Online: Life Cycle Approach- Business Planning and Strategizing Phase – Hardware, Software,
Security and Setup, Design, Marketing, Fulfillment, Maintenance & Enhancement Phase.
9 Hours
B2B and E-Payment
Total: 45 Hours
Textbook(s)
Elias M. Awad, Electronic Commerce- From the Vision to Fulfillment, Prentice Hall of India, 2009
Reference(s)
1. Kamesh K.Bajaj and Debjani Nag, E-Commerce the Cutting Edge of Business, Tata McGraw Hill, 2005
2. Ravi Kalakota and Andrew B.Whinston, Frontiers of E-Commerce, Pearson Education Asia, 2006
11Z018 ENTERPRISE COMPUTING
3 0 0 3.0
Objective(s)
 To understand the concepts of enterprise computing.
 To design an enterprise architecture.
 To construct and roll out the designed architecture as applicationnformation systems used
Program Outcome(s)
196
Course Outcome(s)
 Identify information systems used in the functional units of an enterprise.
 Analyze the integrated information systems used throughout an enterprise.
 Create and manage large-scale computing systems for an organization.
 Demonstrate skills to understand business environment.
Assessment Pattern
S.No Bloom’s Taxonomy Test
Model
End-Semester
Test II

(New Version)
Examination
I
Examination
1
Remember
10
10
10
10
2
Understand
30
30
30
30
3
Apply
30
30
30
30
4
Analyze /Evaluate
20
20
20
20
5
Create
10
10
10
10
Total
100
100
100
Remember
1. Mention a few Enterprise applications.
2. List the challenges in developing an Enterprise application.
3. What is Enterprise Analysis?
4. Define Business modeling.
5. Name the types of testing in enterprise Applications.
6. Define Demilitarized Zone (DMZ).
7. What are the advantages of Virtualization?
8. Define four domains of Enterprise Architecture.
9. What is middleware?
10. List the tools used for static & dynamic code analysis.
100
Understand
1. Classify the Enterprise applications.
2. Discuss a prescriptive technical architecture framework for raising a typical enterprise application.
3. Identify the various types of non functional requirements
4. Classify the testing methodologies.
5. Describe the Usability testing.
6. Identify the steps of Planning and Estimation.
7. Classify the enterprise application environments.
8. How is enterprise service bus associated with Service Oriented Architecture (SOA)?
9. Explain the different kinds of relationship among classes.
10. How code profiling helps in tuning the performance of an application?
Apply
1. Demonstrate the layer-by-layer construction of enterprise applications.
2. Illustrate the logical architecture of loan management system.
3. Elucidate the web services testing approach.
Analyze / Evaluate
1.
2.
3.
4.

Compare the JSF and Struts components of presentation layer.
Examine the use case specification elements of transport system.
Differentiate SOAP and REST based web services.
Distinguish between EJB 3.0 and spring framework.
197
Create
1.
2.
3.
Create use case specification for ―initiate loan‖.
Construct the business process modeling for loan management using its notation.
Design use case diagram for Airline ticket reservation system.
Unit I
Introduction
Enterprise Applications - Software Engineering Methodologies - Life Cycle of Raising Enterprise Applications Three Key Determinants of Successful Enterprise Applications
9 Hours
Measuring the Success of Enterprise Applications
Unit II
Incepting Enterprise Applications
Enterprise Analysis - Business Modeling - EM Bank—A Case Study - Requirement Elicitation and Analysis Actors and Use Cases - User Prototypes - Non-Functional Requirements - Requirements Validation
9 Hours
Planning and Estimation
Unit III
Architecting and Designing Enterprise Applications
Architecture, Views and Viewpoints - Enterprise Application—An Enterprise Architecture Perspective - Logical
Architecture - Technical Architecture and Design - Data Architecture and Design - Infrastructure Architecture and
Design
9 Hours
Architecture and Design Documentation
Unit IV
Constructing Enterprise Applications
Construction Readiness - Introduction to Software Construction Map - Constructing the Solution Layers - Code
Review - Static Code Analysis - Build Process and Unit Testing
9 Hours
Dynamic Code Analysis
Unit V
Testing and Rolling out Enterprise Applications
Testing Enterprise Applications - Enterprise Application Environments - Integration Testing - System Testing - User
Acceptance Testing
9 Hours
Rolling out Enterprise Applications
Total: 45 Hours
Textbook(s)
Anubhav Pradhan, B.Satheesha Nanjappa, Senthil Nallasamy and E.Veerakumar, Raising Enterprise
Applications : A Software Engineering Perspective, Wiley India Pvt Ltd, 2010
11Z019 SOFT COMPUTING
3 0 0 3.0
Objective(s)
 To provide an overview of soft computing techniques
 To provide a strong foundation of neural networks
 To introduce the applications of soft computing
198
Course Outcome(s)
 Demonstrate different types of networks and learning methods
 Analyze genetic algorithm and its applications
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze /Evaluate
Create
Test I
Test II
10
30
30
20
10
10
30
30
20
10
Total
100
100
Remember
1. What is Artificial Neural Network?
2. Define Perceptron.
3. State Hebbian Learning
4. List the applications of ANN.
5. Define fuzzification.
UnderstandDescribe basic model of ANN.
1. Explain rule based structure identification.
2. Describe the classification of genetic algorithms.
Apply
Model
Examination
10
30
30
20
10
End-Semester
Examination
10
30
30
20
10
100
100
1.Explain how back propagation network can be used for pattern classification with example.
Analyze/ Evaluate
1. Compare supervised and unsupervised learning algorithms.
2. Compare artificial neurons with biological neurons.
Create
1. Design a GA based algorithm to solve TSP. Give the drawbacks of GA.
Unit I
Artificial Neural Networks
Fundamental Concept – Basic Model of ANN – Terminologies of ANN- Supervised Learning Neural Networks:
Perceptions-Adaptive Linear Neuron-Back propagation Multilayer Perceptron- Unsupervised Learning Neural
Networks: Kohenen self-organizing Networks-Learning vector organization-Hebbian Learning
9 Hours
Hopfield networks

199
Unit II
Fuzzy Systems
Fuzzy systems and applications: fuzzy sets- fuzzy relations Defuzzification – fuzzy rule base and reasoning -- fuzzy
inference systems – Fuzzy Decision Making
9 Hours
Fuzzy control systems
Unit III
Neuro Fuzzy Modeling
Adaptive neuro Fuzzy inference systems : architecture – hyprid learning algorithm - classification and regression
trees- data clustering-rule base structure identification.
9 Hours
Neuro fuzzy controls
Unit IV Genetic Algorithms
Simple GA- basic operators and terminologies - Traditional vs Genetic Algorithm - Classification of Genetic
Algorithm- crossover and mutation- Holland classifier systems.
9 Hours
Genetic programming
Unit V
Applications of Soft computing
Neural network based Pattern Recognitions- Image Processing - Information Retrieval Systems-Share Market
Analysis-Natural Language Processing. – Genetic algorithm based Internet searching technique – Traveling salesman
problem using GA
9 Hours
GA – Fuzzy systems for Control of Robots
Total: 45 Hours
Textbook(s)
S.N.Sivanandam and S.N.Deepa, Principles of Soft Computing, Wiley India(P) Ltd,2011
Reference(s)
1. Timothy J.Ross, Fuzzy Logic with Engineering Applications, McGraw-Hill, 2000
2. Davis E.Goldberg, Genetic Algorithms: Search, Optimization and Machine Learning, Addison Wesley,
N.Y., 1989
3. Jang.J.S.R.Sun.C.T.and Mizutami.E, Neuro fuzzy and Soft computing, Prentice Hall, New Jersey-2010
11Z020 ARTIFICIAL INTELLIGENCE
3 0 0 3.0
Objective(s)
 To provide a basic exposition to the goals and methods of Artificial Intelligence
 To provide a strong foundation of fundamental concepts in Artificial Intelligence
Course Outcome(s)



Demonstrate different techniques to represent knowledge
Analyze the environment, understand the problem and find solution to the problem
Ability of reasoning and planning
200
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze /Evaluate
Create
Total
Test I
Test II
10
30
30
20
10
100
10
30
30
20
10
Model
Examination
10
30
30
20
10
End-Semester
Examination
10
30
30
20
10
100
100
100
Remember
1. What is Artificial Intelligence?
2. Define intelligent agent.
3. List the characteristics of agent environment.
4. What is pruning?
5. List the features of logic.
Understand
1. Describe situation space planning algorithms.
2. Explain alpha-beta pruning algorithm with example.
3. Describe and implement a real-time, multiplayer game-playing environment where time is part of
environment state.
Apply
1. Form state space for the water jug problem and apply suitable search algorithm to find the solution.
Analyze/ Evaluate
1. Is hill climbing guaranteed to give solution to 8-queens problem?
2. Compare IDA* and A* algorithms in terms of time and space complexity.
Create
1.
Consider the following classroom scheduling problem: There are 4 classes, C1, C2, C3, and
C4, and 3 class rooms, R1, R2, and R3. The following table shows the class schedule: In addition, there are the
following restrictions:
• Each class must use one of the 3 rooms, R1, R2, R3.
• R3 is too small for C3.
• R2 and R3 are too small for C4.
One way of formulating this problem as a constraint satisfaction problem is to let each
class, C1, …, C4, be a variable, and each room, R1, R2, R3, be the possible values for
these variables.
(a) Show the initial possible values for each variable, C1, …, C4, given the restrictions above.

201
(b) Express formally all the constraints in this problem.
(c) Consider each pair of variables appearing in the same constraint in (b), please point out which pairs are
arc-consistent for the initial values provided in (a). For those pairs that are not arc-consistent, please provide
the necessary operations so that they become arc-consistent.
Unit I
Introduction
Intelligent Agents – Agents and environments - Good behavior – The nature of environments – Structure of agents Problem Solving - Problem solving agents –– Uniformed search strategies - Avoiding repeated states.
9 Hours
Searching with partial information.
.
Unit II
Searching Techniques
Informed search and exploration – Informed search strategies – heuristic function – Local search algorithms and
optimization problems – Local search in continuous spaces – Online search agents and unknown environments Constraint satisfaction problems (CSP).
9 Hours
Backtracking search and Local search for CSP
Unit III
Knowledge Representation
First order logic – Representation revisited – Syntax and semantics for first order logic – Using first order logic –
Knowledge engineering in first order logic - Inference in First order logic – Prepositional versus first order logic –
Unification and lifting – Forward chaining – Backward chaining.
9 Hours
Ontological Engineering
Unit IV
Planning
Planning problem- Planning with state space search – Partial order planning – Planning graphs – Planning with
proportional logic – Time, Schedules, and Resources – Hierarchical task Planning – Conditional Planning –
Execution monitoring and replanning.
9 Hours
Continuous Planning
Unit V
Learning
Learning from observations - forms of learning - Inductive learning - Learning decision trees - Ensemble learning Knowledge in learning – Logical formulation of learning – Explanation based learning – Learning using relevant
information.
9 Hours
Statistical learning methods
Total: 45 Hours
Textbook(s)
1. Russell, Peter Norvig, Artificial Intelligence – A Modern Approach, 3rd Edition, Prentice Hall of India, 2009
Reference(s)
1. Nils J. Nilsson, Artificial Intelligence: A new Synthesis, Harcourt Asia Pvt. Ltd., 2000
2. Elaine Rich and Kevin Knight, Artificial Intelligence, 3rd Edition, Tata McGraw-Hill, 2011
3. George F. Luger, Artificial Intelligence-Structures And Strategies For Complex Problem Solving, Pearson
Education / PHI, 2002
202
11Z021 DATA WAREHOUSING AND DATA MINING
3 0 0 3.0
Objective(s)
 To understand the concepts of data warehousing with special emphasis on architecture and design.
 To understand the concepts of data mining.
 To understand the use of Mathematics, Statistics and Information Sciences in discovering knowledge from
large databases.
Program Outcome(s)
complete software related projects.
Course Outcome(s)
 Understand the functionality of data mining and data warehousing components
 Compare the various approaches of data mining and data warehousing implementations
 Realize the strengths and limitations of various data mining and data warehousing models
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze /Evaluate
Create
Test I
Test II
10
30
30
20
10
10
30
30
20
10
Model
Examination
10
30
30
20
10
End-Semester
Examination
10
30
30
20
10
Total
100
100
100
Remember
1. Define Data Mining
2. What is KDD?
3. List out the classification of data mining system
4. What are the steps in the data mining process?
5. List out the major components of a typical data mining system
6. What is constraint based association mining?
7. What are the two data structures in cluster analysis?
8. What are Bayesian Classifiers?
9. List out five data mining tools.
10. What is cluster analysis?
11. What is star schema and snow flake schema?
12. What is smoothing?
Understand
1. Summarize how a data warehouse differs from a database. How are they similar?
2. How are concept hierarchies useful in OLAP?

100
203
3. Where are Decision Trees mainly used?
4. Explain OLAP.
5. Describe the three-tier architecture of data warehouse.
6. Explain the data mining architecture.
Apply
1. Illustrate how to develop an efficient implementation method for mining weblog access records for separate
groups to facilitate customized marketing.
2. Given the following measurements for the variable age 18,22,25,42,28,43,33,35,56,28 standardize the
variable by mean absolute deviation of age and z-score for the first four measurements.
3. Enumerate the different classes of schemas that are used for modeling data warehouses
4. Find the frequent item sets without candidate generation using FP-growth.
5. Demonstrate the k-means clustering algorithm and illustrate the strength and weakness of k-means
clustering.
Analyze / Evaluate
1. Compare Data warehouse and Data mart.
2. Compare OLAP and OLTP.
3
Differentiate Data warehouse and operational DBMS.
4. Differentiate supervised and unsupervised learning scheme.
5 Give the Architecture of Data warehouse and explain its usage
6. Discuss Bayesian classification with its theorem
Create
1. Compose the OLAP operations in multidimensional data model and explain in detail.
2. Write an algorithm to find frequent item sets using apriori and generate association rules from frequent item
sets.
3. Write an algorithm for inducing a decision tree from training samples.
4. Formulate web mining techniques.
Unit I
Data warehousing
Introduction, Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse
Implementation
9 Hours
Data Warehousing to Data Mining
Unit II
Introduction to Data Mining
Relation to Statistics, Databases- Data mining on Different Kind of Data - Data Mining Functionalities-Steps in Data
Mining Process-Architecture of a Typical Data Mining Systems- Classification of Data Mining Systems – Data
Mining Task Primitives - Integration of a Data Mining System with a Database or Data Warehouse System
9 Hours
Major Issues in Data Mining
Unit III
Data Preprocessing and Data Generalization
Data Cleaning, Integration, Transformation, Reduction, Discretization, Concept Hierarchy Generation, Attribute
Oriented Induction – An Alternative Method for Data Generalization and Concept Description
9 Hours
Descriptive data summarization
Unit IV
Association Rules
Association Rule Mining, Single-Dimensional Boolean Association Rules from Transactional Databases, Multi-Level
Association Rules from Transaction Databases, Multi-dimensional Association rules from Relational Databases and
Data Ware houses , Association Mining to Correlation analysis
9 Hours
Constraint-Based Association Mining
204
Unit V
Classification and Clustering
Classification and Prediction, Issues, Decision Tree Induction, Bayesian Classification, Rule Based Classification,
Other Classification Methods, Prediction, Accuracy and Error Measures, Cluster Analysis, Types of data,
Categorization of major clustering methods, Partitioning methods
9 Hours
Hierarchical methods
Total : 45 Hours
Text Book
Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Morgan Kauffman, 2011
Reference(s)
1. Margaret H.Dunham, Data Mining: Introductory and Advanced Topics, Pearson Education 2006
2. Paulraj Ponniah, Data Warehousing Fundamentals: A Comprehensive Guide for IT Professionals ,WileyIndia Pvt Ltd, 2006
3. Sam Anahory, Dennis Murry, Data Warehousing in the Real World : A Practical Guide for Building
Decision Support Systems, Dorling Kindersley , 2005
4. David Hand, Heikki Manila, Padhraic Symth, Principles of Data Mining, PHI, 2004
11Z022 PROBABILITY AND QUEUING THEORY
3 0 0 3.0
Objective(s)
On completion of the course the students are expected to
 Have a well-founded knowledge of standard distributions which can describe real life phenomena and
acquire skills in solving problems which involves more than one random variable and functions of random
variables.
 Be exposed to basic characteristic features of a queuing system and acquire skills in analyzing queuing
models and to provide students with the ability to understand and conduct computer systems modeling and
performance analysis.
complete software related projects to meet customer business Objective(s) and/or productively engage in research
i.
Apply basic probability techniques and models to analyze the performance of computer systems,
and in particular, of networks.
ii. To analyze a network of queues with Possion external arrivals and exponential service
requirements.
iii Use discrete and continuous time Markov chains to model computer systems and real systems
respectively.
Course Outcome(s)
1. Probability and its applications
2. Random process and its properties.
3. Applications of queuing theory in computer field.
205
Assessment pattern
S.
No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze/ Evaluate
Create
Total
Test I8
Test II1
Model
Examination1
End
Semester
Examination
30
30
20
20
00
100
30
30
20
20
00
100
30
30
20
20
00
100
30
30
20
20
00
100
Remember
1. Define Probability
2. Describe a Random Variable.
3. Give the formula for Exponential Distribution.
4. List out the properties of Normal Distribution.
5. State the types of Two - Dimensional random variable.
6. What are the boundaries of coefficient of correlation?
7. Classify the random process with respect to time.
8. What is the sum of two poisson processes?
9. What is the name of the queue if a customer leaves the queue when there is
no waiting space in the system.
10. Name the Distributions which are used for arrivals and for service in a queuing system.
Understand
1.
If A and B are any two events in S such that P(A  B)=1/4, P( A )=2/3 and P(A  B)=3/4.
2.
3.
4.
5.
Find P( A /B).
State Bayes‘s theorem.
State the central limit theorem.
If X is a uniform random variable in [-2, 2], find the p.d.f. of X and var(X).
What are the applications of correlation?
6. The joint pdf of the R.V. (X,Y) is given by f(x,y) =
K xy
e ( x
2
 y2 )
,x>0, y>0. Find
the value of K and prove also that X and Y are independent.
7.
What are the classifications of random process?
8.
Define a markov chain and give one example.
9. Write the characteristics of a queuing system.
10. Draw a state transition rate diagram in M/M/C model.
Apply
1. If at least one child in a family of three children is a boy, what is the probability that
all three are boys.
2. In a class of 100 students 75 are boys and 25 are girls. The chance that a boy gets a
first class is 0.25 and the probability that a girl gets first class is 0.21. Find the
probability that a student selected at random gets a first class.
8
50 marks.
206
3. The overall percentage of failure in a certain examination is 40. What is the
probability that out of a group of 6 candidates at least 4 passed the examination.
4. In a newly constructed township, 2000 electric lamps are installed with an average
life of 1000 burning hours and standard deviation of 200 hours. Assuming the life
of the lamps follows normal distribution, find the number of lamps expected to fail
during the first700 hours.
5. From a sack of fruits containing 3 oranges, 2 apples and 3 bananas, a random
sample of 4 pieces of fruit is selected. If X is the number of oranges and Y is the
number of apples in the sample, find P ( X +Y ≤ 2 ) .
6. The two equations of the variables X and Y are x = 19.13 - 0.87y and
y = 11.64 - 0.50x. Find the correlation co-efficient between X and Y.
7. A man tosses a fair coin until 3 heads occur in a row. Let X denotes the longest string
Of heads ending at the n th trial. Show that the process is markovian.
8. Prove that difference of two poisson process is not a poisson process.
9.
Derive pure birth and death process.
10. Derive P-K formula.
Evaluate;
1. A given lot of IC-chips contains 2% defective chips. Each is tested before delivery.
The tester itself is not
totally reliable. Probability of tester says the chip is good when it is really good is 0.95 and the probability of
tester says chip is effective when it is actually defective is 0.94.If a tested device is indicated to be defective,
what is the probability that it is actually defective ?
2. Define MGF of a random variable. Find the MGF of the negative binomial distribution and hence find its mean
and variance.
3.
In a certain factory turning razor blades, there is a small chance of 1/500 for
any blade to be defective. The blades are in packets of 10. Use Poisson distribution
to calculate the approximate number of packets containing
i)
1 defective
ii) 2 defective blades respectively in a consignment of 1000 packets.
4.
If X and Y are two R.V‘s having joint density function
Find
5.
1
 (6  x  y );0  x  2,2  y  4
.
f ( x, y )   8

0 : otherwise

i) P( X  1  Y  3), ii ) P( X  Y  3)and iii ) P( X  1 / Y  3) .
If X and Y are independent random variables each normally distributed with
mean as 0 and variance as 
2
find the density function of
 y
r  x 2  y 2 and  tan 1   .
 x
6.
X and Y are two R.V‘s having joint density function
1
 (6  x  y );0  x  2,2  y  4
.
f ( x, y )   8

0
:
otherwise

Find the correlation coefficient between X and Y.
7.
8.
207
A man either drives a car or catches a train to go to office each day. He never goes two days in a row by train but
if he drives one day, then the next day he is just as likely to drive again as he is to travel tossed a fair dice and
drove to work if and only if a 6 appeared. Find
i). The probability that he takes a train on the third day
ii). The probability that he drives to work in the long run.
Show that the random process X (t )  A cos (0 t   ) is wide sense stationary, if
A and
0
are constants and

is a uniformly distributed random variable in
( 0 , 2  ).
9 . A petrol pump has two pumps. The service times follow the exponential distribution
with mean 4 minutes and cars arrive for service as a poisson process at the rate of 10
cars per hour. Find the probability that a customer has to wait for service. What is
the probability that the pumps remain idle.
10. Customers arrive at a one man barber shop according to a poisson process with a
mean inter arrival time of 12 mins. Customers spend an average of 10 mins in the
barber‘s chair.
i. What is the probability that the waiting time in the system is greater than 30 mins.
Ii. What is the average time customer spends in the queue.
Unit I
Probability and Random Variable
Axioms of probability - Conditional probability - Total probability – Baye‘s theorem- Random variable - Probability
mass function - Probability density function - Properties - Moments - Moment generating functions and their
properties.
9 Hours
Unit II
Standard Distributions
Binomial, Poisson, Geometric, Uniform, Exponential, Gamma and Normal distributions and their properties Functions of a random variable.
9 Hours
Unit III
Two Dimensional Random Variables
Joint distributions - Marginal and conditional distributions – Covariance - Correlation and regression Transformation of random variables - Central limit theorem.
9 Hours
Unit IV
Random Processes and Markov Chains
Classification - Stationary process - Markov process - Poisson process - Birth and death process - Markov chains Transition probabilities - Limiting distributions.
9 Hours
Unit V
Queuing Theory
Markovian models – M/M/1, M/M/C , finite and infinite capacity - M/M/∞ queues - Finite source model - M/G/1
queue (steady state solutions only) – Pollaczek – Khintchine formula – Special cases.
9 Hours
Total: 45+15 Hours
Text book
1. T. Veerarajan, Probability Statistics and Random Processes, Tata McGraw-Hill, New Delhi, 2009.
2. R.A. Johnson, Miller & Freund‘s ,Probability and Statistics for Engineers , Pearson Education, Delhi,
2009 .
208
Reference(s) books:
1. J. Medhi, Stochastic Processes, New Age Publishers, New Delhi, 1994.
2. A.O. Allen, Probability Statistics and Queuing Theory, Academic press, New Delhi, 1981
3 .M.B.K.Moorthy, Probability Random Processes and Queuing Theory, SciTech Publications,
Chennai, 2007.
4. S.C. Gupta and J.N. Kapur , Fundamentals of Mathematical Statistics , Sultan Chand, NewDelhi 1996
11Z023
CLOUD ARCHITECTURE AND SERVICES
3 0 0 3.0
Objective(s)
 To understand the phases of journey to the cloud
 To describe the key elements of Cloud Platform and Thread Programming
 To understand the concepts of Map Reduce Programming
 To design intelligent Cloud services and Applications
Program Outcome(s)
(b) Apply their knowledge and skills to succeed in a computer science career and/or obtain an
advanced degree.
d) Demonstrate problem solving and design skills including the ability to formulate problems
and their solutions, think creatively and communicate effectively.
Course Outcome(s)
Demonstrate the Cloud environments.
 Develop Web based Google AppEngine Applications.
Assessment Pattern
S.no
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze /Evaluate
Create
Total
Test I
Test II
10
30
30
20
10
100
10
30
30
20
10
Model
Examination
20
20
30
20
10
End-Semester
Examination
20
20
30
20
10
100
100
100
Remember
1. What are the business drivers for cloud computing?
2. How does Cloud computing works?
3. Can you recall difference between Virtual LAN (VLAN) and virtual SAN (VSAN).
4. List the services in cloud computing.
5. What are the concerns in cloud security?
Understand
1. Explain the characteristics of cloud computing as per NIST.
2. How would you classify the object based and Unified storage technologies?
3. Illustrate the methods for implementing virtualization, their benefits and considerations.

209
4. Describe cloud infrastructure components and services.
5. List out the considerations for choosing applications suitable for cloud computing.
Apply
1. How could you make a transition from data center to cloud computing environment?
2. Why backup and recovery is needed for virtual machines (VMs)?
3. How can you develop cloud services in real time in Aneka?
4. How to develop cloud models suitable for different categories of users?
Analyze/Evaluate
1. Use Cloud Simulator Aneka Cloud with suitable application
2. Develop a Hadoop Environment and generate a Map/Reduce Programming
3. Design Java Application to implement the Google AppEngine.
4. Study of Microsoft Azure and Google Apps Script.
Create
1. Create customized virtualized Desktop applications.
2. Create Google Appengine Web based Applications.
3. Create Aneka Platforms and Web services.
4. Create a Cloud Based Software as a service(SAAS)
Unit I
Introduction
Cloud computing at a Glance – Historical Development – Building Cloud Computing Environments – Computing
Platform and Technologies –Principles of Parallel and Distributed Computing- Elements of parallel and Distributed
Computing.
9 Hours
Technologies of Distributed Computing.
Unit II
Virtualization and Cloud Computing Architecture
Introduction - Characteristic of Virtualized Environments – Taxonomy of Virtualization Techniques- Virtualization
and Cloud Computing – Technology Examples- Cloud reference model – Types of the Cloud.
9 Hours
Open Challenges
Unit III
Cloud Application Platform and Thread Programming
Anatomy of the Aneka Container – Building Aneka Clouds – Cloud Programming and Management – Programming
Applications with Threads –Multi Threading and Programming Applications with Aneka Threads.
9 Hours
Implementation of Aneka Cloud
Unit IV
High Throughput Computing and Map Reduce Programming
Task Computing – Task Based Application Models – Aneka Task-Based Programming – Data –Intensive Computing
– Technologies for Data-Intensive Computing – Aneka Map-Reduce Programming.
9 Hours
Map-Reduce Programming
Unit V
Cloud Platforms and Applications
Amazon Web Applications – Google AppEngine –Microsoft Azure –Scientific Applications – Business and
consumer Applications- Third Party Cloud Services.
9 Hours
Third Party Cloud Services
210
Textbook(s)
1. Rajkumar Buyya, Christian Vecchiola and Thamari Selvi S ―Mastering in Cloud Computing‖, McGraw Hill Education
(India) Private Limited, 2013.
Reference
1. Anthony T Velte, ―Cloud Computing: A practical Approach‖, Tata McGraw Hill, 2009
2. Halper Fern, Kaufman Marcia, Bloor Robin, Hurwit Judith, ―Cloud Computing for Dummies,
Wiley India, 2009.
3.
Michael Miller, ― Cloud Computing‖, Pearson Education, New Delhi, 2009
11Z024 INFORMATION STORAGE MANAGEMENT
3 0 0 3.0
Objective(s)
 To understand the challenges in information storage and management 
 To describe the core elements in a data center 
 To understand RAID and its various levels for data backup 
 To design intelligent disk storage systems 
Program Outcome(s)
d) Graduates will demonstrate skills to use modern engineering tools, software and equipments to analyze
problems.
i) The graduates will be knowledgeable about contemporary developments
j) The graduates will develop confidence for self education and ability for lifelong learning.
Course Outcome(s)
 Evaluate storage architectures and key data center elements in classic, virtualized and cloud environments
 Explain physical and logical components of a storage infrastructure including storage subsystems, RAID and
intelligent storage systems
 Describe storage networking technologies such as FC-SAN, IP-SAN, FCoE, NAS and object-based, and
unified storage
 Understand and articulate business continuity solutions – backup and replications, along with archive for
managing fixed content
 Explain key characteristics, services, deployment models, and infrastructure components for a cloud
computing
Assessment Pattern
S.no
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze/Evaluate
Create
Total
Test I*
Test II*
20
20
20
40
100
10
20
20
40
10
100
Remember
1. What is virtualization?
2. How does FC protocol works?
3. Can you recall three-site remote replication?
4. List the services in cloud computing.
5. What is meant by storage tiering?
Model
Examination*
10
20
20
40
10
100
Semester-End
Examination
10
20
20
40
10
100
211
Understand
1. Explain about RAID
2. How would you classify the file storage virtualization?
3. Can clustering and multipathing avoid single point of failure
4. Describe cloud infrastructure components.
5. Illustrate various security threats in storage infrastructure.
Apply
1. How could you improve the performance of disk drive and flash drive components?
2. What approach would you use to improve the FC protocol operations?
3. Why backup and recovery is needed?
4. How can you develop cloud services in real time?
5. How to develop an application through Information lifecycle Management?
Analyze/Evaluate
1. What are the main reasons for storage system?
2. Give reasons for moving towards object based and unified storage system.
3. What are the benefits of using cloud services? Also mention the difficulties faced by the users while
using cloud services.
Create
1. Create a customized and secure storage solution for corporates.
Unit I
Storage System
Introduction to information storage, Virtualization and cloud computing, Key data center elements, Compute,
application, and storage virtualization, Disk dive & flash drive components and performance, RAID, Intelligent
storage system and storage provisioning (including virtual provisioning)
9 Hours
Unit II
Storage Networking Technologies and Virtualization
Fibre Channel SAN components, FC protocol and operations, Block level storage virtualization, iSCL and FCIP as an
IP-SAN solutions, Converged networking option – FcoE, Network Attached Storage (NAS) – components, protocol
and operations, File level storage virtualization, Object based storage and unified storage platform.
9 Hours
Unit III
Backup, Archive and Replication
Business continuity terminologies, planning and solutions, Clustering and multipathing to avoid single points of
failure, Backup and recovery – methods, targets and topologies, data deduplication and backup in virtualized
environment, fixed content and data archive, Local replication in classic and virtual environments, Remote replication
in classic and virtual environments, Three-site remote replication and continuous data protection.
9 Hours
Unit IV
Cloud Computing Characteristics and benefits
Services and deployment models, Cloud infrastructure components, Cloud migration considerations.
9 Hours
Unit V
Securing and Managing Storage Infrastructure
Security threats, and countermeasures in various domains, Security solutions for FC-SAN, IP-SAN and NAS
environments, Security in virtualized and cloud environments, Monitoring and managing various information
infrastructure components in classic and virtual environments, Information lifecycle Management (ILM) and storage
tiering.
9 Hours
Total: 45 Hours
Text Book
1. Information Storage and Management: Storing, Managing and Protecting Digital Information in classic,
Virtualized and Cloud Environments, 2nd Edition, EMC Educations Services, Wiley, May 2012.
212
Reference(s)
1. Ulf Troppens, Rainer Erkens, Wolfgang Mueller-Friedt, Rainer Wolafka, Nils Haustein ,"Storage Networks
Explained: Basics and Application of Fibre Channel SAN, NAS, iSCSI, InfiniBand and FCoE, 2nd Edition,
Wiley, July 2009
2. Information Storage and Management: Storing, Managing, and Protecting Digital Information, EMC
Education Services, Wiley, January 2010
11Z025
WEB SERVICES AND SERVICE ORIENTED ARCHITECTURE
3 0 0 3.0
Objective(s)
 To understand the key distinctions for Service-Oriented Architecture (SOA).
 To understand the Web Services Security Frame.
 To understand the key security requirements.
 To understand the key principles and patterns for building secure services.
e) Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize
f) Demonstrate problem solving and design skills including the ability to formulate problems and their
Course Outcome(s)
 Understand various aspects of web services.
 Demonstrate skills in designing and developing the web services.
 Describe real-world scenarios involving web services
 Describe the need for a platform-independent service contract (WSDL)
 Describe the need for a platform-independent messaging format (SOAP).
Assessment Pattern
S.No
1
2
3
4
5
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze /Evaluate
Create
Test I
Test II
30
30
20
20
-
30
30
20
20
-
Model
Examination
30
30
10
20
10
Total
100
100
Remember
1. What is a service-oriented architecture?
2. What is Web Services Management?
3. Define Web Services Security?
4. Explain XML Firewall?
5. What is an SLA?
Understand
1. List the challenges faced in SOA adoption.
2. Mention about SOA governance? What are its functions?
3. Explain the Business Benefits of Service-Oriented Architecture?

100
End-Semester
Examination
30
30
10
20
10
100
213
Apply
1. Why do I need Web services management?
2. How does Web Services Management fit into my existing infrastructure?
3. How do I manage B2B communication?
4. Demonstrate the process of collecting the data.
Analyze/ Evaluate
1. In SOA do we need to build systems from scratch?
2. Can you explain business layers and plumbing layers in SOA?
3. What is the difference between services and components?
4. Can you describe the complete architecture of SOA?
5. Can you explain a practical example in SOA?
6. What are ends, contract, address, and bindings?
7. Are web-services SOA?
Create
1. Construct a web service for any one B2B application.
Unit I
SOA and Web Services Fundamentals
Introduction – Evolution of SOA – Web services and primitive SOA: Web services framework, services as web
services, service description, messaging.
9 Hours
Unit II
SOA and Web Services Fundamentals
Activity management and Composition: message exchange patterns, service activity coordination, atomic
transaction, business activities, orchestration, Choreography- Advanced messaging, meta data and security.
9 Hours
Unit III
SOA and Service Orientation
Principles of service orientation: SO and enterprise, Anatomy, principles, SO and object orientation, native web
services and support for SO – Service layers: SOA and contemporary SOA, service layer abstraction, application,
business, orchestration service layers, agnostic services, service layer configuration scenarios.
9 Hours
Unit IV
Building SOA: Planning and Analysis
SOA delivery strategies – Introduction to SO analysis, benefits of business centric SOA, deriving business services –
SOA service modeling: guidelines, logic, approaches.
9 Hours
Unit V
Building SOA: Technology And Design
Introduction – SOA composition guideline – Service Design – Business Process Design – SOA platforms.
9 Hours
Total: 45 Hours
Textbook(s)
1. Thomas Erl, ―Service-Oriented Architecture: Concepts, Technology, and Design‖, Pearson Education, 2008.
2. Thomas Erl, ―SOA Principles of Service Design ―(The Prentice Hall Service-Oriented Computing Series from
Thomas Erl), 2005.
Reference Books
1. Newcomer, Lomow, ―Understanding SOA with Web Services‖, Pearson Education, 2005.
2. Sandeep Chatterjee, James Webber, ―Developing Enterprise Web Services, an Architect‘s Guide‖, Pearson
Education, 2005.
3. Dan Woods and Thomas Mattern, ―Enterprise SOA Designing IT for Business Innovation‖ O‘REILLY, First
Edition, 2006
214
PHYSICS ELECTIVES
11O0PA NANO SCIENCE AND TECHNOLOGY
3 0 0 3.0
Course Objective(s)
 To impart knowledge on nanoscience and technology.
 To create an awareness on the nanomaterials.
 At the end of the course the students are familiar with nanomaterials and their applications.
Program Outcome(s)
b.
An ability to apply knowledge of mathematics, science, computer programming and engineering.
Course Outcome(s)
 understand the behavior of nanomaterials, quantum phenomena and the limitations of basic physical laws at
the nano scale level.
 explain important mechanisms involved in the of synthesis and functionalization of nano-structured
materials.
 evaluate the promise of a nanotechnology device.
 identify the origin of size effects to control the properties of nanomaterials.
 apply knowledge for modern and future engineering applications of nanomaterials.
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test 1
Test 2
Model
Examination
End Semester
Examination
25
25
20
20
10
-
25
25
20
20
10
-
20
25
20
20
15
-
20
25
20
20
15
-
100
100
100
100
Remember
1. Define nanoscale.
2. Give the differences between nano and thin materials.
3. Give the usage of nanomaterials in medical field.
4. What are the techniques used to find properties of materials?
5. What are the day-to-day life applications of nanomaterials?
6. What do you mean by total energy of the system?
7. What do you mean by top down and bottom up approach?
8. How physical properties vary while converting the material into nano size?
9. What is SWCNT and MWCNT?
10. What are the applications of CNT?
11. Mention the general characterization techniques of nanomaterials.

50 marks.
215
12. How electron microscopy differ from scanning electron microscopy?
13. Define diffraction.
14. Write the different diffraction techniques to analyse the properties of nanomaterials.
15. What is meant by surface analysis of nanomaterials?
16. What are quantum dots?
17. Write the importance of self assembly technique.
18. What is organic FET?
19. State the principle of LED.
20. Why nanomaterials are used as energy storage device?
21. Write the bio medical applications of nanomaterials.
22. List the advantages of nanomaterials as compared to bulk materials.
23. Which is having high efficiency among injection and quantum cascade laser?
24. Write the uses of FET.
25. What is nano magnet?
26. Mention the applications of nanomagnets in industries.
27. Write the advantages of nano robot in medical field.
Understand
1. How the nano dimension particle varies with bulk one?
2. Explain the different classifications of nanostructures.
3. Elucidate the significance of MWCNT over SWCNT.
4. Explain structural, electrical, mechanical properties of nanoscale materials.
5. What are the applications of CNT?
6. Why the electrical properties are more important as compared to other properties of nanomaterials?
7. How nanomaterials are produced by machining process?
8. Give the importance of vapor phase deposition method for the production of nanomaterials.
9. Explain the sol-gel technique of nanomaterial production.
10. How the nanomaterials are analyzed in scanning electron microscopic technique?
11. Elucidate how nanomaterials are produced by template method?
12. List the general classifications of characterization methods of nanomaterials.
13. Explain how FTIR is used to analyze the bonding in nanomaterials?
14. Why the TEM is widely used than SEM? Explain.
15. What are the advantages and disadvantages of TEM?
16. Explain the quantum confinement in semiconductor nanostructures.
17. Explain the different fabrication techniques of nanoscale materials.
18. Explicate in which way thermally annealed quantum well technique is better than epitaxial growth
technique?
19. Explain the electro statically induced quantum dots and quantum wire technique.
20. Why semi conducting nano material is more important than other nanomaterials?
21. What are the advantages of nanomagnetic materials?
22. How nanomaterials are used in organic FET?
23. Why the organic LEDs are manufactured from nanomaterials?
24. How nanomaterials are used in quantum cascade laser?
25. Why nano photo voltaic fuel cells are used?
26. Explain the bio medical applications of nanodevices.
Apply
1. Clarify the effects of nanometer length scale of particles.
2. Give the reason for the effect of nanoscale dimensions on various properties.
3. Explain how the size of the particle will effect on their mechanical and structural properties of the material?
4. Why sol gel method is used widely to synthesis nanomaterials?
5. Templating method is better than physical vapor deposition method to synthesis nanomaterials. Why?
6. Why ordering of the nano system is more important? Give reason.
7. Explain how nanomaterials are characterized by imaging techniques?
8. Why diffraction techniques are used to characterize the nanomaterials?
9. Explain how nanomaterials are analyzed by transmission electron microscope?
10. Clarify the differences between self-assembly and self-organization.
216
11. Explain how organic light emitting diode overcomes the drawback of LCD?
12. How we can use CNT as a storage device in battery?
13. Why nanomaterials are used in optical memory devices?
14. How we can store nano particles?
Analyze/ Evaluate
1. Distinguish between SWCNT and MWCNT.
2. Compare organic FET and organic LED.
3. Why nano structured particles are found in potential applications?
4. Give the relation between properties and applications of nano particles.
5. Explain with relevant example about the synthesize of nano structured materials employing self-assembly
and template based methods.
6. Analyze the relation between magnetic and nanomaterials.
Unit I
Nano Scale Materials
Introduction-classification of nanostructures, nanoscale architecture – effects of the nanometer length
scale –
changes to the system total energy, changes to the system structures– effect of nanoscale dimensions on various
properties – structural, thermal, chemical, mechanical, magnetic, optical and electronic properties.
Differences between bulk and nanomaterials and their physical properties.
9 Hours
Unit II
Nanomaterials Synthesis Methods
Fabrication methods – top down processes – milling, litho graphics, machining process – bottom-up process – vapor
phase deposition methods, plasma-assisted deposition process, colloidal and solgel methods – methods for
templating the growth of nanomaterials – ordering of nanosystems, self-assembly and self-organization.
Magnetron sputtering process to obtain nanomaterials.
9 Hours
Unit III
Nano Characterization Techniques
General classification of characterization methods – analytical and imaging techniques – microscopy techniques electron microscopy, scanning electron microscopy, transmission electron microscopy, atomic force microscopy –
diffraction techniques – spectroscopy techniques-X-ray spectroscopy.
Electrical properties of nanomaterials.
9 Hours
Unit IV
Inorganic Semiconductor Nanostructures
Quantum confinement in semiconductor nanostructures - quantum wells, quantum wires, quantum dots, super
lattices– fabrication techniques – requirements, epitaxial growth, lithography and etching, electrostatically induced
dots and wires, quantum well width fluctuations, thermally annealed quantum wells and self-assembly techniques .
Quantum efficiency of semiconductor nanomaterials.
9 Hours
Unit V
Nanodevices And Applications
Organic FET- principle, description, requirements, integrated circuits- organic LED‘s – basic processes, carrier
injection, excitons, optimization - organic photovoltaic cells- carbon nano tubes- structure, synthesis and electronic
properties -applications- fuel cells- nano motors -bio nano particles-nano – objects.
Applications of nano materials in biological field.
9 Hours
Total: 45 Hours
Textbook(s)
1. Robert W. Kelsall, Ian W. Hamley, Mark Geoghegan, Nanoscale Science and Technology, John Wiley and
Sons Ltd, 2005.
217
T. Pradeep, NANO: The Essentials Understanding Nanoscience and Nanotechnology, McGraw – Hill
Education (India) Ltd, 2007.
3. Handbook of Nanoscience, Engineering and Technology, Kluwer publishers, 2002.
4. B. Wang, Drug Delivery: Principles and Applications,Wiley Interscience 2005.
Reference(s)
1. Michael Kohler, Wolfgang Fritzsche, Nanotechnology: An Introduction to Nanostructuring Techniques,
Wiley-VCH Verlag GmbH & Co.2004.
2. William Goddard, Donald .W.Brenner, Handbook of Nano Science Engineering and Technology, CRC
Press, 2004.
3. Bharat Bhushan, Springer Handbook of Nanotechnology, 2004.
4. Charles P Poole, Frank J Owens, Introduction to Nanotechnology, John Wiley and Sons, 2003.
5. Mark Ratner, Daniel Ratner, Nanotechnology: A Gentle Introduction to the Next Big Idea, Prentice Hall,
2003.
11O0PB LASER TECHNOLOGY
2.
3 0 0 3.0
Course Objective(s)
 To impart knowledge on laser principles.
 To create expertise on the applications of laser in various engineering fields.
 At the end of the course the students are familiar with generation and applications of laser in various
engineering fields.
Program Outcome(s)
c. An ability to apply knowledge of mathematics, science, computer programming and engineering
Course Outcome(s)





understand the principle, theory, operations and types of laser.
discuss the fundamental terms such as absorption, spontaneous and stimulated emission.
explore the various techniques involved in the laser materials and the performance of laser.
apply different types of lasers for day to day applications.
tune the applications of lasers towards industrial and medical fields.
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total

Test 1
Test 2
Model
Examination
End Semester
Examination
25
25
20
20
10
-
25
25
20
20
10
-
20
25
20
20
15
-
20
25
20
20
15
-
100
100
100
100
50 marks.
218
Remember
1. What is a laser? How the basic laser action is achieved?
2. Distinguish between spontaneous emission and stimulated emission.
3. What is population inversion?
4. Mention the importantcharacteristics of laser.
5. How four level laser is more efficient than the three level laser?
6. What is a resonant cavity?
7. What role does an optical resonant cavity play in a laser?
8. What are the host materials for solid lasers?
9. Mention the different techniques involved in lasers.
10. Define atmospheric effect.
11. How will you measure the distance using laser?
12. What is the basic principle behind the holography?
13. Mention the medical applications of lasers.
Understand
1. Write the conditions needed for laser action.
2. What is meant by pumping of atoms?
3. How optical excitation occurs in three level lasers?
4. What is the principle of laser action?
5. Compare the activator and host materials for solid lasers.
6. Distinguish between Czochralski and Kyropoulous techniques.
7. How will you determine the velocity of laser source?
8. List the applications of laser in welding and cutting.
9. Why laser is called as non-material knife?
Apply
1. The first line of the principal series of sodium is the D line at 580 nm. This corresponds to a transition from
the first excited state (3p) to the ground state (3s). What is the energy in electron volts of the first excited
state?
2. What is the ratio of the stimulated emission and spontaneous emission at a temperature of 250 oC for the
sodium D line?
3. Calculate the threshold condition for the ruby laser in which the appropriate parameters are as follows: ν o
=4.3x 1014 Hz; Δνo=1.5x1011 Hz; no= 1.76; τsp= 4.3x10-3 s; τphoton=6x10-9s.
4. A He-Ne laser emits light at a wavelength of 632.8 nm and has an output power of 2.3mW. How many
photons are emitted in each minute by this laser when operating?
5. Calculate the wavelength of emission from a GaAs semiconductor laser whose band gap energy is 1.44 eV.
Analyze
1. Why laser beam should be monochromatic?
2. How the population inversion happening in lasers?
3. Write the reaction for eximer laser action.
4. Which method is used to achieve population inversion in a dye laser?
5. Why we cannot use ordinary light source for LIDAR?
6. How the optical disk data storage plays a vital role in computer memory storages?
Evaluate
1. The life time of the excited state (2p) for spontaneous emission is 1.6x 10 -9s. The energy difference between
the excited state (2p) and the ground state (2s) is 10.2eV. Find the value of stimulated emission coefficient
during a transition from an excited state (2p) to the ground state.
2. A laser beam can be focused on an area equal to the square of its wavelength (λ2). For a He-Ne laser, λ =
6328Ǻ. If the laser radiates energy at the rate of 1mW, find the intensity of the focused beam.
3. Transition occurs between a metastable state E3 and an energy state E2 just above the ground state. If
emission is at 1.1μm and E2= 0.4x10-19J, find the energy of the E3 state.
219
Unit I
Laser fundamentals
Introduction - principle - spontaneous emission - stimulated emission - population inversion-Pumping mechanisms characteristics. Types of lasers –principle, construction, working, energy level diagram and applications of dye laser –
chemical laser – excimer laser.
Laser action.
9 Hours
Unit II
Threshold condition
Einstein coefficients A and B – spontaneous life time – light amplification – principle of laser action – laser
oscillations – resonant cavity – modes of a laser.
Conditions involved in laser production.
9 Hours
Unit III
Laser materials
Activator and host materials for solid lasers - growth techniques for solid laser materials - Bridgman and StockBerger technique – advantages and disadvantages - Czochralski and Kyropoulous techniques – merits and demerits.
Techniques of producing laser.
9 Hours
Unit IV
Laser in science
Introduction – harmonic generation – stimulated raman emission – self focusing – laser and ether drift – rotation of
the earth – photon statistics.
Applications of Laser in ranging.
9 Hours
Unit V
Laser in industry
Introduction – Applications in material processing: laser welding – hole drilling – laser cutting – laser tracking –
Lidar – laser in medicine.
Applications of Laser in sensors.
9 Hours
Total: 45 Hours
Textbook(s)
1. K.Thiyagarajan and A.K.Ghatak, LASER:Theory and applications. Macmillan India Limited, 2000.
2. M. N. Avadhanulu, An Introduction To Lasers Theory And Applications, S. Chand Publisher, 2001.
Reference(s)
1. K.P.R.Nair, Atoms, Molecules and Lasers, Narosa Publishing House, 2009.
2. K. R. Nambiar ,Lasers: Principles Types And Applications , New Age International Publications, 2006.
3. Alphan Sennaroglu, Solid-State Lasers and Applications, CRC Press, 2006
4. Bela A Lengyel, Introduction to Laser Physics, John Wiley and Sons, 1966.
11O0PC Electro Optic Materials
3 0 0 3.0
Course Objective(s)
 To impart knowledge on electro-optic materials.
 To develop fundamental understanding of various electro-optic materials in communication.
Program Outcome(s)
d. An ability to apply knowledge of mathematics, science, computer programming and engineering.
220
Course Outcome(s)
 Understand the mechanism involved in the laser action.
 Know the birefringence and optical property of the materials.
 Choose suitable optical materials for modulators.
 Realize the special optical properties of the opto electronic systems.
 Design electro optic modulators for day to day applications.
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test 1
Test 2
Model
Examination
End Semester
Examination
25
25
20
20
10
-
25
25
20
20
10
-
20
25
20
20
15
-
20
25
20
20
15
-
100
100
100
100
Remember
1. Define laser action.
2. Give the properties of LASER.
3. Differentiate between stimulated and spontaneous emissions.
4. Define continuous and discrete time signals.
5. Define anisotropic media.
6. What is an acoustic optic effect?
7. Define a liquid crystal.
8. Mention the different types of polarizing devices.
9. Give examples for direct and indirect band gap materials.
10. Highlight the usage of a NLO material.
Understand
1. How the population inversion state in laser is achieved?
2. Give examples for continuous and discrete time signals.
3. Elucidate the importance of coherence in laser action.
4. Why birefringence property in an optical material is formed?
5. In which effect KDP crystal is working?
6. How the codirectional coupling occurs?
7. List out the conditions in which the NLO property of a material emerges.
8. What is the purpose of switching to quantum mechanics from classical mechanics?
9. Why we prefer LCD displays rather than CRT displays?
10. What are the advantages of injection laser diode?
Apply
1. Find the intensity of a laser beam of 10mW power and having a diameter of 1.3 mm. Assume the
intensity to be uniform across the beam. Given: P=10mW, d= 1.3 mm.

50 marks.
221
2.
Discuss the three level pumping scheme for laser action.
3. Why is the optical resonator required in lasers?
4.
Where can we find the practical applications of wave plates?
5.
How to elevate the contrast ratio in display devices which uses in the nematic structures?
6.
Non linearity in glasses occurs. Justify the argument.
Analyze/ Evaluate
1. Compare ordinary and laser light properties.
2. Differentiate wave refractive index and ray refractive index.
3. Differentiate longitudinal and transverse electro optic effects.
4. Bring out the importance of electro optic devices.
Unit I
Basics of Lasers
Introduction – Einstein coefficients – laser beam characteristics – spontaneous and stimulated emission population
inversion - light amplification – threshold condition – laser rate equations – two level laser – three level laser – mode
selection – transverse mode – longitudinal mode.
Spatial and temporal coherence.
9 Hours
Unit II
Wave Propagation in Anisotropic Media
Introduction – double refraction – polarization devices - Nicol prism – Glan-Thomson prism – retardation plates –
Soleil Babinet compensator – Plane waves in anisotropic media – wave refractive index - ray refractive index - ray
velocity surface – index ellipsoid.
Optical activity.
9 Hours
Unit III
Electro Optic Effect
Introduction – KDP crystals – longitudinal mode – phase modulation – amplitude modulation – transverse mode.
Acousto-optic effect – small Bragg angle diffraction – large Bragg angle diffraction – codirectional coupling –
contradirectional coupling - applications.
Modulators.
9 Hours
Unit IV
Non Linear Optics
Introduction – self focusing phenomenon – second harmonic generation – phase matching – birefringent phase
matching – quasi phase matching – frequency mixing. Semiconductors – measurement of third order optical nonlinearities in semiconductors.
Frequency doubling nature of materials.
9 Hours
Unit V
Electro Optic Devices
Introduction – light emitting diode – direct and indirect band gap materials – homo junction – hetero junction –
advantages – disadvantages – applications. Injection laser diode – characteristics – advantages – disadvantages.
Liquid crystal displays – dynamic scattering – field effect – advantages – disadvantages.
Optoelectronic devices.
9 Hours
Total 45 Hours
Textbook(s)
1. Ajoy Ghatak and K. Thyagarajan, Optical electronics, Cambridge University Press, 7th reprint 2006.
2. B. Somanathan Nair, Electronic devices and applications, Prentice - Hall of India private limited, 2010.
3. Frank L. Pedrotti, S. J. Leno S. Pedrotti and Leno M. Pedrotti, Introduction to optics, Pearson Prentice
Hall, 2008.
222
Reference(s)
1. Ji - ping Huang and K.M.Yu, New Non Linear Optical Materials, Nova, Science Publishers, 2007.
2. J .D. Wright, Molecular crystals, Cambridge university press, 2nd edition, 1995.
3. R .W. Munn (Ed) and C. N. Ironsid, Molecular crystals, Blackie Academic & Professional, Glassgow, 1993.
11O0PD VACUUM SCIENCE AND TECHNOLOGY
3 0 0 3.0
Course Objective(s)
 To impart a sound knowledge on the vacuum science.
 To develop the necessary background to perform projects involving vacuum and deposition techniques.
 At the end of the course the students are familiar with the various vacuum deposition technologies employed
in the various engineering fields.
Program Outcome(s)
e. An ability to apply knowledge of mathematics, science, computer programming and engineering.
Course Outcome(s)





apply knowledge of mathematics, science, computer programming and engineering.
understand the fundamentals of vacuum technology.
analyze the various measuring instruments in order to measure vacuum.
study the various components to generate low and ultra high vacuum.
consolidate the various components to generate vacuum for various applications.
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test 1
Test 2
Model
Examination
End Semester
Examination
25
25
20
20
10
-
25
25
20
20
10
-
20
25
20
20
15
-
20
25
20
20
15
-
100
100
100
100
Remember
1. Define the term mean free path.
2. Give the pressure ranges of low and medium vacuum.
3. State Avogadro‘s law.
4. List out the assumptions of kinetic theory.
5. What are the types of pump used to create vacuum?
6. What are the gauges that are used to measure the vacuum?
7. Name the direct reading gauges and indirect reading gauges.
8. Name the operation limits of penning gauge.
9. Name the ultra high vacuum gauges.

50 marks.
223
10. List out the methods of leak detection.
11. Give the importance of baffles and traps.
12. Mention the gauges that can measure ultra high vacuum.
13. Define throughput.
14. Give the Ohm‘s law of vacuum technology.
15. Name the sorbent materials that have widespread use in vacuum production.
Understand
1. How will you measure the pumping speed in a vacuum unit?
2. How will you seal the substance outside to maintain high vacuum?
3. Why does constant volume method have the disadvantage in measuring the pumping speed?
4. Differentiate between the pirani gauge and penning gauge.
5. Differentiate the primary gauges from secondary gauges.
6. How is the pumping speed measured?
7. How does a rotary pump produce a low pressure?
8. Derive the relation between the effective pumping speed and conductance of the evacuation pipe.
9. Explain the designing of UHV evacuation systems.
10. How are the vacuum surfaces cleaned?
Apply
1. How will you deposit the material from the plasma etching method?
2. Why is cold cathode ionization gauges preferred to hot cathode gauges?
3. Explain the applications of turbomolecular pump.
4. A vacuum chamber has a volume of 100 litres and an operating gas load of 7.5 x 10 -5 torr-lites/sec. The
desired operating pressure is 7.5 x 10-8 Torr. Connections between the chamber and diffusion pump and the
diffusion pump and rotary pump are to meet good design practice (assume SE/SD=1/5). Calculate the
pumping speed at the chamber, the minimum connecting pipe conductance and the minimum speed required
for the backing pump together with the minimum diffusion pump speed required to meet these requirements.
5. Surface to volume ratio plays a major role in pumping systems. Why?
Analyze/ Evaluate
1. Why is the diffusion pump widely used in scientific instruments?
2. Oil diffusion pump system can be used as a high vacuum pumping system. Why?
3. Compare real and virtual leaks.
Unit I
Vacuum Systems
Introduction – units of vacuum – kinetic aspects of gases in a vacuum chamber – physical parameters at low
pressures – classification of vacuum ranges – gas flow at low pressures – throughput and pumping speed – flow
rate and conductance.
Evacuation rate – out gassing – gas flow – turbulent flow.
9 Hours
Unit II
Production of Vacuum
Classification of vacuum pumps – rotary vane pumps – roots blowers – diffusion pumps – molecular drag and turbomolecular pumps – sorption pumps – gettering and ion pumping – cryopumping measurement of pumping speed.
Noble pumps for inert gases.
9 Hours
Unit III
Pressure Measurement
Classification of gauges – mechanical gauges – McLeod gauge – thermal conductivity gauges – Hot cathode
ionization gauges – Bayard - Alpert gauge – cold cathode ionization gauges – Penning gauge – magnetron gauge.
Measurement problems in partial pressure analysis.
9 Hours
Unit IV
Vacuum Materials and Leak Detection
Sources of gases and vapours – materials for vacuum system – vacuum seals – vacuum valves – traps and baffles –
leak detection – pressure test – spark-coil test – leak testing using vacuum gauges – halogen leak detector – massspectrometric leak detector.
Special design considerations – glass to metal seals – high voltage metal feedthrough.
9 Hours
224
Unit V
Applications of Vacuum Systems
Design considerations – vacuum system for surface analysis – space simulators – vacuum
based coating
units for thin film deposition – thermal evaporation – sputtering process – chemical vapor deposition - metallurgical
applications.
Plasma etching – pulsed vapour deposition – PE chemical vapour deposition.
9 Hours
Total 45 Hours
Textbook(s)
1. Rao V.V, Ghosh T.B, Chopra K.L, “Vacuum science and technology‖, Allied Publishers Limited, 2005.
2. Dorothy M. Hoffman, John H. Thomas, Bawa Singh, “Handbook of Vacuum science and technology”,
Elsevier Science & Technology Books, 1997.
Reference(s)
1.David M. Hata, “Introduction to vacuum technology”, Pearson Printice Hall, 2007.
2.John F. O'Hanlon, “A user‟s guide to vacuum technology‖, John Wiley & Sons, 2003.
3.Chambers.A, “Modern vacuum physics”, Chapman & Hall, CRC Press, 2005.
11O0PE SEMICONDUCTING MATERIALS AND DEVICES
3 0 0 3.0
Course Objective(s)
 To improve knowledge on semiconducting materials.
 To develop the necessary understanding of semiconducting materials and their applications.
 At the end of the course the students are familiar with various semiconducting materials and their
applications
Program Outcome(s)
f. An ability to apply knowledge of mathematics, science, computer programming and engineering.
Course Outcome(s)
 understand the mechanism involved in semiconductors.
 know the efficiencies of the existing semiconducting materials.
 implement the features of transistors for day to day applications.
 design semiconducting devices for industrial applications.
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total

Test 1
Test 2
Model
Examination
End Semester
Examination
25
25
20
20
10
-
25
25
20
20
10
-
20
25
20
20
15
-
20
25
20
20
15
-
100
100
100
100
50 marks.
225
Remember
1. What properties are desirable in semiconductors?
2. Explain the Kronig-Penny model.
3. Define drift current density.
4. What is meant by breakdown?
5. Explain the minority carrier distribution in p-n junction diode.
6. Define temperature effect.
7. What is the basic principle of bipolar junction transistor?
8. Define current crowding.
9. What are optoelectronic devices?
10. Describe the operation of a laser diode.
Understand
1. How does conductivity of a semiconductor change with rise in its temperature?
2. How does the thickness of the depletion layer in a p-n junction vary with increase in reverse bias?
3. How does the energy gap in an intrinsic semiconductor vary, when doped with a pentavalent impurity?
4. Explain the mobility effects on carrier density.
5. What do you understand by the term ―holes‖ in a semiconductor? Explain how they move under the
influence of electric field.
6. What is the a.c response of the p-n diode?
7. How the solar cell is functioning?
Apply
1. In general what is the relation between density of states and energy?
2. What is meant by the term, doping of an intrinsic semiconductor?
3. Give the ratio of the number of holes and the number of conduction electrons in an intrinsic semiconductor.
4. Write the function of base region of a bipolar junction transistor.
5. Sketch the energy bands of a forward-biased degenerately doped pn junction and indicate how population
inversion occurs.
Analyze/ Evaluate
1. What types of charge-carriers are there in a n-type semi conductor?
2. What are the disadvantages of using laser diode?
3. What are the defect levels in semiconductors?
4. Consider an optical cavity. If N>>1, show that the wavelength separation between two adjacent resonant
modes is ∆λ=λ2/2L.
Unit I
Properties of Semiconductor
Energy bands – allowed and forbidden energy bands – Kronig Penny model – electrical conductivity in solids based
on energy bands - band model – electron effective mass – concept of holes in semiconductor – density of states –
extension to semiconductors.
k-space diagram.
9 Hours
Unit II
Carrier Transport Properties
Carrier drift – drift current density – mobility effects on carrier density – conductivity in semiconductor – carrier
transport by diffusion – diffusion current density – total current density – breakdown phenomena – avalanche
breakdown.
Graded Impurity Distribution.
9 Hours
Unit III
P-N Junction Diode
Qualitative description of charge flow in p-n junction – boundary condition – minority carrier distribution – ideal pn junction current – temperature effects – applications – the turn on transient and turn off transient.
Charge storage and diode Transients.
9 Hours
226
Unit IV
Bipolar Junction Transistor
Introduction to basic principle of operation – the modes of operation – amplification – minority carrier distribution in
forward active mode – non-ideal effects – base with modulation – high injection emitter band gap narrowing –
current clouding – breakdown voltage – voltage in open emitter configuration and open base configuration
Frequency Limitations.
9 Hours
Unit V
Opto Electronic Devices
Optical absorption in a semiconductor, photon absorption coefficient – electron hole pair generation - solar cell –
homo junction and hetero junction - Photo transistor – laser diode, the optical cavity, optical absorption, loss and
gain - threshold current.
Photoluminescence and Electroluminescence.
9 Hours
Total 45 Hours
Textbook(s)
1. Donald A Neamen, “Semiconductor physics and devices”, Tata McGraw Hill, 2007
2. Albert Malvino,David J Bafes, “Electronic Principles”, Tata McGraw Hill, 2007
Reference(s)
1. Kevin F Brennan, The Physics of Semiconductors, Cambridge University Press, 1999.
2. Micheal Shur, Physics of Semiconductor Devices, Prentice Hall of India, 1999.
3. Jasprit Singh, Semiconductor Optoelectronics Physics and Technology, McGraw Hill Co., 1998.
CHEMISTRY ELECTIVES
11O0YA
POLYMER CHEMISTRY AND PROCESSING
3 0 0 3.0
Objective(s)
 To impart knowledge on the basic concepts and importance of polymer science, chemistry of polymers and
its processing.
 To make understand the principles and applications of advanced polymer materials.
 Knowledge and application of different polymers and its processing.
Program Outcome(s)
Course Outcome(s)



understand the knowledge of principles of polymer chemistry and mechanism of polymerization reactions.
acquire knowledge of polymerization techniques.
apply the contextual knowledge of polymer additives and polymer processing in industrial application.
227
Assessment pattern
S.No.
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
Test II
Model
Examination
End Semester
Examination
20
20
30
20
10
100
20
20
30
20
10
100
10
20
30
20
20
100
10
20
30
20
20
100
Remember
1. Define polymer and degree of polymerization.
2. What is functionality of a polymer? Give example.
3. What is the nomenclature of a polymer?
4. Discuss the addition and chain growth polymerization with example.
5. What is copolymerization? What are the different types of copolymers?
6. Write the mechanism of addition polymerization.
7. Explain briefly the various constituents of a plastic, with example.
8. Distinguish between thermoplastics and thermosetting plastics.
9. List the various additives in processing of plastics. What are their functions?
10. Explain homogeneous and heterogeneous polymerization.
11. Write the differences between melt and interfacial polycondensation.
12. Briefly explain about emulsion polymerization.
13. Explain compression and extrusion moulding of plastics with diagram.
14. What is extrusion and injection moulding? Discuss with diagram.
15. Name any four compounding ingredients of plastics. Write their functions with example.
16. What is calendaring?
17. Write short account on reinforced plastics.
18. Outline the method of lubrication of plastic material.
19. Explain about crosslinking and blowing agents with examples.
20. Write an account of flame retardant polymers.
21. Write short notes on melt, dry and wet spinning process.
22. Give the classification of foaming polymers with examples.
23. Explain with examples the relationship between structure and properties of polymers.
24. Describe about coordination and ring opening polymerization.
Understand
1. Write the important of plasticizers and UV stabilizers?
2. Compare addition and condensation polymerization reaction with example for each type .
3. Give the classification of foaming polymers with examples.
4. Suggest different types of additives for preparing reinforced polymers?
5. What are the different types of polymeric resins?
6. Give the significances of antioxidants and antiozonants additives.
7. What are the functions of ingredients of polymers?
8. List the importance of cross- linkers.

50 marks.
228
Apply
1. How polymers are classified based on source and application?
2. What are the polymers that can be calendared into sheets?
3. Give examples for thermosetting and thermoplastic polymers.
4. What are the polymers suited for compression and injection moulding?
5. What are the articles produced by blow moulding?
Analyze / Evaluate
1. What are the polymers suitable for insulations?
2. Write the special properties of teflon?
3. How the vinyl chloride is converted into polymer?
4. How nylon 6 is prepared?
5. What is the process involved in manufacturing cellophane sheets?
6. What are the different zones involved in simple extrusion polymer process?
7. Bring out the differences between thermoforming and vacuum-forming process?
Unit I
Principles of Polymer Science
Polymerization reactions - types – examples - degree of polymerization and average molecular weights.
Thermoplastics and thermosetting resins - examples. Electrical - mechanical - thermal properties related to chemical
structure. Insulating materials - polymer alloys - composites.
Importance of glass transition temperature.
9 Hours
Unit II
Polymerization Mechanism
Addition polymerization - free radical mechanism - cationic and anionic polymerization - copolymerization condensation polymerization –nylon 6,6, ring opening polymerization –nylon 6, coordination polymerization -.
Preparation, properties and industrial applications of polystyrene and bakelite.
Application of industrial polymers.
9 Hours
Unit III
Polymerization Techniques
Homogeneous and heterogeneous polymerization – bulk polymerization- PMMA,PVC, solution polymerization polyacrylic acid, suspension polymerization-preparation of ion exchange resins, emulsion polymerization-synthetic
rubber. Melt solution and interfacial polycondensation. Salient features, advantages and disadvantages of bulk and
emulsion polymerization.
Preparation of biodegradable polymers.
9 Hours
Unit IV
Additives for Polymers
Moulding constituents-fillers, plasticizers, lubricants, anti-aging additives, antioxidants, antiozonants, UV stabilizers,
flame retardants, colorants, blow agents, crosslinking agents -functions-significance with suitable examples and
applications in industrial processing.
Ecofriendly sustainable additives.
9 Hours
Unit V
Polymer Processing
Compression – injection - extrusion and blow mouldings. Film casting - calendering. Thermoforming and vacuum
formed polystyrene, foamed polyurethanes. Fibre spinning - melt, dry and wet spinning. Composite fabrication hand-layup - filament winding and pultrusion.
Application of fibre reinforced plastics.
9 Hours
Total: 45 Hours
229
Textbook(s)
1. V. R. Gowarikar, N. V. Viswanathan and Jayadev Sreedhar, Polymer Science, New Age International (P)
Ltd., New Delhi, 2003.
2. Joel R. Fried, Polymer Science and Technology, Prentice Hall of India (P). Ltd., 2005.
Reference(s)
1.
2.
3.
4.
F. W. Billmeyer, Textbook(s)of Polymer Science, John Wiley & Sons, New York, 2007.
Barbara H. Stuart, Polymer Analysis, John Wiley & Sons, New York, 2002.
George Odian , Principles of Polymerization, John Wiley & Sons, New York, 2004.
R. J. Young and P. A. Lovell, Introduction to Polymers, Nelson Thornes Ltd., 2002.
11O0YB ENERGY STORING DEVICES AND FUEL CELLS
3 0 0 3.0
Objective(s)
 To make students understand the concept and working of different types of batteries and to analyze batteries
used in electric vehicles.
 To make students learn about the concept of fuel cells, its types and to relate the factors of energy and
environment.
 Students develop the skill of analyzing various energy storing devices and fuel cells at the end of the
semester.
Program Outcome(s)
Course Outcome(s)


understand the knowledge of various energy storing devices.
acquire the knowledge to analyze the working of different types of primary and secondary batteries.
 apply the knowledge for development of eco friendly energy sources .
Assessment Pattern
S.No.
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
Test II
Model
Examination
End Semester
Examination
20
20
30
20
10
100
20
20
30
20
10
100
10
20
30
20
20
100
10
20
30
20
20
100
Remember
1. What are dry cells?
2. What are alkaline batteries?
3. State Ohms law.

50 marks.
230
4. Write the functions of ultra-capacitor.
5. Is lead acid battery thermodynamically reversible cell?
6. Differentiate between electrochemical and electrolytic cells.
7. Name the electrolyte present in the Li battery.
8. Mention the role of heart pacemaker in cardiology.
9. Classify the types of fuel cell.
10. Differentiate between diode and electrode.
11. What is meant by redox reaction?
12. What are the advantages of H2-O2 fuel cell?
13. Name the factors which are affecting the efficiency of fuel cell.
14. What are eco-friendly cell?
Understand
1. How do you assess the life cycle of fuel cells?
2. What is the role of impurities in photovoltaic cells?
3. How do you convert the chemical energy into electrical energy?
4. Suggest any two secondary storage devices for automobiles.
5. What types of cells are used in space applications?
6. Construct the alkaline fuel cell.
7. How do you harvest the energy from tides?
8. What are natural geysers?
9. Differentiate between photo electrochemical and photovoltaic cells.
Apply
1. What are passive solar heat collectors?
2. What are active solar heat collectors?
3. Lithium battery is the cell of future - Justify.
4. Write the anodic reaction and cathodic reactions of NICAD battery.
5. Is the dry cell follows thermodynamic reversibility rule?
6. What types of vehicles typically use methanol?
7. What are the economic impacts of using hybrid electric vehicles?
Analyze / Evaluate
1. How does a fuel cell differ from traditional methods of energy generation (like batteries)?
2. What are the feedstocks can be used to make biodiesel?
3. What is DuPont‘s experience in fuel cells?
4. How the biomass is converted into biofuel?
5. What are the effects of gasoline and ethanol emissions on the environment?
6. What are the effects of diesel and biodiesel emissions on the environment?
7. How do you obtain ethanol from lignocellulosic biomass?
8. What is meant by green technology?
Unit I
Batteries
Characteristics - voltage, current, capacity, electricity storage density, power, discharge rate, cycle life, energy
efficiency, shelf life. Primary batteries- zinc-carbon, magnesium, alkaline, manganous dioxide, mercuric oxide, silver
oxide batteries-Recycling/Safe disposal of used cells.
Document the various batteries and its characteristics used in mobile phones and lap tops.
9 Hours
Unit II
Batteries for Electric Vehicles
Secondary batteries- Introduction, cell reactions, cell representations and applications- lead acid, nickel-cadmium and
lithium ion batteries - rechargeable zinc alkaline battery. Reserve batteries: Zinc-silver oxide, lithium anode cell,
photogalvanic cells. Battery specifications for cars and automobiles.
Development of batteries for satellites.
9 Hours
231
Unit III
Types of Fuel Cells
Importance and classification of fuel cells - description, working principle, components, applications and
environmental aspects of the following types of fuel cells: alkaline fuel cells, phosphoric acid, solid oxide, molten
carbonate and direct methanol fuel cells.
Fuel cells for space applications.
9 Hours
Unit IV
Hydrogen as a Fuel
Sources of hydrogen – production of hydrogen- electrolysis- photocatalytic water splitting – biomass pyrolysis -gas
clean up – methods of hydrogen storage- high pressurized gas -liquid hydrogen type -metal hydride – hydrogen as
engine fuel – features, application of hydrogen technologies in the future- limitations.
Cryogenic fuels.
9 Hours
Unit V
Energy and Environment
Future prospects-renewable energy and efficiency of renewable fuels – economy of hydrogen energy – life cycle
assessment of fuel cell systems. Solar Cells: Energy conversion devices, photovoltaic and photoelectrochemical cells
– photobiochemical conversion cell.
Bio-fuels from natural resources.
9 Hours
Total: 45 Hours
Textbook(s)
1. M. Aulice Scibioh and B. Viswanathan, Fuel Cells: Principles and Applications, University Press, India,
2006.
2. F. Barbir, PEM fuel cells: Theory and practice,Elsevier, Burlington, MA, 2005.
3. M. R. Dell Ronald and A. J. David, Understanding Batteries, Royal Society of Chemistry, 2001.
Reference(s)
1. M. A. Christopher Brett, Electrochemistry: Principles, Methods and Applications, Oxford University, 2004.
2. J. S. Newman and K. E. Thomas-Alyea, Electrochemical Systems, Wiley, Hoboken, NJ, 2004.
3. G. Hoogers, Fuel Cell Handbook, CRC, Boca Raton, FL, 2003.
4. Lindon David, Handbook of Batteries, McGraw Hill, 2002.
5. H. A. Kiehne , Battery Technology Hand Book,. Expert Verlag , Renningen Malsheim, 2003.
11O0YC CHEMISTRY OF NANOMATERIALS
3 0 0 3.0
Objective(s)
 To impart knowledge on the basic concepts and importance of nanochemistry including synthesis.
 To make students understand the principles and applications of nanomaterials.
 Knowledge about the characterization and applications of nanomaterials.
Program Outcome(s)
Course Outcome(s)





familiar with fundamentals of nanoscience and technology and acquire the capability of applying them.
acquire comprehensive knowledge in the synthetic methods for the nanoparticles preparation.
get strong foundation in the properties of nanoparticles which give contextual knowledge for their higher
research programmes.
get vital understanding in the characterization of nanoparticles
furnish the knowledge and skills for entry level placement in core industry as well as scientific software
concerns.
232
Assessment Pattern
S.No
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
Test II
25
25
20
20
10
100
25
25
20
20
10
100
Model
Examination
15
25
20
20
20
100
End Semester
Examination
15
25
20
20
20
100
Remember
1. What do you mean by nano?
2. Define nanotechnology.
3. Define nanoscience.
4. Define top down and bottom up approach.
5. Define nanostructured material. Classify nanomaterials and give examples for them.
6. List any four day to day commercial applications of nanotechnology.
7. Write down any four challenges that are faced by researchers in nanotechnology.
8. Define carbon nanotube.
9. Define bucky ball.
10. Define nanocomposite. What are the types of nanocomposites?
11. List any four material characterization techniques.
12. List any four bottom up approaches for the synthesis of nanopowders.
13. What is biomimetic approach?
14. Explain Feynman‘s statement.
15. What is the dimension of quantum dot?
16. Explain the principle behind lithography.
17. Mention the different types of lithography.
18. What is meant by photolithography?
19. Explain the principle behind vapour phase deposition.
20. What is meant by chemical vapour deposition?
21. Explain sputtering.
22. What is meant by plasma enhanced CVD?
23. What is meant by bubblers?
24. Explain the principle behind MOVPE.
25. What are colloids?
26. What is nanosafety?
27. What is meant by surface induced effect?
28. How are nanomaterials defined?
29. What are the uses of nanoparticles in consumer products?
Understand
1. What is the difference between nanoscience and nanotechnology?
2. When and where Feynman delivered his lecture on nanotechnology and what is the name of his classical
lecture?
3. What are the induced effects due to increase in surface area of nanoparticles?

50 marks.
233
4. What are the advantages and disadvantages in mechanical synthesis of nanopowders?
5. What are the characteristics of nanoparticles that should be possesed by any fabrication technique?
6. On what principle mechanical milling is based on?
7. How is LPE used to obtain nanowire or nanorods?
8. How is the template used to obtain nanowire or nanorods?
9. What is the role of nanotechnology in water purification?
10. Differentiate self-assembly from self-organisation.
11. How nanoparticles are stored?
12. List the important physical and chemical properties of nanomaterials?
13. How are nanomaterials detected and analysed?
14. How are nanomaterials prepared for biological testing?
15. What are the physical and chemical properties of nanoparticles?
16. How are nanoparticles formed?
17. Discuss the health effects of nanoparticles?
Apply
1. Why do we want nanotechnology in our life?
2. What is the role of nanotechnology in medicinal field?
3. Expand AFM.
4. What is the grain size range of nanostructure materials?
5. Differentiate top-down from bottom-up approach needed for nanosynthesis.
6. Why do nanostructured particles find potential applications?
7. How nanostructured particles are used in health applications?
Analyze/ Evaluate
1. Compare the relative merits of chemical, physical, biological and hybrid methods for the preparation of
nanomaterials.
2. Compare the relative merits of the usage of photons and particles in lithography.
3. Differentiate glow discharge from RF sputtering.
4. How can we reduce/save our energy resources by using nanotechnology?
5. What is the relation between properties and applications of nanoparticles?
6. What is the current status of nanoscience and nanotechnology?
7. What are the potential harmful effects of nanoparticles?
Unit I
Nanoworld
Introduction – History of nanomaterials – concepts of nanomaterials – size and confinement effects – nanoscience –
nanotechnology – Moor‘s law. Properties – electronic, optical, magnetic, thermal, mechanical and electrochemical
properties. Nanobiotechnology – molecular motors – optical tweezers.
First industrial revolution to the nano revolution.
9 Hours
Unit II
Synthesis of Nanoparticles
Introduction – hydrolysis-oxidation - thermolysis – metathesis - solvothermal methods. Sonochemistry: nanometals powders of metallic nanoparticles - metallic colloids and alloys - polymer metal composites - metallic oxides - rare
earth oxides - mesoporous materials - mixed oxides. Sono electrochemistry - nanocrystalline materials. Microwave
heating - microwave synthesis of nanometallic particles.
Magnetron sputtering process to obtain nanomaterials.
9 Hours
Unit III
Types and Functionalization of Nanomaterials
Polymer nanoparticles, micro, meso and nanoporous materials. Organic – inorganic hybrids, zeolites,
nanocomposites, self-assembled monolayers, semiconductor quantum dots, nanofibres, supramolecular
nanostructures. functionalization of nanomaterials – stabilization methods. Reactivity of ω-functional groups on
ligand shells.
Implications of nanoscience and nanotechnology on society.
9 Hours
234
Unit IV
Physical and Chemical Characterization
Electron microscopes: scanning electron microscope (SEM) – transmission electron microscope (TEM) – atomic
force microscope (AFM): working principle – instrumentation – applications. UV-visible spectroscopy: principle –
instrumentation (block diagram only) – applications. FT-IR spectroscopy: introduction – instrumentation (block
diagram only) – applications –merits and demerits.
Nanoscience and technology research institution.
9 Hours
Unit V
Applications of Nanomaterials
Nanocatalysis, colorants and pigments, self-cleaning – lotus effect, anti-reflective coatings, antibacterial coatings,
photocatalysis, nanofilters for air and water purifiers. Thermal insulation – aerogels, smart sunglasses and transparent
conducting oxides – molecular sieves – nanosponges.
Harnessing nanotechnology for economic and social development.
9 Hours
Total: 45 Hours
Textbook(s)
1. C N R Rao, Nanoworld – An Introduction to Nanoscience and Technology, Jawaharlal Nehru centre for
advanced scientific research, Bangalore, India, 2010.
2. C N R Rao, A Muller and A K Cheetham, The Chemistry of Nanomaterials: Synthesis, Properties and
Applications, Vol. 1 & 2, John-Wiley and Sons, 2005.
3. T Pradeep, Nano: The Essentials, Understanding Nanoscience and Nanotechnology, 1st Edn., Tata Mcgraw
Hill publishing company, 2007.
Reference(s)
1. Geoffrey A Ozin, André C Arsenault , Nanochemistry: A Chemical Approach to Nanomaterials, Royal
Society of Chemistry, 2009.
2. G B Sergeev, Nanochemistry, 1st Edn.,Elsevier, 2006.
3. S Chen, Functional Nanomaterials: A Chemistry and Engineering Perspective (Nanostructure Science And
Technology), Springer,2010.
4. Yury Gogotsi, Nanomaterials Handbook, Taylor and Francis group, USA, 2006.
11O0YD
CORROSION SCIENCE AND ENGINEERING
3 0 0 3.0
Objective(s)
 To impart knowledge about the various types of corrosion and its mechanism.
 To make students understand the various methods of corrosion control, corrosion testing and monitoring.
 Students acquire the basic knowledge about corrosion and its control.
Program Outcome(s)
Course Outcome(s)
 familiar with fundamentals of corrosion science and technology and acquire the capability of applying
them.
 get dynamic understanding in the types of corrosion and role of chemistry behind the corrosion.
 demonstrate their ability to identify, formulate and solve corrosion based problems.
 have strong foundations in the designing of engineering products with corrosion protective mode.
 have strong foundations in the analytical part of corrosion science which give contextual knowledge to
their higher research programmes.
235
Assessment Pattern
S.No.
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
Test I
Test II
25
25
20
20
10
100
25
25
20
20
10
100
Model
Examination
15
25
20
20
20
100
Semester End
Examination
15
25
20
20
20
100
Remember
1. What is corrosion?
2. What are the types of corrosion?
3. Define dry corrosion. Explain the mechanism.
4. Explain the mechanism of electrochemical corrosion.
5. What are the units to measure corrosion rate?
6. Galvanic corrosion. Discuss.
7. Describe the Pourbaix digrams of Mg, Al and Fe and their limitations.
8. List out the different forms of corrosion. Explain.
9. What are inhibitors?
10. Explain the mechanisms of various corrosion scale formation and its types.
11. Write the working principle of Tafel polarization techniques.
12. How polarization and impedance techniques used to measure the corrosion products?
13. Define cathodic protection. List its types.
14. What are non-electrochemical and electrochemical methods of corrosion testing and monitoring?
15. What is Tafel linear polarization?
Understand
1. Explain why corrosion rate of metal is faster in aqueous solution than atmosphere air?
2. What are the factors influencing the corrosion rate? Explain.
3. Discuss the Pilling-Bedworth rule.
4. Differentiate between electrochemical and dry corrosion.
5. How inhibitors are used to protect the corrosion rate of the metal? Explain.
6. What are consequences of Pilling-Bedworth ratio?
7. List the difference between filliform corrosion and pitting corrosion.
Apply
1. Compare the effects of corrosion products.
2. Why pitting corrosion is localized corrosion? Explain.
3. Describe alternatives to protective coatings.
4. Identify different forms of corrosion in the metal surface.
5. Explain how we could reduce corrosion of metals.
6. What are the measures to be taken to reduce corrosion fatiques?
7. What are the major implications of enhanced techniques of corrosion product analysis?
Analyze/ Evaluate
1. List reasons why it is important to study of corrosion.
2. How Tafel polarization and impedance techniques used to measure the corrosion products?
3. Explain how we could reduce corrosion of metals?

50 marks.
236
Unit I
Introduction to Corrosion
Importance and cost of corrosion – spontaneity of corrosion – passivation - importance of corrosion prevention in
various industries - the direct and indirect loss of corrosion- galvanic corrosion: area relationship in both active and
passive states of metals - Pilling Bed worth ratio and its consequences - units of corrosion rate - mdd and mpy importance of pitting factor - Pourbaix digrams of Mg, Al and Fe and their advantages and disadvantages.
Corrosion of metals by other gases.
9 Hours
Unit II
Forms of Corrosion
Different forms of corrosion - uniform corrosion-galvanic corrosion, crevice corrosion, pitting corrosion,
intergranular corrosion, selective leaching, erosion corrosion, stress corrosion- high temperature oxidation, kinetics of
protective film formation and catastrophic oxidation corrosion.
Industrial boiler corrosion, cathodic and anodic inhibitors
9 Hours
Unit III
Mechanisms of Corrosion
Hydrogen embrittlement- cracking, corrosion fatigue - filliform corrosion, fretting damage and microbes induced
corrosion. Mechanisms of various corrosion scale formation - thick layer and thin layer - insitu corrosion scale
analysis.
Analyze the rust formation in mild steel using weight loss method
9 Hours
Unit IV
Cathodic and Anodic Protection Engineering
Fundamentals of cathodic protection - types of cathodic protection systems and anodes. Life time calculations rectifier selection. Stray current corrosion problems and its prevention. Coating for various cathodic protection
system and their assessment- inhibitors - corrosion of steels. Anodic protection-Design for corrosion control.
Role of paints and pigments to protect the corrosive environment
9 Hours
Unit V
Corrosion Testing and Monitoring
Corrosion testing and monitoring - electrochemical methods of polarization- Tafel extrapolation polarization, linear
polarization, impedance techniques-Weight loss method - susceptibility test – testing for intergranular susceptibility
and stress corrosion.
Analyze the instruments for monitoring the corrosion.
9 Hours
Total: 45 Hours
Textbook(s)
1. Zaki Ahmad, Principles of Corrosion Engineering and Corrosion Control, Elsevier Science and Technology
Books, 2006.
2. R. Winstone Revie and Herbert H. Uhlig, Corrosion and Corrosion Control: An Introduction to Corrosion
Science and Engineering, John Wiley & Science, 2008.
3. Mars G. Fontana, Corrosion Engineering, Tata McGraw Hill, Singapore, 2008.
Reference(s)
1. ASM Hand Book, Vol. 13, Corrosion, ASM International, 2005.
2. Pierre R. Roberge, Hand Book of Corrosion Engineering, McGraw Hill, New York, 2000.
3. Denny A. Jones, Principles and Prevention of Corrosion, Prentice Hall Inc., 2004.
4. A.W. Peabody, Control of Pipeline Corrosion, NACE International, Houston, 2001.
237
ENTERPRENEURSHIP ELECTIVES
11O001 ENTREPRENEURSHIP DEVELOPMENT I
3 0 0 3.0
Objective
 To gain knowledge on basics of Entrepreneurship
 To gain knowledge of business entity, source of capital and financially evaluate the project
 To gain knowledge on production and manufacturing system.
Program Outcome(s)
profession and our society
Course Outcome(s)
 Entrepreneurial thinking
 Innovation techniques in developing business
 Legal aspects of a business
 Skills on finance and cash flow
 Skills on planning operations
Assessment Pattern
Bloom’s Taxonomy
Model
End Semester
S. No.
Test I†
Test II†
(New Version)
Examination†
Examination
1
Remember
20
20
20
20
2
Understand
20
20
20
20
3
Apply
20
20
20
20
4
Analyze
10
10
10
10
5
Evaluate
20
20
20
20
6
Create
10
10
10
10
Total
100
100
100
100
Remember
1. What is entrepreneurship?
2. What are the factors that motivate people to go into business?
3. Define a small-scale industry.
4. Define tiny industry.
5. Who is an intrapreneur?
6. State functions of SISI.
7. What is serial entrepreneur?
8. What is Technopreneurship?
9. What is reversal method?
10. What is brainstorming?
11. What do you mean by term business idea?
12. Mention any two schemes Indian government provides to the development of entrepreneurship.
238
13. What is a project report?
14. What is project scheduling?
15. Mention any four techniques available for project scheduling.
16. What is contract act?
17. Define MOU.
18. What are al the types of sources of finance for an entrepreneur?
19. Mention any five external sources of finance to an entrepreneur.
20. Classify the financial needs of an organization.
21. What is short term finance?
22. What is return on capital?
23. What is capital budgeting?
24. What is product design?
25. What is quality council?
26. What is inventory?
27. What is lean manufacturing?
Understand
1. Why is entrepreneurship important of growth of a nation?
2. Mention the essential quality required for someone to be an entrepreneur.
3. Why is motivational theories important for an entrepreneur?
4. How is network analysis helpful to the development of an entrepreneur?
5. Mention the essential requirements for a virtual capital.
6. How under-capitalization affects an entrepreneur.
7. Differentiate proprietorship and partnership.
8. Mention the causes of dissolution of a firm.
9. How important is the support of IDBI to an entrepreneur?
10. What are the salient features of New Small Enterprise Policy, 1991?
11. Why scheduling is very important for a production design?
Apply / Evaluate
1.
2.
3.
4.
5.
If you want to become as an entrepreneur, what will be your idea?
Select any one of the creative idea generation method and suggest an innovation that you can implement in
your business.
Write a short notes on various legal aspects that you have to consider to run you business.
How will you generate you capital and other financial supports?
In case of getting enough financial support, plan your business and plot the various stages using any of the
tools or techniques.
Create
1. Draft a sample project report for your business.
2. Do a network analysis using PERT and CPM for your business plan.
3. Write a brief report to apply to a financial organization for seeking financial support to your business.
Unit I
Basics of Entrepreneurship
Entrepreneurship Competence, Entrepreneurship as a career, Intrapreneurship, Social entrepreneurship, Serial
entrepreneurship (Cases), Technopreneurship.
Entrepreneurial Motivation
6 Hours
239
Unit II
Generation of Ideas
Creativity and Innovation (Cases), Lateral thinking, Generation of alternatives (Cases), Fractionation, Reversal
Method, Brain storming
Utilization of Patent Databases
8 Hours
Unit III
Legal Aspects of Business
Contract Act, Sale of Goods Act, Negotiable Instruments – Promissory Note, Bills and Cheques, Partnership, Limited
Liability Partnership (LLP), Companies Act – Kinds, Formation, Memorandum of Association, Articles of
Association (Cases).
Business Plan Writing
10 Hours
Unit IV
Business Finance
Project evaluation and investment criteria (Cases), Sources of finance, Financial statements, Break even analysis,
Cash flow analysis.
Calculation of Return on Investment
11 Hours
Unit V
Operations Management
Importance – Functions –Deciding on the production system – Facility decisions: Plant location, Plant Layout
(Cases), Capacity requirement planning – Inventory management (Cases) – Lean manufacturing.
Project Planning
10 Hours
Total: 45 Hours
Textbook(s)
Donald F. kuratko, Entrepreneurship – Theory, Process & Practice, South western cengage learnng, USA,
2009.
Reference(s)
1. Hisrich, Entrepreneurship, Tata McGraw-Hill Publishing Company Limited, New Delhi, 2005.
2. Prasanna Chandra, Projects – Planning, Analysis, Selection, Implementation and Reviews, Tata McGrawHill Publishing Company Limited, New Delhi, 2000.
3. Akhileshwar Pathak, Legal Aspects of Business, Tata McGraw Hill, 2006.
4. Norman Gaither and Greg Frazier, Operations Management, Thomson Learning Inc, 2007.
5. Edward De Bono, Lateral Thinking, Penguin Books, 1990.
6. http://www.enterweb.org
7. http://www.internationalentrepreneurship.com/asia_entrepreneur/India_entrepreneur.asp
8. http://indiakellogg.wordpress.com
11O002 ENTREPRENEURSHIP DEVELOPMENT II
3 0 0 3.0
Objective(s)
 Evolve the marketing mix for promoting the product / services
 Handle the human resources and taxation
 Understand Government industrial policies / support provided and prepare a business plan.
240
Program Outcome(s)
profession and our society
Course Outcome(s)
 Increase in awareness of the entrepreneurship Development for engineering decisions.
Assessment Pattern
S. No.
1
2
3
4
5
6
Bloom’s Taxonomy
(New Version)
Remember
Understand
Apply
Analyze
Evaluate
Create
Total
30
30
20
10
10
--
Model
Examination†
30
25
20
10
10
05
End Semester
Examination
30
25
20
10
10
05
100
100
100
Test I†
Test II†
30
30
20
10
10
-100
Remember
1. Who are Fabian Entrepreneur?
2. Explain the Views on Schumpeter on Entrepreneurship?
3. Mention the three functions of NSIC?
4. Narrate the role of IDBI in the development of Entrepreneurship?
5. What are Project Objective(s)?
6. What are the stages in a Project Lifecycle?
7. Give the meaning of Feasibility Report?
8. Explain the objective of Entrepreneurial Training?
9. What is Motivating Training?
10. Who is a Small Scale Entrepreneur?
11. How to develop Rural Entrepreneur?
12. What are the Social Problems of Women Entrepreneur?
13. Differentiate between entrepreneur and entrepreneurship.
14. What are the types of entrepreneurs?
15. Explain the various qualities of entrepreneur.
16. Briefly explain the different merchant castes in India.
17. What is entrepreneurship training?
18. Discuss any three programmes supporting women entrepreneurs.
19. Write a note on the role of NISIET.
20. What are the challenges and opportunities available in SSI's?
Understand
1. Narrate any six differences between a Manager and an Entrepreneur?
2. Explain briefly various types of Entrepreneur?
3. What are the elements of EDP?
4. What is the role played the commercial banks in the development of Entrepreneur?
5. How would you Classify Projects?
241
6. What are the stages in project Formulation?
7. What are the target groups of EDP?
8. What are the major problems faced by Small Entrepreneur?
9. What are the problems & prospects for women entrepreneur in India?
Apply/Evaluate
1. Describe the various functions performed by Entrepreneurs?
2. Explain the role of different agencies in the development of Entrepreneur?
3. Discuss the criteria for selecting a particular project?
4. Describe the role of Entrepreneur in the Development of Country?
5. Define business idea. Elaborate the problems and opportunities for an entrepreneur.
6. Elaborate the schemes offered by Commercial banks for development of entrepreneurship.
7. Explain the significant role played by DIC & SISI for the development of entrepreneurship.
8. Design a short Entrepreneurship development programme for farmer
9. Discuss the role and importance of the following institutions in promoting, training and developing
entrepreneurs in India:
Create
1. All economy is the effect for which entrepreneurship is the cause"-Discuss.
2. Review the entrepreneurial growth by the communities of south India.
3. What are the problems of Women entrepreneurs and discuss the ways to overcome these
barriers?
4. Discuss the importance of small scale industries in India.
5. Critically examine the growth and development of ancillarisation in India.
6. Discuss the various sources and collection of credit information of entrepreneurs.
7. Briefly explain the recommendation and policy implication for survival of SME's.
8. Discuss the role of the Government both at the Central and State level in motivating and developing
entrepreneurship in India.
9. ―Developing countries like India need imitative entrepreneurs rather than innovative entrepreneurs‖. Do you
agree? Justify your answer with examples.
10. What are the reasons of very few women becoming entrepreneurs in a developing country like India?
Whether Indian women entrepreneurs have now made an impact and shown that they too can contribute in
economic development of the country? Discuss with examples.
11. Discuss the ―Culture of Entrepreneurship‖ and its role in economic development of a nation. What factors
contribute to nurturing such a culture?
Unit I
Marketing Management
Formulating Marketing strategies, The marketing plan, Deciding on the marketing mix (Cases), Interactive
marketing, Marketing through social networks, Below the line marketing, International marketing - Modes of Entry,
Strategies (Cases).
Five P's of marketing, SSI Policy Statement
10 Hours
Unit II
Human Resource Management
Human Resource Planning (Cases), Recruitment, Selection, Training and Development, HRIS, Factories Act 1948
(an over view)
Global Trends in Human Resource Management
10 Hours
Unit III
Business Taxation
Direct taxation – Income tax, Corporate tax, MAT, Tax holidays, Wealth tax, Professional tax (Cases).
Indirect taxation – Excise duty, Customs, Sales and Service tax, VAT, Octroi, GST(Cases)
Recent Trends for a Troubled Tax, professional tax slab
8 Hours
242
Unit IV
Government Support
Industrial policy of Central and State Government, National Institute and Agencies, State Level Institutions, Financial
Institution
Global Entrepreneurship Monitor, Excise Exemption Scheme
7 Hours
Unit V
Business Plan Preparation
Purpose of writing a business plan, Capital outlay, Technical feasibility, Production plan, HR plan, Market survey
and Marketing plan, Financial plan and Viability, Government approvals, SWOT analysis.
Small Industry Cluster Development Programme, National Equity Fund Scheme
10 Hours
Total: 45 Hours
Textbook(s)
1. S. S. Khanka, Entrepreneurial Development, S. Chand & Co, New Delhi, 2010
Reference(s)
1. Hisrich, Entrepreneurship, Tata McGraw Hill, New Delhi, 2005.
2. Philip Kotler, Marketing Management, Prentice Hall of India, New Delhi, 2003.
3. K. Aswathappa, Human Resource and Personnel Management – Text and Cases, Tata McGrawHill, 2007.
4. P. C. Jain, Handbook for New Entrepreneurs, EDII, Oxford University Press, New Delhi, 2002.
5. Akhileshwar Pathak, Legal Aspects of Business, Tata McGraw Hill, 2006.
6. http://niesbud.nic.in/agencies.htm
7. http://www.planware.org/businessplan.htm
8. http://www.nenonline.org
9. www.forbes.com/managing/
10. www.bizplanprep.com/
11. http://business.gov.in/enterprises/govt_support.php
ONE CREDIT COURSES
11Z0XA CLOUD COMPUTING
- - - 1.0
Objective(s)
 To study about the cloud computing environment.
 To learn about the basics of cloud services.
 To gain knowledge about social networks.
Introduction Cloud Computing: How cloud computing works – Pros and Cons of cloud computing –developing cloud
services – Types of cloud service development - Cloud computing for the family –cloud computing for community cloud computing for corporation.
Collaborating via Web-based communication tools: Evaluating Web mail services –Evaluating instant messaging
services - Evaluating Web Conferencing tools - Collaborating via social networks and groupware – creating groups
on social networks – Evaluating online groupware.
Total: 20 Hours
Textbook(s)
Michael Miller, Cloud Computing, Pearson Education, New Delhi, 2009
243
11Z0XB QUANTUM COMPUTING
- - - 1.0
Objective(s)
 To understand the building blocks of a quantum computer.
 To understand the principles, quantum information and limitation of quantum operations formalizing.
 To understand the quantum error and its correction.
Fundamental Concepts: Global Perspectives, Quantum Bits, Quantum Computation, Quantum Algorithms, Quantum
Information, Postulates of Quantum Mechanisms.
Quantum Computation : Quantum Circuits – Quantum algorithms, Single Orbit operations, Control Operations,
Measurement, Universal Quantum Gates, Simulation of Quantum Systems, Quantum Fourier transform, Phase
estimation, Applications, Quantum search algorithms – Quantum counting – Speeding up the solution of NP –
complete problems – Quantum Search for an unstructured database.
Quantum Computers : Guiding Principles, Conditions for Quantum Computation, Harmonic Oscillator Quantum
Computer, Optical Photon Quantum Computer – Optical cavity Quantum electrodynamics, Ion traps, Nuclear
Magnetic resonance.
Total: 20 Hours
Reference
1. Micheal A. Nielsen. & Issac L. Chiang, Quantum Computation and Quantum Information, Cambridge
University Press, 2006
11Z0XC EXTREME PROGRAMMING
- - - 1.0
Objective(s)
 To study about the problems in software quality.
 To understand the methods to improve the software quality.
 To study about the implementation of XP.
The Problem: Risk - The Basic Problem -A Development Episode - Economics of Software Development - Four
Variables - Cost of Change - Learning to Drive - Four Values Communication.
The Solution: A Quick Overview - How Could This Work? - Management Strategy - Facilities Strategy - Splitting
Business and Technical Responsibility - Planning Strategy - Development Strategy - Design Strategy
Implementing XP: Adopting XP - Retrofitting XP - Lifecycle of an Ideal XP Project - Roles for People - 20–80 Rule
- What Makes XP Hard - When You Shouldn't Try XP - XP at Work.
Total: 20 Hours
Reference(s)
1. Kent Beck, Extreme programming explained: embrace change, Addison-Wesley, September 2004.
2. Chromatic, Extreme programming Pocket guide, O‘reilly, 2003.
11Z0XD MOBILE OPERATING SYSTEMS
- - - 1.0
Objective(s)
 To learn mobile operating systems.
 To understand the architectures of emerging mobile OS.
 To develop applications using mobile OS.
Introduction to Android: Android-Features-Architechture-Applications-Application framework-Libraries-Application
fundamentals-Application components-The Manifest file-Application resources.
Meego: Introduction to the meego project-Meego architechture-Meego notebook UX-Benefits of the Meego software
platform-Meego applications.
Symbian: Introduction to symbian OS-versions of symbian-user interfaces-Features-Architecture-Application
development
Total: 20 Hours
244
Reference(s)
1. http://developer.android.com/guide/topics/fundamentals.html
2. http://wiki.meego.com/images/MeeGo_Introduction.pdf
3. http://www.symbioosi.net/English/symbian_os_en.html
4. http://en.wikipedia.org/wiki/Symbian
11Z0XE GREEN COMPUTING
- - - 1.0
Objective(s)
 To learn to minimize energy consumption.
 To have the knowledge of purchasing green energy and using green suppliers.
 To learn to reduce paper and other consumables usage.
Trends and reasons to go green: Overviews and issues-Current initiatives and standards - Organisation planning for
Green computing-Policies-metrics-The acorns diagram
Consumption Issues: Minimizing power usage-Cooling-Going paperless-recycling-Hardware consideration
The Greening Process: Datacenter design and Redesign-Virtualisation-server virtualization-server virtualization
solutions - Implementation-Storage virtualization - Virtualisation types-Storage virtualization solutions-server
savings-storage savings.
Total: 20 Hours
Textbook(s)
1. Toby J.Velte, Anthony T.Velte,Robert ElsenPeter, Green IT, McGrawHill, 2008.
Reference(s)
1. John Lamp, The Greening IT, IBM Press, 2005.
2. Lawrence Webber, Michael Wallace, GreenTech, AMACOM publication, USA, 2009.
11Z0XF INTERNET MARKETING
- - - 1.0
Objective(s)
 To understand the E-Marketing context
 To describe marketing strategies of segmenting, targeting, positioning, and differentiation
 To evaluate several customer relationship management (CRM) strategies using internet technology
(b) Apply their knowledge and skills to succeed in a computer science and/or obtain
(f) Organize and maintain the information of an organization.
an advanced degree.
Course Outcome(s) (COs)
 Understand the importance of e-marketing
 Know the basics of internet marketing strategy
Theories of E-Marketing - Introduction to E-Marketing - E-Marketing Plan - Strategic E-Marketing and Performance
Metrics - The E-Marketing Plan - Internet Marketing Overview - Website Planning & Development - Let Companies
Search you on Google for Jobs - Internet Marketing Strategy and Planning - Search Engine Optimization - Social
Media Marketing - Make E-Commerce website in 20 Minutes - Introduction- ATM - Selling Products Through Online
Modes - Making Money via Adsense and Blogging - Explore your Talent to earn money through Internet - Affiliate
Marketing- Making Tons of Money Part Time - Making Money as a FreeLancer.
245
Reference(s)
1. Mary lou Roberts, Debra Zahay ―Internet Marketing: Integrating Online and Offline Strategies‖, Tata
McGraw Hill, 2012
11Z0XG BIG DATA ANALYTICS
- - - 1.0
Objective(s)
 To describe the basic idea of Big Data
 To analyze the data analytics lifecycle and methodology
 To design un structured data analytics
(b) Apply their knowledge and skills to succeed in a computer science and/or obtain an advanced degree.
(d) Demonstrate problem solving and design skills including the ability to formulate problems and their solutions,
 Understand the how analytics and big data affect various functions including marketing and business
 Know the basics of big data on the information industry and the external ecosystem for analytical and data
services
Introduction - Big Data Overview - Data sciences - The rising and importance of data sciences - Big data analytics in
industry verticals - Data Analytics Lifecycle and methodology - Business Understanding - Data Understanding - Data
Preparation – Modeling – Evaluation - Communicating results – Deployment - Data exploration & preprocessing Data Analytics: Theory & Methods - Supervised learning - Unsupervised learning - Unstructured Data Analytics.
Reference(s)
1. Michael Minelli , Michele Chambers , Ambiga Dhiraj ," Big Data, Big Analytics: Emerging Business
Intelligence and Analytic Trends for Today's Businesses‖, 1st Edition, Wiley, Jan 2013.
2.
Dr. Arvind Sathi, ―Big Data Analytics: Disruptive Technologies for Changing the Game‖, Mc Press, 1st
edition, February 2013.
11Z0XH MATLAB FOR ENGINEERS
- - - 1.0
Objective(s)
 To describe the basic idea of graphical model
 To analyze the time series and spatial time series data in real applications
 To design statistical models to predict and modeling
a) Apply basic principles and practices of computing grounded in mathematics and science to successfully complete
software related projects to meet customer business Objective(s) and/or productively engage in research.
c) Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize computing
works under given constraints.
 Understand the programming constructs of MATLAB
 Use MATLAB for interactive computations
246
About MATLAB - MATLAB Environment - Built In MATLAB Functions - Manipulating MATLAB Matrices –
Plotting - User-Defined Functions - User-Controlled Input and Output - Logical Functions and Control Structures Matrix Algebra - Symbolic Mathematics.
Reference(s)
1. Michael Minelli , Michele Chambers , Ambiga Dhiraj ," Essential Matlab for Engineers and Scientists ‖, 5th
Edition, Academic press, Jan 2013.
2.
Dr. Arvind Sathi, ―Matlab, Third Edition: A Practical Introduction to Programming and Problem Solving‖,
Butterworth-Heinemann, 3rd edition , July 2013.
11Z0XI ASP .NET
- --1.0
Objective(s)
 To describe the basic concepts of .NET framework
 To analyze the types of access specifiers
 To design ASP.NET page
 Demonstrate an ability to use techniques, skills, and modern computing tools to implement and organize
 Demonstrate problem solving and design skills including the ability to
formulate problems and their solutions, think creatively and communicate
effectively.
 Understand the ASP .NET programming model
 Develop web applications using ASP.NET Web Forms.
 Create distributed data-driven applications using the .NET Framework, C#, SQL Server and ADO.NET
Introduction of .NET framework - Windows application, Web application - IDE for C# - Overview of C# language OOPs concepts - Program structure - Explain the C# simple program- Declaring Variable - Data types – Operators Conditional constructs - Loop constructs -Abstraction and Encapsulation - Type of Access Specifiers - Creating Class
and objects - Using Methods-Inheritance- Multithreaded
Introduction of Database - DBMS & RDBMS concepts - Overview of SQL Server 2008 - DDL, DML, DCL & DQL
commands - Constrains - Querying Data from table - Inner Join – Outer Join - Cross Join – Self Join & Aggregate
functions and Sub query - Creating and Managing Views
Using controls in ASP.NET page - Standard controls – Validation – Navigation- Creating Mail Registration form using
Standard and Validation control- Working with Multiple Web pages using Navigations, CSS Style sheets -Applying
Themes and creating Master page - Hidden fields - Cookies - Query string - Session state
ADO.NET Architecture - Features - Accessing Data with ADO.NET, Inserting and Reading data using database,
working with gird view- Creating Simple Telephone directory with data base - Publishing ASP.NET web page to IIS
and Internet
Reference
1. Adam Freeman ," Pro ASP.NET MVC 4 ‖, 4th Edition, Academic press, Jan 2013.
247
11Z0XJ PYTHON PROGRAMMING
- - -1.0
Objective(s)
 To describe the basic concepts of PHYTON programming
 To analyze the syntax and styles
 To design functions, modules and classes.
(a) Apply basic principles and practices of computing grounded in mathematics and science to successfully
research.
 Understand the basic concepts of python programming.
 Solve the design oriented problems using python programming.
Open source software with examples - Introduction about Python- Syntax and Styles –Numbers –Lists –Tuples –
Dictionaries - Python Objects – Sequences - Conditionals and Loops in Python- Python Files I/O - Exceptions in
Python – Functions –Modules -Classes and oops in Python.
Reference(s)
1. Vernon L. Ceder ," The Quick Python Book‖, 2nd Edition, Manning Publications, Jan 2010.
2. Alex Martelli, ―Python in a Nutshell‖, o'reilly Publications, 3rd edition, July 2010.
SPECIAL COURSES
11Z0RA SEMANTIC WEB
- - - 3.0
Objective(s)
 To Provide practical information in modeling data to fit the requirements of the Semantic Web.
 To Learn the major advance in the Web 3.0
 To study the real-world problems and technologies that forms the semantic Web.
Fundamentals: Defining the Semantic Web - Semantic Web Roadblocks Components – Types- Major Programming
Components-Impacts-Establishing a Web Data–Centric Perspective-Expressing Semantic Data- Avoiding the
Roadblocks, Myths, and Hype – Ontological Commitments – Categories – Philosophical Background - Knowledge
Representation Ontologies – Top Level – Linguistic – Domain – Semantic Web – Need –Foundation – Layers –
Architecture.
Languages for Semantic Web and Ontologies:Web Documents in XML – RDF - Schema – Web Resource
Description using RDFRDF Properties – Topic Maps and RDF – Overview – Syntax Structure – Semantics –
Pragmatics - Traditional Ontology Languages – LOOM- OKBC – OCML – Flogic Ontology Markup Languages –
SHOE – OIL - DAML + OIL- OWL
Ontology Learning for Semantic Web: Taxonomy for Ontology Learning – Layered Approach – Phases of Ontology
Learning –Importing and Processing Ontologies and Documents – Ontology Learning Algorithms –Evaluation
Ontology Management and Tools: Overview – need for management – development process – target ontology –
ontology mapping – skills management system – ontological class – constraints – issues. Evolution – Development of
Tools and Tool Suites – Ontology Merge Tools – Ontology based Annotation Tools.
248
Applications: Web Services – Semantic Web Services - Case Study for specific domain – Security issues – current
trends.
Reference(s)
1. Journal of Web Semantics: Science, Services and Agents on the World Wide Web, New Delhi, Elsevier.
2. International Journal on Semantic Web and Information Systems, Information Resources Management
Association.
11Z0RB SEARCH ENGINE OPTIMIZATION
- - - 3.0
Objective(s)
 To increase the ranking of a website on a search engine.
 To increase product sales or enquiries.
 To learn about SEO.
Introduction : Search engine Basics-Surveying The SE Landscape-SE-Friendly web site Makeover-Making UsefulPicking Powerful Keywords
Building Search Engine Friendly Sites: Creating Pages-Avoiding things-Dirty deeds-Bulking up your site - Adding
Site to the indexes & Directories - Getting your pages into the SE-Submitting the directories-Buried Treasure
After Submission: Using Link Popularity to Boost Your Position-Finding sites to link to yours-Using the shopping
Directories-Pay per click
Myths and Mistakes: The Part of ten: Way to Keep Up-to-Date and Track Down the hills-Myths& Mistakes
Tools: Useful Tools for Search SEO, Case study
Reference(s)
1. Current development in artificial intelligence, International Journal.
2. Journal of Computer Science, Indian Journal.
3. Cognition, Technology & Work, Springer Online Journal.
4. Search Engine journal, International Journal.
11Z0RC J2ME
- - - 3.0
Objective(s)
 To understand J2ME architecture
 To be familiar with J2ME user Interface
 To be familiar with J2ME data management
J2ME Overview: Java 2 Micro Edition and the World of Java - J2ME and Wireless Devices- Wireless Technology Radio Transmission - Limitations of Radio Transmissions - Radio Data Networks -Data Packets - Microwave
Technology - Satellite Networks - Mobile Radio Networks - Cellular Telephone Networks - Digital Wireless
Transmissions - Cell Phones and Text Input – Messaging - Personal Digital Assistants - Mobile Power - Set-Top
Boxes - Inside Look at a Set-Top Box - Smart Cards.
J2ME Architecture and Development Environment : J2ME Architecture - Small Computing Device Requirements Run-Time Environment - Inside the Java Archive File - Inside the Java Application Descriptor File - MIDlet
Programming - Event Handling - User Interfaces - Device Data - Java Language for J2ME - J2ME Software
Development Kits - Multiple MIDlets in a MIDlet Suite - J2ME Wireless Toolkit - Building and Running a Project MIDlets on the Internet. WSDL and SOAP
J2ME User Interface: Commands, Items, and Event Processing - J2ME User Interfaces - Display Class - The Palm
OS Emulator - Command Class - Command Listener - Item Class - Item Listener - Exception Handling - Throwing a
249
MIDlet State Change Exception. High-Level Display: Screens - Screen Class – Choice Group Class – Date Field
Class - Gauge Class - String Item Class – Text Field Class – Image Item Class - List Class - Creating an Instance of a
List Class – Text Box Class - Creating an Instance of a Text Box Class.
J2ME Data Management : Record Management System - Record Storage - The Record Store - Record Store Scope Setting Up a Record Store - Writing and Reading Records - Creating a New Record and Reading an Existing Record
- Writing and Reading Mixed Data Types - Record Enumeration - Reading a Record of a Simple Data Type into a
Record Enumeration -Reading a Mixed Data Type Record into a Record Enumeration - Sorting Records - Sorting
Single Data Type Records in a Record Enumeration - Sorting Mixed Data Type Records in a Record Enumeration Searching Records.
J2ME Networking and Web Services: Hypertext Transfer Protocol - Communication Management Using HTTP
Commands - Session Management - Web Services - J2EE Multi-Tier Web Services Architecture - J2ME MIDlets and
Web Services - WSDL and SOAP.
Reference(s)
1. International journal of information & Computer technology, International Journal.
2. Journal of computer science and applications, International Journal.
3. Indian Journal of Engineering, Science, and Technology, Indian Journal.

Computer Science and Engineering

Transcription

Similar documents

onam competition- floral rangoli

Llanelli Rural Council Swiss Valley Design Proposal 2 1 4 5 6 2 3 8

full-time undergraduate programmes

PMP Examination Content Outline

Brochure

2016 Scholarship Summary Fair Chance Scholarship

course description book - Bloomfield Hills Schools

B.Ed Two years reguler

brochure - Roosevelt University

basic feed line vbcr visual

BU BA 3rd year syllabus - 2015

singapore singapore - Intellect Worldwide Sdn. Bhd.

Joule`s Only General Exposition of the Principle of Conservation of