Download Cse final upto 4h year syllabus 14 and more Lecture notes Advanced Computer Architecture in PDF only on Docsity!
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
CSE
Second Year - Third Semester A. THEORY Sl.No. Field Theory Contact Hours/Week Cr. Points
L T P Total
1 HU301 Values & Ethics in Profession 3 0 0 3 3
2 PH301 Physics-2 3 1 0 4 4
CH301 Basic Environmental Engineering & Elementary Biology; (^3 0 0 3 )
CS301 Analog & Digital Electronics 3 0 0 3 3
CS
CS
Data Structure & Algorithm Computer Organisation
Total of Theory (^21 ) B. PRACTICAL 7 PH391 Physics-2 0 0 3 3 2
8 CS391 Analog & Digital Electronics 0 0 3 3 2
CS
CS
Data Structure & Algorithm Computer Organisation
Total of Practical (^12 ) Total of Semester (^33 )
Second Year - Fourth Semester A. THEORY Sl.No. Field Theory Contact Hours/Week Cr. Points L T P Total 1 M(CS)401 Numerical Methods 2 1 0 3 2 (^2) M401 Mathematics-3 3 1 0 4 4 3 CS401 Communication Engg & Coding Theory
2 1
0 0 3 3
4 5
CS
CS
Formal Language & Automata Theory
Computer Architecture
3
3
1
1
0
0
4
4
4
4 Total of Theory (^18 ) B. PRACTICAL 6 7
HU
M(CS)
Technical Report Writing & Language Lab Practice
0 0
0 0
3 2
3 2
2 1
8
CS491. Communication Engg & Coding Theory
0 0 3 3 2
9 10
CS CS
Software Tools Computer Architectur
0 0
0 0
3 3
3 3
2 2
Total of Practical (^14 ) Total of Semester (^32 )
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Third Year - Fifth Semester A. THEORY Sl. No
Field Theory Contact Hours/Week Cr. Pts L T P Total 1 HU501 Economics for Engineers 3 0 0 3 3
2 3 4
CS CS CS
Design & Analysis of Algorithm Microprocessors & Microcontrollers Discrete Mathematics
3 3 3
1 1 0
0 0 0
4 4 3
4 4 3
5
Free Elective CS504A CS504B CS504C CS504D
Circuit Theory & Network (ECE) Data Communication (ECE) Digital Signal Processing (ECE Object Oriented Programming (IT)
3 0/1 0 3/4 3/
Total of Theory (^) 17/18 17- B. PRACTICAL 6 7
CS CS
Design & Analysis of Algorithm Microprocessors & Microcontrollers
0 0
0 0
3 3
3 3
2 2 8 9
CS F.E. CS594A CS594B CS594C CS594D
Programming Practices using C++
Circuit Theory & Network (ECE) Data Communication (ECE) Digital Signal Processing (ECE) Object Oriented Programming (IT)
1 0
0 0
2 3
3 3
2 2
Total of Practical (^12 ) Total of Semester (^) 29/30 25- Third Year - Sixth Semester A. THEORY Sl. N o.
Field Theory Contact Hours/Week Cr. Pts L T P Total (^1) HU601 Principles of Management 2 0 0 2 2 2 3 4
CS CS CS
Data Base Management System Computer Networks Operating System
3 3 3
0 0 0
0 0 0
3 3 3
3 3 3 5 P.E CS604A CS604B CS604C
Information Theory & Coding Computer Graphics ERP
3 0 0 3 3
6
F. E. CS605A CS605B CS605C
Operation Research (M) Human Resource Management (HSS) Multimedia Technology (IT)
3/3 0/1 0/0 3/
3/ Total of Theory (^) 17/18 17- B. PRACTICAL 7
CS CS CS
- Data Base Management System Lab
- Network Lab 10.Operating System Lab
0 0 0
0 0 0
3 3 3
3 3 3
2 2 2
10 CS681 Seminar^0 0 3 3 Total of Practical (^12 ) Total of Semester (^) 29-30 25-
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Fourth Year - Eighth Semester
A. THEORY
Sl.
No
Field Theory Contact Hours/Week Cr. Pts
L T P Total
1 HU801A
HU801B
A. Organisational Behaviour
B. Project Management
2 CS801 A. Advanced Computer Architecture
B. Parallel Computing
C. Natural Language Processing
D. Cryptography & Network Security
E. Business Analytics
CS802 A. Technology Management (HSS)
B. Cyber Law & Security Policy (HSS)
C. Optical Networking (ECE)
D. Low Power Circuits & Systems (ECE)
E. E-Commerce(IT)
F. Robotics(EE & ME) 3 0 0 3 3
Total of Theory 8 8
B. PRACTICAL
4 CS891 Design Lab / Industrial problem related
practical training (Workshop needed) 0 0 6 6 4
5 CS892 Project-2 0 0 12 12 6
6 CS893 Grand Viva 3
Total of Practical 18 13
Total of Semester 26 21
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
SEMESTER - III
Theory
VALUES & ETHICS IN PROFESSION
HU-
Contracts:3L Credits- 3
Science, Technology and Engineering as knowledge and as Social and Professional Activities
Effects of Technological Growth:
Rapid Technological growth and depletion of resources, Reports of the Club of Rome. Limits of growth: sustainable development Energy Crisis: Renewable Energy Resources Environmental degradation and pollution. Eco-friendly Technologies. Environmental Regulations, Environmental Ethics Appropriate Technology Movement of Schumacher; later developments Technology and developing notions. Problems of Technology transfer, Technology assessment impact analysis. Human Operator in Engineering projects and industries. Problems of man, machine, interaction, Impact of assembly line and automation. Human centered Technology.
Ethics of Profession:
Engineering profession: Ethical issues in Engineering practice, Conflicts between business demands and professional ideals. Social and ethical responsibilities of Technologists. Codes of professional ethics. Whistle blowing and beyond, Case studies.
Profession and Human Values:
Values Crisis in contemporary society Nature of values: Value Spectrum of a good life Psychological values: Integrated personality; mental health Societal values: The modern search for a good society, justice, democracy, secularism, rule of law, values in Indian Constitution. Aesthetic values: Perception and enjoyment of beauty, simplicity, clarity Moral and ethical values: Nature of moral judgements; canons of ethics; ethics of virtue; ethics of duty; ethics of responsibility. Books:
- Stephen H Unger, Controlling Technology: Ethics and the Responsible Engineers, John Wiley & Sons, New York 1994 (2nd^ Ed)
- Deborah Johnson, Ethical Issues in Engineering, Prentice Hall, Englewood Cliffs, New Jersey 1991.
- A N Tripathi, Human values in the Engineering Profession, Monograph published by IIM, Calcutta 1996.
Code: PH- Contacts: 4L Credit: 3+
Module 1:
Vector Calculus:
1.1 Physical significances of grad, div, curl. Line integral, surface integral, volume integral- physical examples in the
context of electricity and magnetism and statements of Stokes theorem and Gauss theorem [No Proof]. Expression of
grad, div, curl and Laplacian in Spherical and Cylindrical co-ordinates. 2L
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Module 6:
Statistical Mechanics:
3.1 Concept of energy levels and energy states. Microstates, macrostates and thermodynamic probability, equilibrium
macrostate. MB, FD, BE statistics (No deduction necessary), fermions, bosons (definitions in terms of spin, examples),
physical significance and application, classical limits of quantum statistics Fermi distribution at zero & non-zero
temperature, Calculation of Fermi level in metals, also total energy at absolute zero of temperature and total number of
particles, Bose-Einstein statistics – Planck’s law of blackbody radiation..
7L
Basic Environmental Engineering & Elementary Biology Code: CH Contacts: 3L = 3 Credits: 3
General
Basic ideas of environment, basic concepts, man, society & environment, their interrelationship.
1L
Mathematics of population growth and associated problems, Importance of population study in environmental
engineering, definition of resource, types of resource, renewable, non-renewable, potentially renewable, effect of
excessive use vis-à-vis population growth, Sustainable Development.
2L
Materials balance: Steady state conservation system, steady state system with non conservative pollutants, step function.
1L
Environmental degradation: Natural environmental Hazards like Flood, earthquake, Landslide-causes, effects and
control/management; Anthropogenic degradation like Acid rain-cause, effects and control. Nature and scope of
Environmental Science and Engineering.
2L
Ecology
Elements of ecology: System, open system, closed system, definition of ecology, species, population, community,
definition of ecosystem- components types and function. 1L
Structure and function of the following ecosystem: Forest ecosystem, Grassland ecosystem, Desert ecosystem, Aquatic
ecosystems, Mangrove ecosystem (special reference to Sundar ban); Food chain [definition and one example of each
food chain], Food web. 2L
Biogeochemical Cycle- definition, significance, flow chart of different cycles with only elementary reaction [Oxygen,
carbon, Nitrogen, Phosphate, Sulphur]. 1L
Biodiversity- types, importance, Endemic species, Biodiversity Hot-spot, Threats to biodiversity, Conservation of
biodiversity. 2L
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Air pollution and control
Atmospheric Composition: Troposphere, Stratosphere, Mesosphere, Thermosphere, Tropopause and Mesopause.
1L
Energy balance: Conductive and Convective heat transfer, radiation heat transfer, simple global temperature model
[Earth as a black body, earth as albedo], Problems. 1L
Green house effects: Definition, impact of greenhouse gases on the global climate and consequently on sea water level,
agriculture and marine food.Global warming and its consequence, Control of Global warming. Earth’s heat budget.
1L
Lapse rate: Ambient lapse rate Adiabatic lapse rate, atmospheric stability, temperature inversion (radiation inversion).
2L
Atmospheric dispersion: Maximum mixing depth, ventilation coefficient, effective stack height, smokestack plumes and
Gaussian plume model. 2L
Definition of pollutants and contaminants, Primary and secondary pollutants: emission standard, criteria pollutant.
Sources and effect of different air pollutants- Suspended particulate matter, oxides of carbon, oxides of nitrogen, oxides
of sulphur, particulate, PAN. 2L
Smog, Photochemical smog and London smog.
Depletion Ozone layer: CFC, destruction of ozone layer by CFC, impact of other green house gases, effect of ozone
modification. 1L
Standards and control measures: Industrial, commercial and residential air quality standard, control measure (ESP.
cyclone separator, bag house, catalytic converter, scrubber (ventury), Statement with brief reference).
1L
Water Pollution and Control
Hydrosphere, Hydrological cycle and Natural water.
Pollutants of water, their origin and effects: Oxygen demanding wastes, pathogens, nutrients, Salts, thermal application,
heavy metals, pesticides, volatile organic compounds. 2L
River/Lake/ground water pollution: River: DO, 5 day BOD test, Seeded BOD test, BOD reaction rate constants, Effect
of oxygen demanding wastes on river[deoxygenation, reaeration], COD, Oil, Greases, pH.
2L
Lake: Eutrophication [Definition, source and effect]. 1L
Ground water: Aquifers, hydraulic gradient, ground water flow (Definition only) 1L
Standard and control: Waste water standard [BOD, COD, Oil, Grease],
Water Treatment system [coagulation and flocculation, sedimentation and filtration, disinfection, hardness and
alkalinity, softening]
Waste water treatment system, primary and secondary treatments [Trickling filters, rotating biological contractor,
Activated sludge, sludge treatment, oxidation ponds] tertiary treatment definition.
2L
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Pre-requisite of Digital Electronics: Binary numbers & Basic Boolean algebra – already covered in First year; Logic gates, Truth Tables and function realization – already covered in First year upto minimisation of Logic expressions by algebraic method, K-map,
Module – 2: [11 L] a) Binary Number System & Boolean Algebra (recapitulation ) [1L]; BCD, ASCII, EBDIC, Gray codes and their conversions [1L]; Signed binary number representation with 1’s and 2’s complement methods [1L], Binary arithmetic, Venn diagram, Boolean algebra (recapitulation) [1L]; Representation in SOP and POS forms [1L]; Minimization of logic expressions by algebraic method. [2L] (7L) b) Combinational circuits - Adder and Subtractor circuits (half & full adder & subtractor) [2L]; Encoder, Decoder, Comparator, Multiplexer, De-Multiplexer and Parity Generator [2L]. (4L)
Module - 3: [10L]
- Sequential Circuits - Basic Flip-flop & Latch [1L], Flip-flops -SR, JK, D, T and JK Master-slave Flip Flops [3L], (4L)
- Registers (SISO,SIPO,PIPO,PISO) [2L], Ring counter, Johnson counter [1L], Basic concept of Synchronous and Asynchronous counters (detail design of circuits excluded), [2L], Design of Mod N Counter [2L] (6L)
Module – 4: [6L]
- A/D and D/A conversion techniques – Basic concepts (D/A :R-2-R only [2L] A/D: successive approximation [2L]) (4L)
- Logic families- TTL, ECL, MOS and CMOS - basic concepts. (2L)
[ Learning Outcome : The student must be able to convert from one number system to another, work out problems related to Boolean algebra, minimisation problems etc. The student must also learn to differentiate between the combinational and sequential circuits and design simple circuits) Total: 36 hours
Textbooks: Microelectronics Engineering - Sedra & Smith-Oxford. Principles of Electronic Devices & circuits—B L Thereja & Sedha—S Chand Digital Electronics – Kharate – Oxford Digital Electronics – Logic & Systems by J.Bigmell & R.Donovan; Cambridge Learning. Digital Logic and State Machine Design (3rd Edition) – D.J.Comer, OUP Reference: Electronic Devices & Circuit Theory – Boyelstad & Nashelsky - PHI Bell-Linear IC & OP AMP—Oxford P.Raja- Digital Electronics- Scitech Publications Morries Mano- Digital Logic Design- PHI R.P.Jain—Modern Digital Electronics, 2/e , Mc Graw Hill H.Taub & D.Shilling, Digital Integrated Electronics- Mc Graw Hill. D.Ray Chaudhuri- Digital Circuits-Vol-I & II, 2/e- Platinum Publishers Tocci, Widmer, Moss- Digital Systems,9/e- Pearson J.Bignell & R.Donovan-Digital Electronics-5/e- Cenage Learning. Leach & Malvino—Digital Principles & Application, 5/e, Mc Graw Hill Floyed & Jain- Digital Fundamentals-Pearson.
Data Structure & Algorithm Code: CS Contacts: 3L +1T Credits: 4 Pre-requisites: CS 201 (Basic Computation and Principles of C), M101 & M201 (Mathematics), basics of set theory Module -I. [8L] Linear Data Structure Introduction (2L) : Why we need data structure?
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Concepts of data structures: a) Data and data structure b) Abstract Data Type and Data Type. Algorithms and programs, basic idea of pseudo-code. Algorithm efficiency and analysis, time and space analysis of algorithms – order notations. Array (2L): Different representations – row major, column major. Sparse matrix - its implementation and usage. Array representation of polynomials. Linked List (4L) : Singly linked list, circular linked list, doubly linked list, linked list representation of polynomial and applications.
Module -II: [7L] Linear Data Structure [Stack and Queue (5L) : Stack and its implementations (using array, using linked list), applications. Queue, circular queue, dequeue. Implementation of queue- both linear and circular (using array, using linked list), applications. Recursion (2L) : Principles of recursion – use of stack, differences between recursion and iteration, tail recursion. Applications - The Tower of Hanoi, Eight Queens Puzzle.
Module -III. [15L] Nonlinear Data structures Trees (9L): Basic terminologies, forest, tree representation (using array, using linked list). Binary trees - binary tree traversal (pre-, in-, post- order), threaded binary tree (left, right, full) - non-recursive traversal algorithms using threaded binary tree, expression tree. Binary search tree- operations (creation, insertion, deletion, searching). Height balanced binary tree – AVL tree (insertion, deletion with examples only). B- Trees – operations (insertion, deletion with examples only). Graphs (6L) : Graph definitions and concepts (directed/undirected graph, weighted/un-weighted edges, sub-graph, degree, cut- vertex/articulation point, pendant node, clique, complete graph, connected components – strongly connected component, weakly connected component, path, shortest path, isomorphism). Graph representations/storage implementations – adjacency matrix, adjacency list, adjacency multi-list. Graph traversal and connectivity – Depth-first search (DFS), Breadth-first search (BFS) – concepts of edges used in DFS and BFS (tree-edge, back-edge, cross-edge, forward-edge), applications. Minimal spanning tree – Prim’s algorithm (basic idea of greedy methods).
Module - IV. Searching, Sorting (10L): Sorting Algorithms (5L): Bubble sort and its optimizations, insertion sort, shell sort, selection sort, merge sort, quick sort, heap sort (concept of max heap, application – priority queue), radix sort. Searching (2L): Sequential search, binary search, interpolation search. Hashing (3L): Hashing functions, collision resolution techniques.
Recommended books:
- “Data Structures And Program Design In C”, 2/E by Robert L. Kruse, Bruce P. Leung.
- “Fundamentals of Data Structures of C” by Ellis Horowitz, Sartaj Sahni, Susan Anderson-freed.
- “Data Structures in C” by Aaron M. Tenenbaum.
- “ Data Structures” by S. Lipschutz.
- “Data Structures Using C” by Reema Thareja.
- “Data Structure Using C”, 2/e by A.K. Rath, A. K. Jagadev.
- “ Introduction to Algorithms” by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
Learning outcome: Ideally this course should act as a primer/pre-requisite for CS 503 (Design and Analysis of Algorithms). On completion of this course, students are expected to be capable of understanding the data structures, their advantages and drawbacks, how to implement them in C , how their drawbacks can be overcome and what the applications are and where they can be used. Students should be able to learn about the data structures/ methods/algorithms mentioned in the course with a comparative perspective so as to make use of the most appropriate data structure/ method/algorithm in a program
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Reference Book:
- Hayes J. P., “Computer Architecture & Organisation”, McGraw Hill,
- Hamacher, “Computer Organisation”, McGraw Hill,
- N. senthil Kumar, M. Saravanan, S. Jeevananthan, “Microprocessors and Microcontrollers” OUP
- Chaudhuri P. Pal, “Computer Organisation & Design”, PHI,
- P N Basu- “Computer Organization & Architecture” , Vikas Pub
Practical Physica Lab- Code: PH- Contacts: (3P) Credit: (2) Group 1: Experiments on Electricity and Mangentism
- Determination of dielectric constant of a given dielectric material.
- Determination of resistance of ballistic galvanometer by half deflection method and study of variation of logarithmic decrement with series resistance.
- Determination of the thermo-electric power at a certain temperature of the given thermocouple.
- Determination of specific charge (e/m) of electron by J.J. Thomson’s method. Group 2: Quantum Physics
- Determination of Planck’s constant using photocell.
- Determination of Lande’g factor using Electron spin resonance spetrometer.
- Determination of Stefan’s radiation constant
- Verification of Bohr’s atomic orbital theory through Frank-Hertz experiment.
- Determination of Rydberg constant by studying Hydrogen/ Helium spectrum Group 3: Modern Physics
- Determination of Hall co-efficient of semiconductors.
- Determination of band gap of semiconductors.
- To study current-voltage characteristics, load response, areal characteristics and spectral response of photo voltaic solar cells.
a) A candidate is required to perform 3 experiments taking one from each group. Initiative should be taken so that most of the Experiments are covered in a college in the distribution mentioned above. Emphasis should be given on the estimation of error in the data taken.
b) In addition a student should perform one more experiments where he/she will have to transduce the output of any of the above experiments or the experiment mentioned in c] into electrical voltage and collect the data in a computer using phoenix or similar interface.
c) Innovative experiment: One more experiment designed by the student or the concerned teacher or both.
Note: Failure to perform each experiment mentioned in b] and c] should be compensated by two experiments mentioned in the above list. At the end of the semester report should sent to the board of studies regarding experiments, actually performed by the college, mentioned in b] and c] Experiment in b] and c] can be coupled and parts of a single experiment.
Recommended Text Books and Reference Books:
For Both Physics I and II
- B. Dutta Roy (Basic Physics)
- R.K. Kar (Engineering Physics)
- Mani and Meheta (Modern Physics) 4.. Arthur Baiser (Perspective & Concept of Modern Physics)
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Physics I (PH101/201) Vibration and Waves Kingsler and Frey D.P. Roychaudhury N.K. Bajaj (Waves and Oscillations) K. Bhattacharya R.P. Singh ( Physics of Oscillations and Waves) A.B. Gupta (College Physics Vol.II) Chattopadhya and Rakshit (Vibration, Waves and Acoustics)
Optics Möler (Physical Optics) A.K. Ghatak E. Hecht (Optics) E. Hecht (Schaum Series) F.A. Jenkins and H.E. White
- Chita Ranjan Dasgupta ( Degree Physics Vol 3)
Quantum Physics Eisberg and Resnick A.K. Ghatak and S. Lokenathan S.N. Ghoshal (Introductory Quantum Mechanics) E.E. Anderson (Modern Physics) Haliday, Resnick and Crane (Physics vol.III) Binayak Dutta Roy [Elements of Quantum Mechanics]
Crystallography
- S.O. Pillai (a. Solid state physics b. Problem in Solid state physics)
- A.J. Dekker
- Aschroft and Mermin
- Ali Omar
- R.L. Singhal
- Jak Tareen and Trn Kutty (Basic course in Crystallography
Laser and Holography A.K. Ghatak and Thyagarajan (Laser) Tarasov (Laser) P.K. Chakraborty (Optics) B. Ghosh and K.G. Majumder (Optics) B.B. Laud (Laser and Non-linear Optics) Bhattacharyya [Engineering Physics] Oxford
Physics II(PH 301)
Classical Mechanics (For Module 5.1 in PH 301) H. Goldstein A.K. Roychaudhuri R.G. Takwal and P.S. Puranik Rana and Joag M. Speigel (Schaum Series) J.C. Upadhya (Mechanics)
Electricity and Magnetism Reitz, Milford and Christy David J. Griffith
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Implementation of array operations:
Stacks and Queues: adding, deleting elements Circular Queue: Adding & deleting elements Merging Problem :
Evaluation of expressions operations on Multiple stacks & queues :
Implementation of linked lists: inserting, deleting, inverting a linked list. Implementation of stacks & queues
using linked lists:
Polynomial addition, Polynomial multiplication
Sparse Matrices : Multiplication, addition.
Recursive and Nonrecursive traversal of Trees
Threaded binary tree traversal. AVL tree implementation
Application of Trees. Application of sorting and searching algorithms
Hash tables implementation: searching, inserting and deleting, searching & sorting techniques.
(Detailed instructions for Laboratory Manual to follow for further guidance. The details will be uploaded in the website from time to time)
Computer organization Code: CS Contacts: 3 Credits: 2
- Familiarity with IC-chips, e.g. a) Multiplexer , b) Decoder, c) Encoder b) Comparator Truth Table verification and clarification from Data-book.
- Design an Adder/Subtractor composite unit.
- Design a BCD adder.
- Design of a ‘Carry-Look-Ahead’ Adder circuit.
- Use a multiplexer unit to design a composite ALU.
- Use ALU chip for multibit arithmetic operation.
- Implement read write operation using RAM IC.
- (a) & (b) Cascade two RAM ICs for vertical and horizontal expansion. (Detailed instructions for Laboratory Manual to follow for further guidance. The details will be uploaded in the website from time to time) SEMESTER - IV
Theory
NUMERICAL METHODS
Code: M (CS) 401 Contacts: 2L+1T Credits: 2
Approximation in numerical computation: Truncation and rounding errors, Fixed and floating-point arithmetic, Propagation of errors. (4)
Interpolation: Newton forward/backward interpolation, Lagrange’s and Newton’s divided difference Interpolation. (5)
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Numerical integration: Trapezoidal rule, Simpson’s 1/3 rule, Expression for corresponding error terms. (3)
Numerical solution of a system of linear equations: Gauss elimination method, Matrix inversion, LU Factorization method, Gauss-Seidel iterative method. (6) Numerical solution of Algebraic equation: Bisection method, Regula-Falsi method, Newton-Raphson method. (4)
Numerical solution of ordinary differential equation: Euler’s method, Runge-Kutta methods, Predictor-Corrector methods and Finite Difference method. (6)
Text Books:
- C.Xavier: C Language and Numerical Methods.
- Dutta & Jana: Introductory Numerical Analysis.
- J.B.Scarborough: Numerical Mathematical Analysis.
- Jain, Iyengar , & Jain: Numerical Methods (Problems and Solution). References:
- Balagurusamy: Numerical Methods, Scitech.
- Baburam: Numerical Methods, Pearson Education.
- N. Dutta: Computer Programming & Numerical Analysis, Universities Press.
- Soumen Guha & Rajesh Srivastava: Numerical Methods, OUP.
- Srimanta Pal: Numerical Methods, OUP.
Subject Name: MATHEMATICS
Code: M 401
Contacts: 3L +1T = 4
Credits: 4
Note 1: The whole syllabus has been divided into five modules.
Note 2: Structure of the question paper
There will be three groups in the question paper. In Group A, there will be one set of multiple choice type questions spreading the entire syllabus from which 10 questions (each carrying one mark) are to be answered. From Group B, three questions (each carrying 5 marks) are to be answered out of a set of questions covering all the five modules. Three questions (each carrying 15 marks) are to be answered from Group C. Each question of Group C will have two or three parts covering not more than two modules. Sufficient questions should to be set covering the whole syllabus for alternatives. Module I Theory of Probability: Axiomatic definition of probability. Conditional probability. Independent events and related
problems. Bayes theorem (Statement only) & its application. One dimensional random variable. Probability
distributions-discrete and continuous. Expectation. Binomial, Poisson, Uniform, Exponential, Normal distributions and
related problems. t, χ^2 and F-distribution (Definition only). Transformation of random variables. Central Limit
Theorem, Law of large numbers (statement only) and their applications. Tchebychev inequalities (statement only) and
its application. (14L)
Module II Sampling theory: Random sampling. Parameter, Statistic and its Sampling distribution. Standard error of statistic.
Sampling distribution of sample mean and variance in random sampling from a normal distribution (statement only) and
related problems.
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Module - 2 : Digital Transmission: [8] [Details: Concept of Quantisation & Quantisation error, Uniform Quantiser (1L); Non-uniform Quantiser, A-law & law companding (mention only) (1L); Encoding, Coding efficiency (1L); Line coding & properties, NRZ & RZ, AMI, Manchester coding PCM, DPCM (1L); Baseband Pulse Transmission, Matched filter (mention of its importance and basic concept only), Error rate due to noise (2L); ISI, Raised cosine function, Nyquist criterion for distortion-less base-band binary transmission, Eye pattern, Signal power in binary digital signals (2L);
Module - 3 : Digital Carrier Modulation & Demodulation Techniques: [8] [Details: Bit rate, Baud rate (1L); Information capacity, Shanon’s limit (1L); M-ary encoding, Introduction to the different digital modulation techniques - ASK, FSK, PSK, BPSK, QPSK, mention of 8 BPSK, 16 BPSK (2L); Introduction to QAM, mention of 8QAM, 16 QAM without elaboration (1L); Delta modulation, Adaptive delta modulation (basic concept and importance only, no details (1L); introduction to the concept of DPCM, Delta Modulation, Adaptive Delta modulation and their relevance (1L); Spread Spectrum Modulation - concept only. (1L).
Module - 4 : Information Theory & Coding : [8] [Details: Introduction, News value & Information content (1L); , Entropy (1L); , Mutual information (1L); , Information rate (1L); , Shanon-Fano algorithm for encoding (1L); , Shannon's Theorem - Source Coding Theorem (1L); , Channel Coding Theorem, Information Capacity Theorem (basic understanding only) (1L); ; Error Control & Coding - basic principle only. (1L);
Text Books:
- An Introduction to Analog and Digital Communications by Simon Haykin; Published by Wiley India.
- Data Communication and Networking by Behrouz A. Forouzan, Published by Tata McGraw-Hill
References:
- Communication Systems 4th Edition by Simon Haykin; Published by Wiley India (Student Edition)
- Principles and Analog and Digital Communication by Jerry D Gibson, Published by MacMillan.
- Communication Systems by A. B. Carlson, Published by McGraw-Hill.
- Understanding Signals and Systems by Jack Golten, Published by McGraw Hill.
Learning Outcome : [These are the minimum competence to be developed; the students will be encouraged to learn more and acquire better understanding.] Module -1: The student will be able to differentiate between base-band transmission and modulation and compute antenna size from knowledge of carrier frequency; (Tutorial: To identify different communication processes based on these two methods and appreciate their relative merit and demerit); The learner will be able to determine the carrier and message frequencies from the expression for AM signals and Angle modulated signals. Given an expression for a modulated signal, the student must be able to recognize the type of modulation. The ability to explain each and every block of the PCM system must be acquired.
Module -2: The student must be able to appreciate the importance of digital modulation over analog modulation in respect of noise immunity (concept); The student will be able to compute the coding efficiency of binary and decimal coding systems; The relative merits and demerits of the different digital modulation techniques to be understood clearly; (Tutorial: Students should be encouraged to find out where these different modulation techniques are used in everyday life); Capability to calculate signal power in digital systems to be mastered.
Module -3: Ability to compute bit rate and baud rate for different signals to be developed; the student must be able to compare between the channel capacity in case of channels of varying band-width and SNR value and predict the maximum data rate possible; The learner must be able to compare the merits and short comings of the basic digital modulation techniques. (Tutorial: Find out the area of application for each with reason for such application)
Module -4: Student will be able to calculate the information content, entropy and information rate for given situations; He/she will be able to appreciate the importance of the different line coding and error coding techniques. (Tutorial: Find out the range of applicability).
Formal Language & Automata Theory
Revised Syllabus of B.Tech CSE (for the students who were admitted in Academic Session 2010-2011)
Code: CS Contacts: 3L+1T Credits: 4
Prerequisites of Formal Language & Automata Theory: Elementary discrete mathematics including the notion of set,function,relation,product,partial order,equivalence relation,graph& tree. They should have a thorough understanding of the principle of mathematical induction.
Module-1: [ 13 L ] Fundamentals: Basic definition of sequential circuit, block diagram, mathematical representation, concept of transition table and transition diagram (Relating of Automata concept to sequential circuit concept) Design of sequence detector, Introduction to finite state model [ 2L] Finite state machine: Definitions, capability & state equivalent, kth- equivalent concept [ 1L] Merger graph, Merger table, Compatibility graph [ 1L] Finite memory definiteness, testing table & testing graph. [1L] Deterministic finite automaton and non deterministic finite automaton. [1L] Transition diagrams and Language recognizers. [1L] Finite Automata: NFA with Î transitions - Significance, acceptance of languages. [1L] Conversions and Equivalence: Equivalence between NFA with and without Î transitions. NFA to DFA conversion. [2L] Minimization of FSM, Equivalence between two FSM’s , Limitations of FSM [1L] Application of finite automata, Finite Automata with output- Moore & Melay machine. [2L]
Learning outcome of Finite Automata: The student will be able to define a system and recognize the behavior of a system. They will be able to minimize a system and compare different systems.
Module-2: [8 L] Regular Languages : Regular sets. [1L] Regular expressions, identity rules. Arden’s theorem state and prove [1L] Constructing finite Automata for a given regular expressions, Regular string accepted by NFA/DFA [1L] Pumping lemma of regular sets. Closure properties of regular sets (proofs not required). [1L] Grammar Formalism: Regular grammars-right linear and left linear grammars. [1L] Equivalence between regular linear grammar and FA. [1L] Inter conversion, Context free grammar. [1L] Derivation trees, sentential forms. Right most and leftmost derivation of strings. (Concept only) [1L]
Learning outcome of Regular Languages and Grammar: Student will convert Finite Automata to regular expression. Students will be able to check equivalence between regular linear grammar and FA.
Module-3: [9L] Context Free Grammars, Ambiguity in context free grammars. [1L] Minimization of Context Free Grammars. [1L] Chomsky normal form and Greibach normal form. [1L] Pumping Lemma for Context Free Languages. [1L] Enumeration of properties of CFL (proofs omitted). Closure property of CFL, Ogden’s lemma & its applications [1L] Push Down Automata: Push down automata, definition. [1L] Acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence. [1L] Equivalence of CFL and PDA, interconversion. (Proofs not required). [1L] Introduction to DCFL and DPDA. [1L]
Learning outcome of PDA and context free grammar: Students will be able to minimize context free grammar. Student will be able to check equivalence of CFL and PDA. They will be able to design Turing Machine.
