B.Tech.

Computer Science & Engineering

Curricular Structure Second Year
Contact Hours per Week Course Title L Organizational Behavior and Management Practices Mathematics III Fundamentals of Analog Electronics Fundamentals of Digital Electronics Discrete Structures Data Structures and Algorithms Java Programming(Herbert shield) Data Structures Laboratory Java Programming Laboratory Analog Electronics Laboratory Discipline Sub Total Proficiency (Non Credit) 3 3 3 2 3 3 3 0 0 0 20 T 0 1 1 1 1 1 0 0 0 0 5 P 0 0 0 0 0 0 0 2 2 2 6 3 4 4 3 4 4 3 1 1 1 1 29 1 Credits Credits ETE Duration Hours 3 3 3 3 3 3 3 2 2 2 Weightage (%) MTT** 24 24 24 24 24 24 24 40 40 40 100 MTT** 24 24 24 24 24 24 40 40 40 40 100 CW * ETE 40 40 40 40 40 40 40 20 20 20 40 40 40 40 40 40 20 20 20 20 ETE

Course Code

MT 202 Autumn Semester MA 201 EC 211 EC 212 CS 201 CS 203 CS 205 CS 221 CS 223 EC 221 GE 201 GE 203

36 36 36 36 36 36 36 40 40 40

L Engineering Economics Statistics and Probability Theory Electronic Devices and Circuits Communication Engineering Software Engineering Database Management Systems Digital Electronics Laboratory Communication Engineering Laboratory Software Engineering Laboratory I Database Management Systems Laboratory Discipline Sub Total Proficiency (Non Credit) 2 3 3 3 3 3 0 0 0 0 17 -

T 0 1 1 1 1 1 0 0 0 0 5 -

P 0 0 0 0 0 0 2 2 2 2 6 2 4 4 4 4 4 1 1 1 1 1 27 1

Hours 2 3 3 3 3 3 2 2 2 2 -

Spring Semester

MT 201 MA 202 EC 203 EC 214 CS 204 CS 206 EC 223 EC 232 CS 224 CS 226 GE 202 GE 204

36 36 36 36 36 36 40 40 40 40

CW *

Course Code

Contact Hours per Week Course Title

ETE Duration

Weightage (%)

Third Year
Contact Hours per Week Course Title L Design and Analysis of Algorithms Theory of Computation Computer Organization Computer Graphics e-Commerce System Programming Software Engineering Laboratory II Computer Graphics Laboratory System Programming Laboratory Discipline Sub Total Proficiency (Non Credit) 3 3 3 3 3 2 0 0 0 17 T 1 1 1 0 1 1 0 0 0 5 P 0 0 0 0 0 0 2 4 4 10 ETE Duration Hours 3 3 3 3 3 2 2 3 3 Weightage (%) MTT** 24 24 24 24 24 24 40 40 40 100 MTT** 24 24 24 24 24 40 40 40 40 100 CW * ETE 40 40 40 40 40 40 20 20 20 40 40 40 40 40 20 20 20 20 ETE

Course Code CS 301 CS 303 CS 305 CS 307 CS 313 CS 309 CS 321 CS 323 CS 325 GE 301 GE 303

4 4 4 3 4 3 1 2 2 1 28 1

Credits

36 36 36 36 36 36 40 40 40

Autumn Semester

L Linear Optimization Microprocessors and Microcontrollers Principles of Compiler Design Operating Systems Elective I Microprocessors and Microcontrollers Laboratory Operating Systems Laboratory Internet Programming Laboratory Interpersonal Communication Discipline Sub Total Proficiency (Non Credit) 3 3 3 3 3 0 0 0 0 15 -

T 1 0 1 0 1/0 0 0 0 0 2/3 -

P 0 0 0 0 0/2 2 4 4 2 12/1 4

Hours 3 3 3 3 3 2 3 3 2 -

MA 302 Spring Semester EC 202 CS 302 CS 304 EC 222 CS 322 CS 324 GE 302 GE 304 GE 306

4 3 4 3 4 1 2 2 1 1 25 1

36 36 36 36 36 40 40 40 40

CW *

Course Code

Course Title

Credits

Contact Hours per Week

ETE Duration

Weightage (%)

Fourth Year
Contact Hours per Week Course Title L Digital Signal Processing Artificial Intelligence Computer Networks Elective II Digital Signal Processing Laboratory Artificial Intelligence Laboratory Minor Project Industrial Training Seminar Discipline Sub Total GE 405 Proficiency (Non Credit) 3 3 3 3 0 0 0 0 12 T 1 1 1 1/0 0 0 0 0 3/4 P 0 0 0 0/2 2 2 4 4 12/1 4

Credits

MTT** 24 24 24 24 40 40 100 100 100 MTT** 24 24 24 40 100 100 100

CW *

Hours 4 4 4 4 1 1 2 2 1 23 1 Credits ETE Duration Hours 4 4 4 1 10 1 1 25 3 3 3 2 3 3 3 3 2 2 -

Autumn Semester

EC 305 CS 401 CS 403 EC 325 CS 421 CS 425 GE 401 GE 403

36 36 36 36 40 40

40 40 40 40 20 20

CW *

L VLSI Design Elective III Elective IV VLSI Laboratory Major Project Technical Seminar Discipline Sub Total Proficiency (Non Credit) 3 3 3 0 0 0 9 -

T 1 1/0 1/0 0 0 0 1/3 -

P 0 0/2 0/2 2 20 2 24/2 8

Spring Semester

EC 304

EC 421 CS 428 CS 424 GE 402 GE 404

36 36 36 40

40 40 40 20

1 Total Credits = 207

(i) Three quizzes of four marks each will be held in a semester. First quiz will be held before the I mid-term examination, the second between the I and the II mid-term examinations and the third between the II mid-term and the end-term examinations. (ii) Assignments and regularity will be evaluated 4 (four) times in a semester. Each evaluation will be out of 6 (six) marks. Practicals: Practical record and regularity will be evaluated 4 (four) times in a semester. Each evaluation will be out of 10 (ten) marks. ** Theory: Two mid-term examinations of 12 (twelve) marks each. Practicals: Viva/quizzes will be held 4 (four) times in a semester, each will be out of 10 (ten) marks.

Theory:

Evaluation of proficiency will be based on the participation in co-curricular activities. Students will go for an industrial training programme of 8 (eight) weeks in the summer after the end of the III year spring semester examination.

Modified courses. New Courses.

ETE

Course Code

Contact Hours per Week Course Title

Weightage (%)

ETE

Course Code

ETE Duration

Weightage (%)

List of Electives
S.No. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. Course Code CS 402 CS 404 CS 405 CS 406 CS 407 CS 410 CS 210 CS 412 CS 414 EC 314 EC 316 EC 318 EC 414 EE 201 CS 409 MT 301 MT 302 PY 303 Course Title Information System Security Client/Server Computing Multimedia Systems Neural Networks Advanced Data Structures Data Mining and Warehousing Management Information Systems Distributed Systems Real Time Systems Electronic Measurements and Instrumentation Advanced Digital Communication Satellite Communication Cellular and Wireless Communication Network Analysis Modeling and Simulation Entrepreneurship and Business Management I Entrepreneurship and Business Management II (Prerequisite: MT 301) Applied Quantum and Statistical Mechanics

CS 301

Design and Analysis of Algorithms

3-1-0-4

1. Background: Introduction, algorithms specification, time and space complexity, performance analysis, recurrence relations. [6] 2. Divide and Conquer: Binary search, merge sort, bubble sort, quick sort, Strassen matrix multiplication. [4] 3. Greedy Methods: General method, optimal merge patterns, minimum cost spanning trees, Knapsack problem. [4] 4. Dynamic Programming: General method, 0/1 Knapsack problem, least common subsequence, matrix chain multiplication. [5] 5. Basic Traversal and Search Techniques: Breadth first traversal, depth first traversal, breadth first search and depth first search. [4] 6. Back Tracking: General method, 4-queen problem, sum of subset problem. [3]

7. Branch and Bound: General method, assignment problem, traveling salesman problem. [5] 8. String Matching Algorithms: Naive algorithm, automata and KMP matcher algorithms, Boyer-Moore algorithm. [4] 9. NP Completeness: Polynomial time and its verification, NP completeness and proofs, reducibility of NP problems - clique problem, vertex cover problem. [5]

CS 303

Theory of Computation

3-1-0-4

1. Finite Automata and Regular Expression: Finite state systems, basic definitions, regular languages and regular expression, finite automata, Kleen theorem, pumping lemma for regular sets, decision algorithms, Myhill-Nerode theorem and minimization of finite automata. [11] 2. Context-Free Grammars: Context-free grammars, union, concatenation of CFG, derivation trees, simplification of context-free grammars, Chomsky normal form, Greibach normal form, the existence of inherently ambiguous context-free languages. [9] 3. Context-Free Languages and Pushdown Automata: Pushdown automata and context-free languages, pumping lemma for CFL, closure properties of CFL, decision algorithms for CFL. [6] 4. Turing Machine: Turing machine model, techniques for turing machine construction, turing machines as language acceptor, combining turing machines, properties of recursive and recursively enumerable languages, universal turing machine. [8] 5. Chomsky Hierarchy of Languages: Regular grammars, unrestricted grammars and turing machines, context-sensitive grammars and linear bounded automata. [6]

CS 305

Computer Organization

3-1-0-4

1. Processors Organization and Design: Components of a digital computer, organization of various processors, addressing modes, instruction set, instruction formats, instruction cycle, conventional versus micro-programmed control, RISC/CISC processors, pipelining, pipelined processors, hazards in pipelining, designing of pipelined systems. [10] 2. ALU Design: Hardware implementation and algorithms for fixed and floating-point arithmetic. [8] 3. Memory Organization: Memory hierarchy, RAM (static and dynamic), ROM, interfacing of RAM/ROM with CPU, dynamics RAM controller, auxiliary memory, associative memory (hardware organization, match logic), cache memory, cache memory organization, various address mapping, virtual memory, memory management hardware. [8] 4. Input-Output Organization: Computer buses, input-output interfaces, asynchronous data transfer, modes of transfer, interfacing of input/output devices, programmable interfaces, interrupts, interrupt controller, priority interrupts, direct memory access, serial communication interface, RS-323C, RS-485, centronics, CRT interface. [10] 5. Parallel Processors: Flynn classification, parallel processor organizations, multiprocessors, multi computers, interconnection structures, multistage interconnection networks. [4]

CS 307

Computer Graphics

3-0-0-3

1. Overview: Display devices Video, refresh CRT, raster scan, random scan, color CRT, monitors raster scan systems, video controller, raster scan display processor, input devices trackball, space ball, joy-sticks, digitizers, scanners, touch panels, light pen. [4] 2. Scan Conversion: Primitive drawing DDA and Bresenham algorithm for line, circle, ellipse, general curves, filling scan line polygon fill algorithm, inside-outside tests, flood-fill, boundary-fill, attributes area fill attributes, line and text attributes. [7] 3. Two-Dimensional and Three-Dimensional Transformations: Basic transformations, matrix representation and homogeneous co-ordinates, composite transformation, reflection, shear transformation. [7] 4. Three-Dimensional Object Representations: Polygon surfaces, polygon tables, plane equations, polygon meshes, curved lines and surfaces, quadric surfaces, spheres, curves, spline representations and spline specifications, Bezier and B-spline curves. [8] 5. Clipping and Viewing: Line clipping Cohen Suther Land, Liang-Barsky, polygon clipping Suther Land Hodgman, Weiter-Atherton, projection and its transformation parallel and perspective, vanishing points. [7] 6. Visibility: Classification and detection algorithm, back face detection, depth buffer, scan line, depth sorting and BSP tree, ray casting method and curved surfaces. [4] 7. Rendering: Shading Gouraud, Phong, ray tracing, antialised ray tracing. [3]

CS 313

e-Commerce

3-1-0-4

1. Overview: Definition, scope of electronic commerce, trade cycle, electronic markets, electronic data interchange, Internet commerce and e-Commerce perspectives. [3] 2. Business Strategy and B to B e-Commerce: Porter value chain model, interorganizational value chains, Porter model for competitive forces, e-Commerce implementation and evaluation, inter-organizational transactions, transaction types, credit transaction trade cycle, case study of airline booking system. [6] 3. Electronic Data Interchange: Definition and benefits, technology, standards, communications, implementations, agreements and securities, trading patterns and transactions. [6] 4. e-Commerce Framework: Framework, e-Commerce media convergence, anatomy of e-Commerce, consumer applications. [3] 5. e-Commerce and World Wide Web: Architectural framework for e-Commerce, world wide web as the architecture, web background - hypertext publishing, technology behind the web, securities and the web. [5] 6. Electronic Payment Systems: Types of payment systems based on electronic, digital token, smart cards and credit card, risk in electronic payment systems, designing of electronic payment system. [6] 7. e-Commerce Web Site Development: Web site evaluation model, introduction to various technologies of web site development and object behavior, components, active scripting, ASP object model, connecting to the database, accessing and versioning the database, creating catalog, creating shopping basket, adding mailing facility. [7] 8. J2EE Architecture Overview: Enterprise components, information technology in the enterprises, introduction to enterprise objects and enterprise component model, J2EE model features, J2EE components container architecture, enterprises Java and J2EE architecture. [4]

CS 309

System Programming

2-1-0-3

1. Overview: Language processors, data structures for language processing, assemblers, macros and macro processors, compilers, interpreters, linkers and loaders. [3] 2. Operating System Concepts: Processes, deadlocks, memory management, input/output management, files, security, shell, system calls - process management, directory managements, introduction to Win32 APIs. [5] 3. Assemblers: Design and implementations, assembly language specifications (example MASM), general design procedures, design of an assembler- one pass and two pass, table processing. [5] 4. Macro Processors: Design and implementation, macro instruction, features of macro facility. [5] 5. Loaders and Linkers: Design and implementation, loader schemes - compile and go, general, absolute, subroutine linkages, relocating loaders, direct linking loaders, binders, linking loaders, overlays, dynamic binders. [5] 6. Compiler Design: Making problem statements, phases of a compiler, data structures, recursion, call and return statements, implementations, block structure, goto, interrupts and pointers. [6]

CS 321

Software Engineering Laboratory-II

0-0-2-1

Assignments are based on the IBM Rational Seed Program.

CS 323

Computer Graphics Laboratory

0-0-4-2

Assignments are based on the course contents of CS 307 Computer Graphics.

CS 325

System Programming Laboratory

0-0-4-2

Assignments are based on the course contents of CS 309 System Programming.

MA 302

Linear Optimization

3-1-0-4

1. Linear Programming Problems: LP formulation, LPP in standard form, graphical method for solving LPPs, simplex method, duality theory, dual simplex method, generalized simplex algorithm, M-method, two phase method, assignment problems, transportation problems, Trans-shipment problems. [12] 2. Dynamic Programming: Basic concepts, Bellman optimality principle, examples of dynamic programming models and computations, examples of allocation, replacements, solving simple linear programming problems by dynamic programming, Knapsack/Cargo loading problem. [10] 3. Queuing Theory: Elements of a queuing model, role of exponential distribution, pure birth and pure death models, specialized possion queuing model single server model, multiple server models, machine serving model (M/M/R), (GD/K/K), (M/G/1) (GD//) PK formula, queuing decision model. [5] 4. Project Scheduling by PERT/CPM: Construction of the network diagram, critical path computation for CPM, critical path computations for PERT, project time vs project cost. [8] 5. Sequencing Theory: Sequencing problem, Johnson algorithm for processing n-jobs through 2 and 3 machines, processing 2 jobs through n-machines. [5]

EC 202

Microprocessors and Microcontrollers

3-0-0-3

1. 8086/8088 Microprocessors: Introduction, architecture, memory management, segmented memory, register set, supporting chips viz. 8284, 8288, 74373, 74245, minimum and maximum mode of operations, read and write cycles. [10] 2. Programming: Addressing modes of 8086/8088, instruction set of 8086/8088, assembly language programming using the MASM (Microsoft assembler)/ TASM (Turbo assembler), directives and pseudo-operations of MASM/TASM, stack structure of 8086/8088, subroutines. [8] 3. Interfacing with 8086/8088: Mapping of memory and I/O devices, interfacing of numerical coprocessor 8087, I/O processor 8089, 8255 PPI, 8251 USART, 8253/8254 PIT and 8237/8257 DMAC. [8] 4. Interfacing using Interrupts: Interrupt structure of 8086/8088, programming for interrupts, interfacing of 8259 PIC, 8279 PKDC, 8275/6845 CRT controllers, 12 bit ADC, 12 bit DAC and LCD display with 8086/8088. [8] 5. Introduction to Advanced Microprocessors: Architecture of 80186 and 80286 microprocessors. [2] 6. Introduction to 8051 Microcontroller: Memory, timers and interrupts, instruction set and pin details, interfacing and applications. [6]

CS 302

Principles of Compiler Design

3-1-0-4

1. Introduction to Compilers: Compilation process and analysis of the source program, phases of a compiler, syntax definition and syntax-directed translation, parsing and simple expression translation. [6] 2. Lexical Analysis and Parsing: Role of lexical analyzer- input buffering, specification and recognition of tokens, functions of the parser, context-free grammar, writing a grammar and top-down parsing, bottom-up parsing. [7] 3. Symbol Table Organization and Memory Allocation: Elementary symbol table organization, hash table organization, linked list and tree structured symbol tables, symbol table for structures and records, block structured languages, static and dynamic memory allocation, array allocation and access, allocation for strings and structures. [8] 4. Compilation of Expressions and Control Structures: Intermediate code forms, code generation for expressions, control transfers, procedure calls, conditional execution, iteration constructs. [5] 5. Error Detection and Recovery: Lexical and syntax errors, semantic errors, runtime errors, debugging aids and options. [4] 6. Code Generation and Optimization: Intermediate languages, declarations, assignment and case statements, design issues, run time storage management, basic blocks and flow graphs, code optimizations - major issues in optimization, optimization transformations, local optimization, program flow analysis, global optimization. [10]

CS 304

Operating Systems

3-0-0-3

1. Overview: Definition, types of operating systems- mainframe, server, multiprocessor, personal computer, real-time, embedded and smart card, system calls and utilities. [3] 2. File Systems: File concept, user and system programmer view of file systems, different modules of a file system, disk organization, tape organization, disk-space allocation methods- contiguous, linked, indexed, directory structures, file protection, disk scheduling algorithms. [6] 3. Process Management: Process concepts, threads, scheduling concepts, types of schedulers, scheduling algorithms, process state diagram, comparison of various algorithms. [6] 4. Memory Management: Memory management techniques partitioning, swapping, segmentation, paging, paged segmentation, comparison of techniques, techniques for supporting the execution of large programs - overlays, dynamic linking and loading, virtual memory- concepts, implementation by demand paging. [6] 5. Process Synchronization: Real and virtual concurrency, mutual exclusion, synchronization, inter process communication, critical section problem and its solution to semaphores binary and counting semaphores, wait / signal operations and their implementation. [6] 6. Deadlocks: Deadlock problem, characterization, prevention, avoidance, recovery. [5] 7. Input/Output: Input/Output devices, device controllers, interrupt handlers, device drivers and terminal drivers. [4] 8. Case Studies: Unix and Linux. [4]

EC 222

Microprocessors and Microcontrollers Laboratory

0-0-2-1

Assignments are based on the course contents of EC 202 Microprocessors and Micro controllers.

CS 322

Operating Systems Laboratory

0-0-4-2

Assignments are based on the course contents of CS 304 Operating Systems.

CS 324

Internet Programming Laboratory

0-0-4-2

Assignments are based on the Protocol Designing in C/C++/Java.

GE 302

Interpersonal Communication

0-0-2-1

1. Speech Acts: Introducing oneself to others, introducing a person to another, exchange of a small talk, inviting people, accepting and rejecting invitations, making a request, granting and taking permission. [4] 2. Role Play: Situational conversation for example, a patient at the doctors clinic, a customer at the bank, a customer at the departmental store etc. [4] 3. Body Language: Studying body language, distance and positioning, body orientation. [3] 4. Mock Interviews: Giving practice in appearing for interviews. [8]

5. Group Discussion: Taking part in a group discussion, entering a discussion, giving comments etc. [9]

EC 305

Digital Signal Processing

3-1-0-4

1. Discrete Time Systems: Architecture of digital signal processing (DSP), comparison between DSP and analog signal processing (ASP), block diagram representation of discrete time systems and their types. [4] 2. Sampling: Representation of a continuous time signal by its samples- sampling theorem, type of sampling- impulse sampling, zero order hold sampling and natural sampling, reconstruction of signals from its samples using interpolation, the effect of undersampling- aliasing, discrete time processing of continuous time signals, sampling of discrete time signals- decimation and interpolation. [6] 3. MATLAB Programming: Introduction to MATLAB programming and its use in DSP. [4] 4. Filter Structure and Design: LTI system as a frequency selective filter, ideal filter characteristic and approximation, types of filters- analog and digital, low pass, high pass, band stop, band pass, comb, notch, match, all pass, IIR, FIR, block diagram representation of filters, IIR and FIR structures, design aspects of digital filters, IIR filter design methods- impulse invariance method, bilinear transformation, Butterworth and Chebyshev approximation, FIR filter design, Kaiser window, comparison between IIR and FIR filters. [10] 5. DFT, FFT and DCT Algorithms: Frequency domain sampling and reconstruction of discrete time signal- discrete Fourier transform (DFT), properties of DFT, linear convolution using DFT, efficient computation of the DFT: fast Fourier transform (FFT) algorithms, radix-2 FFT algorithms, radix-4 FFT algorithms, split-radix algorithms, application of FFT algorithms, linear convolution using FFT, definition of direct cosine transform (DCT), definition of DCT-1 and DCT-2, energy compaction property of DCT-2, linear convolution using DCT. [12] 6. Application of DSP: Dual tone multi-frequency signal detection, musical sound processing, voice privacy systems, sub-band coding of speech and audio signals, discrete multi-tone transmission of digital data, implementation of echo canceller, software radio, modems and speech coders on DSP. [4]

CS 401

Artificial Intelligence

3-1-0-4

1. Overview: Artificial intelligence problems, artificial intelligence techniques, production system and its characteristics. [4] 2. Problem Solving: Problem definition, state space search tree, problem characteristics, search strategies for artificial intelligence productions system backtracking, graphsearch, uniformed graph-search, heuristic graph-search techniques-generate and test, hill climbing, best-first search, problem reduction- AO* algorithm for AND/OR graphs. [12] 3. Knowledge Representation: Representation and mappings, approaches and issues in knowledge representation, predicate logics, procedural versus declarative knowledge, forward versus backward reasoning,, non-monotonic reasoning, [12] 4. Game Theory: Minimax search, Alpha-Beta cutoffs, iterative deepenin. [3]

5. Natural Language Processing: Introduction, syntactic processing, semantic analysis, discourse and pragmatic processing. [5] 6. Learning: Rote learning, learning by advice, learning in problem solving, discovery, analogy. [4]

CS 403

Computer Networks

3-1-0-4

1. Overview and Network Model: Network topologies, protocols and standards, basic elements of a network, OSI reference model, TCP/IP model, categories of networksLAN, WAN and MAN. [5] 2. Physical Layer: Manchester, differential Manchester encoding, NRZ, multilevel binary and biphase encoding, scrambling techniques, packet and circuit switching, transmission media. [5] 3. Data Link Layer: Framing, stop and wait protocol, sliding window protocol, performance and efficiency, HDLC, error detection, parity check, CRC. [4] 4. MAC Layer: Pure and slotted Aloha, throughput characteristics, CSMA/CD, performance. [2] 5. Local Area Network: IEEE 802.3, 802.4, 802.5, performance evaluation, FDDI, DQDB. [6] 6. Network Layer: Virtual circuits, datagrams, IPv4, IP address classes, subnetting, supernetting, IP fragmentation, ARP, RARP, routing algorithms, RIP, OSPF, BGP, congestion control algorithms, leaky bucket, token bucket, ICMP, IPv6. [6] 7. Transport Layer: Duties of the transport layer, connection, TCP, TCP services, TCP header, UDP, UDP header. [4] 8. Application Layer: Client/Server model, DNS, FTP, HTTP, SMTP, telnet. [4]

9. SONET/SDH: Synchronous transport signals, physical configuration, SONET layers, SONET frame, multiplexing STS frames and applications. [4]

EC 325

Digital Signal Processing Laboratory

0-0-2-1

Assignments are based on the course contents of EC 305 Digital Signal Processing.

CS 421

Artificial Intelligence Laboratory

0-0-2-1

Assignments are based on the course contents of CS 401 Artificial Intelligence.

EC 304

VLSI Design

3-1-0-4

1. Basic VLSI Design Issues: The significance of ICs designing, issues in IC design, IC manufacturing- technology and economics, CMOS technology, IC design techniqueshierarchical design, design abstraction and computer aided design. [4] 2. MOS Transistor Theory: Basic electrical properties of MOS circuits, I vs. V relationship, threshold voltage and body effect, MOS device design equations, second order effects. [5] 3. NMOS and CMOS Inverter: Static load inverters, CMOS inverter, W/L ratio for NMOS and CMOS inverter, Bp/Bn ratio, noise margin, performance of CMOS inverter-dynamic behavior, power consumption, designing combinational and sequential circuits in CMOS. [7] 4. Stick Diagram & Layout: Stick diagrams, NMOS and CMOS design style, hierarchical stick diagram, design rules - lambda based design rules, contact cuts, double metal MOS process rules, CMOS lambda based design rules, layout diagrams. [7] 5. Basic Building Blocks of VLSI Circuits: Designing arithmetic building blocks including adders, multipliers and shifters, designing memory and array structures including ROM, RWM and its peripheral circuitry. [6] 6. Subsystem Design and Layout: Gate logic, structured logic, clocked sequential circuits. [7] 7. HDLS and VLSI CAD Tools: Introduction to VHDL/Verilog, tools for simulation and synthesis. [4]

EC 421

VLSI Laboratory

0-0-2-1

Assignments are based on the course contents of EC 304 VLSI Design.

CS 402

Information System Security

3-1-0-4

1. Overview: System security and network security, security attacks, security services, security mechanisms, model for internet-work security. [1] 2. Conventional Encryption: Principles, conventional algorithms - data encryption standard, triple DEA, cipher block, modes of operation, location of encryption devices, key distribution. [7] 3. Public-Key Cryptography: Approaches to message authentication, secure hash functions and HMAC, public-key cryptographic principles, public-key cryptography algorithms, RSA public-key encryption algorithm, Diffie-Hellman key exchange, digital signatures, key management. [7] 4. Authentication Applications: Kerberos, X.509 authentication service. 5. e-Mail Security: Pretty Good Privacy (PGP), S-MIME. [4] [4]

6. IP Security: Overview, architecture, authentication header, encapsulating security payload, combining security associations, key management - Oakley key determination protocol, ISAKMP. [6] 7. Web Security: Web security requirements, secure socket layer, transport layer security and secure electronic transaction. [5] 8. Intruders, Viruses and Firewall: Intruders, viruses and related threats, firewall design principles, trusted systems. [6]

CS 404

Client/Server Computing

3-1-0-4

1. Overview: Definition, history, evolution, different types of servers, ERP and client/ server computing. [3] 2. Client/Server Architecture: Two-layer and three-layer architectures, components of client/server architecture, communication between clients/servers, middleware technology in client/server computing, client/server building blocks. [4] 3. Transaction Processing: ACID properties, transaction models, two phase commit protocol, TP monitor, TP monitor standards, TP monitor benefits, TP lite, TP heavy. [5] 4. Groupwares: Definition, need, components, multimedia document management, work flow, e-mail, scheduling, group conferencing. [6] 5. Client/Server Computing and Internet: Web servers- components, URL, HTTP, HTML, web-based forms, tables, CGI-sever side of the web, web security and SHTTP, firewall, ASP object model. [6] 6. Client/Server Computing with Distributed Object: Distributed objects, component, ORB, introduction to CORBA, COM+ and ODBMS. [8] 7. Client/Server Application Development: Tools, client/server application design, developing applications on RDBMS, GUI and OOUI design, client side developing tools-Developer 2000 / VB, server side development tools-Oracle/MS-SQL. [8]

CS 405
1.

Multimedia Systems

3-1-0-4

Overview Media and data streams, properties of a multimedia system, data stream characteristics, information units, multimedia hardware, platforms, memory and storage devices, input and output devices, communication devices, multimedia software, multimedia software tools, multimedia authoring tools. [10] Multimedia Building Blocks: Audio, basic sound concepts, music, speech, MIDI versus digital audio, audio file formats, sound for the web, images and graphics-basic concepts, computer image processing, video and animation-basic concepts, animation techniques, animation for the web, multimedia building blocks. [9] Data Compression: Storage space and coding requirements, classification of coding, compression techniques-JPEG, H.261, MPEG and DVI, multimedia database systems - characteristics, data analysis, data structure, operations on data, integration in a database model. [11] Multimedia Operating Systems: Real time process management, rate monotonic algorithm, earliest deadline first algorithm and multimedia file systems. [5] Synchronization: Intra and inter object synchronization, live and synthesis synchronization, lip synchronization requirements, pointer synchronization requirements, elementary media synchronization. [5]

2.

3.

4.

5.

CS 406
1.

Neural Networks

3-1-0-4

Overview: Definition and characteristics of artificial neural networks, terminology, models of neuron, activation functions, network layers, topology. [5] Learning Process: Basic learning laws, learning categories, Hebbian, competitive, error-correction, re-inforcement, stochastic, sparse coding, min-max, principal component, driver reinforcement learning. [6] Feed-Forward Neural Network: Single layer preceptron- introduction, adaptive filtering problem, LMS algorithm, and preceptron convergence theorem, multi layer preceptron-introduction, back-propagation algorithm, XOR problem, radial-basis function network-introduction, cover theorem. [13] Feedback Neural Network: Recurrent neural network- introduction, architecture, learning algorithms-BPTT, RTRL, recurrent back-propagation, Hopfield networkintroduction, discrete and continuous version, spurious state, storage capacity. [10] Self-Organizing Map: Introduction, feature-mapping models, self-organizing algorithm and properties of feature map. [3] Simulated Annealing: Introduction, information theory, statistical mechanics, Boltzman machine-introduction, architecture, learning process. [3]

2.

3.

4.

5.

6.

CS 407
1.

Advanced Data Structures

3-1-0-4

Advanced Trees: Definitions and operations on weight balanced trees - Huffman trees, 2-3 tree and Red-Black tree, augmenting Red-Black tree to dynamic order statistics and interval tree applications, B-tree, implementation, deletion and insertion of a key in B-tree. [10] Disjoint Sets: Operations on disjoint sets, implement on set, dictionaries, priority queues and concatenable queues using 2-3 tree. [6] Mergeable Heaps: Mergeable heap operations, binomial trees, implementing binomial heaps and its operations, structure and potential function of fibonacci heap, implementing fibonacci heap. [6] Graph Theory: Definitions of isomorphism, components, circuits, cut-sets, cutvertices, planner and dual graphs, spanning tree, Kuratovski two graphs. [6] Graph Theory Algorithms: Algorithms for connectedness, finding all spanning trees in a weighted graph and planarity testing, breadth first and depth first search, topological sort, strongly connected components and articulation point, single source shorted path and all pair shortest path algorithms. [10] Network Flow Problems: Max-Flow Min-Cut theorem, Ford-Fulkerson Max-Flow algorithm. [2]

2.

3.

4.

5.

6.

CS 410
1.

Data Mining and Warehousing

3-1-0-4

Overview: Concept of data mining and warehousing, data warehouse roles and structures, cost of warehousing data, roots of data mining, approaches to data exploration and data mining, foundations of data mining, web warehousing, webwarehousing for business applications and consumers, introduction to knowledge management, data warehouses and knowledge bases. [6] Data Warehouse: Theory of data warehousing, barriers to successful data warehousing, bad data warehousing approaches, stores, warehouse and marts, data warehouse architecture, data about data - metadata, metadata extraction, implementing the data warehouse, data warehouse technologies. [4] Data Mining and Data Visualization: Data mining, OLAP, techniques used to mine the data, market basket analysis, current limitations and challenges to DM, data visualization. [5] Machine Learning: Fuzzy logic and linguistic ambiguity, artificial neural networks, genetic algorithms and genetically evolved networks, application machine that learn. [5] Designing and Building the Data Warehouse: The enterprise model approach of data mining design, data warehouse project plan, analysis and design tools, data warehouse architecture, specification and development. [5] Web-Based Query and Reporting: Delivering information over the web, query and reporting tools and business value, architectural approaches to delivering query capabilities over the web. [3] Web Based Statistical Analysis and Data Mining: Analytical tools, business value from analytical tools, humble spreadsheet, determining the business value that analytical tools will deliver, statistical products overview statistical analysis applications, correlation analysis, regression analysis, data discovery tools overview, data discovery applications, comparison of the products, architectural approaches for statistical and data discovery tools. [6] Search Engines and Facilities: Search engines and the web, search engine architecture, variations in the way the search facilities work, variations in indexing schemes. [3] Future of Data Mining and Data Warehousing: Future of data warehousing, trends in data warehousing, future of data mining, using data mining to protect privacy, trends affecting the future of data mining, future of data visualization. [3]

2.

3.

4.

5.

6.

7.

8.

9.

CS 210
1.

Management Information System

3-1-0-4

Organization: Hierarchy in the organization structure, information flows, concentration of authority, characteristics of managers, problem solving by managers. [5] Information Needs and Sources of Managers: Activities of the organization, managerial activities, planning, types of management decisions and information needs, types of information needed, sources of information. [5] Basics of Management Information System: MIS concepts, definition, role and impact of MIS, process of management, organization structure and behaviors, decision making, information concepts, levels of information systems, system concepts and control, types of system, handling system complexity, system development model. [12] Development of Management Information System: Requirement implementation of MIS, choice of information technology for MIS. and [8]

2.

3.

4.

5.

Application of Management Information System: Applications in manufacturing sector-personnel management, financial management, production management, material management, marketing management, applications in service sector. [8]

CS 412
1.

Distributed Systems

3-1-0-4

Characterization of Distributed Systems: Definition, distributed systems- Internet, intranet, mobile, ubiquitous computing, resource sharing and World Wide Web challenges- heterogeneity, openness, security scalability failure handling concurrency and transparency. [3] System Models: Architecture models- software layers, system architecture, variations on client-server model, interfaces, design requirement for distributed architectures, fundamental and interaction models, failure and security models. [5] Distributed Object and Remote Invocation: Introduction to remote method invocation (RMI) and interface in distributed systems, communication between distributed objects-objects model, distributed objects, distributed objects model and design issues for RMI, implementation of RMI and distributed garbage collection, remote procedures call and sun RPC case study, events and notifications-participants, JINI distributed event specification, Java RMI case study, building client and server programs, design and implementation of Java RMI. [10] Time and Global State: Clocks, events and process states, synchronizing physical clocks-synchronization in a synchronous system, Cristian method for synchronizing clocks, Berkley algorithm, network time protocol, global state and consistent cuts. [5] Distributed Shared Memory: Introduction, message passing versus DSM, implementation approaches to DSM, design and implementation issues-structure and synchronization model. [5] Distributed Database Systems: Distributed DBMS architecture, distributed database design, alternate design strategies, distribution design issues, fragmentation, and allocation. [6] Processes and Processors in Distributed Systems: Threads, system models, processor allocation, scheduling, fault tolerance. [5] Distributed File System: Design, implementation, trends in distributed file system. [6]

2.

3.

4.

5.

6.

7.

8.

CS 414
1.

Real Time Systems

3-1-0-4

Overview: Definition, structure, reference model, characteristic hard and soft real time system. [8] Real Time Task Scheduling: Introduction to clock-driven, weighted-round robin, priority-driven approach, priority-driven algorithms- rate monotonic scheduling, deadline monotonic, earliest deadline first scheduling, least slack time scheduling algorithms, optimality of RM, DM, EDF and LST algorithms, sporadic task scheduling, critical section handling- priority inheritance, priority ceiling protocols. [12] Real Time Databases: Definition, ACID properties, main memory database, transaction priorities, transaction aborts, concurrency control issues, disk scheduling algorithms, serialization consistency, database for hard real time systems (MDARTS). [5] Real Time Communication: Network topologies, protocols- contention based, token based, stop and go multi-hop, the polled bus, hierarchical round robin, deadline based protocols, and fault tolerant routing. [5] Real Time Programming Languages and Tools: Introduction, desired language characteristics, data types, control structures, run time exception handling, multitasking, task dispatching policy, entry queuing policy, protected data types, timing specifications, run time support- compiler, linker, debugger and kernel. [6] Real Time Applications: Radar signal processing, air-traffic control system, multimedia. [4]

2.

3.

4.

5.

6.

EC 314
1.

Electronic Measurements and Instrumentation

3-0-0-3

Concepts of Measurements: Introduction, accuracy and precision, repeatability, errors in measurement, sources of errors, types of errors, statistical analysis of measurement data, graphical representation of measurement, data as distributions, Gaussian graph and precision indices. [5] Analog Instruments: Basic classifications, deflecting, controlling and damping torques, principles of operation of PMMC instruments, shunts and multipliers, moving iron instruments, electro-dynamic type wattmeter and induction type energy meter. [8] Electronic Instruments: Electronic voltmeters, digital voltmeters, q-meter, vector impedance meter, digital measurement of time and frequency, wave analyzers, harmonic distortion analyzers and spectrum analyzers. [6] Transducers and Measurement of Non-Electrical Quantities: Introduction, electrical transducers, classification, basic requirements of a transducer; selection of a transducer, measurement of displacement, strain, pressure, flow, temperature, force and torque. [9] Instrumentation Amplifiers: Introduction, basic characteristics, dc amplifiers, operational amplifiers, instrumentation amplifiers, isolation amplifiers and signal conditioning using operational amplifiers. [6] Display and Recording Devices: Introduction, analog displays and recorders, digital input-output devices and other displays. [3] Oscilloscopes: Cathode ray tube, operation, basic CRO circuit, time base and display of time dependent voltages, dual trace, dual beam, sampling and storage oscilloscopes, Lissajous patterns. [5]

2.

3.

4.

5.

6.

7.

EC 316
1.

Advanced Digital Communication

3-1-0-4

Model of a Communication System: Introduction, probability theory and random variables. [4] Digital Communication Techniques: Sampling theorem and techniques, uniform and non-uniform quantization techniques, compression standards, time division multiplexing and synchronization. [10] Information Theory and Source Coding: Channel capacity, Shannon capacity, linear black codes and syndrome decoding, cyclic codes, Hamming codes, BCH codes, convolution, Reed-Solomon coding, Vitrebi coding and decoding. [10] Digital Modulation Techniques: Base-band transmission, intersymbol interference and adaptive equalization, different types of band limited and power limited digital modulation and demodulation techniques, trellis coded modulation, bandwidth consideration of different digital modulation schemes, matched filter and probability of error analysis, carrier and timing recovery techniques. [16]

2.

3.

4.

EC 318
1. 2.

Satellite Communication

3-1-0-4
[2]

Introduction: Concepts, Frequency, Zone, Terminology and Earth orbits.

Communication Satellite: Kepler law, azimuth, and elevation angle, effect of eclipse on satellite, launching of a satellite. [6] Satellite Link Equation: Uplink, down link, transponder link, cross link, earth station configuration, earth station keeping. [4] Broadcasting by Satellite: Analog transmission, digital transmission, SPADE system, TV broadcasting and telephone transmission. [6] Multiplexing and Multiple Access: Frequency division multiplexing, time division multiplexing, trans multiplexing, frequency division multiple access, time division multiple access, demand assignment multiple access, code division multiple access, spread spectrum techniques, frequency hoped spread spectrum, carrier sensed multiple access. [10] Communication Satellite System: Very small aperture terminal satellite schemes, VSAT networking, mobile satellite communication system, iridium system. [6] Indian Satellite Series: Indian communication satellites, Indian remote sensing satellites, launch vehicles. [6]

3.

4.

5.

6.

7.

EC 414
1.

Cellular and Wireless Communication

3-1-0-4

Cellular Communication: Introduction to cellular communication systems, review of mobile radio propagation. [6] Digital Cellular System: Cellular concept, digital cellular mobile system, GSM architecture, GSM technologies, micro-cellular systems, third generation mobile communication systems, personal communication system. [6] Access Techniques: Multiple access in cellular system, analog and digital access techniques, spread spectrum multiple access, code division multiple access, WCDMA and OFDM techniques, multiple access techniques for wireless environment, quality of service enabled mobile access, broadband wireless access CDMA standard, IS-95. [12] Networks and Architectures: Network architecture, GSM architecture, adhoc network, CDMA architecture, mobile data networks, mobile IP and wireless access protocol, next generation broadband wireless network, IEEE 802.11, IEEE 802.16, hyperlan. [12] Short Range Networks: Introduction, bluetooth networks, home network, cordless system, wireless local loop. [6]

2.

3.

4.

5.

EE 201
1.

Network Analysis

3-1-0-4

Development of Circuit Concept: Introduction, capacitance, inductance and resistance parameters, approximation of a physical system as a circuit, reference directions for current and voltage, voltage and current sources, active element conventions, dot convention for coupled circuits, topological description of networks, linear graphs of a network and its parts, loops and trees, incidence matrix, cut-set matrix and tie-set matrix. [6] Network Equations: Kirchoffs laws, minimum number of network equations, source transformations, formulation of network equations, loop variable analysis, node variable analysis, duality, and state variable analysis. [8] Analysis of RLC Circuits: First order differential equation, general and particular solutions, time constant, integrating factor and solution of networks with RC and RL combinations, second order equations, circuits with internal excitations, higher order equations circuit with internal excitation, network excited by external energy sources, the Laplace transformation, some basic theorems for the Laplace transformation, transform impedance and transform circuits, series and parallel combination of elements, transient analysis using Laplace transform, partial fraction expansion, solution of problems by Laplace transformation. [10] Network Theorems: Superposition and reciprocity theorems, Thevenins and Nortons theorems, maximum power transfer theorem, application of these theorems to networks with a.c and d.c excitation and with dependent sources. [6] Two Port Network: Two port terminals, impedance, admittance, hybrid, ABCD parameters, relationship between various parameters, reciprocity and symmetry of two port network, inter connection of two port networks, image impedance and short circuit and open circuit impedances. [6] Synthesis of One Port Network: Elementary synthesis procedures, properties of LC immittance function, synthesis of LC driving point immittance, properties of RC driving point impedances, synthesis of RC impedances or RL admittances, properties of RL impedances and RC admittances, synthesis of certain RLC functions. [6]

2.

3.

4.

5.

6.

CS 409
1.

Modeling and Simulation

3-1-0-4

Introduction to Simulation, Modeling and System Dynamics: System concepts and theories, types of system, discrete and continuous, deterministic and stochastic, open and closed, system dynamics- system flow, flow diagrams, notations and conventions, feed back systems and causal loops diagrams, developing system dynamic equations- 1st order (+ve, -ve) systems, pure 2nd order (+ve, -ve) systems, general feedback systems. [9] Random Numbers and Random Varieties: Random number generation- properties of random numbers, generation of pseudo random numbers, techniques for generating random numbers, tests for randomness, random varieties- inverse transform methods (exponential, uniform, Weibull), convolution methods, acceptance-rejection methods. [8] Statistical Models in Simulation: Review of terminology and concepts, useful statistical models, discrete and continuous distributions, estimation of means, variances and correlations. [5] Discrete Event Simulation: Concepts, event scheduling versus time advance scheduling, list processing. [4] Verification And Validation of Simulation Models and Output Analysis: Introduction, input modeling: identifying the distribution of data, parameter estimation, goodness of fit tests, model building, verification calibration and validation of models, output analysis- measures of performance and their estimation. [9] Examples of Simulations and Languages: Simulation of queing systems, simulation of inventory systems, languages- GPSS, DYNAMO, SIMSCRIPT, MODSIM. [5]

2.

3.

4.

5.

6.

MT 301
1.

Entrepreneurship and Business Management I

3-1-0-4

Entrepreneur, Enterprise and Environment: What (competencies), why (motives), choices, sources, facilitators, process, manifestations. [10] Entrepreneurial Nuances: Domain - entrepreneurial discovery, role of cognition, role of time, role of trust and cooperation, role of feminine dimensions, entrepreneurship, entrepreneurial environment, entrepreneurial satisfaction. [10] Entrepreneurial Motivation: Need for achievement, calculated risk behavior, competence assessment, and team spirit. [12] Creative Problem Solving: Problem solving techniques, memory & visualization, barriers to creative thinking, preparing mind for creative thought, stimulation for imagination of new ideas, creativity & rewards of innovation, idea generation, creative evaluation. [8] Business Opportunity Identification: Process and methodology, sectoral scanning, opportunity profiling. [12]

2.

3.

4.

5.

MT 302

Entrepreneurship and Business Management II (Prerequisite: MT 301)

3-1-0-4

1.

Business Plan: Importance of business plan, technical analysis and presentation, market analysis and presentation, financial analysis and presentation, economic analysis, business plan as an integrated exercise. [20] Entry Strategies: Environmental stability and timing of entry, barriers to entry, new venture performance and competitive advantage. [4] Procedures and Formalities for Creating Enterprises: District Industries Centre, resource mobilization, permissions export-related formalities, support systems. [20] Launching and Sustaining New Businesses: Recruiting and hiring, issues in fund management, marketing and sales planning, publicizing the new venture, managing growth, time management, entrepreneurial skills and strategies, negotiations. [8]

2.

3.

4.

PY 303
1.

Applied Quantum and Statistical Mechanics

3-1-0-4

Elements of Quantum Mechanics: Wave-particle duality, Heisenberg uncertainty principle, Schrodinger equation, probabilistic interpretation of wave function, normalization of wave function, probability current density, Hermittian operators, expectation values, Ehrenfest theorem, continuity equation, angular momentum operators and their Eigen values and Eigen functions, solution of harmonic oscillator problem by operator method, Hydrogen atom, Eigen functions and energy spectrum. [15] Mathematical formalism of Quantum Mechanics: Stern-Gerlach experiment, Kets, bras and linear operators, bra-ket algebra, matrix representation of operators, Hermittian operators, measurements, observables and uncertainty relations, change of basis, unitary transformation, Schrodinger and Heisenberg pictures of time evaluation, approximation methods, variational method, time independent perturbation theory, application to Zeeman effect and stark effect. [12] Elements of Statistical Physics: Introduction to classical and quantum statistics, Maxwell-Boltzman, Bose-Einstein and Fermi-Dirac statistics and their applications, density of states, Bose condensation, Free electron theory of metals, Hall effect, superconductivity, London equation, coherence and penetration depth, flux quantization, applications of superconductivity, SQUIDS. [10] Lasers: Laser as coherent light, spontaneous and induced emission, transition probabilities for absorption and induced emission, electric dipole transition, forbidden transition, ruby and He-Ne lasers, applications of lasers. [5]

2.

3.

4.