Department of computer Science & Information Technology
Master of Computer Application (MCA)

Course Structure

Code Course Name L T P CR
CS 404 Programming and Problem Solving 3 1 1 5
CS 405 Discrete Mathematics 2 1 0 3
CS 406 Digital Logic 3 0 1 4
CS 407 Information and Communication Technology 3 0 1 4
CS 408 Data Structures 3 1 1 5
CS 409 Computer Organization & Architecture 3 1 1 5
CS 403 File Structure 2 0 0 2
CS 508 Database Management Systems 3 1 1 5
CS 502 System Software 2 0 1 3
CS 504 Operating System 2 1 1 4
CS 505 Software Engineering 3 0 1 4
CS 509 Data Communication 3 0 1 3
CS 507 Computer Networks 3 0 1 4
CS 514 Minor Project - - - 8
CS 515 Major Project - - - 16
CS 421 Graph Theory 3 0 0 3
CS 422 Numerical Methods 3 0 1 4
CS 423 Graphical User Interface Programming 2 0 2 3
CS 424 Formal Language and Automata 3 0 0 3
CS 521 Object Oriented Programming and Design 3 1 1 5
CS 522 Computer Graphics 3 0 1 4
CS 523 Enterprise Resourse Planning 3 0 0 3
CS 524 Theory of Computation 3 0 0 3
CS 525 Artificial Intelligence 3 0 0 3
CS 526 Management Information System 3 0 0 3
CS 532 Compiler Design 3 0 1 4
CS 528 Digital Signal Processing 3 0 2 4
CS 601 Design and Analysis of Algorithms 3 0 0 3
CS 602 Image Processing 3 0 0 3
CS 625 Web Technology 3 0 1 4
CS 604 Optimization 3 0 0 3
CS 605 Simulation and Modeling 3 0 0 4
CS 606 Computer Architecture and Parallel Processing 3 0 0 3
CS 609 Geographic Information System 3 0 0 3
CS 610 Bioinformatics 3 0 0 3
Code Course Name L T P CH CR
CS 621 Mobile Computing 4 0 0 4 4
IT 611 Distributed Systems 3 0 0 3 3
IT 503 Multimedia Systems 3 0 2 5 4
IT 504 E-Commerce 3 0 0 3 3
IT 509 Data Mining and Data Warehousing 3 0 1 4 4
MS 405 Probability and Statistics 3 1 0 4 4
BM 421 Accounting and Financial Management 3 0 0 3 3
BM 504 Managerial Economics 4 0 0 4 4

Programming and Problem Solving 3-1-2 5
Notion of an algorithm, tools for design and analysis of algorithms - Flow chart, Decision table, Pseudocode. Major hardware and software components of a digital computer; Concepts of m/c language and high level language. Features of a high level language : Assignment statement, input-output statements; Expressions; data types; conditional statements, Iterative statements; Array data type and use of arrays; character data type and text processing; functional and procedural abstraction; Recursion; Pointer data type and simple applications of pointers. Example algorithms: string processing, root finding, matrix operations, record processing, searching, sorting etc. Documentation, Debugging.

[1]Dromey, G: How to solve it by computer, PHI (EEE), 1985.
[2]Gottfried B: Programming with C
[3]Kanitkar: Let us C
[4]Karnighan and Ritchie: The C Programming Language

CS 302 Discrete Mathematics 2-1-0 3
Part - I : Set. relation and functions :
1.- Set, relations, equivalence relations; mappings-one-one and on to ;
2.-Definition of an algebraic structure;
3.-Introduction to groups, subgroups, normal subgroups, isomorphism, homeomorphism; automorphism of groups; semigroups, monoids, rings, vector space.

Part - II : Logic :
- Logic operators, Truth table, Normal forms.
- Theory of inference and deduction.
- Mathematical induction.
- Predicate calculus; predicates and quantifiers.
- Boolean algebra.
- Lattice.

Part - III : Combinatorics :
- Basic counting techniques.
- Recurrence relations and their solutions.
- Generating functions.

Part - IV : Modular Arithmetic :
- Congruence modulo, Fermat s Theorem, Euler s Theorem, Multiplicative Inverse, Reminder Theorem, FFT, Discrete Logarithm.

1. Liu, C. L. : Introduction to Discrete Mathematics.
2. Trembley, Manohar : Discrete Mathematical Structures.

CS303 Digital Logic 2-1-0 3
Representation of Information :
Number System : Binary, octal, hexadecimal; Positive and negative numbers; fixed point and floating point quantities.
Arithmetic operations : Addition, subtraction.
Character codes: ASCII and EBCDIC, Redundant coding for error detection and correction : Concept of Hamming distance, parity codes, Hamming code.
Logic Design : Boolean algebra, Boolean variables and functions - canonical and standard forms, truth table, minimization of Boolean functions - Karnaugh map.
Combinational logic circuits - AND, OR, NAND, NOR and NOT gates and tristate buffer; Implementation of Boolean functions using logic gates; Multiplexers, decoders; encoders, simple arithmetic and logic circuits.
Sequential circuits - flip-flops, shift registers and counters-synchronous and asynchronous.
Concept of bus and register transfer language.

Memory Devices : Semiconductor memory - RAM, ROM; Magnetic core and surface memory - disk, drum, tape; Access time and cost considerations: Concepts of volatility, random access, serial access, direct access, on-line and backup storage.

1. Mano, M.M. : Digital Logic and Computer Design, PHI (EEE)
2. Rajaraman, V.Radhakrishnan : An introduction to Digital Computer Design.-PHI (EEE)
3. Mano, M.M. ; Computer System Architecture, PHI (EEE)
4. Hamacher, Vranesic, Zaky : Computer organization, McGraw Hill.

CS 304 Information Technology 2-0-2 3
Information: Concept of Information and Information Processing; Information Gathering, Storage, Processing, Retrieval, and Dissemination; Evolution of Information Processing.
Elements of Modern Information Processing System:
Hardware: Processor, Input/ output devices, Storage devices & media, Data Communication equipment.
Software: System and Application.
Programming Languages: Machine, Assembly, HLL; Generation of Languages.
Operating Systems: Singleuser/ Multiuser, Batch/ Interactive, Real-time, Network OS, File server, Distributed OS; Command Shell, GUI- Windows; Examples : DOS, UNIX, Windows 95/ NT, Novell Netware.
Classification of Computers: Desk-top Workstations/ PCs, Mainframe, Super-Computer, Parallel computer; Client-Server Architecture.
Computer & Communication : Computer Networks- LAN, WAN, Communication services across network protocols, e-mail, Internet facilities through World Wide Web; Communication devices.
Security and Integrity Issues: Information integrity definition, Ensuring integrity; Computer and communication security, Perverse software, Concepts and component of security, Preventive measures and treatment.
Information Technology Application: Scientific, Business, Educational, Industrial, Medical, Entertainment, Communication etc.
Information Technology Projects in India.
Laboratory: Word processing, Spreadsheet, Graphics, Web page creation.

1. Trainer T.N., Computers, 4th Edn, McGrawHill.
2. Rajaraman V., Fundamentals of Computers, 2nd Edn, PHI.

CS 401 Data Structures 2-1-2 4
Basic Concepts: Data Structures, Algorithms, Complexity of algorithms.

Basic data types, Lists, Stacks, Queues.
Trees: Definition and Implementation; Binary trees, Tree traversal, Postfix, Prefix notations.
Sets: Implementation; Dictionary, Hash table, Priority queues; Advanced Set Representation Methods - Binary search tree, AVL tree, Balanced tree, Sets with Merge and Find operation.
Directed graphs: Representation; Single source shortest path problem, All pair shortest path problem, Transitive closure.
Undirected graph : Minimum spanning tree
Sort Algorithms: Quick-sort, Heap-sort, Bin-sort, Selection,
Memory management, Garbage Collection.

1. Aho, Hopcroft and Ullman, Data Structures and Algorithms, Addision Wesley Publishing Co.
2. Horowitz and Sahni, Fundamentals of Algorithms, Narosa Publishing House.
3. Knuth. D., The Art of Computer Programming, Vol.-I & II, Addison Wesley.

CS 402 Computer Organization & Architecture 2-1-2 4
Overview: Block diagram of a computer system, Instruction execution model.
Processor Organization:
Instruction set architecture- types, formats, addressing modes; Register set; Assembly language programming.
Data path organization, Control unit design - Hardwired control, Microprogramming.
CISC and RISC architecture, Instruction pipelining.
Computer arithmetic- Review of addition and subtraction; Multiplication- Booth
s, Array; Division- Restoring and non-restoring; Floating point arithmetic.
Memory Organization:
Interfacing of memory with processor, Memory hierarchy, Multiple-module memory, Cache memory, Virtual memory.
Input/ output Organization:
Synchronization of data transfer- strobed and handshaking;
I/O mapping and control- Program controlled, Interrrupt driven, DMA, Interrupt and DMA mechanisms and controllers.

1. Hamacher, Vranesic, and Zaky, Computer Organization, McGraw Hill.
2. Mano M.M., Computer System Architecture, PHI(EEE).
3. Stallings, Computer Organization and Architecture, PHI(EEE).

CS 403 File Structures 2-0-0 2
Storage device structures and input output mechanisms.
Concepts of record, block, and file.
File Structures: Pile, Sequential, Indexed Sequential, Direct access, Inverted files; Indexing structures- B-tree and its variations.

1. Loomis, Marry; Data Management and File Structures, PHI
2. Horowitz and Sahni, Data Structures, Narosa Publishing House.

CS 421 Graph Theory 2-0-2 3
Graph : Incidence and degree; Handshaking Lemma; Isomorphism; Subgraphs and Union of graphs; Connenctedness; Walks, Paths and Circuits; Components and Connectednes; Walks, Walks, Paths and Circuits; Components and Connectednes algorithms; Shortest Path Algorithms, Eulerian graph, Fleury s algorithm and Chinese postman problem; Hamiltonian graph - necessary and sufficient conditions; Traveling salesman; Bipartite graph.
Tree : Properties of trees; Pedant vertices in a tree; Center of a tree; Rooted binary trees; Spanning trees - Spanning tree algorithms; Fundamental circuits; Spanning trees of a weighted graph; cut-sets and cut-vertices; Fundamental cut-sets; Connectivity and separativity; network flow; max-flow min-cut theorem.
Planner graph : Combinatorial and geometric dual; Kuratowski s graph; detection of planarity; Thickness and crossings.
Matrix representations of graph: Incidence; Adjacency; matrices and their properties.
Colourings: Chromatic number : Chromatic polynomial; The six and five colour theorems; The four colour problem.
Directed graphs: Binary relations; Directed graphs and connectedness; directed trees; Aborecence; Polish method; Tournaments.
Counting of labeled trees: Cayley s theorem; Counting methods; Polya theory.
Application of graphs in computer science.

1. Deo, N.: Graph Theory with Applications to Engineering and Computer Science.
2. Harary : Graph Theory, PHI (EEE)

CS 422 Numerical Methods 3-0-2 4
Basic Concepts: Limit, continuity, derivative, convergence, difference equations; Absolute error, relative error, round off errors, numerical stability, conditioning;

Solutions of nonlinear and linear equations- Bisection method, Newtons method, Secant method, Gaussian method, Gauss Seidel, Steepest descent, Conjugate gradient.

Matrix eigen value problem, matrix factorization and least square problem. Interpolation and extrapolation.

Numerical differentiation and integration; Numerical solutions of ordinary and partial differential equations.

1. David Kincard & Ward Chenes : Numerical Analysis : Mathematics of Scientific Computing Books/Code Publishing Co.
2. Stoer, Bullrich : Computer Oriented Numerical Methods, Springer Verlag.
3. Krishnamurthy, E.V., Sen, S.K. : Computer Based Numerical Algorithms, East West Press.
4. Rajaraman, V.: Computer Oriented Numerical Methods, Prentice Hall India.

CS 423 Graphical User Interface Programming 2-0-2 3
Windows Programming:GUI Concept-Hungerian Notation, Data types- Handles, Message Driven Architecture, Message processing and Loop, GDI- Brush, pen, Font, Cursor, Menu, Keyboard & Mouse handling, Displaying text and graphics; Dialog boxes Controls, WinMain Procedure, Files, CLipboard, Printer Handling, DDE, DLLs, OLE-COM, ODBC, Windows registry-New Executable(NE) and Portable Executable (PE) FIles.
Visual Basic:Concepts of Event Driven Programming, Visual Basic Programming; variables. arrays, constants, Numbers, Date, Numeric Functions, Program flow control, user defined functions and modules,
Single document interface, Developing simple applications using VB controls- Text Boxes, Message Boxes, Command Buttons and labels.
Custom controls - Picture Box, Rich Text Box, List Box; Slider objects in VB- Classes-Object creation and manipulation
Graphics-line, shape, boxes, circle, pie-charts, DDE properties-DDE events, DDE methods-OLE properties. ActiveX control creation and usage.
Database Access- Data control-field control- Datagrid. Recordset using SQL to manipulate data. Concepts of Active Data Objects (ADO)

Petroutses E.; Mastering Visual Basic 6; BPB publication
Deital H.M., Deital P.J., Nieto T.R.; Visual Basic 6 How to Program; Prentce Hall Petzold C.; Programing Windows 95; Microsoft Press
Cornel C.; Visual Basic 6 from Ground Up; Tata McGraw Hill

CS 424 Formal Language and Automata 3-0-0 3
Alphabets, Languages, Grammars.
Finite automata: regular expressions, regular languages.
Context free languages: pushdown automata, DCFLs, LL(k) and LALR grammars.
Context sensitive languages: linear bound automata.
Turing machines: recursively enumerable languages.
Operations on formal languages and their properties.
Decision questions on languages, Undecidable problems.

Hopcroft J E, Ullman J D, Introduction to Automata Theory, Languages and Computation, Narosa.
Martin J C, Introduction to Languages and the Theory of Computation, McGraw-Hill International Edition.
Buchi A, Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal Expressions, Springer-Verlag.
McNaughton R, Elementary Computability, Formal Languages and Automata, Prentice-Hall.

CS 501 Database Management Systems 2-1-2 4
Overview:Concept of database, data independence, redundancy Control; Database architecture - ANSI model.
Modeling of real world situation: Entity-relationship model; Data models: Network, Hierarchical, Ralational.
Relational data model: DDL, DML: relational algebra and calculus; functional dependencies, normal forms, decomposition, integrity rules; Query languages for relational systems: SQL, QBE, query optimization, embedded SQL.
Database transactions, concurrency control, recovery and security issues in databases.
Brief treatment of: Client-server models, distributed databases, object-oriented databases, deductive databases, multimedia databases, active databases.

1. Silberschatz and Korth, Database system concepts, McGraw Hill.
2. Elmasri and Navathe, Fundamentals of database systems; Narosa Publishing Co.

CS 502 System Software 2-0-2 3
Overview : Definition and classification of system software.
Assemblers : Assembly language, Assembly process, Assembler data structures, Assembler macros and macroprocessors.
Linkers and loaders : Basic concepts, Static and Dynamic linking, shared libraries, loaders, overlays. Case study of UNIX linking system, Windows DLL, OLE, ActiveX.
Debugger : Types, features, case study : sdb/dbx.
Editors : Types, Structure, case study of vi, sed and wordstar.
Unix Utilities: Make, RCS, sed, grep, awk, etc.
Compiler Principles.

Dhandhere, System programming and operating systems, Tata McGraw Hill.
Sumitabha Das, Unix System V.4 Concepts and Applications, TMH.
Linux Manuals.
Windows Manuals.

CS 503 System Analysis and Design 3-0-0 3
Overview of systems analysis and design; Information systems concepts; Systems development life-cycle; Project selection, feasibility analysis, design, implementation, testing and evaluation.
Project selection: Sources of project requests, managing project - review and selection; preliminary investigation.
Feasibility Study: Technical and economical feasibility; cost and benefit analysis.
System requirement specification and analysis: Fact finding techniques; data flow diagrams; data dictionaries; process organization and interactions; Decision analysis- decision trees and tables.
Detailed design: Modularization, module specification; file design; systems development involving databases.
System control and quality assurance: Design objectives; Reliability and maintenance; Software design and documentation tools; Top-down and bottom-up and variants; Units and integration testing; Testing practices and plans; System controls; Audit trails.
System administration and training, conversion, and operation plans.
Hardware and software selection: Hardware acquisition - memory, processors, peripherals, benchmarking, vendor selection; Software selection- Operating system, languages; Performance and acceptance criteria.

1. Senn J.A., Analysis and Design of Information Systems, McGraw Hill.
2. Awad, E.M, Systems Analysis and Design, Irwin series.
3. Lucas, H.C, The Analysis, Design and Implementation of Information Systems, McGGraw Hill.

CS 504 Operating System 2-1-2 4
Overview : Evolution, current status and future trends. Structural overview.
Process concepts : Process states, process control block, process scheduling algorithms.
Support for concurrent processes : Mutual exclusion, shared data, critical sections, busy form of waiting, lock and unlock primitives, synchronization, block and wakeup.
Interprocess communication issues, primitives.
System Deadlock : Prevention, detection and avoidance.
Memory management : Contiguous and non-contiguous allocation, virtual memory, segmentation, paging, page scheduling and replacement algorithms.
File Systems : Management, protection mechanisms.
I/O management, disk scheduling.
Design of UNIX - a case study.
An overview of network and distributed operating systems.

1. Silberschatz A, Galvin P: Operating system concepts, 4th ed. Addision - Wesley Publishing Co.
2. Milenkovic M.: Operating System - Concepts and Design, McGraw Hill.
3. Tanenbaum A.S.: Operating System - Design and Implementation, PHI (EEE).
4. Bach, M. : Design of the UNIX operating system, PHI (EEE).

CS 505 Software Engineering 3-0-2 4
Introduction to software engineering, concept of a software project, size factor, quality and productivity factor, different phase of a software development life cycle, managerial issues.
Software project planning: Problem definition, development of a solution strategy, development process planning, software development models and their comparative study; Organizational structure planning, project formats and team structures; Planning for quality assurance and configuration management; Planning for verification and validation.
Software economics: Cost estimation and evaluation techniques, cost estimation based on COCOMO model and Raleigh model.
Software requirements analysis and specifications techniques- their notations & languages .
Software design: Concept of fundamental design; Design approaches- top-down & bottom-up, structured, object-based & object oriented design; Design specification and notations.
Software implementation: Structured coding techniques, coding styles, and standards; Guidelines for coding and documentation.
Software verification and validation: Theoretical foundation, black box and white box approaches; Integration and system testing.
Software reliability: Definition and concept of reliability, software faults, errors, repair and availability, reliability and availability models.
Case studies.

1. Pressman, R.S., Software Engineering: A Practitioner
s Approach, McGraw Hill.
2. Shooman, M, Software Engineering, McGraw Hill.
3. Fairley, R.E., Software Engineering Concepts, McGraw Hill.

CS 506 Data Communication 3-0-0 3
Overview : Objectives and Applications of Computer Communication.
Computer Communication Network Architecture : ISO-OSI reference model, design philosophy, layer, protocol, interface, and service concepts. Layer-wise functionality.
Physical Layer : Concepts of data transmission, modulation and multiplexing methods, modem, encoding methods, communication media, standard protocols, RS-232C, RS-449, X.21.
Medium Assess Control in broadcast networks :ALOHA, CSMA, CSMA/CD, token ring, token bus, Standard LAN Protocols (IEEE 802.X), FDDI, satellite networks.
Data link layer: Framing, error control techniques, datalink protocols and their performance, SDLC protocol.
Network layer : Routing, Congestion and deadlock control Algorithms, Internetworking issues and devices, gateways, bridges and routers, IP & X.25 protocols.

1. Tanenbaum A.S., Computer Network, PHI (EEE)
2. Stalling, Data and Computer Communication, PHI (EEE)

CS 507 Computer Networks 3-0-2 4
Review of Computer Network Architecture and the Subnet layers.
Data Transport : Connection management, Quality of Service, TCP/IP Protocol, ATM.
Session Management: Session establishment and maintenance, Dialogue management, Recovery.
End-to-end Data: Presentation formatting issues and methods: XDR, ASN.1, NDR; Data Compression, Lossless Compression Algorithms- Run length encoding, DPCM, Dictionary-based methods, Image compression- JPEG, Video compression- MPEG; Security and authentication techniques, Encryption algorithms.
Applications: E-mail, Remote login, File transfer, Network file system, Network management.
UNIX network programming with TCP/IP; Network File System, Novell Netware, and Windows NT installation, configuration and use.

1. Tanenbaum A.S., Computer Network, 3e, PHI (EEE).
2. Stalling W, Data and Computer Communication, 5e, PHI (EEE).
3. Peterson L L, Davie B S, Computer Networks: A Systems Approach, Morgan
Kaufmann Publishers Inc.
4. Stevens, UNIX Network Programming, PHI (EEE).
5. Comer, TCP/IP Programming Vol.- I, II, III, PHI(EEE).

CS 521 Object Oriented Programming and Design 2-1-2 4
Part I : Object Oriented Programming
Structured Programming and Object Oriented Programming paradigms.
Key Concepts :
Data Abstraction : Class, object, constructors, destructors, memory allocations for objects, member functions, friend functions, templates.
Inheritance : Single & multiple inheritance, virtual base class.
Polymorphism : Compile time polymorphism : operator overloading, function overloading, static binding.
Run-time polymorphism : Virtual function, pure virtual function, abstract class, dynamic binding.
Exception handling.
Part - II Object Oriented Design
Object Oriented Design Approaches: Object Model, Dynamic Model, and Functional Model. (Objet Diagram, State Diagram, and DFD).
Phases of Object Oriented Development: Object Analysis, System Design, Object Design.

1. Herbert Schild : The Complete Reference to C++, Osborne McGrawHill.
Rambaugh et al. : Object Oriented Modeling and Design, PHI(EEE).
Grady Booch: Object Oriented Analysis and Design, Pearson Education.
Bjarne Stroustrup: The C++ Programming Language, Addison Wesley

CS 522 Computer Graphics 3-0-2 4
Display Devices : Line and point plotting systems; raster, vector, pixel and plotters, Continual refresh and storage displays, Digital frame buffer, Plasma panel displays, Very high resolution devices, High-speed drawing, Display processors, Character generators, Colour-display techniques (Shadow-mask and penetration CRT, colour look-up tables. analog false colours, hard-copy colour printers.)
Display Description : Screen co-ordinates, user co-ordinates; Graphical data structures (compressed incremental list, vector list, use of homogeneous co-ordinates); Display code generation; Graphical functions; The view algorithms, two-dimensional transformation.
Interactive Graphics : Pointing and positioning devices (cursor, light pen, digitizing tablet, the mouse, track balls). Interactive graphical techniques; Positioning, Elastic Lines, Inking, Zooming, Panning, Clipping, Windowing, Scissoring.
Graphic Languages : Primitives (constants, actions, operators, variables), plotting and geometric transformations, display subroutines.
3-D Graphics: Wire-frame perspective display, Perspective depth, Projective transformations, Hidden line and surface elimination, Transparent solids, Shading.
GKS is to be used as the standard teaching tool.

1. Hearn D., Baker P.M. : Computer Graphics, Prentice-Hall, 1986.
2. Foley, J.D., Van Dam A.: Fundamentals of Interactive Computer Graphics, Addison-Wesley, 1982.
3. Giloi, W.K. : Interactive Computer Graphics; Prentice-Hall, 1978.
4. Newman, W.,Sproule, R.F.: Principles of Interactive Computer Graphics, McGraw Hill, 1980.
5. Rogers, D.F. : Procedural Elements for Computer Graphics, Mc Graw-Hill, 1983.
6. Harrington, S. : Computer Graphics : A programming Approach, Tata Mc Graw Hill, 1983.

CS 522 Business Economics 3-0-0 3
Nature and scope of managerial economics; Objectives of the firm; Managerial and behavioural theories of the firm.
Concept of opportunity cost, incremental time perspective; Principles of discounting and equimargin; Demand analysis- purposes and concepts; Elasticity of demand; Method of demand forecasting.
Product and cost analysis; short run and long run cost curves.
Law of supply; Economies and diseconomies of scale; Law of variable proportions.
Production function- single output isoquants.
Pricing: Prescriptive approach; Price determination under perfect competition; Monopoly, oligopoly and monopolistic competition; Full cost pricing; Pricing strategies. Profits: Nature and measurement policy; Break-even analysis; Case study.

1. Dean J: Managerial Economics, PHI.
2. Mote V.L. et al.: Managerial Economics: Concepts and cases, TMH.

CS 523 Enterprise Resource Planning 3-0-0 3
ERP Concepts Integrated Software Different models of industry Single data to various department customers satisfaction quality and delivery schedule, Data processing concepts to various industrial departments methods of data processing comparison of data processing methods data preparation data processing modes steps in computerization of data processing data collection methods data processing applications.
Financial accounting: Asset accounting Accounts payable Accounts receivable General ledger accounting Consolidation Special purpose ledger. Controlling Activity based controlling Overhead cost control sales and profitability analysis Product cost controlling. Enterprise controlling: Executive information system Management consolidation Profit center accounting. Capital investment management: Capital investment management programs Tangible fixed assets measure. Treasury: Cash management funds management treasury management.
Personnel administration: Application management benefits personnel administration incentive wages payroll time management travel expenses. Personnel development: Organizational management Personnel development Room reservation planning Seminar and Convention management Workforce planning. Logistic applications: General logistics: Engineering change management Environment, health and safety logistics information system logistics master data forecast variant configuration. Material management: Consumption based planning electronic data interchanges inventory management information system Invoice verification Purchasing Warehouse management. Plant maintenance: Equipment and technical objects Plant maintenance Maintenance projects Service management Maintenance order management.
Logistics application (contd ): Production planning: Assembly orders basic data capacity requirement planning- information system Kanban/just-in-time master planning material requirement planning plant data collection production planning for process industries. Project System: Project budgeting basic data Project execution/integration information system operative structures project planning- quality management quality certificates inspection processing planning tools quality control quality notifications. Sales and distribution: Basic function Billing Sales support Electronic data interchange Foreign trade Information system Master data Shipping - Sales Transportation.
Case Studies: SAP R/3, People Soft, Oracle Financials Architecture data dictionary development tools administration tools reporting and analysis tools integration tools.

Michael Hsmmer, Enterprise Resource Planning , 1998. K.Nagappan, Digital Computers and Data Processing , 1996. J.A.Hernandez, The SAP R/3 Handbook , 1998.

CS 525 Artificial Intelligence 3-0-0 3
Introduction: AI problem; AI techniques, problem as a state space search, Production Systems, Issues in design of search programs.
Heuristic Search Techniques : Generate and test, Hill Climbing, Best-First Search, Problem reduction, Means- Ends analysis.
Knowledge representation & Reasoning: Knowledge representation issues, Ontological commitments. Predicate logic, knowledge representation using rules, weak slot-and-Filler structure.
Natural Language Processing : Syntactic processing, semantic analysis, Discourse and pragmatic processing.
Expert Systems : Representation using domain knowledge, Expert System shell, knowledge acquisition.

1. Artificial Intelligence : E. Rich & K. Knight : Tata McGraw Hill.
2. Principles of Artificial Intelligence : N.J. Nilson; Narosa Pub. House.

CS 526 Management Information System 3-0-0 3
An overview of MIS Structure of a MIS Hardware, Software and Communication technology for information systems concepts of information

Storage and retrieval of data transaction processing office automation and information processing - control functions Decision making process phases in the decision making process Intelligence and design phases concepts of decision making Behavioral models of the decision maker/decision making.

System concepts system concepts applied to management information systems concepts of planning and control Organizational structure and management concepts

Decision support systems support systems for planning, control and decision making support systems for management of knowledge work Information systems requirements strategies for the determination of Information requirements.

Data base requirements user interface requirements developing and implementing application systems Quality assurance and evaluation of Information systems future developments and their organizational and social implications.

Gordon B. Davis, Margrethe H. Olson , Management Information Systems Conceptual foundations, Structure and Development , 2nd edition Mc-Graw Hill
James A. Senn , Analysis & Design of Information System , Second edition, McGraw Hill.

CS 527 Compiler Design 2-0-2 3
Overview of phases of a compiler, Languages and grammar.
Lexical analysis : Finite automata, Lexical analyzer, Lexical analyzer generator.
Parsing : Top-down and Bottom-up parsers, shift-reduce parser, recursive descent
(operator precedence) parser, LL(1); LR(0), SLR, LALR parsers, Syntax-directed translation, Parser generator.
Semantic Analysis : Declaration processing, Type checking. Symbol tables.
Intermediate Code Generation : Run-time environments, translation of language constructs.
Code Generation: Flow-graphs; Register allocation, Code-generation algorithms.
Error handling and recovery.
Code optimization: An introduction to the techniques.

1. Aho, A.V., Sethi, and Ullman J.D: compiler design.
2. Dhandhere, System programming and operating systems, Tata McGraw Hill.

CS 528 Digital Signal Processing 3-0-2 4
Discrete-time signals and systems.
Difference equations, z-transform.
Discrete-time processing of continuous-time signals, sampling, A/D and D/A, decimation and interpolation.
Transform analysis of linear time-invariant systems.
Structures of discrete time systems.
Filter design techniques.
Discrete Fourier series, DTFT, DFT, DFT properties, efficient computation of DFT, FFT, Goertzal algorithm, Chirp transform, decimation in time and decimation in frequency, DCT.
Short-time Fourier analysis and filter banks.
Hilbert transform, Cepstral analysis, Linear prediction.

Discrete-time Signal Processing, Oppenheim, Schafer, Buck, PH, 1999.
Digital Signal Processing: Principles, Algorithms, and Applications, Proakis, Manolakis, PH, 1999.
Digital Signal Processing : A Computer Based Approach, TMH, 1998.
Computer-Based Exercises for Signal Processing using MATLAB 5, PH, 1998.

CS 601 Design and Analysis of Algorithms 3-0-0 3
Review of basic data structures such as stack, queue, linked list, trees and graphs.
Concepts in algorithm analysis, Asymptotic complexity.
Domain independent algorithm design techniques such as divide and conquer, greedy method, dynamic programming, back tracking, branch and bound. Basic ideas about neural network, genetic algorithms and simulated annealing.
Example algorithms for sets, graphs, text processing, internal and external sorting, height balanced trees, B-trees, hashing, dynamic storage allocation, garbage collection.
Lower bound theory and NP-hard problems.

1. Corman et al., Introduction to Algorithms, McGrawHill.
2. Aho A, Hopcroft J., Ullman J., The Design and Analysis of Algorithms, Addison- Wesley.

CS 602 Image Processing 3-0-0 3
Introduction : Digital Image representation; Fundamental steps in Image processing, Elements of digital Image processing systems.
Digital Image Fundamentals: Sampling and quantization, Imaging geometry.
Image Transforms: Fourier, Walsh, Hademord, discrete cosine and Hotelling transforms and their properties.
Image Enhancement: Enhancement by point processing, spatial filtering, Frequency domain enhancement, Color image processing.
Image Restoration: Unconstrained and constraint restoring, inverse filtering, Wiener Filter, Geometric transforms.
Image Compression: Image Compression models, Error-free compression, Lossy compression, Image compression standards.
Image Segmentation: Detection of discontinuities, edge linking, Thresholding.
Representations and Descriptions: Chain codes, shape numbers, moments and Fourier and other descriptors.
Recognition & Interpretations;

1. Digital Image Processing : R.C. Gonzalez & R./E. Woods : Addison - Wesley Pub. comp.
2. Fundamentals of Digital Image Processing : A.K. Jain : PHI.

CS 603 Web Technology 2-0-2 3
Basics Of Internet
Client/Server Computing: What is C/S Computing, Middleware, Fat client VS Fat Servers, N-tiered Software Architecture.
Markup Languages And Their Grammers: SGML, DTD Resouce ; HTML, CSS; XML, XSL, Query Languages for XML W3schools xml validator script
Web Browser: Browser Architecture, Configuration of Netscape and IE
Web Server Apache Architecture : Web Server Architecture, Server Features, Configuration of Apache and IIS .
Overview of Java, JAVA Applet, JAVA Servlet;
ASP & JSP Search Engines; Web Database Connectivity;
CGI interface to Datatabase, JDBC interface to Database .
Web Security: S-HTTP, Fire Walls, Proxy Servers.
Distributed Object Models: CORBA, DCOM, EJB.

1. Shelly Powers et al., Dynamic Web Publishing , Techmedia, 1998.
2. Jamie Jaworski, Java 1.2 Unleashed , Techmedia, 1998.
3. Robert Niles, CGI by Examples , Que, 1996.
4. Scot Johnson, Using Active Server Pages , Que,, Information Technology.

CS 604 Optimization 3-0-0 3
Linear Programming : Mathematical model, assumptions of linear programming, convex set, polytope, Basis, Basic feasible solutions, Simplex method, Revised simplex method, Applications, Duality, Dual simplex method, Primal Dual Algorithms, Ellipsoid Method, Karmakar s algorithm.
Special type of linear programming problems: Transportation and assignment problems, Max-flow and shortest path problems, Foprd and Fulkerson algorithm, Djikstra s algorithem, The Min-Cost Flow problem.
Integer programming : Introduction, Branch and bound techniques, Binary linear programming, Travelling salesman problems.
Dynamic programming: Deterministic and probabilistic dynamic programming.
Game Theory

1. Gillette, B.G. : Introduction to operations research - A Computer oriented algorithmic approach, McGraw Hill.
2. G. Hadley : Linear Programming, Narosa Publications
3. M.S. Bazaraa, John J. Jarvis and H. D. Shirali, John Wiley, Linear Programming and Network Flows
4. K. V. Mital, Optimisation Methods, Wiley Eastern
5. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization - Algorithms and Complexity, Prentice Hall

CS 605 Simulation and Modeling 3-1-0 4
Definition of System: Types of systems- continuous and discrete; Modelling process and definition of a model; Verification and validation of a modeling procedure; Comparing model data with real system data; Differential and partial differential equation models; Combining discrete event and continuous models.
Simulation process; Discrete and continuous simulation methods.
Use of database and AI techniques in the area of modeling and simulation.

1. Gordon, G: System Simulation, Prentice Hall.
2. Payer, T.A: Introduction to Simulation, McGraw Hill.
3. Reitman, J: Computer Simulation Application, Wiley.
4. Spriet, W.A.: Computer Aided Modelling and Simulation , Academic Press.

CS 606 Computer Architecture and Parallel Processing 3-0-0 3
Definitions of Computer Architecture - Abstract Architecture & Concrete Architecture.
Concepts in Parallel Processing - Available Parallelism and Utilized Parallelism. Parallel Programming Models
PRAM, Shared Variable, Message Passing, Data Parallel.
Classification of Computer Architectures
Flynn s Classification
Classification of Parallel Architectures.
Instruction Level Parallel (ILP) Processors Pipelined, VLIW, Super Scalar Processors Instruction Dependencies, their Effect on Performance and Techniques to overcome them. Basic Concepts and Techniques in Vector, Systolic and Dataflow architectures. Multiprocessor Architectures Synchronization and Cache Coherence Issues. Multicomputer Architectures Interconnection Networks, Routing and Data Communication Algorithms.

D. Sima, T. Fountain, P. Kacsuk, Advanced Computer Architectures A Design Space Approach, Addision-Wesley.
K. Huang, F. A. Briggs, Computer Architecture and Parallel Processing, McGraw Hill.
V. Kumar et el. Parallel Computing, Klewer Publishers.

CS 609 Geographical Information System 3-0-0 3
Maps cartography, Automated Cartography of GIS.
GIS (or Spatial Database) as an extension of database techonol;ogy.
Characteristics of spatial database Coordinate systems, Digitization, Primitives of spatial data types.
Spatial data representation and operations vector, raster, chain code, quad tree, KD tree, R-tree etc.(comparative study), Computing Area, perimeter etc using above structure.
Surface representation - DEM, DTM, Wire frame model, TIN, Advanced techniques of DEM such as Fractals, Stereo.
Spatial Query, Extension of SQL for spatial query, Extension of OODBMS for spatial query, Spatial Join, Query processing in spatial database.
Hardware & Software support digitizer, Scanner, plotter, Data Output, Display, Map Generalization, Name Placement etc.
Applications : Spatial DSS & web enabled GIS
Acquaintance with commercial GIS S/W, GRASS, Auto Cod, Mapinfo, IDRISI, Arc Info, Atlas etc.

1. Burrough, P. A., Principles of GIS for land Resource Assesment, Oxford publications
2. Jeffery Star and John Estates, Geographic Information Systems, An Introductory, Prentice Hall Inc.
3. Marble D F and Calcins, H. W. , Basic Readings in Geographic Information System. Spad Systems Ltd.
4. R Ramakrisnan, Database System, McGraw Hill.

CS 610 Bioinformatics 3-0-0 3
Evolution and inheritance.
Concept of gene, genetic material and genome.
Chemistry of nucleic acids - structure and chemical composition of DNA and RNA.
Concept of cell-cycle and its regulation.
Replication of genome, molecular basis of genome evolution.
Molecular biology of gene functions (transciption and translation.
Concepts of transciptome, proteome and metabolome.
Genomics (genome projects, concepts of structural and functional genomics).
Databases, DNA sequence analysis, protein sequence analysis.
Introduction to Neurobiology, Signal Transduction.
Computational tools and techniques for Bioinformatics.

1. Genes VII by Bonjamin Lewin.
2. Proteins, Structure and Molecular Properties by Thomas E. Creighton.
3. Bio-thysical Chemistry Part I: The Conformation of Biological Moleculer by Canntor and Schimmel.
4. Principles of Bio-Chemistry by Albert L. Lehninger, David L. Nelson and Michaal M. Cok. 5. Genetics by T. A. Brown.
6. Molecular Cell Biology by Daid Baltimar.
7. Introduction to Bioinformatics Aurther M. Lesk, Oxford University Press
8. Fundamental Concepts of Bioinformatics Krane and Raymer, Pearson Education
9. Bioinformatics (Sequence and Genome Analysis) David W. Mount, Gold Spring Harbour Laboratory Press;

CS 621 Mobile Computing 4-0-0 4
Introduction: Cellular networks, wireless LANs, application adaptation.
Cellular Overview : Cellular concepts, location management, handoffs.
Wireless LAN overview : MAC issues, mobile IP, ad hoc networks, TCP issues.
Applications overview : wireless applications, disconnected operations, data broadcasting, mobile agents.
GSM : Air-interface, channel structure, timing, architecture.
WAP: Architecture, protocol stack, application environment.
TCP: Asymmetric links, wireless errors, handoffs; i-tcp, snoop, link rxmit, m-tcp.
Ad hoc networks: MAC, routing, transport.
Routing: Virtual backbone, Kelpi, mobile-IP.
Data broadcasting : Push-pull, consistency.
Location management : HLR-VLR, hierarchical.
Access Technologies: Blue Tooth, GPRS, IEEE 802.11, CDMA.
QoS in Wireless

1. Schiller, Mobile Communications, Addison Wesley, 2003
2. Mehrotra, GSM System Engineering.
3. M V D Heijden, Understanding WAP, Artech House, 2000.
4. Charles Perkins, Mobile IP, Addison Wesley, 1999.
5. Charles Perkins, Ad hoc Networks, Addison Wesley, 2000

CS 627 Natural Language Processing 3-0-0 3
NLP - Introduction and Overview, history and trends.
Formal specification, Grammars.
Mathematical foundations - probability, information theory.
Corpora and Corpus tools, techniques and algorithms.
Lexicography - lexicons, dictionaries, MRDs; the t-score, the Chi-square test, word classes, ambiguity, Word Sense, Disambiguation, relations.
Part-of-speech - POS tagging, tools.
Language modelling, the Noisy Channel Model, Paradigms - symbolic, rule-based, connectionism; n-gram models, Hidden Markov Models, the Trellis & the Veterbi algorithms, HMM tagging; Maximum Entropy model.
Phonology - modelling, constraints; tools, methods.
Lexical syntax / semantics.
Morphology - (de)affixation, compounding, tools; finite state methods, 2-level model.
Syntax - linguistic phrase structure, parsing methods, data structures, chart parsing, unification, complexity, theoretical approaches, tools, grammar engineering, Probabilistic parsing and PCFG.
Semantics - scope, valency, features, ontologies; montague semantics, lambda calculus; lexsem, anaphora, coreference. The syntax / semantics interface.
Pragmatics - inferences, conversation, speech act theory, DRT; text planning and generation.
Psycholing - comprehension, generation, mapping, experimentation, modelling, Agents.
Text categorization, Naive Bayes methods.
Information Retrieval - indexing, approaches, query, crosslinguistic IR
Translation / Machine Translation - bitext, alignment, term extraction; sublanguage design, tools; interlinguas, knowledge sources.
Speech - synthesis, recognition, speech translation.

1. Allen J. - "Natural Language Understanding", The Benjamin/Cummins Publishing Company Inc. 1994.
2. Jurafsky, D. and J.H.Martin "Speech and Language Processing", Prentice Hall, 2000.
3. Cover, T.M. and J.A.Thomas "Elements of Information Theory", W.iley, 1991
4. Charniak, E. "Statistical Language Learning", The MIT Press, 1998.
5. Proceedings of major conferences, such as those of ACL, COLING, ANLP, DARPA HLT, etc.
BM 421 Accounting And Financial Management 2-1-0 3
Accounting : Principles, Concepts and conventions, Double entry system of Accounting, Introduction of basis books of accounts of sole proprietry concern, Control accounts for debtors l and creditors, closing of books of accounts and preparation of Trail Balance.
Final Accounts : Trading, Profit and Loss Accounts and Balances Sheet of Sole Proprietary concern with normal closing entries, Introduction to Manufacturing accounts of partnership firms, Limited Company.
Financial Management : Meaning and role.
Ratio Analysis : Meaning advantage, limitations, types of ratios and their usefulness.
Fund Flow statements : Meaning of the terms- fund, flow and fund, working capital cycle, preparation and interpretation of the fund flow statement.
Costing : Nature, Importance and basic principles.
Budget and Budgetary Control : Nature and scope, Importance, Method of finalization of master budgets and functional budgets.
Marginal Costing :Nature scope and importance, Break Even Analysis, Its uses and limitations, construction of Break Even Chart, Practical application of marginal costing.
Introdunction to Computerised Accounting Systems : Master files, Transaction files, Intriduction to doucuments used for data collection, processing of different file and output obtained.

Maheswari S. K.: Financial Accounting Khan M. Y. and Jain, P K: Financial Management, TMH
Syllabus in Word Format