RTU Computer Science Engineering Syllabus 4th Sem 2017
Microprocessor And Interfaces
Introduction to Microprocessors, microcontroller; 8085 Microprocessor Architecture, pin description, Bus concept and organization; concept of multiplexing and demultiplexing of buses; concept of static and dynamic RAM, type of ROM, memory map.
Software architecture registers and signals, Classification of instruction, Instruction set, addressing modes, Assembly Language Programming and Debugging, Programming Technique, instruction Format and timing.
Advance Assembly Language Programming, Counter and time delay; types of Interrupt and their uses, RST instructions and their uses, 8259 programmable interrupt controller; Macros, subroutine; Stack- implementation and uses with examples; Memory interfacing.
8085 Microprocessor interfacing:, 8255 Programmable Peripheral Interface, 8254 programmable interval timer, interfacing of Input/output device, 8279 Key board/Display interface.
Microprocessor Application: Interfacing scanned multiplexed display and liquid crystal display, Interfacing and Matrix Keyboard, MPU Design; USART 8251, RS232C and RS422A, Parallel interface- Centronics and IEEE 488.
Reference Books :
- Microprocessor architecture, programming, and applications with the 8085 By Ramesh S. Gaonkar
- Introduction to Microprocessor By Aditya P. Mathur, TMH
- Microprocessor & Interfaceing By Douglas V. Hall, TMH
- Microprocessor & Peripheral By A.K.Ray, K.M. Bhurchandi, TMH
Discrete Mathematical Structures
Sets: Definition and types, Set operations, Partition of set, Cardinality (Inclusion- Exclusion & Addition Principles), Recursive definition of set.
Functions: Concept, Some Special Functions (Polynomial, Exponential & Logarithmic, Abslute Value, Floor & Ceiling, Mod & Div Functions), Properties of Functions, Cardinality of Infinite Set, Countable & Uncountable Sets, The Pigeonhole & Generalized Pigeonhole Principles, Composition of Functions.
Relations: Boolean Matrices, Binary Relation, Adjacency Matrix of Relation, Properties of Relations, Operations on Relations, The Connectivity Relations, Transitive Closure- Warshall’s Algorithm, Equivalence relations- Congruence Relations, Equivalence Class, Number of Partitions of a Finite Set, Partial & Total Orderings.
Proof Methods: Vacuous, Trivial, Direct, Indirect by Contrapositive and Contradiction, Constructive & Non-constructive proof, Counter example. The Division Algorithm, Divisibilty Properties (Prime Numbers & Composite Numbers), Principle of Mathematical Induction, The Second Principle of Mathematical Induction, Fundamental Theorem of Arithmetic.
Algorithm Correctness: Partial Correctness, Loop Invariant. Testing the partial correctness of linear & binary search, bubble & selection sorting.
Graph Theory: Graphs – Directed, Undirected, Simple,. Adjacency & Incidence, Degre of Vertex, Subgraph, Complete graph, Cycle & Wheel Graph, Bipartite & Complete Bipartite Graph, Weighed Graph, Union of Simple Graphs. Complete Graphs.
Isomorphic Graphs, Path, Cycles & Circuits Euclerian & Hamiltonian Graphs. Planar Graph: Kuratowski’s Two Graphs, Euler’s Formula, Kuratowski’s Theorem.
Trees: Spanning trees- Kruskal’s Algo, Finding Spanning Tree using Depth First Search, Breadth First Search, Complexity of Graph, Minimal Spanning Tree.
Language of Logic: Proposition, Compound Proposition, Conjunction, Disjunction, Implication, Converse, Inverse & Contrpositive, Biconditional Statements, tautology, Contradiction & Contingency, Logical Equivalences, Quantifiers, Arguments.
Reference Books :
- Discrete Mathematics with Applications, Koshy, ELSEVIER
- Discrete Mathematical Structures By Lipschutz & Lipson, TMH
- Discrete Mathematical Structures, Kolman et.al, Pearson
Statistics And Probability Theory
Introduction & Discrete random variables Sample space, events, algebra of events, Bernoulli’s trials, Probability & Baye’s theorem. Random variable & their event space, probability generating function, expectations, moments, computations of mean time to failure, Bernoulli & Poisson processes.
Discrete & continuous distributions Probability distribution & probability densities: Binomial, Poisson, normal rectangular and exponential distribution & their PDF’s, moments and MGF’s for above distributions.
Correlation & Regression Correlation & regression: Linear regression, Rank correlation, Method of least squares Fitting of straight lines & second degree parabola. Linear regression and correlation analysis.
Queuing Theory Pure birth, pure death and birth-death processes. Mathematical models for M/M/1, M/M/N, M/M/S and M/M/S/N queues.
Discrete Parameter Markov chains: M/G/1 Queuing model, Discrete parameter birth-death process.
Reference Books :
1. Fundamental of Mathematical Statistics By C.Gupta and V.K. Kapoor, Sultanchand & sons.
2. Statistics and Probability Theory By Jain & Rawat ,CBC
3. Statistics and Probability Theory By Schaum’s, M.H.
System Analysis: Characteristics, Problems in system Development, System Level project Planning, System Development Life cycle (SDLC), computer system engineering & system analysis, modeling the architecture, system specification.
Software & its characteristics: Software Development, Process Model, Prescriptive model, The water fall model, Incremental Process Modes, Evolutionary process model, specialized process model.
Requirement Analysis: Requirement analysis tasks, Analysis principles, Software prototyping and specification data dictionary finite state machine (FSM) models. Structured Analysis: Data and control flow diagrams, control and process specification behavioral modeling, extension for data intensive applications.
Software Design: Design fundamentals, Effective modular design: Data architectural and procedural design, design documentation, coding – Programming style, Program quality, quantifying program quality, complete programming example
Object Oriented Analysis: Object oriented Analysis Modeling, Data modeling Object Oriented Design: OOD concepts and methods class and object definitions, refining operations, Class and object relationships, object modularization, Introduction to Unified Modeling Language.
PRINCIPLES OF COMMUNICATION
ANALOG MODULATION: Concept of frequency translation. Amplitude Modulation: Description of full AM, DSBSC, SSB and VSB in time and frequency domains, methods of generation & demodulation, frequency division multiplexing (FDM). Angle Modulation: Phase and frequency modulation. Descriptions of FM signal in time and frequency domains, methods of generation & demodulation, pre- emphasis & de- emphasis, PLL.
PULSE ANALOG MODULATION: Ideal sampling, Sampling theorem, aliasing, interpolation, natural and flat top sampling in time and frequency domains. Introduction to PAM, PWM, PPM modulation schemes. Time division multiplexing (TDM)
PCM & DELTA MODULATION SYSTEMS: Uniform and Non-uniform quantization. PCM and delta modulation, Signal to quantization noise ratio in PCM and delta modulation. DPCM, ADM, T1 Carrier System, Matched filter detection. Error probability in PCM system.
DIGITAL MODULATION: Baseband transmission: Line coding (RZ, NRZ), inter symbol interference (ISI), pulse shaping, Nyquist criterion for distortion free base band transmission, raised cosine spectrum. Pass band transmission: Geometric interpretation of signals, orthogonalization. ASK, PSK, FSK, QPSK and MSK modulation techniques, coherent detection and calculation of error probabilities.
SPREAD-SPECTRUM MODULATION: Introduction, Pseudo-Noise sequences, direct- sequence spread spectrum (DSSS) with coherent BPSK, processing gain, probability of error, frequency-hop spread spectrum (FHSS). Application of spread spectrum: CDMA.
Reference Books :
- Principles of communication systems By Taub Schilling, M.H.
- Fundamentals of communication systems By Proakis & Salehi, Pearson education
- Communication Systems by Simon Haykin, John Wiley
- Communication Systems (Analog and Digital) By R.P. Singh, S.D. Sapre, T.M.H.
- Modern Digital & Analog Communication By B.P. Lathi, Oxford Publications
Principles Of Programming Languages
Programming Language: Definition, History, Features. Issues in Language Design: Structure and Operation of computer, Programming Paradigms. Efficiency, Regularity. Issues in Language Translation: Syntax and Semantics.
Specifications and Implementation of Elementary and Structured Data Types. Type equivalence, checking and conversion. Vectors and Arrays, Lists, Structures, Sets, Files.
Sequence control with Expressions, Conditional Statements, Loops, Exception handling. Subprogram definition and activation, simple and recursive subprogram, subprogram environment.
Scope-Static and Dynamic, Block structures, Local Data and Shared Data, Parameters and Parameter Transmission. Local and Common Environments, Tasks and Shared Data.
Abstract Data type, information hiding, encapsulation, type definition. Static and Stack- Based Storage management. Fixed and Variable size heap storage management, Garbage Collection.
Reference Books :
- Programming languages: design and implementation, Terrence W. Pratt., Pearson
- Programming languages: concepts and constructs, Ravi Sethi, ISBN 9780201590654.
- Programming Language Pragmatics, Scott, ELSEVIER
1 Add the contents of memory locations XX00 &XX01 & place the result in memory location XX02.
2 Add the 16 bit numbers stored in memory location & store the result in another memory location.
3 Transfer a block of data from memory location XX00 to another memory location XX00 in forward & reverse order.
4 Write a program to Swap two blocks of data stored in memory.
5 Write a program to find the square of a number.
6 Write a main program & a conversion subroutine to convert Binary to its equivalent BCD.
7 Write a program to find largest & smallest number from a given array.
8 Write a program to Sort an array in ascending & descending order.
9 Write a program to multiply two 8 bit numbers whose result is 16 bit.
10 Write a program of division of two 8 bit numbers.
11 Generate square wave from SOD pin of 8085 & observe on CRO.
12 Write a program to perform traffic light control operation.
13 Write a program to control the speed of a motor.
1 Harmonic analysis of a square wave of modulated waveform Observe the amplitude modulated waveform and measures modulation index. Demodulation of the AM signal
2 To modulate a high frequency carrier with sinusoidal signal to obtain FM signal. Demodulation of the FM signal
3 To observe the following in a transmission line demonstrator kit :
i. The propagation of pulse in non-reflecting Transmission line.
ii. The effect of losses in Transmission line.
iii. The resonance characteristics of al half wavelength long x-mission line.
4 To study and observe the operation of a super heterodyne receiver
5 To modulate a pulse carrier with sinusoidal signal to obtain PWM signal and demodulate it.
6 To modulate a pulse carrier with sinusoidal signal to obtain PPM signal and demodulate it.
7 To observe pulse amplitude modulated waveform and its demodulation.
8 To observe the operation of a PCM encoder and decoder. To consider reason for using digital signal x-missions of analog signals.
9 Produce ASK signals, with and without carrier suppression. Examine the different processes required for demodulation in the two cases
10 To observe the FSK wave forms and demodulate the FSK signals based on the properties of (a) tuned circuits (b) on PI.L.
11 To study & observe the amplitude response of automatic gain controller (AGC).