MA201: ENGINEERING MATHEMATICS-III      (L-4, T-0,P-0, CR-4)
	 
	LAPLACE TRANSFORM ( LT )	 
	
	Definition, existence theorem, linearity property of LT, LT of   standard
	functions, theorems on LT, Inverse Laplace transforms ( ILT ), convolution
	theorem, unit step function, impulse function, LT of periodic functions,
	applications to initial and boundary value problems, solutions of Partial
	differential equations.	
	
	FOURIER SERIES AND FOURIER INTEGRALS	 
	
	Periodic functions, Fourier theorem, Fourier series, Euler’s formulas for
	the Fourier coefficients, convergence of Fourier series, Change of
	interval, even and odd functions, half range Fourier Series, Practical
	harmonic analysis, Fourier integrals, Fourier sine and cosine integrals, 
	Fourier transforms. 

	PARTIAL DIFFERENTIAL EQUATIONS	 
	
	Separation of variables, Vibrations of string, One dimensional Heat
	Equation, Laplace Equation	
	
	LEGENDRE’S AND BESSEL’S EQUATIONS	 
	Series solution of differential Equation, Legender’s equation, Legendre’s
	polynomial, Pn( X ) Bessel’s differential Equation, Bessel Function,
	Bessel Function of second kind Yv( X ), applications , Strum-Liouville
	Problems, Orthogonolity of Bessel,s Series.	

	References Books  	
	
	1.  Advanced Engineering Mathematics, ( Eighth Edition )
	    By : Erwin Kreyszig. Pub. : John Wiley & Sons.
	2.  Advanced Engineering Mathematics, ( Second Edition )
	    By : R. K. Jain & S. R. K. Iyengar.  Pub. : Narosa Publication House.
	3.  Higher Engineering Mathematics ( Thirty sixth Edition )
	    By : Dr. B. S. Grewal.  Pub. :  Khanna Publications.
	4.  Advanced Engineering Mathematics, ( Sixth Edition )
	    By :  Wylie and Barrett.  Pub. : Tata Mcgraw-Hill 	

CSE201: OBJECT ORIENTED PROGRAMMKING          (L-4, T-0, P-1, CR-5)

	Introduction:
	Differences with Procedural Languages, Types and declarations, Expressions
	and statements. Decision making and loops, Pointers, arrays and
	structures, Functions  

	Object Oriented Concepts:
	Data abstraction, String Handling, Iostreams, Classes and objects,
	References, Inheritance and Composition, Multiple Inheritance,
	Polymorphism, Function and operator overloading, Dynamic Object Creation –
	new , delete operators and their overloading, Virtual functions, Exception
	handling, File handling , Name spaces, Templates and Iterators.
	
	Term Work:
	
	Term work shall consist of programs based on the above syllabus.

	Practical Examination:

	Practical examination shall be of 3 hours duration 

	Reference Books:
	01. B. Stroustroup, “C++ Programming Language”
	02. Balguruswamy, “Programming in C++”
	03. Venugopal, “Programming in C++


CSE202: DIGITAL ELECTRONICS                   (L-4, T-0, P-1, CR-5)

	Number Systems and Codes: 
	Binary, octal, decimal and hexadecimal number Systems and their
	conversion, Binary arithmetic, BCD, Octal & Hexadecimal codes, Excess-3,
	Biquinary and other BCD codes, parity in codes, code detection and
	correction, gray code, display codes, encoding and decoding for security.
	
	Boolean algebra and Logic gates: 
	Theorems and properties of Boolean algebra, Boolean       Functions,
	canonicals and standard forms, other Logic operations. Digital Logic
	gates, IC digital logic families and  Logic design examples.
	
	Simplification of Boolean functions: 
	The map method, 2,3 & 4 variable maps, five and six variable Maps,
	simplification and NAND-NOR Realization.
	
	Combinational Logic design: 
	Adders, subtractions, Code converters, Binary parallel adders
	Decimal adders, magnitude comparators, decoders, multiplexes,
	demultiplexers, signed magnitude numbers and its arithmetic
	implementation.
	
	Sequential Logic Design:
	Flip-flops, triggering, analysis of dock sequential circuits, J- K, D, T,
	S.R. flip- flops, excitation tables of flip flops and their applications.

	Counters and shift Registers:
	Asynchronous counters, Synchronous counters, mod-3, Counters, mod-5
	counters,presettable counters, shift- counters, Up-down counters, Ripple
	counters,Shift Registers, Serial in Serial out, Serial in parallel out,
	Parallel in Serial out, and Parallel in   Parallel out shift Registers.

	Semiconductor Memories:
	Memory organization and operation, expanding memory size, Classification
	and characteristics of memories, sequential memories, Read only memories
	R/W memories, content addressable memories, PLA and CCD memories.

	Term work:
	The term work shall consist  experiments based on above syllabus. 
	
	Practical Examination:
	Practical Examination shall be of three hours duration 
	
	Reference Books:
	
	1.Digital Logic & Computer Design (PHI)                --M. Moriss Mano
	2.Digital Principles and application (Mc Graw Hill) -- A. Malvino and D.Leach.
	3.Modern Digital Electronics (McGraw Hill)	   -- R.P.Jain]
	4.Introduction to Digital Technology (John willer & Saw)  --Louis Nesklesky
	5.Digital Electronics (PHI)  -- Williams H. Gothman

CSE203: DISCRETE MATHEMATICS                  (L-4, T-0, P-1, CR-5)

	The Foundations:
	Logic sets and Functions. Logic, Propositions and Prepositional
	equivalences, Predicates and quantifiers, sets and set operations,
	Functions, Sequences and summations, the growth of functions.	   
	
	The Fundamentals:
	Algorithms, and the Integers:- Algorithms, Complexity of Algorithms, The
	integers and division, Integers and Algorithms, Applications of Number
	Theory.
	
	Mathematical Reasoning:
	mathematical induction, Recursively defined Functions Recursively defined
	sets, Recursive algorithms; methods of proof, methods of proving theorems,
	Theorems and Quantifiers.

	Counting: 
	The basics of counting, the pigeonhole principle, Permutations and
	Combinations, Discrete Probability, Probability theory, Generalized
	Permutations and Combinations, Generating Permutations and Combinations.
	
	Advanced Counting Techniques:
	Recurrence Relations, Solving Recurrence Relations, Divide and Conquer
	Relations, Generating functions, Inclusion- Exclusion, and Applications of
	inclusion    and Exclusion.
	
	Relations:
	Relations and their properties, n-ary relations and their applications,
	Representing relations, closures of Relations, Equivalence relations, and
	Partial orderings.
	
	Graphs:
	Introduction to Graphs, Graph Terminology ,Representing Graphs and Graph
	Isomorphism ,Connectivity, Euler and Hamilton Paths , Shortest Path
	Problems , Planar Graphs , Graph Coloring. 
	
	Trees :
	Introduction to Trees , Applications of Trees , Tree Traversal , Trees and
	Sorting , Spanning Trees , Minimum Spanning Trees.
	
	Term Work:
	The term work shall consist of record of  programs based on the above syllabus.

	Practical Examination:
	Practical examination shall be of 3 hours. 
	
	Reference Books: 
	
	01. Kenneth H. Rosen, “Discrete Mathematics and its applications", Third 
	    Edition, McGraw Hill.
	02. C.L. Liu, “Elements of Discrete Mathematics", McGraw Hill.
	03. John Truss, “Discrete Mathematics for computer Scientists", 
	    Addison Wesley.



CSE204: COMMUNICATION ENGINEERING                (L-4, T-0, P-1, CR-5)

	Introduction to Communication Systems: 
	Communication Systems, Types of Filter-Low pass , High Pass, Band Pass,
	Fourier Series and Fourier Transform for finding the spectra of various
	signals.         

	Noise: 
	External noise, internal noise, basic noise Calculations, noise figure,
	noise temperature	

	Amplitude Modulation: 
	Amplitude modulation Theory, Generation of amplitude modulation.
	Single Side Band Techniques: Introduction to DSB, SSB, Suppression of
	Carrier, Suppression of Unwanted sidebands, Extensions of SSB.
	
	Frequency Modulation:
	Theory of frequency and Phase modulation, noise and frequency modulation,
	Generation of frequency modulation.
	
	Radio Receivers:
	Receiver types, AM Receiver, communications Receivers, FM Receiver, Single
	and independent sideband Receivers.
	
	Introduction to Digital Communication:
	Base band Signal, Sampling theorem, Band Pass sampling theorem, Modulation
	schemes- FSK, BPSK, QPSK.
	
	Picture Signal Transmissions and Reception:
	Television Scanning Process, interlaced scanning, composite video signal,
	CCIR-B Standards, TV Camera Systems, Chrominance and Luminance Signals,
	Transmission and Receptions using PAL systems.
	
	Sound and Acoustical Systems:
	Nature of sound, Frequency range and harmonics, stereophony, microphone
	and their types, Loudspeakers and types, Basic Principal of sound
	Recording.
	
	Term work:
	The term work shall consist of Experiments based on above syllabus.  
	
	Practical Examination:
	Practical Examination shall be of three hours duration 

	Reference Books: 
	
	01. Electronics Communication Systems (TMH)   -- George Kennedy
	02. Electronics Communications (EEE) -- D. Roddy and John Coolen.



CSE205: INTRODUCTION TO WEB PROGRAMMING (L-0, T-0, P-2, CR-1)

	HTML:
	Introduction to www, evaluation of markup language and protocols,
	Introduction to HTML and some basic tags, Information of tags like body,
	title, head format tags like font, bold and background etc, Images and
	multimedia in web page anchor tag and tables with all attributes, Frames
	and form elements, graphics, style sheets, Building a website using all
	the above tags 

	JavaScript:
	Introduction to JavaScript, difference between Java and JavaScript,
	JavaScript syntax, variables and their types, JavaScript operators, arrays
	and array methods, Program flow: Control statements, exercise, Built-in
	objects in JavaScript, Array, String, Math, Date objects, documents forms
	and form elements window location, History object
	
	Introduction to PHP:
	conditions & branches, Loops, Arrays, Strings, Regular Expressions,
	Various functions, Objects
	
	MySQL and SQL:
	Database basics, MySQL command interpreter, Managing Databases, Insert,
	Update , Delete , Queries, Functions,Querying Web Databases: Connecting to
	MySQL Database, formatting Results, User driven Querying, Writing to Web
	Databases
	
	Validation & Authentication:
	validation on the Server & Client, Sessions, Authentication & Security.
	
	References:
	
	1. Castro, “HTML 4 for World Wide Web”, Pearson education
	2. Hugh Williams & David Lane, “Web Database Applications 
	   with PHP and MySQL”,O’Reilly associates.
	3. Barrett, “Essential JavaScript for web professionals”, 
	   Pearson Education
	
	Term work:
	The term-work shall consist of practicals based on the above syllabus.

	Practical Examination:
	The term-work shall consist of practicals based on the above syllabus.

MA202: ENGINEERING MATHEMATICS – IV        (L-4, T-0, P-0, CR-4)

	COMPLEX ALGEBRA AND ANALYSIS
	Complex numbers, Polar form of complex numbers, Curves and regions in the
	complex  plane, Cauchy Riemamm equations, Laplace equation, Exponential
	functions,trigonometric and Hyperbolic functions and logarithm, general
	power, Conformal mapping,Complex integrals,  Taylor’s and Laurent series,
	Integration by the method of residue,Complex analytic functions and potential 
	theory.

	VECTOR CALCULUS:
	Introduction of vector calculus: Limit, continuity, derivative of a vector
	function, curves,tangent and arc length. Velocity and acceleration,
	tangential and normal acceleration,gradient of a scalar field, Directional
	derivative, divergence of a vector field,curl of a vector field.Line integrals,
	green’s theorem in the plane, surface integrals,Divergence theorem, stokes theorem.

	STATISTICS AND PROBABILITY
	Introduction of correlation, regression coefficients, lines of regressions and
	its  relevance in engineering field.Probability distribution, discrete and 
	continuous probability distribution, Binomial, Poisson and normal distribution and
	its applications and importance in engineering field, problems and fitting curves.

	REFERENCES BOOKS
	Advanced Engineering Mathematics, ( Eighth Edition )By : Erwin Kreyszig. 
	Pub. : John Wiley & Sons.
	Advanced Engineering Mathematics, ( Second Edition )By : R. K. Jain and
	S. R. K. Iyengar. pub. : Narosa Publication House.
	Higher Engineering Mathematics ( Thirty sixth Edition )By : Dr. B. S. Grewal.
	Pub. :  Khanna Publications.
	Advanced Engineering Mathematics, ( Sixth Edition )By :  Wylie and Barrett.
	Pub. : Tata Mcgraw-Hill 


CSE206: DATA STRUCTURES         (L-4,T-0,P-1,CR-5)
        Introduction to Data Structures:
	Concepts of data and algorithms, Data object, Data type, Storage of data
	in memory, Arrays andRepresentation of Arrays.

	Stack and Queues:
	Stack Definition and concepts,operation on stack, Stacks and Expression
	Evaluation, Stacks and Recursion, Definition of Queue operations, Stack 
	and Queue implementation, Simulation.

	Linked Lists:
	Linked Linear Lists, Operations on linear Lists using singly linked storage
	Structures, Circularly Linked lists, Doubly Linked linear lists,applications 
	of linear lists, Polynomial manipulation, multiprecision arithmetic, linked 
	stacks and Queues, Sparse matrices.	

	Trees:
	Definition and concepts, operation on Binary trees, Storage representation and
	manipulation of Binary trees, Linked storage Representation of Binary tree,
	conversion of general trees to binary trees, sequential and other representation
	of trees, applications of trees, Manipulation of Arithmetic expressions, set
	representations, decision tree and game tree.

	Graphs:
	Graph definition and concepts, graph representation, Matrix representation of graph,
	List structures and other representation of graph, Breadth first search and 
	depth first search, spanning trees and applications of graph.

	Searching and Sorting:
	Linear search, Binary search, tree searching, hashing, Bubble sort, quick sort,
	insertion sort, selection and tree sorting.

	File Organization:
	Queries, index techniques, File organization, sequential organization, 
	Random Organization, Linked organization, Inverted files.

	Reference Books:
	01. Tenenbaum, Langsam & Angenstein, "Data Structures using C", PHI
	02. Tremblay and Sorenson, "An Introduction to Data Structures with Application",
	McGraw  Hill.

	Term Work:
	The term work shall consist of record of   programs based on the above syllabus.

	Practical Examination:
	Practical examination shall be of 3 hours duration.



CSE207: OPERATING SYSTEMS       (L-4,T-0,P-1,CR-5)

	Introduction to system software-
	Assemblers, linkers, macroprocessors, compilers, interpreters, loaders,
	compiler drivers, static linking, object files, relocatable object files,
	symbols and symbol tables, symbol resolution, relocation, executable object
	files, loading executable object files, dynamic linking with sharedlibraries,
	loading and linking shared libraries from applications, position independent code, 
	tools for manipulating object files
	
	Computer system overview -
	CPU registers, interrupts, memory hierarchy, cache memory,I/O communication
	techniques
	
	Operating system overview - 
	objectives and functions, evolution of operating systems,characteristics
	of modern operating systems like windows, Unix, Linux

	Processes - 
	process states, description, control, Unix SVR4 process management, processes
	and threads, symmetric multiprocessing, microkernels, windows thread, SMP 
	management, Solaris thread, Linux process and thread management
	
	Concurrency: 
	mutual exclusion and synchronization- principles of concurrency, mutual
	exclusion-software approaches and hardware support, semaphores, monitors,
	message passing, readers-writers problem, concurrency deadlocks, and 
	starvation – principles of deadlock, deadlock preventation, deadlock 
	avoidance, detection, integrated deadlock strategy, dining philosophers
	problem, Unix concurrency mechanisms, Solaris thread synchronization 
	primitives, windows concurrency mechanisms

	Memory management- 
	its requirements, memory partitioning, paging, segmentation,virtual 
	memory - hardware control structures, operating system software, Unix
	& Solaris memory management, Linux memory management, windows memory 
	management
	
	Scheduling – 
	Uniprocessor scheduling - types, scheduling algorithms, traditional
	Unix scheduling multiprocessor and real time scheduling: Unix 
	scheduling, Windows scheduling IO management and disk scheduling
	- IO devices, organization of IO function, OS design issues, IO buffering,
	disk scheduling, raid, disk cache, Unix IO,
	Windows IO
	
	File management - 
	file organization, directories, file sharing, record blocking, secondary
	storage  management, Unix and Windows file management
	
	References:
	1.	William Stallings, “Operating systems: internals and design principles”,
	    Pearson Education
	2.	Silberschatz, Galvin, “Operating System Concepts”, Addison Wesley   

	Term Work:
	The term-work should consist of practical and case studies based 
	on the above syllabus.
	 
	Practical Examination:
	Practical examination shall be of 3 hours duration 


CSE208:  INTRODUCTION TO MICROPROCESSORS AND MICROCONTROLLER (L-4,T-0,P-1,CR-5)

	Introduction:
	Internal architecture and pin diagram of 8086/8088 microprocessor, 
	Minimum and maximum mode, Timing Diagrams, Address decoding, even 
	and odd memory banks, Accessing memory and I/O ports.  

	Programming with 8086/8088:
	Addressing Modes, Instruction set, Instruction encoding format, Assembler
	directives, 8086 programming examples, String operations, File I/O 
	processing, Far and Near procedures, Macros, Timing and delay loops,
	‘.EXE’ and ‘.COM’ file structures, BIOS calls: INT 10H
	calls, DOS calls: INT 21H calls, TSRs.  

	Interrupt Structure:
	8086 interrupt structure, 8259 priority interrupt controller, 
	Interfacing and programming, 8254 Timer, Interfacing and programming.  
	
	Interfacing with 8086/8088:
	Memory interfacing, Programmable parallel ports, Intel 8255, Block 
	diagram &interfacing, Modes and initialization, Keyboard/Display 
	Controller 8279: block diagram, system connections & programming,
	Serial communication: Asynchronous & synchronous communication, 
	RS-232C protocol, 8251 USART Interfacing and programming, 8257
	Direct memory Access (DMA) Interfacing and programming .

	Introduction to 8051 microcontroller:
	Pin configuration, Architecture, Addressing mode, Instruction set,
	Simple programming examples.

	Term Work:
	The term work shall consist of record of   programs based 
	on the above syllabus.

	Practical Examination:
	Practical examination shall be of 3 hours duration.

	Text Books:
	1. Microprocessors and Interfacing, Programming and Hardware,
	   2nd Edition. Douglas V. Hall
	2. Y. Liu, G. Gibson, “Microcomputer Systems: The 8086/8088 Family, 
	   Architecture, Programming and Design” 2nd Edition.
	3. A. Ray, K. M. Bhurchandi, "Advanced Microprocessors and Peripherals:
	   Architecture, Programming and Interfacing", Tata 
	4. The 8051 microcontroller and embedded system – Muhammad Ali Mazidi

	Reference Books: 

	1. J. Uffenbeck, “80x86 Family: Design, Programming, and Interfacing”,
	   Prentice Hall,
	2. The Intel Microprocessors: 8086/8088, 80186, 80286, 80386,
	   80486, Pentium, Pentium Pro, and Pentium II, Fifth Edition,
	   Barry B. Brey, Prentice-Hall. 



CSE209: NUMERICAL ANALYSIS AND COMPUTATION         (L-4, T-0, P-1, CR-5)

	Approximations & Errors:
	Significant figures, accuracy & precision, Error definitions, round 
	off errors, Truncation errors, Error Approximations, Total numerical
	errors, Blunders formulation errors and  Data uncertainty.
	
	Roots of Equation:
	Bracketing Methods: Graphical methods, Bisections method, false 
	position method  Open Methods: Simple one point iteration method,
	Newton Raphson method, secants method, multiple Roots, System of nonlinear
	equations, Case Study: Design of Electric circuit and General
	Engineering problems.

	System of Linear algebraic equations:
	Gauss eliminations method, pitfalls of elimination, techniques for
	improving solutions.Gauss Jordan & Guass seidal methods. Matrix 
	inverse, error analysis and system condition and Guass Seidal method.
	
	Curve fitting:
	Least Squares regression: Linear regression, Polynomial regression, 
	multiple linear regression, nonlinear regression. 
	
	Interpolation:
	Newtons divided difference-interpolating polynomials, Lagrange
	interpolation polynomials and Spline Interpolation.

	Numerical Differentiation & Integration:
	Newton cotes integration formula: trapezoidal rule, Simpson’s rule,
	and integration with unequal segments. Integrations of equations: 
	Romberg integration, gauss quadralure integration improper integration.
	Numerical Differentiation, High accuracy differentiation formula, Richardson
	extrapolation, Derivative of unequally spaced data, derivative and 
	integral estimates for data with errors. Case studies:  Cash flow analysis,
	determination of root mean square current by numerical Integration.

	Ordinary differential equations:
	One step method: Euler’s method, modification & improvement of Euler’s
	method, Runga-Kutta methods, system of equation Case Study: Mathematical
	model for computer sales Projection, Simulating transient current for 
	Electrical circuit.

	Term work:
	The term work shall consist of   programs based
	on above syllabus.  

	Practical Examination:
	Practical Examination shall be of three hours duration  

	Reference Books:
	1.Steven C Chapra, “Numerical Methods For Engineers”. 
	2.S. S. Satry, “ Introductory Methods of Numerical Analysis”.
	3.V. Rajaraman, “Computer Oriented Numerical Methods”.


HU201: COMMUNICATION SKILL        (L-0,T-0,P-1,CR-1)

	Objective:
	The main objective of this course is to prepare the engineering 
	students for future career, further studies through development of
	listening, reading writing and speaking skills.

	Methodology:
	The course may be dealt with in following ways: -
	1.Discussion by tutor about theoretical nature of different aspects 
	  of Communication Skill.
	2.Practice of it by the students as pronunciation, public speaking 
	  and organizing meeting etc.
	3.Intervention by the tutor for corrective measures.
	4.Understanding and grasping and then reporting by the students.

	Contents:
	What is communication- need, importance, types, and objectives.
	Communication process, barriers. Principles of effective communication.

	1.Modes of communication.

	2.Practice of effective communication through eye contact, voice
	  modulation, audience awareness,presentation plan and 
	  non-verbal language.

	3.Face to face conversation- self-analysis.

	4.Understanding guidelines for telephonic conversation, making and 
	  receiving calls, telephone message.

	5.Interviews for employment – Preparing self and reporting for sample
	  questions on educational background, co-curricular activities, extra 
	  curricular activities, experience, and general knowledge, miscellaneous.

	6.Data Collection- Role of communication in organizations around and 
	  experience sharing by the students.

	7.Meetings: understanding role and importance of procedure, chairmanship,
	  participation, and physical arrangements, rules for successful meeting-
	  experience sharing and reporting.

	8.Group Discussions, Seminars and Conferences- Understanding different
	  aspects-experience sharing and reporting.

	9.Practice of public speaking with use of audio – Visual and Graphic
	  aids, experience sharing and reporting.

	10.Paragraph writing – Understanding principles, general hints writing and
	   analyzing paragraph writing on3-5 topics.

	11.Understanding the principles and practice of –
	   office drafting, circular, notices,memos, and telex/telegraph/email
	   messages.Application resumes, sales enquiry, reply order,complaint 
	   Reports, feasibility report, analytical report, progress report,
	   project report,inspect of damage and losses etc.

	12.Preparation of notices, agenda, minutes etc.

	13.Language Grammar –
	   Concept, units of expression and meaning- Graphemes, and phonemes,
	   Morphemes, words, phrases, clauses sentences, sentence elements etc.

	14.Oral Skills – Articulation of sounds structure of syllable stress,
	   rhythm, connected speech, intelligibility, clarity and pitch.

	15.Use of integrated skills of communication.

	Term work and Reporting:
	Term work will be in the form of Report containing minimum 
	10-12 exercises based on separate topics as mentioned in the syllabus.
	The assessment will be made by the concerned teacher or an internal 
	examiner appointed by the Principal of the College.

	Reference Books:
	1.Developing Communication Skill by Krishna Mohan and Meera Banerjee,
	  McMillan Publishers. 
	2.Communication Skill – B.V. Pathak, Nirali Prakashan. 
	3.Writing Correct English – Readers Digest Publication. 
	4.GRE by Baron 
	5.Audio Cassettes by Baron. 

	Note: Exercises on Chapter No. 1, 2, 3 and 7 are desirable and one each 
	      on other topic is essential.

	
	
	
	

CSE301: Database Management Systems       (L-4, T-0,P-0, CR-4)
	 
	Introduction 	 
	Basic concepts, Advantages of a DBMS over file-processing systems, Data 
	abstraction,Data Models and data independence, Components of  DBMS and 
	overall structure of  DBMS,Data Modeling, entity, attributes, relationships, 
	constraints, keys E-R diagrams, Components of E-R Model.	
	
	Relational Model	 
	Structure, relational algebra, tuple and domain relational calculus, 
	extended relational algebra operations, news and modifications  

	SQL 	 
	Basic structure, set operations, aggregate functions, null values, data definitions,
	embedded SQL, other   SQL features and views	
	
	Relational Database Design	 
	Concept of integrity and referential constraints Notion of normalized relations, 
	functional dependency, decomposition and properties of decomposition, 
	Normalization using functional dependency, Multi-valued dependency and Join 
	dependency.

	Object-Based Databases 	 
	Nested Relations, Complex Types and Object Orientation,Querying with Complex Types,
	Creation of Complex Values and Objects, Comparison of Object-Oriented and 
	Object-Relational Databases.

	Storage and file structure  	 
	Physical storage media, magnetic disks, RAID, territory storage, file organization,
	organization of records in files, data dictionary storage, storage structures 
	for object oriented databases

	Indexing and hashing 	 
	Index sequential files, B-tree indexed files, B+ trees index files, static and
	dynamic hash functions, comparison

	Query Processing  	 
	Query interpretations, equivalence of expressions, estimation of query processing 
	cost, estimation of cost of access using indices, join strategies, structure of 
	query optimizer

	Transaction processing and management  	 
	Transaction concept, transaction state, implementation Atomicity and Durability,
	Concurrent Executions, Serializability, Implementation of Isolation ,
	Transaction definition in SQL

	Database system Architecture 	 
	Centralized, Client Server, Parallel and Distributed Systems . Web enabled System

	References Books  	
	1.  Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database system concepts”,
	    5th Edition, McGraw Hill International Edition.
	2.  Raghu Ramkrishnan, Johannes Gehrke, “Database Management Systems”, 
	    Second Edition, McGraw Hill International Editions.
	3.  Rob Coronel, “Database systems: Design implementation and management”,
	    4th Edition, Thomson Learning Press
	4.  C.J.Date ,”An introduction to Database system” , 7th Edition 	

	Term Works  	

	The Term-work shall consist of at least ten practicals based on the above syllabus 
	or a simple Database Design Mini Project using the database concepts that are 
	covered in the curriculum. Practical examination will be based on the above 
	term-work and questions will be asked to judge the understanding of term-work 
	performed at the time of exami-nation.

CSE302: Theory of Computation          (L-4, T-0, P-1, CR-5)

	Introduction:
	Automata, Computability, and Complexity. Types of Proof.  

	Regular Languages
	Finite Automata, formal definition, examples, designing finite automata, 
	the regular operations
	
	Nondeterminism 	 
	Formal definition, equivalence of NFAs and DFAs, closure under the regular operations.	
	
	Regular expressions	 
	Formal definitions, equivalence with finite automata.
	
	Nonregular Languages 
	The Pumping lemma for regular languages.	
	
	Context-Free Languages  	 
	Context-free Grammars, formal definition, examples, designing context-free
	grammars, Ambiguity, Chomsky normal form.
	
	Pushdown Automata
	Formal definition, examples, equivalence with context-free grammars.

	Non-context-free Languages  	 
	The pumping lemma for context-free languages. 

	The Church-Turing Thesis
	Turing Machines, formal definition, examples

	Variants of Turing Machines
	Multitape Turing Machines, Nondeterministic Turing Machines, Enumerators, equivalence 
	with other models, The Definition of Algorithm, Hil-bert’s problems.
	
	Decidability
	Decidable Languages and the Halting Problem.

	Complexity Theory
	Time Complexity, Measuring Complexity, The Class P, The Class NP,
	Np-completeness, NP-complete problems.


	Reference Books:
	01. M. Sipser, Introduction to the Theory of Computation, Brooks/Cole 
	    Thomson Learning, 1996
	02. H.R. Lewis and C.H.Papadimitrou, Elements of the Theory of Computation,
	    Prentice Hall Inc., 1999
	03. J.E. Hopcroft, Rajeev Motwani and J.D.Ullman, Introduction to Automata, 
	    Languages and Computation, Pearson Education, 2002.
	04. Dexter Kozen, Automata and Computability, Springer Verlag.



CSE303: UNIX & System programming                  (L-4, T-0, P-1, CR-5)

	Introduction
	System structure, user perspective, operating system services, system  commands,
	assumption about hardware.
	
	Shell Programming 
	Bourne shell and C shell progamming, variables, constants, environments, control
	structures, shell scripts examples
	
	Introduction to kernel 
	Architecture of the Unix operating system, introduction to system concepts,
	kernel data structures, and system administration
	
	Buffer Cache
	Buffer headers, structure of buffer pool, scenarios for retrieval of a buffer,
	reading and writing disk blocks
	
	Internal Representation of Files
	Inodes, Structure of a regular file, directories, Conversions of a path name to 
	I node, super Block, I node assignment to a new file, allocation of disk blocks,
	other file types

	System Calls of the file systems :  
	Open, read, write, file and record locking, lseek, close, file creation, creation
	of special files, change directory and change root, change owner and change mode,
	stat and fstat , pipes, dup, mounting and un-mounting file system, link and unlink,
	file system abstraction, file system mainten-ance

	Process Control
	Process creation, signals, process termination, awaiting process termination,
	invoking other programs, UID of a process, changing the size of a process, 
	The shell, system boot and the init process.

	Memory management policies
	Swapping, demand paging, a hybrid system with swapping and demand paging

	I/O Subsystem
	Driver interfaces, disk drivers, terminal drivers.
    
	Term work:

	The Term-work shall consist of at least ten practicals based on the above syllabus.
	Prac-tical examination will be based on above term-work and questions will be asked
	to judge the understanding of term-work performed at the time of examination. 
	
	
	Reference Books:
	
	1.  M. J. Bach, “The Design of the UNIX operating Systems”, PHI
	2.  Richard Stevens, “UNIX Network Programming”, PHI
	3.  John Muster, “UNIX made easy”, Third Edition, TMH Edition


CSE304: Computer Algorithms                  (L-4, T-0, P-1, CR-5)

	Introduction: 
	The role of algorithm in computing, insertion sort, analyzing algorithms,
	designing algorithms, growth of functions, recurrences	   
	
	Divide and conquer
	General method, binary search, merge sort, quick sort,lower bounds for sorting
	by comparison of keys
	
	Greedy method
	General method, Knapsack problem, job sequencing with dead-lines, minimum cost 
	spanning trees-Prim’s algorithm, Kruskal’s Algorithm, single source shortest paths.

	Dynamic programming
	General method, multistage graphs, all pairs shortest paths, single source
	shortest paths, optimal binary search trees, reliability design, traveling 
	salesperson problem.
	
	Basic search and search techniques:
	Techniques for graphs, Breadth First search traversal, Depth First search traversal,
	connected components and spanning trees, biconnected components and DFS.
	
	Backtracking: 
	General method, eight queens problem, sum of subsets, graph color-ing, Knapsack problem.
	
	Branch and bound
	Least cost search, 15-puzzle; An example, control abstraction for LC search,
	bounding,FIFO branch and bound, LIFO branch and bound, Knapsack problem, 
	LC branch and bound solution. 
	
	NP- Completeness
	Polynomial time, polynomial time verification, NP- com-pleteness and reducibility,
	Np-complete problems.
	
	Term Work:

	The Term-work shall consist of at least ten practicals based on the above syllabus.
	Prac-tical examination will be based on above term-work and questions will be asked
	to judge the understanding of term-work performed at the time of examination

	 
	
	Reference Books: 

	01. Thomas cormn, C. E. Leiserson, Ronald L. Rivest " Introduction to algorithms"
	02. Sara Baase, Allen V Gelder “Computer Algorithms – Introduction to design  
	    & anal-ysis” Pearson Education
	03. Brassard, Bratly “Fundamentals of algorithms”.



CSE305 : Introductory Course on JAVA                 (L-4, T-0, P-1, CR-5)

	Working with AWT 
	AWT classes, Component, classes, panel, Graphics, working with color,
	image based web manus.

	User interface component with swing
	Model controller, Layout management, text input, choice component, menus, 
	dialog boxes.	

	Graphics Programming
	Swing, event handling, exception handling, stream & files, Applet & 
	its applications.
	
	Generic Programming:
	Multithreading, String handling,
	
	Networking:
	Socket, client server, reserved socket, proxy server, internet addressing, Java 
	network classes & interfaces.
	
	Network Security: 
	Network security in JAVA 
	
	JDBC: 
	database programming with JDBC
	
	JAVA Utilities
	Collections framework, Collection interfaces, list, set, sorted set inter-faces.
	Collection ofclasses, Array list, linked list, handset, Linked Hash set,Tree Set,
	Hash table.
	
	Term work:

	The Term-work shall consist of at least ten  practicals based on the above syllabus.
	  
	
	Practical Examination:
	
	Prac-tical examination will be based on above term-work and questions will be 
	asked to judge the understanding of term-work performed at the time of examination

	Reference Books: 
	
	01. Horstmann,Cornell: “Core Java 2:Volume 1-Fundamentals” Pearson Education
	02. Grorge Reese : “Database Programming with JDBC and JAVA” O’REILLY




               
		 
		 
		 

CSE306: Computer Networks        (L-4, T-0, P-0, CR-4)

	Introduction 
	Uses of computer networks, network hardware, network software, reference models,
	example of networks, example data communication services

	The physical layer
	Theoretical basis for data communication,transmission media,wireless transmission,
	the telephone system, narrowband ISDN, broadband ISDN and ATM, cellular radio 
	and communication satellite, data transmission: Concepts and terminology, 
	analog and digital data transmission and transmission impairments

	Data link layer
	Data link layer design issues, error detection and correction, ele-mentary data 
	link protocols, sliding window protocols, example data link protocols

	Medium access sublayer
	The channel allocation problem, multiple access proto-cols, IEEE standard 802 
	for LANS and MANS, bridges, high speed LANs, satellite Networks

	Network layer 
	Network layer design issues, routing algorithms, congestion control 
	algorithms, internetworking

	Transport layer
	The transport service,elements of transport protocols & simple transport 
	protocols

	Application layer
	Introduction to network security, DNS, SNMP, Email, USE-NET, WWW, multimedia
	
	Term work:

	The Term-work shall consist of at least ten  practicals based
	on the above syllabus.
	Prac-tical examination will be based on above term-work 
	and questions will be asked to judge the understanding of 
	term-work performed at the time of examination.

	REFERENCES BOOKS

	01 Andrew S. Tanenbaum, “Computer networks”, PHI   
	02 William Stallings, “Data & computer communication”,
	   Pearson Education publication
	03 Ullyess Black, “Computer Networks”, PHI.


CSE307: Compiler Construction         (L-4,T-0,P-1,CR-5)
        Introduction
	Analysis of the source program, phases of a compiler, compiler 
	con-struction tools, simple one pass compiler.

	Lexical analysis
	Role of lexical analyzer, input buffering, specification and 
	recogni-tion of the tokens, a language for specifying lexical 
	analyzers, finite automata, con-version of regular expression
	and NFA, optimization of DFA.

	Syntax analysis
	Role of parser, context free grammars, top down and bottom up 
	parsing operator precedence parsing. LR parsers, using ambiguous
	grammars, parser generators

	Syntax directed translation
	Definition, construction of syntax trees, bottom up evaluation
	of S-attributed definitions, L-attributed definitions, top 
	down translation, bottom up evaluation of inherited attributes 
	recursive evaluators, space for attribute values at compiler time,
	type checking.

	Run-time environments: 
	Source language issues, storage organization, access to nonlocal
	names, parameter passing, symbol tables, dynamic storage 
	allocation tech-niques.

	Intermediate code generation
	Intermediate language, declarations, assignment statements,
	Boolean expressions, case statements, back patching, procedure
	calls.

	Code Generation
	Issues in the design of a code generator, the target machine,
	run time storage management, basic blocks and flow graphs, next
	use information, a sim-ple code generator, register allocation 
	and assignment, the dag representation of basic blocks, peephole
	optimization, generating code from dag, dynamic programming code
	generation algorithm, code-generator generators

	Code Optimization
	Introduction, the principal sources of optimization, optimization
	of basic blocks, loops in flow graphs,introduction to global 
	data-flow analysis,itera-tive solution of data-flow equations,
	efficient data-flow algorithms,estimation of types.

	Term Work:
	The Term-work shall consist of at least ten practicals based on
	the above syllabus. 

	Practical Examination:
	Prac-tical examination will be based on above term-work
	and questions will be asked to judge the understanding of 
	term-work performed at the time of examination.

	Reference Books:
	01. Alfred V. Aho, Ravi Sethi, Jeffry D. Ullman, “Compilers principles, 
	    techniques and tools”, Addison Wesley
	02. Damdhere  D.M., “Compiler construction, principle and practice”, 
	    MacMillan pub-lisher,
	03. Holab A.J., “Compiler design in C”, PHI



CSE308: Software Engineering       (L-4,T-0,P-1,CR-5)

	The Product and the Process:
	The Product: The evolving role of software, s/w characteristics, s/w
	applications, software myths. The process: Software engineering,
	software process, software process models, linear sequential model,
	prototyping model, the RAD model, evolutionary software process 
	models, component-based development, the formal methods model
	
	Managing Software projects:
	Project management concepts: The management spectrum, people, the
	product, and the process. Software process and project metrics: 
	Measures, metrics and indicators, s/w measurement, metrics for 
	s/w quality, integrating metrics within s/w engineering process,
	managing variation, establishing s/w metrics program.
	Software Project Planning: Project planning objectives,
	software scope, resources, software project estimation, 
	decomposition techniques. Risk analysis and management: reactive 
	versus proactive risk strategies, software risks, risk 
	identification, risk projection, risk refinement, risk mitigation,
	monitoring and management, safety risks and hazards. Project 
	scheduling and tracking: basic concepts, the relationship 
	between people and effort, defining a task set for the software
	project. Software quality assurance: Quality concepts, the quality
	movement, software quality assurance and software reviews.
	
	Conventional Methods for Software Engineering
	System Engineering: Computer based systems, system engineering 
	hierarchy, business process engineering, product engineering, 
	requirements engineering, system modeling. Analysis Modeling: 
	data modeling, functional modeling and information flow, 
	behavioral modeling, the mechanics of structured analysis,
	the data dictionary. Design concepts and principles: s/w design
	and s/w engineering, design process, design principles, design
	concepts, effective modular design, design documentation. 
	Architectural design: Software architecture, data design, 
	mapping requirements into a software architecture, transform
	mapping, transaction mapping. User interface design: golden rules,
	user interface design, task analysis and modeling, interface 
	design activities, implementation tools. Software testing 
	techniques: Testing fundamentals, test case design, white 
	box testing, basis path testing, control structure testing,
	black box testing, testing for specialized environments, 
	architectures and applications. Software testing strategies:
	a strategic approach, strategic issues, unit testing, integration
	testing, validation testing, system testing and the art of debugging

	Object oriented software engineering
	Object oriented concepts and principles, object oriented analysis,
	object oriented design and object oriented testing
	
	Advanced topics in software engineering
	Component based software engineering, client/server software 
	engineering, web engineering and reengineering

	Term Work:
	The Term-work shall consist of at least ten  practicals based
	on the above syllabus.
	 
	Practical Examination:
	Practical examination will be based on above term-work
	and questions will be asked to judge the understanding of 
	term-work performed at the time of examination

	
	References:
	1. Stephen R. Schach, “Object oriented and Classical software
	   Engineering”, TMH edi-tion 
	2. David Gustafson, “Software engineering”, TMH edition    
	3. Pankaj Jalote, “Software Project Management in Practice”,
	   Pearson Education 
	4. Pressman, “Software Engineering”, fifth edition, McGraw Hill 
	5. Ghezzi, Jazayeri and Mandrioli, “Fundamentals of software
	   Engineering”, 2/e, Prentice Hall 
	6. Ian Sommerville, “Software Engineering”, Pearson education Asia 

 


CSE309: Computer Organization (L-4,T-0,P-1,CR-5)
 
	Introduction:
	organization and architecture, structure and function, a brief 
	history of computers, designing for performance  

	The computer system: 
	computer components and function, interconnection struc-tures,
	bus interconnection, peripheral component interconnect, computer
	memory system overview, semiconductor main memory, cache memory,
	cache organization, advanced DRAM organization, external memory
	and input/output   

	The central processing unit: 
	the arithmetic and logic unit, integer representation, integer
	arithmetic, floating point representation, floating point 
	arithmetic, processor organization, register organization,
	instruction cycle, instruction pipelining, Pentium processor,
	instruction execution characteristics, use of a large register
	file, compiler-based register optimization, reduced instruction
	set architecture, RISC pipelining, RISC versus CISC controversy  
	
	The control unit:
	micro-operations, control of the processor, hardwired implementation,
	basic concepts of the micro-programmed control, microinstruction 
	sequencing and execution and applications of microprogramming 

	Multiprocessors: 
	Programming multiprocessors, single bus and network oriented
	multiprocessors, clusters, network topologies


	Reference Books:
	1. David A. Patterson, John L. Hennessy, “Computer Organization
	   and Design:The Hardware/Software Interface”, Morgan-Kaufman publisher
	2. William Stallings, “Computer organization and architecture”,
	   Pearson Education
	3. Randal Bryant and David, “O'Hallaron Computer Systems: A Programmer's
	   Perspec-tive (CS: APP)”, Prentice Hall, 2002 


	
CSE310: Advance course on Java         (L-4, T-0, P-1, CR-5)

	Networking : 
	Inet Address - Factory, instance methods, TCP/IP client sockets,
	WHOIS, URL format, URL connection, TCP/IP server sockets, A caching
	proxy HTTP server, Datagram, URL classes, java beans, JAR packaging,
	networking parts.
	
	Database handling : 
	Relational database, SQL, JDBC, Graphics, sound, client server
	computing, networking parts, SMTP (email), Remote method 
	innovation (RMI), IDL & CORBA Connectivity

	J2EE 1.4platform: 
	Enterprise java beans technology, java servlet technology,
	java server page technology, J2EE applications
	
	J2SE:
	J2SE SDK classes, primitives, arrays, value types, java 
	beans component. 
	
	Java server pages technology :
	What is JSP pages, examples, life cycles, creating static,
	dynamic contents, expression language, java beans component,
	using custom tags, reusing custom tags, reusing content in 
	JSP pages, transferring control to another web page component
	including applet, setting properties for group of JSP pages.
	JSP standard library, variables, tags, flow controls, message
	tag, custom tags, servlets, java struts.

	Enterprise beans: 
	Enterprise bean, session beans, entity bean, message driven
	beans, defining client access with interfaces, life cycle 
	of enterprise beans.XML,SOAP, Messaging ,Creating J2EE 
	application ,Creating enterprise beans-Coding, compiling,
	packaging, specifying, creating application client, creating 
	web client, primary key for bean managed.


	Term work:
	The Term-work shall consist of at least ten  practicals based
	on the above syllabus.  

	Practical Examination:
	Practical examination will be based on above term-work
	and questions will be asked to judge the understanding of
	term-work performed at the time of examination  

	Reference Books:
	1. Java Network programming, Elliotte Rusty harold,
	   O’reilly Publication 
	2. Java How to Program,  Deitel & Associates,  
	   Pearson Education
	3. J2EE Architecture, Kumar Sangeeta Subrahmanya, TMH India


CSE311: Mini Project

	Objective:
	Mini Project shall be based on any recent topic selected by the
	students working in a group. In any group more than three 
	students are not allowed. Laboratory load of four hours per 
	week per group shall be allotted to the teacher. The guide 
	shall give the term-work marks by assessing the work done 
	and the submitted bound report by the students in the group.
	External practical examination shall be based on the work 
	demonstrated by the group, followed by the oral examination.




CSE401: Industrial Training

	Objective:
	Every student should undergo training for a period of one 
	month during summer vacation and he/she has to prepare and
	submit a report that will be evaluated through a seminar
	giv-en by him/her. The performance will be considered in 
	the first term of final year

	

	
	
	
	

CSE402 Advanced Database Management Systems           (L-4,T-0,P-2,CR-5)
	 
	  Distributed Databases 	 
	Introduction, Promises of DDBSs, Complicating factors, problem areas of DDBSs,
	Architectural models for Distributed DBMS, Distributed DBMS architecture.
	Distributed database Design: Alternative Design Strategies, Distribution 
	Design issues.	
	
	Distributed Query Processing	 
	Query processing problem, objectives of Query processing, Complexity of 
	Relational Algebra operation, Characterization of Query processors, Layers
	of Query processing. Distributed Transactions, Commit protocols, Concurrency
	control in Distributed Databases, Failures and fault Tolerance in 
	Distributed databases.  

	Parallel Databases	 
	Database servers, Parallel architectures, parallel DBMS techniques, parallel
	execution problems, parallel execution for Hierarchical architecture.	
	
	Application development and administration	 
	Web interfaces to databases, performance tuning, performance 
	benchmarks, standardization, e-commerce, and legacy systems

	Advanced Querying and Information Retrieval 	 
	Decision support systems, data analysis and OLAP, data mining,
	data warehousing, and information retrieval systems

	Advanced Data Types and New Applications  	 
	Motivation, time in databases, spatial and geographic data, 
	multimedia databases, mobility and personal databases

	Advanced Transaction Processing 	 
	Transaction processing monitors, transactional workflows, 
	main memory databases, real time transaction systems, long 
	duration transactions, transaction management in multidatabases

	Multidimensional Indexes  	 
	Application needing multiple dimensions, hash like 
	structures for multidimensional data, tree like 
	structures for multidimensional data, bitmap indexes

	Information Integration  	 
	modes of information, wrappers in mediator based systems,
	on-line analytic processing, data cubes, data warehouses
	and data mining applications

	XML 	 
	Background, Structure of XML Data, XML Docu-ment Schema,
	Querying and Transformation, API, Storage of XML Data, 
	XML Applications

	References Books  	
	1.  Naveen Prakash, “Introduction to database management”, TMH
	2.  Rob and Coronel, “Database Systems”, Fifth Edition, Thomson
	3.  Molino, Ullman and Widom, “Database System Implementation”,
	    Pearson Education Asia
	4.  Ozsu and Valduriez, “Principles of Distributed Database Systems”,
	    Pearson Education Asia
	5.  Database management, Objectives, system functions and 
	    administration, Gordon Everest
	6.  Ramkrishnan and Gehrke, “Database Management Systems”, 
	    MGH International Edition
	7.  Silberchatz, Korth and Sudarshan, 
	    “Data base systems con-cepts”, MGH, 4th edition



	Term Works  	

	The Term-work shall consist of at least ten practicals based
	on the above syllabus or a simple Database Design Mini Project
	using the database concepts that are covered in the curriculum.
	Practical examination will be based on the above 
	term-work and questions will be asked to judge the understanding
	of term-work performed at the time of exami-nation.



CSE403 Object Oriented Modeling and Design         (L-4,T-0,P-2,CR-5)

	Introduction:
	Object Orientation-System Development, Review of objects,
	Inheritance, Object Relationship, Dynamic binding, - 
	OOSD life cycle, Process, Analysis, Design, Prototyping,
	Implementation- Testing  

	Methodology and UML
	Overview of Methodologies, OMT- Booch methodology, Jacobson Methodology,
	Unified approach-UML-Class Diagram, Dynamic modeling
	
	Analysis 	 
	 Use case model- Creation of classes-Noun phrase approach- Responsibilities
	 -Collaborators- Object Relationship- Super-Sub class- Aggregation	
	
	Design	 
	OO Design Examples- Class visibility- Refining attributes- Methods- 
	Access layers- OODBMS- Tables- Class mapping view layers- VI designing
	
	Software Quality 
	Quality Assurance testing—Inheritance and testing- Test plan Usability
	testing- User satisfaction- Testing.	
	



	Reference Books:
	01. Ali Bahrami- “ Object oriented System Development” 
	    Mcgraw Hill International Edition, 1999
	02. Booch G. “ Object Orineted Ananlysis and Design” 
	    Addition Wesley Publishing Company 1994
	03. Rambaugh J. Blaha, M. Premerlani W. Eddy F and Loresen W.
	   “ Object Oriented Modelling and Design”. PHI 1997


    Term Works  	

	The term-work should consist of at least eight practicals based
	on the above syllabus. Practical examination will be based on 
	above term-work and questions will be asked to judge the 
	understanding of term-work performed at the time of examination
	



CSE404 TCP/IP Networking                         (L-4,T-0,P-2,CR-5)

	Introduction
	Introduction and overview, Concepts and architectural model,
	Internet addresses.
	
	Address mapping 
	Mapping Internet addresses to physical addresses (ARP), 
	Reverse address resolution protocol (RARP).
	
	Internet protocols 
	Connectionless datagram delivery, Routing IP Datagrams, 
	Error and control messages (ICMP), Classless and Subnet 
	address Extensions (CIDR), Protocol layering.
	
	Transmission Protocols: 
	User datagram protocol (UDP), Reliable stream transport service (TCP).
	
	Routing: 
	cores, peers and algorithms, Routing: Exterior gateway protocols 
	and autonomous systems (BGP), Routing: In an autonomous system 
	(RIP, OSPF, HELLO).

	Other Topics:  
	Internet multicasting, TCP/IP over ATM networks, mobile IP,
	Private network interconnection (NAT, VPN), Client server model,
	Bootstrap and auto con-figuration (BOOTP, DHCP), The domain name
	system (DNS).

	Applications: 
	Remote login (TELNET), File transfer and access (FTP), Electronic 
	Mail (SMTP), world wide web (HTTP), voice and video over IP (RTP), 
	Internet Security and Firewall design.

	
    
	Term work:

	The Term-work shall consist of at least ten practicals based
	on the above syllabus.
	Prac-tical examination will be based on above term-work and
	questions will be asked to judge the understanding of term-work
	performed at the time of examination. 
	
	
	Reference Books:
	
	1.  Behrouz A. Forouzan, “TCP/IP Protocol Suite”, TMH Edi-tion
	2.  Stevens, “TCP/IP illustrated”, Vol. 1, Pearson Education
	3.  William Stallings, “Data and computer communications” PHI
	4.  Siyan, “TCP/IP Unleashed”, Third Edition, Pearson Educa-tion
	5.  Snader, “Effective TCP/IP Programming”, Pearson Educa-tion
	6.  Comer, “Internetworking with TCP/IP”, Vol. 1, Fourth Edition, 
	    Pearson Education
	7.  Laura A. Chappell, “Guide to TCP/IP”, Thomson Learning



CSE405  Elective I                       (L-4,T-0,P-2,CR-5)
Artificial Neural Networks

	Feedforward networks: 
	Fundamental concepts- Models of artificial neural network (ANN); 
	Learning and adaption; Learning rules, Classification model, 
	Features and decision regions, Perceptron networks, Delta 
	learning rules for multi-perceptron layer, Generalized learning 
	rule, Error back-propagation training, Learning factors	   
	
	Recurrent networks: 
	Mathematical foundation of discrete time and gradient type 
	Hopefield networks, Transient re-sponse and relaxation modeling
	
	Self-organizing networks: 
	Hamming net and MAXNET, Unsupervised learning of clusters, 
	Counterpropagation network, Feature mapping, Self organizing
	feature maps, Cluster discovery network (ART1).

	Fuzzy Neural Networks: 
	Fuzzy set theory, Operations on fuzzy sets, Fuzzy neural 
	networks, Fuzzy min-max neural networks, General fuzzy 
	min-max neural network
	
	Applications: 
	Handwritten character recognition, Face rec-ognition, 
	Forecasting, Image compression
	
	
	
	Term Work:

	The Term-work shall consist of at least ten practicals based
	on the above syllabus.
	Prac-tical examination will be based on above term-work
	and questions will be asked to judge the understanding of
	term-work performed at the time of examination

	 
	
	Reference Books: 

	01.  Jacek Zurada, “Introduction to ANN”, Jaico Publishing House
	02.  Bose and Liang, “Neural network fundamentals with Graphs, 
	     Algorithms, and Applications”, TMH edition
	03.  Ham and Kostanic, “Principles of Neurocomputing for Science 
	     and Engineerin”, TMH edition




CSE401 Industrial Training                   (L-0,T-0,P-0,CR-2)

	INDUSTRIAL TRAINING 
	Students undergone for training for a period of one month 
	during summer vacation after second semester of third year
	has to prepare and submit a report that will be evaluated 
	through a se-minar given by them.





CSE406 Project-I                               (L-0,T-0,P-8,CR-4)

	PROJECT - I
	Project shall be based on any recent topic selected by 
	the students working in a group. In any group more than 
	two students are not allowed. Teaching load of two hours 
	per week per group shall be allotted to the teacher. The 
	guide shall give the term-work marks by assessing the work
	done and the submitted bound report by the students in the
	group. External practical examination shall be based on the
	work demonstrated by the group, followed by the oral 
	examination conducted by the panel of examiners, consisting
	of guide working as a senior examiner and other external 
	examiner(s), appointed by the Institute.	

	




               
		 
		 
		 

CSE 407 Computer Graphics        (L-4, T-0, P-0, CR-4)

	Introduction 
	Types of displays, displays and display processors, display 
	adapters-VGA, SVGA, graphic accelerators, file formats of BMP,
	TIFF, PCX, GIF

	Line and circle generation: 
	Line, circle and character generation methods

	Polygons: 
	Types, representations, polygon filling, scan conversion,
	run length encoding, cell encoding

	Geometrical transformation: 
	2-D transformations, 3-D transformations, concepts of 
	parallel and perspective projections, 3-D clipping 

	Windowing and clipping: 
	viewing transformations, 2-D clipping, Sutherland Kohen
	algorithm, Cyrus Beck algo-rithm, Sutherland Hodgman 
	algorithm

	Hidden surfaces and lines: 
	Back face removal algorithm, hidden line methods, Z buffer,
	Warnock and Painter al-gorithm, floating horizon

	Light color and shading: 
	Diffused illumination, point source illumination, shading 
	algorithm, color models, eliminating back spaces, 
	transparency, reflections and shadows
	
	Curves and fractals: 
	Curve generation, interpolation and algorithms, B-splines 
	curves, Bezier curves, fractals, fractal surfaces and lines
	
	
	Term work:

	The Term-work shall consist of at least ten  practicals based
	on the above syllabus.
	Prac-tical examination will be based on above term-work
	and questions will be asked to judge the understanding of
	term-work performed at the time of examination.

	REFERENCES BOOKS

	01 David F. Rogers, “Procedural elements for computer graphics”,
	   Mc-Graw Hill Int. editions   
	02 Foley, Van dam, Feiner, Hughes, 
	   “Computer graphics principles and practice”, Addison Wesley




CSE408 Distributed Systems         (L-4,T-0,P-1,CR-5)
        Introduction
	Definition, goals, hardware and software concepts, client/server model

	Communication: 
	Layered protocols, RPC, ROI, MOI, SOC

	Processes: 
	Threads, clients, servers, code migration, soft-ware agents

	Naming: 
	Naming entities, locating mobile entities, removing un-referenced entities 

	Synchronization: 
	Clock synchronization, event ordering, mutual exclusion, 
	deadlock, election algorithms

	Consistency and replication: 
	Data centric consistency models, client centric consistency 
	model, distribution pro-tocols, consistency protocols

	Distributed file systems: 
	NFS, CODA, XFS, SFS	 

	Distributed object based systems: 
	CORBA and COM DCOM

	Distributed document based systems:
	WWW

	Term Work:
	The Term-work shall consist of at least ten practicals based
	on the above syllabus. 

	Practical Examination:
	Prac-tical examination will be based on above term-work
	and questions will be asked to judge the understanding of
	term-work performed at the time of examination.

	Reference Books:
	01. Singhal and Shivaratri, 
	    “Advanced concepts in Operating Systems”, TMH edition 
	02. P.K. Sinha, “Distributed operating system”, IEEE press
	03. Tenenbaum and Steen, “Distributed systems”, PHI, 2002  



CSE409 Data and Network Security       (L-4,T-0,P-2,CR-5)

	Introduction to cryptography: 
	What is Cryptography, Encryption Schemes, Functions, 
	Secret Key Cryptography, Public Key Cryptography, 
	Hash Algorithms
	
	Conventional Encryption: 
	Classical techniques, Modern Techniques, Algorithms, 
	Confidentiality using conventional encryption
	
	Public Key encryption and Hash Function:
	Public Key Cryptography, Introduction to number theory,
	Message au-thentication and hash function, Digital 
	Signatures and au-thentication protocols

	System Security: 
	Kerberos, Web security SSL, TSL, Firewalls
	
	Advanced topics in software engineering
	Component based software engineering, client/server software engineering, 
	web engineering and reengineering

	Term Work:
	The Term-work shall consist of at least ten  practicals based
	on the above syllabus.
	 
	Practical Examination:
	Practical examination will be based on above term-work
	and questions will be asked to judge the understanding of
	term-work performed at the time of examination

	
	References:
	1. King, Dalton, and Osmanoglu, “Security Architecture”, TMH edition  
	2. Kaufman, Perlman, and Spenciner, “Network Security”, PHI   
	3. William Stalling, “Cryptography and Network and Network
	   security-Principals and practices”, Pearson Education 
	

 


CSE410 Elective-II:  (L-4,T-0,P-2,CR-5)

    Mobile Computing
 
	Introduction to Wireless Communication Systems:  
	Evolution of mobile radio communications, examples of wireless
	communication systems  

	The Cellular Concepts–System Design Fundamentals: 
	Introduction, frequency reuse, channel assignment strategies, 
	handoff strategies, interference and system capacity, trunking 
	and grade of service, improving coverage and ca-pacity in 
	cellular systems   

	Multiple Access Technology: 
	Introduction to multiple access, FDMA, TDMA, SSMA, SDMA, PACKET RA-DIO  
	
	Wireless Networking: 
	Introduction to wireless N/Ws, dif-ferences between wireless 
	and fixed telephone N/Ws, de-velopment of wireless N/Ws, 
	fixed N/W transmission hie-rarchy, traffic routing in wireless 
	N/Ws wireless data ser-vices, PCS/PCN, protocols for wireless 
	N/W access, N/W databases, UMTS 

	Wireless LANs: 
	Infrared Vs radio transmission, infrastruc-ture and 
	ad-hoc N/Ws, IEEE 802.11, HIPERLAN, bluetooth

	Mobile Network Layer: 
	Mobile IP, DHCP, ad hoc N/Ws

	Mobile Transport Layer: 
	Traditional TCP, indirect TCP, snooping TCP, mobile TCP,
	fast retransmit/fast recovery, transmission/time-out freezing,
	selective retransmission, transaction oriented TCP

	Support for Mobility: 
	File systems, World Wide Web, WAP architecture, WDP, 
	WTLS, WTP, WSP, WAE, WML, WML Script, WTA, Examples,
	stacks with WAP

	Wireless WAN: 
	GSM, GPRS, TDMA, CDMA, WATM



	Reference Books:
	1. T.S. Rappaport, 
	   “Wireless Communications: principles and practice”,
	   Pearson Education
	2. Jochen Schiller, “Mobile Communications”, Pearson Education
	3. Pahlavan and  Krishnamurthy, 
	   “Principles of Wireless Net-works”, Pearson Education 
	4. Pahlavan and Krishnamurthy, “Wireless Application Protocol”,
	   Pearson Education  

	

	
	CSE412 Project -II                                (L-0,T-0,P-8,CR-4)

	PROJECT - II

	Project shall be based on any recent topic selected 
	by the students working in a group. In any group more 
	than two students are not allowed. Teaching load of 
	two hours per week per group shall be allotted to the
	teacher. The guide shall give the term-work marks by 
	assessing the work done and the submitted bound report
	by the students in the group. External practical 
	examination shall be based on the work demonstrated 
	by the group, followed by the oral examination conducted
	by the panel of examiners, consisting of guide working 
	as a senior examiner and other external examiner(s),
	appointed by the Institute.
	


	CSE411 Environmental Studies (Audit)
	
	
	Examination scheme for Audit course – Environmental Studies:
	The examination scheme in the compulsory audit course- 
	Envi-ronmental Studies shall be as under:

	1) Assignments                                  30 marks

	2) End term examination (Major)     60 marks

	3) Attendance and activity                10 marks	
            ---------------------------------------Total marks 100
	To get the pass grade in the audit course the students 
	will have to get atleast 40 marks out of 100 marks. 
	
	
	1) The Multidisciplinary nature of environmental studies:  (Lect:2) 
	Definition, scope & importance, Need for public awareness.

	2) Natural Resources(Lect:8)

	Renewable & non-renewable resources:Natural resources & associated problems

	Forest resources: Use & over-exploitation, deforestation, 
	case studies, Timber extraction, mining, dams & 
	their effects on forests & tribal people

	Water resources: Use & over-utilization of surface & ground water, 
	floods, drought, conflicts over water, dams-benefits & problems

	Mineral resources: Use & exploitation , en-vironmental effects of
	extracting & using mineral resources, case studies.

	Food resources: World food problems, changes caused by agriculture
	& overgrazing, effects of modern agriculture, fertilizer-pesticide
	problems, water logging, salinity, case studies.

	Energy resources: Growing energy needs, renewable and non renewable
	energy sources, use of alternate energy, Case studies

	Land resources: Land as a resource, land degradation, man induced
	landslides, soil erosion and desertification.
	Role of an individual in conservation of natural re-sources, 
	equitable use of resources for sustainable lifestyles.






	3) Ecosystems:           (Lect: 6) 

	Concept of an ecosystem, Structure and function of an ecosystem, 
	Producers, Consumers and decomposers, Energy flow in the eco-system,
	Ecological Succession, Food chain, food webs and ecological py-ramids,
	Introduction, types, characteristics features, structure and function
	of the Following ecosystem:-Forest ecosystem, Grassland eco-system, 
	Desert ecosystem Aquatic ecosystem (ponds, streams, lakes, riv-ers, 
	oceans, estuaries) 

	4) Biodiversity and its conservation    (Lect: 8)

	Introduction- definition: genetic, species and ecosystem diversity,
	Biographical Classification of India, Value of biodiversity: consump 
	-tive use, productive use, Social, Ethical, aesthetic & option values,
	Biodiversity at global, National & local levels, India as a mega 
	diversity nation, Hot –spots of biodiversity, Threats to biodiversity:
	habitat loss, poaching of wildlife, man-wildlife conflicts, Endangered
	and endemic species of India, Conservation of biodiversity: In-situ
	and Ex-situ conservation of biodiversity


	5) Environmental pollution   (Lect: 8)

	Definition, Causes, effects and control measures of: - Air pollution,
	Water pollution, Soil pollution, Marine pollution, Noise pollution,
	thermal pollution, nuclear hazards, Solid waste Managment: cause, 
	effects & control measures of urban & industrial wastes, Role of 
	an individual in prevention of pollution, Pollution case studies.
	Disaster management: Floods, earthquake, cyclone & landslides


	6) Social Issue & the Environment:    (Lect: 7)

	From Unsustainable to Sustainable development. Urban problems related
	to Energy, Water conservation, rain water harvesting, wa-tershed 
	management, Resettlement & rehabilitation of people; its problems
	& concerns, Case studies, Environmental ethics: Issues & possible
	solutions, Cli-mate change, global Warming, acid rain, ozone layer
	depletion, nuclear ac-cidents & holocaust, case studies, Wasteland 
	reclamation, Consumerism & waste products, Environment Protection Act,
	Air (Prevention & control of Pollution) Act. Water (prevention & control
	of pollution) Act, Wildlife Act, Forest conservation Act, Issues involved
	in enforcement of environmental leg-islation, Public awareness. 


	7) Human Population & the Environment:        (Lect: 6)

	Population growth, variation among nations, Population explosion-
	Family Welfare Programme, Environment & human health, Human 
	Rights, Value Education, HIV/AIDS, Women & Child Welfare, 
	Role of Information Technology in Environment & human health,
	Case stu-dies.


	8) Field Work:	   (Lect: 5)

	Visit to a local area to document environmental assets- river /
	forest/grassland/ hill/ mountain, visit to a local polluted 
	site- Urban/ Rural / Industrial/ Agricultural, Study of common
	plants, insects, birds, Study of simple Ecosystems: - pond, 
	river, hill slopes etc.