give a miss call on
+91 9501105715
please call on
Helpline
1st Semester



Batch A  Batch B  
Code  Subject  Hours (L+T+P)  Credit  Code  Subject  Hours (L+T+P)  Credit  
AML5101  Engineering Maths – I  4+1+0=5  4.5  AML5101  Engineering Maths – I  4+1+0=5  4.5  
PYL5101  Engineering Physics  4+1+0=5  4.5  EEL5102  Basics of Electrical & Electronics Engineering  4+1+0=5  4.5  
MEL4101  Elements of Mechanical Engineering  3+1+0=3.5  4  CSL4102  Problem Solving Technique using C  4+0+0=4  4  
CHL4101  Engineering Chemistry  3+1+0=4  3.5  PYL5102  Material Science  4+1+0=5  4.5  
GEL3101  Environmental Sciences  3+0+0=3  3  MEL4102  Engineering Graphics  4+0+0=4  4  
PYP1101  Engineering Physics Lab  0+0+2=2  1  EEP1102  Basics of Electrical & Electronics Engineering Lab  0+0+2=2  1  
MEW2101  Manufacturing Practice  0+0+4=4  2  CSP2102  Problem Solving Technique using C Lab  0+0+4=4  2  
CHP1101  Engineering Chemistry Lab  0+0+2=2  1  MEP1102  Engineering Graphics Lab  0+0+2=2  1  
ASP3101  Integrated Project – I  3  ASP3101  Integrated Project – I  3  
GES1101  Co curricular Activities  1  GES1101  Co curricular Activities  1  
Total  29  27  Total  31  29.5 
2nd Semester



Batch A  Batch B  
Code  Subject  Hours (L+T+P)  Credit  Code  Subject  Hours (L+T+P)  Credit  
AML5102  Engineering Math – II  4+1+0=5  4.5  AML5102  Engineering Math – II  4+1+0=5  4.5  
EEL5102  Basics of Electrical & Electronics Engineering  4+1+0=5  4.5  PYL5101  Engineering Physics  4+1+0=5  4.5  
CSL4102  Problem Solving Technique using C  4+0+0=4  4  MEL4101  Elements of Mechanical Engineering  3+1+0=4  3.5  
PYL5102  Material Science  4+1+0=5  4.5  CHL4101  Engineering Chemistry  3+1+0=4  3.5  
MEL4102  Engineering Graphics  4+0+0=4  4  GEL3101  Environmental Sciences  3+0+0=3  3  
EEP1102  Basics of Electrical & Electronics Engineering Lab  0+0+2=2  1  PYP1101  Engineering Physics Lab  0+0+2=2  1  
CSP2102  Problem Solving Technique using C Lab  0+0+4=4  2  MEW2101  Manufacturing Practice  0+0+4=4  2  
MEP1102  Engineering Graphics Lab  0+0+2=2  1  CHP1101  Engineering Chemistry Lab  0+0+2=2  1  
ASP3102  Integrated Project – II  3  ASP3102  Integrated Project – II  3  
GES1102  Co curricular Activities  1  GES1102  Co curricular Activities  1  
Total  31  29.5  Total  29  27 
3 Credits
Definition, Scope and Importance of environmental studies, natural resources, its types, conservation and associated problems, Equitable use of resources for sustainable lifestyles, Concept, Structure, functions and Energy flow in an ecosystem, Ecological succession, Introduction, types, characteristic features, structure and functions of Forest, Grassland , Desert and Aquatic ecosystem, Biodiversity, its types, values , threats and its conservation, study at global, National and local levels, India as a mega diversity nation ,Hotspots of biodiversity, Biogeographical classification and Endangered and endemic species of India, Pollution definition, Causes, effects and control measures of Air, Water, Soil, Marine ,Noise, Thermal, and Radioactive pollution, Solid waste Management—Causes, effects and control measures, Disaster management ,Water conservation, rain water harvesting, and watershed management, Urban problems related to energy ,concern of Resettlement and rehabilitation of people, Environmental Issues and its possible solutions, Environment Protection Act, Air (Prevention and Control of Pollution) Act, Water (Prevention and control of pollution) Act, Wildlife Protection Act, Forest Conservation Act ,Public awareness for Population growth, Family Welfare Programme, Environment and Human Rights, HIV/AIDS, Women and Child Welfare programs, Role of information Technology in Environment and human health, Visit to a local area to document environmental assets/River /forest grassland/hill/mountain/ /Urban/Rural/industrial/ Agricultural or any local polluted site /Study of simple eco systems/ pond, river, hill slopes, etc.
“Textbook of Environmental Studies for Undergraduate Courses”, Erach Bharucha, University Grants Commission.
4.5 Credits
Introduction to Vector and Scalar fields, Concept of Gradient, Divergence and Curl in vector & scalar field, Statement & proof of Gauss’s and Stokes’s theorem, Concept of Displacement current and equation of continuity in Electromagnetism, Electromagnetic waves & Maxwell’s equations, Definition of Frames of reference & Postulates of Special Relativity, Lorentz transformations & its applications, Nuclear composition & definition of basic nuclear terms, Concept of binding energy & its derivation based on liquid drop model, shell model & its consequences, Basic properties of nuclear forces, Various types of nuclear decay processes, nuclear fission & nuclear fusion, Concept of Interference phenomena of light, Types of Diffraction in light, Diffraction grating and its applications, Types of polarization in light, Definition of various parameters used in optical fiber, Types of optical fiber, Application of optical fibers, Basic principle of laser light production, Types of laser, Construction & working of commonly used solid, gas & semiconductor lasers, Concept and applications of Holography, Introduction to quantum mechanics & its need, DeBroglie waves, Concept of group velocity and phase velocity, uncertainty principle & its applications, Concept of wave function & operators in quantum mechanics, Schrodinger wave equation & its applications, quantum computing [basic idea only].
“Engineering Physics”, Hitendra K. Malik and A. K. Singh, McGrawHill.
“Engineering Physics”, Yogyata Pathania and Madhurika Mahajan, Chitkara University Publication.
3.5 Credits
Quasistatic, reversible and irreversible processes, zeroth law of thermodynamics, first law analysis of steady flow, applications of steady flow energy equation to various engineering devices, analysis of nonflow and flow processes, representation of these processes on PV charts and analysis of property changes and energy exchange (work and heat) during these processes, various statements of second law and their equivalence, applications of statements of second law to heat engine, heat pump and refrigerator, Carnot theorem for heat engines and heat pump, third law of thermodynamics, concept and philosophy of air standard cycle and air standard efficiency, basic definitions of pistoncylinder arrangement. Otto cycle, Diesel cycle, Dual cycle and Brayton cycle, mean effective pressure. Introduction to constructional features and working of two stroke and four stroke petrol and diesel engines and their comparison, definition of element, link, kinematic chain, mechanism, machine, examples of mechanisms and their applications, law of lifting Machine, different systems of pulleys.
“Engineering Thermodynamics”, P. Chattopadhay, 2010, Oxford University Press.
“Theory of Machines”, S. S. Rattan, 4th edition, McGrawHill.
4 Credits
Introduction to programming languages, Introduction to various problem solving techniques— algorithms, flowcharts and pseudo code, History of ‘C’, Various Data Types of ‘C’ , Control Statements, Looping and iterations, Introduction to Arrays, Strings, Pointers, Functions, Storage classes, Type Conversions, User Defined Data Types, Types of memory allocations, Introduction to Files.
“Programming in ANSI C”, Balaguruswamy, 4th edition, McGrawHill.
“Let Us C”, Yashwant Kanetkar, 8th edition, BPB Publication.
1 Credit
Susceptibility of FeCl3 by Quinke’s Method , e/m ratio of electron using Thomson method, Plateau curve for a GM counter, Dead time of G M counter, Absorption of beta particles in aluminum using a G M Counter, Ionization potential of mercury using a gas filled diode, Wavelength of light using Michelson’s Interferometer., Resolving power of a plane transmission grating, Specific rotation of cane sugar solution using Laurent’s half shade polarimeter, Laser beam characteristics like wave length, Aperture & divergence etc., Diffraction using Laser beam, Numerical aperture of a optical fibre, Attenuation & propagation losses in optical fibres.
2 Credits
CARPENTRY and PATTERN MAKING: Classification, properties and defects of timber. Different shaping operations for making various joints. FOUNDRY SHOP: Introduction to foundry . Exercises involving preparation of sand moulds and castings. FORGING PRACTICE: Introduction to forging, Forging tools, equipment and exercises on simple forging operations. MACHINE SHOP: Introduction to metal cutting machines, tools and exercises on basic metal cutting operations. WELDING SHOP: Basic concept on different welding methods, equipment, welding joints, and welding defects related to gas/electric arc welding. SHEET METAL: Basic concept of sheet metal work involving different surface generations using different joining process. FITTING SHOP: Introduction to fitting and fitting practice. ELECTRICAL SHOP: Introduction to electrical wiring. ELECTRONICS SHOP: Introduction to electronics components (Diode, Resistor, Transistors, Capacitors LED’s, and PCB’s).Preparation of PCBs involving soldering applied to electrical & electronic applications. COMPUTER SHOP: Introduction to computer Hardware & peripherals. Assembly/Disassembly of simple P C. Awareness of faults and its diagnosis. Introduction to advance wireless technologies (laptop, Bluetooth, WiFi, RF and IRDA)
2 Credits
Developing flow charts, Basic Programs, Programs using control statements, declaration and usage of pointer variables, one and two dimensional arrays, strings, String Operations, User defined functions Call by value, call by reference, Implementing Structures and Unions, Static and Dynamic memory allocation – calloc() and malloc(), Programs using Macros, Creating files, Read/ Write operations on text and binary files.
3.5 Credits
Introduction to water technology, Sources & Specification for water, Water impurities, Hard and soft water & Units to express degree of hardness, Scale and sludge formation, Boiler feed water & Boiler problems, External treatmentLime –soda process, Zeolite process, Ion exchange process, Internal treatment, Water for domestic use & Treatment for domestic water, Saline water, Desalination of water, Introduction to Corrosion, Causes & effects of Corrosion, Types and mechanism of corrosion, Use of Corrosion protective measurements, Electrolysis and various terms related to Electrolysis, Electrolysis & Electrode Potential , Different type of cells, Relationship between Emf and thermodynamic parameters, Basic principle of electroplating & Electroless plating, Electrochemical techniques of forming, Machining and Etching, Introduction to different phases, Gibbs phase rule & its Application to one component system – water, carbon dioxide, sulphur, Condensed phase rule, Two component system & Eutectic systems – Lead – silver, potassium iodide –water, Ferric Chloride – water system, Introduction to Engg. Materials, Cementing and Binding materials, Lime, Gypsum, Cement, Admixtures for concrete, Ceramics, Composites, Lubricants, Adhesives, Thermoplastics and Thermosetting, Polymer composites, Introduction & Principles of green chemistry, Pathways to Green Chemistry for Traditional and alternative synthesis of Ibuprofen, Feedstock in the synthesis of Adipic acid, Green chemistry at Nike, Green Chemistry in India
“Engineering Chemistry”, B. Sivasankar, McGrawHill.
“Engineering Chemistry”, O. G. Palanna, McGrawHill.
4.5 Credits
Differential equations of first order and first degree – exact, linear and Bernoulli. Applications to Newton’s Law of cooling, Law of natural growth and decay, orthogonal trajectories. Second and higher order ordinary linear differential equations with constant coefficients complementary function – Particular integrals (standard types) – CauchyEuler differential equation. Simultaneous liner differential equations (two variables) with constant coefficients. Solutions of second order ordinary linear differential equations with variable coefficients ,application to SHM,RLC circuit, Simple pendulum, Introduction, Fourier Series on Arbitrary Intervals, Halfrange cosine and sine series. Laplace Transform, Inverse transforms properties, Transforms of derivatives and integrals, Unit step function, Dirac’s delta function, Differentiation and Integration of transforms,. Limits, Continuity, Derivative of Complex Functions, Analytic Function, Cauchy Riemann Equation, Harmonic Functions, Conformal Mapping, Complex Integration, Cauchy’s Theorem, Cauchy Integral formula, Taylors and Laurent’s Expansion, Singular points, Poles Residue, Complex Integration using the method of Residue, Formation of partial differential equations – Equations of first Order – Lagrange’s linear equation – Charpit’s method – Standard types of first order nonlinear partial differential equations. Solution of second order linear partial differential equations in two variables with constant coefficients by finding complementary function and particular integral – classification of PDE of second order – parabolic, elliptic and hyperbolic equations – Solution by separation of variables. Solutions of onedimensional heat and wave equations and twodimensional Laplace equation using Fourier series.
“The Engineering Mathematics”, 1st edition, Vol. II, Chitkara University Publication.
“Higher Engineering Mathematics”, B. V. Ramana, Mc GrawHill.
4.5 Credits
Analysis of DC circuits using Kirchhoff’s laws, Thevenin’s, Norton’s and Superposition theorem, A.C fundamental, Generation of alternating emf, Analysis of RL, RC and RLC circuits, Series and Parallel resonance, 3phase star and delta connected systems, Power and Power factor, Magnetic circuits and transformer, Three phase induction motor, Single phase induction motor, Starters, Universal motor, Stepper motor, Servomotors, Classification of instruments, Moving Iron Instrument, Moving Coil Instrument, Multimeter, CRO, Principle operation and characteristics of PN junction diode, diodes circuits, Transistors, Amplifiers, Number Systems, Logic gates, Flip flops, Integrated circuits.
“Electrical and Electronics Technology”, Edward Hughes, 10th edition, Pearson Education.
“Basic Electrical and Electronics”, R. Muthusubramanian and K. S. Salivahanan, 8th reprint , McGrawHill.
4.5 Credits
Geometry & types of crystals, Various types of defects in crystal, Nature of interatomic forces, Production of characteristics & continuous Xrays and their application in crystallography, Various types of magnetic material & basic theories behind the origin of Magnetism, the hysteresis loop & its applications, Concept of polarization in dielectric material, Thermal & Electric properties of magnetic material, free electron & Band theory of solids, Intrinsic and extrinsic semiconductors, Hall effect & its applications, Elastic behavior of materials & related properties, Atomic model of elastic behavior, plastic deformation in single and polycrystalline crystal, mechanism of slip, critical resolved shear stress, ductile and brittle failure, Introduction to nanotechnology, various types of nanomaterials & their properties, Synthesis of nanomaterials (basic introduction), Carbon nanotubes & their properties, Introduction to superconductivity, meissner effect, Effect of magnetic field on superconductivity, Type I superconductors, type II superconductors, London equations, CAS theory, High temperature superconductivity (Basic qualitative idea).
“Engineering Physics”, Hitendra K. Malik and A. K. Singh, McGrawHill.
“Engineering Physics”, Yogyata Pathania and Madhurika Mahajan, Chitkara University Publication.
4 Credits
Drawing of Various types of lines, principles of dimensioning, symbols, conventions, scales (plane and diagonal) Vertical and inclined lettering as per IS code of practice (SP46) for general Engineering , Projection of points, lines, planes and solids. Sectioning of solids, Isometric Projection, Orthographic projections and development of surfaces.
“Engineering Drawing”, Aggarwal , 11th edition, McGrawHill.
1 Credit
Determination of total hardness , permanent hardness and temporary hardness by Complexometric method, Determination of residual chlorine in water, To determine the alkalinity of a given water sample, Determination of dissolved oxygen in the given water sample, Demonstration of different types of corrosion and to identify corrosion by collecting different samples, Surface tension by drop number method using Stalgamometer, Preparation of urea formaldehyde resin, Preparation of Bakelite using phenolformaldehyde, Acid strength using p H meter, Acid strength by using conduct meter, To determine the % moisture, volatile , ash and carbon content of coal sample by proximate method, Electroplating of a metal on given article, Virtual experiment on phase changes.
1 Credit
Introduction to various measuring instruments, Verification of Kirchhoff’s laws in D.C circuits, Verification of Superposition Theorem, Maximum Power Transfer theorem, Thevenin’s Theorem, To find voltage , current relationship and power, power factor, Resonance in RLC circuit. Measurement of selfinductance , mutual inductance and coupling coefficient of windings, To perform open circuit and short circuit test on a transformer , To connect, start and reverse the direction of rotation of a 3 phase induction motor, To plot the forward and reverse characteristics of PN junction diode, Clipper & Clamper, To plot input and output characteristics of a transistor in CE configuration, To analyze the truth tables of various basic digital gates and build RS, JK &D flipflops using NAND/NOR gates, To demonstrate the use of operational amplifier for performing mathematical operations such as summation and difference.
1 Credit
Introduction of the CAD (computer aided drafting) software and its utilities in the engineering software. Study of the various toolbar options and exercises to familiarize all the drawing tools, Study the basic initial setting and viewing of the drafting software interfaces, Use of basic entities in 2D,Uses of various modify commands of the drafting software, Dimensioning in 2D and 3D entries, Study and implementing of coordinate systems.
Summer Course



Code  Subject  Hours (L+T+P)  Credit  
CST6102  Industry Oriented Handson Training*  46 weeks  6 
3rd Semester  
Course Code  Course Name  Hours (L+T+P)  Credit 
CSL4301/CSL4201/CSL3201  Object Oriented Programming  3+0+0=3  3 
CSL4203  Computer Networks  3+1+0=4  3.5 
ECL4209  Digital Design  3+1+0=4  3.5 
CSL4207  Operating System  3+1+0=4  3.5 
AML4209  Discrete Structures  3+2+0=5  4 
CSP2201  Object Oriented Programming Lab  0+0+4=4  2 
CSP1203  Computer Networks Lab  0+0+2=2  1 
ECP1209  Digital Design Lab  0+0+2=2  1 
CSP1207  Operating System Lab – I  0+0+2=2  1 
CSP3203  Integrated Project – III  0+0+2  3 
GES1201  Co Curricular Activities  1  
Total  32  26.5 
4th Semester  
Course Code  Course Name  Hours (L+T+P)  Credit 
CSL2202  Web Development  2+0+0=2  2 
AML3201/AML4201  Numerical Methods and Statistical Techniques  3+0+0=3  3 
CSL4206  Database Management System  4+0+0=4  4 
CSL4208/CSL4308  Computer System Architecture  3+1+0=4  3.5 
CSL5210  Data Structures  4+1+0=5  4.5 
CSP2202  Web Development Lab  0+0+4=4  2 
AMP1201  Numerical Methods – Lab  0+0+2=2  1 
CSP1206  Database Management System Lab  0+0+2=2  1 
CSP2210  Data Structures Lab  0+0+4=4  2 
CSP3204  Integrated Project – IV  0+0+2=2  3 
GES1202  Co Curricular Activities  1  
Total  32  27 
3 Credits
Introduction to Object Oriented Programming, Structure of C++ program, Keywords, Basic Data Types, Derived Data Types, Declaration of Variables, Operators in C++, Scope Resolution Operator, Control Structure, Actual & Formal arguments, Default Arguments, Storage Class Specifiers, Functions, Arrays Declaration, Initialization, Processing Arrays, Arrays and Functions, Character Array, Pointers declaration, Pointer Arithmetic, Pointers And Function, Pointers And Arrays , Class Declaration, Member functions, Inline Function, Arrays within class, Static data, Static member functions, Friend Functions, Friend class, Constructors, Parameterized constructor, Multiple Constructor, Copy Constructor, Destructor, Dynamic memory Allocation, Operator Overloading, Overloading assignment operator, overloading arithmetic operator, Overloading comparison operator, Function Overloading, Inheritance, Single Inheritance, Multilevel Inheritance, Hierarchical, Hybrid, Multiple Inheritance, Advantages & Disadvantages of Inheritance, Virtual Functions, Pure Virtual Functions, Virtual Base class, Abstract Class Templates, Function Template, Class Template, Files, File Stream, Opening And Closing Files, File modes, Sequential Input output, Random Access Files, Updating Files, Exception Handling, Graphic Functions in C++.
”Object Oriented Programming in C++”, Robert Lafore, 4th edition, Pearson Education.
3.5 Credits
Introduction: Uses of Computer Networks, Network Hardware, Network Software, Sevenlayer OSI architecture of ISO, concepts of layer protocols and layer interfaces, TCP/IP reference model, comparison of OSI &TCP/IP reference models, Physical Layer: Transmission media , telephone system (structure, trunks , multiplexing and switching), wireless transmission, Data Link Layer: Design Issues, Error detection and correction, elementary data link protocols, sliding window protocols, Medium Access Sub layer: The channel allocation, IEEE standards 802 for LAN & MAN, Network Layer: Design issues, routing algorithms, Congestion control Algorithms, IP, Protocol, IP addresses, Subnets, Transport Layer: Transport Services, Elements of Transport protocols, TCP service Model, protocol, Header, Application Layer: Network security , DNS . Email, world wide web, multimedia.
“Computer Networks”, Andrew S. Tanenbaum, 4th edition.
3.5 Credits
Introduction: Binary Numbers, Number Base Conversions (Octal and Hexadecimal Numbers etc, Complements, Signed Binary Numbers, Binary Codes, Binary Storage and Registers, Binary Logic, Definitions: Basic Theorems and Properties of Boolean algebra, Boolean Functions, Canonical and Standard Form, Gate and Circuits: Digital Logic Gates, Integrated Circuits, ADC and DAC, Mapping: The Map Method (Four – Variable Map n Five Variable Map ) Quine MC Cluskey Method, Product of Sums Simplification, Don’t care conditions, NAND and NOR Implementation Other Two Level Implementation, ExclusiveOR Function, Combinational Circuits: Combinational circuits, Analysis Procedure, Design Procedure, Binary Addersubtract or, decimal Adder, Binary Multiplier, Magnitude Comparator, Decoders, Encoder, Multiplexers and DeMultiplexers, Registers and flip Flops: Sequential Circuits, Latches, Flipflops, Conversion of Flip flops, Analysis of Clocked Sequential circuits, State Reduction and Assignment, Design Procedure. Registers, Shift Registers, Ripple Counters Synchronous Counters, Other Counters, Memory: RandomAccess Memory, Memory Decoding, ErrorDetection and Correction Read Only Memory Programmable Logic Array, Programmable Array Logic Sequential Programmable Devices (SPLD, CPLD,FPGA), Basics of Circuits: Basic Characteristics of RTL, DTL, TTL, ECL, MOS and CMOS circuits
“Digital Design”, M. Morris Mano, 3rd edition, Prentice Hall, 2002.
3.5 Credits
Introduction: Mainframe systems , Desktop Systems , Multiprocessor Systems , Distributed Systems ,Clustered Systems , Real Time Systems Handheld Systems . System Components, Operating System Services, System Calls/API, System Program, Process Concept: Process Scheduling, Operations On Processes, Cooperating Processes, Interprocess Communication, Threads Multithreading Models, Overview, Threading issues, Linux Threads, CPU Scheduling: Basic Concepts, Scheduling Criteria Scheduling Algorithms MultipleProcessor Scheduling Real Time Scheduling, Process Synchronization: The CriticalSection Problem. Synchronization Hardware, Semaphores, Classic problems of Synchronization, Critical regions, Monitors, Deadlock: System Model Deadlock Characterization, Methods for handling Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock detection, Recovery From Deadlocks, Memory Management: Swapping, paging, Segmentation, Segmentation with paging, Virtual Memory, Demand Paging, Process creation, Page Replacement Algorithms, Allocation of frames, Thrashing, File Concept: Access Methods Directory Structure File System Mounting, File Sharing, Protection, File System Structure, and File System Implementation Directory Implementation Allocation Methods Freespace Management. Kernel I/O Subsystems. Disk Structure – Disk Scheduling, Disk Management – SwapSpace Management, Security: Security Problem, User Authentication Problem, Program Threats, System Threats, OS Case study – UNIX/ Linux/ Windows
“Operating System Concepts”, Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, 6th edition, John Wiley & Sons (ASIA) Pvt. Ltd.
4 Credits
Introducing sets: Properties & operations on sets, subsets, power set, Principle of duality, Cartesian Product of Sets, Partition of sets, Minsets, Maxsets, Introduction to relations: Types of relation, Pictorial & Matrix representation of relation, inverse relation, composition of relation, properties of relation. Equivalence relation, partial order relation, Introduction to functions: types of functions, Domain & range of functions, inverse function, injective, surjective, bijective & composition of functions, recursive function(def), Permutations & Combinations Inclusion exclusion principle, pigeonhole principle, Recurrence relation: Homogeneous and Nonhomogeneous recurrence relations with constant coefficients. Characteristic polynomial & Introduction to generating functions: Methods of generating functions, Logic: propositions & logical operators, truth table. Laws of logic & Quantifiers, Validity of arguments, truth values, Lattices: Definitions of lattice, sub lattice, isomorphic lattices, bounded lattices, distributive lattices, complemented lattices, modular lattice, Boolean Algebra: Atoms of Boolean algebra, Boolean expressions, Applications of Boolean algebra to switching theory & Logic Gates, Graph Theory: Introduction to graphs & Sub graphs. Directed & undirected graph, order& size of graph, Degree of vertex, Source ,sink, eccentricity, trial ,walk, path, distance, diameter, cycle, wheel, Multi graph, planer graph, Pseudo graph, weighted graph, Regular, complete and Traversable graph. Isomorphism of graphs, sub graphs, complement of graph, Adjacency Matrix , Adjacency List, incidence Matrix, Regular, complete and Traversable graph. Isomorphism of graphs, sub graphs, complement of graph, Adjacency Matrix , Adjacency List, incidence Matrix, Connected ,Complete Bipartite graph & Spanning Graph, Cut vertex, Cut edge, region , Eulerian & Hamiltonian graphs, Euler’s formula & its applications. Traveling salesman problem, Konigsberg Bridge problem, chromatic number & Graph coloring by Welch polch algorithm, TREES: Binary trees, Traversing binary trees, Rooted & spanning tree, Algebraic expression trees, DepthFirst Search Algorithm, BreadthFirst Search Algorithm, Shortest path algorithm: Kruskal’s algorithm, increasing order Algorithm, Dijikstra’s algorithm, Warshall’s Algorithm, Prim’s Algorithm
“Discrete Mathematics”, Lipschutz/Lipson, Schaum Series, 2nd edition, McGrawHill
“Discrete Mathematics and Its Applications”, Kenneth H. Rosen, McGrawHill, 2007.
2 Credits
Basic Programs consisting various data types and operators and I/O statements, Programs using control statements, Programs using one and two dimensional arrays, strings, Programs for Declaring classes, friend functions, Programs based on parameterized and default constructor, destructor, Programs on operator and function overloading, Implementation of single, multiple, hierarchical, multilevel and hybrid inheritance, Program on implementation of virtual function, Implementation of templates, Programs for storing and retrieval of text and objects in/ from files. Perform operations on files, Programs to deal with common type of exceptions in C++ programs, Programs for using inbuilt graphic functions in C++ library.
1 Credit
Introduction to computer network devices, Cabling and Connecting Computers through Cross cables, Introduction to Wireshark, How to capture packets in Wireshark, Subnetting Class C, B and A, VLSM, Connecting Computers through Switches.
1 Credit
Truth Table vérification Multiplexer/ De Multiplexer, Truth Tables of Half Adder/ Full Adder circuits using gates, Design and Test of SR/JK Flops, Study of D Flip Flop, Study of 2 bit and 4 bit asynchronous and synchronous counters, Truth Table verification of TTL gates, Fabrication of TTL Clocks.
1 Credit
Simulation of the CPU scheduling algorithms a) Round Robin b) SJF c) FCFS d) Priority, Implementation of Process Synchronization (ReaderWriter, Dining Philosopher’s Problem), Simulation of MUTEX and SEMAPHORES, Simulation of Bankers Deadlock detection, Avoidance and Prevention algorithms, Simulation of paging techniques of memory management, Simulation of page Replacement Algorithms a) FIFO b) LRU c) LFU, Simulation of file allocation Strategies a) Sequential b) Indexed c) Linked
2 Credits
Web Programming and HTML: Introduction to web programming, Basics of HTML, understanding Document – Tags, TEXT: Methods of formatting text: font tag, inline text attribute, Bold and italic, super script, subscript, Lists: Ordered, Unordered, Definition Lists and introduction to LINK, Links: The anchor element. Internal linking and external linking Attribute href, Target, Name, Images: Image basics, image tag Image alignment, image map, tags (img map, area) respective all Attributes, Table and Frame in HTML: Table: Tag, width and alignment, Cell spacing and Cell padding, Cell alignment, Borders and rules , Rows, cells, Rowspan and Colspan attributes, Header, Footer and body sections, Captions and Background images in tables, Forms: Creating a Basic Form Add a Text Box to a Form, Add Check Boxes to a Form, radio buttons, Adding Password, Pull down menus to a form , Use of clickable image as a submit button, Pass information between forms (action ,method), meta data, HTML Frames :Introduction to Frameset Tag , Frame Tag, DHTML & CSS: Introduction, Technologies of DHTML – CSS and JavaScript, CSS: Syntax, CSS Id and Class, Ways to Insert CSS: External Style Sheet, Internal Style Sheet, Inline Styles, CSS Background, Background Color Background Image: – Repeat Horizontally or Vertically, Set position and norepeat, CSS Text: Text Color, Text Alignment, Text Decoration, Font: Style, Family, Size, CSS Tables: Table Borders, Collapse Borders, Table Width and Height ,Table Text Alignment, Table Padding, Table Color, CSS Border: Style, Width, Color, CSS Margin: Margin, Padding, JavaScript Introduction: History of JavaScript, Different Implementations, Determining the Document Object Model, Uses for JavaScript, Incorporating JavaScript in Your Documents. The JavaScript Language: Basic JavaScript Syntax, Data Types and Variables, Calculations and Operators. Control Structures: Do While, While, For and For In, If Else, Switch, Break and Continue; Labels, Builtin Functions, UserDefined Functions, Objects: Builtin Objects, UserCreated Objects; Event Handling, JavaScript Errors and Troubleshooting, Document Object Model: History of the DOM, Understanding the Document Object Model, DOM Node Properties and Methods, Traversing a Document’s Nodes, Changing Nodes, JavaScript Objects: Builtin JavaScript Objects: Window Object, Document Object, Form Object, Location Object, History Object, The Self Object; Accessing an Element by Its ID. Examples: Writing Text to a Document, Using Other Windows, Images, Working with Forms, Dynamic HTML Tricks.
“HTML, CSS, JavaScript, Perl (web standards)”, Steven M. Schafer, Wiley Publishing Inc.
3 Credits
Errors in Numerical Calculations: Errors and their analysis, General Error formula, Errors in a series approximation Solution of Algebraic and Transcendental equations: Bisection Method, Method of false positionNewton Raphson method, Multiple root sorder of convergence Linear systems of equations: Gaussian elimination method with pivoting Gauss Seidel iteration method Raleigh’s power method for eigen values and eigen vectors Interpolation: Finite Difference, Forward, Backward and Central difference Newton’s formulae for interpolation, Central difference interpolation formulae, Interpolation with unevenly spaced points, Newton’s divided difference method Numerical differentiation, Maximum and Minimum values of a tabulated function EulerMaclaurin formula, Gaussian integration(One dimensional only) Initial Value Problems for Ordinary Differential Equations : Single step methods: Taylor series method – Euler and modified Euler methods Fourth order RK method for solving first and second order equations, Milne’s and Adam’s predictor and corrector methods. Introduction to probability, Baye’s theorem, Random variable (discrete and continuous), binomial, Poisson, normal, exponential distribution. Sampling Distribution of means and variance, tdistribution and Fdistribution, Hypothesis Testing (General concepts, Testing a Statistical hypothesis, one and two tailed tests, Critical region, Confidence interval estimation. Single and two sample tests on proportion), mean and variance. correlation ,lines of regression(two variable only)
“Advance Numerical Analysis with programming in C++”, Chitkara University Publication.
“Introduction to Probability and Statistics for Engineers and Scientists”, Sheldon M. Ross, 4th edition, Academic Press, Elsevier.
4 Credits
Introduction to database and Characteristics of Data Base approach. Advantages and Disadvantages of DBMS approach, Introduction to Data Models: Hierarchical Model, Network Model, ER Model, Relational Model, Schemas: Instances,3 Schema architecture and Data Independence , Client Server Architecture for DBMS, ER Model: Data base design process, Entity Types, Entity sets, Attributes, keys and their types , Weak entity types, ER diagrams, naming convention and design issues, E.F Codd Rules, Relational Model: Basic concept, Characteristics of relations, Relational Algebra : Unary operation Relation, Relational Algebra Operations from Set Theory, Binary Relational Operations(Join, Division) , Aggregate Functions and Grouping, The Tuple Relational Calculus, Query by example, Introduction to Normalization, their practical uses. Functional Dependencies (Fully, Transitive, Multivalve, Join Dependencies), 1st Normal Form , 2nd Normal Form ,3rd Normal Form, Boyce Codd Normal Form(BCNF), 4th Normal Form,5th Normal Form, 6th Normal Form, Introduction to Transaction and its desirable properties. System Log, Characterizing Schedules Based on Recoverability and Serializability, Concurrency Control Techniques: Two Phase Locking Techniques for Concurrency Control, Concurrency Control based on Timestamp Ordering, Dealing with Deadlocks, Introduction to Database Recovery Techniques: Recovery techniques based on deferred update and recovery techniques based on Immediate Update. Introduction to Checkpoints and Shadow Paging, Introduction to Database Security, Discretionary access control based on granting and revoking privileges.
“Fundamentals of database system”, Ramez Elmsri and Shamkant B.Navathe, 5th edition, Pearson Education.
3.5 Credits
Introduction to Computer Organization & Architecture: Evolution of Computers from 1st Generation to Pentium and Power PC, Von Neumann machine Flynn’s Classification – SISD, SIMD, MISD, MIMD, Basic Computer Organization: Computer Registers, Instruction Codes, Computer Instructions, Timing and Control, Instruction Cycle, Memory Reference Instructions InputOutput and Interrupt, Complete Computer Description. Basic Computer Organization taking 8085 as an example binary arithmetic – add, subtract, multiply – algorithms and implementations, Microprogrammed Control: Control Memory, Address Sequencing, Micro program Example, Design of Control unit, Central Processing Unit: General Register Organization, Stack Organization. Instruction Format ( Three address, Two Address, One address, Zero address), Addressing Modes, Data Transfer and Manipulation, Program control, RISC/CISC Characteristics, Pipelining and Instruction cycle, InputOutput Organization: Peripheral Devices, I/O Interface Asynchronous Data Transfer, Modes of Transfer Direct Memory Access(DMA),DMA Transfer, DMA Controller InputOutput Processor(IOP), CPUIOP Communication, Memory Organization: Memory Hierarchy Main Memory(RAM & ROM Chips), Auxiliary Memory(Magnetic Disc & Tapes) Associative Memory Cache Memory(Associative Mapping, Direct Mapping, SetAssociative Mapping), Virtual Memory
“Computer System Architecture”, M. Morris Mano, Pearson Education.
4.5 Credits
Introduction: Basic Terminology, Elementary Data Organization, Data Structures and Operations Algorithm : Complexity, TimeSpace Tradeoff, Asymptotic Notations for Complexity( ? ,?, O), Array: Introduction, Representation of Linear Arrays in Memory, Traversing Linear Arrays, Arrays: Inserting and Deleting (at Beginning, middle and at the end).Searching: Linear and Binary Search with their Complexity ,Sorting: Bubble Sort & its Complexity, Linked List: Introduction & its memory representation, Traversing a Linked List, Insertion into Linked List (sorted and unsorted Linked List), Deleting from Linked List, Operations on Doubly Linked List,, Circular linked List & its applications, Stacks & Queues: Array and Linked representation of Stacks, Implementations of recursive and non recursive procedures by Stacks, Applications: Arithmetic Expressions, Polish Notation, Transforming Infix Expressions into Postfix Expressions, Queues : Representation as Array and Linked List Deques, Priority Queues, Sorting TechniquesQuick sort , Merge Sort , Radix Sort, Selection Sort, Insertion Sort & their complexity, Trees: Binary trees, complete binary trees, Binary Search Trees, Data structures for representing binary trees. Insertion, deletion and searching in these trees. Tree Traversal: preorder, In order, Post order and their algorithms, Balanced binary Trees, AVL trees, insertion and Deletion in AVL tree, Heaps, Difference between heap and Array, insertion and deletion in heap. Heap sort and its applications, Graphs: Basic terminology, directed and undirected graphs, notion of path. Representation of graphs: edge list structures, adjacency list structures, adjacency matrix. Linked List representation of Graph, Operations on Graph, Graph traversals: DFS, BFS, Hashing: Techniques, Collision and its resolving.
“Data Structures”, Schaums’ Outlines Indian Adapted Edition, Seymour Lipschutz, McGrawHill, 2006.
2 Credits
To implement HTML Tags, Text Formatting, To implement Lists in HTML, To create hyperlinks and add images, To create Tables in HTML, To implement Forms and frames in HTML, Work with CSS, Java Script – Control Statements, Objects, functions, event handling, To implement Java Script Objects.
1 Credit
To develop computer program to determine roots of a given equation using Method of Regula. False position and Newton Raphson method, To develop computer programs for solution of system of simultaneous linear Equations using: Gauss Elimination Technique, without and with specified boundary conditions, for full as well as bounded symmetric and unsymmetrical matrices, To develop computer programs for solution of system of simultaneous linear Equations using Gauss Siedel iterative technique Successive over Relaxation(S.O.R) Technique, Linear and NonLinear curve fitting technique, Numerical Integration with Simpson’s rule and Gaussian Integration, Solution of ordinary differential equations by (i) Eular Method (ii) RungeKutta Method (iii) Taylor Series Methods, To develop computer programs for Exponential, Normal Distribution Technique
1 Credit
Introduction to SQL and architecture of database(tool to be used), Using DDL, DML, DCL commands, Exploring select clause and its single row functions, group functions, Implement nested and corelated queries, Table Creation and alteration, Insert, Update and delete, Views
2 Credits
Implementation of array as Data structure and various operations on it, Program to search an element using Linear / Binary Search techniques, Program to perform different operations on linked list, Operations on Doubly Linked List, Circular linked List, Array and Linked implementation of stack, Transforming Infix Expressions into Postfix Expressions and evaluation of postfix expression, Array and Linked Implementation of Circular Queue, Sort the list of data elements using different sorting techniquesSelection, Insertion, Quick, merge, Radix, Implement Binary Search Trees and perform different operations on it, Sort the list using heap (Heap sort), Program including all Operations on Graph, Graph traversals: DFS, BFS
“SQL, PL/SQL The Programming Language of Oracle”, Ivan Bayross, 3rd edition, BPB Publications.
Summer Course



Course Code  Course Name  Hours (L+T+P)  Credit 
CST6201  Industry Oriented Hands – on Courses*  6 
5th Semester  

Course Code  Course Name  Hours (L+T+P)  Credit 
CSL3307  Software Engineering  3+0+0=3  3 
CSL2301  Advanced Database Management System  2+0+0=2  2 
CSL4303  Design and Analysis of Algorithms  3+1+0=4  3.5 
CSL4305  Theory of Computation  3+1+0=4  3.5 
CSP1307  Software Engineering Lab  0+0+2=2  1 
CSP2301  Advanced DBMS – Lab  0+0+3=3  1.5 
CSP2303  Design and Analysis of Algorithms – Lab  0+0+3=3  1.5 
CSP3309  Operating System – Lab II  0+0+6=6  3 
CLP2301  Life Skills I  0+0+3=3  1.5 
CSP3305  Integrated Project – V  0+0+2=2  3 
GES1301  Co Curricular Activities  1  
GEL2301  General Education  2+0+0=2  2 
Total  34  26.5 
6th Semester  

Course Code  Course Name  Hours (L+T+P)  Credit 
CSL4302  System Software  3+1+0=4  3.5 
CSL4304  Computer Graphics  3+1+0=4  3.5 
ECL4308  Microprocessor and Assembly Language  3+1+0=4  3.5 
CSL3308  Artificial Intelligence & Expert System  3+0+0=3  3 
Elective – I  3+1+0=4  3.5  
CSP1302  System Software Lab  0+0+2=2  1 
CSP1304  Computer Graphics Lab  0+0+2=2  1 
ECP1308  Microprocessor and Assembly Language Lab  0+0+2=2  1 
CSP2308  Artificial Intelligence & Expert System Lab  0+0+4=4  2 
CLP2302  Life Skills – II  0+0+3=3  1.5 
CSP3306  Integrated Project – VI  0+0+2=2  3 
GES1302  Co Curricular Activities  1  
Total  34  27.5 
List of Elective – I  
CSL4310  Human Computer Interface 
CSL4312  Software Quality Assurance and Testing 
CSL4505  Mobile Computing 
Introduction to Software Engineering: The Evolving Role of Software, Changing nature of software, The Software Process: Software Engineering Layered Technology, Process Models: The Waterfall Model Evolutionary Process Models – Incremental Models, Spiral Model, Requirements Engineering: Requirements Engineering Tasks: Initiating Requirement, engineering Process, Eliciting Requirements; Developing Use Cases, Building Analysis Model: Requirement Analysis, Data modeling Concepts, Flow Oriented Modeling, Software Testing Strategies and Tactics: A strategic approach for Software Testing, Software Testing Strategies: Unit Testing, Integration Testing, Validation Testing ,System Testing, WhiteBox Testing Techniques: Basis Path Testing, Control Structure Testing, Black Box Testing Techniques: Equivalence Partitioning and Boundary Value Analysis , Project Management & Metrics: The management spectrum, Metrics for process & project. Metrics for Software Quality, Estimation: Software Project Planning: Objective , Software Scope and Resources, Software Project Estimation and Decomposition Techniques(LOC,FP), Empirical Estimation Models: COCOMO Model, Project Scheduling: Basic Concepts of Scheduling, Project Scheduling, Earned Value Analysis, Risk Management: Software Risks & Risk Strategies, Risk Identification, Risk Projection, Risk Mitigation, Monitoring and Management (RMMM) plan, Overview of Quality Management and Change Management
“Software Engineering: A practitioner’s Approach”, Roger S. Pressman, 6th edition, McGrawHill, International Edition.
2 Credits
Review of DBMS and Introduction to Database Server Architecture, SQL Performance Tools, Security in SQL, Embedded SQL, Object oriented concepts in databases, Cursors, Procedures and Functions, Packages, Triggers, Data base connectivity, Introduction to XML databases, Concept of Xquery, Introduction to CLIENT SERVER and Distributed database and its architecture, Data fragmentation, replication and allocation techniques for distributed database design, Query optimization, Data Mining concepts and Introduction to Data Warehousing and OLAP, Introduction to Tools various Data Mining Tools and BI Tools, Case Study of various databases
“Fundamentals of Database Design”, Ramez Elmasri and Shamkant B. Navathe, AddisonWesley.
“Introduction to SQL”, Oracle Press.
3.5 Credits
Basics of Design & Analysis of Algorithms, Divide and Conquer: General method, Binary Search, Merge Sort, Quick Sort, The Greedy Method: The General Method , Single Source shortest path, Job Sequencing With Deadlines , Minimum Cost Spanning Trees, Knapsack Problem, Dynamic Programming: The General Method, All Pairs Shortest Paths Single Source Paths, Optimal Binary Search Trees, 0/1 Knapsack Problem, The Travelling Salesman Problem, Backtracking: The General Method, Sum of Subsets, The N Queens Problem ,Graph Coloring, Hamiltonian Cycles, Knapsack Problem, Branch and Bound: The Method, Least Cost Search, The 15Puzzle: An Example, FIFO Branch and Bound, LC Branch and Bound ,0/1 Knapsack Problem ,Travelling Salesman Problem, BTrees: Introduction, General Nary Trees, Btree, Operations on BTree, Lower Bound Theory: Comparison Trees, String Processing: Storage of strings, String Operations, Pattern Matching algorithms: Brute Force, BoyerMoore method, NP Hard and NP Complete Problems: Basic Concepts, Cook’s Theorem, NP Hard Graph Problems, NP Hard Scheduling Problems, Approximation Algorithms: Introduction, Absolute Approximation, Polynomial Time, Approximation Schemes
“Fundamentals of Computer Algorithms”, Ellis Horowitz; Sartaj Sahni and Sanguthevar Rajasekaran, 1st edition, Galgotia Publications.
3.5 Credits
Mathematical Notations and Techniques, Mathematical Foundation of Theory of Computation, Basic Mathematical Objects – Sets, Logic, Functions, Relations, Languages, Nondeterminism and Kleene’s Theorem, Regular and Nonregular Languages, Regular Languages and Finite Automata, Regular Expressions and Finite Automata, Context Free Languages and Pushdown Automata, NonContextFree Languages, Introduction to Turing Machines, Unsolvable Problems, Restricted Turing Machines, Programming Techniques for Turing Machines, Undecidability, Post’s Correspondence Problem, Undecidable Problems about Turing Machines , Intractable Problems, Classes of Problems, NP Complete Problems, Problems Solvable in Polynomial Space, Language Classes Based on Randomization, The Complexity of Primality Testing, A Problem That Is Complete for PS, Complements of Languages in NP, A Restricted Satisfiability Problem
“Introduction to Languages and the Theory of Computation”, James Martin, McGrawHill.
“Introduction to Automata Theory, Languages and Computation”, Hopcroft & Ullman, AddisonWesley.
1 Credit
Introduction to UML and RSA (Rational software architect), Usecase Diagram of Management System and college Information System, Class diagram for Hospital Management System and College Information System, Interaction diagrams for College information system, Activity diagram for Bug Removal System and Admission Enrollment, Implementation diagram for University Information System and Hospital Management System.
1.5 Credits
Introduction to PL/ SQL (Basics), Implementation of Control structures, Implementation of Exceptions, Implementation of Cursors, Implementation of Procedures and Functions, Implementation of Packages, Implementation of Triggers.
2 Credits
Search an element from the array of elements using Binary Search method, Sort the list of numbers/names using Merge Sort and Quick Sort, Implementation of Knapsack Problem, Track the shortest path from one node to another in a graph, Construct the Minimum cost spanning tree using Prim’s Method, Construct the spanning tree using Kruskal Method, Implementation of Travelling salesman Problem, Find all the possible solutions of NQueen Problem, Program to implement Graph coloring Algorithm, Implementation of BTrees, Implementing Pattern Matching Algorithms: Brute Force method and BoyerMoore Method.
“Linux Programming Bible”, John Goerzen, IDG Books, New Delhi.
“Your Unix – The Ultimate Guide”, Sumitabha Das, McGrawHill.
3.5 Credits
Introduction: Introduction, Evolution of Components of Programming System, Architecture: System Software and machine architecture , The Simplified Instructional Computer, SIC: Machine Architecture, CISC: Traditional CISC machine, Cray T3E Architecture, Assembler Functions: Basic assembler functions: start, end ,byte , word, A simple SIC assembler, General Design Procedure, Design of Assembler: Single Pass, Multipass assembler, LOADERS AND LINKERS: Compile and GO loaders, General loader scheme, Absolute Loader: architecture Relocating Loader Direct Linking Loader, Loader Design options: Linkage Editor Dynamic Linking Bootstrap Loader, Design of an absolute loader, Macros: Macro Language and Macro Processor: Macro Instructions, Features of Macro Facility: Macro Instruction Arguments Conditional Macro Expansion,Macro Calls within Macros, SYSTEM SOFTWARE TOOLS: Text Editor, Overview of Editing Process, User Interface, Editor Structure
“Systems Programming”, John J. Donovan, McGrawHill, 1972.
“System Software: An Introduction to System Programming”, L. L. Beck, 3rd edition.
3.5 Credits
Symbol table implementation for functions – create, modify, display etc, Two Pass assembler, Single Pass assembler, Implementation of absolute loader, two passes of direct linker loader, Simple Text Editor Introduction: Introduction to computer graphics, Applications Computer Aided Design, Digital Image Processing , Graphical User Interface, Graphics using C:Initgraph, closegraph, cleardevice, outtextxy, putpixel, getpixel, setcolor. To draw line, circle, ellipse, rectangle, polygon, Video Display Devices: Refresh CathodeRay Tubes, Raster Scan Displays, Random Scan Displays. Color CRT Monitors, DirectView Storage Tubes, FlatPanel Displays Plasma panels, Liquid Crystal Displays, Scan Conversion: Scan converting a point, scan converting a Line Direct use of the line equation, DDA algorithm, Bresenham’s line algorithm, Scan converting a Circle : Bresenham’s Circle algorithm, Midpoint circle algorithm, EllipseGenerating Algorithms, Properties of Ellipses, Midpoint Ellipse Algorithm, Other Curves, Conic Sections, Polynomials and Spline Curves, Region Filling : Boundary fill algorithm, Flood fill Algorithm, Scan Converting a Character : Aliasing effects , Anti aliasing, Two Dimensional Transformations Geometric Transformations Translation, Rotation , Scaling , Reflection ,Coordinate Transformations Translation, Rotation, Scaling , Reflection. Two Dimensional Viewing and Clipping: Window to viewport mapping. Point Clipping.Line Clipping – Cohen Sutherland Algorithm, Midpoint subdivision, LiangBarsky Algorithm, Polygon Clipping, SutherlandHodgernan Polygon, Clipping, WeilerAtherton Polygon Clipping, Other PolygonClipping Algorithms, Curve Clipping, Text Clipping, Exterior Clipping, Projections: Taxonomy of projection, Perspective Projection 1 point, 2 point, 3 point. Perspective anomalies. Parallel Projection Orthographic , multiview , axonometric, isometric, diametric , trimetric , Oblique ,cavalier, cabinet, Hidden line & Surface elimination algorithms: Depth Comparisons, ZBuffer Algorithm, Painter’s Algorithm, Curved Lines and Surfaces: Bezier Curves and Surfaces, Bezier Curves, Properties of Bezier Curves, Design Techniques Using Bezier, Curves, Cubic Bezier Curves, Bezier Surfaces, BSpline Curves and Surfaces, BSpline Curves, Surface and Polygon Rendering Methods: SurfaceRendering Methods, PolygonRendering Methods, ConstantIntensity Shading, Gouraud Shading, Phong Shading, RayTracing Methods, Radiosity Method
“Computer Graphics”, R. A. Plastock and Z. Xiang, McGraw Hill.
“Computer Graphics”, D. Hearn and M.P. Baker, 2nd edition, PHI
3.5 Credits
Evolution of microprocessors: Evolution of microprocessors, Technological trends in microprocessor development, The Intel family tree, Applications of microprocessors, Use latest technologies, Introduction to Microprocessor: Architecture of 8086 Microprocessor. Block diagram. Description of data registers, addressing registers, pointer and index registers, PSW, Queue, BIU and EU, 8086 flags: 8086 flag register and function of 8086 Flags, Pin Diagram:8086 Pin diagram descriptions, 8086 Instruction set: Instruction formats, Addressing modes, Data Transfer Instructions, String Instructions, Arithmetic and logical Instructions, Transfer of control instructions, process control instruction, Assembler directives, 8086 signals: Generating 8086 CLK and reset signals using 8084.WAIT state generation, Microprocessor bus types and buffering techniques, Modes: 8086 minimum mode and maximum mode, Assembly language programs: Assembly language programs involving logical, Branch & Call instructions, sorting, evaluation of arithmetic expressions, string manipulation, Interrupt structure of 8086: Interrupts and interrupts service routines, interrupt cycle of 8086, types of interrupts, DMA operation, Serial data transfer schemes, Serial data transfer schemes. Asynchronous and Synchronous data transfer schemes. 8251 USART architecture and interfacing.
“Microprocessor and Interfacing”, Douglas V. Hall, 2nd edition, McGrawHill.
3 Credits
Introduction: Overview of Artificial Intelligence: Definition & Importance of Artificial Intelligence, Knowledge: General Concepts: Introduction, Definition and Importance of Knowledge. KnowledgeBased Systems, Representation of Knowledge, Knowledge Organization, Knowledge Manipulation, Acquisition of Knowledge, Logic: First order logic – representation revisited – Syntax and semantics for first order logic – Using first order logic – Knowledge engineering in first order logic. Inference in First order logic – prepositional versus first order logic – unification and lifting – forward chaining – backward chaining – Resolution, Knowledge Representation: Knowledge Representation: Introduction, Syntax and Semantics for Prepositional logic, Syntax and Semantics for FOPL. Properties of Wffs, Conversion to Clausal Form, Inference Rules,, Inference Methods, Representations Using Rules, Knowledge Representation Techniques: Structured Knowledge: Graphs, Frames and Related Structures: Introduction, Associative Networks, Frame Structures, Conceptual Dependencies and Scripts.
Expert Systems: Expert Systems, Definitions types, components, Expert System Development Process, Searching, Learning and Planning: Searching: Statespace representations, Depthfirst, breadthfirst, heuristic search, Planning and game playing, Genetic algorithms. Learning, Planning and Explanation in Expert System: Neural Expert System, Fuzzy, Expert System, Real Time Expert Systems, Case Studies: Implementation Tools : Prolog, Study of existing, expert systems TIERES, MYCIN, Probabilistic Reasoning, Probabilistic inference networks, Fuzzy inference rules, Bayesian rules, Neural networks, Principles, biological analogies, Training (techniques and errors), Recognition.
“Introduction to Artificial Intelligence & Expert Systems”, Dan W. Patterson, Prentice Hall International, 1990.
1 Credit
Symbol table implementation for functions – create, modify, display etc. , Two Pass assembler, Single Pass Assembler, Implementation of absolute loader, two passes of direct linker loader, simple text editor
1 Credit
Graphics using C initgraph, closegraph , cleardevice, outtextxy, putpixel, getpixel, setcolor. To draw line, circle, ellipse, rectangle, polygon, Scan converting a point, scan converting a Line Direct use of the line equation, DDA algorithm , Bresenham’s line algorithm, Scan converting a Circle Bresenham’s Circle algorithm, Midpoint circle algorithm, Region Filling Boundary fill algorithm, Flood fill Algorithm, Geometric Transformations – Translation , Rotation , Scaling , Reflection ,Shear and Scaling, Coordinate Transformation Translation , Rotation , Scaling , Reflection ,Shear and Scaling, Line Clipping – Cohen Sutherland Algorithm , Midpoint subdivision , LiangBarsky Algorithm , Polygon Clipping, SutherlandHodgernan Polygon, Clipping WeilerAtherton Polygon Clipping, Hidden line & Surface elimination algorithms – Depth Comparisons, ZBuffer Algorithm, Painter’s Algorithm.
1 Credit
Introduction to 8085 kit, Addition of 28 bit number, sum 8 bit, Addition of 28 bit number, sum 16 bit, Subtraction of 28 bit number, Find 1s complement of 8 bit number, Find 1s complement of 16 bit number, Find 2s complement of 8 bit number, Find 2s complement of 16 bit number a) Shift an 8 bit no. by one bit b) Shift an 16 bit no. by one bit, Find Largest of two 8 bit numbers, Find Largest among an array of ten numbers (8bit) , Sum of series of 8 bit numbers.
Introduction to Expert System Architecture, Components, Designing and Analyzing an Expert System, Rule Based Expert System Design, Introduction to PROLOG, An expert system for Medical diagnosis, An expert system for Library Management, An expert system for Pattern Matching, An expert system for Game Theory or Puzzle Game, An expert system for PC Troubleshooting, To generate a ‘family Tree’, implementation of ‘Conjunction’, check about the relation among different entities, check about entities whether they are club members or not in PROLOG, To check whether ‘an entity is a bird or not’, check whether ‘person steals something valuable or not’, to calculate ‘Density’, to generate ‘Calculator’, or not element is a member of the list or not, calculate the length of the string, calculate the factorial of the number, implement the concept of the ‘CUT’ in PROLOG.
3.5 Credits
Importance of user Interface: Definition, Importance of good design, Benefits of good design. A brief history of Screen design, The graphical user interface: Interaction Styles, popularity of graphics, The concept of direct manipulation, Graphical Systems: Advantages and Disadvantages, Characteristics, Web user: Interface popularity, Characteristics, Principles of user interface, Design process: Human interaction with computers. Importance of human characteristics, human consideration. Human interaction speeds, Business functions: Understanding business functions. Screen Designing: Design goals (introduction), Screen planning: Screen planning and purpose, organizing screen elements. Ordering of screen data and content: Screen navigation and flow. Visually pleasing composition: Amount of information. Information retrieval on web: Statistical graphics, Windows: New and Navigation schemes. Select proper kind of windows. Choose the proper screen based controls, Components: Text and messages. Icons and increases: Multimedia, Graphics, Colors, Uses problems, choosing colors, Software tools: Introduction, Specification methods, Interface – Building Tools, Interaction Devices: Keyboard and function keys, Pointing devices, Speech recognition digitization and generation. Image and video displays.
“The essential guide to user interface design”, Wilbert O. Galitz, Wiley DreamaTech.
“Designing the User Interface”, Ben Shneiderman, Pearson Education, 2001.
3.5 Credits
Introduction: Software Quality, Role of testing, verification and validation, objectives and issues of testing, Testing activities and levels, Sources of Information for Test Case Selection, WhiteBox and BlackBox Testing , Test Planning and Design, Monitoring and Measuring Test Execution, Test Tools and Automation, Test Team Organization and Management, Unit Testing: Concept of Unit Testing , Static Unit Testing , Defect Prevention , 3.4 Dynamic Unit Testing , Mutation Testing , Debugging , Unit Testing in extreme Programming, Control Flow Testing: Outline of Control Flow Testing, Control Flow Graph, Paths in a Control Flow Graph, Path Selection Criteria, AllPathCoverage Criterion , Statement Coverage Criterion, Branch Coverage Criterion, Predicate Coverage Criterion, Generating Test Input, Examples of Test Data Selection., Data Flow Testing: Data Flow Anomaly,. Overview of Dynamic Data Flow Testing, Data Flow Graph, Data Flow Terms, Data Flow Testing Criteria, Comparison of Data Flow Test Selection Criteria, Feasible Paths and Test Selection Criteria, Comparison of Testing Techniques.
System Integration Testing: Concept of Integration Testing, Different Types of Interfaces and Interface Errors, Granularity of System Integration Testing, System Integration Techniques, Software and Hardware Integration, Test Plan for System Integration, OfftheShelf Component Integration, OfftheShelf Component Testing, Builtin Testing, System Test Categories: Basic Tests, Functionality Tests, Robustness Tests, Interoperability Tests, Performance Tests, Scalability Tests, Stress Tests, Load and Stability Tests, Reliability Tests, Regression Tests, Documentation Tests, Functional Testing: Equivalence Class Partitioning, Boundary Value Analysis, Decision Tables, Random Testing, Error Guessing, Category Partition
System Test Design: Test Design Factors, Requirement Identification, Characteristics of Testable Requirements, Test Design Preparedness Metrics, Test case Design Effectiveness, System Test Planning And Automation: Structure of a System Test Plan, Introduction and Feature Description, Assumptions, Test Approach, Test Suite Structure, Test Environment, Test Execution Strategy, Test Effort Estimation, Scheduling and Test Milestones, System Test Automation, Evaluation and Selection of Test Automation Tools, Test Selection Guidelines for Automation, Characteristics of Automated Test Cases, Structure of an Automated Test Case, Test Automation Infrastructure, System Test Execution: Preparedness to Start System Testing, Metrics for Tracking System Test, Metrics for Monitoring Test Execution, Beta Testing, First Customer Shipment, System Test Report, Product Sustaining, Measuring Test Effectiveness.
“Software Testing and Quality Assurance: Theory and Practice”, Sagar Naik and Piyu Tripathy, University of Waterloo, Wiley, 2008.
3.5 Credits
Introduction: Challenges in mobile computing, coping with uncertainties, resource poorness, bandwidth, etc. Cellular architecture, cochannel interference, frequency reuse, capacity increase by cell splitting. Medium Access Control: Motivation for a specialized MAC: Hidden and Exposed terminals. Near and Far terminals; SDMA, FDMA, TDMA: Fixed TDM, Classical Aloha, Slotted Aloha, Carrier sense multiple access, Demand assigned multiple access, PRMA packet reservation multiple access, Reservation TDMA, Multiple access with collision avoidance, Polling, Inhibit sense multiple access; CDMA: Spread Aloha multiple access, Telecommunication Systems: GSM: Mobile services, System architecture, Radio interface, Protocols, Localization And Calling, Handover, Security, New data services; DECT: System architecture, Protocol architecture; TETRA, UMTS and IMT2000: UMTS Basic architecture, UTRA FDD mode, UTRA TDD mode, Wireless LAN: Infrared vs. Radio transmission, Infrastructure and Adhoc Networks, IEEE 802.11: System architecture, Protocol architecture, Physical layer, Medium access control layer, MAC management, Future development; HIPERLAN: Protocol architecture, Physical layer, Channel access control. Sublayer, Medium access control Sublayer, Information bases And Networking; Bluetooth: User scenarios, Physical layer, MAC layer, Networking. Security, Link management, Mobile Network Layer: Mobile IP: Goals, assumptions and requirements, Entities and Terminology, IP packet delivery, Agent advertisement and discovery, Registration, Tunneling and Encapsulation , Optimizations, Reverse tunneling, Ipv6; Dynamic host configuration protocol, Ad hoc networks: Routing, Mobile Transport Layer: Traditional TCP: Congestion control, Slow start, Fast retransmit/fast recovery, Implications on mobility; Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery, Transmission/timeout freezing, Selective retransmission, Transaction oriented TCP, Data Dissemination and Management: Challenges, Data dissemination, Mobile data replication, Mobile data caching, Mobile cache maintenance, mobile web caching, caching in ad hoc networks, Context Aware Computing: Ubiquitous computing, concept of context, context aware computing and applications, middleware support, Mobile Middleware: Service discovery, adaptation, mobile agents, Wireless security: Traditional security issues, mobile and wireless security issues, Problems in ad hoc networks
“Fundamentals of Mobile and Pervasive Computing”, Frank Adelstein; S. K. S. Gupta; Golden G. Richard III and Loren Schwiebert, McGrawHill.
In the final year of B.E. (CSE) program, the student has the option of pursuing coop track or semester track. In the coop track, the student takes up a yearlong coop project at a designated industry, while in the semester track the student takes regular courses at campus, and in the other semester takes up internship at a designated industry.
(a) For students pursuing semester track:
7th / 8th Semesters  

Course Code  Course Name  Hours (L+T+P)  Credit 
AML4401  Optimization Techniques  3+1+0=4  3.5 
Organizational Behavior  3+0+0=3  3  
Elective – II  3+1+0=4  3.5  
Elective – III  3+1+0=4  3.5  
Open Elective  3+1+0=4  3.5  
CSP4401  Lab Oriented Project  0+0+8=8  4 
Elective – II Lab  0+0+2=2  1  
Open Elective Lab  0+0+2=2  1  
Total  31  23 
List of Elective – II  

CSL4401  OS Administration 
CSL4403  Natural Language Processing 
CSL4405  Database Administration 
List of Elective – III  
CSL4403  Dataware Housing and Mining 
CSL4405  Network Security 
CSL4409  Modelling and Simulation 
List of Open Elective  
ECL4305  Digital Signal Processing 
ECL4309  Advanced Communication System 
List of Elective – II Lab  
CSP1401  OS Administration Lab 
CSP1403  Natural Language Processing Lab 
CSP1405  Database Administration Lab 
List of Open Elective Lab  
ECP1305  Digital Signal Processing Lab 
ECP1309  Advanced Communication System Lab 
7th/8th Semesters  

Course Code  Course Name  Hours (L+T+P)  Credit 
CST9401  Industry – Oriented Handson Experience*  20  
Total  20 
(b) For students pursuing coop track:
7th/8th Semesters  

Course Code  Course Name  Hours (L+T+P)  Credit 
CST9410  Coop project at Industry  40  
Total  40 
3.5 Credits
Introduction to Operations Research, Formulation of Linear Programming Problem. Standard form of LPP graphical solution of LPP, convex theory, Fundamental theory of LPP.
The Simplex method, the big Mmethod the twophase method, degeneracy Exceptional cases of LPP i.e. alternative optimal solution, unbounded solution, infeasible solution Definition of the Dual Problem, the relationship between the optimal primal and dual solution Dual Simplex Method, PrimalDual computations, Sensitivity Analysis. Mathematical formulation of Transportation Model, Initial BFS with NW corner method, LCM, VAM method, Optimal Solution using UV method Assignment Problem , Hungarian Method Integer Programming , Relationship to linear programming, Branch and Bound Algorithm
Network Models: Network definition, Spanning Tree, Shortest Path, Maximal Flow problem, Removal of redundancy. Network computations, Free and Total slack, CPM and PERT, Project Management, Crashing Elements of a Queuing Model, Role of Exponential Distribution, Birth and Death Models Steady state measures of performance, single server models, and multiserver models.
Sequencing of ‘n’ jobs and ’2′ Machines, ‘n’ jobs and ’3′ Machines, ‘n’ jobs and ‘m’ machines, Main features of Dynamic programming problem(DPP), Recursive nature of computations in DPP, Forward and Backward Recursion. Introduction to NLPP: Unconstrained Optimization, Search Techniques, Dichotomus Search, Fibonacci Method, Constrained Optimization, Lagrange’s Multiplier method, KKT conditions.
“Operations Research – An Introduction”, Taha Hamdy, 8th edition, PrenticeHall.
“ Introductory Operation Research: Theory and Applications”, H. S. Kasana, Springer Verlag, 2005.
3 Credits
Introduction: Introduction to Organization Behavior, managerial roles, management functions. Contributing disciplines to OB, managing diversity, Individual Behavior in Organizations. Challenges and Opportunities for Organizational Behaviour, Behaviour Management: Values and Attitudes. Learning and Behavior Management: Theories of learning, Job satisfaction. Meaning of Personality: Measuring personality, Types of Personality, Concept of Perception, attribution theory, perception and decision making and Organization Behaviour modification (OBMOD), Motivation: Types and importance of motivation. Motivation at workplace. Emotions and Moods. Theories of Motivation: Maslow, Hertzberg’s hygiene factor, Vroom’s expectancy model, Porter and Lawler, McGregor’s Theory X and Theory Y and McClelland’s three needs theory, Dynamics of Managerial Leadership: Styles of leadership. Theories of leadership and their applications. Managerial Grid. Contemporary issues in leadership, Foundations of Group Behaviour: Group formation, development and structure. Group processes, Group DecisionMaking techniques and work teams, Interpersonal Behaviour in Organizations: Transactional Analysis, Conflict Management, Stress and Crisis Management, Organizational Dynamics: Power and Politics in organization. Organisational Change & Development, Innovation, Creating a learning organization. Emotional Intelligence – Concept. Organisational Culture, CrossCultural Behaviour. Organisational Effectiveness. Organisational Change & Development.
“Organizational Behavior”, Stephen P. Robbins, 9th edition, PrenticeHall International.
“Organization Behavior”, L. M. Prasad, S. Chand.
3.5 Credits
Introduction: Description of the systems administrator’s role: tasks and duties, knowledge required, code of ethics. Information sources and documentation. Planning the installation. Disk preparation: file system partitioning and formatting, Organization of the UNIX files system: Swap area. Basic configuration. Starting and stopping the operating system. The system’s databases. Adding, removing and disabling users. Permissions and protection mechanisms, Users and special groups: Installing applications. Maintaining different versions of an application. Software distribution formats. Process management. Process management tasks, Monitoring users: Disk monitoring. File verification, optimization, and repair. RAID systems. Backups, Task temporization and automation: UNIX printing system. Information services. The superserver. Portmapper and RPCs. Domain Name System (DNS). File Transfer Protocol (FTP). World Wide Web (HTTP). Email (SMTP). Network File Systems (NFS, SMB). Network Information Systems (NIS), Local security: permissions and protection mechanisms, user authentication, access to devices Network security: active services, connection filter, Security auditing. Encryption and digital signatures.
“Essential System Administration”, Leen Frisch, O’Reilly, 2002.
3.5 Credits
Introduction: Knowledge in speech and language processing – Ambiguity – Models and Algorithms – Language, Thought and Understanding. Regular Expressions and automata: Regular expressions – FiniteState automata, Morphology and FiniteState Transducers: Survey of English morphology – FiniteState Morphological parsing – Combining FST lexicon and rules – LexiconFree FSTs: The porter stammer – Human morphological processing, Word classes and partofspeech tagging: English word classes – Tagsets for English – Partofspeech tagging – Rulebased partofspeech tagging – Stochastic partofspeech tagging – Transformationbased tagging – Other issues, ContextFree Grammars for English: Constituency – ContextFree rules and trees – Sentencelevel constructions – The noun phrase – Coordination – Agreement – The verb phase and sub categorization – Auxiliaries – Spoken language syntax – Grammars equivalence and normal form – FiniteState and ContextFree grammars – Grammars and human processing, Parsing with ContextFree Grammars: Parsing as search – A Basic TopDown parser – Problems with the basic TopDown parser – The early algorithm – FiniteState parsing methods. Features and Unification: Feature structures – Unification of feature structures – Features structures in the grammar – Implementing unification – Parsing with unification constraints – Types and Inheritance, Lexicalized and Probabilistic Parsing: Probabilistic contextfree grammar – problems with PCFGs – Probabilistic lexicalized CFGs – Dependency Grammars – Human parsing, Representing Meaning: Computational desiderata for representations – Meaning structure of language – First order predicate calculus – Some linguistically relevant concepts – Related representational approaches – Alternative approaches to meaning, Semantic Analysis: SyntaxDriven semantic analysis – Attachments for a fragment of English – Integrating semantic analysis into the early parser – Idioms and compositionality – Robust semantic analysis, Lexical semantics: Relational among lexemes and their senses – WordNet: A database of lexical relations – The Internal structure of words – Creativity and the lexicon. Word Sense Disambiguation and Information Retrieval: Selectional restrictionbased disambiguation – Robust word sense disambiguation – Information retrieval – other information retrieval tasks.
“Speech and Language Processing”, Daniel Jurafsky and James H. Martin, Pearson Education, 2002.