RTU Syllabus Computer Science Engineering 8th Semester

RTU Syllabus Computer Science Engineering 8th Semester RTU Syllabus Computer Science Engineering 8th Semester: If you are preparaing for Computer Science 8th Semester exam then you should have latest syllabus and exam pattern.

It will let you know about the important topics for the exam and the weightage in various topics. You should complete the syllabus before semester exam to score the better grade.

To boost your exam preparation, here we are providing the latest RTU 8th Semester Computer Science Engineering Syllabus.

RTU Syllabus Computer Science Engineering 8th Semester

The 8th semester is an important stage for Computer Science Engineering. You must score more in Computer Science engineering 8th for future opportunities.

To boost your semester exam preparation, you should have Computer Science 8th Semester books & study materials, Previous years questions paper along with the latest Computer Science 8th sem Syllabus.

Before starting the complete guide on RTU Syllabus Computer Science Engineering 8th Semester 2020, let’s check the highlights of RTU from the table below.

RTU Kota Highlights:

Establishment 2006
Formation Govt. of Rajasthan
Type of University State
Approvals UGC
Admission through: Merit-Based
Affiliations AICTE
University Location Rajasthan Technical University,
Rawathbhata Road Kota-324010, Rajasthan, India.

Check the latest syllabus for RTU Computer Science Engineering 8th sem from below.

Here you can check the latest RTU Computer Science 8 Semester Syllabus For All Subjects.

Mobile Computing

Here you can check the RTU Computer Science 8 Semester Syllabus for Mobile Computing.


  • Mobile computing: Definitions, adaptability issues (transparency, Environmental Constraints, application-aware adaptation), mechanisms for adaptation and incorporating adaptations.
  • Mobility management: mobility management, location management principle and techniques, PCS location management Scheme.


  • Data dissemination and management: challenges, Data dissemination, bandwidth allocation for publishing, broadcast disk scheduling, mobile cache maintenance schemes, Mobile Web Caching. Introduction to mobile middleware.


  • Middleware for application development: adaptation, Mobile agents. Service Discovery Middleware: Service Discovery & standardization Methods (universally Unique Identifiers, Textual Description & using interfaces), unicast Discovery, Multicast Discovery & advertisement, service catalogs, Garbage Collection, Eventing.


  • Mobile IP, Mobile TCP, Database systems in mobile environments, World Wide Web and mobility


  • Ad Hoc networks, localization, MAC issues, Routing protocols, global state routing (GSR), Destination sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad Hoc on demand distance vector routing (AODV), Temporary ordered routing algorithm (TORA), QoS in Ad Hoc Networks, applications.

Text/Reference Books for Mobile Computing:

Here you can check the RTU Computer Science 8 Semester Syllabus for Mobile Computing.

  • Frank Adelstein, Sandeep Gupta, Golden Richard III, Loren Schwiebert, Fundamentals of Mobile and Pervasive Computing,
  • Principles of mobile computing Hansmann & Merk., Springer
  • Mobile communications Jochen Schiller , Pearson
  • 11 wireless networks Matthew S.Gast, O’REILLY.
  • Wireless LANs: Davis & McGuffin, McGraw Hill
  • Mobile Communications Handbook by Jerry D. Gybson
  • Mobile Communications Handbook by R

Digital Image Processing

Here you can check the RTU Computer Science 8 Semester Syllabus for Digital Image Processing.


  • Introduction to Image Processing: Digital Image representation, Sampling & Quantization, Steps in image Processing, Image acquisition, color image representation


  • Image Transformation & Filtering: Intensity transform functions, histogram processing, Spatial filtering, Fourier transforms and its properties, frequency domain filters, colour models, Pseudo colouring, colour transforms, Basics of Wavelet Transforms


  • Image Restoration: Image degradation and restoration process, Noise Models, Noise Filters, degradation function, Inverse Filtering, Homomorphism Filtering


Image Compression: Coding redundancy, Interpixel redundancy, Psychovisual redundancy, Huffman Coding, Arithmetic coding, Lossy compression techniques, JPEG Compression


  • Image Segmentation & Representation: Point, Line and Edge Detection, Thresholding, Edge and Boundary linking, Hough transforms, Region Based Segmentation, Boundary representation, Boundary Descriptors, Regional

Text/Reference Books for Digital Image Processing:

Here you can check the textbook for Digital Image Processing.

  • Gonzalez and Woods: Digital Image Processing ISDN 0-201-600- 781, Addison Wesley
  • Boyle and Thomas: Computer Vision – A First Gurse 2nd Edition.
  • Gonzalez and Woods: Digital Image Processing ISDN 0-201-600- 781, Addison Wesley
  • Pakhera Malay K: Digital Image Processing and Pattern Recogination,

Distributed Systems

Here you can check the RTU Computer Science 8 Semester Syllabus for Distributed Systems.


  • Distributed Systems: Features of distributed systems, nodes of a distributed system, Distributed computation paradigms, Model of distributed systems.
  • Types of Operating systems: Centralized Operating System, Network Operating Systems, Distributed Operating Systems and Cooperative Autonomous Systems, design issues in distributed operating systems.
  • Systems Concepts and Architectures: Goals, Transparency, Services, Architecture Models, Distributed Computing Environment (DCE).
  • Theoretical issues in distributed systems: Notions of time and state, states and events in a distributed system, time, clocks and event precedence, recording the state of distributed systems.


  • Concurrent Processes and Programming: Processes and Threads, Graph Models for Process Representation, Client/Server Model, Time Services, Language Mechanisms for Synchronization, Object Model Resource Servers, Characteristics of Concurrent Programming Languages (Language not included).
  • Inter-process Communication and Coordination: Message Passing, Request/Reply and Transaction Communication, Name and Directory services, RPC and RMI casestudies.


  • Distributed Process Scheduling: A System Performance Model, Static Process Schedulingwith Communication, Dynamic Load Sharing and Balancing, Distributed Process Implementation.
  • Distributed File Systems: Transparencies and Characteristics of DFS, DFS Design and implementation, Transaction Service and Concurrency Control, Data and File Replication.
  • Case studies: Sun network file systems, General Parallel file System and Window’s file systems. Andrew and Coda File Systems


  • Distributed Shared Memory: Non-Uniform Memory Access Architectures, Memory Consistency Models, Multiprocessor Cache Systems, Distributed Shared Memory, Implementation of DSM systems.
  • Models of Distributed Computation: Preliminaries, Causality, Distributed Snapshots, Mo deling a Distributed Computation, Failures in a Distributed System, Distributed Mutual Exclusion, Election, Distributed Deadlock handling, Distributed termination detection.


  • Distributed Agreement: Concept of Faults, failure and recovery, Byzantine Faults,Adversaries, Byzantine Agreement, Impossibility of Consensus and Randomized Distributed Agreement.
  • Replicated Data Management: concepts and issues, Database Techniques, Atomic Multicast, and Update Propagation.
  • CORBA case study: Introduction, Architecture, CORBA RMI, CORBA Services.

Text/Reference Books for Distributed Systems

Here you can check the Text/Reference Books for Distributed Systems:

  • Distributed operating systems and algorithm analysis by Randy Chow and Johnson, Pearson
  • Operating Systems A concept based approach by DM Dhamdhere, TMH
  • Distributed Systems- concepts and Design, Coulouris , Dollimore J, and Kindberg T., Pearson

Hardware Testing and Fault Tolerance

Here you can check the RTU Computer Science 8 Semester Syllabus for Hardware Testing and Fault Tolerance.


  • Overview of hardware testing. Reliability and Testing, Difference between Verification and Testing, Concepts of fault models, test pattern generation and fault coverage. Types of tests exhaustive testing, pseudo-exhaustive testing, pseudo-random testing, and deterministic testing. Test Application. Design for Test. Testing Economics. Defects, Failures and Faults. How are physical defects modeled as faults. Stuck-at faults, Single stuck-at-faults multiple stuck-at faults, bridging faults, delay faults, transient faults.


  • Relation between VLSI Design and Testing.
    • Design Representation for the purpose of testing – Representation in the form of mathematical equations, tabular format, graphs, Binary Decision Diagrams, Netlists, or HDL descriptions.
    • Recap of VLSI Design Flow and where testing fits in the flow. Importance of Simulation and Fault Simulation. Compiled and event-driven simulation. Parallel and deductive fault simulation. Using fault simulation to estimate fault coverage and building a fault dictionary


  • Combinational Test Pattern Generation. D-algorithm. Critical Path Tracking. PODEM algorithm for test generation. Testing sequential circuits. Functional and deterministic ATPG for sequential circuits and the associated challenges. Motivation for Design for Testability. Test Points, Partitioning for Testability. Scan Testing. Scan Architectures. Cost of Scan Testing. Boundary Scan Testing. Board-level testing. Boundary-scan Architecture and various modes of operation.


  • Built-in Self Test. Pseudo-random test generation. Response Compaction. Random pattern-resistant faults. BIST architectures – Circular BIST, BILBO, STUMPS.
  • Testing of Memories – Fault models, Functional tests for memories, Memory BIST.
  • Testing of microprocessors.


  • Hardware fault tolerance. Failure Rate, Reliability, Mean Time to Failure. Different kinds of redundancy schemes for fault-tolerance (Space, Time, and Information Redundancy). N- modular Redundancy. Watch Dog Processors, Byzantine Failures. Information Redundancy parity codes, checksums, m-of-n codes. RAID architectures for disk storage systems. Fault tolerance in interconnection networks. Fault-tolerant routing techniques.

Text/Reference Books for Hardware Testing and Fault Tolerance :

Here you can check the Text/Reference Books for Hardware Testing and Fault Tolerance.

  • Samiha Mourad and Yervant Zorian. Principles of Electronic Wiley Student Editon. [Available in Indian Edition].
  • Koren and Mani Krishna. Fault-Tolerant Systems. Elsevier. (Indian Edition Available.)

Real Time System

Here you can check the RTU Computer Science 8 Semester Syllabus for Real Time System.


  • Introduction: Definition, Typical Real Time Applications, concept of tasks, types of tasks and real time systems, block diagram of RTS, and tasks parameters -Release Times, execution time, period, Deadlines, and Timing Constraints etc. RTS requirements.


  • Reference Models for Real Time Systems: processors and Resources, Temporal Parameters of Real-Time Workload, Periodic and Aperiodic Task Model, Precedence Constrains and Data Dependency, Other Types of Dependencies, Functional Parameters, Resource Parameters.
  • Real Time Scheduling: classification of Real Time Scheduling, scheduling criteria, performance metrics, schedulability analysis, Introduction to Clock Driven scheduling, Weighted Round Robin Approach and Priority Driven Approach. Dynamic Versus Static systems, Offline Versus Online Scheduling.


  • Periodic tasks scheduling: Clock Driven Scheduling – definition, notations and assumption, scheduler concepts, general scheduling structure, cyclic executives.
    Priority Driven Scheduling; notations and assumption, fixed priority verses dynamic priority, fixed priority scheduling algorithms (RM and DM) and their schedulability analysis, concept of schedulability tests – Inexact and exact schedulability tests for RM and DM, Optimality of the RM and DM algorithms, practical factors.


  • Aperiodic task scheduling; assumption and approaches, server based and non-server based fixed priority scheduling algorithms – polling server, deferrable server , simple sporadic server, priority exchange, extended priority exchange, slack stealing.
    Introduction to scheduling of flexible computations –flexible applications, imprecise computation model and firm deadline model.


  • Resources Access Control: Assumptions on Resources and their usage, Effect of Resource Contention and Resource Access Control (RAC), Non-preemptive Critical Sections, priority inversion problem, need of new resource synchronization primitives/protocols for RTS, Basic Priority-Inheritance and Priority-Ceiling Protocols, Stack Based Priority-Ceiling Protocol, Use of Priority- Ceiling Protocol in Dynamic Priority Systems, Preemption Ceiling Protocol, Access Control in Multiple- Unit Resources, Controlling Concurrent Accesses to Data Objects.

Text/Reference Books for Real Time System:

Here you can check the Text/Reference Books for Real Time System

  • W.S.Liu: Real-Time Systems, Pearson Education Asia
  • D.Laurence, K.Mauch: Real-time Microcomputer System Design, An Introduction, McGraw Hill
  • M. Krisna & K. G. Shim- Real time systems- TMH

UNIX Network Programming And Simulation Lab

Here you can check the RTU Computer Science 8 Semester Syllabus for UNIX Network Programming And Simulation Lab.


  • Write two programs in C: hello_client and hello_server
    • The server listens for, and accepts, a single TCP connection; it reads all the data it can from that connection, and prints it to the screen; then it closes the connection
    • The client connects to the server, sends the string “Hello, world!”, then closes the connection
  • Write an Echo_Client and Echo_server using TCP to estimate the round trip time from client to the server. The server should be such that it can accept multiple connections at any given time.
  • Repeat Exercises 1 & 2 for UDP.
  • Repeat Exercise 2 with multiplexed I/O operations
  • Simulate Bellman-Ford Routing algorithm in NS2


Here you can check the RTU Computer Science 8 Semester Syllabus for FPGA Lab.


  • Fundamental Theory-Introduction to DSP architectures and programming Sampling Theory, Analog-to-Digital Converter (ADC), Digital-to- Analog Converter (DAC), and Quantization; Decimation, Interpolation, Convolution, Simple Moving Average; Periodic Signals and harmonics; Fourier Transform (DFT/FFT), Spectral Analysis, and time/spectrum representations; FIR and IIR Filters;
  • Design (Simulation) using MATLAB/ Simulink Simulate the lab exercises using MATLAB/Simulink.
  • Implementation using pure DSP, pure FPGA and Hybrid DSP/FPGA platforms Digital Communications: On-Off- Keying (OOK), BPSK modulation, and a simple transceiver design Adaptive Filtering: Echo/Noise Cancellation, Least Mean Square (LMS) algorithm (2 weeks)
    Wireless Communications: Channel coding/decoding, Equalization, Simple Detection Algorithm, OFDM Speech Processing: Prediction Algorithms, Speech Classification and Synthesis.

Digital Image Processing Lab

Here you can check the RTU Computer Science 8 Semester Syllabus for Digital Image Processing Lab.


  • Color image segmentation algorithm development
  • Wavelet/vector quantization compression
  • Deformable templates applied to skin tumor border finding
  • Helicopter image enhancement
  • High-speed film image enhancement
  • Computer vision for skin tumor image evaluation
  • New Border Images

All Semester Syllabus for RTU Computer Science Engineering

You should have the following syllabus to boost your exam preparation for the RTU Computer Science Engineering.

Click on the link to access all semester syllabus related to Computer Science Engineering.

RTU Computer Science Engineering 8th Semester Marking Scheme

Here you can check the latest Computer Science Engineering 8th Semester Marking Scheme.

VIII Computer Science and Engineering Teaching




Max. Marks Comments


Subject Name (Revised) L T P IA TE TOT


Common to
8CS1A Mobile Computing 3 3 20 80 100 CS, IT
8CS2A Digital Image Processing 3 3 20 80 100 CS, IT
8CS3A Distributed Systems 3 3 20 80 100
8CS4.1A Hardware Testing & Fault Tolerance 3 3 20 80 100 CS, IT
8CS4.2A Real Time Systems CS, IT
8CS4.3A Information Retrieval CS, IT
8CS5A Unix Network Programming &

Simulation Lab

3 60 40 100
8CS6A FPGA Lab. 3 60 40 100
8CS7A Digital Image Processing lab 2 30 20 50 CS, IT
8CSPR Project-II 2 120 80 200 CS, IT
8CSSM Seminar 2 60 40 100 CS, IT
8CSDC Discipline & Extra Curricular


50 CS, IT
12 0 12 1000

Meaning Of various letters:

  • L: Lecture, T: Tutorial, P: Practical, Cr: Credits ETE: End Term Exam, IA: Internal Assessment

We have covered the complete guide on RTU Syllabus Computer Science Engineering 8th Semester 2020. feel free to ask us any questions in the comment section below.

Leave a Comment