Rtu b.tech electrical engineering syllabus

Operating System

Unit-1

Introduction and need of the operating system, layered architecture/ logical structure of the operating system, Type of OS, the operating system as the resource manager and virtual machine, OS services,  BIOS, System  Calls/Monitor  Calls,  Firmware-  BIOS,  Boot  Strap Loader.

Process management- Process model, creation,  termination,  states  &  transitions,  hierarchy, context switching, process implementation, process control block, Basic System calls- Linux & Windows. Threads- processes versus threads,  threading,  concepts,  models,  kernel  & user-level threads,  thread usage,  benefits, multithreading models.

Unit-2

Interprocess communication- Introduction to message passing, Race condition,   critical section problem, mutual exclusion with busy waiting- disabling interrupts, lock variables, strict alteration, Peterson’s solution, TSL instructions, busy waiting, sleep and wakeup calls,  semaphore,   monitors,  classical  IPC problems.

Process  scheduling-  Basic  concepts,  classification,  CPU  and  I/O  bound,   CPU   scheduler- short,  medium,  long-term,   dispatcher,   scheduling:-   preemptive   and  non-preemptive,   Static and Dynamic Priority, Co-operative & Non-cooperative, Criteria/Goals/Performance Metrics, scheduling algorithms- FCFS, SJFS, shortest remaining time, Round robin, Priority scheduling, multilevel  queue scheduling,  multilevel  feedback  queue  scheduling,  Fair  share scheduling.

Unit-3

Deadlock- System model, resource types, deadlock problem,  deadlock characterization, methods for deadlock handling, deadlock prevention, deadlock avoidance, deadlock detection, recovery from deadlock.

Memory  management-  concepts,  functions,  logical  and  physical  address  space,  address  binding, degree of multiprogramming, swapping, static & dynamic  loading-  creating  a  load module,  loading,  static  &  dynamic  linking,  shared  libraries,   memory   allocation   schemes-  first  fit,  next  fit,  best  fit,  worst  fit,  quick  fit.  Free space management-   bitmap, link list/ free list, buddy ’s system, memory protection and sharing, relocation and address translation.

Unit-4

Virtual   Memory-   concept,   virtual   address   space,    paging    scheme,    pure    segmentation and segmentation  with  paging  scheme   hardware   support   and   implementation   details, memory fragmentation, demand paging, pre-paging, working set model, page fault frequency, thrashing, page replacement algorithms- optimal, NRU, FIFO, second chance, LRU, LRU- approximation  clock,  WS  clock;   Belady’s   anomaly,   distance   string;   design   issues   for paging system- local versus global allocation  policies,  load  control,  page  size,  separate  instruction  and  data  spaces,  shared  pages, cleaning  policy,  TLB  (  translation  lookaside buffer)  reach,  inverted  page   table,   I/O   interlock,  program  structure,  page  fault  handling, Basic  idea of MM  in Linux &  windows.

Unit-5

File System- concepts, naming, attributes, operations, types, structure, file organization & access(Sequential,  Direct  ,Index  Sequential)  methods,  memory  mapped  files,   directory structures- one level, two level, hierarchical/tree, acyclic graph, general graph, file  system  mounting, file sharing, path name, directory operations, overview of file system in Linux  & windows.

Input/ Output subsystems-   concepts,   functions/goals,   input/ output devices- block and character, spooling, disk structure &   operation, disk attachment, disk storage capacity, disk scheduling algorithm-  FCFS,  SSTF, scan scheduling,  C-scan schedule.

Text/Reference Books :

1. Silberschatz and Peter B Galvin:  Operating  System  Principals,  Wiley  India Pvt. Ltd.
2. Achyut S Godbole:  Operating  Systems,   Tata McGraw Hill
3. Tanenbaum: Modern Operating System, Prentice
4. DM Dhamdhere:  Operating  Systems  – A Concepts-Based  Approach,  Tata McGraw Hill
5. Charles Crowly:  Operating  System  A Design-Oriented  Approach,  Tata McGraw

Advanced Data Structures

Unit-1

Advanced Trees:  Definitions, Operations on Weight-Balanced  Trees (Huffman Trees), 2-3 Trees and Red-Black Trees. Dynamic  Order  Statistics,  Interval  Tree;  Dictionaries.

Unit-2

LATEST APPLICATIONS FOR VARIOUS UG & PG COURSES OPEN 2019:

1. LPU (Best University of Punjab),  Applications Open for All Courses 2019. APPLY NOW >
2. Chandigarh University (Punjab), Admissions Open for All Courses 2019. APPLY NOW >
3. MIT – World Peace University, Admissions Open for All Courses – 2019. APPLY NOW >
4. Doon Business School, Admissions Open for BSc, BA, MSc, MA & MBA. APPLY NOW >
5. Maharishi Markandeshwar University(Haryana) Application Available. APPLY NOW >
6. Banasthali University (Jaipur) Application Open for UG/PG Courses. APPLY NOW >

Mergeable     HEAPS:     Mergeable     Heap    Operations,     Binomial    Trees, Implementing Binomial Heaps and its Operations, 2-3-4. Trees and 2-3-4 Heaps. Amortization analysis and Potential Function of Fibonacci Heap, Implementing Fibonacci  Heap.

Unit-3

GRAPH THEORY Definitions: Definitions of Isomorphic  Components. Circuits, Fundamental Circuits, Cut-sets. Cut- Vertices Planer and Dual graphs, Spanning  Trees, Kuratovski ’s two Graphs.

GRAPH THEORY Algorithms: Algorithms for Connectedness, Finding all Spanning Trees in a Weighted Graph, Breadth-First and Depth First Search, Topological  Sort,  Strongly  Connected Components and Articulation   Point. Single  Min-Cut Max-Flow theorem of  Network  Flows.   Ford-Fulkerson   Max-Flow  Algorithms.

Unit-4

Sorting network: Comparison network, zero-one principle, bitonic sorting, and merging network sorter.

Priority  Queues  and Concatenable  Queues  using 2-3  Trees. Operations  on Disjoint  sets and  its union-find  problem,  Implementing   Sets.

Unit-5

Number Theoretic Algorithm: Number theoretic notions,  Division theorem, GCD, recursion, Modular arithmetic, Solving Modular Linear equation, Chinese Remainder Theorem, the power of an element, Computation of Discrete Logarithms,  Primality Testing and Integer Factorization.

Text/Reference Books :

1. Cormen, Leiserson,  Rivest:  Introduction  to Algorithms,  Prentice  Hall  of
2. Horowitz and  Sahani:  Fundamental  of Computer
3. Aho V, J.D Ulman:  Design  and analysis  of Algorithms,  Addison Wesley
4. Brassard: Fundamental  of Algorithmics PHI

Digital Signal Processing

Unit-1

INTRODUCTION: Discrete-time signals and systems,  properties of discrete-time systems, Linear time-invariant systems – discrete time.  Properties of LTI  systems and their block diagrams.  Convolution, Discrete-time systems described by difference equations.

Unit-2

Fourier Transform: Discrete-time Fourier transform for periodic and aperiodic signals. Properties of DTFT. Z-transform: The region of convergence for the Z- transform.  The  Inverse  Z-transform.   Properties of Z transform.

Unit-3

Sampling: Mathematical theory of sampling.  Sampling theorem.  Ideal  & Practical sampling.  Interpolation technique for the reconstruction of a signal from its samples.  Aliasing.  Sampling in freq. Domain.  The sampling of discrete time signals.

Unit-4

THE   DISCRETE   FOURIER   TRANSFORMS   (DFT): Properties of the  DFT, Linear Convolution using DFT. Efficient computation of the DFT: Decimation– in-Time and Decimation-in frequency FFT Algorithms.

Unit-5

FILTER DESIGN TECHNIQUES: Structures for discrete-time systems-  Block diagram and signal flow graph representation of LCCD  (LCCD  –  Linear  Constant Coefficient Difference) equations, Basic structures for  IIR  and  FIR systems, Transposed forms. Introduction to filter Design: Butterworth  & Chebyshev.IIR filter design by impulse invariance & Bilinear transformation. Design of FIR filters by Windowing:  Rectangular,  Hamming  & Kaiser.

Text/Reference Books :

1. Oppenheim, Discrete-Time  Signal  Processing,  2/e,  Pearson  Education
2. Proakis, Digital  Signal  Processing,  4/e, Pearson Education
3. Mitra, Digital  Signal  Processing,  2/e, Tata  McGraw Hill

Information Theory And Coding

Unit-1

Introduction to information theory. Uncertainty, Information, and Entropy, Information measures for continuous random variables, source coding theorem. Discrete Memory fewer channels, Mutual information,  Conditional entropy.

Unit-2

Source coding schemes for data compaction: Prefix code, Huffman code,  Shanon-Fane code & Hempel-Ziv coding channel capacity.  Channel coding theorem.  Shannon limit.

Unit-3

Linear Block Code: Introduction to error connecting codes,  coding  & decoding of linear block code, minimum distance consideration, conversion of the nonsystematic form of matrices into systematic form.

Unit-4

Cyclic Code: Code Algebra, Basic properties of Galois fields (GF) polynomial operations over Galois fields, generating cyclic code by generating polynomial,  parity check polynomial.  Encoder  & decoder  for  cyclic codes.

Unit-5

Convolutional Code: Convolutional encoders of different rates.  Code  Tree,  Trellis, and state diagram. Maximum likelihood decoding of convolutional code:  The Viterbi Algorithm fee distance of a convolutional code.

If you have any other Questions related to XAT 2019, you may ask your Queries by commenting below.

If you have any other Questions related to RTU 2019, you may ask your Queries by commenting below.