IT 4th Semester Syllabus

Unit 1Numerical Methods – 1

Solution of polynomial and transcendental equations · Bisection method · Newton-Raphson method · Regula-Falsi method · Finite differences · Relation between operators · Interpolation using Newton’s forward and backward difference formulae · Interpolation with unequal intervals · Newton’s divided difference · Lagrange’s formulae

Unit 2Numerical Methods – 2

Numerical Differentiation · Numerical integration · Trapezoidal rule · Simpson’s 1/3rd and 3/8 rules · Solution of Simultaneous Linear Algebraic Equations by Gauss’s Elimination · Gauss’s Jordan · Crout’s methods · Jacobi’s · Gauss-Seidal · Relaxation method

Unit 3Numerical Methods – 3

Ordinary differential equations · Taylor’s series · Euler and modified Euler’s methods · RungeKutta method of fourth order for solving first and second order equations · Milne’s and Adam’s predicator-corrector methods · Partial differential equations · Finite difference solution two dimensional Laplace equation and Poission equation · Implicit and explicit methods for one dimensional heat equation · Bender-Schmidt and Crank-Nicholson methods · Finite difference explicit method for wave equation

Unit 4Transform Calculus

Laplace Transform · Properties of Laplace Transform · Laplace transform of periodic functions · Finding inverse Laplace transform by different methods · convolution theorem · Evaluation of integrals by Laplace transform · solving ODEs by Laplace Transform method · Fourier transforms

Unit 5Concept of Probability

Probability Mass function · Probability Density Function · Discrete Distribution: Binomial · Poisson’s · Continuous Distribution: Normal Distribution · Exponential Distribution

Unit 1Computer Architecture and Organization

Computer architecture and organization · Computer generations · Von Neumann model · CPU organization · Register organization · Various CPU registers · Register Transfer · Bus and Memory Transfers · Arithmetic, Logic and Shift micro-operations · Arithmetic logic shift unit

Unit 2Arithmetic and Logic Unit and Data Representation

Arithmetic and logic unit · Fixed-point representation: integer representation · Sign magnitude representation · 1’s complement representation · 2’s complement representation and range · Integer arithmetic: negation · Integer arithmetic: addition · Integer arithmetic: subtraction · Integer arithmetic: multiplication · Integer arithmetic: division · Floating-point representation · Floating-point arithmetic · Hardwired control unit · Micro-programmed control unit · Control memory · Microprogram sequence

Unit 3Central Processing Unit and Instruction Set

Central Processing Unit (CPU) · Stack organization · Memory stack · Reverse Polish Notation · Instruction formats · Zero-address instructions · One-address instructions · Two-address instructions · Three-address instructions · RISC instructions · CISC characteristics · Addressing modes · Modes of transfer · Priority interrupt · Daisy chaining · Direct Memory Access (DMA) · Input-Output Processor (IOP)

Unit 4Memory System and Virtual Memory

Computer memory system · Memory hierarchy · Main memory: RAM · Main memory: ROM · Auxiliary memory · Associative memory · Cache memory: associative mapping · Cache memory: direct mapping · Cache memory: set-associative mapping · Cache memory: write policy · Cache performance · Virtual memory: address space · Virtual memory: memory space · Virtual memory: address mapping · Paging · Segmentation · Translation Lookaside Buffer (TLB) · Page fault · Effective access time · Replacement algorithms

Unit 5Parallel Processing and Pipelining

Parallel processing · Pipelining: general considerations · Arithmetic pipeline · Instruction pipeline · Vector operations · Matrix multiplication · Memory interleaving · Multiprocessors · Characteristics of multiprocessors

Unit 1Algorithms, Design and Analysis

Algorithms · Designing algorithms · Analyzing algorithms · Asymptotic notations · Heap and heap sort · Divide and conquer technique · Binary search · Merge sort · Quick sort · Strassen’s matrix multiplication

Unit 2Greedy Algorithms

Greedy strategy · Optimal merge patterns · Huffman coding · Minimum spanning trees · Knapsack problem · Job sequencing with deadlines · Single source shortest path algorithm

Unit 3Dynamic Programming

Dynamic programming · 0/1 knapsack problem · Multistage graph · Reliability design · Floyd‑Warshall algorithm

Unit 4Backtracking and Branch & Bound

Backtracking concept · 8‑queen’s problem · Hamiltonian cycle · Graph coloring problem · Branch and bound method · Traveling salesman problem · Lower bound theory · Parallel algorithms

Unit 5Tree Data Structures and NP‑Completeness

Binary search trees · Height balanced trees · 2‑3 trees · B‑trees · Search and traversal techniques for trees and graphs (in‑order, pre‑order, post‑order, DFS, BFS) · NP‑completeness

Unit 1Signals and Systems

Block diagram of a communication system · Signal definition and classification (continuous, discrete, deterministic, non‑deterministic, periodic, non‑periodic, energy, power, analog, digital) · Electromagnetic spectra · Standard signals: DC, sinusoidal, unit‑step, ramp, signum, rectangular pulse, impulse ($\delta$) signal · System definition and classification (linear, non‑linear, time‑variant, time‑invariant, causal, non‑causal, stable, unstable) · Fourier Transform: time‑domain and frequency‑domain representation of signals · Fourier Transform properties and existence conditions · Transforms of gate, unit‑step, constant, impulse, sine and cosine waves · Shifting property of the delta function · Convolution and the time‑ and frequency‑domain convolution theorems

Unit 2Amplitude Modulation

Purpose of modulation and classification of amplitude modulation techniques · Double‑sideband full‑carrier (DSB‑FC) modulation and modulation index · Frequency spectrum of AM wave, linear versus over‑modulation · Power relations and transmission efficiency in AM · Modulation by a complex signal and bandwidth of AM · AM modulators: square‑law and switching modulators, advantages/disadvantages · Suppressed‑carrier AM systems (DSB‑SC, SSB‑SC, VSB‑SC) and comparative analysis · Demodulation techniques: square‑law detector, envelope detector, synchronous detection · Low‑power and high‑power AM transmitters · AM receivers: TRF and super‑heterodyne architectures · Receiver performance parameters: sensitivity, selectivity, fidelity

Unit 3Angle Modulation

Introduction to angle modulation and its categories · Frequency modulation (FM): frequency deviation, modulation index, deviation ratio, bandwidth requirement of FM wave · Types of FM · Phase modulation (PM) and differences between FM and PM · Direct and indirect methods of FM generation · FM demodulators: slope detector, Foster‑Seeley discriminator, ratio detector · Overview of pulse modulation systems

Unit 4Sampling and Pulse Modulation

Sampling of signals and sampling theorem for low‑pass and band‑pass signals · Pulse amplitude modulation (PAM) and time‑division multiplexing (TDM) · Channel bandwidth considerations for PAM‑TDM signals · Types of sampling: instantaneous, natural, flat‑top, aperture effect · Pulse‑position modulation and pulse‑duration modulation · Digital signal concepts: quantization, quantization error · Pulse code modulation (PCM) and signal‑to‑noise ratio · Companding techniques · Data rate, baud rate, and bit rate calculations · Multiplexed PCM signals · Differential PCM (DPCM), delta modulation (DM) and adaptive delta modulation (ADM) · Comparative analysis of various pulse‑code systems

Unit 5Digital Modulation Techniques

Amplitude shift keying (ASK): generation, detection, equation, bandwidth · Binary phase shift keying (BPSK) · Differential phase shift keying (DPSK) · Quadrature phase shift keying (QPSK): offset and non‑offset variants · M‑ary phase shift keying (M‑ary PSK) · Binary frequency shift keying (BFSK) · M‑ary frequency shift keying (M‑ary FSK) · Quadrature amplitude modulation (QAM)

Unit 1Basic Concepts

Introduction to DBMS · File system versus DBMS comparison · Advantages of database systems · Database system architecture · Data models, schemas and instances · Data independence · Functions of DBA and designer · Entities and attributes, entity types, key attributes · Relationships and definition of the E‑R diagram

Unit 2Relational Model

Structure of relational databases · Domains and relations · Relational algebra – fundamental operators and syntax · Relational algebra queries · Entity‑Relationship model basics and design process · Constraints, keys, design issues · E‑R diagrams, weak entity sets · Extended E‑R features – generalization, specialization, aggregation

Unit 3SQL

Data Definition Language (DDL) in SQL · Update statements and views · Data storage definitions · Data retrieval queries · Query processing and optimization overview · Measures of query cost, selection, sorting, join operations · Transformation of relational expressions · Estimating statistics of expression results · Evaluation plans · Case studies of ORACLE and DB2

Unit 4Relational Database Design

Functional dependencies – definition, trivial and non‑trivial FD · Closure of FD set, irreducible set of FD · Normalization – 1NF, 2NF, 3NF · Decomposition preserving dependencies, lossless join · Boyce‑Codd Normal Form (BCNF) · Multivalued dependency, Fourth Normal Form (4NF) · Join dependency, Fifth Normal Form (5NF)

Unit 5Transaction Management and Concurrency Control

Transaction concepts, processing and recovery · Concurrency control – lock management · Specialized locking techniques · Concurrency control without locking · Protection and security aspects

Unit 6Distributed Databases and Big Data

Distributed database concepts · Basic concepts of object‑oriented database systems · Overview of Big Data

Unit 1Introduction to MATLAB/SciLab

Installing MATLAB/SciLab under Windows/Linux · Basics of MATLAB programming · Data types in MATLAB/Scilab · Creating variables, comments and multiline comments · Array operations in MATLAB/Scilab · Loops and execution control statements · In‑built mathematical functions · Working with files: scripts and functions · Plotting and program output · Overview of various toolboxes · Introduction to MATLAB Simulink

Unit 2Introduction to Web Design

HTML introduction and page structure · Elements, tags and attributes · Paragraphs and headings · Line breaks and horizontal rules · Lists (ordered, unordered, definition) · Formatting and color codes · Font styling and text links · Email links · Images and image links · Forms and input controls · Tables and frames · Comments in HTML · Embedding music and video codes · Divisions (DIV) and page layout · DHTML: Cascading Style Sheets (CSS) introduction · Types of CSS (inline, internal, external) · Selectors (tag, class, id) · CSS background and color properties · CSS text properties · CSS font properties · CSS border properties · CSS padding properties

Unit 1Introduction to LINUX Operating System

Overview of popular Linux distributions · Hardware requirements for Linux · Installation of Linux distributions · Internal and external commands · Command structure · General‑purpose utilities: cal, date, echo, printf, bc, script, passwd, PATH, who, uname, tty, stty, pwd, cd, mkdir, rmdir

Unit 2Handling Files and System Administration

File system navigation and management commands: cat, cp, rm, mv, more, file, ls, wc, pg, cmp, comm, diff, gzip, tar, zip, df, du, mount, umount, chmod · VI editor and security by file permissions (chmod, find, locate) · Compiling C/C++ files and file processing utilities (awk, sed, gcc, sh) · Networking commands: ping, telnet, ftp, arp, rlogin, make, apt‑get · Accessing remote servers and files · System administration: Linux configuration, connecting to remote machines, adding and removing users

Unit 3Programming in Linux (Bash Shell Scripting)

Bash shell scripting fundamentals · Interactive scripts and shell variables · Positional parameters and command‑line arguments · Arithmetic operations in shell scripts · Script control flow: if‑else, nested if, case statements · File and string tests · Loop control structures: for, while, until, break, continue · Logical operators · Script termination, exit status, sleep and wait · Debugging techniques and executing multiple scripts

Unit 4R Introduction

Installation of R · R reserved words, variables and constants · R operators and control structures · R programming constructs: for loop, while loop, break & next, repeat loop · R functions: definition, return values, environment and scope · Recursive functions and switch statement

Unit 5R Data Structures and Visualization

R vectors, matrices, lists, and data frames · Object‑oriented features: S3 class, S4 class, reference class, inheritance · Graphical methods: bar plot, histogram, pie chart, box plot, strip chart

Unit 6R Data Structure

R Vectors · R Matrix · R List · R Data Frame · R Object and Class · Object and Class · R S3 Class · R S4 Class · R Reference Class · R Inheritance · R Graphs and Charts: Bar plot · Histogram · Pie Chart · Box plot · Strip chart