Sie sind auf Seite 1von 12

# CMR Institute of Technology, Bangalore

## Department(s): Computer Science & Engineering

Semester: 04
Section(s): A, B & C
Engineering Mathematics - IV
Course Instructor(s): Revathi,Tulasi
Course duration: 27 Jan., 2014 23 May 2014

10MAT41

Lectures/week: 06

LESSON PLAN
Lecture
#

01 -08

09-16

17-24

25-32

33-40

41-48

49-55

56-62

Book &
Sections
NUMERIC
AL
METHOD
S-I:
TB1-31.131.8
NUMERIC
AL
METHOD
S-2
TB1-31.931.10
COMPLE
X
VARIABL
ES-ITB1-20.120.6
PROBABI
LITY -I
TB1-26.126.6
PROBABI
LITY -II
TB1-26.726.18
SAMPLIN
G
THEORY
TB1-27.127.18
COMPLE
X
VARIABL
ES-II
TB1-20.720.14
SPECIAL
FUNCTIO
NS
TB1-16.116.17

Topics

Portions coverage
Individual Cumulative

## Numerical methods for initial value problem-picards method,

Taylors series method, Modified Eulers method, Rungekutta
method of fourth order, Predictor and corrector methods(milnes

## Numerical solution of simultaneous first order ODES-PICARDS

METHOD, Runge kutta method of fourth order, Numerical
solution of second order ORDES (picards method,
Rungekutta method), Milnes method

## Function of a complex variable, limit, continuity, differentiability

Cauchy Riemann equations in Cartesian and polar form,
Harmonic function, orthogonal property, Finding the derivative
of an analytic function, Milne-thompsons method, Finding the
conjugate harmonic function and the analytic function,
Application to flow problems
Introduction to Probability, Addition theorem of probability
Probability associated with set theory, Conditional Probability
Multiplication Law, Bayes Theorem
Random Variables, Probability density function, Cumulative
density function, Probability distributions, Binomial
distributions, Poisson distributions, Exponential distributions,
Normal distributions
Sampling distributions, Standard error, Test for hypothesis for
means, Limits for means, Students t distribution, Chi square
distribution

## Conformal transformations, Bilinear transformations, Discussion

of w = z2 Discussion of w = ez Discussion of w = z+a2/z,
Complex line integral, Cauchys theorem and integral formula

12.5

12.5

12.5

25

12.5

37.5

12.5

50

12.5

62.5

12.5

75

12.5

87.5

12.5

100

## Bessels equation, Legendres equation, Bessels function and

properties, Legendres polynomial, Rodrigues formula

IAT #

Syllabus

IAT-1
IAT-2

Class # 01 27
Class # 28 48

IAT-3

Class # 49 - 62

## * : See calendar of events for the schedules of IATs.

Literature:
Publication information
Book Type

Code

Text Book

TB1

## B.S.Grewal, Higher Engineering

Mathematics, Latest Edition, Khanna
publishers

## Latest edition, Khanna

publications

8174091955

Text Book

TB2

Mathematics, Latest Edition, Willey
Publication

978812653135

Reference

RB1

Mathematics.

Reference

RB2

## Peter V .ONeil, Engineering Mathematics

Reference

RB3

Reference

RB4

Edition // Publisher

ISBN #

Mc.Graw Hill
Publications

---

## Cengage Learning India

Pvt. Ltd.Publishers

---

## 5th Edition 2011

978-81-7686-675-4

2011-2012

---

## CMR Institute of Technology, Bangalore

Department(s): Computer Science & Engineering
Semester: 04
Section(s): A & C
Graph Theory & Combinatorics
Course Instructor(s): Savitha
Course duration: 27 Jan., 2014 23 May 2014

10CS42

Lectures/week: 05

LESSON PLAN
Lecture
#

Book &
Sections

Topics

1-10

TB1
(Chp 11)
& RB1
(Chp 1)

11-18

TB
(Chp-11 )
& RB1
(Chp 1,2)

19-26

TB1
(Chp 12)
& RB1
(Chp 3)

27-33

RB1 (Chp
4)

## UNIT 1: Introduction to Graph Theory

Definitions and Examples, Sub graphs, Complements, Graph
Isomorphism, Vertex, Degree Connected and disconnected
Graphs, Euler Trails, Euler Trails and Circuits, Problems.
UNIT 2: Introduction to Graph Theory (contd)
Konigsberg Bridge Problem, Hamilton Paths and Cycles,
Planar Graphs and Non Planar Graphs, Homeomorphic graphs
and Eulers formula, Detection of planarity, Graph Coloring
Chromatic Polynomials and Map coloring, Problems
UNIT 3: Trees
Definitions, Properties, and Examples, Rooted Trees, Preorder
and Postorder Traversals, Trees and Sorting, BFS and DFS
Weighted Trees and Prefix Codes, Weighted Trees and Prefix
Codes.
UNIT 4: Optimization and Matching
Dijkstras Shortest Path Algorithm, Minimal Spanning Trees:
Kruskals algorithms, Prims algorithms, Cut sets ,Edge
connectivity ,Vertex connectivity, Transport Networks Maxflow, Min-cut Theorem, Matching Theory
UNIT 5: Fundamental Principles of Counting
The Rules of Sum and Product , Permutations, Combinations
Combinations -The Binomial Theorem, Combinations with
Repetition, The Catalon Numbers
UNIT 6: The Principle of Inclusion and Exclusion
The Principle of Inclusion and Exclusion, Generalizations of the
Principle, Derangements Nothing is in its Right Place, Rook
Polynomials
UNIT 7: Generating Functions
Introductory Examples, Definition and Examples Calculational
Techniques, Partitions of Integers, The Exponential Generating
Function, The Summation Operator, Problems
UNIT 8: Recurrence Relations
First Order Linear Recurrence Relation, The Second Order
Linear Homogeneous Recurrence Relation with Constant
Coefficients, The Non-homogeneous Recurrence Relation, The
Method of Generating Functions, Problems

34-39

40-46

47-53

54-62

TB1
(Chp -1)
& RB1
(Chp 5)
TB1
(Chp 8 )
& RB1
(Chp 6)
TB1
(Chp 9)
& RB1
(Chp 7)
TB1
(Chp 10)
& RB1
(Chp 8)

## Syllabus for Internal Assessment Tests (IAT)

IAT #

Syllabus

IAT-1
IAT-2

Class # 01 22
Class # 23 43

IAT-3

Class # 44 - 62

Portions coverage
Individual Cumulative

12

12

13

25

13

38

12

50

12

62

13

75

12

87

13

100

## * : See calendar of events for the schedules of IATs.

Literature:
Publication information
Book Type

Code

Text Book

TB1

Reference

RB1

Reference

RB2

Reference

RB3

## Author & Title

Ralph P. Grimaldi: Discrete and
Combinatorial Mathematics
D.S. Chandrasekharaiah: Graph Theory
and Combinatorics
Chartrand Zhang: Introduction to Graph
Theory
Richard A. Brualdi: Introductory
Combinatorics

Edition // Publisher

ISBN #

Education, 2004.

10: 0201726343

Prism, 2005.

9788172865665

TMH, 2006.

10: 0073204161

Education, 2004.

10: 0136020402

## CMR Institute of Technology, Bangalore

Department(s): Computer Science & Engineering
Semester: 04
Section(s): C
Design & Analysis of Algorithms
Course Instructor(s): Prof. Deepa Anand
Course duration: 27 Jan., 2014 23 May 2014

10CS43

Lectures/week: 05

LESSON PLAN
Lecture
#

1-8

Book &
Sections
TB1: 2.1,2.2
TB1: 3.1,3.2

9-14

TB1: 5.1,5.2
TB2: 18.2
RB1: 1.5

15-23

TB2: 3.1-3.2
RB1:23.2-23.3

24-32

TB1:8.2,8.4
RB:15.1,15.4

33-38

TB1: Ch. 4
RB1: 22.4

39-45

TB1: Ch.11
RB1: Ch.34

46-56

TB1: Ch 12

57-62

TB2: 13.1,
13.2
TB2:13.7

Topics

Portions coverage
Individual Cumulative

## UNIT 1: INTRODUCTION: Notion of Algorithm, Review

of Asymptotic Notations, Mathematical Analysis of NonRecursive and Recursive Algorithms Brute Force
Approaches: Introduction, Selection Sort and Bubble Sort,
Sequential Search and Brute Force String
Matching.
UNIT 1: DIVIDE AND CONQUER: Divide and Conquer:
General Method, Defective Chess Board, Binary Search,
Merge Sort, Quick Sort and its performance
UNIT 3 : THE GREEDY METHOD: The General Method,
Knapsack Problem, Job Sequencing with Deadlines,
Minimum-Cost Spanning Trees: Prims Algorithm, Kruskals
Algorithm; Single Source Shortest Paths.
UNIT 4 : DYNAMIC PROGRAMMING: The General
Method, Warshalls Algorithm, Floyds Algorithm for the
All-Pairs Shortest Paths Problem, Single-Source Shortest
Paths: General Weights, 0/1 Knapsack, The Traveling
Salesperson problem.
UNIT 5 : DECREASE-AND-CONQUER APPROACHES,
Approaches: Introduction, Insertion Sort, Depth First Search
and Breadth First Search, Topological Sorting Space-Time
Tradeoffs: Introduction, Sorting by Counting, Input
Enhancement in String Matching.,
UNIT 6 : LIMITATIONS OF ALGORITHMIC POWER
AND COPING WITH THEM: Lower-Bound Arguments,
Decision Trees, P, NP, and NPComplete Problems,
Challenges of Numerical Algorithms.
UNIT 7 : COPING WITH LIMITATIONS OF
ALGORITHMIC POWER:
Backtracking: n - Queens problem, Hamiltonian Circuit
Problem, Subset Sum Problem. Branch-and-Bound:
Assignment Problem, Knapsack Problem, Traveling
Salesperson Problem. Approximation Algorithms for NPHard Problems Traveling Salesperson Problem, Knapsack
Problem
UNTI 8 : PRAM ALGORITHMS: Introduction,
Computational Model, Parallel Algorithms for Prefix
Computation, List Ranking, and Graph Problems

IAT #

Syllabus

IAT-1
IAT-2

Class # 01 19
Class # 20 38

13

13

10

23

15

38

14

52

10

62

11

73

18

91

100

IAT-3

Class # 39 - 62

## * : See calendar of events for the schedules of IATs.

Literature:
Publication information
Book Type

Code

Text Book

TB1

Text Book

TB2

Reference

RB2

## Anany Levitin: Introduction to The

Design & Analysis of Algorithms
Ellis Horowitz, Sartaj Sahni,
Sanguthevar Rajasekaran:
Fundamentals of Computer
Algorithms
Introduction to Algorithms, Thomas
H. Cormen, Charles E. Leiserson,
Ronal L. Rivest, Clifford Stein,.

Edition // Publisher

ISBN #

Education, 2007.

0-13-231681-1

press, 2007.

978-0914894223

978-0-26203384-8

## CMR Institute of Technology, Bangalore

Department(s): Computer Science & Engineering
Semester: 04
Section(s): A & B
UNIX & SHELL Programming
Course duration: 27 Jan., 2014 23 May 2014

10CS44

Lectures/week: 06

LESSON PLAN
Lecture
#
1-3

Book &
Sections
-

4-8

TB1 : 1.1,
1.2, 2.1 to
2.12

9-10

TB1 : 3.1
to 3.14

11-13

TB1 : 4.1
to 4.13

14-19

TB1 : 5.1
to 5.5, 5.7
to 5.12, 6.1
to 6.8, 11.1
to 11.8

20-23
24-26
27-29
30-32

TB1 : 7.1
to 7.10
TB1 : 12.1
to 12.11
TB1 : 13.1
to 13.12
TB1 : 8.1
to 8.11

33-42

TB1 : 14.1
to 14.18

43-52

TB1 : 18.1
to 18.16

53-55

TB1 : 9.1
to 9.14

56-58

TB1 : 10.1
to 10.9

59-62

TB1 : 19.1
to 19.19

Topics
C Programming - Refresher
Unit 1) Getting Started, UNIX Architecture and Command
Usage: Architecture, Features and Specification, Locating
Commands, Command Structure, Flexibility of Command Usage,
Man command.
General- Purpose Utilities : cal, date, echo, printf, bc, script,
Email Basics, mailx, passwd, who, uname, tty, sty
Unit 1) The File System : The File, Parent-Child Relationship,
The HOME Variable, pwd, cd, mkdir, rmdir, Absolute
Pathnames, Relative Pathnames, ls, File System
Unit 2) Basic File Attributes : ls l, modification and access
Times, chmod, chown.
Handling Ordinary Files : cat, cp, rm, mv, more, file, wc, od,
cmp, comm., diff
Unit 4) More File Attributes : File Systems and Inodes, Hard
Unit 2) The vi Editor
Unit 4) The sample database, pr, head, tail, cut, paste, sort, uniq,
tr
Unit 5) Filters Using Regular Expressions grep and sed
Unit 3) The Shell
Unit 6) Shell Scripts, read, Using Command Line Arguments,
exit, Logical Operators, if Conditional, case Conditional, expr,
while, for, set and shift, trap
Unit 7) Awk- An Advanced Filter : awk Filtering, printf,
Operators, Number Processing, Variables, The BEGIN and END
Sections, Built-in Variables, Arrays, Functions, Control Flow
Unit 3) The Process : Process Basics, ps, System Processes
Process States and Zombies, Running Jobs in Background, nice,
at and batch, cron, time
Unit 3) Customizing the Environment : The Shells,
Environment variables, Aliases (bash and ksh)
Unit 8) Perl- The Master Manipulator : Perl Preliminaries,
chop Function, Variables and Operators, The String Handing
Functions, Lists and Arrays, foreach, split, join, grep
Syllabus for Internal Assessment Tests (IAT)
IAT #

Syllabus

IAT-1
IAT-2
IAT-3

Class # 01 19
Class # 20 - 42
Class # 43 - 62

Portions coverage
Individual Cumulative
06

06

06

12

06

18

14

32

06

38

06

44

08

52

06

58

12

70

12

82

06

88

06

94

06

100

## * : See calendar of events for the schedules of IATs.

Literature:
Publication information
Book Type

Code

Text Book

TB1

Applications

Reference

RB1

## Behrouz A Forouzan and Richard F

Gilberg, UNIX and Shell Programming

Reference

RB2

## M.G. Venkateshmurthy, Introduction to

UNIX and Shell Programming

Edition // Publisher

ISBN #

## Fourth Edition, Tata

McGraw Hill
Cengage Learning,
INDIA Edition, Ninth
Indian Reprint 2009
Pearson Education, 2005,
Eighth Impression 2011

0-07-063546-3
978-81-315-0325-6
978-81-7758-745-6

## CMR Institute of Technology, Bangalore

Department(s): Computer Science & Engineering
Semester: 04
Section(s): A & B
Microprocessors
Course Instructor(s): Vasantha
Course duration: 27 Jan., 2014 23 May 2014

10CS45

Lectures/week: 05

LESSON PLAN
Lecture
#

Book &
Sections

1-6

TB1
(Chp1.1
1.2 2.1-2.2)

7-15

TBI
(Chp2.32.7 & 3.13.3)

16-24

TB1
(Chp4.14.9 & 5.15.2 )

25-34

TB1
(Chp5.35.8 & 6.16.5)

35-42

43-48

49-57

58-62

TB1
(Chp9.19.8 &
10.1))
TB1
(Chp10.210.4 &
11.1-11.2
TB1
(Chp11.311.4 &
12.1-12.2
& 13.113.2)
TB1
(Chp7.17.5 & 8.18.5)

Topics

Portions coverage
Individual Cumulative

## UNIT 1: Introduction, Microprocessor Architecture 1 :

A Historical Background, The Microprocessor-Based Personal
Computer Systems, Internal Microprocessor Architecture, Real
UNIT 2: Microprocessor Architecture 2, Addressing
Modes: Introduction to Protected Mode Memory Addressing,
Memory Paging, Flat Mode Memory, Data Addressing Modes,
Modes.
UNIT 3: Programming 1 :Data Movement Instructions: MOV
Transfers, Miscellaneous String Data Transfers, Miscellaneous
Data Transfer Instructions, Segment Override Prefix, Assembler
Details, Addition, Subtraction and Comparison, Multiplication
and Division.
UNIT 4: Programming 2 : BCD and ASCII Arithmetic, Basic
Logic Instructions, Shift and Rotate, String Comparisons,
Program Control Instructions: The Jump Group
Controlling the Flow of the program, Procedures, Introduction to
Interrupts, Machine Control and Miscellaneous Instructions.
UNIT 6: Hardware Specifications, Memory Interface 1 :
Pin-Outs and the Pin Functions, Clock Generator, Bus Buffering
and Latching, Bus Timings Ready and Wait state, Minimum
Mode versus Maximum Mode, Memory Interfacing: Memory
Devices
UNIT 7: Memory Interface 2, I/O Interface 1 :
Memory Interface, Implementation using ROM, Basic I/O
Interface: Introduction to I/O Interface, I/O Port Address
Decoding.
UNIT 8: I/O Interface 2, Interrupts, and DMA: I/O
Interface: I/O Interface: Programmable Peripheral Interface
82C55, Programmable Interval Timer 8254, Interrupts: Basic
Interrupt Processing, Hardware Interrupts: INTR and INTA
Direct Memory Access: Basic DMA Operation and Definition.
The 8237 DMA Controller.
UNIT 5: Programming 3 :Combining Assembly Language
with C/C++: Using Assembly Language with C/C++ for 16-Bit
DOS Applications, Using Assembly Language with C/C++ for
16-Bit DOS Applications, Using Assembly Language with
C/C++ for 32-Bit DOS Applications, Using Assembly Language
with C/C++ for 32-Bit DOS Applications, Modular
Programming, Using the Keyboard and Video Display

IAT #

Syllabus

10

10

12

22

13

35

15

50

13

63

10

73

14

87

13

100

IAT-1

Class # 01 20

IAT-2
IAT-3

Class # 21 40
Class # 41 - 62

## * : See calendar of events for the schedules of IATs.

Literature:
Publication information
Book Type

Code

Text Book

TB1

Reference

RB1

Reference

RB2

Reference

RB3

## Author & Title

Barry B Brey: The Intel Microprocessors,
(Listed topics only from the Chapters 1 to
13)
Douglas V. Hall: Microprocessors and
Interfacing
K. Udaya Kumar & B.S. Umashankar :
& IBM-PC Assembly Language
James L. Antonakos: The Intel
Microprocessor Family: Hardware
and Software Principles and Applications

Edition // Publisher

ISBN #

Hill,2009

9780135026458

## 2nd Edition, Tata

McGraw Hill,2006

978-0-07-060167-3

## Tata McGraw Hill,2011

978-0-07-463430-1

Learning,2004

978-1133628477

## CMR Institute of Technology, Bangalore

Department(s): Computer Science & Engineering
Semester: 04
Section(s): A & B
Computer Organization
Course Instructor(s): Aishwaryalakshmi
Course duration: 27 Jan., 2014 23 May 2014

10CS46

Lectures/week: 06

LESSON PLAN
Lecture
#

Book &
Sections

1-12

TB1
(Chp 1,2)

13-19

TB1
(Chp-2 )

20-27

TB1
(Chp 4)

28-30

TB1
(Chp-4 )

31-38

TB1
(Chp -5)

39-45

TB1
(Chp 6 )

46-51

TB1
(Chp 7)

52-62

TB2
(Chp 1,7 )

Topics

Portions coverage
Individual Cumulative

## UNIT 1: Basic Structure of Computers

Computer Types, Fuctional Units, Basic operational concept
Bus structure, Clock Rate, Performance Processor Clock, Basic
Performance Equation, Performance Measurement, ,Historical
Prespective Numbers, Arithmetic Operations and Characters
Instructions and Instruction Sequencing
UNIT 2: Machine Instructions and programs Contd:
Addressing Mode,Assembly language,Basic Input and Output
Instructions, Encoding of machine Instructions
UNIT 3: Input/Output Organization
Accessing I/O Devices,Interrupts-Interrupt Hardware
Enabling and Disabling Interrupts,Handling Multiple Devices
Controlling Device Requests, Exceptions, Direct Memory
Access,Buses
UNIT 4: Input/Output Organization contd:
Interface Circuits,Standard I/O Interfaces-PCI Bus, SCSI Bus
USB
UNIT 5: Memory System
Basic Concepts,Semiconductor RAM Memories, Read only
memory,Speed,Size and Cost, Cache Memories-Mapping
Fuction,Replacement algo, Cache contd,Performance
Considerations,Virtual Memories, Secondary Storage
UNIT 6: Arithmetic
Addition and Substraction of Signed Numbers,Design of fast
multiplication,Fast multiplication, Integer Division ,Floating
point number and operations
UNIT 7: Basic Processing Unit
Some fundamental concept,Execution of complete instruction
Multiple bus organization,Hard wired control, Microprogrammed
control,Microprogrammed control contd
UNIT 8: Multicores,Multiprocessors and cluster
Performance,The Power wall,The switch from Uniprocessor to
multiprocessor,Amdahls law,Shared memory,
Multiprocessors,Clusters,Message passing multiprocessors

IAT #

Syllabus

IAT-1
IAT-2
IAT-3

Class # 01 27
Class # 28 45
Class # 46 - 62

13

13

13

26

13

39

12

51

12

63

13

76

12

88

12

100

## * : See calendar of events for the schedules of IATs.

Literature:
Publication information
Book Type

Code

Text Book

TB1

Text Book

TB2

Reference

RB1

Reference

RB2

## Author & Title

Carl Hamacher,Zvonko Vranesic,Safwat
Zaky:Computer organization
David A.Patterson, John L.Hennessy:
Computer Organization and Design
William Stallings:Computer Organization
& Architecture
Vincent P. Heuring & Harry F.
Jordan:Computer System Design and
Architecture

Edition // Publisher
5th Edition, Tata McGraw
Hill, 2002.
4th Edition, Elsevier,
2009
7th Edition,PHI,2006
2nd Edition,Pearson
Education,2004

ISBN #
007-120411-3
978-81-312-22744
8120329627
9788177584837