SEMESTER III

IT 3021 DISCRETE MATHEMATICS & GRAPH THEORY 3 (3-0-0)

MODULE - I
Introduction to Logic: Compound Statements, Proofs in Mathematics, Truth Tables, The
Algebra of Propositions, Logical Arguments.
MODULE - II
Induction and Recursion: Mathematical Induction, Recursively Defined Sequences, Solving
Recurrence Relations; The Characteristic Polynomial, Solving Recurrence Relations;
Generating Functions.
MODULE - III
Principles of Counting and Algorithms: The Principle of Inclusion- Exclusion, The
Addition and Multiplication Rules, The Pigeon-Hole Principle, What is an Algorithm?,
Complexity, Searching and Sorting, Enumeration of Permutations and Combinations
MODULE - IV & V
Graphs, Paths and Circuits and Applications: A Gentle Introduction, Definitions and
Basic Properties, Isomorphism, Eulerian Circuits, Hamiltonian Cycles, The Adjacency
Matrix, Shortest Path Algorithms, The Chinese Postman Problem, Digraphs, Tournaments,
Scheduling Problems.
MODULE - VI
Trees and Searching: What is a Tree?, Properties of Trees, Spanning Trees, Minimum
First
Search.
MODULE - VII
Planar Graphs, Colorings and Maximal Flows: Planar Graphs, Coloring Graphs, Flows
and Cuts, Constructing Maximal Flows, Applications.
Text Books:
1. E.G. Goodaire & M.M Parmenter- Discrete Mathematics with Graph Theory, 2 nd Edn
Pearson Education, New Delhi - 2002.
Reference Books:
1. B.Kolman et.al- Discrete mathematical Structures, 5th Edn, Pearson Education, New
Delhi - 2004.
2. K.H. Rosen Discrete Mathematics and Its Applications 4th Edn, Tata McGraw Hill,
New Delhi - 2001
3. D.B. West Introduction to Graph Theory, 2nd Edn, Pearson Education, New Delhi 2002.
4. N.Deo Graph Theory with Application to Engineering and Computer Science, PHI, New
Delhi- 2004.

IT 3023 JAVA PROGRAMMING 4 (3-1-0)

MODULE I

Control Statements : if, if ... else,selection statements, while statement, compound assignment
operators, increment decrement operators, for ... statement, do .... while, switch, break and
continue, labeled break and continue, logical operators.
Methods in java : declarations, argument promotions, scope of declarations, method
overloading, Recursion.
Arrays : declaring and creating references and reference parameters, passing arrays to
methods, multi dimensional arrays.
MODULE II
Object based programming, classes, class scope, controlling access to members, this keyword
and its use, constructors, overloading constructors, composition, garbage collection, static
class members, final instance variables, crating packages, package access, Data abstraction
and encapsulation.
MODULE III
Inheritance and polymorphism : super class and subclass, protected members, Relation ship
between super and sub class. Inheritance hierarchy , abstract classes and methods, final
methods and classes, nested classes, Type wrappers.
MODULE IV
Exception handling, Java exception hierarchy, rethrowing an exception, finally clause, stack
unwinding, chained exception, Declaring new exception types.
MODULE-V
Multithreading : Life cycle of a thread, priorities and scheduling, creating and executing
threads synchronization.
MODULE VI
Files and streams, hierarchy, files and streams, File class, Sequential access file manipulation,
random access file handling, Introduction to String class and its members.
MODULE VII
Fundamental of GUI , Applet and swing programming.
Text Book :
1.
Dietel,Dietel - Java How to program , 5th edition; Pearson Education , New Delhi.
2. S. Raj Kamal Intrernet and Web Technology, Tata McGraw Hill, New Delhi, 2002.
Reference:
1. C. Horstmann,G. Cornell - Core Java 2 Vol I & Vol II ; Pearson Education ,
New Delhi.
2. Balagurusamy -Programming in Java , 2nd Edition; Tata McGraw Hill Publication; New
Delhi.
3. Patrick Naghton & H. Schildt The Complete Reference Java 2, Tata
McGraw Hill Publication, New Delhi.

IT 3025 COMPUTER ORGANIZATION & ARCHITECTURE 4 (3-1-0)

MODULE - I
Introduction: Organization and Architecture, Structure and Function, Why Study Computer
Organization and Architecture?
Computer Evolution and Performance: A Brief History of Computers, Designing for
Performance, Pentium and PowerPC Evolution.
MODULE - II
A Top-Level view of Computer Function and Interconnection: Computer Components,
Computer Function, Interconnection Structures, Bus Interconnection, PCI.
MODULE - III
Cache Memory: Computer Memory System Overview, Cache Memory Principles, Elements
of Cache Design, Pentium 4 and PowerPC Cache Organizations.
Internal Memory: Semiconductor Main Memory, Error Correction, Advanced DRAM
Organization.
MODULE - IV
External Memory: Magnetic Disk, RAID, Optical Memory, Magnetic Tape.
Input/Output: External Devices, I/Os, Programmed I/O, Interrupt-Driven I/O, Direct
Memory Access, I/O Channels and Processors.
MODULE - V
Computer Arithmetic: The Arithmetic and Logic Unit, Integer Representation, Integer
Arithmetic, Floating-Point Representation, Floating-Point Arithmetic.
MODULE - VI
Instruction Sets- Characteristics and Functions: Machine Instruction Characteristics, Type
of Operands, Pentium and PowerPC Data Types, Types of Operations, Pentium and PowerPC
Operation Types.
Instruction Sets- Addressing Modes and Formats: Addressing, Pentium and PowerPC
Addressing Modes, Instruction Formats, Pentium and PowerPC Instruction Formats.
MODULE - VII
Processor Structure and Function: Processor Organization, Register Organization,
Instruction Cycle, Instruction Pipelining, The Pentium Processor, The PowerPC Processor.
Reduced Instruction Set Computers: Instruction Execution Characteristics, The Use of a
Large Register File, Compiler-Based Register Optimization, Reduced Instruction Set
Architecture, RISC Pipelining, MIPS R4000, SPARC, RISC versus CISC Controversy.
Text Book:
1. William Stallings- Computer Organization & Architecture: Designing for
Performance, 7th Edn, Pearson Education, New Delhi-2006.
Reference Books:
1. C. Hamacher- Computer Organization, 5th Edn, McGraw Hill, Internaional
Education, New Delhi-2002.
2. M.M.Mano- Computer System Architecture, 3rd Edn, PHI/Pearson Education, New
Delhi-2006.