COE C
COE C
COE C
COMPUTER ENGINEERING
UNIVERSITY OF DELHI
NETAJI SUBHAS INSTITUTE OF TECHNOLOGY
SCHEME OF COURSES
FOR
B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 1
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
TABLE OF CONTENTS
Sl No Contents Page
Number
1 PREAMBLE 3-14
2 PROGRAM OUTCOMES 15
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 2
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
PREAMBLE
I. INTRODUCTION
Higher education is very important for the growth and development of any country.
It is a living organ and requires continuous changes to ensure the quality of
education. National Knowledge Commission and University Grants Commission
have recommended many academic reforms to address the challenges of today’s
networked globalized world. People are coming together with the help of new
technologies which is resulting towards new aspirations, expectations,
collaborations and associations. The concept of “work in isolation” may not be
relevant and significant anymore. The UGC guidelines on adoption of Choice
Based Credit System may be an important step to revamp the processes, systems
and methodologies of Higher Educational Institutions (HEIs). The teacher centric
mode be changed to learner centric mode. Class room teaching and learning be
made effective, relevant and interesting. Concepts and theories be explained with
examples, experimentation and related applications.
The Choice Based Credit System supports the grading system which is considered
to be better than conventional marking system. It is followed in many reputed
institutions in India and abroad. The uniform grading system facilitates student
mobility across institutions within and across countries and also enables potential
employers to assess the performance of students. The Choice Based Credit System
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 3
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
makes the curriculum interdisciplinary and bridges the gap between professional
and liberal education.
The Indian Higher Education Institutions have been moving from the conventional
annual system to semester system. Currently many of the institutions have
already introduced the Choice Based Credit System. The semester system
accelerates the teaching-learning process and enables vertical and horizontal
mobility in learning. The credit based semester system provides flexibility in
designing curriculum and assigning credits based on the course content and
hours of teaching. The Choice Based Credit System provides a ‘cafeteria’ type
approach in which the students can take courses of their choice, learn at their
own pace, undergo additional courses to acquire more than the required credits
and adopt an interdisciplinary approach to learning.
This scheme and courses are related to four year Computer Engineering
programme with following Programme Educational Objectives (PEO).
1. Graduates of the program will have successful technical and
professional careers in industry, academia, govt. and
entrepreneurship.
2. Graduates of the program will hold strong professional ethics with
good team skills and communication
3. Graduates of the program will engage in lifelong learning to
acquire new knowledge in an evolving technological landscape.
B. Types of Courses
Courses are the subjects that comprise the Computer Engineering programme.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 4
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
2. The learning outcomes of each course will be defined before the start of a
semester.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 5
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
4. Each credit course contributes certain credits to the programme. A course can
be offered either as a full course (4 credits) or as a half course (2 credits). A
full course is conducted with 3 hours of lectures and either 1 hour of tutorial
or 2 hours of practical work per week. A half course is conducted with 2 hours
of lectures.
8. Apart from the above courses, Audit Courses may be offered. They do not carry
credits but aim at expanding knowledge or bridging deficiency in knowledge or
skill.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 6
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
1. Letter Grades and Grade Points: A 10-point grading system shall be used
with the letter grades as given in Table 1.
2. Fail grade: A student obtaining Grade F shall be considered fail and will
be required to reappear in the examination. If the student does not want to
reappear in an elective course (that is, EG, ED, EO, FE but not CC or FC
courses) then he/she can re-register afresh for a new elective course.
3. Audit course: For audit courses, ‘Satisfactory’ or ‘Unsatisfactory’ shall be
indicated instead of the letter grade and this will not be counted for the
computation of SGPA/CGPA.
4. Fairness in assessment: The CBCS promotes continuous evaluation system
where the weightage of end semester examinations should not be more than
60%. The departments shall design its own methods for continuous
evaluation. It shall have the flexibility and freedom in designing the
examination and evaluation methods that best fits the curriculum, syllabi
and teaching-learning methods. In this regard, checks and balances will be
implemented to ensure fair and effective assessment and examination
process.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 7
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
ii. The CGPA is also calculated in the same manner taking into
account all the courses taken by a student over all the semesters of
a programme, i.e.
where SPGA(Si) is the SGPA of the ith semester and Ci is the total
number of credits in that semester.
iii. The SGPA and CGPA shall be rounded off to 2 decimal points and
reported in the transcripts.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 8
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
i. Biotechnology: BT
ii. Computer Engineering: CE
iii. Electronics and Communication Engineering: EC
iv. Instrumentation and Control Engineering: IC
v. Information Technology: IT
vi. Manufacturing Processes and Automation Engineering: MA
vii. Mechanical Engineering: ME
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 9
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
2. Departmental Course Codes: The codes for departmental core courses and
discipline-specific electives are specific to each discipline. The first two
characters are derived from departmental codes listed above. The third
character is ‘C’ for core courses and ‘D’ for discipline-specific courses. This is
followed by a 2-digit sequence number:
i. CECyy: Core Course
ii. CEDyy: Discipline-centric Elective Course
3. Common Elective Course Codes: There are common lists for courses offered
under Compulsory Foundation (FC), Foundation Electives (FE) and Open
Electives (EO). All disciplines will follow a common code as shown below. The
3-digit sequence number ‘yyy’ is taken from the respective tables of different
types of courses.
i. FCyyy: Foundation Compulsory Course
ii. FEyyy: Foundation Elective Course
iii. EOyyy: Open Elective Course
4. General Electives: A student may take a course under the category of General
Elective (EG) offered by any other Department of the Institute under the
categories of Core Course (CC) and Discipline centric Electives (ED). However,
such options shall be offered to a student as per prescribed guidelines of the
Institute.
V. EVALUATION SCHEME
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 10
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
The Committee of Courses and Studies in each department shall appoint one or
more Evaluation-cum-Review Committees (ERC), each committee dealing with one
course or a group of courses. This ERC consists of all faculty members who are likely
to teach such course(s).
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 11
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 12
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 13
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
The curriculum will be updated regularly within a period of 5 to 10 years since last
revision, to keep pace with the advancements in the field of computer engineering.
1. Lay guidelines for executing all the provisions and stipulations of the programme
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 14
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
PROGRAM OUTCOMES
At the completion of the B.E. Computer Engineering Program, a student will
achieve the following outcomes:
1. Gain an ability to apply the knowledge of mathematics, science, Engineering
fundamentals and computer engineering in solving complex engineering
problems.
2. Acquire the ability to survey the literature, conduct experiments, interpret data
and analyze complex engineering problems.
3. Acquire the ability to design a system, its components and processes to meet
requirements with due regard to social, economic and environmental
considerations.
4. Acquire the ability to apply research based knowledge and methods to
investigate complex engineering problems with focus on computer engineering.
5. Acquire the ability to select existing tools, techniques and resources and create
new ones to model complex engineering problems and activities.
6. Understand the responsibilities of an engineering profession towards society,
economy, health, safety and legal issues.
7. Understand a computer engineer’s role in enhancing sustainable development.
8. Demonstrate professional ethics and responsibilities with utmost integrity at
all times
9. Acquire the ability to contribute effectively as members or leaders of diverse
and multidisciplinary teams.
10. Communicate effectively among professional and with society through reports,
presentations, documentations and instructions.
11. Engage in lifelong learning in ever evolving landscape of computer science and
engineering.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 15
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
FC001 FC Mathematics-I 3 1 0 4 25 25 50 - - None
Computer 3 0 2 None
FC002 FC 4 15 15 40 15 15
Programming
Electrical and
FC003 FC Electronics 3 0 2 4 15 15 40 15 15 None
Engineering
FExxx Foundation
FE - - - 2 - - - - - _
1* Elective
23/25
20 subject
2*
1* : The course codes, LTP distribution and Evaluation Scheme for Foundation Electives are given in Table 3.
2*: The actual weekly load depends upon the elective chosen by the student under FE (Refer Table 3)
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 16
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
FC006 FC Mathematics-I I 3 1 0 4 25 25 50 - - None
FC007 FC English-II 2 0 0 2 25 25 50 - - None
Discrete 3 1 0 None
CEC01 CC 4 25 25 50 - -
Structures
1* : The course codes, LTP distribution and Evaluation Scheme for Foundation Electives are given
in Table 3.
2*: The actual weekly load depends upon the elective chosen by the student under FE (Refer
Table 3)
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 17
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 18
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
26/28 22
2*
1* : The course codes, LTP distribution and Evaluation Scheme for Foundation Electives (FE) are given in Table 3.
2*: The actual weekly load depends upon the elective chosen by the student under FE (Table 3).
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 19
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
Micro-
CEC10 CC 3 0 2 4 15 15 40 15 15 None
processors
Software 3 0 2 None
CEC11 CC 4 15 15 40 15 15
Engineering
Computer 3 0 2 None
CEC12 CC 4 15 15 40 15 15
Graphics
Computer 3 0 2 None
CEC13 CC 4 15 15 40 15 15
Networking
Operating 3 1 0 None
CEC14 CC 4 25 25 50 - -
Systems
FExxx Elective
FE - - - 2 - - - - - _
1* Foundation
26/28
22
2*
1* : The course codes, LTP distribution and Evaluation Scheme for Foundation Electives are given in
Table 3.
2*: The actual weekly load depends upon the elective chosen by the student under FE (Refer Table
3).
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 20
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 21
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
CC Theory of
CEC15 3 1 0 4 25 25 50 0 0 None
Computation
CC High
CEC16 Performance 3 0 2 4 15 15 40 15 15 None
Computing
CC Compiler
CEC17 3 0 2 4 15 15 40 15 15 None
Construction
CC Modeling and
CEC18 3 0 2 4 15 15 40 15 15 None
Simulation
EO/EG/
1* Elective(s) - - - - - - - - - -
ED
16-28
2*
3*
1* : The LTP distribution, Evaluation Scheme and pre-requisite(s) for Elective courses are given in Tables 4, 5 and 6.
The course code will depend upon the elective(s) chosen by the student.
3*: The weekly load will depend upon the electives chosen by the student from Tables 3, 4, 5 and 6.
4*: A student may register for courses leading to a minimum of 16 credits and a maximum of 28 credits. Normally a
student registers for courses leading to 22 credits.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 22
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
Computer
CEC19 CC Control 3 1 0 4 25 25 50 - - None
Systems
CEC20 CC IT Law and 2 0 0 None
2 25 25 50 - -
Ethics
CEC21 CC Open Source 0 0 4 None
2 - - - 50 50
Technologies
1* EO/EG/
Elective(s) - - - - - - - - - -
ED
8-28
2*
3*
1* : The course code, LTP distribution, Evaluation Scheme and pre-requisite(s) for Elective courses under EO, EG and
ED will depend upon the electives chosen by the student as given in Tables 4, 5 and 6.
2*: The weekly load will depend upon the electives chosen by the student from Tables 4, 5 and 6.
3*: A student may register for courses leading to a minimum of 8 credits and a maximum of 28 credits. Normally a
student registers for courses leading to 22 credits.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 23
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
CEC22
CC Training - - - 2 - - - 40 60 None
*1
*1: Students will undergo training in the industry / research organization / reputed Institute during the
Summer vacation after sixth Semester. This will be evaluated as a seventh Semester subject during end-
semester examination.
Training gives exposure to students on the working of the industry, on research directions and practical
applications of Computer Engineering and on work ethics.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 24
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
CEC22 - - - None
CC Training 2 - - - 40 60
1*
CEC23 0 0 4 None
CC Project-I 4 0 0 0 40 60
2*
3* EO/EG/ED - - - - - - - - - -
Elective(s)
6-28
4*
5*
1*: The Training undertaken by students during the Summer vacation after VI Semester will be evaluated as a VII
Semester subject during end-semester examination.
2*: Project work is based on the students’ ability to understand, design and implement the fundamental concepts of
the basic sciences, mathematics, engineering subjects and human values.
3* : The Course code, LTP allocation, Evaluation Scheme and Pre-requisites for Electives will depend on the electives
chosen by the student as given in Tables 4, 5 and 6.
4*: The actual weekly load will depend upon the electives chosen by the student from Tables 4,5 and 6.
5*: A student may register for courses leading to a minimum of 6 credits and a maximum of 28 credits. Normally a
student registers for courses leading to 22 credits.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 25
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
CEC24 0 0 4 None
CC Project-II 4 0 0 0 40 60
1*
EO/EG/
2* Elective(s) - - - 4 - - - - - -
ED
4-28
3*
4*
1*: Project work is based on the students’ ability to understand, design and implement the fundamental concepts of
the basic sciences, mathematics, engineering subjects and human values.
2* : The Course code, LTP allocation, Evaluation Scheme and Pre-requisites for Electives will depend on the electives
chosen by the student as given in Tables 4, 5 and 6.
3*: The weekly load will depend upon the electives chosen by the student from Tables 4,5 and 6.
4*: A student may register for courses leading to a minimum of 4 credits and a maximum of 28 credits. Normally a
student registers for courses leading to 22 credits.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 26
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 27
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
n and
Presentation
Skills
FE013 Theatre 0 0 4 - - - 60 40 None
FE014 Dance 0 0 4 - - - 60 40 None
FE015 Yoga 0 0 4 - - - 60 40 None
Digital Film
FE016 0 0 4 - - - 60 40 None
Making
Workshop
FE017 (Electrical and 0 0 4 - - - 60 40 None
Mechanical)
FE018 Music 0 0 4 - - - 60 40 None
Sociology of
FE019 2 0 0 25 25 50 - - None
development
Universal
Human Values
FE020 2 0 0 25 25 50 - - None
1: Self and
Family
Universal
Human Values
FE021 2 0 0 25 25 50 - - FE020
2: Self Society
and Nature
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 28
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 29
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 30
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 31
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
A Student may take any course offered by any department of the Institute under the
categories of Core Course (CC) and Discipline-centric Elective (ED). However, such
options shall be offered to a student as per prescribed guidelines of the Institute.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 32
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 34
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Devices
EO032 Elements of Fibre Optics 3 0 2 None
EO033 Material Physics 3 0 2 N one
Advanced Electromagnetic
EO034 3 0 2 None
Theory and Relativity
EO035 Fibre and Integrated Optics 3 0 2 None
EO036 Condensed Matter Physics 3 0 2 None
EO037 Microwave 3 0 2 None
Fundamentals of
Instrumentation and
EO038 3 0 2 None
experimental techniques in
Physics
EO039 Lasers and Photonics 3 0 2 None
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 35
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
Mathematics-
FC001 FC 3 1 0 4 25 25 50 - - None
I
COURSE OUTCOMES
1. By the end of this course, the student will be able to :
2. Analyze and test infinite series for its convergence.
3. Find Taylor’s series expansion, maxima & minima of functions of one and more
variables.
4. Calculate length, area, radius of curvature, surface of revolution and volume of
revolution.
5. Calculate area of a given region and volume enclosed by a surface.
COURSE CONTENT
Infinite Series: Tests for convergence of series (Comparison, Integral, Ratio’s, Raabe’s,
Logarithmic and nth root,), Alternating series, Absolute convergence, Conditional
convergence.
Function of Single Variable: Hyperbolic functions,Taylor’s and Maclaurin’s theorems
with remainder terms, Polar Curves, Angle between tangent and radius vector,
Curvature and Radius of Curvature, Asymptotes, Curve tracing, Applications of
definite integral to area, arc length, surface area and volume of revolution (in
Cartesian, parametric and polar co-ordinates).
Function of Several Variables: Partial Derivatives, Differentiability, Total differential,
Euler’s theorem, Jacobian, Taylor’s theorem, Maxima and Minima for functions of two
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 36
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. G. B. Thomas and R. L. Finney,“Calculus and Analytic Geometry,” Pearson
Education.
2 R. K. Jain and S. R. K. Iyenger, “Advanced Engineering Mathematics,” Narosa.
3 Erwin Kreyszig, “Advanced Engineering Mathematics”, Wiley.
4 Michael Greenberg, “Advanced Engineering Mathematics”, Pearson Education.
Course Pre-
Type Subject L T P Credits CA MS ES CA ES
Code Requisites
Computer 3 0 2 None
FC002 FC 4 15 15 40 15 15
Programming
COURSE OUTCOMES
1. To understand the basic terminology and program structures used in computer
programming to solve real world problems.
2. To learn the process of representing problems and writing, compiling and
debugging programs.
3. To develop programming skills in using different types of data, decision structures,
loops functions, pointers, data files and dynamic memory allocation/de-allocation.
4. To understand the need for continuing to learn new languages to solve complex
problems in different domains.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 37
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
C Programming Language
Thinking like a programmer: problem solving. Components of a problem, algorithm,
checking for errors and inconsistencies, writing a pseudocode.
Boolean Logic: Binary Number systems and codes and operations.
Introduction to programming& Basics of C: Concepts of Algorithm and Flowcharts,
Process of compilation, Basic features of C Language like Identifier, Keywords, Variable,
data types, Operators and Expression, basic screen and keyboard I/O, Control
Statements, iteration, nested loops, Enumerated data types, bitwise operators, C
Preprocessor statements.
Arrays and Pointers: One and multidimensional dimensional arrays, strings arrays,
operations on strings, Array and Pointers, Pointers and strings, Pointer to Pointer,
other aspect of pointers,User Defined Data Types: Structures, Unions, bit fields.
Linked List: Dynamic memory allocation, singly link list, traversing, searching,
insertion, deletion.
Files: Types of files, working with files, usage of file management functions.
SUGGESTED READINGS
1. B. W. Kernighan and D.M. Ritchie, “The C programming language”, Prentice Hall.
2. Herbert Schildt and Tata McGraw Hill ,“The Complete Reference”,.
3. Yashwant Kanitkar, “Let us C”, BPB Publication
4. Byron Gottfried, Schaum Series, Tata McGraw Hill,“Schaum's Outline of Programming
with C”,
5. Addison Wesley, “Object Oriented Programming”, Budd.
6. D Samantha, “Object oriented Programming in C++ and Java “, PHI.
Stroustrup,”Programming in C++”, Special Edition, Addison Wesley.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 39
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Course Pre-
Type Subject L T P Credits CA MS ES CA ES
Code Requisites
Electrical and
FC003 FC Electronics 3 0 2 4 15 15 40 15 15 None
Engineering
COURSE OUTCOMES
1. To understand the basic concepts of magnetic, AC & DC circuits
2. To learn the basics of semiconductor diodes, BJTs
3. Will be able to analyze basic electrical and electronic circuits
COURSE CONTENT
D.C. Circuits and Theorems: Ohm’s Law, KCL, KVL Mesh and Nodal Analysis, Circuit
parameters, energy storage aspects, Superposition, Thevenin’s, Norton’s, Reciprocity,
Maximum Power Transfer Theorem, Millman’s Theorem, Star-Delta Transformation.
Application of theorem to the Analysis of dc circuits.
A.C.Circuits: R-L, R-C, R-L-C circuits (series and parallel), Time Constant, Phasor
representation, Response of R-L, R-C and R-L-C circuit to sinusoidal input Resonance-
series and parallel R-L-C Circuits, Q-factor, Bandwidth.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 40
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Bias Stabilization: Need for stabilization, fixed bias, emitter bias, self bias, bias
stability with respect to variation in lco VBE & β, Stabilization factors, thermal stability.
SUGGESTED READINGS
(1) Vincent Del Toro , “Electrical Engineering Fundamentals,”
(2) Basic Electrical Engineering: Mittle and Mittal, TMH
(3) Electronic Devices and Circuit Theory: Boylestad and Nashelsky, 10 th Edition,
Pearson.
(4) Microelectronics: Millman & Grabel. TMH.
CA ES Pre-
Course L T P
Type Subject Credits CA MS ES Requisites
Code
COURSE OUTCOMES
1. Knowing important concepts and phenomena linked to relativity, waves and
oscillations and be able to do analytical and numerical calculations for faithful
measurements, observations and gravitational wave communications.
2. The course is helpful to the students in understanding various optical wave
phenomena which are required for optical & electromagnetic wave communications
and in optical devices.
3. Concepts of Laser and Optical Fiber for modern developments in physics which are
helpful in designing and developing new devices used in optical communications,
medicine, environment, industries and related physics.
COURSE CONTENT
Relativity: Special Relativity, Lorentz Transformations, Velocity addition, Time
dilation, Length Contraction, Variation of mass with velocity, Mass and energy,
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 41
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 42
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Arthur Beiser, Shobhit Mahajan, “Concepts of Modern Physics,” McGraw Hill
2. Serwey , Moses, Moyer, “Modern Physics,” Cengage Learning
3. S Chand & co., “Mechanics”, D S Mathur
4. Jenkins and White, “Fundamentals of Optics”, McGraw Hill
5. N. Subramaniam and Brij Lal (S Chand), “A Text Book of Optics”
6. Indu Prakash, “A Text Book of Practical Physics, Volume-1”, Kitab Mahal
Publication.
Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisites
Code
COURSE OUTCOMES
1. The course will focus on the four integral skills of language, improving the
proficiency levels in all of them and to learn to use language as a tool for effective
communication.
2. This course will widen the understanding of the learners in all genres of literature
(short stories, poetry, autobiographies..) with the help of expository pieces .
3. The course will strive to equip the learner with the ability to express oneself and be
understood by others with clarity and precision, in both written and spoken forms.
4. This course will encourage creative use of language through translation,
paraphrasing and paragraph writing.
5. Along with the above, the course will also build confidence and encourage the
students to use a standard spoken form of English in order to prepare them to face
job interviews, workplace and in higher studies.
COURSE CONTENT
1. Practice in dictation, punctuation and spellings, listening and reading
comprehension.
2. Practice with well formed sentences with stress on remedial grammar.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 43
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Margaret M Maison, “Examine Your English”
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 44
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Evaluation Scheme
(Percentage weights)
Course Pre-
Type Subject L T P Credits
Code Theory Practical requisites
CA MS ES CA ES
FC006 FC Mathematics-II 3 1 0 4 25 25 50 - - None
COURSE OUTCOMES
1. By the end of this course, the student will be able to solve system of equations and
know the concepts of eigenvalue and eigenvector.
2. Know the concepts of Ordinary Differential Equations and its applications.
3. Know the concepts of Special Functions.
4. Know the concepts of Laplace Transforms and its application to solve Differential
Equations
COURSE CONTENT
Matrices: Rank, inverse and normal form of a matrix using elementary
transformations, consistency of linear system of equations; linear dependence/
independence, linear transformations, eigenvalues and eigenvectors of a matrix,
Cayley-Hamilton theorem, diagonalization.
Ordinary Differential Equations: Second & higher order linear differential equation
with constant coefficients, general solution of homogenous and non- homogenous
equations, Euler-Cauchy equation, Application to mass- spring system and electrical
circuits. Power series method.
Special Functions: Beta and Gamma functions, Dirichlet’s Integral. Legendre
equation, Legendre polynomials and its properties, Bessel equation, and Bessel
function of first kind and its properties, ber and bei functions.
Laplace Transforms: Basic properties, Laplace transform of derivatives and
integrals. Laplace of periodic functions. Laplace transforms solution of IVP and
simultaneous linear differential equations, unit step function, Dirac-Delta function.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 45
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. G. B. Thomas and R. L. Finney, “Calculus and Analytic Geometry”, Pearson
Education.
2. R. K. Jain and S. R. K. Iyenger, “Advanced engineering mathematics”, Narosa.
3.Erwin Kreyszig, “Advanced engineering mathematics,” Wiley.
4.Michael Greenberg, “Advanced engineering mathematics”, Pearson Education.
Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisites
Code
COURSE OUTCOMES
1. The course will focus on the four integral skills of language, improving the
proficiency levels in all of them and to learn to use language as a tool for effective
communication.
2. This course will widen the understanding of the learners in all genres of literature
(short stories, poetry, autobiographies..) with the help of expository pieces .
3. The course will strive to equip the learner with the ability to express oneself and be
understood by others with clarity and precision, in both written and spoken forms.
4. This course will encourage creative use of language through translation,
paraphrasing and paragraph writing.
5. Along with the above, the course will also build confidence and encourage the
students to use a standard spoken form of English in order to prepare them to face
job interviews, workplace and in higher studies.
COURSE CONTENT
Literature
1. Anton Chekov: The Bet
2. Guy de Maupassant: The Necklace
3. D H Lawrence: Odour of Chrysanthemums
4. R K Narayan: Malgudi Days
5. Sarojini Naidu: Bangle Sellers
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 46
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Language Skills
1. Translation, paragraph writing, paraphrasing, summarizing,
2. Comprehension
3. Presentations/book reviews/reading exercises
SUGGESTED READINGS
1. Martin Hewing, “Advanced English Grammar”:
2. Meenakshi Raman & Sangeeta Sharma, “Technical Communication”
3. Renu Gupta, “A Course in Academic Writing”
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 47
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SEMESTER II
Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisites
Code
Discrete 3 1 0 None
CEC01 CC 4 25 25 50 - -
Structures
COURSE OUTCOMES
1. To be able to analyze and compute time and space complexity of various
computing problems.
2. To be able to design algorithms for solving various problems using the concepts of
discrete mathematics.
3. To apply the concepts and algorithms learnt in developing large scale applications
and modify them.
COURSE CONTENT
Number Theory: Infinity and Natural numbers, Integers, Divisibility and Euclidean
algorithm, Prime numbers, Congruence, Modular arithmetic, Euler function, Public
key cryptosystems and RSA.
Counting: Counting and analysis of algorithms, Permutations, Combinations,
Asymptotic behavior of algorithms, Recurrence relation, generating functions
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 48
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Keneth H. Rosen, “Discrete Mathematics and Its Applications”, TMH.
2. C.L. Liu, “Elements of Discrete Mathematics”, TMH.
3. Kolman, Busby & Ross, “Discrete Mathematical Structures”, PHI.
4. Narsingh Deo, “Graph Theory With Application to Engineering and Computer
Science”, PHI.
5. Charles S. Grimmstead, J. Laurie Snell “Introduction to Probability”.
6. Kai Lai Chung, “A Course in probability theory”.
Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisites
Code
Data 3 0 2 None
CEC02 CC 4 15 15 40 15 15
Structures
COURSE OUTCOMES
1. Candidate will be able to choose the appropriate data structure for a specified
problem and determine the same in different scenarios of real world problems.
2. Become familiar with writing recursive methods and reducing larger problems
recursively in smaller problems with applications to practical problems.
3. Be able to understand the abstract properties of various data structures such as
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 49
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
stacks, queues, lists, trees and graphs and apply the same to real life problems of
sorting, searching, traversals for skill enhancement in problem solving.
4. Be able to implement various data structures in more than one manner with the
advantages and disadvantages of the different implementations for energy efficient
by using efficient representation of problems.
COURSE CONTENT
Introduction: Basic Terminology: Elementary Data Organization, Data Structure
Operations, Algorithms Complexity and Time-Space Trade off.
Arrays: Array Definition and Analysis, Representation of Linear Arrays in Memory,
Traversing, Insertion And Deletion in Array, Single Dimensional Arrays, Two
Dimensional Arrays, Bubble Sorting, Selection Sorting, Linear Search, Binary Search,
Multidimensional Arrays, Function Associated with Arrays, Character String in C,
Character String Operations, Arrays as parameters, Implementing One Dimensional
Array.
Stacks and Queues: Introduction to Operations Associated with Stacks Push & Pop,
Array representation of stacks, Operation associated with stacks: Create, Add, Delete,
Application of stacks recursion polish expression and their compilation conversion of
infix expression to prefix and postfix expression, Tower of Hanoi problem,
Representation of Queues, Operations of queues: Create, Add, Delete, Front, Empty,
Priority Queues and Heaps, Dequeue.
Recursion: Recursive thinking, Recursive Definition of Mathematical Formulae,
Recursive Array Search, Recursive Data Structure, Problem Solving With Recursion,
Back Tracking
Linked Lists:More operations on linked list, polynomial addition, Header nodes,
doubly linked list, generalized list, circular linked lists.
Trees:Trees – mathematical properties, Binary Search Trees and their representation,
expression evaluation, Complete Binary trees, Extended binary trees, Traversing
binary trees, Searching, Insertion and Deletion in binary search trees, Complexity of
searching algorithm, Path length, Huffman’s algorithm, General trees, AVL trees,
Threaded trees, B trees, Trie data structure
Sorting: Insertion Sort, Quick sort, two-way Merge sort, Heap sort, sorting on
different keys, External sorting.
Graphs: Sequential representation of graphs, Adjacency matrices, Search and
Traversal of graphs: Depth first, breadth first, topological sort.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 50
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 51
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisites
Code
Digital Logic 3 0 2 None
CEC03 CC 4 15 15 40 15 15
Design
COURSE OUTCOMES
COURSE CONTENT
Introduction to Digital Systems
Number Systems and Codes: Binary, octal and hexadecimal number systems,
Number-Base Conversions, Complements of Numbers, Signed numbers, Fixed and
floating point numbers, Binary Arithmetic, Binary Codes: BCD, Gray, Excess-3,
ASCII, Error detection and correction codes - parity check codes and Hamming code.
Combinatorial Logic Systems: Basic logic operation, Logic gates and Truth tables,
Positive and Negative Logic, Boolean Algebra: Basic postulates and fundamental
theorems, SOP and POS forms, Min terms, Max terms, Canonical Form, Gate level
Minimization: K-map and Quine-McCluskey tabular methods, NAND/NOR
implementations
Design Concepts using Hardware Description Language: VHDL Programming
Structure, Model, Test Bench, Simulation Tool
Combinational Logic Modules, their applications and VHDL Modeling: Decoders,
encoders, multiplexers, demultiplexers, Parity circuits, Comparators, Code
Converters, Arithmetic modules- adders, subtractors, BCD Adder, ALU and
multipliers, Implementing boolean function with multiplexers / decoders
Introduction to different logic families: Operational characteristics of BJT and
MOSFET as switch, Structure and operations of TTL and CMOS gates, Electrical
characteristics of logic gates – logic levels and noise margins, fan-out, propagation
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 52
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
delay, transition time, power consumption and power-delay product etc, Gates with
Open Collector/Drain outputs, Tristate logic gates
Sequential Logic systems and VHDL Modeling: Basic sequential circuits- latches
and flip-flops: RS-latch, SR-flipflop, D-latch, D flip-flop, JK flip-flop, T flip-flop,
Setup-time, HOLD Time, Propagation delay, Timing hazards and races, Characteristic
Equations
Sequential logic modules, their applications and VHDL Modeling: Multi-bit
latches and registers, shift register: Bidirectional, Universal and Ring Counter;
counters: Ripple, Up/Down, Mod N, BCD Counters etc.
State machines: Definition, Classification: Mealy, Moore; Analysis of state machines
using D flip-flops and JK flip-flops, Design of state machines - state table, state
assignment, transition / excitation table, excitation maps and equations, logic
realization, State machine design using State Diagram, and using ASM charts,
Design examples
Memory: Read-only memory, Read/Write memory - SRAM and DRAM, EPROM,
EEPROM, USB Flash drive
Advanced Topics: synchronous sequential circuits, Testing and testability of logic
circuits, Programmable Logic Devices: PROM, PLA, PAL, GAL, SPLDs,CPLDs and their
applications, State-machine design with sequential PLDs, FPGAs
Guidelines for Practical Work: In the practical portion of this course, students will
use VHDL to model digital systems in a simulator. Students will model basic gates,
combinational circuits, sequential circuits, memory and state machine based
designs.
1. Stephen Brown and Zvonko Vranesic, "Fundamentals of Digital Logic with VHDL
Design", 3rd Edition, McGraw-Hill
2. R.J. Tocci., N.S.Widmer, G.L. Moss, “Digital Systems, Principles and
Applications”,11th Edition, Pearson Education
3. M. Morris Mano and Michael D. Ciletti,"Digital Design", 5th Edition, Pearson
4. Mohammed Ferdjallah,"Introduction to Digital Systems: Modeling, Synthesis, and
Simulation Using VHDL", Wiley.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 53
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Pre-
Course requisi
Type Subject L T P Credits CA MS ES CA ES
Code tes
COURSE OUTCOMES
1. To gain an understanding of the scientific principles, working and applications of
communication systems
2. To gain an understanding of modulation techniques
3. To acquire the skills needed to design communication systems for different
applications
COURSE CONTENT
Representation of signals and systems: Fourier Series,Fourier transform and its
properties, Hilbert transform, pre-envelope representation, representation of band
pass signals.
Analog communication: Elements of communication, amplitude modulation &
demodulation, DSB-SC Modulation & demodulation, SSB-SC Modulation &
demodulation, frequency modulation (direct method only), NBFM, WBFM, frequency
demodulation (balanced slope detector and phase discriminator).
Probability theory and random process: probability theory random variables and
transformations random processes, mean, correlation, covariance, moments, power
spectral density, Gaussian process, Stationarity, Central limit theorem.
Sampling and pulse communication: Sampling theorem , types of sampling, PAM ,
PPM, PWM.
Pulse code modulation: Quantization (linear & nonlinear), PCM, DPCM, DM.
Digital modulation techniques: Matched filters, Correlator receivers, Gram Schmidt
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 54
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
orthogonalization process, ASK, FSK, PSK, QPSK, Error analysis of BPSK, BFSK &
QPSK.
SUGGESTED READINGS
1. Taub, “Principles of communication,” McGrawHill
CA MS ES CA ES
Design and
CEC05 CC Analysis of 3 0 2 4 15 15 40 15 15 None
Algorithms
COURSE OUTCOMES
1. To be able to analyze a problem in terms of processing steps, time and space
complexity.
2. To be able to design and implement the algorithms for any given application.
3. To be able to develop software applications using various programming languages in
collaborative groups.
4. To apply the principles learnt in solving problems encountered in career or real life
situations.
CONTENTS
Introduction: Algorithm Design paradigms- motivation, concept of algorithmic efficiency,
run time analysis of algorithms, Asymptotic behavior of algorithms, Asymptotic Notations,
Recurrence relation,
Algorithm approaches: Divide-and-conquer Approach: Strassen’s matrix multiplication,
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 55
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 56
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Berman. Paul, “Algorithms, Cengage Learning”.
2. Richard Neopolitan, Kumar SS Naimipour, “Foundations of Algorithms”
3. T .H . Cormen, C .E .Leiserson, R .L .Rivest “Introduction to Algorithms”, PHI.
4. E. Horowitz, S. Sahni, and S. Rajsekaran, “Funadmentals of Computer Algorithms,”
Galotia Publication
Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisites
Code
Database
CEC06 CC Management 3 0 2 4 10 20 40 15 15 None
Systems
COURSE OUTCOMES
1. At the end of the course students would be able to learn about various database
models, tools for databases.
2. Students would be able to recognize and use contemporary logical design methods and
develop sophisticated queries to extract information from large datasets.
3. Understand and evaluate the role of database management systems in information
technology applications within organizations.
COURSE CONTENT
Introduction: Database administrator & Database Users, Characteristics of the Database,
Database Systems and Architecture, Data Models, Schemes & Instances, DBMS
Architecture & Data Independence, Database Languages & Interfaces, DDL, DML, DCL,
Overview of Hierarchical, Network & Relational Data Base Management Systems
Data Modeling: Data modeling using The Entity-Relationship Model – Entities, Attributes
and Relationships, Cardinality of Relationships, Strong and Weak Entity Sets,
Generalization, Specialization, and Aggregation, Translating your ER Model into Relational
Model, Relationships of higher degree.
Relational Model, Languages & Systems: Relational Data Model concepts, Relational
Model Constraints, integrity constraints ,Keys domain constraints, referential integrity,
assertions triggers, foreign key
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 57
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS:
1. Elmasri, Navathe, “Fundamentals of Database systems”, AddisionWisley.
2. Korth ,Silbertz, Sudarshan, ”Data base concepts”, McGraw-Hill.
3. Date C.J.,”An Introduction to Database systems”.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 58
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Course Pre-requisites
Type Subject L T P Credits CA MS ES CA ES
Code
Object 3 0 2 None
CEC07 CC 4 15 15 40 15 15
Orientation
COURSE OUTCOMES
1. To be able to visualize and analyze complex real life problems in an object oriented
manner
2. To be able to code using any state of the art object oriented language like Java or python
3. To be able to appreciate the relevance of object oriented paradigm in software engineering
for reducing cost and effort involved in software development
COURSE CONTENT
Object Oriented Principles: Modeling and Design: Concepts of object orientation: object
classes, encapsulation, complex objects, object identity, inheritance and multiple
inheritance, Persistence, overloadingand polymorphism
Object Oriented Languages: Detailed discussion and comparison of a Object Oriented
Programming language such as Java/ Python (any one)
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 59
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1, Betrand Meyer, “Object oriented software Construction” Prentice hall.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 60
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
2.Grady Booch, “Object oriented Analysis and Design, 2nd edition, Bejamin / cummings,”
Course Pre-
Type Subject L T P Credits CA MS ES CA ES requisites
Code
Computer
Architecture 3 1 0 None
CEC08 CC 4 25 25 50 - -
and
Organization
COURSE OUTCOMES
1. To understand the architecture of modern processors and organization of its
components, and relationship between hardware and software in digital machines.
2. To design instructions and corresponding logic circuits for a simple CPU with its
essential components such as ALU, a register file, memory and input-output.
3. To appreciate the evolving technology that governs the evolution of modern computers
and continue to keep abreast of state-of-art in computing technology
COURSE CONTENT
Overview of computer organization: Characteristics of a general purpose computer, The
stored program concept, von Neumann architecture, Harvard architecture, Programmer’s
model - the Instruction set architecture (ISA), ISA design and performance criteria, Basic
computer organization with CPU, memory and IO subsystems, Interconnect busses,
Evolution of CISC and RISC based processors and their merging.
Instruction Set Architectures: Machine instruction, Machine cycle and Instruction cycles,
Instruction Set: memory and non-memory reference instructions, instruction categories:
data movement, data manipulation, program control and machine control instructions,
CISC types addressing modes and instruction formats, RISC type addressing modes and
instruction formats.
Central Processing Unit: Specification of a simple CPU using RTL, Design of the data path
for the simple CPU, Designing the hardwired control path for the simple CPU, Performance
analysis of the simple CPU, Enhancement of the ISA for the simple CPU and design
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 61
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
extensions, Characteristics of RISC CPU design: ISA characteristics, pipelining, data and
instruction caches, Practical case studies in CISC type and RISC type CPU designs.
Microprogrammed Control Unit: Control memory system, Microinstruction-sequencing,
conditional branch, mapping and subroutines, direct, horizontal and vertical microcoding,
micro-instruction format and symbolic representation, design of micro-control unit for a
simple CPU, applications of microprogramming
Memory organization: Memory hierarchy, Cache organization: Direct, associative and Set
associative cache, Auxiliary memory organization, RAID organizations
Input output organization: IO interfacing, Asynchronous data transfer, Programmed IO,
Interrupt driven IO, Priority schemes, Direct Memory Access, Serial communication
techniques
Computer arithmetic: Design of Binary addition and subtraction units, Algorithms for
multiplication and division and their implementation, Floating point arithmetic, etc.
Pipelined architecture: Basic concepts of pipelining, Speedup and throughput, Minimum
Average Latency, Instruction pipeline.
Current trends: Discussion on Reconfigurable CPU, Embedded systems, special purpose
processors, multiprocessors etc.
SUGGESTED READINGS
1. William stallings, “Computer Organization and Architectue, PHI”
2. M. Morris Mano, “Computer System Architecture” , PHI
3. J.D. Carpinelli, “Computer Systems Organization and Architecture,” Pearson Education
4. Heuring and Jordan, Pearson Education, “Computer Systems Design and Architecture”
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 62
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Course M Pre-requisites
Type Subject L T P Credits CA ES CA ES
Code S
CC Analog 3 0 2 None
CEC09 4 15 15 40 15 15
Electronics
COURSE OUTCOMES
1. To understand the physics governing the working of basic electronic devices and
describe the working of devices and circuits mathematically.
2. To use devices to design, build and experimentally evaluate electronic circuits
3. To acquire the skills needed to develop complex electronic circuits using components
such as amplifiers, oscillators and OP-Amps.
COURSE CONTENT
SUGGESTED READINGS
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 63
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Theory Practical
CA MS ES CA ES
COURSE OUTCOMES
1. To acquire insight into architectural details of microprocessors, assembly language
programming, and different bus structures and standards.
2. To understand and implement the interfacing of external devices to the processor.
3. To analyze the hardware/software tradeoffs involved in the design of
microprocessor and microcontrollers based systems and apply this knowledge to
create novel products and solutions for real time problems.
COURSE CONTENTS
Introduction: General definitions of mini computers, microprocessors, micro
controllers and digital signal processors. Overview of 8085 Microprocessor-Pin
description, Internal architecture.
Overview of instruction set of 8085-Data transfer, arithmetic, logical, branch, stack and
machine control groups of instruction set.
Programming – Basic arithmetic operations, Stacks and Subroutines, Counters and
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 64
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Time delays.
Architecture of 8086 Microprocessor: Overview of 8086 microprocessor-Functional
Diagram, Register Organization, Memory Segmentation, Signal Descriptions-Common
Function Signals, Minimum and Maximum Mode Signals, Timing Diagrams, Interrupts
of 8086.
Assembly language of 8086: Instruction Set, Addressing Modes, Assembler directives,
8086 Assembly Programming- simple programs involving logical, branch and call
instructions, sorting, evaluating arithmetic expressions, string manipulations.
Interfacing with 8086: Interfacing with RAMs, ROMs along with the explanation of
timing diagrams. Interfacing with peripheral ICs like programmable peripheral interface
8255, programmer DMA controller 8237, programmable Keyboard controller 8279,
programmable interrupt controller 8259 and 8253 programmable timer. Interfacing
with key boards, LEDs, LCDs, ADCs, and DACs. Math co-processor 8087.
High end processors: Introduction to 80386 and 80486-The 32 bit processors,
Register Organization, Addressing Modes, Data Types, Real Address Mode, Protected
Mode, Segmentation, Paging, Virtual 8086 Mode, Introduction to Pentium Processors.
Guidelines for Practical work:
- Assembly language programs: Interchange two blocks of data in memory, Basic
arithmetic operations: (a) square and cube of an 8 bit number. (b) LCM of a 16
bit no. (c) GCD of two 16 bit unsigned integers. (d) factorial of an 8 bit number,
16 bit multiplication for signed and unsigned numbers, 32 bit Division, Sorting a
given set of 16 bit unsigned integers in ascending/descending order using
bubble sort algorithm.
- Code Conversions: ASCII to Binary conversion
- Programs on String Manipulation: (a) Transfer a given source string to
destination using string instructions. (b) Reverse a string. (c) Check if the given
string is a palindrome or not (d) Scan a string of characters for “FF” (e)
Determine the end of string (EOS) (f) Case conversion of a string.
- Interfacing various programmable interfaces such as 8255, 8259, 8279, 8237,
8253, 8259.
COURSE OUTCOMES
1.Understand that software development cannot be done in an adhoc fashion and has
to follow a disciplined systematic approach for timely development of software within
budget.
2. Learn various techniques used for software project management, software
estimation and software testing.
COURSE CONTENT
Introduction: Importance of software engineering as a discipline, The Software
evolution, Software characteristics, Software components, Software applications, Crisis-
Problem and causes.
Software development life-cycle: Requirement analysis, software design, coding,
testing and maintenance and types of maintenance.
Software Process Models: Water fall model,Evolutionary process models, Throwaway
prototyping and Exploratory development like incremental development, Concurrent
development and spiral model. Risk management. Capability maturity model (CMM) for
process assessment
Requirements Engineering: What is a Requirement, types of Requirements:
Functional, Non functional, Domain, Volatile and enduring requirements, Requirement
elicitation techniques, Requirements change management, SRS , quality of good SRS,
Writing an SRS
Software project Management Project management in software development, role of
estimation and metrics in project estimation and process control. Product metrics, Cost
estimation models like COCOMO, FP analysis, project scheduling, staffing, software
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 66
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
configuration management
Function oriented and object oriented Software design:Difference between
structured and Object oriented paradigms, Overview of SA/SD Methodology, structured
analysis, data flow diagrams, extending DFD to real time systems, Object oriented
design, Modeling using Unified Modeling Language (UML)
Overview of different testing techniques:levels of testing, functional and non-
functional testing, static and dynamic testing. Verification and validation, Unit,
Integration Testing, Top down and bottom up integration testing, Alpha, Beta and
acceptance testing , System testing and debugging.
Software Reliability and Quality Assurance: Reliability issues, Reliability metrics,
reliability growth modeling, measurement and prediction of software reliability, Software
quality,
Emerging trends.
SUGGESTED READDINGS
1. R . S. Pressman, “Software Engineering – A practitioner’s approach”, 5th Ed., McGraw
Hill Int. Ed., 2001
2. K. K. Aggarwal&Yogesh Singh, “Software Engineering”, 2nd Ed., New Age
International, 2005.
3. Stephen R. Schach, “Classical & Object Oriented Software Engineering”, IRWIN, TMH,
1996.
4. Sommerville, “Software Engineering”, Addison Wesley, 2004
5. James Peter, W. Pedrycz, “Software Engineering: An Engineering Approach”.
6. K. Chandrasehakhar, “Software Engineering & Quality Assurance”, John Wiley &
Sons, 2004. BPB, 2005.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 67
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE OUTCOMES
1. To understand the underlying mathematics for output primitives and to incorporate
with programming in drawing those primitive.
2. To use graphics primitives in drawing real life objects and to learn how to incorporate
characteristics such as shading and animation.
3. To work in collaboration to carry out graphic projects.
COURSE CONTENT
Introduction to computer graphics: Raster Graphics, Graphics hardware, Graphics
Libraries and an overview of any one of them such as OpenGL.
Scan Conversion: Line DDA, Midpoint and Bresenham’s algorithms, circle, ellipse,
parabola, hyperbola.
Line Clipping-Cohen Sutherland, Cyrus Beck, Midpoint Subdivision, Liang-Barsky,
Nicholl-Lee-Nicholl
Polygon clipping -Sutherland Hodgman, Weiler Atherton
Polygon Filling-Seed fill, Scanline Approach
Anti-Aliasing: Un-Weighted and Weighted Area Sampling, Gupta-Sproull Algorithm for
Anti-Aliasing
Transformation: 2D Transformation - Geometrical Transformation, Homogeneous
Coordinates, Window to View port Transformation, Translation, Scaling and Rotation, 3
D Transformation - Translation, Scaling and Rotation in 3D
Projection: Perspective and Parallel Projection
3 D Viewing: Three dimensional Modeling
Visible Surface Detection (Hidden Surface Elimination): Z-Buffer, Painter Algorithm,
Back face Detection, Area subdivision Method, BSP Tree, Octree
Curves and Surfaces: Parametric Cubic Curves, Uniform and Non Uniform Rational B-
Spline, Hermite Curve, Bezier Curve, Quadratic Surfaces
Illumination Models: Gouround and Phong Shading Model, Color Model
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 68
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Foley Van Dam, “Principle of Computer Graphics”,
2. Hearne and Baker, “Computer Graphics”
COURSE OUTCOMES
1. To acquire a thorough understanding of the state-of-the-art in modern network
architecture, protocols, networked systems and applications
2. To become proficient to develop software for modern networking devices
3. To have sufficient background knowledge to conduct networking research and
develop innovative ideas.
COURSE CONTENT
Introduction: Fundamentals of Digital Communication, Network Classification, Protocol
Architecture: Design Issues for the Layers, The TCP/IP Protocol Architecture, The ISO-
OSI Model, Other protocols such as SNA, Appletalk, Netware etc.
Physical Layer: Data Transmission Concepts, Transmission Media, Signal Encoding
Techniques, Digital Data Communication Techniques - Asynchronous and Synchronous
Transmission, Error Detection, Error Correction, Multiplexing – FDM,TDM, ADSL, xDSL
Data Link Layer: Main Functions, Framing, Error Control, Flow Control, Error-
Correcting Codes, Error-Detecting Codes, Data Link Protocols: Stop-and-Wait Protocol,
One-Bit Sliding Window Protocol, Go Back N, Selective Repeat, HDLC
Queuing Models: Poisson Process, Markov Chain, M/M/1 Queue- delay and little’s
formula. M/M/S/K, Queues – average queue length, delay and waiting times.M/G/1
Queues
Medium Access Control Sublayer: Channel Allocation: Static, Dynamic, MAC
PROTOCOLS – ALOHA, CSMA, Collision-Free Protocols, Limited-Contention Protocols,
Detailed Study of Ethernet, 802.11 WIRELESS LANS
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 69
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Programming assignments based on the concepts learned in the theory will be given
involving the usage of network status and control commands, real life network analyzer
tools (Wireshark), application development using network APIs available in operating
systems (Linux) and network simulators (ns2/Opnet). Briefly these will cover the
following:
1. Students will develop programs using system calls for process management, inter-
process communication, process synchronization, memory management and file
system management.
2. Basic network operations related command of Linux: ifconfig, route, netstat, ping,
arp, traceroute, tcpdump, xxd, host, nslookup, dig, nmap etc.
3. Instant Message Application development making using of socket related system
calls and multi threading.
4. Observing the functionality of a Network Protocol Analyzer like Wireshark to
understand the layered structure of TCP/IP network stack, develop programs in
C/C++ to open the binary packet dump file of wireshark, extract the various fields
of the headers of various layers and computing the IP header checksum in the
packet and verification of the same.
5. Simulation of the networking algorithms used for Error Control (ARQ protocols),
routing, flow control, congestion control etc.
SUGGESTED READINGS
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 70
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE OUTCOMES
1. Understand how an operating system manages all the resources in a computer
system efficiently.
2. Learn algorithms for CPU scheduling, deadlock handling, page replacement and
disk scheduling used by an operating system.
3. Useshell commands to efficiently operate a computer system.
4. Learn and usesystem calls for process creation and termination, inter-process
communication, process synchronization, memory management and file system
management.
COURSE CONTENT
Overview: Operating systems – structure, operations, components, types, services,
user interfaces. System calls, system programs, system boot.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 71
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS:
1. Silberschatz, A., Galvin P. B., and Gagne, G. 2005, “Operating System Principles
(7th ed.), Wiley”.
2. Stallings, W. 2014,“Operating Systems: Internals and Design Principles (8th ed.)”,
Pearson.
3. Tanenbaum, “A. S. 2007. Modern Operating Systems (3rd ed.)”, Pearson.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 72
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CA MS ES CA ES
Theory of
CEC15 CC 3 1 0 4 15 15 40 15 15 None
Computation
COURSE OUTCOMES
1. Acquire knowledge of Regular Languages, FA, CFG, Push Down Automata and Turing
recognizable languages
2. Be able to get a broad overview of the theoretical foundations of computer science
3. Be able to think analytically and intuitively for problem solving situations in related
areas of theory of computer science
COURSE CONTENT
Finite Automata: Deterministic FA, Non deterministic FA, Regular expressions,
Finite Automaton with €- moves, Regular Expression, Regular Languages and Kleen’s
theorem– Conversion of NFA to DFA, Equivalence of finite Automaton and regular
expressions, Minimization of DFA, Pumping Lemma for Regular sets, Problems based
on Pumping Lemma.
Context Free Grammer: Grammar, Types of Grammar, Context Free Grammars and
Languages, Derivations, Ambiguity, Relationship between derivation and derivation
trees, Simplification of CFG, Elimination of Useless symbols - Unit productions - Null
productions, Chomsky normal form (CNF), Greibach Normal form (GNF), Problems
related to CNF and GNF.
Pushdown Automata: Moves, Instantaneous descriptions, Deterministic pushdown
automata, Equivalence of Pushdown automata and CFL, pumping lemma for CFL,
problems based on pumping Lemma.
Turing Machine: Definitions of Turing machines, Computable languages and
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 73
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
functions, Techniques for Turing machine construction, Multi head and Multi tape
Turing Machines, The Halting problem, Partial Solvability, Problems about Turing
machine- Chomsky hierarchy of languages.
Difficult problems: Unsolvable Problems and Computable Functions, Primitive
recursive functions, Recursive and recursively enumerable languages, Universal
Turing machine, Measuring and classifying complexity - Tractable and Intractable
problems, Tractable and possibly intractable problems, P and NP completeness,
Polynomial time reductions, NP-complete problems from other domains: graphs
(clique, vertex cover, independent sets, Hamiltonian cycle), number problem
(partition), set cover.
SUGGESTED READINGS
1. Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory,
Languages and Computations”, Second Edition, Pearson Education.
2. John C Martin, “Introduction to Languages and the Theory of Computation”, Third
Edition, Tata McGraw Hill Publishing Company, New Delhi
COURSE OUTCOMES
1. To understand the capabilities, limitations and performance of high performance
architectures and their applications in solving challenging problems.
2. Develop the skills to decompose parallelizable problems effectively, write parallel
algorithms and use parallel programming paradigms to implement them.
3. Appreciate the multidisciplinary approach for developing and utilizing high
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 74
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
performance systems.
4. Keep abreast of the latest developments in high performance computing
environments
COURSE CONTENT
Introduction: Flynn’s classification of parallel architectures, Kinds of parallelism-
Temporal, data and mixed parallelism , Dependencies and hazards - data, control
and resource dependencies, PRAM models.
Parallel Programming paradigms: Granularity and Communication overheads,
Program decomposition techniques, Shared Memory Programming (pthreads), SPMD
model, Message Passing Programming (MPI/Open MP), Parallel sorting, even-odd
transposition/ parallel multiplication/ Parallel matrix operations on PRAM models.
High Performance Architectures: Instruction level parallelism-Delays in instruction
pipelining, mechanisms to tackle pipeline stalls, superscalar, superpipelined
architectures, VLIW processors. Array Processors -SIMD architectures, Vector
processing architectures. Multiprocessor architectures – shared memory symmetric
multiprocessing, clusters and grids. Interconnection networks - characteristics and
routing mechanisms. Parallel algorithms on realistic architectures.
Performance and scalability evaluation: Performance Laws: Amdahl’s Law,
Guftanson’s Law, Sun and Li Law, Performance Benchmarks, Overheads in parallel
processing, Hardware software matching
Memory and cache Consistency: Memory consistency: strict consistency, Lamport’s
sequential consistency, strong and weak consistency models. Bus based and
directory based cache coherence protocols.
Compiler optimizations for parallel architectures: Vectorization, Tiling,
Wavefronting , VLIW optimizations, software pipelining
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 75
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
variables.
- Message passing parallel programming – develop applications to demonstrate
task partitioning and IPC using Message Passing Interface (MPI) and
OpenMPIsuch as different parallel implementations of matrix multiplication
and sorting .
- Create a simple cluster.
SUGGESTED READINGS
1.Kai Hwang, “Advanced Computer Architecture”, McGrawHill
2.V. Rajaraman and C. Siva Ram Murthy,“Parallel Computers, architecture and
programming, PHI
3.Michael J Quinn, “Parallel Programming in C wit h MPI and OpenMP”, McGrawHill
Edu.
4.Peter Pacheco, “An introduction to parallel programming”.
COURSE OUTCOMES
1. Understand the internal organization and behavior of compilers and other
language processors.
2. Applythe formal constructs for designing a compiler.
3. Gain an ability to design simple domain-specific languages (DSLs) using
compiler construction tools.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 76
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Introduction: Language processors, structure of a compiler, compiler-construction
tools, evolution of programming languages, applications of compiler technology, T-
diagrams, bootstrapping, just-in-time compilation.
Lexical analysis: Input buffering, specification and recognition of tokens, lexical-
analyzer generator.
Syntax analysis: Specification of syntax using grammar. Top-down parsing –
recursive-descent, predictive. Bottom-up parsing – shift-reduce, SLR, CLR, LALR.
Parser generator.
Intermediate-code generation: Syntax-directed translation. Three-address code.
Translation of declarations, expressions, control flow. Backpatching.
Runtime environment: Activation trees and records.
Code optimization: Sources of optimization, basic blocks, optimization of basic
blocks, data-flow analysis, loop optimizations.
Code generation: Issues, register allocation and assignment, peephole optimization.
SUGGESTED READINGS
1. Aho, A. V., Lam, M. S., Sethi, R. and Ullman J. D. 2006,“Compilers – Principles,
Techniques and Tools (2nd ed.)”, Pearson.
2. Chattopadhyay, S. 2005,“Compiler Design, PHI”.
3. Appel, A. W. 200,“Modern Compiler Implementation in C", Cambridge University
Press.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 77
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE OUTCOMES
1. Understand and apply thetechniques for probabilistic and statistical modeling.
2. Analyze and model real world problems and simulate their working using Markov
models, queuing models, Monte Carlo and event driven simulation.
3. Estimate the cost and benefits of computer simulation, generation of meaningful
results, decision making, and risks and be able to formulate judgments and
synthesize conclusions through research of a simulation topic.
COURSE CONTENT
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 78
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Norm Matloff, “Probabilistic and statistical modeling in Computer Science”, Open
book, http://heather.cs.ucdavis.edu/probstatbook, From algorithms to Z scores
2. Simulation Modeling and Analysis Third Edition By Law Kelton (Mc-Graw Hill).
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 79
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE OUTCOMES
1. Understanding of Control system and its various applications.
2. To understands time response analysis and frequency response analysis of
systems.
3. To understand supervisory control and data acquisition system (SCADA).
4. Understanding of digital control systems and exposure of related examples.
COURSE CONTENT
Feed Back Characteristics of Control Systems:
Feedback and Non-feedback Systems, Reduction of Parameter Variations by use of
Feedback, Control Over System Dynamics by use of Feedback, Control of Effects of
Disturbance Signal by use of Feedback and Regenerative Feedback.
Time Response Analysis, Design Specifications and Performance Indices:
Standard Test Signals, Time Response of First-order Systems, Time Response of
Second-Order Systems, Steady-State Error and Error Constants, Effect of Adding a Zero
to a System, P, PI and PID Control Action and Their Effect, Design Specifications of
Second-Order Systems and Performance Indices.
Concepts of Stability Criteria:
The Concept of Stability, Necessary Conditions for Stability, Hurwitz Stability Criterion,
Routh Stability Criterion and relative Stability Analysis.
The Root Locus Technique:
The Root Locus Concept, Construction of Root Loci, Root Contours, Systems with
Transportation Lag, Sensitivity of the Roots of the Characteristic equation, MATLAB :
Analysis and Design of Control Systems.
Frequency Response Analysis:
Correlation Between Time and Frequency Response, Polar Plots, Bode Plots, and All
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 80
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Nagrath& Gopal, “Control Systems Engineering” New Age International. Publishers
2. Ogata, “Modern Control Engineering”.
3. Kuo B.C, “Automatic Control System”.
4. Scheultz&Melsa,“Linear Control Systems”.
5. D’ Azzo&Houpis, “Linear Control Systems Analysis & Design”.
6. S. A. Boyer. SCADA,“Supervisory Control and Data Acquisition”. 3rd Edition, ISA,.
7. M. Johnson and M. H. Moradi, “PID Control. Springer-verlang”, London.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 81
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE OUTCOMES
1. An understanding of the law that governs the development and dissemination of
software.
2. An understanding of the law that governs the dissemination of digitized information.
3. An understanding of ethics related to the IT profession.
COURSE CONTENT
Definition, Applicability, Nature of Intellectual Property: Patents, Trademarks and
copyright, Process of Patenting and Development: technological research, Innovation,
Patenting, development, International Cooperation on Intellectual Properly, Procedure
for grants of patents.
Scope of Patent Rights, government rules for licensing and transfer of technology
within country, government rules for licensing and transfer of technology from other
country, Patent information and documentation, Legal framework infringement
actions and remedies.
Administration of Patent system, New Development in IPR, IPR of Biological systems,
Computer software, Machinery etc. Case studies.
Protection of databases: Laws under Sui generis, EC Directive 96/9/EC, Technological
Protection measures, Digital Rights Management, watermarking and certification.
SUGGESTED READINGS
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 82
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 83
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE OUTCOMES
1. Understand the importance of open source software in developing software
collaboratively, cost saving, localization, vender independence and security.
2. Develop the skills to use and develop various open source technologies.
COURSE CONTENT
This course will train students on various open source technologies with practical
work.
-Open source operating systems: Extended exercises on Linux shell programming,
system administration tools, network and security, socket programming
-Open GNU tools
-Android application development
-Open cloud: OpenStack
-Open hardware: Raspberry-Pi, Arduino
SUGGESTED READINGS
1. Discover and Open source world, https://opensource.com
2. Ubuntu Linux, “The complete reference”.
3. Benvenuti, “Understanding the Linux network internals”
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 84
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE OUTCOMES
1. Gain an understanding of the design issues, methodologies and platforms for
embedded systems.
2. Equip oneself with software and hardware development skills needed to model
and implement embedded systems.
3. Develop full hardware software embedded applications.
COURSE CONTENT
Embedded Systems & HW-SW Co-Design: Introduction to embedded systems:
Evolution, Issues and Challenges, Co-design Flow methodologies, Design
exploration, Co-specification, Co-verification, Validation and testing, Co-
simulation, Physical design.
Embedded System Platforms:Microcontroller Architecture based on
8051/AVR/ARM with interfacing of Memory and Peripheral Devices,
Interrupts Processing, Interfacing with sensors and actuators. (ii) Alternative
architectures: Programmable Logic Devices (PLD), Application Specific
Integrated Circuits (ASIC), Application Specific Instruction Processors
(ASIP), Field Programmable Gate Arrays (FPGA), Reconfigurable devices,
Systems On Chip (SOC), VLIW architectures.
Embedded System Software: Modeling UML and RT-UML, Software Development:
Flow, Environments and Tools; RTOS Fundamentals
Embedded System Design issues: Performance Analysis and Optimization:
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 85
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Speed, Power and Area Optimization; System Reliability, Safety and Security.
Emerging Trends.
L T P CA MS ES Int ES
3 0 2 10 20 40 15 15
CED02 Big Data and Analytics CEC02, CEC06
COURSE OUTCOMES
1. Gain a conceptual understanding of big data analytics concepts, algorithms,
data management tools and statistical analysis.
2. Acquire tools to manage various aspects of big data such as Hadoop, HDFS,
Map-Reduce based HBase, Cassandra, Pig, Hive etc.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 86
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Introduction to Big Data:Databases and their evolution,convergence of key
trends, unstructured data, industry examples of big data, web analytics, big data
and marketing, fraud and big data, risk and big data,credit risk management, big
data and algorithmic trading, big data and healthcare, big data in medicine,
advertising and big data, big data technologies, introduction to Hadoop, open
source technologies, cloud and big data mobile business intelligence, Crowd
sourcing analytics,inter and trans firewall analytics.
NoSql Data Management: Introduction to NoSQL, Types of NoSQL, aggregate data
models, aggregates, key-value, document data models, relationships, graph
databases, schema less databases, materialized views. Overview of MongoDB.
MapReduce, partitioning and combining, composing map-reduce calculations,
MapReduce examples such as matrix multiplication.
Hadoop: Introduction to Hadoop,Data format, analyzing data with Hadoop, scaling
out, Hadoop streaming, Hadoop pipes, Hadoop distributed file system (HDFS),
HDFS concepts, data flow,Hadoop I/O, data integrity, compression, serialization,
Avro file-based data structures, Map Reduce workflows, unit tests with MRUnit,
test data and local tests – anatomy of Map Reduce job run, classic Map-reduce,
YARN, failures in classic Map-reduce and YARN, job scheduling, shuffle and sort,
task execution, MapReduce types, input formats, output formats.
Hadoop Related Tools: Hbase,data model and implementations, Hbaseclients,
Hbase examples – praxis. Cassandra, Cassandra data
model,Cassandraexamples,Cassandraclients, Hadoop integration. Pig,Grunt, pig
data model, Pig Latin, developing and testing Pig Latin scripts. Hive, data types
and file formats,HiveQL data definition,HiveQL data manipulation – HiveQL
queries, Overview of spark.
Data Analysis: Overview of R programming language,Regression Modeling,
Multivariate Analysis, Bayesian Modeling, Inference and Bayesian Networks,
Support Vector and Kernel Methods, Analysis of Time Series, Linear Systems
Analysis, Nonlinear Dynamics, Rule Induction, Neural Networks, Learning And
Generalization, Competitive Learning, Principal Component Analysis and Neural
Networks, Fuzzy Logic: Extracting Fuzzy Models from Data, Fuzzy Decision Trees,
Stochastic Search Methods.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 87
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Emerging Trends.
SUGGESTED READINGS
1. Michael Minelli, Michelle Chambers, and AmbigaDhiraj, "Big Data, Big
Analytics, “Emerging Business Intelligence and Analytic Trends for Today's
Businesses", Wiley.
2. Big-Data Black Book, DT Editorial Services, Wiley India
3. Massive Online Open Courses (MOOCS): Big Data University, Udacity and
Coursera.
4. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging
World of Polyglot Persistence", Addison-Wesley Professional, 2012.
5. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley, 2012.
6. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.
7. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilley,
2012.
8. Lars George, "HBase: The Definitive Guide", O'Reilley, 2011. 8. Eben Hewitt,
"Cassandra: The Definitive Guide", O'Reilley, 2010. 9. Alan Gates,
"Programming Pig", O'Reilley, 2011
L T P CA MS ES Int ES
3 0 2 10 20 40 15 15
CED03 Software Testing CEC11
COURSE OUTCOMES
1. Learn the various concepts and methods that can be used to test software
before it is delivered to the end user.
2. Learn about various challenges and difficulties faced during the process of
software testing and approach for tackling them.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 88
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Introduction to Software Testing: Definition, Goals, Test metrics,
Effective Software Testing versus Exhaustive Software Testing
Software Testing Terminology: Role of testing in SDLC, Discussion of
testing terminology such as error, bug and failure, test case and Test
plan. , V-Testing Life Cycle Model
Software Verification: Verification and validation Activities, Role of verification
and Validation in Testing Strategy. Verification methods: Inspections,
Walkthroughs and reviews, SRS document verification, SDD document verification.
Overview of test generation strategies: Types of testing-White box and
Black Box testing, Test case generation from source code, test generation
from requirements, Test generation from finite state models, test
generation from combinatorial designs
Static White box testing Techniques: Inspections, structured
walkthroughs and Technical reviews
Structural/Dynamic White Box Testing Techniques: Logic Coverage
Criteria, Basis Path Testing,, Loop testing, Data Flow Testing, slice based
testing, Mutation Testing
Dynamic Black Box Testing Techniques: Boundary Value Analysis(BVA),
Equivalence Class Testing, State-Table Based Testing, decision Table
Based Testing, Cause-Effect Graphing Based Testing
Essentials of Graph Theory: What is graph, matrix representation of
graph, paths and independent paths, generation of a graph from a
program, identification of independent pathsselection
Test Selection and Test minimization and Prioritization of test cases
for Regression testing: What is Regression testing, Regression test case
selection, reducing the number of test cases, Risk analysis, code coverage
prioritization.
Introduction to Object Oriented Testing: Path testing, state based
testing class testing,
Testing Tools: Static Testing Tools, Dynamic testing Tools
Emerging Trends.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 89
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Yogesh Singh , “Software Testing”, Cambridge University Press
2. Aditya P. Mathur, “Foundations of Software Testing, fundamental
Algorithms and Techniques”, Pearson Education
3. Naresh Chauhan, “Software Testing Principles and Practices”,
OxfordUniversity Press.
4. Ramesh Desikan, “Software Testing Principles and Practices”,Pearson
Education
L T P CA MS ES Int ES
3 0 2 10 20 40 15 15
CED04 Mobile Ad-hoc Networks CEC08, CEC13
COURSE OUTCOMES
1. Describe the unique issues in ad hoc wireless networks, current technology
trends for the implementation and deployment of ad hoc wireless networks.
2. Understand the routing algorithms used in mobile ad hoc network.
3. Learn the issues in QoS solutions and Energy Management Schemes in
adhoc wireless networks.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 90
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Introduction to adhoc networks: Definition, characteristics features,
applications. Characteristics of Wireless channel, Adhoc Mobility Models:- Indoor
and outdoor models.
Medium access protocols MAC: design issues, goals and classification.
Contention based protocols- with reservation, scheduling algorithms, protocols
using directional antennas. IEEE standards: 802.11a, 802.11b, 802.11g, 802.15.
HIPERLAN.
Network protocols Routing Protocols: Design issues, goals and classification.
Proactive Vs reactive routing, Unicast routing algorithms, Multicast routing
algorithms, hybrid routing algorithm, Energy aware routing algorithm, Hierarchical
Routing, QoS aware routing.
End-end delivery and security Transport layer : Issues in designing- Transport
layer classification, adhoc transport protocols. Security issues in adhoc networks:
issues and challenges, network security attacks, secure routing protocols.
Cross layer design and integration of adhoc for 4G Cross layer Design: Need for
cross layer design, cross layer optimization, parameter optimization techniques,
Cross layer cautionary perspective. Integration of adhoc with Mobile IP networks.
Emerging Trends.
SUGGESTED READING
1. C.Siva Ram Murthy and B.S.Manoj, “Ad hoc Wireless Networks Architectures
and protocols,” 2nd edition, Pearson Education
2. Charles E. Perkins, “Ad hoc Networking,” Addison – Wesley
3. Stefano Basagni, Marco Conti, Silvia Giordano and Ivan stojmenovic, Mobile, “Ad
hoc networking,” Wiley-IEEE press
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 91
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES Int ES
3 0 2 10 20 40 15 15
CED05 Advanced Data Structures CEC01, CEC02
COURSE OUTCOMES
1. Understand and apply amortized analysis on data structures, including binary
search trees, meargable heaps, and disjoint sets.
2. Understand the implementation and complexity analysis of fundamental
algorithms such as RSA, primality testing, max flow, discrete Fourier
transform.
3. Develop applications using concepts learnt such as of linear programming,
string matching and game-theory.
COURSE CONTENT
This course extends the core concepts of data structures and introduces new data
structures and algorithms that address emerging challenges in computing. Topics
include:
- Handling multiple stacks and queues.
- Alternative hashing methods: Division method, middle square method,
Fibonacci method, Multiplication method.
- String matching algorithms.
- Trees and Heap structures: Red-black trees and operations, operations on
AVL trees, B trees, min-max heap, Binomial heap and Fibonacci heap.
- New tree structures: Palindrome trees , VP Trees, Weak B Trees.
- Succinct data structures: Trie, Patricia Trie, Suffix Trie, Suffix arrays,
succinct representation of tree, Cardinal trees and ordinal tree.
- Cache oblivious data structures and algorithms.
Emerging Trends.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 92
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Thomas H. Cormen, Charles E. Leiserson, RonaldL. Rivest, and Clifford
Stein,“Introduction to Algorithms,” Third Edition. MIT Press and PHI, 2010.
2. Sartaj Sahni,“Data Structures and Applications, Chapman and Hall/CRC
Press”.
3. Palindrome trees: http://adilet.org/blog/25-09-14/
4. Vantage Point (VP) trees: http://stevehanov.ca/blog/index.php?id=130
http://www.dcc.uchile.cl/~gnavarro/ps/spire12.4.pdf
5. Ian Munro, Succinct data structures
https://cs.uwaterloo.ca/~imunro/cs840/SuccinctDS.pdf
6. Remco van der Hofstad, Random graphs and complex networks.
7. Eric D Demaine, Cache Oblivious algorithms and data structures,
http://erikdemaine.org/papers/BRICS2002/paper.pdf
L T P CA MS ES Int ES
3 0 2 10 20 40 15 15
CED06 Natural Language Processing CEC02, CEC05
COURSE OUTCOMES
1. Understand the basic properties of human languages and descriptive and
theoretical frameworks for handling these properties;
2. Understand the design of tools for basic NLP tasks such as tagging and
partial parsing and be able to apply them to text and evaluate their
performance;
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 93
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Introduction:NLP tasks in syntax, semantics, and pragmatics. Applications such
as information extraction, question answering, and machine translation. The
problem of ambiguity. The role of machine learning. Brief history of the field.
Regular Expressions: Chomsky hierarchy, regular languages, and their
limitations. Finite-state automata. Practical regular expressions for finding and
counting language phenomena. Word morphology.
Language modeling and Naive Bayes: Probabilistic language modeling and its
applications. Markov models. N-grams. Estimating the probability of a word, and
smoothing. Generative models of language.
Part of Speech Tagging, Sequence Labeling and Syntactic Parsing Lexical syntax.
Hidden Markov Models. Maximum Entropy Models. Conditional Random Fields,
Grammar formalisms and Treebanks. Efficient parsing for context-free grammars
(CFGs). Statistical parsing and probabilistic CFGs (PCFGs). Lexicalized PCFGs.
Semantic Analysis: Lexical semantics and word-sense disambiguation, Multi
word expressions. Compositional semantics. Semantic Role Labeling and Semantic
Parsing, Discourse Analysis
Emerging Trends.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 94
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Steven Bird, Ewan Klein, and Edward Loper, “Natural Language Processing
with Python– Analyzing Text with the Natural Language Toolkit”
2. Christopher D Hanning,Hinrich Schütze, “”, MITPress. Cambridge, MA:.
3. Daniel Jurafsky and James H. Martin, “Speech and Language Processing,”
Prentice Hall; 2nd edition (May 16, 2008)
4. http://nlp.stanford.edu/~manning/
5. http://wwwcsli.stanford.edu/~schuetze
L T P CA MS ES Int ES
3 0 2 10 20 40 15 15
CED07 Information and Network CEC13, CEC14
Security
COURSE OUTCOMES
1. Understand the principles, techniques and tools used for designing secure
information systems.
2. Design, implement and maintain secure computer networks.
3. Safely recover an information system or network from a security attack.
COURSE CONTENT
Computer Security Concepts: Threats, Attacks, and Assets, Security Functional
Requirements, Fundamental Security Design Principles, Information Security:
Confidentiality, Integrity, Availability, Identification and Authentication,
Authorization and Access control, Accountability and Auditing.
Cryptography for Data Security: Basic Concepts and Historical Overview,
Mathematical Foundations of Cryptography, Symmetric Encryption Techniques,
Asymmetric Key Encryption Techniques, Public Key Infrastructure (PKI),
Authentication, Message Digest & Digital Signature, Kerberos Key Exchange,
Encryption standards and case studies.
Types of Attacks: Malicious programs (e.g., viruses, worms, Trojan horses), Buffer
overflow attack, Hacking methods and software tools, Denial-of-service attacks and
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 95
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Emerging Trends.
SUGGESTED READING
1. William Stallings ,"Cryptography and Network Security: Principles and
Practice", 6th Edition, Prentice Hall
2. Behrouz A. Forouzan,"Cryptography & Network Security", 2nd Edition, McGraw
Hill
3. Michael E. Whitman, Herbert J. Mattord, "Principles of Information Security"
5th Edition, Cengage Learning
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 96
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES Int ES
3 0 2 10 20 40 15 15
CED08 Mobile Computing CEC05, CEC13, CEC14
COURSE OUTCOMES
1. Understand the characteristics and limitations of mobile hardware devices
including their user-interface modalities.
2. Interface a mobile computing system to hardware and networks.
3. Program applications on a mobile computing system and interact with servers
and database systems.
4. Develop an awareness of professional and ethical issues, in particular those
relating to security and privacy of user data and user behavior.
COURSE CONTENT
Introduction: Overview of Wireless Telephony, Wireless and Mobile Computing
Architecture – Limitations of wireless and mobile communication – Wireless
Telecommunication Networks: Digital cellular Systems, TDMA - CDMA – Wireless
Networking Techniques –Mobility Bandwidth Tradeoffs – Portable Information
Appliances.
Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth, Wireless multiple
access protocols, TCP over wireless, Wireless applications, data broadcasting, WAP:
Architecture, protocol stack, application environment, applications.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 97
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READING
1. Mobile Communication 2nd edition by Jochen Schiller, Pearson education
2. Mobile Computing by Asoke Talukder, Roopa Yavagal (Tata McGraw Hill)
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 98
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES Int ES
3 0 2 10 20 40 15 15
CED09 Advanced Networks CEC08, CEC13
COURSE OUTCOMES
1. To acquire knowledge so as to become familiar with the state of the art in
modern day computer networks: network architecture, protocols and systems.
2. To gain knowledge of various analytical methods used in the design and
engineering of next-generation networks and use simulations to evaluate the
performance of various design concepts.
3. To understand the current directions in design of computer networks from
literature readings in order to perform high-quality research.
4. To learn about various threats and attacks on web application and adopt
ethical practices in using and designing web base application
COURSE CONTENT
Networking review and challenges in modern day networks :Traffic
Engineering: Latest techniques of Congestion Control and Flow Control, Routing:
Secure, Scalability, Reliability.
Disruption Tolerant networking: high packet loss, frequent interruptions,
mobility, high latency, and unpredictable conditions.
Distributed Computing networks : (Grids), Data Center networking, Networking
and Virtualization, Peer to Peer and Overlay networking, Opportunistic networks,
Software-defined networking, Content based Network Architectures: Wireless
Sensor networks, Internet of Things and other content based paradigms, Network
Security.
Advanced topics based on recent research publications on future generation
computer networks
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 99
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
There is no required textbook. Required reading material for this course will come
in the form of research papers.
L T P CA MS ES Int ES
3 1 0 30 20 40 - -
CED10 Logic Programming CEC02, CEC15
COURSE OUTCOMES
1. To understand knowledge systems and problem solving
2. To acquire logic programming skills
COURSE CONTENT
Concepts: Logic and control, problem solving, knowledge representation
Prolog: Introduction, example programs in prolog, compiling prolog programs,
prolog data structures, dataflow and recursion, list processing, graphs in prolog,
negation, database clauses, assert and retract operations, advanced features.
Variants of logic programming such as: abductive, constraint, concurrent,
inductive, higher order, linear, object oriented, transactional logic programming.
SUGGESTED READING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 100
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES Int ES
3 0 2 10 20 40 15 15
COURSE CONTENT
Web Technologies: TCP/IP, HTTP, HTTPs, Telnet, FTP, WWW, URL, Email,
Domain Name Service, Web Browsers, Search Engines-Architecture, Crawlers,
Type of crawlers, search tools; Chat & Bulletin Board Services, SNMP, VPN, VoIP
&Internet Telephony.
Security: Concept of Internet security, Firewall-Functioning, types of Firewall, IP
Security- Architecture, Authentication header, Encapsulating security payloads,
combining security associations. Sniffing, spoofing, viruses, worms, Trojan horses,
and their security. Physical security, Biometric systems, Data security, systems,
security, Computer System security, communication security.
Cyber Laws: Introduction, The rights the various parties have with respect to
creating, modifying, distributing, storing and copying digital data- concurrent
responsibilities and potential liabilities.
Web Design: Key issues in web site design, Use of Different HTML tags in web
pages, Building HTML documents, Cascading Style Sheets-Internal, Inline and
external style sheets, Java Script, Dynamic HTML with Java Script, XML
technologies –XML, DTD, XSD, XSLT, XQuery, XPath.
Web programming, PHP, database connectivity with MySQL, security and
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 101
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
identity.
1. Exercise based on developing websites and portals using HTML, CSS, Java
Script.
2. Exercise based on implementation of XML technologies.
3. Projects based on PHP and MySQL to be implemented.
SUGGESTED READINGS
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 102
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
3 0 2 10 20 40 15 15
CED12 Emerging Programming CEC07
Paradigms
COURSE OUTCOMES :
1.To acquire knowledge of emerging paradigms like agile software development,
design patterns and component based development.
2.To be able to apply the concepts for designing complex object oriented solutions
in a collaborative environment
3. To imbibe the habit of continuous process of learning new and emerging
technologies in the field of programming languages
COURSE CONTENTS
The contents of this course will be based on current state of art technologies like
aspect oriented requirements engineering, design and architectural patterns software
and collaborative agile software development.
SUGGESTED READING
1. Eric gamma et al., design patterns, Addison Wesley, 1995
2. Gul Agha et al, research directions in Concurrent Object oriented Programming,
MIT Press , 1993.
L T P CA MS ES CA ES
3 0 2 10 20 40 15 15
CED13 Wireless Technologies CEC09, CEC13
COURSE OUTCOMES
1. Develop an understanding of the basics of wireless communication and how
communication takes place in wireless networks.
2. Discuss about cellular communication.
3. Understand the nuances of GSM and CDMA technologies.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 103
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Evolution Of Mobile Cellular Networks, Global System for Mobile
Communications, GPRS, PCs, WLAN, UMTS, IMT2000, cdma2000 evolution, LTE
Origins of Ad Hoc: Packet Radio Networks: Challenges, Architecture, Component
of Packet Radios, Routing in PRNETs, Route Calculation, Pacing Techniques,
Media Access, Flow Acknowledgements
Ad-Hoc Wireless Networks: Mobile Devices, Wireless Sensor Networks, Traffic
Profiles, Types of Ad Hoc Mobile Communications, Types of Mobile Host
Movements.
Ad-Hoc Wireless Media Access Protocols: Introduction, Challenges in Channel
access, Receiver Initiated MAC Protocols, Sender Initiated MAC Protocols,
Protocols-MACA, MACA-BI, PAMAS, DBTMA, MARCH
Overview of Ad Hoc Routing Protocols: Table Driven approaches, DSDV,WRP,
CSGR, Source Initiated on-demand approaches, AODV, DSR, TORA, SSR,LAR,
PAR, ZRP, STAR, RDMAR
Ad Hoc Wireless Multicast Routing: Multicasting in Wired Networks, Multicast
routing in Mobile Ad hoc Networks, Protocols- AODV multicast, CAMP, ODMRP,
LBM, DVMRP, Comparisons of protocols
Performance of Ad hoc Networks: Introduction, Performance Parameters, Route
Discovery Time, End to End Delay, Communication throughput, Packet loss, Route
Repair time, Power Management
Security Issues:Security of wireless infrastructures, Security Principles, Depp
packet Inspection
Emerging Trends
SUGGESTED READING
1. Wireless Networks by Clint Smith and Daniel Collins (2014)
2. Wireless Networking Absolute Beginner’s Guide by Michael Miller (2013)
3. 802.11 Wireless Networks: The Definitive Guide , Second Edition by Matthew
S. Gast (2005)
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 104
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
3 0 2 10 20 40 15 15
CED14 Advanced algorithms CEC01, CEC02, CEC05
COURSE OUTCOMES
1. Candidate will be able to understand paradigms and approaches used to
analyze and design algorithms and to appreciate the impact of algorithm design
in practice with asymptotic notations.
2. Able to use different computational models (e.g., divide-and-conquer, greedy
approach, dynamic programming, back tracking, branch and bound) with their
complexity measures like running time, disk space for solving real life complex
problems for lifelong learning.
3. Understand the difference between the lower and upper bounds of various
problems and their importance in deciding the optimality of an algorithm and
relating these analyses to real life problems.
4. Able to understand solvable / unsolvable problems the classes P, NP and NP-
complete.
COURSE CONTENT
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 105
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1.A.V. Aho, J.E. Hopcroft, and J.D. Ullman, “DataStructures and Algorithms,”
Addison Wesley, Reading Massachusetts, USA,
2.Donald Knuth, “The Art of Computer Programming: Fundamental Algorithms,”
Addison-Wesley .
3.Donald Knuth,“The Art of Computer Programming,” Volume 3: Sorting and
Searching, Third Edition. Addison-Wesley.
4.Thomas H. Cormen, Charles E. Leiserson, RonaldL. Rivest, and Clifford Stein,
“Introduction to Algorithms,”.
5.Sartaj Sahni,“DataStructures and Applications,” Chapman and Hall/CRC Press.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 106
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
PART B
SYLLABI OF DOMAIN SPECIFICELECTIVES WITH TUTORIAL
LTP Allocation Evaluation Scheme
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
Code Name of Elective Pre-Requisites
CED15 Fault Tolerant Computing CEC 04, CEC08
COURSE OUTCOMES
1. To appreciate that fault tolerant design methods are needed tackle various
hardware and software faults that affect realistic computing systems
2. To be able to design fault tolerant computing systems in a cost effective manner for
different applications
3. To apply various quality metrics to evaluate fault tolerant systems such as
reliability, availability and dependability.
COURSE CONTENT
Fundamental Concepts
Faults and errors, fault classification, fault assumptions, fault tolerant attributes and
system structure.
Hardware Fault-Tolerant Design Techniques
Hardware redundancy, standby sparing, NMR and combined approaches, time
redundancy.
Self-checking concepts, error-detecting codes for digital circuits such as Berger
codes, two-rail codes, AN codes, m-out-of- codes.
Information redundancy, error detecting and correcting codes for data
communication.
Dependability Evaluation Techniques: Reliability and availability models: -
Combinatorial techniques, Fault-Tree models, Graceful degradability and Continuous
Time Markov Chain models, Reliability importance metrics such as structural
importance and Birnbaum importance, Performability Models.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 107
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. D.K. Pradhan, “Fault-Tolerant Computer System Design,”.
2. B.W.Johnson, “Design and Analysis of Fault-Tolerant Digital Systems,” Addison-
Wesley.
3. D.K. Pradhan, “Fault-Tolerant Computing, Theory and Techniques,”Prentice Hall.
4. D.P.Siewiorek and R.S.Swartz, “Reliable Computer Systems: Design and
Evaluation,“ Digital Press.
5. K.S.Trivedi,“Probability and Statistics with Reliability, Queueing and Computer
Science Application,” Prentice Hall.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
Code Name of Elective Pre-Requisites
CED16 Artificial Intelligence CEC02, CEC05
COURSE OUTCOMES
1. Distinguish between a conventional system and an intelligent system
2. Explain Artificial Intelligence concept and its applications
3. Represent knowledge using various different techniques
4. Use the appropriate searching techniques in achieving desired goals
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 108
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENTS
Foundational issues in intelligent systems
What is Artificial Intelligence? The AI problems, Underlying assumption, AI
technique, Criteria for success,
Problems, Problem Spaces and Search Defining problem as a state space search,
production systems, problem characteristics, production system characteristics
Generate and test, hill climbing, Best first search, best first- A * algorithm, AO*
algorithm problem reduction, constraint satisfaction, means and ends analysis
Game Playing: Overview, Mini-max search procedure, Alpha-beta cutoffs
Knowledge representation issues: Representations and mappings, approaches to
knowledge representation, issues in knowledge representation
Using Predicate Logic:Representing simple facts in logic, representing instance and
Isa relationships, computable functions and predicates, resolution,
Representing knowledge using rules:Procedural vs. declarative knowledge, logic
programming, forward vs. backward reasoning
Nets and Frames
Reasoning under uncertainty and Machine Learning: Non-monotonic reasoning,
Bayesian networks, Fuzzy logic, Dempster-Shafer theory
Planning: Overview, blocks world problem, components of planning system, goal
stack planning
Fundamental concepts of Artificial Neural Networks: Models of ANNs; Feedforward
& feedback networks; learning rules; Hebbian learning rule, perception learning rule,
delta learning rule, Widrow-Hoff learning rule, correction learning rule, Winner –lake
all learning rule, etc.
Introduction to Natural Language Programming
Overview of Expert System Technology: Rule based Expert Systems, Expert
system shells
Current trends and Projects: Current trends in AI, Presentation and discussion of
projects
AI programming Languages:Languages and Programming Techniques for AI-
Introduction to PROLOG and LISP, Search strategies and Logic Programming in LISP,
Production System examples in PROLOG.
Outline of practical work:
There will be approximately several laboratory (programming) assignments during the
semester.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 109
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READING
1. S Russel and P Norvig, “ Artificial Intelligence- A Modern Approach,” Pearson
Education.
2. E. Rich and K.Knight, “Artificial Intelligence,” Tata McGraw Hill.
3. Simon Haykin, “Neural Networks :A Comprehensive formulation,” AW.
4. Nils J Nilsson, “Artificial Intelligence a new Synthesis,” Elsevier.
5. Ivan Bratko, “Prolog Programming for Artificial Intelligence,” Addison Wesley.
6. George F Luger, “Artificial Intelligence- Structures and Strategies for Complex
Problem Solving,” Pearson Education.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 110
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 111
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED18 Computer Vision CEC02,CEC05, CEC12
COURSE OUTCOMES
1. To develop an understanding of the fundamentals of image formation, camera
imaging geometry, feature detection and matching, multiview geometry including
stereo, motion estimation and tracking, and classification.
2. To gain an insight into the image formation and analysis, as well as the ability to
extract information much above the pixel level.
3. To acquire skills that can be appliedwhile operating on images in a context-aware
manner or where images from multiple scenarios need to be combined or organized
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 112
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
in an appropriate way.
COURSE CONTENT
Digital Image Formation and low-level processing: Overview and State-of-the-art,
Fundamentals of Image Formation, Transformation: Orthogonal, Euclidean, Affine,
Projective, etc; Fourier Transform, Convolution and Filtering, Image Enhancement,
Restoration, Histogram Processing.
Depth estimation and Multi-camera views: Perspective, Binocular Stereopsis:
Camera and Epipolar Geometry; Homography, Rectification, DLT, RANSAC, 3-D
reconstruction framework; Auto-calibration.
Feature Extraction: Edges - Canny, LOG, DOG; Line detectors (Hough Transform),
Corners - Harris and Hessian Affine, Orientation Histogram, SIFT, SURF, HOG,
GLOH, Scale-Space Analysis- Image Pyramids and Gaussian derivative filters, Gabor
Filters and DWT.
Image Segmentation: Region Growing, Edge Based approaches to segmentation,
Graph-Cut, Mean-Shift, MRFs, Texture Segmentation; Object detection
Pattern Analysis: Clustering: K-Means, K-Medoids, Mixture of Gaussians,
Classification: Discriminant Function, Supervised, Un-supervised, Semi-supervised;
Classifiers: Bayes, KNN, ANN models; Dimensionality Reduction: PCA, LDA, ICA;
Non-parametric methods.
Motion Analysis: Background Subtraction and Modeling, Optical Flow, KLT, Spatio-
Temporal Analysis, Dynamic Stereo; Motion parameter estimation.
Shape from X: Light at Surfaces; Phong Model; Reflectance Map; Albedo estimation;
Photometric Stereo; Use of Surface Smoothness Constraint; Shape from Texture,
color, motion and edges.
Miscellaneous: Applications: CBIR, CBVR, Activity Recognition, computational
photography, Biometrics, stitching and document processing; Modern trends -
super-resolution; GPU, Augmented Reality; cognitive models, fusion and SR&CS.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 113
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Richard Szeliski, “Computer Vision: Algorithms and Applications,” Springer-
Verlag London Limited.
2. D. A. Forsyth, J. Ponce, “Computer Vision: A Modern Approach,”Pearson
Education.
3. Richard Hartley and Andrew Zisserman, “Multiple View Geometry in Computer
Vision,” Cambridge University Press.
4. K. Fukunaga; “Introduction to Statistical Pattern Recognition,” Second Edition,
Academic Press, Morgan Kaufmann.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
COURSE OUTCOMES
1. Identify the component technologies of the Semantic Web and understand the
concept of Linked Web.
2. Illustrate the design principles of the Ontology and Semantic for developing
technologies
3. Understand certain limitations of the Semantic Web technologies, and be aware of
the kinds of services it can and cannot deliver.
COURSE CONTENT
Overview and Introduction: Knowledge Representation, Ontologies and Description
Logic, Semantic Web in Depth: RDF and RDF Schema, Semantic Web in Depth: OWL
Writing OWL ontologies: Protégé, Semantic Web Methodologies and Design
Patterns, Semantic Web in Depth: SPARQL, Semantic Web in Depth: Rules
Publishing on the Semantic Web: Linked Data, Semantic Web Vocabularies and
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 114
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READING
1. A Semantic Web Primer, third edition, MIT Press, 2012, Grigoris Antoniou, Paul
Groth, Frank van Harmelen and Rinke Hoekstra
2. Allemang, D., & Hendler, J. (2011). Semantic Web for the working Ontologist.
2nd Edition, Morgan &Kaufmann Publisher. [ISBN:978-0-12-385965-5]
3. Heath, T., & Bizer, C. (2011). Linked Data: Evolving the Web into a Global Data
Space. Morgan&Claypool Publisher. (Free copy
:http://linkeddatabook.com/editions/1.0/http://linkeddatabook.com/editions/1.
0/)
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED20 Advanced databases CEC02, CEC06
COURSE OUTCOMES
1. To get acquainted with new models and optimization techniques in digital
databases
2. To conduct research in the domain of databases and acquire the habit of keeping
abreast of latest developments
COURSE CONTENT
Database system architecture: query processing and optimization, transaction
processing concepts, concurrency control techniques, database recovery techniques,
database security and authorization, enhanced data models for advanced
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 115
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
applications,
Object relational databases: Object oriented databases, Non-SQL databases,
Temporal databases, deductive databases, database technology for decision support
systems,
Distributed and Web databases: data mining techniques
Advanced database:concepts, emerging technologies and applications.
SUGGESTED READING
1. Nabil R. Adam, Bharat K. Bhargava, “Advanced database systems, Lecture Notes in
Computer Science,”
2. Jan L. Harrington, Morgan Kaufmann, “Object Oriented databases clearly
explained,”
3. Carlo Zanialo, “Advanced database systems,” Morgan Kauffmann.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
COURSE OUTCOMES
1. To design full connected-product experiences by integrating Internet services and
physical objects.
2. To analyze, design and develop prototypes of Internet-connected products using
appropriate tools.
3.To identify, classify and describe different kinds of Internet-connected product
concepts.
4. To analyze the challenges and applying adequate patterns for user-interaction with
connected-objects.
COURSE CONTENT
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 116
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Mike Kuniavsky, “Smart Things: Ubiquitous Computing User Experience Design,”
Morgan Kaufmann Publishers.
2. “Designing the Internet of Things,”
3. Adrian McEwen, Hakim Cassivalli, Wiley.
4. Massimo Banzi, “Getting Started with Arduino (Make: Projects),”O'Reilly Media.
5. Donald A. Norman, “Emotional Design: Why We Love (or Hate) Everyday Things.
Basic Books,”.
6. Tom Igoe, Dan O'Sullivan, “Physical Computing: Sensing and Controlling the
Physical World with Computers,” Premier Press.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 117
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED22 Software Quality CEC11
COURSE OUTCOMES
1. Understand the quantitative aspect of software quality.
2. Learn and apply prevalent software quality tools and techniques for measuring
quality in traditional manufacturing set up.
3. Apply these tools and techniques in the software scenario.
4. Understand and learn the various quality management tools in the different stages
of Software Development life cycle
COURSE CONTENT
Introduction to Quality: The Quality Tradition: Origins of Quality Movement:
Deming and Crosby’s view of quality, Different Views of Quality: Transcendental,
User, Manufacturing, Product, Value based, Total Quality Movement (TQM),
Application of TQM to Software Engineering.
Why does software fail, Software quality: definition, how is software quality different?
Static quality attributes, Dynamic quality attributes.
Software Quality Models: McCalls, Boehms, ISO9126, GQM, Gilb’s template
Quality Management, Quality assurance Standards, ISO standards, CMM, CMMI, 3
Sigma, 6 Sigma Statistical Process Control (SPC).
Seven tools of quality control:Pareto Charts, Graphs, Check sheets, histograms,
Scatter Plots, Cause and Effect Diagrams.
Business Process Redesign (BPR): Benefits of BPR in software development, TQM
and BPR poised opposite to each other, Quality Function Deployment (QFD),
Application of Seven Management and Planning tools for Software
Requirements Capturing: Affinity diagrams, Interrelationship diagraphs, hierarchy
diagrams,, Matrix diagram, Matrix data analysis, process decision program chart,
arrow Diagram/Precedence Diagram, Computer Aided quality engineering (CAQE)
and tools for quality management.
MetricsSoftware: Definition, Types of Software Metrics, Organisation, Project,
Process, Product, Product Complexity metrics, Halsteads Software Science Metrics,
OO Metrics: Chidamber and Kemrer, OO metrics suite.
Study and use of various available quality assurance tools in manufacturing and
software scenarios
SUGGESTED READING
1.Akao, Y. (1988), “Quality function deployment: Integrating Customer requirements
into Product design,” Productivity Press.
2.Crosby, P.,“Quality is free,”
3. Fenton N., “Software Metrics a Rigrous Approach,” Wiley.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED23 Requirements Engineering CEC11
COURSE OUTCOMES
1.To appreciate the importance of Requirements Engineering in the Software
development Life Cycle
2. To model the real life problem with the help of requirements engineering
techniques.
3. To learn about representation of requirements through various requirements
engineering techniques.
COURSE CONTENT
Introduction: Basics of Requirements engineering, Requirements management,
Requirements and software life cycle.
Processes in Requirements Engineering: Framework for describing requirements
engineering process.Conceptual foundation of elicitation, System Analysis
techniques used for elicitation. Requirements specification, Requirements
validation.
Modeling Principles and Techniques for Requirements Engineering:
Requirements specification from the enterprise view. Representation of with
functional and non-functional view of the requirements.
Tools: Concept –Method –Tool view of Requirements Engineering, Role of CASE in
Requirements Engineering.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 119
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Emerging Trends
SUGGESTED READING
1.P. Loucopoulos and V. Karakostas,“System Requirements Engineering,” McGraw-
Hill.
2. K.Weigers, “Software Requirements,”Microsoft Press.
3. Ian Sommerville and P Sawyer, “Requirements engineering a good practice Guide,”
Wiley India.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED24 Digital watermarking and CEC02, CEC05
Steganography
COURSE OUTCOMES
COURSE CONTENT
Digital Watermarking: Introduction to Watermarking techniques. A Survey of Current
Watermarking Techniques, Watermark detection and analysis, Application of
cryptography in digital watermarking.
Classification of watermarking techniques: Robust and Fragile Watermarking.
Techniques for protection of multimedia data and databases, Security Analysis of
watermarking techniques.
Applications of digital watermarking: Copyright protection, Intellectual property
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 120
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Katzenbeisser and Petitcolas ,”Information Hiding: Techniques for steganography
and digital watermarking,” Artech House.
2. Johnson, Duric, and Jajodia, ”Information Hiding – Steganography and
Watermarking – Attacks and Countermeasures,” Kluwer Academics publishers.
3. Cox, Miller, and Bloom, “Digital Watermarking,” Academic Press.
4. Jeng-Shyang Pan, Hsiang-Cheh Huang, Lakhmi C. Jain, “Information Hiding and
Applications,” Springer.
5. Michael Konrad Arnold, Martin Schmucker, Stephen D. Wolthusen, “Techniques and
applications of digital watermarking and content protection”, Artech House.
6. Research papers on digital watermarking and steganography of refereed journals.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED25 Service Oriented Architectures CEC13, CEC14
COURSE OUTCOMES
1. Understandthe basic principles of service orientation and service oriented
analysis techniques
2. Gain an insight in the technology underlying the service design and learn
advanced concepts such as service composition, orchestration and choreography
3. Acquire skills to apply various components of service oriented architecture such
as SOAP, Entity-centric business service design, application service design etc
and their combination to implement the solutions.
4. Ability to plan , analyze and design enterprise software applications based on
service – oriented architecture.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 121
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Introduction:Roots of SOA, Characteristics of SOA ,Comparing SOA to client-server
and distributed internet architectures, Anatomy of SOA, How components in an SOA
interrelate, Principles of service orientation
Web services: Service descriptions, Messaging with SOAP, Message exchange
Patterns, Coordination ,Atomic Transactions, Business activities, Orchestration,
Choreography, Service layer abstraction, Application Service Layer, Business Service
Layer, Orchestration Service Layer
Service oriented analysis: Business-centric SOA, Deriving business services,
service modeling, Service Oriented Design, WSDL basics, SOAP basics, SOA
composition guidelines, Entity-centric business service design, Application service
design, Task- centric business service design
SOA platform basics: SOA support in J2EE, Java API for XML-based web services
(JAX-WS), Java architecture for XML binding (JAXB), Java API for XML Registries
(JAXR) , Java API for XML based RPC (JAX-RPC).
WS-BPEL basics: WS-Coordination overview ,WS-Choreography, WS-Policy, WS-
Security
Emerging trends
SUGGESTED READING
1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design,”
Pearson Education.
2. Papazoglou, Mike , “Web Services & SOA: Principles and Technology ,” Pearson –
Prentice Hall.
3. Bell, Michael , “Service-Oriented Modeling (SOA): Service Analysis, Design, and
Architecture,” Wiley.
4. Erl, Thomas , “SOA Design Patterns,” Prentice Hall .
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 122
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE OUTCOMES
1. Understand the real time system requirements and design analysis.
2. Understand the architectures, operating systems and performance issues of real
time systems.
3. Design a real time multi-tasking system or an embedded system controller.
COURSE CONTENT
Introduction: Real time systems models and classification, real time task
characterization, performance measures and estimation techniques.
Real-time process management: Task Scheduling for uniprocessor systems-
Rate monotonic, EDF, handling priorities with critical sections and interrupts,
reward based scheduling for accuracy-driven tasks
Advanced task scheduling: Scheduling for multiprocessor systems, adaptive
scheduling techniques, fault tolerant scheduling
Programming environment: RTOS, Programming languages, tools and techniques
.
Real-time system design: Design techniques for reliability, fault tolerance and
other application-specific quality considerations.
Real time communication: Communication media, network topologies, protocols.
Recent developments: Trends in real-time systems design and development
SUGGESTED READINGS
1. Phillip A. Laplante, “Real time systems design and analysis,” Wiley India.
2. Jane, W.S. Liu, “Real Time Systems,”
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 123
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
1 0 25 25 50 - -
COURSE OUTCOMES
1. Demonstrate systematic understanding of the concepts of security at the level
of policy and strategy in a computer system.
2. Identify and analyze the stages an ethical hacker requires to take in order to
compromise the target system.
3. Acquire knowledge of ethical laws and tests.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 124
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Introduction:Brief history of hacking, Nature of modern IT and its vulnerabilities,
Hacking methodologies, Penetration Testing, Legal and Ethical Considerations,
Creating and Implementing a Test Plan.
Strategy of Attack:Foot-printing and Social Engineering, Host Reconnaissance,
Port Scanning, Enumeration of Services, Gaining Access to a System, Trojans,
Viruses, Worms and Covert Channels, Sniffing and Evasion.
Attacking a System: Session Hijacking, Web Server Attacks, Database Attacks,
Password Cracking, Network Devices & Attacks, Wireless Network Attacks, Trojans
and Backdoor Applications, OS Specific Attacks, Buffer Overflows, Denial of
Service Attacks, Smashing the stack, Maintaining access and roadblocks, Evading
Intrusion Detection Systems, Firewalls and Honeypots, Social Engineering
Attacks, Physical Penetration Attacks.
Report Generation of Attacks:Developing a penetration testing report
Cryptography, Protecting Networks with Security Devices, Defending Against
Social Engineering and Physical Penetrations Attacks
Emerging Trends.
Outline of Project Work:Students will be assigned a semester wise study project
to explore the advancements in this area and present their work at the end of the
course.
SUGGESTED READINGS
1. Michael T. Simpson, Kent Backman, James E. Corley, “Hands‐On Ethical
Hacking and Network Defense,” CENGAGE Learning.
2. Steven DeFino, Barry Kaufman, Nick Valenteen, “Official Certified Ethical
Hacker Review Guide,” CENGAGE Learning.
3. Patrick Engebretson, “The Basics of Hacking and Penetration Testing: Ethical
Hacking and Penetration Testing Made Easy,” Elsevier.
4. Whitaker & Newman, “Penetration Testing and Network Defense,” Cisco Press.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 125
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED28 Digital Forensic CEC02, CEC05, CEC13
COURSE OUTCOMES
1. Understanding digital investigations that conform to accepted professional and
ethical standards of conduct, including impartiality and the protection of
personal privacy and are based on the standard investigative process:
identification, preservation, examination, analysis and reporting.
2. Acquire the ability to identify and document potential security breaches of
computer data that suggest violations of legal, ethical, moral, policy and/or
social standards.
3. Ability to apply a solid foundational grounding in computer networks, operating
systems, file systems, hardware and mobile devices to digital investigations and
to the protection of computer network resources from unauthorized activity.
4. Acquiring skills to work collaboratively with clients, management and/or law
enforcement to advance digital investigations or protect the security of digital
resources.
COURSE CONTENT
Introduction: History of forensics, Types of investigations, The Forensic Process,
Traditional Digital Forensic Process
Concepts of Computer Security: Security Incidents and Response, Real life
examples of Computer Crime, Digital Forensics rules, Procedures, and Challenging
aspects
Legal Issues: Stages of Investigative Process, Applying Forensic Science procedures
to digital resources
File Systems: File Structures, Boot Processes and Systems logs of various popular
operating systems (Windows, Linux, Macintosh), State-of-the art Computer
Forensics Tools, Role of Image Files and Multimedia Files in digital forensics.
Network Forensics: Digital Evidence on Physical, Data-Link Layers, Network and
Transport Layers, Internet Application Services; Live Acquisitions, Investigating
Intrusions, Cell Phone and mobile device forensics, Virtual Machine and Cloud
Forensics
Digital Evidence in the Courtroom: Admissibility, Authenticity and Reliability,
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 126
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Outline of Project Work: Students will be allotted a study project that will require
them to explore the new dimensions in this area and present their work at the end
of course.
SUGGESTED READINGS
1. Bill Nelson, Christopher Steuart, Amelia Phillips , "Guide to Computer Forensics
and Investigations," Cengage.
2. John Sammons, "The Basics of Digital Forensics: The Primer for Getting Started
in Digital Forensics," Syngress Media.
3. Eoghan Casey, "Digital Evidence and Computer Crime: Forensic Science,
Computers, and the Internet," Academic Press Inc.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED29 CAD of VLSI CEC02, CEC03, CEC05
COURSE OUTCOMES
1. To understand the VLSI design flow and the automation tasks involved in this
flow.
2. To implement algorithms for various steps of the process such as partitioning,
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 127
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Overview of CMOS circuits and characteristics: CMOS Logic, The inverter,
Combinational Logic, NAND gate, NOT Gate, Compound Gates, Multiplexers,
Memory-Latches and Registers. Switching Characteristics - analytic delay models,
empirical delay model, gate delay. Power Dissipation - Static dissipation, Dynamic
dissipation, short-circuit dissipation, total power dissipation.
VLSI design process: VLSI design flow, Hardware Definition Languages – Verilog/
VHDL: their use in modeling, synthesis, simulation and writing test benches.
Logic synthesis: Two-level and multilevel gate optimization, Partitioning,
scheduling, allocation, technology mapping.
Physical Design: Placement, Routing, Floorplanning, clock routing.
Design Verification: Informal, semi-formal and formal verification, Languages for
verification, Simulation for Functional testing, Timing verification and Delay
estimation, power estimation.
Design for testability: Introduction, Automatic test generation,Built in self test
(BIST), Boundary scan.
Emerging Trends: CAD for FPGA design and other topics
SUGGESTED READINGS
1. Neil H.E. Weste and Kamran Eshraghian, “Principles of CMOS VLS Design – A
System Perspective ,”.
2. Addison Wesley Pub.
3. S. Ramachandran, “Digital VLSI systems design,” Springer.
4. Wayne Wolf , “Modern VLSI Design: system on silicon,” Addison Wesley Longman
Publisher.
5. J. Bhasker, “Verilog VHDL synthesis: a practical primer,” B S Publications.
6. S.M. Sait and H. Youssef, “VLSI physical design automation: theory and practice,”
World Scientific Pub. Co.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 128
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED30 Middleware Technologies CEC13, CEC14
COURSE OUTCOMES
COURSE CONTENT
Introduction: Moving to e-business, what is IT architecture? Why is this different
from what we did before? Rewrite or evolve? , Who develops the architecture? Early
days, Preliminaries, Remote procedure calls, Remote database access, Distributed
transaction processing, Message queuing, Message queuing versus distributed
transaction processing, what happened to all this technology?
Objects,Components and Web: Using object middleware, Transactional component
middleware, COM, EJB, Final comments on TCM, Internet Applications. Web
services: Service concepts, Web services, and Using Web services: A pragmatic
approach.
Technical Summary of Middleware : Middleware elements, The communications
link, The middleware protocol, The programmatic interface, Data presentation,
Server control, Naming and directory services, Security, System management,
Comments on Web services, Vendor architectures, Vendor platform architectures,
Vendor distributed architectures, Using vendor architectures, Positioning,
Strawman for user target architecture, Marketing, Implicit architectures,
Middleware interoperability.
Using middleware to build business application: What is middleware for? Support
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 129
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Emerging Trends
SUGGESTED READINGS
1. Chris Britton and Peter Eye, “IT Architectures and Middleware: Strategies for
Building Large, Integrated Systems,” Pearson Education.
2. Qusay H. Mahmoud, “Middleware for Communications,” John Wiley and Sons.
3. Michah Lerner, “Middleware Networks: Concept, Design and Deployment of
Internet Infrastructure,”Kluwer Academic Publishers.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED31 Multimedia Applications CEC12
COURSE OUTCOME
1. Understanding range of concepts, techniques and tools for creating and editing
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 130
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Li , Ze - Nian, “Fundamentals of Multimedia,” PHI.
2. Ramesh Yerraballi, “Multimedia Systems Concepts Standards and
Practice,”PHI.
3. “Multimedia Communications: Applications, networks, protocols and
standards,” Pearson.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 131
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED32 Human Computer Interfacing CEC03, CEC12
COURSE OUTCOMES
1. To be able to understand the importance of designing interactive products that are
usable.
2. To be able to communicate effectively about requirements, design, and evaluation
activities relating to interactive products.
3. Evaluate an interactive product using suitable techniques.
COURSE CONTENT
Importance of user Interface – definition, importance of good design. Benefits of
good design. A brief history of Screen design.
The graphical user interface – popularity of graphics, the concept of direct
manipulation, graphical system, Characteristics, Web user – Interface popularity,
characteristics- Principles of user interface.
Design process – Human interaction with computers, importance of human
characteristics human consideration, Human interaction speeds, understanding
business junctions.
Screen Designing : Design goals – Screen planning and purpose, organizing
screen elements, ordering of screen data and content – screen navigation and flow
– Visually pleasing composition – amount of information – focus and emphasis –
presentation information simply and meaningfully – information retrieval on web –
statistical graphics – Technological consideration in interface design.
Windows – New and Navigation schemes selection of window, selection of devices
based and screen based controls.
Components – text and messages, Icons and increases – Multimedia, colors, uses
problems, choosing colors.
Software tools – Specification methods, interface – Building Tools.
Interaction Devices – Keyboard and function keys – pointing devices – speech
recognition digitization and generation – image and video displays – drivers.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 132
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Galitz, “The Essential Guide to User Interface Design: An Introduction to GUI
Design Principles and Techniques,” Wiley.
2. Dix, A. Finlay, J., Abowd, G. and Beale, “Human-Computer Interaction,”
Prentice Hall.
3. Preece, J., Sharp, H. and Rogers, “Interaction Design: Beyond Human-
Computer Interaction,” Wiley.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED33 Emerging Applications of CEC02,CEC05
Computing
COURSE OUTCOMES
1. Appreciate and apply state of the arttechnologies in different fields of computing.
2. Continue to learn new approaches, tools and applications in the field of
computing.
COURSE CONTENT
The content of the course will be taken up based currently emerging technologies,
developments, advances and innovations in different fields of computing.
SUGGESTED READING
Will be decided according to students’ interests and field of expertise of the faculty.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 133
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED34 Cryptography CEC01
COURSE OUTCOMES
1. To learn the mathematics, logic and science underlying the principles of
cryptography.
2. To implement the cryptographic algorithms and use them in developing
applications.
COURSE CONTENT
Classical ciphers: Cryptanalysis of classical ciphers, Probability theory, Perfect
security
Block ciphers: DES, AES, Block cipher modes of operation
Private-key encryption: Chosen plaintext attacks,, Randomised encryption
Pseudo randomness, Chosen cyphertext attacks
Message authentication codes : Private-key authentication, CBC-MAC,
Pseudorandom functions, CCA-secure private-key encryption
Hash functions: Integrity ,Pre-image resistance,2nd pre-image resistance, Collision
freeness, SHA-256,NMAC/HMAC
Key distribution : Key distribution centres,Modular arithmetic and group theory
Diffie-Hellman key exchange
Public-key Distribution: EIGamal encryption, Cramer-Shoup encryption,Discrete
logarithm problem
Digital Signatures: RSA signatures, RSA-FDH and RSA-PSS signatures, DSA
signatures,X.509 certificates , Certification paths.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 134
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Christof Paar, Jan Pelzl, “Understanding Crytography,” Springer.
2. Niel Ferguson, “Cryptography Engineering- Design principles and practical
application,” Wiley.
3. William Stallings, “Cryptography and network security – principles and practice
,” Pearson.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED35 Information Theory and coding CEC01
COURSE OUTCOMES
1. To learn about the basic principles of information theory
2. To acquire the skills to apply various coding techniques in information theory
COURSE CONTENT
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 135
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS:
1. R Ash, “Information Theory,” Dover Science Publications.
2. Cover and Thomas,“Element of Information Theory,” John Wiley & Sons.
3. Shulin& Daniel J. Costello Jr, “Error Control coding: Fundamental &
Application,”Prentice Hall. Simon Haykin,“IncCommunication Systems,” Wiley
Student Edition
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED36 Rough Set Theory CEC01
COURSE OUTCOME
1. To understand the need for approximate analysis and computation methods in the
context of real-life sophisticated applications
2. To use the tenets of rough set theory in developing applications.
COURSE CONTENT
Basic Concepts: Information systems and Decision Systems, Lower and Upper
approximations, Reducts, accuracy of approximation, positive region, classification
rules, motivation for rough set analysis
Properties of Rough Sets
Techniques for Rough set analysis: Steps for rough set analysis,Boolean
reasoning for finding discernability and reucts, MD heuristic, types of reducts
(generalized, approximate, dynamic, ensemble), and approaches for finding
reducts (genetic algorithms, hybrid approaches). Rules: support, confidence,
strength. Classification accuracy, precision, recall.
Rough Membership : Lower and upper approximation under rough membership
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 136
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Rough mereology.
Discretization and feature selection: Decision relative discretization, cuts
parallel to axes of feature space, Hyperplanes, award and penalty functions
Tolerance sets: Tolerance relations and sets, functional representation of T-
norms, Co-norms, Negations , Lower and upper approximations under tolerance
sets, Credibility of rules
Applications of Rough Set Theory.
Emerging trends: Fuzzy rough sets and current topics.
Guidelines for project work: Project/ Seminars/ Talks/presentations/ research
work/ term papers based on the above topics.
SUGGESTED READING
1.Jan Komorowski et al, “Rough Set
Tutorial,”http://eecs.ceas.uc.edu/~mazlack/dbm.w2011/Komorowski.RoughSets.t
utor.pdf
2. Polowski Lech, “Rough Set- Mathematical; foundation,” Springer.
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
CED37 Cloud Computing CEC13, CEC14
COURSE OUTCOMES
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 137
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Types of cloud architectures: Public, Private, Hybrid, Design issues with cloud:
scalability, fault tolerance, security, trust, privacy.
Case studies and emerging trends: Related toissues in migration to cloud, Cloud
computing economics etc.
SUGGESTED READINGS
1. K. Chandrasekaran, “Essentials of Cloud Computing,”
2. T. Velte, A. Velte and R. Estenpeter, “Cloud Computing – A practical approach,”
3. U.S. Pandey, Kavita Choudhary, “Cloud Computing,”
4. S. Chand,R. Buyya, C. Vecchiola, S.T. Selvi, “Mastering Cloud Computing,”
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 138
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE OUTCOMES
1. Understand the complexity of current information systems due their inherent
uncertainty and imprecision.
2. Ability to use methodologies that can exploit the tolerance for imprecision to
develop robust and cheap solutions for intelligent systems.
3. Develop skills to apply various components of soft computing such as fuzzy logic,
evolutionary computing, probabilistic computing etc and their combination to
implement the solutions.
COURSE CONTENT
Foundations of soft computing: Computational issues in intelligent information
systems.
Approximation theories: Overview of Fuzzy set theory, Rough Set theory, granular
computing, Mixed approaches.
Neural networks: learning process, single layer perceptrons, back propagation
algorithm, support vector machines
Evolutionary Algorithms: Overview and theory of genetic algorithms, genetic
operations, selection methods, tackling multi-objective functions, extensions
Swarm optimization: Techniques based on nature-driven optimization such as ant
colony, bird flocking, fish schooling, bat algorithm, cuckoo search etc.
Case Studies and Emerging trends:In the direction/area of cooperative agents,
adaptive systems applications etc.
Guidelines for project work: Project/ Seminars/ Talks/presentations/ research
work/ term papers based on the above topics.
SUGGESTED READINGS
1. N.K. Sinha and M.M. Gupta, “Soft computing and Intelligent systems,” Elsevier
2. Eva Volna, “Introduction to soft computing,” Free e-book.
3. Andrea G. B. Tettamanzi, Marco Tomassini, “Soft Computing:
IntegratingEvolutionary, Neural and Fuzzy Systems,”
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 139
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
COURSE OUTCOMES
1.Understand the concepts of distributed computing systems along with design and
implementation issues.
2. Acquire skills to analyze design and implement distributed algorithms
COURSE CONTENT
Distributed computing systems (DCS):Introduction, DCS design goals:
Transparencies, Fundamental issues
Distributed Coordination: Temporal ordering of events, Lamport's logical clocks,
Vector clocks; Ordering of messages, Physical clocks, Global state detection
Process synchronization: Distributed mutual exclusion algorithms, Performance
matrix, Inter-process communication
Deadlocks, Load scheduling and balancing techniques: Deadlock in distributed
systems, Round robin load balancing, client side load balancing, server side load
balancing, applications (such as routers)
Distributed System Models: System Architectures & Client-Server Models
Distributed Algorithms and Programming Systems: Search Engines, Page ranking,
leader election, Hashing, Caching, Remote Procedure Call.
Discussion on distributed computing platforms such as CORBA/ DCOM/ Java
RMI/ Hadoop Map-Reduce,
Workflow Systems: Grid Computing , Cloud Computing , Virtualization , IaaS Clouds
, Filesystems, Networked Filesystems, Parallel Filesystems
Distributed Filesystems: Data-Intensive Computing , Distributed Hash Tables ,
Consistency Models , Fault Tolerance , Many-core Computing
Emerging Trends in Distributed Computing.
Guidelines for practical/project work:
Programming using Remote Procedure Calls (RPC) mechanisms using Java
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 140
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. G. Coulouris, J. Dollimore, “Distributed Systems Concepts and Design,” Addison
Wesley.
2. Hwang & Dongarra & Fox,“Distributed and Cloud Computing, From Parallel
Processing to the Internet of Things,”
3. M. Singhal, N.G. Shivarathri , “Advanced Operating Systems,”, McGraw Hill.
4. Randy Chow, T. Johnson, “Distributed Operating Systems and Algorithms,” Addison
Wesley.
5. A.S. Tanenbaum,“Distributed Operating Systems,” Prentice Hall.
6. M. Tamer Ozsu, PatrickValduriez, “Principles of Distributed Database Systems,”
Prentice Hall International
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
COURSE CONTENT
Introduction: Patterns andMotivation for using patterns
Design patterns: Façade, adaptor, strategy, bridge, decorator, publisher-subscriber,
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 141
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
factory method, factory, template, singleton, object pool and their implementation in
Object Oriented languages such as C#/Java.
Architectural patterns: Architectural patterns used in various applications such as
interactive applications (Model View Controller MVC and Presentation-Abstraction-
Control PAC) ,distributed architectures (Broker, pipes and filters), Adaptable systems
(Reflection), Communication (Proxy) and other architectural patterns.
Guidelines for project work: Project/ Seminars/ Talks/presentations/ research
work/ term papers based on the above topics.
SUGGESTED READINGS
L T P CA MS ES CA ES
3 1 0 25 25 50 - -
COURSE OUTCOMES
1. Understand the basic knowledge representation, problem solving, and learning
methods.
2. Develop intelligent systems by assembling solutions to concrete computational
problems.
3. Understand the role of knowledge representation, problem solving, and rule based
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 142
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT
Overview: Rule based Reasoning, Production systems, Rule-based Systems, Review
of propositional and first order logic, Skolemisation, unification and its algorithms,
Goals and sub-goals, forward and backward chaining.
Intelligent Agents: Agents and Environments, Good Behavior: The Concept of
Rationality, The Nature of Environments, The Structure of Agents, How the
components of agent programs work.
Solving Problems: Solving problems by Searching, Problem-Solving Agents,
Searching for Solutions, Uninformed Search Strategies, Informed (Heuristic) Search
Strategies.
Adversarial Search and Constraint Satisfaction Problems, Study of minimax
algorithm
Building a knowledge base: Logical agents and Classical Planning, Study and
comparison of knowledge representation structures, Knowledge Representation and
Inference, Natural Language
Quantifying Uncertainty: Acting under Uncertainty, Basic Probability Notation,
Inference Using Full Joint Distributions, Bayes' Rule and Its Use, Representing
Knowledge in an Uncertain Domain, Other Approaches to Uncertain Reasoning,
Rule-based methods for uncertain reasoning, Representing vagueness: Fuzzy sets
and fuzzy logic, Study of fuzzy logic and Decision trees, Implementation aspects of
Decision trees
Learning from Examples: Forms of Learning, Supervised Learning, Learning
Decision Trees, The decision tree representation, Expressiveness of decision trees,
Inducing decision trees from examples
Emerging trendsand Future Directions:in Rule based Computing.
Guidelines for project work: Project/ Seminars/ Talks/presentations/ research
work/ term papers based on the above topics.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 143
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS
1. Russell, Stuart J., and Peter Norvig,“Artificial intelligence: a modern approach,”
Prentice Hall.
2. Patrick Henry Winston , “Artificial intelligence,” Addition Wesley.
3. Elain Rich and Kevin Knight, “Artificial Intelligence,” TMH.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 144
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 145
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 146
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 147
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 148
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 149
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 150
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 151
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 152
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 153
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 154
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Proof), How to read bank statement, Banking products and services, Calculating
Interests – Saving, FD, Simple and Compound Interest, Power of compounding Loans,
Types of loans, taking a home loan, Definition of EMI, Calculation of EMI, Post office-
Account and transactions, Basic of foreign Exchange, Importance and Use of Foreign
Exchange, Regulator Role of RBI, mutual funds.
UNIT II: Investment: Principles of Investment – Safety, Liquidity and Return,
Investment plans, Hybrid plans-Ulip, SIP and VIP of mutual funds, index funds
UNIT III: Financial Planning- Meaning, Household financial health checkup,
Important life stages, Medical and other Emergencies, ; Insurance, Meaning, Need
and Wants, Loss protection, Life, non-life and health, Benefits of Insurance, Term
plans, Social obligations Budgeting, Buying a house, Plan a vacation, Retirement
planning, Price of procrastination, Market and financial instruments, Primary market,
Secondary market, Financial Statement analysis,
UNIT IV: Scams, Fraud Schemes-Insider trading, Money laundering; Consumer
protection and redressal mechanism, Rights of Consumers, Applicable to financial
services, Filing a complaint, Complain to entity concerned, Regulators, Arbitration,
Consumer courts, Govt. Websites-(PG Portals), Investor Associations, Taxes, Meaning,
Need of Taxes, Types of taxes, How taxes impact income, Income, wealth and gift tax,
Service tax, STT, Stamp Duty, Tax planning v/s tax evasion, Tax rates, Tax free bonds,
Tax saving investment
SUGGESTED READINGS:
1. Braunstein, Sandra, and Carolyn Welch,`` Financial literacy: An overview of
practice, research, and
policy," Fed. Res. Bull.
2. Cole, Shawn A., and Gauri Kartini Shastry,`` Smart money: The effect of education,
cognitive ability, and financial literacy on financial market participation,” Harvard
Business School, 2009.
3. Study material of NSE.
4. Gitman, joehnk and Billingsley, ``Personal financial planning,’’ Cengage Learning
5. Madura Jeff,`` Personal finance student edition,’’ Prentice Hall PTR.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 155
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
theoretical underpinnings of the complexity of society and also with the whole
discourse contextualizing Sociology in India.
COURSE CONTENT:
1. Unit –I Conceptualizing Indian Society:
Hindu society and Diverse society ( Regional, Linguistic, Religious diversities); Peoples
of India-
Groups and Communities ; Unity in diversity; Ethnicity and ethnic identities.
2. Unit –II Theoretical perspectives I:
Indological/ Textual (G.S. Ghurye, L. Dumont Structural – Functional M.N. Srinivas,
S.C. Dube).
Marxian (D.P. Mukherjee, A.R. Desai)
3. Unit –III Theoretical perspectives II:
Civilizational view (N.K. Bose, Surajit Sinha). Subaltern perspective (B.R. Ambedkar,
David
Hardiman).
SUGGESTED READINGS:
1. Robert W. Stern, `` Introduction: Change, the societies of India and Indian
society’’ Cambridge University Press
2. Dhanagare. D.N,`` Themes and perspectives in Indian sociology,” Rawat
Publication.
3. Dube. S.C.`` The Indian Villages,” R and K Publication
4. Dumont. Louis Homo Hyerrchicus,`` The Caste System and its implications,”
Vikas publications.
5. Hardiman, David,`` The coming of the Devi :Adivasi Assertion in western India,”
Oxford University Press.
6. Marrott. Mckim,`` India through Hindu categories ,” Sage publication.
7. Momin. A. R,`` The legacy of G.S. Ghurye. A cemennial festschrift,” Popular
prakashan.
8. Mukherjee. D.P,`` Diversities,” Peoples publication house.
9. Singh. Y,`` Indian Sociology social conditioning and emerging concerns,” Vistaar
publication.
10. Singh. Y,`` Modernisation of Indian tradition,” Thomson press.
11. Singh. K.S.`` The Peoples of India. An introduction,” Seagull books.
12. Srinivas. M.N,`` India’s Villages,” Asia publishing house.
13. Singh Y,`` Identity & Theory in Indian Sociology,” Rawat Publication.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 156
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 157
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 158
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 159
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
forms. The enhancement and the development and maintenance of physical fitness,
self-confidence, self-discipline and independence with the body by providing informal
showings during class are the goals expected to be achieved. Each student should
leave this class having been encouraged, esteemed, and take with them a new
appreciation of dance.
COURSE CONTENT:
- Basic workout
- Introduction to Hip Hop and B-Boying with a simple choreography
- Exercise like: Rolling, jumping, moving shoulders. Footwork, Floor steps, Beat
knowledge.
- Freestyle combination along with House dance style.
- Expressions class: Body expressions, Face expressions.
- Introduction of Contemporary Dance. Basic exercise of Contemporary Dance.
Exercise for flexibility, Floor steps, Spinning and Balancing.
- Introduction to Jazz. Basic exercise and proper routine practice.
SUGGESTED READINGS:
1. Jonathan Burrows, ``A Choreographer's Handbook,’’ Routledge
2. Jacqueline M. Smith-Autard, ``Dance Composition: A Practical Guide to
Creative Success in Dance Making,’’ Routledge
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 161
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Effective Editing, Principles of Video Editing, Non-Linear Editing (NLE) Concept, The
Three-Point Edit, Non‐Linear Editing (NLE) Techniques, Working in the Timeline,
Transitions, Key framing, Applying Filters, Ingesting.
Unit-4Advanced Editing Techniques
NLE Compositing, Color Correction & Color Grading, Working on Audio, Titling
SUGGESTED READINGS:
1. Mark Brindle and Chris Jones, `` The Digital Filmmaking Handbook,”
Quercus
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 162
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
SUGGESTED READINGS:
1. Hajra Choudhury, Hazra Choudhary and Nirjhar Roy, ``Elements of Workshop
Technology, vol. I, ‘’ Media promoters and Publishers Pvt. Ltd.
2. W A J Chapman, Workshop Technology,`` Part -1, 1st South Asian Edition,’’
Viva Book Pvt Ltd.
3. P.N. Rao, ``Manufacturing Technology, Vol.1,’’ Tata McGraw Hill
4. Kaushish J.P., `` Manufacturing Processes, ‘’ Prentice Hall
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 163
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 164
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 165
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Nature).
To show that the fundamental reasons for imbalance in nature are: pollution
and resource depletion. Both these aspects are result of consumerist model of
development.
To show how harmony can be ensured at following levels of our living:
Individual, human –human relationships, larger society, Various social systems
like education system, economic system, political system and others, and rest
of the nature.
5. Development of Commitment and Courage to Act.
If the understanding is right, then the actions become right. Commitment and courage
to act are considered consequences of right understanding in an individual. In the
course, an attempt will be made to build right understanding in the individual, and
then further plan of actions will also be discussed in order to implement the
understanding in various life situations in the right manner.
At the end of the course, students are expected to become more aware of their
self and their relationships and would have better reflective and discerning
ability. They would also become more sensitive to their surroundings including
both people and nature, with commitment towards what they believe in (human
values).
It is hoped that they would be able to apply what they have learnt to their own
self in different ordinary day-to-day settings in real life with higher commitment
and courage.
COURSE CONTENT:
1. Motivation and Objectives of Human Values Course.
Introduction to the objectives of the course. Content and process of the course
including mode of conduct. Daily life as lab for the course. Activities in the course.
2. Purpose of Education How human being has a need for Knowledge, what should be
the content of knowledge, how the content should be discussed in education.
Complimentarily of skills and values, how the current education system falls short.
3. Peers Pressure, Social Pressure In various dimensions of life, how do these things
work. What is the way out? In the context of education, peer pressure etc. movie
―TaareZameen Par‖ can be used.
4. Concept of Competition and Excellence How competition leads to degradation of self
and relationships. How excellence is the basic need of a human being. What is
excellence? Movie ―Fearless‖ can be used to discuss the concept.
5. Time Management:
How does one deal with myriads of activities in college? Focus of the mind.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 166
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 168
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 170
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 171
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 172
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 173
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 174
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
capital structure
Unit IV
Dividend Decisions: Theories for Relevance and irrelevance of dividend decision for
corporate valuation-Walter’s Model, Gordon’s Model, MM Approach, Cash and stock
dividends. Dividend policies in practice.
Unit V
Working Capital Decisions: Concepts of Working Capital, Operating & Cash Cycles,
sources of short term finance, working capital estimation, cash management,
receivables management, inventory management.
SUGGESTED READINGS:
1. Khan, M.Y. and P.K. Jain,`` Financial Management: Text and Problems,’’ Tata
McGraw Hill
2. Srivastava, Rajiv, and Anil Mishra,`` Financial Management,’’ Oxford University
Press
3. Chandra, P., ``Financial Management-Theory and Practice,’’ Tata McGraw Hill.
4. Horne, Van; James C., John Wachowicz, ``Fundamentals of Financial
Management,’’ Pearson Education.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 175
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Unit III
HRD; Human resource management as a profession.Concepts of line-staff in the
structure of human resource department and the role of human resource manager.
Unit - IV
Manpower planning -objectives, elements, advantages, process. Job design -
(simplification, rotation, enlargement, enrichment and approaches}.Job analysis.Job
evaluation.
Unit - V
Recruitment (factors affecting, sources, policy, evaluation). Selection(procedure, tests,
interviews). Placement and Induction.
SUGGESTED READINGS:
1. Aswathappa K., ``Human Resource and Personnel Management,’’ Tata McGraw-Hill
2. Chhabra T.N., ``Human Resource Management,’’ Dhanpat Rai and Co.
3. Saiyadain S. Mirza, `` Human Resource Management,’’ Tata Mc-Graw Hill
4.Chadha, N.K, ``Human Resource Management-issues, case studies, experiential
exercises,’’ Sri Sai Printographers
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 176
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Project appraisal: Business criterion of growth, liquidity and profitability, social cost
benefit analysis in public and private sectors, investment criterion and choice of
techniques. Estimation of shadow prices and social discount rate.
Unit-IV
Project review/control-Evaluation of project. PERT/CPM.resource handling/leveling.
Unit-V
Cost and Time Management issues in Project planning and management , success
criteria and success factors, risk management.
SUGGESTED READINGS:
1. Ravi Ravindran, `` Operations Research and Management Science Handbook,’’ CRC
Press
2. Harold Kerzner, ``Applied Project Management: Best Practices on Implementation,’’
John Wiley & Sons
3. Goodpasture, J. C., ``Quantitative Methods in Project Management,’’ J Ross
Publishing
4. Meredith, J. R. and Mantel Jr., S. J., ``Project Management: A Managerial
Approach,’’ John Wiley
5. Clifford Gray, ``Project Management,’’ Richard D. Irwin
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 177
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 178
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 179
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 180
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 181
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 182
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 183
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 184
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 185
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 186
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 187
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
The students will learn about system definitions and role of system analyst. They will
learn about system modeling and design. They will be exposed to System
Implementation and Maintenance issues.
COURSE CONTENT:
Unit 1
System definition and concepts: Characteristics and types of system, Manual and
automated systems
Real-life Business sub-systems: Production, Marketing, Personal, Material, finance
Systems models types of models: Systems environment and boundaries, Real time and
distributed systems, Basic principles of successful systems
Unit 2
Systems analyst: Role and need of systems analyst, Qualifications and responsibilities,
Systems Analyst, agent of change.
Various phases of systems development life cycle: Analysis, Design, Development,
Implementation, Maintenance
Unit3
Systems Design and modeling:Process modeling, Logical and physical design, Design
representation, Systems flowcharts and structured charts, Data flow diagrams,
Common diagramming conventions and guidelines using DFD and ERD diagrams.
Data Modeling and systems analysis, designing the internals: Program and Process
design, Designing Distributed Systems
Unit 4
User Interfaces – Relational Analysis – Database design – program design– structure
chart – HIPO – SSADM – Alternate Life cycles – Prototypes.
Unit 5
System Implementation and Maintenance:Planning considerations, Conversion
methods, producers and controls, System acceptance Criteria, System evaluation and
performance, Testing and validation, Systems qualify Control and assurance,
Maintenance activities and issues.
SUGGESTED READINGS:
1) Haryszkiewycz, ``Introduction to Systems Analysis and Design,’’ Prentice Hall India
2) James A Senn , ``Analysis and Design of Information Systems,’’ McGraw Hill
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 188
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 189
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
1) A. B. Saxena, ``A Textbook of Energy, Environment, Ecology and Society,’’ New Age
Publication
Methods
COURSE OUTCOMES (CO):
1. Write program and solve algebraic & transcendental equations and system of
equations.
2. Analyze data through interpolation and able to write programs for Numerical
Integration.
3. Write programs to solve Ordinary Differential Equations and Partial Differential
Equations.
COURSE CONTENT:
Solution of Algebraic and Transcendental Equations: Bisection method, Regula
Falsi method, Secant methods, Newton’s method, Rate of convergence, Fixed-point
iteration method.
System of Linear Algebraic Equations: Gauss elimination method, Gauss-Jordan
method, Crout’s method, Jacobi’s method, Gauss-Seidel method, Relaxation method.
Interpolation: Finite difference operators, Interpolating polynomials using finite
difference (Newton forward, Newton backward, Stirling and Bessels). Lagrange
polynomials, divided difference
Numerical Differentiation and Integration: Derivatives from differences tables,
Higher order derivatives, Newton-Cotes integration formula, Trapezoidal rule,
Simpson’s rules and error estimation, Romberg’s Integration.
Numerical Solution of Ordinary Differential Equations: Taylor series method, Euler
and Modified Euler method, Runge-Kutta methods, Milne’s method.
Numerical Solution of Partial Differential Equations: Finite difference
approximations of partial derivatives, Solution of Laplace equation and Poisson’s
method (Standard 5-point formula only), One-dimensional heat equation (Schmidt
method, Crank-Nicolson method) and Wave equation.
Practical:
Based on the above methods using C / C++
SUGGESTED READINGS:
1 Curtis F. Gerald and Patrick G. Wheatley, ``Applied Numerical Analysis,’’
Pearson, Education Ltd.
2 E. Balagurusamy, ``Numerical Method,’’ Tata McGraw Hill
3 M. K. Jain, S. R. K. Iyenger and R. K. Jain, ``Numerical Methods for Scientific
and Engg. Computations,’’ Wiley Eastern Ltd.
4. S. S. Sastry, ``Introductory Methods of Numerical Analysis,’’ Prentice hall India
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 192
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 193
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 194
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Linear programming, Duality Theory, dual Simplex method, Revised Simplex method,
Sensitive analysis.
Integer Programming, Cutting plane algorithm.
Branch and bound technique, travelling salesman problem.
Nonlinear Programming, Kuhn-Tucker conditions, quadratic programming, Wolfe’s
algorithm.
Dynamite programming, Deterministic and stochastic examples. Advanced queuing
Models, Finite source queues, Balking and Reneging, Priority queue disciplines.
SUGGESTED READINGS:
1. Hamdy Taha, ``Operations Research, An Introduction,’’ Pearson Education
2. J R Fletcher, ``Practical Methods of Optimization,’’ Wiley Publishing
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 195
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 196
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 197
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
interference transistor.
7. Guided wave optics
(a) Waveguide modes, Modes characteristics for a planar waveguide, Step index planar
waveguide, Maxwell equations in inhomogeneous media: TE modes and TM modes,
Radiation modes, Guided modes, Leaky modes, Quasi modes.
(b) Propagation in optical fibre, Numerical aperture, Pulse dispersion in fibres, Scalar
wave equation and modes of the fibre, Modal analysis for a step index fibre.
8. Masers
Ammonia beam maser, Energy levels, Methods for population inversion, Maser
operation.
9. Coherent interactions of a radiation field and an atomic system
(a) Induced resonant transitions, Inclusions of decay phenomena, Rotating wave
approximation, Exact Rabi Solution in the strong field, Rabi flopping, Dressed state
picture.
(b) Density matrix, Rate equation for density matrix, Optical Bloch equations, Vector
model of density matrix, The Bloch sphere.
10. Semiclassical laser theory
Electromagnetic field equations, Expansion in normal modes of a cavity, Lambs self-
consistency equations, Density matrix equations, Polarization of the medium, Single
mode operation, Non-linear effect in polarization, Hole burning, Steady state power,
Frequency pulling and pushing.
SUGGESTED READINGS:
1. Mitin, Kochelap and Stroscio, `` Quantum Heterostructures: Microelectronics and
Optoelectronics,’’ Cambridge University Press
2. Martinez-Duart, Martin-Palma, Agullo-Rueda, ``Nanotechnology for Microelectronics
and Optoelectronics,’’ Elsevier Science
3. A. Yariv, ``Quantum Electronics,’’ John Wiley
4. A.K. Ghatak and K. Thyagarajan, ``Optical Electronics,’’ Cambridge University Press
5. O. Svelto, ``Principles of Lasers,’’ Springer
6. P. Bhattacharyya, ``Semiconductor Optoelectronics Devices,’’ Prentice Hall
7. R. W. Boyd, ``Nonlinear Optics,’’ Academic Press
8. B. G. Streetman and S. Banerjee, ``Solid State Electronic Devices,’’ Prentice Hall
India
9. T. Suhara, ``Semiconductor laser fundamentals,’’ CRC Press
10. S. M. Sze, ``Physics of Semiconductor Devices,’’ Wiley Publishing
11. J. Orton, ``The Story of Semiconductors,’’ Oxford University Press
12. Rogers, Pennathur, Adams, ``Nanotechnology: Understanding Small Systems,’’
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 198
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
CRC Press
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 199
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 200
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT:
Electrostatics; Boundary value problems Dielectrics, Steady currents, Magnetostatics;
Time varying fields, Maxwell’s equations, Lorentz force equation and motion of
charges, Plane electromagnetic waves. Waveguides and resonant cavities, fields at the
surface of and within a conductor, cylindrical cavities and waveguides, modes in a
rectangular waveguide, energy flow and attenuation in waveguides, perturbation of
boundary conditions, resonant cavities, power losses in a cavity, Earth and ionosphere
as resonant cavity, dielectric waveguide.
SUGGESTED READINGS:
1. Griffiths D. J., ``Introduction to Electrodynamics,’’ Prentice- Hall Pvt.Ltd.
2. J. D. Kraus, ``Electromagnetics,’’ Tata McGraw Hill.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 201
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 202
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 203
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 204
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 205
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 206
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 207
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 208
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
COURSE CONTENT:
1. Transmission line and waveguide
Interpretation of wave equations; Rectangular wave guide | TE and TM modes, power
transmission, excitation of modes; Circular waveguide | TE, TM and TEM modes,
power transmission, excitation of modes. Microstrip lines | characteristic impedance,
loss and Q of microstrip lines, coplanar strip lines and shielded strip lines.
2. Component
Scattering parameter and scattering matrix, properties of S-parameter; Quality factor
and Q-value of a cavity resonator, Q-value of a coupled cavity; Wave guide tees, magic
tee, hybrid ring, couplers; Ferrites and Faraday's rotation, gyrator, circulator, isolator
and terminator; λ/4 section filter, tuner and sliding short.
3. Measurement
Smith chart, single stub and double stub matching; Microwave bridge, measurement
of frequency, attenuation and phase; Measurement of dielectric parameters of
amorphous solids | dielectric constant, ac conductivity, resistivity, insertion loss,
return loss, shielding coefficient. Measurement of microstrip line parameters.
4. Source
Conventional sources & their limitations.
(a) Vacuum tube sources | Klystron, reex klystron, travelling wave tubes and
switching tubes;
Magnetrons, FWCFA and Gyrotrons.
(b) Microwave transistors and FETs, Gunn, IMPATT, TRAPATT and parametric devices.
(c) Laser | Laser processes, Pockels-Cell; Laser modulators, infrared radiation and
sources.
5. Antenna
Transmitting and receiving antennas, antenna gain, resistance and bandwidth;
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 209
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Antenna dipoles, straight, folded and broadband dipoles; Beam width and
polarisation; Antenna coupling.
6. Microwave integrated circuit
Materials and fabrication technique; MOSFET fabrication, memory construction, thin
film formation, planar resistor, planar inductor and planar capacitor formation;
Hybrid integrated circuit formation.
SUGGESTED READINGS:
1. Samyel Y. Liao, ``Microwave Devices and Circuits’’ Prentice hall publication,
2. Herbert J. Reich, ``Microwave Principles,’’ Van Nostrand
3. K. C. Gupta, ``Microwaves,’’ New Age publisher.
4. M. L. Sisodia and G. S. Raghubanshi, ``Microwave Circuits and Passive Device’’ New
Age publisher.
5. N. Mercuvitz, ``Waveguide Handbook’’ IET
6. S. M. Sze, ``Physics of Semiconductor Devices’’ John Wiley publisher.
7. R. E. Collins, ``Foundations of Microwave Engineering’’ Wiley publication.
8. J. D. Ryder, ``Network Lines and Fields’’ Prentice Hall publication.
9. Royal Signals, ``Handbook of Line Communication’’ The War Office
10. W. Frazer, ``Telecommunications’’ Macdonald
11. J. D. Kraus, ``Antenna’’ Tata Mc Graw Hill publication.
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 210
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 211
SCHEME AND SYLLABUS - B.E. COMPUTER ENGINEERING
Passed in the meeting of Academic Council, University of Delhi, held on July 19, 2016 Page 212