3rd SEMESTER SUBJECTS

Mathematics III
Data Structure and Algorithms
Computer Organization and Architecture
Object Oriented Programming
Discrete Mathematical Structure
System Programming
[MTM301] Mathematics III

Unit Contents

Transform Calculus: Introduction of Laplace Transform, Properties of Laplace Transform,

Periodic functions. Finding inverse Laplace transform by different methods, convolution
1 theorem.
Fourier series: Fourier Series for Continuous Functions, Half range sine and cosine series.
Series solution.

Partial Differential Equation: Introduction, Linear partial differential equation of first order,
2 Non Linear partial differential equation of first order, Linear partial differential equation of
second and higher order of homogeneous form, Non-Linear partial differential equation of
second and higher order of homogeneous form, separation of variable

Numerical Methods I : Solution of polynomial and transcendental equations – Bisection

method, Newton-Raphson method and Regula-Falsi method. Finite differences, Relation
3. between operators, Interpolation using Newton–s forward and backward difference formulae.
Interpolation with unequal intervals: Newton–s divided difference and Lagrange–s
formulae.

Numerical Methods II: Numerical Differentiation, Numerical integration: Trapezoidal rule

4. and Simpson–s 1/3rd and 3/8 rules. Ordinary differential equations: Taylor–s series, Euler
and modified Euler–s methods. Runge-Kutta method of fourth order for solving first and
second order equations. Milne–s predicator and corrector methods.

Basic Statistics: Measures of Central tendency: Moments, skewness and Kurtosis -

5. Probability distributions: Binomial, Poisson and Normal - evaluation of statistical parameters
for these three distributions, Correlation and regression – Rank correlation.
 [CSC303] Data Structure and Algorithms
Unit Topics

Definition & characteristics of algorithms, structures. Difficulties in estimating exact execution time of
algorithms. Concept of complexity of program. Asymptotic notations: Big-Oh, theta, Omega-
Definitions and examples, Determination of time and space complexity of simple algorithms without
I recursion. Representing a function in asymptotic notations viz 5n2 -6n=θ(n2 ) Arrays: Array as storage
element, Row major & column major form of arrays, computation of address of elements of n
dimensional array.

Arrays as storage elements for representing polynomial of one or more degrees for addition &
multiplication, sparse matrices for transposing & multiplication, stack, queue, dequeue, circular queue
for insertion and deletion with condition for over and underflow, transposition of sparse matrices with
algorithms of varying complexity (Includes algorithms for operations as mentioned). Evaluation of
II Expression: Concept of precedence and associativity in expressions, difficulties in dealing with infix
expressions, Resolving precedence of operators and association of operands, postfix & prefix
expressions, conversion of expression from one form to other form using stack (with & without
parenthesis), Evaluation of expression in infix, postfix & prefix forms using stack. Recursion.

Linear linked lists: singly, doubly and circularly connected linear linked listsinsertion, deletion at/ from
beginning and any point in ordered or unordered lists. Comparison of arrays and linked lists as data
structures. Linked implementation of stack, queue and dequeue. Algorithms for of insertion, deletion and
III traversal of stack, queue, dequeue implemented using linked structures. Polynomial representation using
linked lists for addition, Concepts of Head Node in linked lists. Searching: Sequential and binary search

Non-Linear Structures: Trees definition, characteristics concept of child, sibling, parent child
relationship etc, binary tree: different types of binary trees based on distribution of nodes, binary tree
(threaded and unthreaded) as data structure, Class: III Sem. B.Tech. Evaluation Branch: Computer
Science and Engineering Schedule per Week Lectures: 3 Examination Time = Three (3) Hours Maximum
Marks = 100 [Mid-term (20) & End-term (80)] B.Tech. CS Syllabus as submitted to 15th Academic
IV council Date- 07/10/2015 3 insertion, deletion and traversal of binary trees, constructing binary tree from
traversal results. Threaded binary Tree. Time complexity of insertion, deletion and traversal in threaded
and ordinary binary trees. AVL tree: Concept of balanced trees, balance factor in AVL trees, insertion
into and deletion from AVL tree, balancing AVL tree after insertion and deletion. Application of trees for
representation of sets.

Graphs: Definition, Relation between tree & graph, directed and undirected graph, representation of
graphs using adjacency matrix and list. Depth first and breadth first traversal of graphs, finding connected
V components and spanning tree. Single source single destination shortest path algorithms. Sorting:
Insertion, quick, heap, topological and bubble sorting algorithms for different characteristics of input
data. Comparison of sorting algorithms in term of time complexity.
[CSC302] Computer Organization and Architecture

Unit Topics

Introduction to Computer Architecture and Organization. Von Neuman

Architecture, Flynn Classification. Register Transfer and Micro
operations: Register transfer language, Arithmetic Micro-operations,
I Logic Micro-operations, Shift Micro-operations, Bus and memory
transfers. Computer Organization and Design: Instruction cycle,
computer registers, common bus system, computer instructions,
addressing modes, design of a basic computer

Central Processing Unit: General register organization, stack

organization, Instruction formats, Data transfer and manipulation,
II program control. RISC, CISC characteristics. Pipeline and Vector
processing: Pipeline structure, speedup, efficiency, throughput and
bottlenecks. Arithmetic pipeline and Instruction pipeline

Computer Arithmetic: Adder, Ripple carry Adder, carry look Ahead

Adder, Multiplication: Add and Shift, Array multiplier and Booth
III Multiplier, Division: restoring and Non-restoring Techniques. Floating
Point Arithmetic: Floating point representation, Add, Subtract,
Multiplication, Division.

Memory Organization: RAM, ROM, Memory Hierarchy, Organization,

IV Associative memory, Cache memory, and Virtual memory: Paging and
Segmentation.

Input-Output Organization: Input-Output Interface, Modes of Transfer,

V Priority Interrupt, DMA, IOP processor.
[CSC301] Object Oriented Programming

Unit Topics

Introduction: Object Oriented Programming and Concepts, Features: Abstraction,

Encapsulation, Information Hiding, Access Modifiers (public, protected, private),
Polymorphism, Overloading; Inheritance and container classes, Overriding Methods,
I
Abstract Classes.

Class: Class definition and objects creation, Accessing Class Members: Variables and
Methods, Default arguments, Constructor & Destructors. Inline function, Friend
II function. Dynamic Memory Allocation, Static Class and Static Function, this Pointer.

Polymorphism: Types of Polymorphism, function overloading and operator

overloading, Restrictions on Operator Overloading, Operator Functions as Class
Members versus Friend Functions, Overloading operators: Unary Operators, Binary
III
Operators.

Inheritance: Introduction, Types of Inheritance, Base Classes and Derived Classes,

Abstract base classes, Use of virtual functions in classes, Pointer to derived class, Use
IV of Protected and Private Inheritance and Member Functions, Overriding Base Class
Members in a Derived Class.

File handling: Introduction, Creating sequential files, reading and writing files, opening
and closing of file, detecting the end of file,
V Exception handling: Try-Catch-Throw Mechanism, Templates: Function Templates,
Class Template.
Discrete Mathematical Structure

Unit Topics
Operations and Laws of Sets, Cartesian Products, Binary Relation,
Partial Ordering Relation, Equivalence Relation, Image of a Set, Sum
and Product of Functions, Bijective functions, Inverse and Composite
Function, Size of a Set, Finite and infinite Sets, Countable and
uncountable Sets, Cantor's diagonal argument and The Power Set
I theorem, Schroeder-Bernstein theorem.
Principles of Mathematical Induction: The Well-Ordering Principle,
Recursive definition, The Division algorithm: Prime Numbers, The
Greatest Common Divisor: Euclidean Algorithm, The Fundamental
Theorem of Arithmetic.

Basic counting techniques-inclusion and exclusion, pigeon-hole

II principle, permutation and combination.

Syntax, Semantics, Validity and Satisfiability, Basic Connectives and

Truth Tables, Logical Equivalence: The Laws of Logic, Logical
Implication, Rules of Inference, The use of Quantifiers. Proof
III Techniques: Some Terminology, Proof Methods and Strategies,
Forward Proof, Proof by Contradiction, Proof by Contraposition, Proof
of Necessity and Sufficiency.

Algebraic Structures with one Binary Operation, Semi Groups,

Monoids, Groups, Congruence Relation and Quotient Structures, Free
and Cyclic Monoids and Groups, Permutation Groups, Substructures,
Normal Subgroups, Algebraic Structures with two Binary Operation,
IV
Rings, Integral Domain and Fields. Boolean Algebra and Boolean
Ring, Identities of Boolean Algebra, Duality, Representation of
Boolean Function, Disjunctive and Conjunctive Normal Form

Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub

Graph, Isomorphism, Eulerian and Hamiltonian Walks, Graph
Colouring, Colouring maps and Planar Graphs, Colouring Vertices,
Colouring Edges, List Colouring, Perfect Graph, definition properties
V
and Example, rooted trees, trees and sorting, weighted trees and prefix
codes, Bi-connected component and Articulation Points, Shortest
distances.
System Programming

Unit Topics

Overview: Comparison of machine language, assembly language and high level languages,
External and internal representation of instructions and data. Data allocation structures, search
structures and addressing modes. Activities and system software for program generation,
I translation and execution. Editors for source code and Object code/executable code files

Assemblers: Assembly language specification. Machine dependent and independent features of

assembler.Classification of assemblers. Pass structure of assemblers (problem and associated for
II IBM-PC.

Loader and Linkers: Functions and classification. Machine dependent and independent features of
loaders, Design of bootstrap, absolute and relocatable loaders, Design of linker. Case study of MS-
III DOS linker.

Macro processors: Macro definition, call and expansion. Macro processor algorithm and data
structure.Machine independent features (parameters, unique labels, conditional expansion, nesting
and recursion).Pass structure and design of microprocessor and macro assembler, Case study of
IV
MASM macro processor.

High level language processor: HLL specification: Grammars and parse trees, expression and
precedence. Lexical analysis: Classification of tokens, scanning methods, character recognition,
lexical ambiguity. Syntactic analysis: Operator precedence parsing, recursive descent parsing.
Symbol Table Management: Data structure for symbol table, basing functions for symbols,
V
overflow technique, block structure in symbol table

saqlain