Tuesday, March 4, 2014

Engineering Mathematics III

Propellerads

Syllabus:


MODULE 1 Fourier series ( 12 hours)

Dirichlet conditions – Fourier series with period 2 π and 2l – Half range sine and cosine series –
Harmonic Analysis – r.m.s Value

MODULE 2 Fourier Transform ( 12 hours)

Statement of Fourier integral theorem – Fourier transforms – derivative of transforms- convolution
theorem (no proof) – Parsevals identity

MODULE 3 Partial differential equations ( 12 hours)

Formation by eliminating arbitrary constants and arbitrary functions – solution of Lagrange’s equation –
Charpits method –solution of Homogeneous partical differential equations with constant coefficients.

MODULE 4 Probability distribution ( 12 hours)

Concept of random variable , probability distribution – Bernoulli’s trial – Discrete distribution – Binomial
distribution – its mean and variance- fitting of Binominal distribution – Poisson distribution as a limiting
case of Binominal distribution – its mean and variance – fitting of Poisson distribution – continuous
distribution- Uniform distribution – exponential distribution – its mean and variance – Normal
distribution – Standard normal curve- its properties.

MODULE 5 Testing of hypothesis ( 12 hours)

Populations and Samples – Hypothesis – level of significance – type I and type II error – Large samples
tests – test of significance for single proportion, difference of proportion, single mean, difference of mean
– chi –square test for variance- F test for equality of variances for small samples.

Note :  Please login with 4shared account to download.

Study Materials:

MODULE 1 :-

TEXT 1

TEXT 2

TEXT 3

MODULE 2 :-

TEXT 1

Mathematical equations

Integral Equations


Sunday, January 19, 2014

4th semester Microprocessor Systems study material

Propellerads




SYLLABUS


CS010405: Microprocessor Systems

Teaching scheme Credits: 4

Module I (10 hours)

Architecture of 8085 – Registers. Instruction set of 8085 - Instruction Types – Arithmetic – Logic data transfer, Branch, Stack, I/O and Machine Control instructions - Addressing Modes - Direct and Indirect Addressing - Immediate Addressing - Implicit Addressing.

Module II (12 hours)

Subroutines - Stack Operations - Call Return sequence- Programming Examples. Timing and control unit – The fetch operation – Machine cycle and T- State instruction and data flow. Address space partitioning - Memory mapped I/O - I/O mapped I/O.

Module III (14 hours)

Interrupts of 8085 - Hardware & Software Interrupts – Enabling, Disabling and masking of interrupts – Polling – HALT & HOLD states – Programmable interrupt controller – 8259.

Module IV (12 hours)

Data transfer schemes - Programmed data transfer - synchronous and asynchronous transfer - interrupt driven data transfer – DMA data transfer. Study of Interfacing ICs – 8257,8255 programmable peripheral interface (compare it with 8155).

Module V (12 hours)

Programmable interval timer 8253, 8251 -,Interfacing Keyboard and display devices, Hardware and Software approach – USART 8251. (interfacing chips functions and internal block diagram only).

You can download MG University BTech Microprocessor systems free notes from here.

DOWNLOAD

4th semester Theory of computation study material

Propellerads



                                                                         SYLLABUS

CS 010 406: Theory of Computation

Teaching scheme Credits: 4

Module I (10 hours)

Proving techniques-Mathematical induction -Diagonalization principle –Pigeonhole principle- Functions – Primitive recursive and partial recursive functions – Computable and non computable functions—-Formal representation of languages – Chomsky Classification.

Module II (13 hours)

Introduction to Automata theory – Definition of Automation – Finite Automata –Language acceptability by Finite Automata –Deterministic and Nondeterministic finite automation - Regular Expressions – Finite Automation with ∈-Transitions –Conversion of NFA to DFA - Minimisation of DFA-DFA to Regular Expressions conversion-pumping lemma for regular languages – Applications of finite automata-NFA with o/p ( moore /mealy).

Module III (12 hours)

Context Free Grammar –Simplification of CFG-Normal forms-Chomsky Normal form and Greibach Normal form- pumping lemma for Context free languages- Applications of PDA - Pushdown Automata – Formal definition – Language acceptability by PDA through empty stack and final state – Deterministic and nondeterministic PDA – designing of PDA.

Module IV (13 hours)

Turing Machines – Formal definition – Language acceptability by TM –TM as acceptors, Transducers - designing of TM- Two way infinite TM- Multi tape TM - Universal Turing Machines- Church’s Thesis-Godelization.- - Time complexity of TM - Halting Problem - Rice theorem - Post correspondence problem-Linear Bounded Automata.

Module V (12 hours)

Complexity classes- Tractable problems– Class P –P Complete-Reduction problem - Context grammar nonempty-Intractable problems- Class NP – NP Complete- Cooks theorem-Reduction problems-SAT-Clique-Hamiltonian-TSP-Vertex Cover-NP Hard problems.


You can download MG University BTech Theory of computation free notes from here.
 

Reference Books:-

1. Theory of Computer Science, K.L.P. Mishra, N. Chandrashekharan ,-  DOWNLOAD

2.Introduction to Automata
Theory Languages & Computation , John Hopcroft, Rajeev Motwani & Jeffry Ullman:

DOWNLOAD

4th semester SIGNALS AND COMMUNICATION SYSTEMS study material

Propellerads









SYLLABUS

CS010 404 SIGNALS AND COMMUNICATION SYSTEMS

Teaching scheme Credits: 4

Module 1 (15 hrs):-

Introduction to Signals:- Continuous Time Signals- Discrete Time Signals- Signal Operations- Properties of Signals(Periodicity and Symmetry), Frequency Domain Representation of Continuous Time Signals-Continuous Time Fourier Series(CTFS)- Definition- properties- Examples, Continuous Time Fourier Transform(CTFT)- Definition- Properties – Examples- Concept of Frequency Spectrum, Sampling- The Sampling Theorem(proof not required)- Quantisation.

Module 2 (12 hrs):-

Communication Systems:- Architecture of a Typical Communication System – Basic problems in Signal Transmission - Noise – Types of Noise- Internal and External Noise, Cross Talk- Typical parameters of Communication Systems- Signal propagation Delay, Signal to Noise Ratio, Attenuation, Bandwidth Communication Channels:- Twisted Pairs- Coaxial Cables- Fiber Optic Cables- Capacity of a Noisy Channel- Shannon Hartley Theorem.

Module 3: (15 Hrs):-

Modulation- Need for Modulation

Analog Modulation- Types of analog modulation- Amplitude Modulation, Frequency modulation, Phase modulation, Pulse Modulation Schemes- Pulse Amplitude modulation(PAM), Pulse Width Modulation(PWM), Pulse Position Modulation(PPM), Pulse Code Modulation(PCM),Delta modulation, Sample problems based on different modulation methods.

Digital modulation;- Amplitude Shift Keying(ASK), Frequency Shift keying(FSK),Phase Shift Keying(PSK), Quadrature Amplitude modulation (QAM), Differential Phase Shift Keying(DPSK).

Module 4: (8 Hrs):-

Multiplexing:-Time Division Multiplexing(TDM)- Frequency Division Multiplexing(FDM)- Wavelength Division multiplexing(WDM).
Switching:- Circuit, Packet and Message Switching Schemes, Case Study:- SONET( Basic ideas only)- Datagrams and virtual Circuits.
Digital Transmission:- Analog to Digital Converter(ADC), Serial and parallel Transmission- Simplex, Half Duplex and Full Duplex Transmissions.

Module 5: (10 Hrs):-

Error Correction and Detection;- Line Coding Schemes- Block Coding- Convolution Coding- Hamming Codes
Transmission Codes:- Different Character Codes- ASCII, EBCDIC, Baudot Code, Bar Coding, Parity Coding.

You can download MG University BTech signals and communication system free notes from here.

Reference books:-

1. Data Communication and Networking , Behrouz Forouzan - DOWNLOAD

4th semester Data Structures and Algorithms study material

Propellerads


SYLLABUS

CS010 403: Data Structures and Algorithms

Teaching scheme Credits: 4


Module I (10 hours)

Principles of programming – System Life Cycle - Performance Analysis and Measurements- Time and Space complexity-Complexity calculation of simple algorithms. Hashing:- Static Hashing-Hash Tables-Different Hash Functions-Mid Square - Division-Folding-Digit Analysis, Collision-Collision Resolution Techniques.

Module II (12hours)

Study of basic data structures – Arrays- Structures-Sparse matrix – Stacks – Queues- Circular queues- Priority queues - Dqueues. Evaluation of expressions – Polynomial representation using arrays.

Module III (12hours)

Linked Lists - Linked stacks and queues - Doubly linked lists – Polynomial representation using linked lists, Garbage collection and Compaction.

Module IV (14 hours)

Trees - Binary Trees – Tree Traversal – Inorder - Preorder and Postorder, Search trees - AVL Trees, height balanced trees, Multiway search Trees- B Trees-B+ Trees. Graphs – Depth first and breadth first search.

Module V (12 hours)

Sorting methods: Selection sort, Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort, External sorting methods.

    You can download MG University BTech CSE 4th semester DataStructure free notes from here.