course contents - ug - National Institute of Technology Karnataka

More documents

Recommendations

Info

NATIONAL INSTITUTE OF TECHNOLOGY KARNATAKA, SURATHAKAL ------------------------------------------------------------------------------------------------------------------ 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 parity problem 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, 1991. 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, case studies 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. --------------------------------------------------------------------- NITK-Course Contents(UG)2010 Page 36 of 134
NATIONAL INSTITUTE OF TECHNOLOGY KARNATAKA, SURATHAKAL ------------------------------------------------------------------------------------------------------------------ Raghu Ramakrishnan, Database Management Systems, McGraw-Hill, 2000 Ceri S and Pelagatti G, Distributed Databases Principles and Systems, 2 nd 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 knowledge representation. 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 and navigation. 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 cryptography. 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. --------------------------------------------------------------------- NITK-Course Contents(UG)2010 Page 37 of 134
Page 1 and 2: NATIONAL INSTITUTE OF TECHNOLOGY KA
Page 35: NATIONAL INSTITUTE OF TECHNOLOGY KA
Page 87 and 88:
NATIONAL INSTITUTE OF TECHNOLOGY KA
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
show all

course contents - ug - National Institute of Technology Karnataka

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?