B.Tech. SEMESTER II-
201: COMPUTATIONAL MATHEMATICS II
Probability and Statistics- Mean, Median, Mode, Standard deviation, Sample Space & Events, Conditional Probabilities and Expectations, Independent Events, Baye’s Formula, Discrete and Continuous Random Variables, Expectation of a Random Variable (Both Discrete & Continuous case), Independent Random Variables, Correlation and Regression, Distribution (Binomial, Poisson, Normal, Exponential, Uniform, Gamma, Geometric), Limit Theorem, Strong Law of large Numbers, Central Limit Theorem, Stochastic Processes, Markov (Chains & Processes), Poisson Process, Counting Processes, Birth & Death Process, Queuing Theory and application to Performance evaluation and modeling.
Transforms- Fourier Transforms, Laplace Transforms, Z Transform.
Numerical Methods- Errors, Solution of Algebraic and Transcendental equations:, Solution of Linear simultaneous Equations, Numerical Integration, Interpolation, Solution of Differential Equations, Solution of Partial Differential Equations.
202: COMPUTER ORGANIZATION
CPU Organization: Fundamentals, Fixed and Floating point numbers, Instruction Set formats, modes, types and programming. Datapath Design Fixed and Floating point arithmetic. ALU pipeline programming. Control Design. Hardware control, Microprogramed control and Pipeline control. Memory Organization: Technology, RAM and SAM. Multilevel Memory, Virtual memory and Cache memory.System Organization:Bus control, Arbitration, Program I/O, DMA and Interrupt I/O programming.
203: DATA COMMUNICATION
Introduction to communication systems, Data, signal and Transmission: Analog and Digital, Transmission modes, Transmission Impairments, Performance criteria of a communication system Goals of computer Network, Networks: Classification, Components and Topology, Layered architecture of a Network software, OSI and TCP/IP model. Encoding: Line coding and Block coding, Error detection codes, Modulation: Digital to Analog and Analog to Analog conversion techniques Bandwidth utilization techniques: Multiplexing: Frequency division, Time division and Wave division multiplexing, Spread spectrum concepts. Transmission Media: Guided and Unguided: Architecture, Transmission characteristics and application. Switched Networks: Circuit switching and Packet Switching, Circuit Switching principle and the Modems used in a Telephone network, Connection oriented and Connection-less approach in packet switching network. Information Theory: Measure of Information, Entropy, Discreate and Continious channel, Shannon’s encoding algorithms.
204: OPERATING SYSTEMS
Introduction- Role of OS, Evolution of OS, Structural Overview, Concept of Process, Threads, Process Control Block, Process Management & Scheduling, Hardware Requirements, Protection, Content switching, Privileged mode Process Synchronization, Critical Section Problem, Hardware Mechanism for synchronization, Semaphores and Mutex objects, Classical Problems (producer consumer, dining philosophers etc), Deadlocks and Detection, Prevention and Avoidance Mechanisms.
Memory Management, Virtual Memory – Dynamic Linking, Segmentation, Paging Protection, Demand paging, Page Replacement polices-Thrashing, Pre-paging and other issues, Swapping.
File and Directories – File Organization in directories, File attributes, Operation on file, Directory attributes and operations on directories, File protections. File System Implementation, Concepts of mounting, Allocation mechanisms, Contiguous, Linked and indexed allocations. Free Space management.
Device Drivers – Storage management, Disk Scheduling, Disk Management
Security and Protection Mechanism – Password based protection, Encryption and Decryption, System Threats – Viruses, Wormholes, Trojan horses etc.
205: MICROPROCESSOR & MICROCONTROLLER
Introduction to microprocessors and microcomputers: Function of microprocessors- architecture of 8086- pin configuration and functions – tristate bus concept – generation of control signals – bus timings – demultiplexing – flags – memory decoding – interfacing of RAM and EPROM – I/O addressing – I/O mapped I/O and memory mapped I/O schemes – instruction execution – fetch/execute cycle – instruction timings and operation status.
Memory organization – program memory – data memory – direct & indirect addressing area – Program status word – register banks – addressing modes – instruction set – arithmetic – logical and data transfer instructions – Boolean instructions – program branching instructions – Programming examples.
Machine cycles – interrupts – interrupt sources – interrupt enable register – interrupt priority – interrupt control system – interrupt handling – single step operation – port bit latches and buffers – port structures and operation – accessing external memory – programming examples.
Timer0 & Timer1 – TMOD SFR – mode0, mode1, mode2, mode3 – TCON SFR – serial interface – SCON SFR mode0, mode1, mode2, mode3- block schematics- baud rates- power on reset circuit- ONCE mode- on chip oscillator- external program & data memory timing diagrams- I/O port timings – programming examples.
Microcontroller 8051 – Architecture – pin configurations – internal block schematic – PORT0, PORT1, PORT2, PORT3, idle & power down mode – power control register – program protection modes – flash programming & verification. I/O interfaces with microcontroller, Real Time Control Issues, Embedded Systems, Programming Examples.
References:
- The 8051 Microcontroller: Muhammad Ali Mazidi, Pearson Education.
- The 8051 Microcontroller: Kenneth J Ayala, Penram International
- Microprocessors and Architecture: Ramesh S Goankar
- Microcomputers and Microprocessors: John Uffenbeck, PHI
206: FORMAL LANGUAGES AND AUTOMATA THEORY
Introduction and Review of Finite State Machines: Deterministic, Nondeterministic M/cs, Minimization of FSM, Inverse FSM.
Finite Automata (FA) & Regular Expression: Definition, Deterministic & Nondeterministic FA, FA null string, Regular Expression, Two way FA, Linear Bound Automata, Applications.
Regular Set: Definition, Properties, Pumping Lemma, Decision Algorithm, Minimization.
Grammar: Introduction, Definition, Different types, Derivation Tree, Different Normal Forms, Ambiguous Grammar and its implications, Chomsky hierarchy, Context Sensitive Languages, Different Classes of Languages, Deterministic Context Free Language and its Properties.
Pushdown Automata: Definition, PDA and CFL, Acceptance of Strings, Alternative Forms of PDA.
Turing Machine: Introduction, Turing Machine Model, Computable Languages & Function, Church’s Hypothesis
Undecidability: Introduction, Recursive and Recursively Enumerable Languages, Recursive Function Theory and its Application.
207(P): OPERATING SYSTEM LAB
UNIX:-
File System, Utilities, Editor, Process, Communication, Filters, Shell Programming, System Administration.
C-Programming using UNIX System Calls relating File Structure, Process, Inter Process Communication.
DOS and Windows: Commands, Utilities and Tools.
Familiarities with SUN-Solaris: Commands and Utilities
208(P): MICROPROCESSOR LAB
Assembly language programming to explore instruction set of 8085 / 8086
Design and implementation of basic interface circuits
Programming of microcontroller 8051
Interfacing with 8051
209(P): DATA COMMUNICATION LAB
Familiarity with Networking equipments, Setting up and configuration of a Network; Experiments on communication- Encoding, modulation, multiplexing.
210(P): SOFTWARE LABORATORY
Scripting and Front-end Languages.
Familiarity with Editing, Presentation, Multimedia, Desktop Publishing Software with suitable application.
System security concepts, configuration and implementation.