Fallsem2012-13 CP0365 Syb

Course Code ENG101 ENG001 ENG101 ENG102 MGT301 ITE498 CHY104 MAT101 PHY101 CHY101 ITE101
I. University Core Course Title English for Engineers I (or) Effective English English for Engineers I (or) English for Engineers II Ethics and Values Comprehensive Examination Environmental Studies Multivariable Calculus and Differential Equations Modern Physics Engineering Chemistry Problem Solving Using C Foreign Language
L T P C Credits 3 0 3 0 3 0 0 3 3 2 2 2 0 1 0 1 0 0 0 3 0 3 0 3 2 3 0 2 2 2 0 3 4 4 4 3 2 3 3 3 2 3 4 4 4 3 2 ---
Prerequisite
ENG101 -----------------
Course Code
II. University Elective Course Title L T University Elective I University elective II 3 0 3 0
P C Credits 0 0 3 3 3 3
Prerequisite
Course Code MEE101 MEE102 MAT106 MAT105 ITE102 EEE101 ITE103 ITE104 MAT202 ITE205 ITE206 ITE204 ITE203 ITE201 ITE202 MAT104 ITE207 ITE208 ITE209 ITE210 ITE301
Course Title
III. Program Core L T P C Credits 0 0 3 3 3 3 3 0 3 3 0 3 3 3 0 3 3 3 0 3 0 0 1 1 0 0 1 0 1 0 0 0 1 0 0 1 0 0 0 0 4 2 0 0 0 2 0 3 0 0 3 0 0 0 3 0 2 0 3 0 2 1 4 4 3 4 4 2 4 3 2 3 4 3 2 4 4 3 2 3 2 1 4 4 3 4 4 2 4 3 2 3 4 3 2 4 4 3 2 3 3
Prerequisite
Engineering Graphics Workshop Practice Differential and Difference Equations Discrete Mathematical Structures Information Technology Fundamentals Basic Electrical and Electronics Engineering Data Structures and Algorithms Data Structures and Algorithms Lab Linear Algebra Digital Electronics and Microprocessors Digital Electronics and Microprocessors Lab Computer Architecture and Organization Theory of Computation Object Oriented Programming Concepts Object Oriented Programming in C++ Lab Probability and Statistics Programming in Java Operating Systems Operating Systems Lab Human Computer Interaction Object Oriented Analysis and Design
MAT101
ITE101 ITE103 (Co) EEE101 ITE205(Co) ITE205 MAT106 ITE101 ITE201 (Co) MAT101 ITE201 ITE204 ITE208 (Co) EEE101 ITE201
3 0 0 3
80
ITE302 ITE303 ITE304 ITE318 ITE305 ITE306 ITE307 ITE308 ITE309 ITE310 ITE311 ITE399 ITE401 ITE403 ITE404 ITE402 ITE398 ITE499
Database Systems Data Communication and Computer Networks Computer Networks Lab Principles of Software Engineering Principles and Practice Embedded Systems Embedded Systems Lab Artificial Intelligence Distributed Systems Web Technologies Web Technologies Lab Network Programming Industrial Internship Computer Graphics and Multimedia Network Administration Data warehousing and Data Mining Multimedia and Graphics Lab Mini Project Final Project
3 0 2 4 3 0 0 3 0 0 3 2 3 3 0 3 3 3 0 3 3 3 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 3 2 3 3 2 3 3 3 2 4 2 0 3 2 4 0 3 3 2 2 20
4 3 2 3 3 2 3 3 3 2 4 2 3 4 3 2 2 20
ITE208 ITE208,ITE304(c0) ITE303 (Co) ITE201 ITE204 ITE305(co) ITE203 ITE303 ITE207 ITE309(co) ITE303 --ITE207 ITE311 ITE302 ITE401(co) ITE301,302,318
Course Code ITE312 ITE313 ITE314 ITE315 ITE316 ITE317 ITE406 ITE407 ITE408 ITE409 ITE410 ITE411 ITE412 ITE413 ITE414 ITE415 ITE416 ITE417 ITE320
Course Title
IV. Program Elective L T P C Credits 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
Prerequisite
Basic Bio-Informatics Real-Time Systems Open Source Programming System Programming Software Project Management Graph Theory and Its Applications Web Services and Service Oriented Architecture Soft Computing Mobile Computing High-End Computing Digital Image Processing Advanced Database Management Systems Software Agents Natural Language Processing Knowledge Management Geographical Information Systems Parallel Processing Information and Storage Management Network and Information Security
81
82
Course Code: Course Prerequisites Objectives: +2
EFFECTIVE ENGLISH
L 3
T 0
P 0
C 3
Expected Outcome:
To improve the English Language Proficiency of the Students through independent study. To develop learning strategies and techniques to enable the students to continue to learn and use English regularly and confidently on campus. The learners will get an enhanced fluency in English. Through well developed vocabulary they would be able to communicate their ideas relevantly and coherently both in writing and speaking. The course also meets the following student outcomes: (d). An ability to function effectively on multi-disciplinary teams to accomplish a common goal (f). An ability to communicate effectively with a range of audiences Listening & Speaking A. Introduction and greetings B. Asking/Offering information Reading &Writing A. Making meaningful sentences from the jumbled word B. Basic writing skills applying studied grammatical structures Vocabulary & Grammar A. Parts of Speech B. Sentence Pattern C. Vocabulary (Academic and Social)
Unit I
Unit II Listening & Speaking A. Requesting/Inviting B. Communicative and decision making activities based on authentic listening materials Reading & Writing A. Hints development B. Topic Sentence/ One stand-alone paragraph writing Vocabulary & Grammar A. Types of Sentences (Positive, Negative, Interrogative Sentences) B. Simple, Compound , and Complex Sentences C. Vocabulary (Technical and Business) Unit III Listening & Speaking A. Authentic video materials to improve extraction of information from the given source B. Role-plays in various life like situations Reading & Writing A. Instructional writing skills B. Illustrative and descriptive writing. Vocabulary & Grammar A. Tenses B. Vocabulary (Industry related words, Words of Hospitality) Unit IV A. Debating to express points of view. B. Public Speaking
83
Reading &Writing A. Critical appreciation of the given text (prose articles/simpler poems) B. Narrative written structures to support and control given ideas Vocabulary & Grammar A. Voice change B. Vocabulary (Internet and Communication related) Unit V Listening & Speaking A. Group Discussion B. Project development in groups and pair-work to increase communication Reading & Writing A. Written communication for task oriented goals B. Business Writing Vocabulary & Grammar A. Reported Speech B. Error Correction 1. English Vocabulary in Use (Advanced), Michael McCarthy and Felicity, CUP, 2003 Text Books Reference Books Mode of Evaluation 2. Murphys English Grammar with CD, Murphy, Cambridge University Press. Journal and News Paper Articles Writing and Speaking Skill tests, Quizzes, Assignments, Seminars
84
Course Code: ENG 101 Course Prerequisites Objectives:
ENGLISH FOR ENGINEERS I EPT Scores
L 2
T 0
P 2
C 3
Expected Outcome: Unit I
To impart basic skills of communication in English through intensive practice To prepare students for the communicative challenges they will face in their professional life. The learners will develop efficiency in English language with the development of the four skills of communication LSRW The course also meets the following student outcomes: d. An ability to function effectively on multi-disciplinary teams to accomplish a common goal f. An ability to communicate effectively with a range of audiences Nature and process of communication Types of communication: Intra-personal, Interpersonal, Group-verbal and non-verbal communication Listening to songs Time, tense and tense consistency E-mail
Unit II Barriers to CommunicationPhysical barriers, Psychological barriers, linguistic barriers, Cultural barriers. Listening to Casual conversations Use of voice Writing formal letters Writing effective sentences-sentence coherence, length and thematic emphasis Unit III Functions of language: Descriptive - Describing people, places, events and things - Describing a process Listening to descriptions Concord Paragraph writing Paragraph: Definition. Requirements of a paragraph -- Understanding, Unity, Coherence and Emphasis in a paragraph. Identifying the Topic Sentence. Order. Devices used to impart Coherence and Emphasis in a Paragraph. Analysis of a given Paragraph in terms of Unity, Coherence and Emphasis. Unit IV Functions of language : Social - Bias-free language, Art of small talk, Participating in Conversations, Short formal speech Listening to Speeches Conditionals Development of a Paragraph using Deductive order, Inductive order, Chronological Order (Time Order), Compare and Contrast order Unit V Reading Skills - Scanning Skills, Skimming Skills, Intensive Reading Skills, Word meaning and Recognition Use of prepositions Question tags
85
Text Books Reference Books Mode of Evaluation
Cloze test 1. Ibbotson, Mark, Cambridge English for Engineering, Cambridge University Press, 2008 1. Rizvi, M. Ashraf, Effective Technical Communication, Tata McGraw Hill, 2006 Continuous Assessment (Quizzes, CATs, Assignments, etc.) and TEE
86
Course Code: ENG 102 Course Prerequisites Objectives:
ENGLISH FOR ENGINEERS II ENG 101
L 2
T 0
P 2
C 3
To develop confidence and effectiveness in presenting technical ideas The students are prepared to face the challenges of their professional lives in an increasingly globalized world The course also meets the following student outcomes: d. An ability to function effectively on multi-disciplinary teams to accomplish a common goal f. An ability to communicate effectively with a range of audiences Negotiation -Types of Negotiators, Types of Negotiation, Mediation, Bargaining, Resolving conflicts Reading Scientific and technical texts Six Billion Dollar Experiment by Joel Achenbach Business Letters calling for quotations, placing an order, letters of complaint Error detection
Unit II Team Management stages of team, characteristics of a successful team, goals and roles of a team member, team listening Reading Instructions, Reading technical manuals Instructional Writing writing instructions for technical and non-technical people Error Detection Unit III Group Discussion process, skills, guidelines, evaluation Reading Scientific and technical texts Global Water Crisis by Mikhail Gorbachev Technical Report writing Error detection Unit IV Oral Presentation skills - Planning-Preparing-Organizing-Presentation Minutes of Meeting, Writing Memos Error detection Unit V Interviews - Preparing for an interview, Facing an Interview, Employers expectations, Negative aspects Reading Graphic information/Transcoding Resume and Job Applications Error Detection 1. Ibbotson, Mark, Cambridge English for Engineering, Cambridge University Press, 2008 1. Rizvi,M.Ashraf, Effective Technical Communication, Tata McGraw Hill, 2006 Continuous Assessment (Quizzes, CATs, Assignments, etc.) and TEE
87
Course Code: CHY 104 Course Prerequisites
ENVIRONMENTAL STUDIES NONE
L 3
T 0
P 0
C 3
Objectives:
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
1. To make students understand and appreciate the unity of life in all its forms, the implications of life style on the environment. 2. To give students a basic understanding of the major causes of environmental degradation on the planet, with specific reference to Indian situation. 3. To inspire students to find ways in which they can contribute personally and professionally to prevent and rectify environmental problems Students will be able to 1. understand the need for eco-balance 2. acquire the knowledge on the methods of pollution prevention The course also meets the following student outcomes: e. An understanding of professional, ethical, legal, security and social issues and responsibilities g. An ability to analyze the local and global impact of technology on individuals, Organizations and society Environment & Natural Resources Definition, scope, importance, need for the public Natural resources: Forest resources Use, exploitation, deforestation, construction of multipurpose dams, effect on forests Water resources: use of surface and subsurface water; effect of floods, drought, water conflicts Food resources: Food problems, advantage and disadvantage of fertilizers & pesticides, effect on environment Energy resources: Need to develop renewable energy Land resources: Land degradation, landslides, soil erosion, desertification Case studies Ecology & Bio-diversity Concept of ecosystem Structure and function of an ecosystem, producers, consumers and decomposers, energy flow Ecological succession Food chains, food webs and ecological pyramids Bio diversity: Definition, genetic, species and ecosystem diversity Biogeographical classification of India, hotspots, threats related to habitat loss, poaching of wildlife, man-wildlife conflicts Conservation of bio-diversity Environmental Pollution Definition Causes, pollution effects and control measures of air, water, soil, marine, noise, thermal, nuclear hazards Solid waste management: causes, effects and control measures of urban and industrial wastes Pollution measures Case studies Disaster management: Floods, earthquake, cyclone and landslides Social Issues and the Environment Urban problems related to energy and sustainable development Water conservation, rain water harvesting, watershed management, problems related to rehabilitation case studies Wasteland reclamation Consumerism and waste products Environment Protection Act, Air, Water, Wildlife, Forest Conservation Acts, Environmental legislation and public awareness Human Population and the Environment Population growth, variation among nations, population explosion Family Welfare Programme, environment and human health Human rights, value education, HIV/AIDS, women and child welfare Role of information technology Visit to local polluted site / Case studies Customer orientation Retention QFD CSM TQM Models Case Studies 1. Kurien Joseph and R. Nagendran (2004), Essentials of Environmental Studies, 1st Edition, Pearson Education 1. Keerthinarayana and Daniel Yesudian (2004), Environmental Science and Engineering,
Unit V
Text Books Reference
88
Books
Mode of Evaluation
1st Edition, Hi-Tech Publications. 2. Erach Bharucha (2005), Text Book of Environmental Studies, Universities Press (India) Pvt. Ltd. 3. Howard S. Peavy, Donald R. Rowe and George Tchobanoglous (1987), Environmental Engineering, McGraw-Hill. 4. Metcalf and Eddy (2003), Wastewater Engineering: Treatment and Reuse, Tata McGrawHill Written examination / Assignments / Mini project
89
Course Code: MGT 301 Course Prerequisites Objectives:
ETHICS AND VALUES NONE
L 3
T 0
P 0
C 3
Expected Outcome:
To understand the moral problems faced in the corporate setting and wider philosophical frameworks along with social importance and their intellectual challenges are given its due placement. The students will have hands-on experience with the day-to-day problems and their allied alternative decision making towards social and business environment The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline d. An ability to function effectively on multi-disciplinary teams to accomplish a common goal e. An understanding of professional, ethical, legal, security and social issues and responsibilities h. Recognition of the need for and an ability to engage in continuing professional development Scope and aims of Professional Ethics. What is Ethics? - Why Study Ethics? Professions and Professionalism.-Ethical reasoning and theories Professional ideals and virtues Study of reasoning Theories about right action Self interest Customs and religion.
Unit I
Unit II Social Experimentation and Environmental Ethics Experiments and responsible experimentations and moral autonomy and accountability - Code of Ethics and balanced outlook- Responsibility towards employers Unit III Safety and Risk Management Safety Risk Assessment Risk reduction analysis .Global Issues in Ethics Loyalty Authority - Collective bargaining Conflicts of Interest Occupational Crime. 1. L.H. Newton & Catherine K.D. Classic cases in Environmental Ethics, Belmont: California Wadsworth, 2006 1. Mike W Martin & Ronald Schnizinger, Engineering Ethics, New Delhi: Tata McGraw Hill,Latest Edition 2. OC Ferrell, John Paul Frederich,Linda Ferrell; Business Ethics Ethical Decision making and Cases2007 Edition, Biz Tantra, New Delhi CAT I/CAT II, End Term Tests, Assignments and any of these following components Mini projects/Seminars/ Quizzes /Case Discussion/Term Paper/Class Participation/Assessment of class Notes
Text Books
Reference Books
Mode of Evaluation
90
Course Code: MAT 101 Course Prerequisites Objectives:
Multivariable Calculus and Differential Equations Mathematics at 10+2 level (or) Basic Mathematics (MAT001)
L 3
T 1
P 0
C 4
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To provide the requisite and relevant background necessary to understand other important engineering mathematics courses offered for Engineers and Scientists. To introduce three important topics of applied mathematics, viz., multiple integrals, Vector calculus and Laplace transforms. By the end of the course, the students are expected to learn How to evaluate multiple integrals in Cartesian, Cylindrical and Spherical geometries. Vector calculus with application in Fluid Dynamics and Electromagnetic fields. To solve ordinary differential equations. The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline h. Recognition of the need for and an ability to engage in continuing professional development MULTIVARIABLE CALCULUS Functions of two variables - limits and continuity - partial derivatives total differential Taylors expansion for two variables maxima and minima constrained maxima and minima - Lagranges multiplier method - Jacobians MULTIPLE INTEGRALS Evaluation of double integrals change of order of integration change of variables between Cartesian and polar co-ordinates - evaluation of triple integrals - change of variables between Cartesian and cylindrical and spherical polar coordinates - beta and gamma functions interrelation - evaluation of multiple integrals using gamma and beta functions - error function and its properties. VECTOR CALCULUS Scalar and vector valued functions gradient physical interpretation total derivative directional derivative -divergence and curl physical interpretations - vector identities (without proof) - scalar and vector potentials -line, surface and volume integrals - Greens, Stokes and Gauss divergence theorems (without proof) -verification and evaluation of vector integrals using them. ORDINARY DIFFERENTIAL EQUATIONS Linear higher order ordinary differential equation with constant coefficients solutions of homogenous and non-homogenous ODEs - method of undetermined coefficients method of variation of parameters equations reducible to linear equations with constant coefficients. LAPLACE TRANSFORMS Definition: Laplace transforms of functions - properties of Laplace transforms - initial and final values theorems - inverse transforms - transforms of periodic functions - convolution theorems step functions, impulse functions - concept of transfer functions applications to the solution of differential equations. G.B. Thomas and R.L. Finney (2002), Calculus and Analytical Geometry, 9 e, Pearson Education 2. Michale D. Greenberg (2002), Advanced Engineering Mathematics, 2nd Edition, Pearson Education. 3. Peter V.O Neil (2003), Advanced Engineering Mathematics, 5thEdition, Thomson Brook/Cole. 4. Erwin Kreyszig (2004), Advanced Engineering Mathematics, 8th Edition., John Wiley & Sons.
Unit V
Text Books
91
Mode of Evaluation
5. B.S. Grewal (2005), Higher Engineering Mathematics, 38thEdition, Khanna Publications Continuous Assessment Tests, assignments, tutorial sheets, class Tests, quizzes
92
Differential and Difference Equations Multivariable Calculus and Differential Equations (MAT101)
L 3
T 1
P 0
C 4
Expected Outcome:
This course is designed to give a comprehensive coverage at an introductory level to the subject of ordinary differential equations and difference equations. Matrix methods and eigen value problems are integrated in to the course. Sufficient emphasis is laid on mathematical modeling and analysis of simple engineering problems. By the end of the course, the students are expected to know how to model simple physical problems in the form of a differential and difference equations, analyze and interpret the solutions. Further the students are expected to acquire necessary background in matrix methods and Eigen value problems so as to appreciate their importance to engineering systems The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline Matrix methods to Linear Differential Equations The eigen value problem- eigen values and eigen vectors - properties of eigen values and eigen vectors-Cayley-Hamilton theorem and its applications- symmetric matrices -similarity of matrices diagonalisation of a real symmetric matrix-quadratic form. Solution of equations of type X11 + AX=0 - reduction of nth order system to a system of first order equations by diagonalization. Power Series Solutions The Strum-Liouville Problem-orthogonality of eigen functions- Bessels and Legendres equations- power series solutions method of Frobenius. Fourier Series Fourier series -Eulers formulae- Dirichlets conditions - change of interval- half range series RMS value Parsevals identity computation of harmonics. Difference Equations and Z-transforms Difference equation-first and second order difference equations with constant coefficientsFibonacci sequence-solution of difference equations-complementary functions - particular integrals by the method of undetermined coefficients. Z-transform-relation to Laplace transforms - Z-transforms of standard functions-inverse Ztransforms by partial fraction method-by convolution- solution of simple difference equations using Z-transforms. Applications of Differential Equations First order equations: Newtons law of cooling radioactive decay, L-R and C-R circuitsEquation of motion for a particle in gravitational field Terminal velocity. Second order equations: Free un-damped and damped vibrations, Forced oscillationsResonance phenomenon, series LCR circuit - Model of a vibrating systems with two masses Solutions by matrix methods. 1. Erwin Kreysizing, Advanced Engineering Mathematics, 8th Edition, John Wiley & Sons, (Wiley student Edison) (2004). 2. B.S.Grewal, Higher Engineering Mathematics, 40th Edition. Khanna Publications (2007) 1. W.E.Boyce and R.C. Diprima, Elementary differential equations, 7th Edition. John Wiley & Sons, Inc. (2002). 2. Michale D. Greenberg, Advanced Engineering Mathematics, 2nd Edition, Pearson Education, First Indian reprint (2002). 3. Peter V. O Neil, Advanced Engineering Mathematics, 5th Edition, Thomson, Book/Cole
Unit I
Unit II
Unit III
Unit IV
Unit V
Text Books
Reference Books
93
Mode of Evaluation
(2003). 4. C. Ray Wylie, Advanced Engineering Mathematics, 6th Edn, McGraw Hill (1995). 5. Gary L. Peterson, Linear Algebra and Differential Equations, Addison-Wesley (2002). 6. James C. Robinson, An introduction to ordinary differential equations, Cambridge Univ. Press (2000). Continuous Assessment Tests, Assignments, Tutorial sheets, Class Tests, Quizzes.
94
Probability and Statistics MAT101 Multivariable calculus and Differential Equations
L 3
T 1
P 0
C 4
Expected Outcome:
To provide the mathematical support by way of probabilistic models and statistical methodology to tackle problems encountered in Science and Engineering applications. Understand basic notions of probability arising in a variety of uncertain situations which are nontraditional in areas of science and engineering. Knowing the basic tools of statistical methods Emphasize the study of data analysis leading to probabilistic models. The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline Random Variables Random variables- distribution and density functions-random vectors-joint distribution and joint density functions- conditional distribution and density functions-co-variancecorrelation - mathematical expectation - moment generating function characteristic function. Distributions Binomial and Poisson distributions normal distribution gamma and exponential distributions Weilbull distribution - regression and correlation partial and multiple correlation- multiple regression Testing Hypothesis Large sample tests- procedure of testing hypothesis- small sample tests- Students t-test - Ftest- chi-square test- independence of attributes and goodness of fit. ANOVA Analysis of variance one and two way classifications - CRD- RBD- LSD. Non Parametric Tests Non-parametric tests-sign test-signed-rank test-rank-sum test-Kruskal-Wallis test-runs testtolerance limits-rank correlation coefficient. R.E.Walpole, R.H.Mayers, S.L.Mayers and K.Ye, Probability and Statistics for engineers and scientists, 7th Edition, Pearson Education (2003). 1. J.L.Devore, Probability and Statistics, 5th Edition, Thomsun (2000). 2. R.A.Johnson, Miller & Freunds Probability and Statistics for Engineers, seventh edition, Pearson Education, Delhi (2008). Continuous Assessment Tests, Assignments, Tutorial sheets, Class Tests, Quizzes.
Unit I
Unit II
Unit III
Unit IV Unit V
95
LINEAR ALGEBRA MAT101 Multivariable Calculus and Differential Equations
L 3
T 1
P 0
C 4
Expected Outcome:
Linear algebra is one of the most important subjects in the study of engineering because of its widespread applications in electrical, communications and computer science. The objective of this course is to give a presentation of basic concepts of linear algebra to illustrate its power and utility through applications to computer science and engineering. By the end of the course the students are expected to learn the concepts of vector space, linear transformations, matrices and inner product space. Further the students are expected to solve problems in cryptography, computer graphics and some physical The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline Linear Equations and Matrices System of linear equations- Gaussian elimination/Jordan block matrices elementary matrices- finding inverse of matrices-permutation matrixLDU factorization- applications to cryptography and electrical network. Vector space Vector spaces- sub spaces -bases-spanning space-dimensions-linear combination linearly dependent-independent -finite dimensional-row and column spaces Rank and nullity invertibility - application to interpolation Linear transformations Linear transformations invertible linear transformation- matrices of linear transformations vector space of linear transformations change of bases similarity application to computer graphics. Inner product spaces Inner products the lengths and angles of vectors matrix representations of inner products- Gram-Schmidt orthogonalization projection-orthogonal projections relations of fundamental subspaces orthogonal matrices and isometrics applications to least square solutions. 1. Jin Ho Kwak and Sungpyo Hong, Linear Algebra, Second edition, Springer (2004). (Chapters 1, 3, 4 nd 5). 1. Stephen Andrilli and David Hecher, Elementary Linear Algebra, 3rd Edition, Academic Press(2006) 2. Charles W. Curtis, Linear Algebra, Springer (2004) 3. Howard Anton and Robert C Busby, Contemporary linear algebra, John Wiley (2003). 4. Gilbert Strang, Introduction to Linear Algebra, 4th Edition, Wellesley-Cambridge Press (2009). Continuous assessment Examination, Assignments, Tutorial sheets, Class Test, Quiz.
Unit I
Unit II
Unit III
Unit IV
Text Books
Reference Books Mode of Evaluation
96
Course Code: PHY 101 Course Prerequisites Objectives:
Modern Physics Physics as one subject in 12th Standard or equivalent level.
L 3
T 0
P 2
C 4
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To enable the students to understand the basics of the latest advancements in Physics, viz., Quantum Mechanics, Lasers, Fiber Optics, Ultrasonics, Microwaves and Nanotechnology personally and professionally to prevent and rectify environmental problems At the end of the course, students will acquire the necessary knowledge about modern Physics and its applications in various engineering and technology disciplines. The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline g. An ability to analyze the local and global impact of technology on individuals, Organizations and society d. An ability to function effectively on multi-disciplinary teams to accomplish a common goal Quantum Physics Dual nature of electron magnetic radiation - de Broglie waves Compton effect experimental verification - Heisenberg uncertainty principle Schrodinger equation application - particle in a box (ID). Application of Quantum Mechanics - Scanning Tunneling Microscope - Atomic Force Microscope- problems. Laser Laser characteristics - Einsteins coefficients - its significance - population inversion - three level, four level laser Schawlow and Townes condition Nd. YAG, He-Ne-CO2 laser welding, drilling, cutting optical disk systems recording data readout from optical disks Holography Recording and Reconstruction Problems Fiber Optics Light propagation through fibers Acceptance angle - numerical aperture types of fibers step index, graded index single mode, multimode dispersion intermodal, intramodal application of fiber optics in communication source LED Laser diode Detector PIN photodiode endoscope problems. Ultrasonic and Microwaves Properties generation Magnetostriction method Piezo-electric method detection of ultrasonic applications- NDT Characteristic features of micro waves Klystron Gunn diode applications of microwaves. Nano Technology Nanoscale Nanomaterials properties of Nanomaterials Moores Law Semiconductor nanoparticles Nanocomposites Quantum well Wire Dots CNT-Nanolithography Applications of Nanotechnology sensors Medicine. 1. B.B. Laud, Lasers and Non-Linear Optics, 2nd Edition, New Ages International. 2. Ghatak and K. Thyagarajan (2002), Introduction to Fiber Optics, Cambridge University Press. 3. William Silfvast (2002), Laser Fundamentals, Cambridge University Press. 4. Djafar K. Mynbaeu (2004), Fibre Optic Communication Technology, Pearson Education Asia. 5. Kittel (2001), Solid State Physics, 7th Edition, John Wiley & Sons. 1. K.C. Gupta (2002), Microwaves, New Age International. 2. Arthur Beiser (2003), Concepts of Modern Physics, 6th Edition, Tata-McGraw Hill. 3. Charles P. Poole, Jr. and Frank J. Owens (2003), Introduction to Nanotechnology, John Wiley & Sons. 4. Edward L. Wolf (2006), Nano Physics and Nanotechnology An introduction to Modern Concepts in Nanoscience, Wiley VCH verlagambh & Co., Weinheim.
Unit V
Text Books
Reference Books
97
Mode of Evaluation
Written examinations, surprise test, quizzes, assignments, seminar, group discussion
98
Discrete Mathematical Structures NONE
L 3
T 1
P 0
C 4
Expected Outcome:
The aim of this course is to motivate the students to address the challenge of the relevance of inference theory, Algebraic structures and graph theory to computer science and engineering problems. By the end of the course, the students are expected to use inference theory in circuit models, and algebraic theory in computer science problems, graph theory in net work models and lattices & Boolean algebra in Boolean functions. The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline SETS, RELATIONS AND FUNCTIONS Sets (Venn diagrams, complements, Cartesian products, power sets); Pigeonhole principle; Cardinality and countability; Relations (reflexivity, symmetry, transitivity, equivalence relations); Functions (surjections, injections, inverses, composition). BASIC LOGIC Propositional logic; Logical connectives; Truth tables; Normal forms (conjunctive and disjunctive); Validity; Predicate logic; Universal and existential quantification; Modus ponens and modus tollens; Limitations of predicate logic. PROOF TECHNIQUES Notions of implication, converse, inverse, contrapositive, negation, and contradiction; The structure of formal proofs; Direct proofs; Proof by counterexample; Proof by contraposition; Proof by contradiction; Mathematical induction; Strong induction; Recursive mathematical definitions; Well orderings. BASICS OF COUNTING Counting arguments Sum and product rule, Inclusion-exclusion principle, Arithmetic and geometric progressions, Fibonacci numbers; the pigeonhole principle; Permutations and combinations Basic definitions, Pascal s identity, and the binomial theorem; solving recurrence relations Common examples, The Master theorem GRAPHS AND TREES, DISCRETE PROBABILITY Trees; Undirected graphs; Directed graphs; Spanning trees; Traversal strategies Finite probability space, probability measure, events; Conditional probability, independence, Bayes theorem; Integer random variables, expectation. 1.Kolman and Busby, Discrete Mathematical Structures for Computer Science 1. J.P. Trembley and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw Hill 13th reprint (2001). 2. Richard Johnsonbaugh, Discrete Mathematics, 5th Edition, Pearson Education (2001). 3. S. Lipschutz and M. Lipson, Discrete Mathematics, Tata McGraw Hill, 2nd Edition (2000). 4. B.Kolman, R.C.Busby and S.C.Ross, Discrete Mathematical structures, 4th Edition, PHI(2002). 5. C.L.Liu, Elements of Discrete Mathematics, 2nd Edition, Tata McGraw Hill (2002). Written examinations, assignments, quizzes

Unit I
Unit II
Unit III
Unit IV
Unit V
Text Books
Reference Books
Mode of Evaluation
99
Course Code: ITE203 Course Prerequisites Objectives:
Theory of Computation MAT 106
L 3
T 1
P 0
C 4
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To provide an understanding of the basic concepts in theoretical computer science. To comprehend complex concepts and formal proofs in theoretical computer science in order to improve reasoning and problem solving skills. To prepare students for more advanced courses in automation theory, formal languages, algorithms & logic At the end of the course students should able to Understand the essence of computing through simple computational models; Apply these models in practice to solving problems in diverse areas such as pattern matching, cryptography, and language design; Understand the limitations of computing, the relative power of formal languages and the inherent complexity of many computational problems of practical importance; The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution AUTOMATA Strings, Alphabet, Language, Operations, Finite State Machine, definitions, finite automation model, acceptance of strings and languages, on deterministic finite automation, deterministic finite automation, equivalence between NFA and DFA, Conversion of NFA into DFA, minimization of FSM ,equivalence between two FSM's, Moore and Malay machines. REGULAR EXPRESSIONS Regular sets, regular expressions, identity rules, manipulation of regular expressions, equivalence between RE and FA, inter conversion, Pumping lemma, Closure properties of regular sets(proofs not required),regular grammars, right linear and left linear grammars equivalence between regular linear grammar and FA, inter conversion between RE and RG CONTEXT FREE GRAMMARS Context free Grammars, Derivation trees, Left Most Derivations, Right Most Derivations, Ambiguity in Context-Free Grammars, Specifications of Context Free Grammars, Normal Forms, Chomsky Normal Form (CNF), Greibach Normal Form (GNF) TURING MACHINE Turing machine, definition, model, design of TM, Computable Functions, recursive enumerable language, Churchs Hypothesis, Counter machine, types of TM's(Proofs not required). CLASSES OF PROBLEMS Chomsky hierarchy of languages, linear bounded automats and context sensitive language, Introduction to DCFL and DPDA,LR(O) Grammar, decidability of problems, Universal Turing Machine, undecidability of posts correspondence problem. Turing reducibility, definition of P and NP problems, NP complete and NP hard problems 1. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and Computation, Addison- Wesley, 2006. 2. Krishna Murthy E.V. "introduction to theory of Computer Science", Afiiliate Easte West Press 3. Lewis H.P. & Papadimition C.H. "Elements of Theory of Computation", Prentice Hall Written examinations, seminar, assignments, surprise tests and quizzes
Unit V
Text Books Mode of
100
Evaluation Course Code: MAT 203 Course Prerequisites Objectives:
Numerical Analysis MAT 106
L 3
T 0
P 0
C 3
To provide concepts of numerical methods that can cab used in many engineering applications On completion of this course student able to apply numerical algorithms concepts in engineering applications The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline SOLUTION OF EQUATIONS AND EIGEN VALUE PROBLEMS Iterative method, Newton Raphson method for single variable and for simultaneous equations with two variables. Solutions of a linear system by Gaussian, Gauss-Jordan, Jacobi and Gauss Seidel methods. Inverse of a matrix by Gauss Jordan method. Eigen value of a matrix by Power and Jacobi methods. INTERPOLATION Newtons divided difference formulae, Lagranges and Hermites polynomials. Newton forward and backward difference formulae. Stirlings and Bessels Central difference formulae NUMERICAL DIFFERENTIATION AND INTEGRATION Numerical differentiation with interpolation polynomials, Numerical integration by Trapezoidal and Simpsons (both 1/3rd and 3/8th) rules. Two and Three point Gaussian quadrature formula. Double integrals using Trapezoidal and Simpsons rule INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS Single step Methods Taylor Series, Euler and Modified Euler, Runge Kutta method of order four for first and second order differential equations. Multistep Methods-Milne and Adams Bashforth predictor and corrector methods. BOUNDARY VALUE PROBLEMS FOR ORDINARY AND PARTIAL DIFFERENTIAL EQUATIONS Finite difference solution for the second order ordinary differential equations. Finite difference solution for one dimensional heat equation (both implicit and explicit), Onedimensional wave equation and two-dimensional Laplace and Poisson equations. 1. Sastry, S.S., Introductory Methods of Numerical Analysis (Third Edition), Prentice Hall of India, New Delhi, 1998. 2. Kandasamy, P. Thilakavthy, K. and Gunavathy, K. Numerical Methods, S.Chand and Co., New Delhi , 1999. 3. Grewal B.S., Grewal J.S., Numerical Methods in Engineering and Science, Khanna Publishers, New Delhi, 1999. 4. Jain M.K., Iyengar S.R.K and Jain R.K., Numerical Methods for Engineering and Scientific Computation (Third Edition), New Age International (P) Ltd., New Delhi, 1995. 5. Gerald C.F., Wheatley P.O., Applied Numerical Analysis (Fifth Edition), Addison Wesley, Singapore, 1998. 6. Narayanan S., Manickavachakam Pillai K. and Ramanaiah G., Advanced Mathematics for Engineering Students-Vol.-III, S.Viswanathan Pvt. Ltd., Chennai, 1993. Written examinations, assignments and quizzes
Unit II
Unit III
Unit IV
Unit V
Text Books
Mode of Evaluation
101
Course Code: CHY 101 Course Prerequisites Objectives:
Engineering Chemistry Basic Chemistry at 12thStandard or equivalent level
L 2
T 1
P 2
C 4
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To impart technological aspects of modern chemistry To lay foundation for the application of chemistry in engineering and technology disciplines. At the end of the course, the students will be familiar with the fundamentals of water technology; corrosion and its control; applications of polymers in domestic and engineering areas; types of fuels and their applications; and recent trends in electrochemical energy storage devices. The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline d. An ability to function effectively on multi-disciplinary teams to accomplish a common goal Water Technology Hardness of water: Hard and soft water, Units of Hardness (numerical problems). Disadvantages of hard water: Scale and sludge, caustic embrittlement, priming and foaming, corrosion. Estimation of hardness: EDTA, alkali titration method (numerical problems). Softening methods: Lime soda (numerical problems), zeolite, ion exchange, mixed bed deionizer, treatment of municipal water. Desalination: Desalination of sea water, brakish water, electrodialysis, reverse osmosis. Corrosion & Corrosion Control Corrosion: Types and causes of corrosion, factors influencing corrosion, corrosion inhibitors. Corrosion control: Protective coatings, electroplating, metal finishing, physical vapour deposition, chemical vapour deposition. High energy coating processes: Ion implantation Polymers Classification of polymers: Thermoplastics, thermosetting plastics - properties and industrial applications of important thermoplastic, thermosetting plastics. Moulding of plastics into articles: Compression, injection, transfer and extrusion methods. Conducting polymers: Properties and applications - biodegradable polymers. Fuels and Combustion Fuels: Classification of fuels, calorific value - LCV, HCV; measurement of calorific value using bomb calorimeter (numerical problems). Combustion: Calculation of air qualities (problems). Liquid Fuels: Knocking and anti-knocking for petrol and diesel (octane number and cetane number) - diesel index. Gaseous fuels: LPG, natural gas, CNG: Composition and applications. Biofuels: Biodiesel and Biogas composition and applications. Electrochemical Energy systems Electrochemical energy systems: Basic concepts of electrochmical energy systems. Conventional primary batteries: Dry cell. Advanced primary batteries: Lithium and alkaline primary batteries. Conventional secondary batteries: Lead-acid, nickelcadmium secondary batteries. Advanced secondary batteries: Nickel-Metal hydride and lithium-ion secondary batteries. Fuel cells: Key issues Hydrogen-oxygen fuel cells - new generation fuel cells electric vehicle application solid oxide fuel cells. 1. P.C. Jain and M. Jain (2006), Engineering Chemistry, 15th Edition, Dhanpat Rai Publishing Co., New Delhi. 2. S.S. Dara (2006), A Text book of Engineering Chemistry, 11th Revised Edition, S. Chand & Co Ltd., New Delhi.
Unit V
Text Books
102
1. B.R. Puri and L.R. Sharma (2004), Principles of Physical Chemistry, 27th Edition, Vishal Publishing Co.2.J.C. Kuriacose and J. Rajaram (1996), Chemistry in Engineering and Technology, Vol. 1, Tata McGraw-Hill Publishing Company, New Delhi. 2 David Linden (2002), Hand Book of Batteries, 3rdEdition, McGraw Hill Publishers. Written examinations, seminar, assignments, surprise tests and quizzes
103
Course Code: EEE 101 Course Prerequisites Objectives:
Basic Electrical and Electronics Engineering Physics at +2 or equivalent level.
L 3
T 0
P 2
C 4
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To provide overview of electrical and electronics engineering that serve the foundation for advanced studies in the area of electrical and electronics engineering On completion of this course student able to understand the concepts of electrical and electronics engineering The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. Elementary Circuit Analysis Ohms law, KCL, KVL, node voltage analysis, mesh current, circuits with dependant and controlled sources, Thevenins & Nortons equivalent, maximum power transfer and superposition theorem, VI characteristics for capacitors and inductors Analysis of DC and AC Circuits Steady state DC analysis, RL and RC transients in circuits with DC source, analysis of a second order circuit with a DC source, RMS values, the use of phasors for constant frequency sinusoidal sources, steady state AC analysis of a series circuit, series and parallel combinations of complex impedances, AC power calculations. Digital Systems Basic logic circuit concepts, representation of numerical data in binary form - combinatorial logic circuits, synthesis of logic circuits, minimization of logic circuits - sequential logic circuits - computer organization, memory types, digital process control, computer based instrumentation systems, measurement concepts and sensors, signal conditioning, analog to digital conversion. Semiconductor Devices Basic diode concepts, zener diode voltage regulator concepts, ideal diode model, rectifier and wave-shaping circuits, linear small signal equivalent circuits, basic amplifier concepts, cascaded amplifiers, ideal amplifiers, differential amplifiers, NMOS and PMOS transistors, bias circuits, small signal equivalent circuits, CMOS logic gates, bipolar junction transistors, current and voltage relationship, common emitter characteristics, large signal DC circuit models, small signal equivalent circuits, ideal operational amplifiers, inverting and non-inverting amplifiers, integrators & differentiators. Electromechanics Magnetic fields and circuits, self and mutual inductance, ideal and real transformers, principles of rotating DC machines, shunt, separately excited and series connected DC motors, speed control of DC motors, 3-phase induction motors, synchronous machines and single phase induction motors, stepper motors and brushless DC motors. 1. Allan R. Hambley (2008),Electrical Engineering-Principles and Applications, Pearson Education. 2. D.P. Kothari and I.J. Nagrath (2002), Basic Electrical Engineering, 2nd Edition, Tata McGraw-Hill. 3. D.P. Kothari and I.J. Nagrath (1998), Theory and Problem of Basic Electrical Engineering, Prentice Hall of India, New Delhi. 4. R.A. DeCarlo and Pen-Min Lin (2001), Linear Circuit Analysis, 2ndEdition, Oxford University Press, New Delhi.
Unit V
Text Books
104
Mode of Evaluation
5. W.H. Hayt, J.E. Kemmerly and S.M. Durbin (2002),Engineering Circuit Analysis, 6thEdition, Tata McGraw-Hill, New Delhi. Assignments, seminars, written examinations
105
Course Code: ITE 101 Course Prerequisites Objectives:
Problem Solving Using C NONE To learn C Programming.
L 2
T 0
P 2
C 3
Expected Outcome:
The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution i. An ability to use current techniques, skills, and tools necessary for computing practice Overview of Problem Solving Introduction to Computer based Problem Solving-Program Design Topdown design and stepwise refinement, loops, basic programming constructs-Implementation IssuesProgramming Environment : Assemblers, compilers, interpreters, linkers, loaders Basic Algorithms Examples : Summation of set of numbers, sine function computation, Base Conversion, character to number conversion, Reversing digits of an integer, Square root of a number, Smallest divisor, generation of the Fibonacci sequence, Raising a number to a large power Fundamentals of C Programming Overview of C - Data types-Constants and Variables-Expressions and Operators-Decision making and Branching-Looping constructs-Basic Input/ Output operations Programming Constructs Arrays: One dimensional and multidimensional array Examples: Array order reversal, Removal of duplicates from an ordered array, Binary search, Matrix manipulations; Understanding of simple Pointers: Pointer arithmetic, pointer vs arrays functions. Structures: Declarations nested structures- array of structures - structure to functions unions- difference between structure and union. Functions and file handling Functions- Prototype declaration - arguments (formal and actual) return types types of functions; difference between built-in and user-defined functions; Recursion. Introduction to File handling in C : Opening, Closing, input / output. 1. R.G. Dromey, "How to Solve it by Computer", Prentice Hall of India, 1992. 2. Mitchell Waite & Stephen Prata, New Primer C plus, Waite Group. 1. B.W. Kernighan & D.M. Ritchie, "The C Programming Language", Prentice Hall of India, 1989. 2. Cooper, Mullish, "The Spirit of C", Jaico Publishing House, New Delhi, 1987. 3. Richard Johnson-Baugh & Martin Kalin, "Application Programming in C", Macmillan International editions, 1990. 4. Kenneth A.,C, "Problem Solving and Programming", Prentice Hall International Continuous Assessment (Quizzes, CATs, Assignments, etc.) and TEE
Unit I
Unit II
Unit III
Unit IV
Unit V
Text Books
106
Course Code: CSE105 Course Prerequisites Objectives:
PROGRAMMING FUNDAMENTALS Computer Programming and Problem Solving
L 3
T 1
P 0
C 4
Expected Outcome:
This course is designed to help the students understand the historical reasons and the need that gave rise to many different programming languages and their constructs. After completion of this course student able to understand the programming constructs of various languages. The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution i. An ability to use current techniques, skills, and tools necessary for computing practice FUNDAMENTAL PROGRAMMING CONSTRUCTS Basic syntax and semantics of a higher-level language, Variables, types, expressions, and assignment, Simple I/O, Conditional and iterative control structures, Functions and parameter passing, structured decomposition. ALGORITHMS AND PROBLEM-SOLVING Problem-solving strategies, The role of algorithms in the problem-solving process, Implementation strategies for algorithms, Debugging strategies, The concept and properties of algorithms. FUNDAMENTAL DATA STRUCTURES Primitive types, Arrays, Records, Strings and string processing, Data representation in memory, Static, stack, and heap allocation, Runtime storage management, Pointers and references, Linked structures, Implementation strategies for stacks, queues, and hash tables, Implementation strategies for graphs and trees, Strategies for choosing the right data structure. RECURSION The concept of recursion, Recursive mathematical functions, Simple recursive procedures, Divide-and-conquer strategies, Recursive backtracking, Implementation of recursion. EVENT-DRIVEN PROGRAMMING Event-handling methods, Event propagation, Exception handling. 1. S. Sahni, Data structures, algorithms, & applications in C++, McGraw-Hill. 2. R.W. Sebasta , Concepts of Programming Languages, Fifth Edition Addison Wesley, 2002 Continuous Assessment (Quizzes, CATs, Assignments, etc.) and TEE
Unit I
Unit II
Unit III
Unit IV
Unit V Text Books Mode of Evaluation
107
Object Oriented Programming Concepts ITE 101
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To introduce the salient features of Object Oriented Programming, with focus on generic programming with templates and Exception Handling Students will be able to know the fundamentals of object oriented programming and incorporate OOPs features such as inheritance, polymorphism and templates. The course also meets the following student outcomes: b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs i. An ability to use current techniques, skills, and tools necessary for computing practice Introduction to Fundamentals concepts Object oriented fundamentals- Structured versus object-oriented development, elements of object oriented programming, fundamentals of OO-class, object, and abstraction and its importance, encapsulation, polymorphism, benefits of OOP, structure of object oriented program Classes and Objects Working with classes- Classes and Objects- Class specification, class objects, accessing class members, defining member functions, inline functions, accessing member functions within class, data hiding, class member accessibility, empty classes, constructors, parameterized constructors, constructor overloading, copy constructor, new, delete operators, this pointer, friend classes and friend functions. Overloading Overloading-Function overloading, operator overloading- overloadable operators, unary operator overloading, operator keyword, limitations of increment/decrement operators, binary operator overloading, arithmetic operators, concatenation of strings, comparison operators, Generic programming with templates-Function templates, class templates Inheritance Inheritance- Base class and derived class relationship, derived class declaration, Forms of inheritance, inheritance and member accessibility, constructors in derived class, destructors in derived class, constructor invocation and data member initialization, data conversion, abstract classes, virtual base classes, virtual functions Exception handling and Files Files and Streams-Opening and Closing a file, file modes, file pointers and their manipulation, sequential access to a file, ASCII and binary files, random access to a file, error handling during file manipulations, Exception handling-exception handling model, exception handling constructs, lists of exceptions, catching exceptions, handling exceptions. 1. K.R.Venugopal, T.Ravishankar, and Rajkumar, "Mastering C++, Tata McGraw Hill, 1997 2. Herbert Schildt Java: The complete reference J2SE 5 Edition Tata McGraw-Hill , 2005 3. Bjarne stroustrup, The C++ programming Language, Addison Wesley, 3rd edition, 1988. 4. Cay S.Horstmann and Gray Carnell, Core Java Volume I Fundamentals, The sun Microsystems Press Jvava Series, 2000. Written examination / Assignments / Mini project
Unit V
Text Books
Mode of Evaluation
108
Object Oriented Programming in C++ Lab ITE 201
L 0
T 0
P 3
C 2
Expected Outcome:
To make the students learn object oriented way of solving problems. To teach the student to write programs in C++ to solve the problems At the end of the course students should able to Improve their programming skill. Apply the object oriented technology for application development The course also meets the following student outcomes: b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs i. An ability to use current techniques, skills, and tools necessary for computing practice j. An ability to use and apply current technical concepts and practices in the core information technologies 1. Program illustrating function overloading feature. 2. Programs illustrating the overloading of various operators Ex : Binary operators, Unary operators, New and delete operators etc. 3. Programs illustrating the use of following functions : a) Friend functions b) Inline functions c) Static Member functions d) Functions with default arguments. 4. Programs illustrating the use of destructor and the various types of constructors (no arguments, constructor, constructor with arguments, copy constructor etc). 5. Programs illustrating the various forms of inheritance : Ex. Single, Multiple, multilevel, hierarchical inheritance etc. 6. Write a program having student as on abstract class and create many derived classes such as Engg. Science, Medical, etc. from students class. Create their objects and process them. 7. Write a program illustrating the use of virtual functions. 8. Write a program which illustrates the use of virtual base class. 9. Write programs to illustrating file handling operations: Ex. a) Copying a text files b) Displaying the contents of the file etc. 10. Write programs illustrating how exceptions are handled (ex: division-by-zero, overflow and underflow in stack etc) CAT, Coding Practice, Observation Book, On-the-spot Exercises, and TEE
Exercises
Mode of Evaluation
109
Computer Architecture and Organization ITE 205
L 3
T 0
P 0
C 3
Expected Outcome:
To Gain an understanding of computer data representation and manipulation To understand the basic organization for data storage and access across various media. To provide knowledge of interfacing techniques and subsystem devices The students will be able to Understand number systems, instruction sets, addressing modes, and data/instruction formats. Write program using assembly language programming. Understand memory control, direct memory access, interrupts, and memory organization The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c.An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs
Unit I
Unit II
Unit III
Unit IV
FUNDAMENTALS OF COMPUTER ARCHITECTURE Organization of the von Neumann machine; Instruction formats; The fetch/execute types and addressing modes; Subroutine call and return mechanisms; Programming in assembly language; I/O techniques and interrupts; Other design issues COMPUTER ARITHMETIC Data Representation, Hardware and software implementation of arithmetic unit for common arithmetic operations: addition, subtraction, multiplication, division( Fixed point and floating point); Conversion between integer and real numbers; The generation of higher order functions from square roots to transcendental functions; Representation of nonnumeric data (character codes, graphical data); MEMORY SYSTEM ORGANIZATION AND ARCHITECTURE Memory systems hierarchy; Coding, data compression, and data integrity; Electronic, magnetic and optical technologies; Main memory organization, Types of Main memories, and its characteristics and performance; Latency, cycle time, bandwidth, and interleaving; Cache memories (address mapping, line size, replacement and write-back policies); Virtual memory systems; Reliability of memory systems; error detecting and error correcting systems. INTERFACING AND COMMUNICATION I/O fundamentals: handshaking, buffering; I/O techniques: programmed I/O, interruptdriven I/O, DMA; Interrupt structures: vectored and prioritized, interrupt overhead, interrupts and reentrant code; Buses: bus protocols, local and geographic arbitration. DEVICE SUBSYSTEMS External storage systems; organization and structure of disk drives and optical memory; Basic I/O controllers such as a keyboard and a mouse; RAID architectures; Video control; I/O Performance; SMART technology and fault detection; Processor to network interfaces. 1. J. L. Hennessy & D.A. Patterson, Computer architecture: A quantitative approach, Fourth Edition, Morgan Kaufman, 2004. 2. W. Stallings, Computer organization and architecture, Prentice-Hall,2000
Unit V
Text Books
110
Mode of Evaluation
3. M. M. Mano, Computer System Architecture, Prentice-Hall 4. J. P. Hayes, Computer system architecture, McGraw Hill Written examinations, seminar, assignments and quizzes
111
Operating Systems ITE204
L 3
T 0
P 0
C 3
Expected Outcome:
To provide a grand tour of the major operating system components. To impart knowledge of process, memory and device management To teach security issues related to OS. The students will be able to Understand how the operating system abstractions can be implemented Understand the principles of concurrency and synchronization, and apply them to write correct concurrent programs/software. Understand basic resource management techniques (scheduling or time management, space management) and how they can be implemented. Use Linux system, windows 2000 The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. FUNDAMENTALS Overview: Role and purpose of operating systems; history of operating system development; functionality of a typical operating system; design issues (efficiency, robustness, flexibility, portability, security, compatibility). Basic principles: Structuring methods; abstractions, processes, and resources; design of application programming interfaces (APIs); device organization; interrupts; user/system state transitions. PROCESS MANAGEMENT Scheduling: Preemptive and non-preemptive scheduling; scheduling policies; processes and threads; real-time issues; Concurrency: The idea of concurrent execution; states and state diagrams; implementation structures (ready lists, process control blocks, and so forth); dispatching and context switching; interrupt handling in a concurrent environment; Mutual exclusion: Definition of the mutual exclusion problem; deadlock detection and prevention; solution strategies; models and mechanisms (semaphores, monitors, condition variables, rendezvous); producer-consumer problems; synchronization; multiprocessor issues. MEMORY MANAGEMENT Review of physical memory and memory management hardware; overlays, swapping, and partitions; paging and segmentation; page placement and replacement policies; working sets and thrashing; caching SECONDARY STORAGE MANAGEMENT Device management: Characteristics of serial and parallel devices; abstracting device differences; buffering strategies; direct memory access; recovery from failures. File systems: Fundamental concepts (data, metadata, operations, organization, buffering, sequential vs. nonsequential files); content and structure of directories; file system techniques (partitioning, mounting and unmounting, virtual file systems); memory-mapped files; special-purpose file systems; naming, searching, and access; backup strategies. 1. A. Silberschatz, P.B. Galvin & G. Gagne, Operating system concepts, John Wiley,2005 2. W. Stallings, Operating systems, Prentice-Hall,2005 Written examinations, seminar, assignments, and quizzes
Unit I
Unit II
Unit III
Unit IV
Text Books Mode of
112
Evaluation Course Code: ITE 209 Course Prerequisites Objectives:
Operating Systems Lab ITE208
L 0
T 0
P 3
C 2
Expected Outcome:
To implement the basic resource management technique [Processor, Memory] To design and implement synchronization, concurrency related problems The students will be able to Simulate the principles of resource management [Processor, Memory] Install and use operating systems [Windows, Linux etc.,] The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs h. Recognition of the need for and an ability to engage in continuing professional development i. An ability to use current techniques, skills, and tools necessary for computing practice j. An ability to use and apply current technical concepts and practices in the core information technologies Program to report the behavior of the OS to get the CPU type and model, kernal version. 2. Program to get the amount of memory configured into the computer, amount of memory currently available. 3. Implement the various process scheduling mechanisms such as FCFS, SJF, Priority, round robin. 4. Implement the solution for reader writers problem. 5. Implement the solution for dining philosophers problem. 6. Implement bankers algorithm. 7. Implement the first fit; best fit and worst fit file allocation strategy. 8. Write a program to create processes and threads. 9. Write a program that uses a waitable timer to stop itself K. Sec. After it started where K is a command line parameter. CAT, Coding Practice, Observation Book, On-the-spot Exercises, and TEE
Exercises
Mode of Evaluation
113
Data Communication and Computer Networks ITE 208
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To study the foundational principles, architectures, and techniques employed in computer networks. To study the concepts of communication networks, protocols and their performance Students shall be able to Understand about working of Intranet, LAN, WAN, MAN setups, different topologies. Gain familiarity with common networking protocols and algorithms Implement network protocols and analyze its performance The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs INTRODUCTION TO COMPUTER NETWORKS Networking principles; switching - circuit switching, packet switching, frame relay, cell switching, multiple access. COMMUNICATIONS NETWORK PROTOCOLS Network protocol (syntax, semantics, and timing); Protocol suites (OSI and TCP/IP); Layered protocol software (stacks): Physical layer networking concepts; data link layer concepts; network layer concepts; transport and application layer concepts; Network Standards and standardization bodies. LOCAL AND WIDE AREA NETWORKS LAN topologies (bus, ring, star), LAN technologies (Ethernet, token Ring, Gigabit Ethernet), Error detection and correction, Carrier sense multiple access networks (CSMA), Large networks and wide areas, Protocols (addressing, congestion control, virtual circuits, quality of service). Internet - addressing, routing, end point control; Internet protocols - IP, TCP, UDP, ICMP, HTTP, CIDR ROUTING AND CONGESTION CONTROL ALGORITHMS Flooding; Minimal spanning trees; Bellman Ford, Dijkstra's, OSPF, BGP shortest path algorithms; The leaky bucket, floyd warshall and Random Early Detection congestion methods; Data security and integrity: Fundamentals of secure networks; cryptography; Encryption and privacy: Public key, private key, symmetric key; Authentication protocols; Packet filtering; Firewalls; Virtual private networks; Transport layer security NETWORK MANAGEMENT AND PERFORMANCE ANALYSIS OF NETWORKS Overview of the issues of network management; Domain names and name services; Issues for Internet service providers (ISPs); Quality of service issues: performance, failure recovery. 1. W. Stallings, Data & Computer Communications, Prentice-Hall, 2005. 2. A. S. Tanenbaum, Computer networks, Prentice-Hall,2005. 3. Behrouz A Forouzan, Data Communications and Networking, Tata Mc-grawhill, 2007. 4. I. Mitrani, Modelling of Computer and Communication Systems, Cambridge, 1987. 5. J.Walrand and P.Varaiya, High Performance Communication Networks, Harcourt Asia (Morgan Kaufmann), 2000. 6. J.F.Kurose and K.W.Ross, Computer Networking: A Top-Down Approach Featuring the Internet, Pearson Education, 2001. 7. D. E. Comer and D.L. Stevens, Internetworking with TCP/IP, Vol.1, Prentice-Hall Written examinations, seminar, assignments, and quizzes
Unit V
Text Books
Mode of
114
Evaluation Course Code: ITE 304 Course Prerequisites Objectives:
Computer Networks Lab ITE 303
L 0
T 0
P 3
C 2
Expected Outcome:
To write programs to configure LAN,WAN To analyze protocols and their performance Students shall be able to Implement network protocols and analyze its performance. Configure Networks. The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs h. Recognition of the need for and an ability to engage in continuing professional development j. An ability to use and apply current technical concepts and practices in the core information technologies 1. Write a program to display the servers date and time details at the client end. 2. Write a program to display the clients address at the server end. 3. Write a program to implement an echo UDP server. 4. Write a program to develop a simple Chat TCP and UDP application. 5. Write a program to capture each packet and to examine its checksum field. 6. Network layer concepts; to be done with only computer a. Configuration of IP addresses b. Configuration of Subnet mask c. Configuration of Gateway d. Setting up LAN e. Connecting two or more different LAN with different subnet mask f. Making computer to work like router/gateway with the help of IP address 7. Protocol analyzer using ethereal a. Capturing and analyzing Ethernet frames b. HTTP GET/response interaction c. Analysis of ICMP and Ping d. Analysis of ICMP and Traceroute e. Capturing a bulk TCP transfer from your computer to a remote server 8. Additional activities (Optional) a. Compute checksum fields using CRC-12 and examine the same during the frame transmission. b. Implementation of sliding window protocol as part of DLC. c. IPv4 and IPv6 protocol testing and implementation. d. TCP and UDP protocol testing and implementation. e. SNMP implementation f. SMTP implementation g. RSA public key and private key encryption and decryption h. Data compression using Huffman codes. CAT, Coding Practice, Observation Book, On-the-spot Exercises, and TEE
Exercises
Mode of Evaluation
115
Database Systems ITE 208
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV Unit V
To teach role of data, files and databases in information systems. To impart knowledge of data modeling techniques. To provide the fundamentals of front-end and back-end of databases The students will be able to Understand fundamental concepts of database management system, database modeling, design, SQL, PL/SQL, and system implementation techniques. Model and implement database applications Understand transaction processing of Databases The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs i. An ability to use current techniques, skills, and tools necessary for computing practice k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems l. An ability to effectively integrate IT-based solutions into the user environment DATABASE SYSTEMS History and motivation for database systems; components of database systems; DBMS functions; database architecture and data independence DATA MODELING Data modeling; conceptual models; object-oriented model; relational data model.; Database query languages: Overview of database languages; SQL; query optimization; 4th-generation environments; embedding non-procedural queries in a procedural language; introduction to Object Query Language. RELATIONAL DATABASES Mapping conceptual schema to a relational schema; entity and referential integrity; relational algebra and relational calculus; Relational database design: Database design; functional dependency; normal forms; multivalued dependency; join dependency; representation theory TRANSACTION PROCESSING Transactions; failure and recovery; concurrency control PHYSICAL DATABASE DESIGN Storage and file structure; indexed files; hashed files; signature files; b-trees; files with dense index; files with variable length records; database efficiency and tuning. 1. A. Silberschatz, H. F. Korth & S. Sudershan, Database system concepts, McGraw Hill, 4th Edition 2002. 2. R. Elmasri & S. B. Navathe, Fundamentals of database systems, Addison Wesley, 2005. 3. C. J. Date, An introduction to database systems, Addison Wesley,2003. 4. H. Garcia et al., Database system implementation, Prentice Hall Written examinations, seminar, assignments, and quizzes
Text Books Mode of Evaluation
116
Software Engineering Principles and Practices ITE 301
L 3
T 0
P 0
C 3
Expected Outcome:
To teach the concepts of process, product and project To elucidate the knowledge of requirement analysis To provide the knowledge of software design and testing To introduce the project management techniques The students will be able to Perform Requirement analysis. Write Software Requirement Specification. Model software system Perform Testing on the developed software The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems l. An ability to effectively integrate IT-based solutions into the user environment m. An understanding of best practices and standards and their application n. An ability to assist in the creation of an effective project plan FUNDAMENTALS OF SE AND REQUIREMENT ENGINEERING Software Engineering Fundamentals; Software processes: Software life-cycle and process models; Process assessment models; Overview of Project Management activities; Software requirements and specifications: Requirements elicitation; Requirements analysis modeling techniques; Functional and nonfunctional requirements; User requirements, System requirements, requirement validation and software requirement specification document. Prototyping - Basic concepts of formal specification techniques. SOFTWARE DESIGN Fundamental design concepts and principles; Design characteristics; System ModelsContext, Behavioral, Data and, Object models, Architectural design- System structuring, Control models; Structured design; Object-oriented analysis and design; User interface design; Design for reuse; Design patterns; SOFTWARE VALIDATION AND MAINTENANCE Software validation: Validation planning; Testing fundamentals, including test plan creation and test case generation; Black-box and white-box testing techniques; Unit, integration, validation, and system testing; Object-oriented testing; Inspections. Software evolution: Software maintenance; Characteristics of maintainable software; Reengineering; Legacy systems; Software reuse. SOFTWARE PROJECT MANAGEMENT Team management Team processes, Team organization and decision-making, Roles and responsibilities in a software team, Role identification and assignment, Project tracking, Team problem resolution; Project planning and scheduling; Software measurement and estimation techniques; Risk analysis and management;
Unit I
Unit II
Unit III
Unit IV
117
Unit V
Software quality assurance; Software configuration management; SOFTWARE QUALITY PROCESS IMPROVEMENT Overview of Quality management and Process Improvement; Overview of SEICMM, ISO 9000, CMMI, PCMM, TQM and Six Sigma; overview of CASE tools. Software tools and environments: Programming environments; Project management tools; Requirements analysis and design modeling tools; testing tools; Configuration management tools; 1. R. S. Pressman, Software Engineering, a practitioners approach, McGraw Hill, 2006 2. Ian Sommerville, "Software Engineering", Sixth Edition, Addison-Wesley, 2004 Written examinations, seminar, assignments and quizzes
118
Human Computer Interaction EEE 101
L 3
T 0
P 0
C 3
Expected Outcome:
To introduce the fundamentals of user interface design To teach of concepts and guidelines of user interface The students will be able to Understand the Human Computer Interaction. Design an effective user interface for software application The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice j. An ability to use and apply current technical concepts and practices in the core information technologies k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems l. An ability to effectively integrate IT-based solutions into the user environment FOUNDATIONS OF HUMAN-COMPUTER INTERACTION Motivation; contexts for HCI (tools, web hypermedia, communication); human centered development and evaluation; human performance models: perception, movement, and cognition; human performance models: culture, communication, and organizations; accommodating human diversity; principles of good design and good designers; engineering tradeoffs; introduction to usability testing. HUMAN-CENTERED SOFTWARE EVALUATION Setting goals for evaluation; evaluation without users: walkthroughs, KLM, guidelines, and standards; evaluation with users: usability testing, interview, survey, experiment HUMAN-CENTERED SOFTWARE DEVELOPMENT Approaches, characteristics, and overview of process; functionality and usability: task analysis, interviews, surveys; specifying interaction and presentation; prototyping techniques and tools paper storyboards, Inheritance and dynamic dispatch, Prototyping languages and GUI builders. GRAPHICAL USER-INTERFACE DESIGN Principles of graphical user interfaces, GUI toolkits; Choosing interaction styles and interaction techniques; HCI aspects of common widgets; HCI aspects of screen design: layout, color, fonts, labeling; handling human failure; beyond simple screen design: visualization, representation, metaphor; multi-modal interaction: graphics, sound, and haptics; 3D interaction and virtual reality HCI ASPECTS OF MULTIMEDIA SYSTEMS Categorization and architectures of information : hierarchies, hypermedia; information retrieval and human performance Web search, Usability of database query language, Graphics, Sound; HCI design of multimedia information systems; speech recognition and natural language processing; information appliances and mobile computing. 1. Ben Schneiderman, Designing the User Interface ", Addison Wesley, 2000. 2. Jacob Nielsen, Usability Engineering ", Academic Press, 1993.
Unit I
Unit II
Unit III
Unit IV
Unit V
Text Books
119
Mode of Evaluation
3. Alan Dix et al, Human - Computer Interaction ", Prentice Hall, 1993. 4. Alan Cooper, The Essentials of User Interface Design ", IDG Books, 1995. Written examination / Assignments / Mini project
120
Network Administration ITE 311
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To cover various aspects of networks system administration such as plan and design of an efficient community of computers, tools and systems for monitoring and managing network systems. The students would be able to understand and use various principles and practices of managing and administering networked systems. The course also meets the following student outcomes: b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution i. An ability to use current techniques, skills, and tools necessary for computing practice k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems INTRODUCTION Introduction, System Components, Networked Communities, Host Management, User Management MODELS OF NETWORK & SYSTEM ADMINISTRATION Configuration and Maintenance, Diagnostics, Fault & Change Management. SNMP Overview, Installing, Using & Maintaining SNMP Tools SERVICES Application Level Services, Network Level Services, Principles of Security, Security Implications, Analytical System Administration OPEN SOURCE TOOTS FOR NETWORK ADMINISTRATION Open Source and Network Administration, Open Source Tools, Environment & Background, Terminology & Conventions, Overview of Service Monitoring, Installing, Using, Configuring & Maintaining Sysmon NETWORK MANAGEMENT Overview of Open Source Tools for Network Administration MRTG, Neo, NetFlow, Oak, Tcpdump; Over view of Basic TCP/IP tools - Ping, Telnet, Netcat, Traceroute, MTR, Netstat; Over view of Custom Tools - Basics of Scripting, Bourne Shell, Programming Monitors, Running Programs from Cron. 1. Mark Burgess, "Principles of Network and System Administration", John Wiley & Sons, 2004 2. Mani Subramanian, Network Management Principles & Practice, Pearson Education, 2003. 3. Behrouz A Forouzan, Data Communications and Networking, Tata Mc-grawhill, 2007. 4. J.Walrand and P.Varaiya, High Performance Communication Networks, Harcourt Asia (Morgan Kaufmann), 2000. 5. J.F.Kurose and K.W.Ross, Computer Networking: A Top-Down Approach Featuring the Internet, Pearson Education, 2001. Written examinations, seminar, assignments and quizzes.
Unit V
Text Books
Mode of Evaluation
121
Course Code: MEE 101 Course Prerequisites Objectives:
Engineering Graphics NONE
L 0
T 0
P 4
C 2
Expected Outcome:
To create an awareness and emphasise the need for Engineering Graphics. To teach basic drawing standards and conventions. To develop skills in three-dimensional visualization of engineering components. To develop an understanding of 2D and 3D drawings using the Solidworks software On completion of this course, the students will be able to prepare drawings as per standards (BIS). solve specific geometrical problems in plane geometry involving lines, plane figures and special curves. produce orthographic projection of engineering components working from pictorial drawings. Prepare 2D Drawings using the Solidworks software. The course also meets the following student outcomes: d. An ability to function effectively on multi-disciplinary teams to accomplish a common goal. Introduction to engineering graphics geometrical construction conics and special curves free hand sketching dimensioning principles orthographic projection projection of points, lines and solids in simple position only detailed views of simple 3D objects. 1. N.D. Bhatt (1998), Engineering Drawing, Charotar Publishing House. 2 French and Vierk (2002), Fundamentals of Engineering Drawing, McGraw-Hill. 3. K.V. Natarajan (2006), Engineering Graphics, Dhanalakshmi Publishers. 4. CAD Manual prepared by VIT Faculty. Assignments, exercises and examinations
122
Course Code: MEE 102 Course Prerequisites Objectives:
Workshop Practice NONE
L 0
T 0
P 2
C 1
Expected Outcome: Exercises
To train the students in handling tools, equipment and machinery with safety. To impart skill in fabricating simple components using sheet metal. To cultivate safety aspects in handling of tools and equipment On completion of this course, the students will be able to welding and soldering operations. Fabrication of simple sheet metal parts. The course also meets the following student outcomes: d.An ability to function effectively on multi-disciplinary teams to accomplish a common goal. WELDING EXERCISES Introduction to BI Standards and reading of welding drawings. Butt Joint Lap Joint TIG Welding MIG Welding SHEET METAL EXERCISES Making of Cube Making of Cone using development of surface. Making of control panel using development of surface. SOLDERING EXERCISES Soldering and desoldering of resistor in PCB. Soldering and desoldering of IC in PCB. Soldering and desoldering of capacitor in PCB. BOSCH TOOLS DEMONSTRATION Demonstration of all Bosch tools. Introduction to TIG, MIG welding. Aluminum welding - submerged and arc welding, wave soldering.
123
Data Structures and Algorithms ITE 101
L 3
T 1
P 0
C 4
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To understand pointer concept in C and related library functions To study linear and non-linear data structures To master sorting and searching techniques and study their efficiencies Understanding of data structures, pointers in C, and algorithms The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice Introduction to Algorithm Analysis Algorithmic Analysis Algorithmic notation, Space-time analysis of an algorithm Notations for algorithmic analysis Examples for algorithm analysis Fundamental algorithms, Factoring methods, Pattern searching Linear Data Structures Array of structures Stacks, Application of stacks Queues, Application of queues Simulation Priority queues Linked Data Structures Review of pointers Pointers and linked allocation Linked lists, Circular lists, Linked implementation of Stack and Queue Sorting and Searching Selection sort, Bubble sort, Insertion sort, Quick sort, Shell sort, Merge short, Radix sort, Heap sort Searching techniques: Sequential search, Binary search, Hash table methods Hashing functions Sorting and Searching efficiencies Non-linear Data Structures Trees Binary Tree, Tree traversals, Expression and search trees, AVL Tree - Graphs and their representation: BFS, DFS Shortest Path Algorithms Dijkstra's Algorithm Concept of algorithm design 1. Jean Paul Tremblay and Paul G. Sorenson, An introduction to data structures with applications 2nd edition, Tata McGraw-Hill, 2001 2. Gilberg and Ferouzan, Data Structures using C, Pearson Education 2004 3. L. Kruse, et al, Data Structures and Program Design in C, PHI 1. Sartaj Sahni, Data structures, Algorithms and Applications in Java, McG-Hill 2. Robert Sedgewick, Algorithms in C++, Third edition, Addison Wesley 3. John R.Hubbard, Schaums Outline of Theory and Problems of Data Structure with C++, McGraw-Hill, New Delhi, 2000 CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
Text Books
124
Data Structures and Algorithms Lab ITE 103
L 0
T 0
P 3
C 2
Expected Outcome:
To use pointers in C programs To practice linear and non-linear data structures programs To code and understand sorting and searching techniques Implementation of algorithms and data structures, sorting and searching The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice j. An ability to use and apply current technical concepts and practices in the core information technologies 1. Programs using dynamically allocated 1-, 2-, 3-D arrays - using pointers 2. Creation and manipulation of binary files and text files 3. Implementing string-handling functions 4. Implementing stack using array and linked list 5. Implementing queue using array and linked list 6. Coding for priority queue 7. Defining binary tree and using it for different operations 8. Creating linked list structure and coding insertion, deletion, and reading of items 9. Coding to create a graph and writing functions for traversals, detection, and implementation of Dijikstras algorithm 10. Coding for merge-sort of two files data 11. Sorting file records by quicksort 12. Developing stack data structure for expression conversion and Towers of Hanoi 13. Implementing sorting algorithms 14. Implementing searching algorithms linear and binary 15. Developing hash data structure and testing for various operations CAT, Coding Practice, Observation Book, On-the-spot Exercises, and TEE
Exercises
Mode of Evaluation
125
Programming in Java ITE201
L 3
T 0
P 0
C 3
Expected Outcome:
To learn Java language syntax and programming with Java To do O-O programming with Java and Exception Handling To learn making use of packages and interfaces To code GUI programs Programming application with Java programming language The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice
Unit I
Unit II
Unit III
Unit IV
Java Programming Language Introduction To Java: Features Of Java Application Java Programming Structure Data Types Tokens Keywords Operators Constants Statements Simple Java Program Execution Environment Garbage Collection OOP with Java I Preview Of Oops Concepts - Class Objects Methods Nested Class Constructor finalizer Access Control -I/O Streams String String Buffer Vector Wrapper Class static final this Keyword OOP with Java II Inheritance: Types Of Inheritance Polymorphism Method Overloading super Method Overriding Exception Handling File and I/O Streams Interfaces, Packages and Threads Java Interfaces, Packages, And Threads: Interfaces Interface Design Packages Package Hierarchy Threads Programming And Handling Multi-Thread Programming GUI Programming Java GUI: Basic elements of AWT - Applet programming Basic elements of Swing Front-end design Events Handling Basics of JDBC 1. The Java Programming Language 3e, Ken Arnold, James Gosling, David Holmes, A-W 2. Core Java Vol I Fundamental, CS. Horstmann, G. Cornell, Sun 3. Beginning Java 2/5, Ivor Horton, Wrox 1. Java The Complete Reference 4e, P. Naughton, H. Schildt, Tata McGraw-Hill 2. http://java.sun.com/docs/books/tutorial 3. Java How to Program, Deitel & Deitel, PH-India 4. Professional Java, Richarson, et al, Wrox 5. Core Swing Advanced Programming, Kim Topley, Pearson Continuous Assessment Test, Quiz, Assignment, and TEE
Unit V
Text Books
126
Digital Electronics and Microprocessors EEE101
L 3
T 0
P 0
C 3
Unit II
Unit III
Unit IV
To learn logic circuits and converters To introduce the components of a digital system To understand microprocessor architecture and assembler instruction formats Understanding digital electronics and circuits, computers and microprocessors The course also meets the following student outcomes: c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice Combinational Logic Circuits Review of number systems - Logic gates: NAND, NOR gate as universal building blocks Simplification of four-variable Boolean equations using Karnaugh maps - Half adder, Full adder, Half subtractor, Full subtractor - 4-bit parallel adder and subtractor - 3-bit binary decoder Decimal to BCD encoder 8-to-1 multiplexer, 1-to-8 Demultiplxer Sequential Logic Circuits Flip-flops: SR flip-flop, Edge-triggered flip-flops (SR,D,JK and T), Master-slave JK flip-flop - 4-bit binary asynchronous and synchronous counter - Decade counter (asynchronous and synchronous) - Shift registers (SISO,SIPO,PISO,PIPO) - Ring counter Memories (RAM, ROM, EPROM, FLASH) D/A and A/D Converters Ladder type D/A converter - Dual slope A/D converter - Successive approximation A/D converter - Study of DAC0800 and ADC0809 chips The 8086 Microprocessor Architecture and Instruction Set Pin diagram - CPU architecture - Memory segmentation - Internal operations - Addressing modes Instruction formats - Assembler instruction formats: Data transfer instructions, Arithmetic instructions, Logical instructions, Branch-and-loop instructions Interrupts: Software and Hardware interrupts, Software interrupt programming Peripheral Chips 8255 (PPI), 8254 (Timer), 8257 (DMA), 8259 (PIC), 8251 (USART) 1. Thomas L Floyd, Digital Fundamentals, Universal Books, New Delhi 2. Douglas V. Hall, Microprocessors and Interfacing, TMH 1. Yu-Cheng Liu, Glenn A. Gibson, Microcomputer Systems: The 8086/8088 Family, PHI 2. Barry B. Brey, Microprocessors and Peripherals, CBS Publishers & Distributors, Delhi 3. R.K. Gaur, Digital Electronics and Microcomputers CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V Text Books Reference Books Mode of Evaluation
127
Digital Electronics and Microprocessors Lab ITE205
L 0
T 0
P 4
C 2
Expected Outcome:
To understand logic gates and circuits To design sequential and combinational circuits To program microprocessors for simple math functions To program microprocessors for data sorting and moving To design interfaces Designing digital electronics components Programming microprocessors The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. I. Digital Electronics 1. Study of Logic Gates Logic gates using discrete components Verification of truth table for AND, OR, NOT, NAND, NOR and XOR gates Realization of NAND and NOR gates 2. Implementation of Logic Circuits Verification of Boolean laws Verification of DeMorgans law 3. Adder and Subtractor Implementation of Half-Adder and Full-Adder Implementation of Half-Subtractor and Full-Subtractor 4. Combinational Circuit Design Design of Decoder and Encoder Design of Code Converter Design of multiplexers and de multiplexers 5. Sequential Circuit Design Implementation of Shift registers, Serial Transfer Ring Counter 4-bit Binary Counter BCD Counter II. Microprocessors 6. Study of 8086, 8255, 8253, 8279, 8259 7. ALP Arithmetic programming a) Write an ALP to find out factorial of a given hexadecimal number using 8086 MP Data: OAH, OFH, 1OH b) Write an ALP to perform 16 bit arithmetic operations (ADD, SUB, MUL, DIV) c) Write an ALP to generate the sum of first N natural numbers using 8086 MP d) Write an ALP to convert given hexadecimal number to binary using 8086 MP Data: ABH, CDH, 101H 8. Number system conversion Write an ALP to convert given binary number to hexadecimal number using 8086 MP Data: 101010102, 111111112, 11002, 11112 9. Sorting and Data Movement a) Write an ALP to order give set of hexadecimal numbers in ascending and descending order
Exercises
128
Mode of Evaluation
Data: 0AH, 0FH, 0DH, 10H, 02H b) Write an ALP to move block of data from locations 1200H-1205H to 2200H 2205H c) Write an ALP to reverse the given string Data: WELCOME d) Write an ALP to generate the following series 1+1/x+1/x3+1/x5+ .. 10. Wave generator a) Write an ALP to generate square wave using 8255 PPI b) Write an ALP to generate rate generator using 8253 PIT 11. Keyboard interfacing a) Write an ALP to interface keyboard with 8086 using 8279 PKI b) Write an ALP to display the given message using 8279 PKI Message: INFORMATION TECHNOLOGY c) Write an ALP to interface analog to digital converter. CAT, Design Practice, Reports, Observation Book, TEE
129
Computer Graphics and Multimedia ITE207
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To study the graphics techniques and algorithms. To study the multimedia concepts and various I/O technologies. To enable the students to develop their creativity The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice. l. An ability to effectively integrate IT-based solutions into the user environment OUTPUT PRIMITIVES Introduction - Line - Curve and Ellipse Algorithms Attributes Two-Dimensional Geometric Transformations Two-Dimensional Viewing THREE-DIMENSIONAL CONCEPTS Three-Dimensional Object Representations Three-Dimensional Geometric and Modeling Transformations Three-Dimensional Viewing Color models Animation MULTIMEDIA SYSTEMS DESIGN An Introduction Multimedia applications Multimedia System Architecture Evolving technologies for Multimedia Defining objects for Multimedia systems Multimedia Data interface standards Multimedia Databases MULTIMEDIA FILE HANDLING Compression & Decompression Data & File Format standards Multimedia I/O technologies - Digital voice and audio video image and animation Full motion video Storage and retrieval Technologies. HYPERMEDIA Multimedia Authoring & User Interface Hypermedia messaging - Mobile Messaging Hypermedia message component creating Hypermedia message Integrated multimedia message standards Integrated Document management Distributed Multimedia Systems. 1. Donald Hearn and M.Pauline Baker, Computer Graphics C Version, Pearson Education, 2003. (UNITI : Chapters1 to 6;UNIT2:Chapter9 12, 15, 16) 2. Prabat K Andleigh and Kiran Thakrar, Multimedia Systems and Design, PHI, 2003.(UNIT3to5) 1. Judith Jeffcoate, Multimedia in practice technology and Applications, PHI,1998. 2. Foley, Vandam, Feiner, Huges, Computer Graphics: Principles & Practice, PearsonEducation, second edition2003. CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
Text Books
130
Object Oriented Analysis and Design ITE201
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
The students would be able to understand the techniques, applications and UML based object oriented analysis and design. The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems l. An ability to effectively integrate IT-based solutions into the user environment n. An ability to assist in the creation of an effective project plan Complexity of software Structure of complex systems, decomposing complexity, Designing complex systems, Object Model: Evolution, Elements of object model, Applying object model Elements of Notation Class diagrams, state transition diagrams, object diagrams, Interaction diagrams, module diagrams, process diagrams, applying the notation. Principles, micro development process, macro development process. Management and planning Staffing, Release management, Reuse, Quality Assurance and Metrics, Documentation, Tools, Benefits and Risks of Object Oriented development Introduction to Object-Oriented Paradigm and UML Unified Process, the Requirement Workflow, Object-Oriented Analysis Workflow, ObjectOriented Design Workflow, Workflow and phases of the Unified process. Analysis and Design Case studies, Teams, Testing, Management Issues, Planning and Estimating, Maintenance, User Interface system, Introduction to Web Based Systems 1. Schach, Stephen R., "An Introduction to Object-Oriented Systems Analysis and Design with UML and the Unified Process", Tata McGraw Hill, 2003 2. Grady Booch, "Object Oriented Analysis and Design with applications", Addison Wesley, 1994. CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
131
Network Programming ITE303
L 3
T 0
P 2
C 4
Unit II
Unit III
Unit IV
The students shall be able to learn JAVA programming to share data across Internet for File transfer, Software updates etc., and accomplish many Network programming tasks. The course meets the following student outcomes: c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice. l. An ability to effectively integrate IT-based solutions into the user environment Introduction Why networked Java What can a network program do, Security Basic network concepts: Networks, The layers of a network, IP,TCP and UDP, The Internet, The client/server model, Internet Standards, Basic Web concepts: URLs, HTML, SGML, and XML, HTTP,MIME Media types, Server Side Programs Threads Running Threads, Returning Information from a Thread, Synchronization, Deadlock, Thread scheduling, Thread pools, Looking Up Internet Addresses: The InetAddress Class,Inet4Address and Inet6Address,The Network Interface Class, Some useful programs, URLs: The URL class, URL encoder and URL decoder Classes, URL class, Proxies, communicating with Server Side Programs Through GET, Accessing Password-Protected Sites. Sockets for Clients Socket Basics, Investigating Protocols with Telnet, The Socket Class, Socket Exceptions, Socket Addresses, Examples, Sockets For Servers: The Server Socket Class, Some Useful Servers, Secure Sockets: Secure Communications, Creating Secure Client Sockets, Methods of SSLSocket Class, Creating Secure Server Sockets, Methods of the SSLServerSocket Class. UDP Datagrams and Sockets The UDP protocol, The Datagram Packet Class, The Datagram Socket Class, Some useful Applications, Datagram Channel, URLConnections: Opening URL Connections, Reading Data from a server, Reading the Header, Configuring the Connection, Configuring the Client Request HTTP Header, Writing Data to a server, Content Handlers, The Object Methods, Security Considerations for URLConnections, Guessing MIME Content Types, HttpURLConnection, Caches, JAR URLConnection. Remote Method Invocation What is RMI? Implementation, Loading Classes at Runtime, the java.rmi Package, the java.rmi.registry Package, the java.rmi.server Package, The JavaMailAPI: What are Java Mail API, Sending Email, Receiving Email, Password Authentication, Addresses, The URLName Class, The Message Class, the Path Interface, Multipath Messages and File Attachments, MIME messages, Folders. 1. Elliotte Rusty Harold JAVA Network Programming 3rd Edition published by Sharoff Publishers and Distributors Pvt. Ltd, Mumbai, 2005. 1. David Reilly, Michael Reilly. "Java Network Programming & Distributed Computing", Published by Addison-Wesley. ISBN: 0201710374 CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
132
Course Code: ITE404 Course Prerequisites Objectives:
Data Warehousing and Data Mining ITE302
L 3
T 0
P 0
C 3
Unit II
Unit III
Unit IV
To make familiar with the various concepts of data warehousing like meta data, data mart, summary table, fact data and dimension data. To sail along with the various approaches in data mining. To familiarize with the various data warehousing and data mining tools The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. d. An ability to function effectively on multi-disciplinary teams to accomplish a common goal. i. An ability to use current techniques, skills, and tools necessary for computing practice. Data Warehouse and OLAP Technology for Data mining Introduction to Data Warehouse- A multidimensional Data Model Data Warehouse architecture Data preprocessing- Data cleaning Data integration and Transformation. Data Mining Introduction Introduction to Data Mining Data Mining Functionalities Classification of Data Mining systems, Major issues in Data mining. Data Mining primitives, languages & system architecture Data Mining primitives: Task relevant data kind of knowledge to be mined Background knowledge interestingness measures presentation & visualization of discovered pattern Data Mining Query language Designing Graphical User interfaces based on DMQL - Architecture of Data mining. Association Rule Mining Basic concepts market basket analysis - Mining single dimensional Boolean association rules from transactional databases. Classification & prediction: Whats classification - issues regarding classification and prediction Bayesian classification prediction: linear non linear. Cluster analysis Types of Data in cluster analysis - Major clustering methods. Data mining applications 1. Han J. & Kambler, M, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2005. 1. Immon.W.H., Building the Data Warehouse, Wiley Dream Tech, 3rd Edition, 2003. 2. Anahory S., Murray, D, Data Warehousing in the Real World, Addison Wesley, 1st Edition, 1997. CAT, Quiz, Seminar, Assignment, Term-End Examination
133
Artificial Intelligence ITE203
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II Unit III
Unit IV Unit V
The students would be able to understand and explain the basics of Artificial Intelligence, problem solving techniques, knowledge representation, reasoning systems and Expert systems The course meets the following student outcomes: b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. h. Recognition of the need for and an ability to engage in continuing professional development AI-Foundations History-Intelligent Agents - Perception and Language Processing - Problem SolvingSearching-Heuristic Search-Game Playing, Introduction to Predicate calculus, Expert Systems and Robotics, Over view of AI languages such as PROLOG and LISP Agents that Reason Logically First order logic-Inference in first order logic - Logical reasoning. Semantic Nets and Description Matching Frames-Inheritance and common sense Rules - Rule Chaining, Substrates and cognitive modeling. Uncertainty-Probabilistic Reasoning Systems Making simple and complex decisions Nonmonotonic reasoning and Truth Maintenance. Planning Representation for planning-Partial order planning-Conditional planning - Replanning agent-Learning-Analyzing differences-Explaining experience-Correcting mistakes-Recording cases-Overview of Version space method-Identification trees-Neural nets and Genetic algorithms, Expert systems Architecture. 1. Stewart Russel, Peter Norvig. "Artificial Intelligence-A Modern Approach", PHI, 1995. 1. Patrick Henry Winston, "Artificial Intelligence", 3rd Edition, Addison Wesley, 1999. 2. Elain Rich and Kevin Knight, "Artificial Intelligence", Tata McGraw Hill, 1993. CAT, Quiz, Seminar, Assignment, Term-End Examination
134
Embedded Systems ITE204
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To teach the fundamentals of embedded system To understand programs and tools for embedded system . To impart knowledge about real time operating system To elucidate knowledge of embedded system types and its interfacing mechanisms The students will be able to 1. Understand and use in embedded system and device drivers. Use software engineering practices in embedded systems development and Inter process communication The course also meets the following student outcomes: c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice. k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems EMBEDDED MICROCONTROLLERS Introduction: Contrast between an embedded system and other computer systems; the role of programming and its associated languages as applied to embedded systems; the purpose and role of embedded systems in computer engineering. Microcontrollers: Structure of a basic computer system: CPU, memory, I/O devices on a bus; CPU families used in microcontrollers: 4-bit, 8-bit, 16-32-bit; Basic I/O devices: timers/counters, GPIO, A/D, D/A; Polled I/O vs. interrupt-driven I/O; Interrupt structures: vectored and prioritized interrupts; DMA transfers; Memory management units; Memory hierarchies and caches. EMBEDDED PROGRAMS AND TOOLS The program translation process: compilation, assembly, linking; Representations of programs: data flow and control flow; Fundamental concepts of assembly language and linking: labels, address management; Compilation tasks: mapping variables to memory, managing data structures, translating control structures, and translating expressions; Tool support: Compilers and programming environments; Logic analyzers; RTOS tools; Power analysis; Software management tools; Project management tools. REAL-TIME OPERATING SYSTEMS Real-time operating systems: Context switching mechanisms; Scheduling policies; Ratemonotonic scheduling: theory and practice; Priority inversion; other scheduling policies such as EDF; Message-passing vs. shared memory communication; Interprocess communication styles such as mailbox and RPC; Low-power computing: Sources of energy consumption: toggling, leakage; Instruction-level strategies for power management: function unit management; Memory system power consumption: caches, off-chip memory; Power consumption with multiple processes; System-level power management: deterministic, probabilistic methods. NETWORKED EMBEDDED SYSTEMS Why networked embedded systems; Example networked embedded systems: automobiles, factory automation systems; The OSI reference model; Types of network fabrics; Network performance analysis; Basic principles of the Internet protocol; Internet-enabled embedded systems; Controller Area Network; Embedded Ethernet Controller; Inter Integrated Circuits(I2C) INTERFACING AND MIXED-SIGNAL SYSTEMS Digital-to-analog conversion; Analog-to-digital conversion; How to partition analog/digital processing in interfaces; Digital processing and real-time considerations. ARM Controllers;
Unit V
135
1. Wayner Wolf, Computers as components Principles of embedded computing system design, Morgan Kaufman,2001 2. Rajkamal, Embedded Systems-Application, Practice & Design, Tata McGraw Hill, 2003 3. Arnold S. Berger, Embedded Systems Design, CMP Books, 1997 CAT, Quiz, Seminar, Assignment, Term-End Examination
136
Course Code: ITE 306 Course Prerequisites Expected Outcome: Exercises
Embedded Systems Lab ITE 305
L 0
T 0
P 3
C 2
The course meets the following student outcomes: c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. j. An ability to use and apply current technical concepts and practices in the core information technologies Programming in 8051 a. Handling Port b. Waveform generation c. ADC; DAC d. Interrupt Programming e. Stepper Motor Interfacing
137
INTRODUCTION TO INFORMATION TECHNOLOGY NONE The students will be able to understand the importance of IT in business environment and the technologies involved in knowledge engineering. The students will acquire basic knowledge about Internet, multimedia, virtual reality based concepts. The students will be exposed to the application areas of IT. The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. i. An ability to use current techniques, skills, and tools necessary for computing practice l. An ability to effectively integrate IT-based solutions into the user environment IT in the Business Environment Introduction: Business and Information Technology, Information Technologies in the Modern Organization, Information Technology for Multimedia Communication, Principles of Visual Information Analysis IT Infrastructure Computer Hardware, Computer Software, Managing Organizational Data and Information, Telecommunications and Networks, The Internet, Intranets, and Extranets Applying IT for Competitive Advantage Functional, Enterprise, and Inter-organizational Systems, Electronic Commerce, ComputerBased Supply Chain Management and Information Systems Integration, Data, Knowledge, and Decision Support, Intelligent Systems in Business. Informational and Organizational Goals Strategic Information Systems and Reorganization, Information Systems Development, Implementing IT: Ethics, Impacts and Security. Important Application Areas Issues & Challenges, IT in Healthcare & Telemedicine, Remote Sensing and GIS Techniques, Cybermediary Concepts, Principles and Applications of Soft Computing, Industrial information Technology, IT in Mining and Electrical Load Forecasting, Information Processing from Document Images, IT for Rural Development. 1. Efraim Turban, R. Kelly Rainer, Richard E. Potter, "Introduction to Information Technology", John Wiley & Sons, 2002 1. Ray Ajoy Kumar, Acharya Tinku, "Information Technology: Principles and Applications", Prentice Hall of India 2. Dennis P. Curtin, Kim Foley, Kunal Sen, Cathleen Morin, Introduction to Information Technology The breaking ware Tata McGraw hill 3. Howard S. Peavy, Donald R. Rowe and George Tchobanoglous (1987), Environmental Engineering, McGraw-Hill. 4. Metcalf and Eddy (2003), Wastewater Engineering: Treatment and Reuse, Tata McGrawHill CAT, Quiz, Seminar, Assignment, Term-End Examination
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
Unit V
Text Books
Reference Books
Mode of Evaluation
138
SYSTEM PROGRAMMING NONE
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
The student will understand the different steps involved in pass I and pass II of Assembler, the structure of compiler and the functions performed in different phases of compiler The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. Assemblers Elements of assembly language programming simple assembly scheme pass structure of assemblers, Design of a two-pass assembler, Relocation and linking concepts, Design of a linker, self-relocating program, linker for MS DOS, linker for overlays, loaders. Structure of Compilers Lexical analysis, syntax analysis, intermediate code generation, optimization code generation, book keeping, and error handling compiler writing tools programming languages. Role of lexical analyzer Design of lexical analyzer, regular expression, finite automation, regular expression to finite automata, minimizing DFA, implementation to lexical analyzer context free grammar, derivations & parse trees capabilities of context free grammar. Parsers Shift-reduce parsing, operator precedence parsing, top down parsing, syntax directed translation scheme, implementation of syntax-directed translators, intermediate code, postfix notation, parse trees and syntax trees, three address code, quadruples, triples, translation of assignment statement, Boolean expression, errors, lexical phase errors, semantic-phase errors, semantic errors. Optimization Principles, sources of optimization, loop optimization, DAG representation of basic blocks, value numbers and algebraic laws, global data flow analysis, dominators, reducible flow graphs, depth-first search, loop-invariant computations, induction variable elimination, other loop optimization. D.M. Dhamdhere, System Programming, Tata McGraw Hill, 2nd Edition, 2000 1. A. V. Aho, J.D. Ullman, Principles of Compiler Design, Narosa Publishing, 1996. CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
139
Course Code: ITE 402 Course Prerequisites
MULTIMEDIA & GRAPHICS LAB ITE401
L 0
T 0
P 3
C 2
Expected Outcome:
The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice j. An ability to use and apply current technical concepts and practices in the core information technologies Computer Graphics Reflection Draw an object to produce a mirror image relative to an axis of Reflection 1 X axis 2 Y axis Transformations 3 Draw an object and shift the object to another specified location 4 Draw an object and perform rotation by specified angles Clipping 5. Line Clipping Create a line and clip a part of that line to other location. 6 Window Clipping Draw an object make a window on that shift that window to another location 7 Circular Clipping Draw an object make a circle on that shift that circle portion to another location. 8 Polygon Clipping Make a polygon and make a window on that shift that window to another location. Shearing 9 Draw an object and perform the shearing. 10 Draw any three dimensional object and see all possible views of it. 11 Draw a Car by the combination of lines and circles and move the car. Multimedia 1 Create Icons using any of the macromedia tools. 2 Create Logos using any of the macromedia tools. 3 Create a Image and Change the Image using Photoshop 4 Create a Morphing images using any macromedia tools 5 Create animation picture using flash. 6 Manipulate Digital Audio using Sound editing tool. 7 Manipulate Digital Video using Video editing tool. 8 Using Fireworks create a Multimedia presentation. 9 Create a Multimedia Presentation using Flash Assignments, TEE
Exercises
Mode of Evaluation
140
Course Code: ITE 313 Course Prerequisites Objectives: NONE
REAL TIME SYSTEMS
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
The students would be able to understand the real time systems concepts to select architectures and programming languages, Analyze the Real Time systems requirements, Evaluate the fault tolerance techniques and systems reliability The course meets the following student outcomes: i. An ability to use current techniques, skills, and tools necessary for computing practice j. An ability to use and apply current technical concepts and practices in the core information technologies k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems l. An ability to effectively integrate IT-based solutions into the user environment Introduction Issues in real-time system, task classes, architecture issues, operating system issues, performance measure for real time systems, estimating program run times, classical uniprocessor scheduling algorithm, uniprocessor scheduling of IRIS tasks, task assignment, mode changes, fault tolerance scheduling. Programming Languages and Tools Introduction, desirable languages characteristics, data types, control structures, facilitating hierarchical decomposition packages, exception handling, overloading and generics, multitasking, low-level programming, task scheduling, timing specification, programming environments, run-time support. Real-Time Database & Communication Basic definitions, real time vs. general purpose databases, main memory databases, transaction priorities, transaction aborts, concurrency control issues, disk scheduling algorithms, two-phase approach to improve predictability, maintaining serialization consistency, databases for real-time systems, communication network topologies, communication protocols. Fault -Tolerance Techniques Introduction, failure causes, fault types, fault detection, fault and error containment, redundancy, data diversity, reversal checks, malicious or Byzantine failures, integrated failure handling. Reliability & Clock Synchronization Introduction, obtaining parameter values, reliability models for hardware redundancy, software error models, taking time into account, clock synchronization, nonfault-tolerant synchronization algorithms, impact of faults, fault tolerant synchronization in hardware. C.M. Krishna, Kang G. shin, Real-Time systems, McGraw Hill, 2004 R.J.A. Buhr, D.L. Bailey, An Introduction to Real-Time Systems, Prentice-Hall International, 1999. CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
141
SOFT COMPUTING NONE
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
The students would be able to understand and explain the concepts of neural networks, learning in biological neuron, learning algorithms, fuzzy sets, fuzzy arithmetic, handling uncertainty and problem solving using genetic algorithms The course also meets the following student outcomes: b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. h. Recognition of the need for and an ability to engage in continuing professional development. Neural Networks History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN Architecture, Learning rules, Learning Paradigms supervised, unsupervised and reinforcement learning, ANN training algorithms perceptron, training rules, Delta, Back Propagation Algorithm, Multilayer perceptron Model, Hopfield Networks, Associative Memories, Applications of Artificial Neural Networks Fuzzy Logic Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical sets, Membership Function, Fuzzy Rule generation, Operations on Fuzzy Sets- Complement, Intersections, Union, Combination of Operations, aggregation operations. Fuzzy Arithmetic Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals and Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations. Fuzzy Logic: Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic Hedges. Uncertainty based Information and Application of Fuzzy Logic Information and Uncertainty, Nonspecificity of Fuzzy and Crisp Sets, Fuzziness of Fuzzy Sets, Application of Fuzzy Logic: Medicine, Economics Etc. Genetic Algorithm An Overview, GA in problem solving, Implementation of GA. Klir and TA Folger, Fuzzy Sets, Uncertainty, and Information, Prentice Hall (1988). 1. Ross T.J. Fuzzy Logic with Engineering Applications, McGraw Hill, 1995 2. Zurada, J.M. Introduction to Artificial Neural systems, Jaico Publishing House, 1997 3. David. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, 1985 CAT, Quiz, Seminar, Assignment, Term-End Examination
142
BASIC BIO-INFORMATICS NONE
L 3
T 0
P 0
C 3
Unit II
Unit III
Unit IV
The students would be able to understand and explain the fundamentals of Bio-informatics, Dynamic programming, searching algorithms, Evolutionary trees, DNA mapping, DNA sequencing and Gene predictions The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. Introduction to Bioinformatics Scope of Bioinformatics Elementary commands and Protocols, ftp, telnet, http, Primer on information theory. Sequencing Alignment and Dynamic Programming Introduction Strings Edit distance between two strings string similarity local alignment gaps Parametric sequence alignments multiples alignment common multiple alignment methods. Sequence Databases and Uses Introduction to databases database search Algorithms issues in database search sequence database search FASTA BLAST Amino acid substitution matrices PAM AND BLOSSUM. Evolutionary Trees and Phylogeny Ultrasonic trees parsimony Ultrametric problem Perfect phylogeny Phylogenetic alignment connection between multiple alignment and tree construction. Special Topics in Bioinformatics DNA Mapping and sequencing Map alignment Large scale sequencing and alignment shotgun DNA sequencing sequence assembly Gene predictions Molecular predictions with DNA strings. 1. Dan Gusfield, "Algorithms On Strings Trees and Sequences", Cambridge University Press, 2005 1. Westhead, "Instant notes Bioinformatics", Viva Publishers. 2. Bergeron Bryan, "Bioinformatics Computing", Prentice Hall of India CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
143
DIGITAL IMAGE PROCESSING NONE
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
The students would be able to understand and explain Fundamentals of Image processing, Image Transforms, Image restoration techniques, Image segmentation and Recognition & interpretation of Images. The course meets the following student outcomes: b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. d. An ability to function effectively on multi-disciplinary teams to accomplish a common goal. i. An ability to use current techniques, skills, and tools necessary for computing practice k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems l. An ability to effectively integrate IT-based solutions into the user environment Fundamentals Digital Image representation, steps in image processing, Elements of Digital Image processing systems. , Elements of visual perception, sampling and quantization, basic relationship between pixels. Imaging Geometry some basic transforms, perspective transforms. Image Transform Fourier transform, Discrete Fourier transform, Fast Fourier transform, properties of 2 D Fourier transform, Image Enhancement Spatial domain methods, Frequency domain methods, Enhancement by point processing, spatial filtering, Enhancement in the Frequency domain. Image Restoration Degradation model, Algebraic approach to restoration, Inverse Filtering, Wiener Filter constraint least squares restoration, Restoration in the spatial domain, Image CompressionRedundancy, Compression models, Error free compression, Lossy compression, Image compression standards. Image Segmentation Detection of Detection of Discontinuity Edge linking and boundary detection, Thresholding Region oriented segmentation. Image representation Representation schemes, Boundary descriptors, Regional descriptors. Recognition and interpretation Elements of Image analysis, patterns and pattern classes, Decision and theoretic methods, structural methods, Interpretation. 1. Rafel C. Gonzalez & Richard E. Woods, Digital Image Processing, Pearson Education, 2005 1. Anil K. Jain, Fundamentals of digital Image processing, PHI, 1989. CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
144
SOFTWARE PROJECT MANAGEMENT NONE
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
The students would be able to understand and use the concepts of software project management. They would be able to do Activity planning, projects scheduling, Risk Management, Resource allocation, software configuration management and software maintenance and its characteristics The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. h. Recognition of the need for and an ability to engage in continuing professional development i. An ability to use current techniques, skills, and tools necessary for computing practice k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems m. An understanding of best practices and standards and their application n. An ability to assist in the creation of an effective project plan Introduction Software projects-various type of projects-problems with software projects-an overview of project planning-project evaluation-project analysis and technical planning-software estimation. Activity Planning Project schedules-sequencing and scheduling projects network planning model-shortening project duration identifying critical activities. Risk Management Resource allocation-monitoring and control-managing people and organizing teamsplanning for small projects. Software Configuration Management Basic functions-responsibilities-standards-configuration management-prototyping models of prototyping Software Maintenance and its characteristics Tasksside effects maintenance issues source code metrics software reliability definition of software reliability concept of software repair and availability software error and faults estimating number of bugs in computer program reliability models availability models. 1. Mike Cotterell, Bob Hughes, Software Project Management, Tata McGraw Hill, 3rd Edition, 2004 1. Ramesh Gopalaswamy, "Managing Global Software Projects", Tata Mc Graw Hill, 2001 CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
145
DISTRIBUTED SYSTEMS ITE 303
L 3
T 0
P 0
C 3
Unit II
Unit III
Unit IV Unit V
To learn distribution of computing elements To understand the building blocks of distributed system models To learn how to implement the RPC and distributed protocols and their Applications The course meets the following student outcomes: c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems Characterization of Distributed Systems Introduction to Distributed Systems System Models Networking and Internetworking Interprocess Communications - Case Study: IPC in UNIX Distributed Objects and File System Distributed Objects and Remote Invocation Distributed File Systems - Architecture Recent Advances Overview of Distributed Databases Name Services and Directory Service Name services Domain Name Systems Coordination and Agreement Time and Global states Transaction and Concurrency Control-Distributed Transactions Transaction and Nested Transactions Concurrency Control Distributed Transactions Distributed OS and Shared Memory Distributed Operating System Support Distributed Shared Memory- Peer to Peer networks Web Services Overview CORBA and Java RMI Case Study 1.G. Coulouris, J. Dollimore, and T. Kindberg, "Distributed Systems: Concepts and Designs, Fourth Edition, Addison Wesley, 2005 2.Andrew.S.Tanenbaum,Maarten Van Steen, Distributed Systems Principles and Paradigms, 3e,Second Edition,Prentice Hall -2002 1 Randy Chow and Theodore Johnson, Distributed Operating Systems and Algorithms. Addison-Wesley, 1997 2. Mukesh Singhal and N. G. Shivaratri, Advanced Concepts in Operating Systems, Distributed, Database, and Multiprocessor Operating Systems, McGraw Hill, 1994 3. Vijay K. Garg, Elements of Distributed Computing, Wiley & Sons, 2002 CAT, Quiz, Seminar, Assignment, Term-End Examination
Text Books
146
WEB TECHNOLOGIES ITE 207/Programming in Java
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To understand web infrastructure and web languages To program for web client and web server objects To understand web development environment and methodology At the end of the course, student should be able to: Understand web essentials Develop Web Applications Client-side and Server-side programming The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice l. An ability to effectively integrate IT-based solutions into the user environment Web Essentials Internet Backbone Introduction to Web Markup Languages and Scripts HTML, XHTML, DHTML, XML - Browser and Enabling Technologies Standards Bodies Client-Side Programming Client-Server and Web Client-side Requirements Programming with PHP, JavaScript, JSP, Web 2.0, AJAX, CSS, PHP, DOM Objects Introduction to Rich Internet Application Development Server-Side Programming Web Server Server-side Requirements - Programming with CGI, PHP, JavaScript, Ruby, and Java Servlet J2EE and .NET technologies Web Databases Application Development Development Methodology - Web Interface - Page Design Middleware Technologies Application Server - Dynamic Web Page Development AJAX Enabling Web Applications E-mail - Event Monitoring Chat System - E-commerce and E-business - Web Enabling IT Services - Web Services - Overview of Cloud Computing Chris Bates, Web Programming Building Internet Applications, 2e, John Wiley & Sons, 2002 2. Deitel & Deitel, Internet and World Wide Web How to Program, Pearson Education, 2009 1. Steve Schafer Html,css,javascript,perl,python & PHP(Web standard)Programmer`s reference.,Wrox press,2005 2. Kogent , Web Technologies- Black book(html,javascript,php,java,jsp, ASP.net,xml,Ajax), Learning Solutions Inc,2009. 3. Quentin Zervaas, Practical web 2.0 Application with PHP, Apress,2007 4. Eric Ladd, Jim O Donnel, Using HTML 4, XML and JAVA, Prentice Hall of India QUE, 1999. 5. Jeffry Dwight, Michael Erwin and Robert Niles, Using CGI, 2e, PHI, 6. Henry Chan, E-Commerce Fundamentals and Applications, Wiley
Unit V
Text Books
Reference Books
147
Mode of Evaluation
India, 2001 CAT, Quiz, Seminar, Assignment, Term-End Examination
148
Open Source Programming ITE 101/201
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To understand open source philosophy To use open source software and tools To develop software with open source tools At the end of the course, student would: Understand OSS philosophy Know open source tools and their usage Build open source software The course also meets the following student outcomes: b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice Open Source Philosophy History OSD-Compliance Open Source vs Closed Source Copyright vs Copyleft Open Source vs Free Software FOSS, GNU, Open Source Philosophy and Rules Licensing Open Source Software Economy Open Source Software and Tools Web and Application Servers: Apache, Tomcat, Joomla, Drupal, Moodle Web Tools: Mozilla Firefox, Thunderbird Office Suites - Chess Engine Development Concepts and Methodologies Meta-rules and Rules of Open Source Programming, Server-side and Client-side Programming Languages: PERL, CGI, PHP Databases: MySQL, PostgreSQL Middlewares Unix File System, Eclipse, Ant, JUnit, Eclipse, Ant, JUnit Open Source OS and Web Technologies GNU Project Linux, OpenBSD, FreeBSD, OpenSolaris, Symbian, Android, FLOSS LAMP Case Study: e-Commerce, Education, Healthcare, Games Open Source Software in Internet and Networking ERP and CRM products Scala, Groovy, Rhino Networking Tools Introduction to Ruby Python 1. Beginning PHP, Apache, MySQL Web Development, Michael K. Glass, Rommnle Scouarnec, et al, Wiley Publishing, Inc, New Delhi, 2004 1. Joseph Fellei and Brian Fitzgerald,Understanding Open Source Software,Pearson Education 2002 2. Chris DiBona, Open Source voices from the Open Source Revolution, OReilly 1999. CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
149
Graph Theory and its Applications ITE 103
L 3
T 0
P 0
C 3
This subject aims to cover basic concepts of Graph theory
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV Unit V
At the end of the course, students the students would be able to understand and explain fundamentals of Graph Theory and their applications The course also meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. b. An ability to analyze a problem, and identify and define the computing and technology requirements appropriate to its solution. INTRODUCTION Definitions, importance, isomorphism, walk, paths, circuits, connected, disconnected graphs, operation on graphs operation on graphs, Euler and Hamiltonian graphs. TREES Properties, distance and centers, trees, spanning trees, fundamental circuits, minimal spanning tree, Cut sets Properties, fundamental circuits and cut sets, connectivity, separatability, network flows, 1-2 isomorphism ,Planar and dual graphs, Combinatorial representation, planar graphs, kuratowskis graphs, detection of planarity, dual graphs. MATRIX REPRESENTATION OF GRAPHS Incidence matrix, circuit matrix, cut set matrix, fundamental matrices, relationships amongst matrices, path matrix, and adjacency matrix COLORING, COVERING AND PARTITIONING Chromatic number, chromatic partitioning, matching, covering, four color problem DIRECTED GRAPHS Different types, directed paths and connectedness, Euler digraphs, trees-matrix representation, tournament. Graph theoretic algorithms , Computer representation of graphs input & output, algorithms for connectedness, spanning tree, fundamental circuits, cut vertices, directed circuits and shortest paths. 1. Narasing Deo, Graph Theory With Application To Engineering And Computer Science, Prentice Hall India, 1995. (Chapters 1 To 5,7 To 9,11.1 To11.5) 2. Tulasiraman And M.N.S. Swamy, Graph, Networks And Algorithms, John Wiley, 1981. 3. F.Harary, Graph Theory, Addison Wesley/ Narosa, 1998. 4. E.M.Reingold, J.Nievergelt, N.Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall, N.J.1977 CAT, Quiz, Seminar, Assignment, Term-End Examination
Text Books
Mode of Evaluation
150
Network and Information Security ITE 103
L 3
T 0
P 0
C 3
At the end of the course students should have learnt protection of data transferred over computer networks and devising practical solutions to network security requirements gained a sound knowledge in multi-level security for data and databases The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. INTRODUCTION
Unit II
CRYPTOGRAPHY AND AUTHENTICATION
Unit III
LAYERED SECURITY AND TOOLS AND TECHNIQUES
Unit IV
PROGRAM SECURITY
Unit V
DATA AND DATABASE SECURITY
Text Books
Reference Books Mode of Evaluation CAT, Quiz, Seminar, Assignment, Term-End Examination
151
Mobile Computing
L 3
T 0
P 0
C 3
Basic knowledge of Data communications and Computer Networks The student would be able to understand the principles and practices of Mobile Communication, Satellite Communication, Medium Access Control techniques, Mobile Devices, Wireless Local Area Networks, HiperLAN and Bluetooth, Wireless ATM operations, mobile network layer and various wirelesses Application Protocol The course meets the following student outcomes: a. An ability to apply knowledge of mathematics, science, computing and information technology appropriate to the discipline. k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems l. An ability to effectively integrate IT-based solutions into the user environment INTRODUCTION Wireless Transmission - Frequencies for Radio transmission signals - Antennas - Signal propagation - multiplexing Modulation - spread spectrum - Cellular systems. Medium access control - Motivation for a specialized MAC SDMA-FDMA-TDMA-CDMA comparison of S/T/F/CDMA. Communication Systems Telecommunication Systems - GSM, DECT, TETRA, UMTS and IMT - 2000, Satellite Systems - GEO139, LEO139, MEO140. Routing, Localization, Handover. Broadcast systems - Overview - Cyclic Repetition of Data Digital Audio Broadcasting - Digital Video Broadcasting. Wireless Communication Wireless LAN-Infrared vs. Radio transmission, Infrastructure and ad hoc networks, IEEE802.11, HIPERLAN, Bluetooth. Wireless ATM, Motivation for WATM, Wireless ATM working group, WATM Services, Reference Model, Functions, Radio Access Layer: Handover, Location Management, Addressing, Mobile quality of service, Access point control protocol. Mobile Network Layer Mobile IP-Dynamic host configuration protocol-Ad hoc networks. Mobile transport layer- Traditional TCP292: Indirect TCP, Snooping TCP. Mobile TCP: Fast Retransmit/Fast recovery, transmission/Timeout Freezing, Selective Retransmission, Transaction oriented TCPU Support for Mobility File Systems-Consistency -World Wide Web - Hyper Text markup language (HTML) approaches that might help wireless access-System architecture Wireless Application Protocol. 1. Johchen schiller, -Mobile Communication, Pearson Education Ltd, 2003. 1. Asoke K. Talukder, Roopa R.Yavagal, Mobile Computing-Technology, Applications and Service Creation, Tata McGraw Hill, 2010 CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit II
Unit III
Unit IV
Unit V
152
Advanced Database Management Systems ITE 302
L 3
T 0
P 0
C 3
Expected Outcome:
Unit I
Unit II
Unit III
Unit IV
To learn the parameters for tuning database and applications To design parallel and distributed databases To learn databases that are object-based, data warehousing and data mining To know the latest trends that are happening today At the end, the student should be able to: Comprehend the advanced features of databases Design parallel and distributed databases Apply current database trends The course meets the following student outcomes: c. An ability to design, implement and evaluate a computer-based system, process, component, or program to meet desired needs. i. An ability to use current techniques, skills, and tools necessary for computing practice k. An ability to identify and analyze user needs and take them into account in the selection, creation, evaluation and administration of computer-based systems l. An ability to effectively integrate IT-based solutions into the user environment Overview of Databases Overview of legacy databases Overview of Relational Databases Database Tuning for Performance SQL Tuning Hashing and Indexing Query Processing Query Optimization - Transaction Management Parallel and Distributed Databases Parallel System Architectures Design of Parallel Systems Query Parallelism Pipelined Parallelism; Distributed System Architectures Design of Distributed Systems Data Placement Techniques Fragmentation Query Distribution Distributed Transaction Processing Concurrency Control Object-Based Databases Data types: New, Collection, User-defined, Reference, Multivalued Inheritance ObjectRelational DBMS Features Data Mapping Extended SQL Object-Oriented DBMS Features Objects Mapping Object-Relational Vs Object-Oriented Databases Data Warehousing and Data Mining DSS Multidimensionality Fact Table OLAP OLTP vs OLAP Data Warehousing Data Warehouse Architecture DW Schemas ETL Data Mining - SQL Extensions Advanced Database Technologies Clustering Spatial and Temporal Data In-memory Databases Web Databases Big Data NoSQL Advanced Transaction Processing 1. Abraham Siberschatz, H.F.Korth, S.Sudarshan, Database System Concepts, Tata McGraw-Hill, 2009. 2. M. Tamer Ozsu, Patrick Valdwiex, Principles of Distributed Databases, Pearson Education, 1999 1. RamaKrishnan and Gehrke, Database Management Systems, Tata McGraw-Hill, 2003 2. Jiawei Han and Micheline Kamber, Data Mining Concepts and Techniques, Morgan Kaufmann Publishers, 2005 CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
153
Course Code: ITE 412 Unit I
Software Agents
L 3
T 0
P 0
C 3
Agent Definition - History - Intelligent Agents- Agent Programming Paradigms Agent Vs Object - Aglet - Mobile Agents Agent Frameworks - Agent Reasoning. Unit II Interaction between Agents - Reactive Agents - Cognitive Agents - Interaction protocols Agent coordination -Agent negotiation - Agent Cooperation - Agent Organization - Self interested agents in electronic commerce applications. Unit III Agents and Multi-agent Systems- Problem Solving and Knowledge RepresentationReasoning Systems and Learning Systems- Agent Oriented Methodologies and FrameworksAgent Interoperability- Logics for Multiagent Systems. Interface Agents - Agent Communication Languages - Agent Knowledge representation Agent adaptability -Belief Desire Intension - Mobile Agent Applications. Unit IV Situational Calculus - Representation of Planning - Partial order Planning- Practical Planners Conditional Planning - Replanning Agents. Unit V Agent Security Issues - Mobile Agents Security - Protecting Agents against Malicious Hosts - Untrusted Agent -Black Box Security - Authentication for agents - Security issues for aglets-Agent Technology in Business. 1. Bradshaw, Software Agents, MIT Press, 2000. 2. Russel & Norvig, Artificial Intelligence: a modern approach, Prentice Hall, 1994. 3. Richard Murch, Tony Johnson, Intelligent Software Agents, Prentice Hall, 2000. 4. Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 1992 CAT, Quiz, Seminar, Assignment, Term-End Examination
154
Course Code: ITE 414 Unit I
Knowledge Management
L 3
T 0
P 0
C 3
Unit II
Unit III
Unit IV
Knowledge Management Overview and Roadmap Knowledge Economy and Intellectual Capital, Drivers of Knowledge Management, Creating the Knowledge Edge, Data-Information-Knowledge Paradigm, Classifying Knowledge, Three Fundamental Processes. The 10-Step Knowledge Management Road Map. Phase1Infrastructural Evaluation, Phase 2- Knowledge Management System Analysis, Design, and Development. Phase3. Deployment. Phase4. Metrics for Evaluation Infrastructure Evaluation and Leverage Leveraging What Exists. Leveraging the Internet. The Knowledge Platform: A 10,000-Foot View. Strategic Visioning. Knowledge Transfer versus Integration: Strategic Dichotomy. Real Options Under Uncertainly. The Responsiveness Quadrahedron: Variety and Speed. Business Models and Executability. Codification or Personalization? Knowledge Maps to Link Knowledge to Strategy. Strategic Imperatives for Successful Knowledge Management. Strategic Imperatives for Successful Knowledge Management. Assessing Focus. Detecting Lost Opportunities. KM System Analysis, Audit and Team Formation Technology Components of the Knowledge Management. The Seven-Layer Knowledge Management System Architecture. Foundation for the Interface Layer. The Web or Proprietary Platforms? Collaborative Intelligence and Filtering Layer. Knowledge Management Platforms versus Other Enterprise Systems. The Application Layer. The Promise of Peer-to-Peer Knowledge Networks. Knowledge Audit and Analysis- Hindsight, Insight, and Foresight. Measuring Knowledge Growth. The Knowledge Audit Team. Conducting the Knowledge Audit. Choosing Your Company's Knowledge Niches. Designing the Knowledge Management Team- Sources of Expertise. Team Composition and Selection Criteria. Team Life Span and Sizing Issues. The KM Team's Project Space. KM System Design and Development Creating the KMS Blueprint. The Knowledge Management Architecture. Components of a Knowledge Management System. Integrative and Interactive Knowledge Applications. User Interface Design Considerations, a network view of the KM Architecture. Future-Proofing the Knowledge Management System. Developing the Knowledge Management System- The Building Blocks: Seven Layers. The Interface Layer. A live Walkthrough: Urban Motors. The Access and Authentication Layer. The Collaborative Filtering and Intelligence Layer. The Application Layer. The Transport Layer. The Middleware and Legacy Integration Layer. The Repository Layer. KMS Development and Assessment Moving from Firefighting to Systems Deployment. Legacy Deployment Methods. The Results-Driven Incremental Methodology, Leadership and Reward Structures-From the Chief Information Officer. The Successful Knowledge Leader. Reward Structures to Ensure Knowledge Management Success. Real-Options Analysis for Knowledge Valuation- The Limitation of Traditional Metrics. Real-Options Analysis. Measuring Inputs for RealOptions Models. Knowledge Management Toolkit, The: Orchestrating IT, Strategy, and Knowledge Platforms, 2/E, Author: Amrit Tiwana, ISBN-81-317-0635-4, Pearson Education Knowledge Management, Author(s): Elias M. Awad, Hassan M. Ghaziri, ISBN: 9788131714034, Pearson Education CAT, Quiz, Seminar, Assignment, Term-End Examination
Unit V
155

Fallsem2012-13 CP0365 Syb

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Fallsem2012-13 CP0365 Syb

Загружено:

Авторское право:

Доступные форматы

Course Code ENG101 ENG001 ENG101 ENG102 MGT301 ITE498 CHY104 MAT101 PHY101 CHY101 ITE101

II. University Elective Course Title L T University Elective I University elective II 3 0 3 0

III. Program Core L T P C Credits 0 0 3 3 3 3 3 0 3 3 0 3 3 3 0 3 3 3 0 3 0 0 1 1 0 0 1 0 1 0 0 0 1 0 0 1 0 0 0 0 4 2 0 0 0 2 0 3 0 0 3 0 0 0 3 0 2 0 3 0 2 1 4 4 3 4 4 2 4 3 2 3 4 3 2 4 4 3 2 3 2 1 4 4 3 4 4 2 4 3 2 3 4 3 2 4 4 3 2 3 3

IV. Program Elective L T P C Credits 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3

Course Code: Course Prerequisites Objectives: +2

Course Code: ENG 101 Course Prerequisites Objectives:

ENGLISH FOR ENGINEERS I EPT Scores

Expected Outcome: Unit I

Text Books Reference Books Mode of Evaluation

Course Code: ENG 102 Course Prerequisites Objectives:

ENGLISH FOR ENGINEERS II ENG 101

Expected Outcome: Unit I

Text Books Reference Books Mode of Evaluation

Course Code: CHY 104 Course Prerequisites

ENVIRONMENTAL STUDIES NONE

Text Books Reference

Course Code: MGT 301 Course Prerequisites Objectives:

ETHICS AND VALUES NONE

Course Code: MAT 101 Course Prerequisites Objectives:

Course Code: MAT 106 Course Prerequisites Objectives:

Course Code: MAT 104 Course Prerequisites Objectives:

Probability and Statistics MAT101 Multivariable calculus and Differential Equations

Text Books Reference Books Mode of Evaluation

Course Code: MAT 202 Course Prerequisites Objectives:

LINEAR ALGEBRA MAT101 Multivariable Calculus and Differential Equations

Reference Books Mode of Evaluation

Course Code: PHY 101 Course Prerequisites Objectives:

Modern Physics Physics as one subject in 12th Standard or equivalent level.

Written examinations, surprise test, quizzes, assignments, seminar, group discussion

Course Code: MAT 106 Course Prerequisites Objectives:

Discrete Mathematical Structures NONE

Course Code: ITE203 Course Prerequisites Objectives:

Theory of Computation MAT 106

Text Books Mode of

Evaluation Course Code: MAT 203 Course Prerequisites Objectives:

Numerical Analysis MAT 106

Expected Outcome: Unit I

Course Code: CHY 101 Course Prerequisites Objectives:

Engineering Chemistry Basic Chemistry at 12thStandard or equivalent level

Reference Books Mode of Evaluation

Course Code: EEE 101 Course Prerequisites Objectives:

Basic Electrical and Electronics Engineering Physics at +2 or equivalent level.

Course Code: ITE 101 Course Prerequisites Objectives:

Problem Solving Using C NONE To learn C Programming.

Reference Books Mode of Evaluation

Course Code: CSE105 Course Prerequisites Objectives:

PROGRAMMING FUNDAMENTALS Computer Programming and Problem Solving

Unit V Text Books Mode of Evaluation

Course Code: ITE 201 Course Prerequisites Objectives:

Object Oriented Programming Concepts ITE 101

Course Code: ITE 202 Course Prerequisites Objectives:

Object Oriented Programming in C++ Lab ITE 201

Course Code: ITE 204 Course Prerequisites Objectives:

Computer Architecture and Organization ITE 205

Course Code: ITE 208 Course Prerequisites Objectives:

Operating Systems ITE204

Text Books Mode of

Evaluation Course Code: ITE 209 Course Prerequisites Objectives:

Operating Systems Lab ITE208

Course Code: ITE 303 Course Prerequisites Objectives:

Data Communication and Computer Networks ITE 208

Evaluation Course Code: ITE 304 Course Prerequisites Objectives:

Computer Networks Lab ITE 303