NIT Surathkal Syllabus Department of Computer Engineering
CO400 NUMBER THEORY & CRYPTOGRAPHY (3-0-0) 3
Elementary number theory, Finite fields, Arithmetic and algebraic algorithms, Secret key and public key
cryptography, Pseudo random bit generators, Block and stream ciphers,Hash functions and message
digests, Public key encryption, Probabilistic encryption, Authentication, Digital signatures, Zero
knowledge interactive protocols, Elliptic curve cryptosystems, Formal verification, Hard problems,
Randomness and Pseudo randomness and Testing.
Koblitz, N. Course on Number Theory and Cryptography, Springer Verlag, 1986
Menezes, A, et.al. Handbook of Applied Cryptography, CRC Press, 1996
Ivan Niven, Herbert S. Zukerman, Hugh L.Montgomery, An Introduction to the Theory of Numbers.
Thomas Koshy, Elementary Number Theory with applications, Elsevier India, 2005
CO401 REAL TIME SYSTEMS (3-0-0) 3 PREREQ: CO300
Introduction to real time systems and characterization and task performance measures assignment and
scheduling. Design of real time systems and development strategies, design analysis, fault tolerance,
C.M.Krishna and Kang G. Shin. Real time systems.2000
Stu anad Bennett, Real time Computer control.
CO402 FAULT TOLERANT COMPUTING (3-0-0) 3 PREREQ: CO250/CO251
Introduction, fault Simulation, Error Detection, Fault Tolerance, System Diagnosis.
Anderson and Lee, Fault Tolerant Principles and Practice, Prentice Hall, 1998
CO403 ADVANCED MICROPROCESSORS (3-0-0) 3 PREREQ: CO250
General Features of 32 bit and 64 bit microprocessors, Advanced Intel processors – Architecture and
programming including xeon and others, dual processors, DSP processors, Various peripherals and
interfacing including memory and I/O
Babby B.Brey, The Intel Microprocessors – Architecture, Programming & Interfacing, Pearson
Babby B.Brey, The Intel Microprocessors 8086/8088, 80186, 80286, 80386 & 80486, Architecture
Programming & Interfacing, PHI.
CO404 PARALLEL ALGORITHMS (3-0-0) 3 PREREQ: CO353
Parallel processing, Parallel models, Performance of parallel algorithms, Techniques for designing
parallel algorithms, Pointer jumping technique, Divide and conquer, partitioning strategy, Pipe lining,
Accelerated cascading, Symmetry breaking, Lists and trees, List ranking, Euler-tour technique, Tree
contraction, Computation of tree functions, Searching, Merging, Sorting, Parallel graph algorithms, Ear
decomposition, Polynomial and matrix computations, General dense matrices.
Jaja,J.An Introduction to Parallel Algorithms, Addison- Wesley, Reading, MA, 1992.
Gibbons A. and W.Rytter, Efficient Parallel algorithms, Cambridge university Press; Cambridge, 1988.
CO405 DISTRIBUTED OBJECT COMPUTING (3-0-0) 3 PREREQ:O352/ CO302
Distributed object computing-an introduction, need of distributed objects, Distributed object technologies,
Distributed architectures, Design patterns, COM, DCOM, COM+ – Microsoft’s vision for distributed
objects, & architecture and programming C#, OMG’s CORBA & distributed computing, RT CORBA,
Application development in CORBA using C++/Java, Java RMI, EJB – Java in Distributed computing,
Document Objects in computing, DTDs and XML
Don Box, Essential COM, Addison- Wesley, 1998
COM & DCOM, Microsoft’s vision for Distributed objects,Roger sessions,John Wiley & Sons Inc., 1998.
Dale Rogerson, Inside COM Microsoft’s Component Object Model, Microsoft, WP Publishers.
CO406 MODEL DRIVEN COMPUTING (3-0-0) 3 PREREQ: CO351
Model based computing – the need & introduction, model driven software development, model driven
meta model systems, modeling and designing applications & web services using model driven approach.
Model Driven Architecture: Applying MDA to Enterprise Computing, OMG Press, 2003.
MDA Web site: www.omg.org.
CO409 MOBILE COMPUTING (3-0-0) 3 PREREQ: CO303
Introduction to Medium access control – Telecommunication Systems, Standards Wireless Lan – IEEE
802.11 HIPERLAN – Bluetooth, Adhoc Networks, Characteristics-Performance issues-Routing in mobile
hosts, Network Issues Mobile IP – DHCP, Mobile transport layer, Indirect TCP, Wireless application
protocol, Dynamic DNS – File systems – Synchronization protocol-Context-aware applications-Securityanalysis
of existing wireless network.
J. Schiller, Mobile Communications, Addison Wesley, 2000.
William C.Y.Lee, Mobile Communication Design Fundamentals, John Wiley, 1993.
Theodore S. Rappaport, Wireless Communications, Principles & Practice, 2nd edition, Pearson.
CO410 PROTOCOL ENGINEERING (3-0-0) 3 PREREQ: CO303
Communication protocols, Protocol Design and Implementation, Protocol Verification and Validation,
Protocol Testing, Formal Methods(FDTs).
Web sites, IEEE, ISO and ITU-T sites
P. Venkatram & S. S. Manavi, Protocol Engineering, PHI, 2004.
CO411 NETWORK PROCESSORS AND NETWORK DESIGN (3-0-0) 3 PREREQ: CO303
Protocol processing systems, hardware and software aspects of a conventional processor and network
processor, network processor architecture and network design issues, example case study of Intel network
Douglas E Comer, Network Systems Design using Network Processors, Pearson Education, 2003.
CO412 ADVANCED TOPICS IN NETWORKS AND DISTRIBUTED
COMPUTING (3-0-0) 3 PREREQ: CO303/352
Technology of IP Telephony, Storage Area Networks, Ad-hoc & Mobile Networks, High Speed
Networking, Multimedia Networking, Enterprise Networking, Group Communication, Distributed
Document based Systems, Distributed Co-ordinated Systems, TMN & Network Management, Web
services, Semantic Web services.
Tenenbaum & Martean, Distributed Systems, Pearson Education, 2003.
John R.V & Michael E, The Essential guide to SAN, PH, 2001.
Schott Shunt,Building XML Web services, Microsoft / WP Press, 2004.
CO413 NETWORK MANAGEMENT (3-0-0) 3 PREREQ: CO303/CO351
Network management Overview, Network Management, SNMP and Network Management, TMN,
Network Management Applications, Management of Heterogeneous Network with Intelligent Agents,
Network Security Management, Internet Management (IEEE Communication May, Oct. 03), QoS in IP
Network, Basic Methods & theory for Survivable Network Design & Operation, Network Planning,
Network Management Standards.
M. Subramanian, Network Management: Principles and Practice, Addson- Wesley, 2000
James F. Kurose and Keith W. Rose, Computer Networking, Pearson Education, LPE, 2003
J. Burke, Network Management Concepts and Practice, A Hands-On Approach, Pearson Education,
Larry L. Peterson and Bruce S. Davie, Computer Networks, A System Approach, Elsevier, 3rd edition.
CO414 GRID COMPUTING (3-0-0) 3 PREREQ: CO352
Introduction to Grid Computing & its value in business computing, Grid technologies, issues and
solutions, Grid types – Desktop, Cluster, HPC and Data, Open Grid Services Architecture, Desktop Super
computing using Grid Computing, Grid enabled Applications, Managing Grid environments.
Ahmar Abbas, Grid Computing – A practical Guide to Technology and Applications, Frirewall Media,
CO415 REQUIREMENTS ENGINEERING (3-0-0) 3 PREREQ: CO351
Introduction to Requirements Engineering; Project Management – Software Development project Plan
(SDMP); Requirements Management Plan; Requirements Deliverables; RE Process Modeling; Vision
Documents; Requirements Elicitations; Requirements Analysis From wants and Needs to Software
Requirements; Project Formal report – Requirements Elicitation; Writing software requirement review.
The Software Requirement Specifications, Scenario Analysis Project Team Work;
Verification/Validation; Change Management
Dean Leffingwell, Don Widrig, Managing Software Requirements: A Use Case Approach,2nd
Tan Bray, An Introduction to Requirements Engineering, Pearson Education, 2003.
CO417 APPLIED ALGORITHMS (3-0-0) 3 PREREQ: CO353
Sequential Algorithms: Algorithm Design Techniques; Parallel Algorithms: Designing parallel
algorithms; Distributed Algorithms; External Memory Algorithms, Online Algorithms, Internet
Algorithms and Security- Cryptography Algorithms.
Alfred V Aho, John E Hopcroft, Jeffery D Ullman- Data Structure and Algorithms, Addison Wesley
Michael Jay Quinn- Designing Efficient Algorithms for Parallel Computers, McGraw Hill 1997.
CO418 ADVANCED DATA STRUCTURES AND ALGORITHMS (3-0-0) 3 PREREQ: CO204
Data structures and its operations, trees, Heaps, Advanced Graph Algorithms and application, Internet
Algorithms, Compression algorithms, search engine algorithms, spiders and crawlers, Integer and
polynomial Arithmetic, modular Arithmetic, NP-Completeness and approximation algorithms.
Thomas Cormen, Charles E Leiserson and Ronald D River, Introduction to Algorithms, PHI, 2001.
Mark Allen Weiss, Algorithms, Data Structures and Problem Solving with C++, Addison Wesley, 2002.
CO419 DISTRIBUTED ALGORITHMS (3-0-0) 3 PREREQ: CO352
Role of Distributed Algorithms in designing applications, Synchronous algorithms, asynchronous
network algorithms, distributed algorithms for memory management and web computing
Nancy & Lynch, Distributed Algorithms, Harcour Asia, 2001.
CO420 INTERNET TECHNOLOGIES AND APPLICATIONS (3-0-0)3 PREREQ: CO303
Internet & Web Technology, Infrastructure and tools for Internet Commerce /E-Commerce Current
Trends in E-Commerce applications development, Enterprise level E-Commerce: SCM, CRM, EDI,
Henury Chan et al. E-commerce-Fundamental and applications, John Wiley & Sons, 2002
G. Winfield Treese and Lawrence C.S. Designing Systems for Internet Commerce, Pearson Edison, LPE,
CO421 ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS (3-0-0) 3 PREREQ: CO204
Architecture of AI & KBCS Systems, Design Issues and AI techniques, Introduction & Design of Expert
Systems various applications, Introduction to fuzzy logic systems, Natural Language processing,
Heuristic Search techniques, knowledge based systems.
Nilson, Artificial Intelligence : A new synthesis, 2001.
Edwin wise, Hands on AI with Java, McGraw Hill, 2004.
CO422 MULTIMEDIA AND VIRTUAL REALITY (3-0-0) 3 PREREQ: CO253
Introduction to Multimedia Technology and its applications; concepts of Virtual Reality and its
effectiveness in Real Time Applications, Introduction to Scientific Visualization and Virtual Reality,
Hardware requirements, Sound, Animation techniques, Compression and decompression techniques,
CASE study of multimedia workstations.
The Winn L. Rosch Multimedia Bibble, Winn L. Rosch, SAMS Publishing
Hypermedia: From Multimedia to V. R., D. P. Kothari & Anshu, PHI, 2004.
CO423 ERP AND SUPPLY CHAIN MANAGEMENT (3-0-0) 3 PREREQ: CO420
ERP: Needs, Models, Commercial ERP Packages, Client Server and Open Technology Solutions, Supply
Chain Management – Issues, Drivers and Obstacles, Coordinating SCM and ERP in E-Business.
Vinod Kumar G & N.K. Venkitakrishna , ERP – Concepts and Practice , PHI, 1998
Sunil C & Peter- SCM – Strategy and Planning and Operation, Pearson Education, LPE, 2002
Pete Loshin, Paul A. Murphy, Electronic Commerce, A Jaico Book.
CO440 PRACTICAL TRAINING/EDUCATION TOUR 1
The Student has to under go a training programme or any equivalent programme fixed by the institution
/department. This will be done during the third or fourth year. A report will be submitted by the student.
Evaluation is based on the seminar and report.
CO449 MAJOR PROJECT- I (0-0-6) 4
The Student has to select a project work based on a topic of interest. Periodically the implementation will
be evaluated by the guide. This work, started in VII semester continues through eighth semester, at the
end of which, the student will be evaluated internally and externally.
CO450 INFORMATION SECURITY (3-0-0) 3 PREREQ: MA207
Basic concepts, access control, Protection, Secure coding, Cryptography, Network security, Firewalls,
Confining untrusted code, Security on the Internet and the World Wide Web, Attack Techniques, Case
studies, extra topics
Matt Bishop, Computer Security, Arts & Science, Pearson Education, 2003.
Pceprzyk et.al., Fundamentals of Computer Security, Allied Publishers, 2004.
Derek Atkins and 9 others, Internet Security, Techmedia 2nd edition, 1997.
Michael Howard and David LeBlane, Writing Secure Code, Microsoft, WP Publishers.
CO451 ADVANCED CONCEPTS IN THEORETICAL COMPUTER
SCIENCE (3-0-0) 3 PREREQ: CO254
Finite automata and regular expressions – Finite state automata, push down automata, Turing machines,
grammars, graph theory and application, analysis and design of sequential and parallel algorithms,
Papadimitirou C H, computational complexity, Addison Wesley, 2002.
CO452 FORMAL METHOD IN COMPUTING (3-0-0) 3 PREREQ: MA255
Formal Methods in Computing Specification; Formal Description Techniques in Communication
Software Systems; Formal Methods in Object Orientation and Software Engineering, Proof Methods and
Techniques, Temporal and Model Logic
Jan Ven Lecuwen—Formal Model and Semantics, Elsevier-MIT Press, 1992
Arindama Singh—Logic for Computer Science, PHI, IEEE, 2003
CO453 COMBINATORICS (3-0-0) 3 PREREQ: CO353
Introduction to combinatorial optimization, Mathematical preliminaries, Shortest paths, network flows,
Bipartite matching, nonbipartite matching, matroids & greedy algorithms matroid intersection & matroid
Eugene Lawler, Combinational optimization – Networks & matroids, Dover Publication 2002.
CO454 PERFORMANCE MODELING AND ANALYSIS (3-0-0) 3 PREREQ: MA255
Performance evaluation methods. Analytical versus simulation modeling. Performance measurement and
benchmarking. Workload modeling. Random variables. Commonly used distributions. Stochastic
processes. Markov chain models of computer systems. Queuing models. Discrete even simulation.
Simulation Languages. Confidence intervals. Variance reduction techniques. Case studies of analytical
and simulation studies of computer systems.
Raj Jain, The Art of Computer Systems Performance Analysis, John Wiley and Sons, New York, USA,
KS Trivedi, Probability and Statistics with Reliability, Queuing and computer Science, PHI, 1982.
Paul & Howard, Computer System Performance Evaluation & Prediction, Elsevier 2005.
CO455 OPTIMIZATION TECHNIQUES IN COMPUTING (3-0-0) 3 PREREQ: MA305
Basic OR techniques, requirements, networks, design, role and methods, databases, compilers,
optimization and performance in web computing, internet application, performance measurement tools,
K Kanth, Introduction to computer system performance evaluation, McGraw Hill, 1992
David K Smith, Network Optimization in Practice, ellise, Horrwood publications, 1982
CO456 MODERN COMPUTER ALGEBRA (3-0-0) 3 PREREQ: MA204
Mathematical preliminaries, Complexity theory, Cyclohexane confirmations, Representation of numbers
and Polynomials, Fast Euclidain algorithm, Fast Modular algorithms and interpolation CRT, Modular
determinant computation, Humite interpolation, The resultant and gcd computation, implementations,
Decoding BCH codes, Factoring polynomials over finite fields, Primality and Factorization of large
integers, Application to public key cryptography.
J. Vonzur Gathen and F. Gerhard, Modern Computer Algebra, Cambridge University Press, 1999.
E. Bach and J. Shallit, Algorithmic Number Theory, Springer- Verlaga 1994.
CO457 BIOINFORMATICS (3-0-0) 3 PREREQ: CO423/CO420
Introduction to Bioinformatics, Biological Databanks, Sequence Analysis, Structure Prediction, Protein
Folding, Proteomics, Emerging Areas in Bioinformatics.
KraneD.E.&Raymer M.L, Fundamental Concepts of Bioinformatics,Pearson,2003
Attwood & Parrysmith: Introduction to Bioinformatics, Pearson Ed, 2003
Gibas & Jambeck: Developing Bioinformatics Computer Skills, O’Rielly,2003
CO458 ADVANCED DATABASE SYSTEMS (3-0-0) 3 PREREQ: CO301
Distributed Databases: principles, Architecture, Design, Query, Optimization, Transaction, Concurrency,
Client/server, Parallel, and Object Oriented Databases: XML and Internet DB.
Raghu Ramakrishnan, Database Management Systems, McGraw-Hill, 2000
Ceri S and Pelagatti G, Distributed Databases Principles and Systems, 2nd Edition, Mc-Graw Hill, 1999.
CO459 DATA WAREHOUSING AND DATA MINING (3-0-0) 3 PREREQ: CO301
Data Warehousing: Data Warehousing components and building data warehouse. Data Mining –
Objectives, examples, data mining process, Data mining techniques, Generalization, Data mining
Raph Kimball, Data Warehouse Toolkit, John Wiley & Sons Publications
Michael. J. Berry, Gordon Linoff, :Data Mining Techniques: Marketing, Sales, Customer support. John
Wiley & Sons.
CO462 COMPUTER VISION (3-0-0) 3 PREREQ: CO253
Concept of application of computer vision, functional architecture of a vision system visual sensory
model and camera calibration, processing tools, 3D vision, 3D representative schemes, High level vision
Sonka M., Hlavac V., Boyle R., Image Processing Analysis and Machine Design. PWS Publishers
Ballard D., Brown C., Computer Vision, Prentice Hall
Bratt W., Digital Image Processing, John Wiley & sons
CO463 MACHINE INTELLIGENCE (3-0-0) 3 PREREQ: CO420
Knowledge Representation, Predicate Logic Reasoning Under Uncertainty, Statistical Reasoning, Game
Playing, Planning, Learning; Propositional logic – propositions and connections, deduction with
propositional logic, Fuzzy propositional logic, Case based Reasoning; Expert System Design, Expert
System Shell, Case Studies of Typical Expert Systems, PROLOG.
StuartRussel & Peter N., Artificial Intelligence, A Modern Approach. 2/e Pearson 2004.
Michael Negnevitsky A. I., A Guide to Intelligent System, Pearson Education, 2002
CO464 ALGORITHMIC GRAPH THEORY (3-0-0) 3 PREREQ: MA203
Basic definitions and terminology of graphs and digraphs, and introduction to simple complexity theory,
How choice of graph traversals (e.g., depth-first and breadth-first searches) affect algorithmic efficiency,
Spanning Trees, connectivity. Circuit space, Planarity testing, genus of a graph, Networks and flows:
max-flow/min-cut theorem and max-flow algorithms, Matchings in weighted and unweighted graphs,
Eulerian and Hamiltonian tours, Chinese postman and travelling salesman problems, Dominating sets,
independence and cliques, Colouring graphs (including the famous 4-colour problem of planar graphs)
NP-completeness and its importance in graph algorithms.
Alan Gibbons, Algorithmic Graph Theory, Cambridge University Press, 1985.
Cormen, Leiserson and Rivest, Introduction to Algorithms, McGraw-Hill, 1986.
James McHugh, Algorithmic Graph Theory, Prentice-Hall, 1989.
CO465 COMPUTATIONAL COMPLEXITY (3-0-0) 3 PREREQ: CO353
Problems and algorithms- classification of problems, Decision, Search, Optimization and enumeration
problems, Parallel models and complexity, Function(search) problems, One way functions- public key
Papadimitirou C. H., Computational Complexity, Addison Wesley, 2003.
CO467 SOFTWARE QUALITY ASSURANCE (3-0-0) 3 PREREQ: CO351
Evaluation, Role, maturity in development, life cycle, models, maintenance issues, specification, object
oriented design, management, testing, mechanisms, verification and validation, cost estimation, tools,
debugging, simulators, ISO 9000 standards, Quality Assurance.
Pankaj Jalote, An Integrated Approach to Software Engineering, Narosh Publication, 1995.
John J Marciniack, Editor in chief Encyclopedia of Software Engineering, John Wiley and sons, 1994.
Isabel Evans, Achieving Software Quality through Team Work, Allied Publishers, 2004.
Mordechai Ben, Menachem, Garry S. Marliss, Software Quality Producing Practical, Consistent
Software, Thomson Learning.
James F. Peters, Witold Pedrycz, Software Engineering, An Engineering Approach WSE, Wiley
CO468 SOFTWARE TESTING (3-0-0) 3 PREREQ: CO351
Software testing concepts & principles, Testing Strategies, Testability and Related Issues, Methods for
developing the strategy, Life Cycle Testing, Installation Phase Testing and Various Phases of Testing;
Tools and Techniques for Software Testing, Testing Object Oriented Software
Glenford J. Myers, The Art of Software Testing, John Wiley & Sons, 1979.
Boris Beizer, Black Testing: Techniques for Functional Testing of Software and Systems, John Wiley &
William Perry, Software Testing : Effective Methods for Software Testing, John Wiley, 1995
Cem Kaner, Jack Falk, Hung Quoc Nguyen, Testing Computer Software, 2nd Ed, Intl. Thomson Computer
CO469 SOFTWARE PROJECT MANAGEMENT (3-0-0) 3 PREREQ: CO351
Data Collection and Analysis in software engineering, Product Metrics, Quality Metrics, Management
Metrics, Conventional Software Management, Life cycle Phases, Iterative process planning,, Modern
Project Profiles, Next generation cost models.
K. Conway, Software Project Management: From Concept to Development, IDG Books, 2001
I. Jacobson.G.Booch & J.Rumbaugh, The Unified Software Development Process, Addison Wesley, 1999.
Norman E- Fentar and Share Lawrence Pflieger, Software Metrics, International Thomson Computer
Stephan H.Kin, Metric and Models in Software Quality Engineering, Addison Wesley 1995.
Jim McCarthy, Dynamics of Software Development, Microsfot Press, WP Publ. & Distributors (P) Ltd.
CO470 WEB ENGINEERING (3-0-0) 3 PREREQ: CO303
Requirements specification and analysis, Web-based systems development methodologies and techniques,
Migration of legacy systems to Web environments, Web-based real-time applications development,
Testing, verification and validation, Quality assessment, control and assurance, Configuration and project
management, “Web metrics”- generating metrics for estimation of development efforts, Performance
specification and evaluation, Update and maintenance, Development models, teams, staffing, Integration
with legacy systems, Human and cultural aspects, User-centric development, user modeling and user
involvement and feedback, End-user application development.
Journal of Web Engineering, Rinton Press, IEEE & ACM Publications.
Cato & John, User Centered web design, Pearson Education, 2001.
CO471 SOFTWARE ARCHITECTURE (3-0-0) 3 PREREQ: CO351
Introduction to Software Architecture; Software Architectures in Different Application; shared
Information Systems, Architectural Design, User interface Architecture, Tools
Mary Shaw David Garlan, Software Architecture Perspective on an emerging discipline, PHI 1996
Wolfgang pree, Design patterns for object oriented software development, Addison Wesley, 1995.
Len Bass, Paul Clements and Rick Kazman- Software Architecture in Practice, Addison Wesley, 1998.
Steve McConnell, Rapid Development, Microsoft Press, WP Publishers & Distributors (P) Ltd.
CO490 SEMINAR (0-0-2) 1
This course is a 1 credit course to be completed during 7th / 8th semester. Students will have to choose a
topic in CSE’s current trends or industry practices, prepare a write up, present it along with a suitable
demonstration. Evaluation will be based on the relevance of topic, communication skills, and the
reporting / documenting procedure.
CO499 MAJOR PROJECT – II (0-0-9) 6
The Student has to select a project work based on a topic of interest. Periodically the implementation will
be evaluated by the project guide. This work, started in VII semester continues through eighth semester
at the end of which, the student will be evaluated internally and externally.
Pankaj Jalote, Software Project Management in Practice, Pearson Education.