Information Technology
BT-401
(Mathematics-3)
IT-402
COmputer Architecture
IT-403
(Analysis and Design of Algorithm )
IT-404
(Analog & Digital Comm. )
IT-405
(Data Base Management System)
Syllabus
- Numerical Methods – 1: Solution of polynomial and transcendental equations – Bisection method, Newton-Raphson method and 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 and Lagrange’s formulae.
- Numerical Methods – 2: (6 hours): Numerical Differentiation, Numerical integration: Trapezoidal rule and 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, and Relaxation method.,
- Numerical Methods – 3: (10 hours): 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.
- Transform 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.
- Concept of Probability: Probability Mass function, Probability Density Function, Discrete Distribution: Binomial, Poisson’s, Continuous Distribution: Normal Distribution, Exponential Distribution.
Syllabus
- Unit-I Computer architecture and organization, computer generations, von Neumann model, CPU organization, CPU organization, Register organization, Various CPU register, Register Transfer, Bus and Memory Transfers, Arithmetic, Logic and Shift micro-operations, Arithmetic logic shift unit.
- Unit–II The arithmetic and logic unit, Fixed-Point representation: integer representation, sign magnitude, 1’s and 2’s complement and range, Integer arithmetic: negation, addition and subtraction, multiplication, division, Floating-Point representation, Floating-Point arithmetic, Hardwired micro-programmed control unit, Control memory, Micro-program sequence.
- Unit–III Central Progressing Unit (CPU), Stack Organization, Memory Stack, Reverse Polish Notation. Instruction Formats, Zero, One, Two, Three- Address Instructions, RISC Instructions and CISC Characteristics, Addressing Modes, Modes of Transfer, Priority Interrupt, Daisy Chaining, DMA, Input-Output Processor (IOP).
- Unit–IV Computer memory system, Memory hierarchy, main memory: RAM, ROM chip, auxiliary and associative memory, Cache memory: associative mapping, direct mapping, set associative mapping, write policy, cache performance, Virtual memory: address space, memory space, address mapping, paging and segmentation, TLB, page fault, effective access time, replacement algorithm.
- Unit–V Parallel Processing, Pipelining General Consideration, Arithmetic Pipeline, and Instruction Pipeline, Vector Operations, Matrix Multiplication, and Memory Interleaving, Multiprocessors, Characteristics of Multiprocessors.
Syllabus
- Unit-I Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and heap sort. Introduction to divide and conquer technique, analysis, design and comparison of various algorithms based on this technique, example binary search, merge sort, quick sort, strassen’s matrix multiplication.
- Unit-II Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman coding, minimum spanning trees, knapsack problem, job sequencing with deadlines, single source shortest path algorithm, etc.
- Unit-III Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage graph, reliability design, Floyd-Warshall algorithm, etc.
- Unit-IV Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph coloring problem etc. Introduction to branch & bound method, examples of branch and bound method like traveling salesman problem etc. Meaning of lower bound theory and its use in solving algebraic problem, introduction to parallel algorithms.
- Unit-V Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP-completeness.
Syllabus
- Unit-I Signals and Systems: Block diagram of a communication system, signal-definition, types of signals continuous, discrete, deterministic, non-deterministic, periodic, non-periodic, energy, power, analog and digital signals. Electromagnetic Spectra, Standard signals- DC, sinusoidal, unit step, ramp, signum, rectangular pulse, impulse(delta) signal. System definition, classification of systems, linear, nonlinear, time variant, time invariant, causal, non causal, stable and unstable systems. Fourier transforms: Time domain and frequency domain representation of signal, Fourier Transform and its properties, conditions for existence, Transform of Gate, unit step, constant, impulse, sine and cosine wave. Shifting property of delta function, convolution, time and frequency convolution theorems.
- Unit-II Amplitude modulation: Modulation, need of modulation, types of modulation techniques, amplitude modulation (DSB-FC), modulation index, frequency spectrum of AM wave, linear and over modulation, power relation in AM, transmission efficiency, modulation by a complex signal, bandwidth of AM, AM modulators, square law and switching modulator, advantages and disadvantages of AM. Demodulation of AM: Suppressed carrier amplitude modulation systems, DSB-SC, SSB-SC, VSB-SC systems, comparison of various amplitude modulation systems. Demodulation of AM, square law and envelope detector, synchronous detection of AM, Low and high power AM transmitters, AM receivers, TRF and superheterodyne receivers, sensitivity, selectivity and fidelity of receivers.
- Unit-III Angle modulation: Introduction and types of angle modulation, frequency modulation, frequency deviation, modulation index, deviation ratio, bandwidth requirement of FM wave, types of FM. Phase modulation, difference between FM and PM, Direct and indirect method of FM generation, FM demodulators- slope detector, Foster seeley discriminator, ratio detector. Introduction to pulse modulation systems.
- Unit-IV Sampling of signal, sampling theorem for low pass and Band pass signal, Pulse amplitude modulation (PAM), Time division, multiplexing (TDM). Channel Bandwidth for PAM-TDM signal Type of sampling instantaneous, Natural and flat top, Aperture effect, Introduction to pulse position and pulse duration modulations, Digital signal, Quantization, Quantization error, Pulse code modulation, signal to noise ratio, Companding, Data rate and Baud rate, Bit rate, multiplexed PCM signal, Differential PCM (DPCM), Delta Modulation (DM) and Adaptive Delta Modulation (ADM), comparison of various systems.
- Unit-V Digital modulations techniques, Generation, detection, equation and Bandwidth of amplitude shift keying (ASK) Binary Phase Shift keying (BPSK), Differential phase shift keying (DPSK), offset and non offset quadrature phase shift keying (QPSK), M-Ary PSK, Binary frequency Shift Keying (BFSK), M-Ary FSK Quadrature Amplitude modulation (QAM).
Syllabus
- Introduction to Operating Systems
- File Systems
- CPU Scheduling
Memory Management - Input / Output
Concurrent Processes - Computer Networking
Computer Security Basics - Introduction to Network