B.Tech(Information Technology) Syllabus

Microsoft Word - B.Tech _it_ SYLLABUS - 2010.docB.Tech(Information Technology)
CHOICE BASED CREDIT SYSTEM FOR B.Tech(IT) FULL-TIME PROG RAMME
CREDITS
Each course is normally assigned one credit per lecture per week and one credit
for two periods of tutorials or part thereof for laboratory or practical per week.
Each semester curriculum shall normally have a blend of theory and practical
courses. In the first year the total number of credits will be 40. For Semester III to VIII
the average credits per semester will be 28. For the award of the degree a student has to
earn a minimum of 208 credits.
DURATION OF THE PROGRAMME
A student is normally expected to complete B.Tech(IT) programme in four years
but in any case not more then seven years from the time of admission.
REGISTRATION FOR COURSES
A newly admitted student will automatically be registered for all the courses
prescribed for the first year , without any option.
Every other student shall submit a completed registration form indicating the list
of courses intended to be credited during the next semester. This registration will be done
a week before the last working day of the current semester. Late registration with the
approval of the dean on the recommendation of the head of the department along with a
late fee will be done, up to the last working day.
Registration for the project work shall be done only for the final semester.
ASSESSMENT
The break-up of assessment and examination marks for theory subjects is as
follows.
Examination : 50 Marks
The break-up of the assessment and examination marks for practical is as follows.
Internal Assessment : 50 Marks
Examination : 50 Marks
The project work will be assessed for 50 marks by a committee consisting of the
guide and a minimum of two members nominated by the head of the department. The
head of the department may himself be a member or the chairman. 50 marks are allotted
for the project work and viva voce examination at the end of the semester.
WITHDRAWAL FROM A COURSE
A student can withdraw from a course at any time before a date fixed by the head
of the department prior to the second assessment, with the approval of the dean of the
faculty on the recommendation of the head of the department.
TEMPORARY BREAK OF STUDY
A student can take a one-time temporary break of study covering the current
year/semester and/or the next semester with the approval of the dean on the
recommendation of the head of the department, not later than seven days after the
completion of the mid-semester test. However, the student must complete the entire
programme within the maximum period of seven years.
MOVEMENT TO HIGHER SEMESTERS
The following minimum credits must be earned by the student to move to a higher
semester
SUBSTITUTE ASSESMENT
A student who has missed, for genuine reasons accepted by the head of the
department, one or more of the assessments of a course other than the examination, may
take a substitute assessment for any one of the missed assessments. The substitute
assessment must be completed before the date of the fourth meeting of the respective
class committees.
A student who wishes to have a substitute assessment for a missed assessment
must apply to the head of the department within a week from the date of the missed
assessment.
ATTENDENCE REQUIREMENTS
To be eligible to appear for the examination in a particular course, a student must
put in a minimum of 80% of attendance in the course. However, if the attendance is 70%
or above but less than 80% in any course, the authorities can permit the student to appear
for the examination in the course on payment of the prescribed condonation fee.
A student who withdraws from or does not meet the minimum attendance
requirement in course must re-register for and repeat the course.
PASSING AND DECLARATION OF EXAMINATION RESULTS
All assessments of all the courses on the absolute mark basis will be considered
and passed by the result passing board in accordance with the rules of the university.
Thereafter, the controller of examinations shall convert the marks for each courses to the
corresponding letter grade as follows, compute the grade point average and cumulative
grade point average , and prepare the grade cards.
90 to 100 marks - Grade ‘S’
80 to 89 marks - Grade ‘A’
70 to 79 marks - Grade ‘B’
60 to 69 marks - Grade ‘C’
55 to 59 marks - Grade ‘D’
50 to 54 marks - Grade ‘E’
less than 50 marks - Grade ‘F’
Insufficient attendance - Grade ‘I’
Withdrawn from the course - Grade ‘W’
A student who obtains less than 50 marks out of 100 in the subject or less than 20
out of 50 in external exam or is absent for the examination will be awarded Grade ‘F’.
A student who earns a grade of S,A,B,C,D or E for a course is declared to have
successfully completed that course and earned the credits for that course. Such a course
cannot be repeated by the student.
A student who obtains letter grade F in a course has to reappear for the
examination in that course.
A student who obtains letter grade I or W in a course has to re-register for and
repeat the course.
The following grade points are associated with each letter grade for calculating
the grade point average.
S – 10; A-9; B-8; C-7; D-6; E-5; F-0
Course with grades I and W are not considered for calculation of grade point
average or cumulative grade point average. F Grade will be considered for computing
GPA and CGPA.
A student can apply for retotalling of one or more of his examination answer
papers within a week from the date of issue of grade sheet to the student on payment of
the prescribed fee per paper. The application must be made to the controller of
examinations with the recommendation of the head of the department.
After results are declared, grade cards will be issued to the students. The grade
card will contain the list of courses registered during the year/semester , the grades scored
and the grade point average(GPA) for the year/semester.
GPA is sum of the products of the number of credits of a course with the grade
point scored in that course, taken over all the courses for the Year/Semester , divided by
the sum of the number of credits for all courses taken in that year/semester. CGPA is
similarly calculated considering all the courses taken from the time of admission.
After successful completion of the programme, the degree will be awarded with
the following classification based on CGPA.
For First Class with Distinction the student must earn a minimum of 208 credits
within four years from the time of admission, pass all the courses in the first attempt and
obtain a CGPA of 8.25 or above.
(Or)
For First Class the student must earn a minimum of 208 credits within five years
from the time of admission and obtain a CGPA of 6.5 or above.
(Or)
For Second Class the student must earn a minimum of 208 credits within seven
years from the time of admission.
ELECTIVES
Apart from the various elective courses offered in the curriculum of the branch of
specialisation, a student can choose a maximum of two electives from any specialisation
under the faculty during the entire period of study, with the approval of the head of the
department and the head of the department offering the course.
COURSE CONTENT &
SCHEME OF
Subject Code Subject (I&II SEMESTER)
Ins./Week in Hours C (Units) L T P/D
EBU12KT041 English 3 - 0 3
EBU12FT092 Mathematics I & II 3 1 0 4
EBU12GT093 Applied Physics 3 1 0 4
EBU12HT094 Applied Chemistry 3 1 0 4
EBU12DT055 Basic Civil & Mechanical Engg 3 - 0 3
EBU12BT056 Basic Electrical and Electronics Engg 3 - 0 3
EBU12AT057 Basic Computer Science and Engg 2 - 0 2
EBU12DT028 Engineering Drawing 2 - 3 3
EBU12HT089 Environmental Science and Engg 3 0 2 3
EBU23JT0210 Sanskrit & Indian Culture I & II 1 0 2 1
EBU12GP041 Physics Lab 2 2
EBU12HP072 Chemistry Lab 2 2
EBU12AP023 Computer Lab 2 2
EBU12DP054 Workshop Practical 2 2
EBU12CP025 Electrical Workshop 2 2
TOTAL 40
E –External C- Credits D-Drawing
SCSVMV (University)
III Semester Subject Code Subject Ins./Week in Hours C
(Units) L T P
EBI3BT102 Signals & Systems 3 2 0 4
EBI3BT103 Digital Principles & system Design 3 2 0 4
EBI3BT104 Principles of Communication 3 0 0 3 EBI3ET105 Computer System architecture 3 2 0 4
EBI3ET106 Object Oriented Programming 3 2 0 4
EBU3JT057 Sanskrit & Indian Culture 2 0 0 1
EBI3EP101 OOPS Lab Using Linux Plat form 0 0 4 2
EBI3EP102 Digital Lab 0 0 4 2
28
C (Units)
EBU4FT101 Applied Statistics And Probability 3 2 0 4
EBI4ET102 Computer Graphics and Multimedia 3 2 0 4
EBI4ET103 Data Structures and Algorithms 3 2 0 4 EBI4ET104 Digital Signal Processing 3 0 0 3 EBI4ET105 Microprocessors & Micro controllers 3 2 0 4 EBI4ET106 System Software 3 0 2 4 EBU4JT057 Sanskrit & Indian Culture 2 0 0 1 EBI4EP101 Data Structures Lab 0 0 4 2
EBI4BP102 Microprocessor/ Micro controller & Assembly Language Programming Lab 0 0 4 2
28
L – Lecture T – Tutorial P – Practical I - Internal E –External C- Credits
SCSVMV (University)
V Semester
C (Units)
EBU5BT102 Information Coding Techniques 3 0 0 3
EBU5ET103 Computer Networks 3 2 0 4
EBU5ET104 Relational Database Management System 3 2 0 4
EBU5ET105 Introduction to Java Programming 4 0 0 4
EBU5ET106 Operating System 3 2 0 4
C059JT027 Sanskrit & Indian Culture 2 0 0 1
EBI5EP101 RDBMS Lab 0 0 4 2
EBI5EP102 Java Programming Lab 0 0 4 2
28
hours C
(Units) L T P
EBI6ET101 Data Warehousing and Data Mining 3 2 0 4 EBI6BT102 Mobile computing 3 0 0 3
EBI6ET103 Distributed Computing 3 2 0 4 EBI6ET104 Object Oriented System Design 3 2 0 4 EBI6ET105 Cryptography and Network Security 3 2 0 4 EBI6BT106 Embedded System 3 0 0 3 EBU6JT057 Sanskrit and Indian Culture 2 0 0 1
EBI6EP101 Network Lab Using Linux Plat Form 0 0 4 2 EBI6EP102 Web Technology Lab 0 0 6 3 28
L – Lecture T – Tutorial P – Practical I - Internal
E –External C- Credits
VII Semester
(Units) L T P
EBJ7ET101 Software Engineering 3 2 0 4 EBI7ET102 Professional Ethics and Human Value 3 2 0 4 EBI7ET103 Component Based Technology 3 2 0 4 EBI7ET104 Dot Net Technologies 3 2 0 4 EBI7EE105(A-L) Elective- I 3 2 0 4 EBI7EE106(A-L) Elective- II 3 2 0 4 EBI7EP101 Dot net Lab 0 0 4 2 EBI7EP102 CASE Tools Lab 0 0 4 2 28
VIII Semester
3 2 0 4
EBI8EE102(M-X) Elective – III 3 2 0 4 EBI8EE103(M-X) Elective – IV 3 2 0 4 Project Work 0 0 32 16 28 L – Lecture T – Tutorial P – Practical I - Internal
E –External C- Credits
Total Credit : 208
SYLLABUS FOR SANSKRIT & INDIAN CULTURE Year Semester Sub.code Paper Subject Period Credits
II
Third
2
And
3
And
1
P.W
4
And
Examination Pattern for Sanskrit & Indian Culture p aper
(Students who have admitted during academic year 20 02 onwards & common for all branches)
There will not be any external examination for Sanskrit and Indian Culture paper to B.E.
courses but performance of students will be assessed through tests and assignments conducted by
the same department. The internal assessment pattern is follows.
Indian Culture Sanskrit
Assignment 10 Marks 10 Marks
Total 50 Marks 50 Marks
Total marks for Sanskrit and Indian Culture - 100 Marks
Passing Minimum marks - Aggregate 50%
A candidate shall be declared to have passed the examination he/she should have secure a minimum
marks of 50% in each part (Sanskrit & Indian Culture) with the aggregate of 50%
III SEMESTER
z 1+ , sin z.
UNIT II(COMPLEX INTEGRATION)
Integration of complex functions – Cauchy’s theorem – Cauchy’s integral formula –Series of complex terms – Taylor’s series – Laurent’s series – Zeros and Singularities of an analytic function – Residues – Residue theorem – Calculation of residues – Evaluation of real definite integrals.
UNIT III(LAPLACE TRANSFORMS)
Introduction - Definition - Existence conditions - Transforms of elementary functions - Properties of Laplace transforms - - Transforms of derivatives - Transforms of integrals - Multiplication by tn - Division by t - Evaluation of integrals by Laplace transform - Inverse transforms – Other methods of finding inverse - Convolution theorem (Without proof) - Application to differential equations.
UNIT – IV
(FOURIER TRANSFORMS) Introduction – definition – Fourier integrals - Fourier Sine and Cosine integral – complex forms of Fourier integral - Fourier transform – Fourier sine and Cosine transforms – properties of Fourier Transforms - Convolution theorem for Fourier Transforms - Parseval’s identity for Fourier transforms. (without proof).
UNIT V (Z - TRANSFORM)
Introduction - Definition – standard Z –transforms – Linearity property – Damping rule –standard results – Shifting rules – Initial and final value theorems – inverse Z –transforms – Convolution theorem – Evaluation of inverse transforms – Application to difference equations.
Remark: Each Unit has to be covered in 12 hours (each of 50 minutes duration). Questions may be set to test the problem solving ability of the students in the above topics. PRESCRIBED TEXT BOOK:
B.S.Grewal, Higher Engineering Mathematics, 40th Edition, Khanna Publishers, New Delhi, 2007.
REFERENCES BOOKS
1. Erwin Kreyszig, Advanced Engineering Mathematics, Eighth Edition, John Wiley & Sons,
1999. 2. Veerarajan, T., Engineering Mathematics, Tata McGraw Hill, New Delhi, 2008.
3. Ronald N. Bracewell, The Fourier transform and its applications, McGraw Hill Company,
1986.
4. John H. Mathews, Russel W. Howell, Complex Analysis for Mathematics and Engineering, Third Edition, Narosa Publishing House, 1998.
5. Murry R. Spiegel, Complex Variables, (Schaum’s Outline Series), McGraw Hill 1981.
EBI3BT102 - SIGNALS AND SYSTEMS
3 2 0 4
UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS
Continuous time signals (CT signals), discrete time signals (DT signals) - step, Ramp, Pulse, Impulse, Exponential, Classification of CT and DT signals - periodic and aperiodic, Random signals, CT systems and DT systems, Classification of systems – Linear Time Invariant Systems.
UNIT II ANALYSIS OF CT SIGNALS
Fourier series analysis, Spectrum of CT signals, Fourier Transform and Laplace Transform in Signal Analysis, Hilbert Transform.
UNIT III LTI-CT SYSTEMS
UNIT IV ANALYSIS OF DT SIGNALS
Spectrum of DT Signals, Discrete Time Fourier Transform (DTFT), Discrete Fourier Transform (DFT), Properties of Z-transform in signal analysis.
UNIT V LTI-DT SYSTEMS
Difference equations, Block diagram representation, Impulse response, Convolution SUM, Frequency response, FFT and Z-transform analysis, State variable equation and Matrix. TEXT BOOKS: Alan V. Oppenheim, Alan S. Willsky with S.Hamid Nawab, “Signals & Systems”, Pearson / Prentice Hall of India Pvt. Ltd., 2003. REFERENCES 1. K.Lindner, “Signals and Systems”, McGraw-Hill International, 1999. 2. Simon Haykin and Barry Van Veen, “Signals and Systems”, John Wiley & Sons, Inc., 1999. 3. Robert A.Gabel and Richard A.Roberts, Signals and Linear Systems John wiley and
sons 3ed, 1987. 4. Roger E.Ziemer et al, Signals and systems continuous and Discrete, Mc Millan 2ed,
1990.
3 2 0 4
Review of binary number systems - Binary arithmetic – Binary codes – Boolean algebra and theorems - Boolean functions – Simplifications of Boolean functions using Karnaugh map and tabulation methods – Logic gates
UNIT II COMBINATIONAL LOGIC
UNIT III DESIGN WITH MSI DEVICES
Decoders and encoders - Multiplexers and demultiplexers - Memory and programmable logic - HDL for combinational circuits
UNIT IV SYNCHRONOUS SEQUENTIAL LOGIC
Sequential circuits – Flip flops – Analysis and design procedures - State reduction and state assignment - Shift registers – Counters - HDL for sequential logic circuits, Shift registers and counters.
UNIT V ASYNCHRONOUS SEQUENTIAL LOGIC
Analysis and design of asynchronous sequential circuits - Reduction of state and flow tables – Race- free state assignment – Hazards.
TEXT BOOKS 1. M.Morris Mano, “Digital Design”, 3rd edition, Pearson Education, 2002. REFERENCES
1. Charles H.Roth, Jr. “Fundamentals of Logic Design”, 4th Edition, Jaico Publishing House, 2000.
2. Donald D.Givone, “Digital Principles and Design”, Tata McGraw-Hill, 2003.
EBI3BT104 - PRINCIPLES OF COMMUNICATION 3 0 0 3
UNIT I
AMPLITUDE MODULATION: TRANSMISSION AND RECEPTION Principles of amplitude modulation – AM envelope, frequency spectrum and bandwidth, modulation index and percent modulation, AM power distribution, AM modulator circuits – low level AM modulator, medium power AM modulator, AM transmitters – low level transmitters, high level transmitters, Receiver parameters. AM reception: AM receivers – TRF, Superheterodyne receivers, Double Conversion AM receivers.
UNIT II ANGLE MODULATION: TRANSMISSION AND RECEPTION
Angle Modulation – FM and PM waveforms, phase deviation and modulation index, frequency deviation, phase and frequency modulators and demodulators, frequency spectrum of a angle modulated waves, Bandwidth requirement, Broadcast band FM, Average power FM and PM modulators – Direct FM and PM, Direct FM transmitters, Indirect transmitters, Angle modulation Vs. amplitude modulation. FM receivers: FM demodulators, PLL FM demodulators, FM noise suppression, Frequency Vs. phase Modulation.
UNIT III DIGITAL MODULATION TECHNIQUES
Introduction - ASK, Binary PSK, DPSK, Differentially encoded PSK, QPSK, Binary FSK. Introduction about PCM- Transmitter and Receiver, DM,ADM,DPCM
UNIT IV BASEBAND DATA TRANSMISSION
Sampling theorem, Quadrature sampling of bandpass signals, reconstruction of message from its samples, Signal distortion in sampling, Discrete PAM signals, power spectra of Discrete PAM signals, ISI Nyquist Criterion for Distortionless baseband binary transmission, eye pattern, baseband M-ary PAM systems, adaptive equalization for data transmission.
UNIT V
SPREAD SPECTRUM AND MULTIPLE ACCESS TECHNIQUES Introduction, Pseudo-noise sequence, DS spread spectrum with coherent binary PSK, Processing gain, FH spread spectrum, multiple access techniques, wireless communications, TDMA and CDMA, wireless communication systems, source coding of speech for wireless communications. TEXT BOOKS
1. Wayne Tomasi, “Electronic Communication Systems: Fundamentals Through Advanced”, Pearson Education, 2001. (UNIT I Chapters- 3,4; UNIT II : Chapters-6,7; UNIT III Chapters-12).
2. Simon Haykin, Digital Communications, John Wiley & Sons, 2003. (UNIT IV Chapters-3,4;
UNIT V Chapters-7,8) REFERENCESS 1 Simon Haykin, Communication Systems, John Wiley & Sons, 4th edn.,2001. 2. Taub & Schilling, Principles of Communication Systems, TMH, 2nd edn., 2003. 3. Martin S.Roden, Analog and Digital Communication System, PHI, 3rd edn. 2002. 4. Blake, Electronic Communication Systems, Thomson Delman, 2nd edn., 2002.
EBI3ET106 - OBJECT ORIENTED PROGRAMMING USING C++
3 2 0 4
UNIT – I Need for object oriented programming, Characteristics of object oriented language -objects, classes, Inheritance, Reusability, creating new data types, Polymorphism and overloading.C++ programming basics – Data types, Manipulators, Cin, Cout, Type conversion, arithmetic operators, Loops and decisions.
UNIT – II Class and objects : A simple class, C++ Objects as physical Objects, C++ Objects as Data Types, Constructors, destructors, objects as function arguments,overloaded constructors, member functions defined outside the class, inline functions, Returning objects from Functions.
UNIT – III Arrays : Defining & accessing Array elements, arrays as class member data, array of Objects. Operator Overloading : Overloading Unary Operators, Operator Arguments, Return Values, nameless Temporary objects, postfix notations. Overloading Binary Operators - Arithmetic operators, Concatenating Strings, Multiple overloading Comparison operators, Arithmetic Assignment Operators.
UNIT – IV Inheritance-Derived class and base class, derived class constructors, overriding member functions, Class Hierarchies, Abstract base class, Public and private inheritance, Levels of inheritance, Multiple inheritance. Memory management – new and delete operator, a string class using new, Pointers to Objects – Referring to Members, another Approach to new, An array of pointers to Objects.
UNIT –V Virtual Functions – Pure virtual functions, Late Binding, Abstract Classes, Virtual base classes. Friend Functions…