Course Title : MA1101: ENGINEERING MATHEMATICS – I

Matrices-inverse and rank, solution of linear system of equations, Eigen value problems. Vector
spaces, basis, linear transformations, inner product spaces and Orthogonalization. First and higher
order differential equations and their solutions; finite difference and interpolation for equal and
unequal intervals, Numerical differentiation and integration. Solution of algebraic and transcendental
equations, solutions of ordinary differential equations.

Course Title : ENGINEERING MATHEMATICS – II

Differential calculus: curvatures, asymptotes, curve tracing; Partial differentiation, total derivatives,
errors and expansions, Taylor's theorem, maxima and minima, Lagrange's method. Infinite series, tests
for convergence of series with positive terms, alternating series, power series. Analytical solid
geometry- spheres. Cones and cylinders. Multiple integrals and their applications, beta and gamma
functions. Laplace transforms, periodic functions, step functions, inverse transforms, convolution,
solution of differential equations and applications

Course Title : ENGINEERING MATHEMATICS – III

Sets, relations and functions: Sets and set operations, functions, binary relations, partial ordering
relations and Hasse diagram, equivalence relations. Principle of mathematical induction. Basic
counting techniques: pigeon-hole principle, inclusion and exclusion principle, permutations and
combinations. Discrete numeric functions, recurrence relations and generating function. Propositional
Calculus: propositions and logical operations, conditional statements, logical equivalence of
statements, tautology and contradiction, Predicates and Quantifiers, rules of inference. Algebraic
structures: Semi-group, monoid, group, cyclic group, permutation group, Boolean algebra.
Introduction to graph theory: Graphs and graph models, graph terminology and types of graphs,
Handshaking theorem, regular graph, complete graph, bipartite graph, graph isomorphism, subgraphs,
walk, path, cycle, Eulerian graph

Course Title : ENGINEERING MATHEMATICS – IV

Statistics: Probability, Random variables and generating functions, probability distributions: binomial,
Poisson, normal, gamma and exponential distributions. Sampling distributions: t and F distributions.
Testing of hypotheses. Markov chain, Queuing Theory. Integral Transforms: Laplace transforms of
elementary functions, inverse transforms, convolution theorem, Application in solving ordinary and
partial differential equations. Fourier transforms. Numerical Methods: Interpolation, Numerical
differentiation, Numerical integration: Trapezoidal, Simpson’s 1/3 and 3/8 Rule. Solution of system of
linear algebraic equations: Gauss Jacobi, Gauss-Seidel methods.

Course Title: DATA STRUCTURES:

Introduction: Algorithm specification; Performance Analysis: Time and Space Complexity,
Asymptotic notation; pointer declaration and definition, memory allocation functions, array of
pointers; The type definition, enumerated types, accessing structures, complex structures, arrays of
structures, structures and functions; Recursive definition & processes, Recursion in C, writing
recursive programs efficiency of recursion, Examples: Tower of Hanoi, GCD, Fibonacci Definition
and examples, Representing stacks in C, Evaluation of expressions, multiple stacks and queues;
Applications: infix, postfix and prefix and their conversions Linked lists representations, Singly,
doubly, header node, circular, linked stacks and queues, polynomial and long integer arithmetic,
union, intersection, Basic terminologies, binary tree representation, recursive/ non recursive, Binary
search tree, AVL trees; Applications: Expression trees, inserting, deleting, searching, height of BST
Terminology and representations, Graph operations, spanning trees, minimum cost spanning tree,
shortest path and transitive closure, Binary and linear search, insertion, quick, merge, heap, radix sort
Static Hashing
Course Title: COMPUTER ORGANIZATION AND ARCHITECTURE:
Basic Structure of computers: Computer types, functional units, basic operational concepts, bus
structures, software, performance; Machine Instructions and programs: Numbers, arithmetic
operations and characters, Memory locations and addresses; Memory operations, Addressing modes;
Arithmetic: Addition and subtraction of signed numbers, Adders, ALU design, Bit slice processor,
Multiplication of positive numbers Signed operand multiplication, Fast multiplication, Integer
division, Floating point numbers and operations; Memory Systems: Introduction, Basic concepts,
Design methods; RAM memories, Read only memories, Speed size and cost, Cache memories,
Performance considerations, Virtual memories, Memory, Management Requirements, Secondary
storage; Input / Output organization: Accessing I/O devices, Interrupts, Direct memory access, Buses,
Interface circuits; Introduction to Parallel Processing: Flynn Classification, Multi-Core Architecture,
Pipelining.

Course Title: OPERATING SYSTEMS:

Introduction: Functions, Classification of Operating System, Operating System Structure and
Operations, Process Management, Memory Management, Storage Management, Protection and
Security, Special Purpose Systems, Operating System Services, User Operating System Interfaces,
System Calls, Types of System Calls, System Programs, Operating System Structure, Virtual
Machines, System Boot; Processes: Concept, Process Scheduling, Operations on Processes,
Inter-process Communication Overview, Multithreaded Models, Thread Libraries, Threading Issues,
Linux Threads, Basic Concepts; CPU Scheduling: Basic Concept, Scheduling Algorithms, Thread
Scheduling, Linux Scheduling: Process Synchronization : Concept of Synchronization, Critical
Section Problem, Peterson’s Solution, Synchronization Hardware, Semaphores, Classical problems on
Synchronization, Monitors; Deadlock: Deadlock Concept, Deadlock Characterization, Methods for
Handling Deadlock, Prevention, Avoidance, Detection, Recovery from Deadlock, Exercises; Memory
Management: Concept of logical and Physical memory, Swapping, Contiguous Memory Allocation,
Paging, Page Table Structure, Segmentation, Examples on The Intel Pentium; Virtual Memory
Management: Demand Paging, Copy-On-Write, Page Replacement, Allocation of Frames, Thrashing,
Memory Mapped Files, Allocating Kernel Memory; Files: File concept, Access Methods, Directory
Structure, File System Mounting, File Sharing; Security Problem: The security problem, Program
Threats, System and Network threats, User Authentication Design Principles, Firewalling to Protect
Systems.; Case study on Linux System.

Course Title: AUTOMATA AND COMPILER DESIGN:

Automata introduction: Mathematical Preliminaries and Notation, Three basic concepts and Some
Applications on: Deterministic Finite Accepters, Nondeterministic Finite Accepters, Equivalence of
Deterministic and Nondeterministic Finite Accepters, Reduction of the Number of States in Finite
Automata. Regular Expressions, Identifying Non regular Languages. Introduction to Context-Free
grammars & writing grammars, Parsing and Ambiguity, Context-Free Grammars and Programming
Languages; Compiler Design: Language Processors, The Structure of a Compiler. The Role of the
Lexical Analyzer, Input Buffering, Specification of Tokens, Recognition of Tokens, The
Lexical-Analyzer Generator Lex. Top-Down Parsing, Bottom-Up Parsing, Introduction to LR Parsing:
Simple LR, More Powerful LR Parsers, Using Ambiguous Grammars, Parser Generators.
Syntax-Directed Definition, Construction of Syntax Trees. Variants of Syntax Trees; Three-Address
Code, Types and Declarations: Type Expressions, Type Equivalence; Translation of Expressions:
Operations within Expressions, Type Checking: Rules for Type Checking. Storage Organization,
Stack Allocation of Space, Issues in the Design of a Code Generator, the Target Language, Addresses
in the Target Code, Basic Blocks and Flow Graphs.