Students admitted during 2009-2010

COMPUTATIONAL TECHNIQUES
L
3

T
0

P
0

C
3

Course Objective:
This course aims to cover mathematical techniques and models used in the solution of computer engineering
problems in microelectronics.
Course Outcomes:
By the end of the course, students will have a broad understanding of the various notions used in
computational complexity theory to classify computational problems as hard or easy to solve. They will
become familiar with the important complexity classes, how they are related to each other, typical problems in
those classes. They will be familiar with Finite difference methods and probability theory and random process.

Set Theory
Basics of Set theory: Subsets, Set Operators, Sets of Numbers Functions: Product Sets and Graphs
of Functions Relations Operations - Cardinal- Partially and Totally Ordered Sets - Algebra of
Propositions Quantifiers - Boolean Algebra - Logical Reasoning.
Graph Theory
Basic concepts of GT: Paths, Reachability and Connectedness; Matrix representations - Trees Connectivity - Euler tours and Hamilton Cycles - Matchings - Edge Colouring - Directed Graphs Random Graphs.
Complexity of Algorithms
Comparing algorithms - Machine independence - Example of finding the maximum- (theta)
notation - O(big oh) notation - Properties of and O - as an equivalence relation - Sufficiently
large, Eventually positive, Asymptotic - o (little oh) notation - using to compare polynomial
evaluation algorithms, average running time, tractable, intractable, graph coloring problem.
Probability, Stochastic and Random Processes
Deterministic and probabilistic function, Probabilistic space, Joint probability, conditional
probability, Bernoulli Trails, Bayes Theorem, Entropy, M.S.E., Normal Random variables, Central
Limit Theorem, Stochastic Processes, Markovian Processes, Stationary and Non-stationary
processes, Time variant and Time invariant signals, Ergodic processes, Covariance, Correlation,
Auto & cross correlations, Power Spectrum.
Finite Difference Methods
Ordinary differential equations of second order finite difference methods, Finite difference
methods. Forelliptic equations, Diffusion equation explicit method Von-Neumann stability
condition, CrankNikolson Implicit method. Wave equationexplicit method, CFL stability
condition.
Text Books:
1. J.P. Trembley and R. Manohar, Discrete Mathematical Structures with Applications to Computer
Science, Tata McGraw Hill 13th reprint (2001).
2. Edward A. Bender & S. Gill Williamson Mathematics for Algorithm and Systems Analysis, Dover
(2005) ISBN 0-486-44250-0
3. S. Lipschutz and M. Lipson, Discrete Mathematics, TMH, 2nd Edition (2000).
4. Murray R. Spiegal, Theory and problems of Statistics Schaums series,TMH,.1999
References:
1. J A Bondy and U S R Murthy, Graph Theory with Applications, Elsevier Publishing Co., Inc., New
York, 1976.
2. Lipschutz, Seymour, Schaum's Outline of Theory and Problems of Set Theory and Related Topics,
McGraw-Hill Companies, July 1998
3. Liu "Elements of Discrete Mathematics" McGraw Hill.
4. Richard Johnsonbaugh, Discrete Mathematics, 5th Edition, Pearson Education (2001).