RGPV Syllabus for 5th Sem CSE Branch



PROGRAMME: B.E. Computer Science & Engineering, V Semester

Course: CS 501 Data Communication


Branch: Computer Science and Engineering V Semester Course: CS501 Data Communication


The purpose of this subject is to cover the underlying concepts and techniques used in Data Communication. In this subject we discuss various principles, standards for communication over different type of Communication Media.


The students should have general idea about the analog and digital communication. UNIT :- I

Introduction to data communication: Components , data representation ,data flow and basic model ,data representation ,Serial & Parallel transmission , Modes of data transmission, Encoding:Unipolar,Polar ,Bipolar line & block codes ,Data compression ,Frequency dependant codes, Run length encoding ,Relative encoding ,LZ Compression ,Image and multimedia compression. Review of analog & digital transmission methods, Nyquist Theorem .


Multiplexing: FDM, TDM, WDM, Synchronous & Statistical TDM, North American digital multiplexing hierarchy, European TDM, Spread spectrum: Frequency Hopping & Direct Sequence spread spectrum. Terminal handling & polling. Switched Communication Networks: Circuit, Message, Packet & Hybrid Switching, Softswitch Architecture with their comparative study, X.25, ISDN.


Physical Layer: Introduction, Interface, Standards, EIA-232-D, RJ-45, RJ-11, BNC connector & EIA-449 digital Interface: Connection, specifications & configuration, X.21 Modem: Types, features, signal constellation, block schematic, limited distance, dial up, baseband,line driver, Group Band and Null modems etc., ITU-T V-series modem standards Connecting Devices: Active and Passive Hubs, Repeaters, Bridges, Two & Three layer switches & Gateway. Study of various types of topology and their comparative study and introduction to queing theory.


Transmission Media: Transmission line characterestics, distortions, Crosstalk, Guided Media: Twisted Pair, Baseband & Broadband Coaxial.Optical Fibre : Physics and velocity of propagation of light , Advantages & Disadvantages ,Block diagram ,Nodes and classification ,Comparision,losses , light source and detectors , Construction, Unguided media : Electromagnetic polarization ,Rays and wavesfront ,electromagnetic spectrum and radiation ,spherical wavefront and inverse square law , wave attenuation and absorption, optical properties of Radio waves , Terestrial Propagation of electromagnetic waves , skip distance , free – space path loss ,Radio waves , Microwave , Infrared & Satellite Communication system . Telephone Network: Components, LATAs, signaling and Services, Digital Subscriber Line: ADSL,

HDSL, SDSL, VDSL, Cable TV network for data transfer.


Transmission Errors : Content Error , flow integrity error , methods of error control ,Error detection ,Error correction ,Bit error rate , Error detection methods: Parity checking , Checksum Error Detection ,Cyclic Redudancy Check ,Hamming code , Interleaved codes , Block Parity , Convolution code, Hardware Implementation, Checksum .

Suggested Reading:

  1. Gupta Prakash C.,”Data communication”, PHI Learning
  2. Tomasi,”Introduction to Data Communication & Networking, Pearson Education
  3. Forouzan, “Data communication”, TATA McGraw
  4. Godbole,”Data Communication & Network” , TMH
  5. Miller,”Data Network and Comunication”,Cengage Delmar Learning
  6. William Stallings ,”Data & Computer Communication”, Pearson Education
  7. A.S Tanenbum,”Computer Network”,Pearson Education.









PROGRAMME: B.E. Computer Science & Engineering, V Semester

Course: CS 502 Operating system



Branch: Computer Science and Engineering V Semester

Course: CS 502 Operating System


The purpose of this subject is to cover the underlying concepts Operating System .This syllabus provides a comprehensive introduction of Operating System, Process Management, Memory Management, File Management and I/O management.


The students should have general idea about Operating System Concept, types of Operating System and their functionality.

Unit I

Introduction to System Programs & Operating Systems, Evolution of Operating System (mainframe, desktop, multiprocessor, Distributed, Network Operating System, Clustered & Handheld System), Operating system services, Operating system structure, System Call & System Boots, Operating system design & Implementations, System protection, Buffering & Spooling . Types of Operating System: Bare machine, Batch Processing, Real Time, Multitasking & Multiprogramming, time-sharing system.

Unit II

File: concepts, access methods, free space managements, allocation methods, directory systems, protection, organization ,sharing & implementation issues, Disk & Drum Scheduling, I/O devices organization, I/O devices organization, I/O buffering, I/O Hardware, Kernel I/O subsystem, Transforming I/O request to hardware operations.

Device Driver: Path managements, Sub module, Procedure, Scheduler, Handler, Interrupt Service Routine. File system in Linux & Windows

Process: Concept, Process Control Blocks(PCB), Scheduling criteria Preemptive & non Preemptive process scheduling, Scheduling algorithms, algorithm evaluation, multiple processor scheduling, real time scheduling, operations on processes, threads, inter process communication, precedence graphs, critical section problem, semaphores, classical problems of synchronization. Deadlock: Characterization, Methods for deadlock handling, deadlock prevention, deadlock avoidance, deadlock detection, recovery from deadlock, Process Management in Linux.

Unit IV

Memory Hierarchy, Concepts of memory management, MFT & MVT, logical and physical address space, swapping, contiguous and non-contiguous allocation, paging, segmentation, and paging combined with segmentation. Structure & implementation of Page table.Concepts of virtual memory, Cache Memory Organization, demand paging, page replacement algorithms, allocation of frames, thrashing, demand segmentation.

Unit V

Distributed operating system:-Types, Design issues, File system, Remote file access, RPC, RMI, Distributed Shared Memory(DSM), Basic Concept of Parallel Processing &

Concurent Programming Security & threats protection: Security violation through Parameter, Computer Worms & Virus, Security Design Principle, Authentications, Protection Mechanisms. introduction to Sensor network and parallel operating system. Case study of Unix, Linux & Windows,

List of Experiment

  1. Write a program to implement FCFS CPU scheduling algorithm.
  2. Write a program to implement SJF CPU scheduling algorithm.
  3. Write a program to implement Priority CPU Scheduling algorithm.
  4. Write a program to implement Round Robin CPU scheduling algorithm.
  5. Write a program to compare various CPU Scheduling Algorithms over different Scheduling Criteria.
  6. Write a program to implement classical inter process communication problem(producer consumer).
  7. Write a program to implement classical inter process communication problem(Reader Writers).
  8. Write a program to implement classical inter process communication problem(Dining_Philosophers).
  9. Write a program to implement & Compare various page replacement algorithm.
  10. Write a program to implement & Compare various Disk & Drum scheduling Algorithms
  11. Write a program to implement Banker’s algorithms.
  12. Write a program to implement Remote Proccedure Call(RPC).
  13. Write a Devices Drivers for any Device or pheriperal.


Suggested Reading:

  1. Silberschatz /’Operating system”, Willey Pub.
  2. Stuart,”Operating System Principles, Design & Applications”,Cengage Learning
  3. Tannanbaum, “Modern operating system”,PHI Learning
  4. Dhamdhere, ’’Operating System”,TMH.
  5. Achyut S Godbole,”Operating System”, TMH.
  6. William stalling, “operating system” Pearson Edu.
  7. Deitel & Deitel, “Operating Systems”, Pearson Edu.
  8. Flynn & Mchoes, “Operating Systems”, Cengage Learning
  9. Haldar, “Operating System”, Pearson Edu.



















PROGRAMME: B.E. Computer Science & Engineering, V Semester

Course: CS 503 Data Base Management System

Branch: Computer Science and Engineering V Semester        Course: CS 503 Data Base Management System


The purpose of this subject is to cover the underlying concepts and techniques used in creating a Data Base System. These techniques can be used in Software Developments.


The students should have a general idea about data base concept, data models and sql statements.

Unit I

DBMS Concepts and architecture Introduction, Database approach v/s Traditional file accessing approach, Advantages, of database systems, Data models, Schemas and instances, Data independence, Data Base Language and interfaces, Overall Database Structure, Functions of DBA and designer, ER data model:Entitles and attributes, Entity types, Defining the E-R diagram,Concept of Generalization, Aggregation and Specialization. transforming ER diagram into the tables. Various other data models object oriented data Model, Network data model, and Relational data model, Comparison between the three types of models.

Unit II

Relational Data models: Domains, Tuples, Attributes, Relations, Characteristics of relations, Keys, Key attributes of relation, Relational database, Schemas, Integrity constraints. Referential integrity, Intension and Extension, Relational Query languages:SQL-DDL, DML, integrity constraints, Complex queries, various joins, indexing, triggers, ssertions,Relational algebra and relational calculus, Relational algebra operations like select, Project,Join, Division, outer union. Types of relational calculus i.e. Tuple oriented and domain oriented relational calculus and its operations.

Data Base Design: Introduction to normalization, Normal forms, Functional dependency, Decomposition, Dependency preservation and losless join, problems with null valued and dangling tuples, multivalued dependencies.Query Optimization: Introduction, steps of optimization, various algorithms to implement select, project and join operations of relational algebra, optimization methods: heuristic based, cost estimation based.

Unit IV

Transaction Processing Concepts: – Transaction System, Testing of Serilizability, Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures. Log based recovery. Checkpoints deadlock handling.Concurrency Control Techniques: – Concurrency Control, locking Techniques for concurrency control, time stamping protocols for concurrency control, validation based protocol, multiple granularity. Multi version schemes, Recovery with concurrent transaction. Introduction to Distributed databases, datamining, datawarehousing, Object Technology and DBMS, Comparative study of OODBMS Vs DBMS . Temporal, Deductive, Multimedia, Web & Mobile database .

Unit V

Study of Relational Database Management Systems through Oracle/Postgres SQL/MySQL: Architecture, physical files, memory structures, background process. Concept of table spaces, segments, extents and block. Dedicated server, multi threaded server. Distributed database, database links, and snapshot. Data dictionary, dynamic performance view.Security, role management, privilege management, profiles, invoker defined security model. SQL queries, Data extraction from single, multiple tables equi-join, non equi-join, self-join, outer join. Usage of like, any, all, exists, in Special operators. Hierarchical queries, inline queries, flashback queries. Introduction of ANSI SQL, anonymous block, nested anonymous block, branching and looping constructs in ANSI SQL. Cursor management: nested and parameterized cursors, Oracle exception handling mechanism. Stored procedures, in, out, in out type parameters,usage of parameters in procedures. User defined functions their limitations. Triggers, mutating errors, instead of triggers.

Suggested list of experiments: –

Lab Assignments:

  1. Delete duplicate row from the table.
  2. Display the alternate row from table.
  3. Delete alternate row from table.
  4. Update multiple rows in using single update statement.
  5. Find the third highest paid and third lowest paid salary.
  6. Display the 3rd, 4th, 9th rows from table.
  7. Display the ename, which is start with j, k, l or m.
  8. Show all employees who were hired the first half of the month.
  9. Display the three record in the first row and two records in the second row and one record in the third row in a single sql statements.
  10. Write a sql statements for rollback commit and save points.
  11. Write a pl/sql for select, insert, update and delete statements.
  12. Write a pl/sql block to delete a record. If delete operation is successful return 1 else return 0.
  13. Display name, hire date of all employees using cursors.
  14. Display details of first 5 highly paid employees using cursors.
  15. Write a database trigger which fires if you try to insert, update, or delete after 7’o’ clock.
  16. Write a data base trigger, which acts just like primary key and does not allow duplicate values.
  17. Create a data base trigger, which performs the action of the on delete cascade.
  18. Write a data base trigger, which should not delete from emp table if the day is Sunday.
  19. In this subject the students are supposed to prepare a small database application in complete semester like financial accounting system, Railway reservation system, institute timetable management system. Student record system, library management system, hospital management system etc. in RDBMS as follows:


Section A:

Solving the case studies using ER datamodel (design of the database)

Section B:

Implement a miniproject for the problem taken in section A.

Suggested Reading:-

1. Date C J, “An Introduction To Database System”, Pearson Educations

2. Korth, Silbertz,Sudarshan, “Fundamental of Database System”, McGraw Hill

3. Rob, ” Data Base System:Design Implementation & Management”, Cengage Learninig

4. Elmasri, Navathe, “Fundamentals Of Database Systems”, Pearson Educations

5 . Atul Kahate , ” Introduction to Database Management System”, Pearson Educations

  1. Oracle 9i Database Administration Fundamental-I, Volume I, Oracle Press,TMH.
  2. Paneerselvam,”DataBase Management System”, PHI Learning











































RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL PROGRAMME: B.E. Computer Science & Engineering, V Semester Course: CS 504 Computer Graphics & Multimedia


Branch: Computer Science and Engineering V semester Course: CS 5512/ CS504 Computer Graphics & Multimedia


The purpose of this subject is to cover the underlying concepts and techniques used in Computer Graphics ,Animations & Multimedia.


The students should have general Idea about input/output devices, graphics, text, audio, video and animation. In addition, a familiarity with general mathematical transformations is required.

Unit-I Introduction to raster scan displays, Pixels, frame buffer, Vector & Character generation, random scan systems, Graphics Primitives, Display devices, Display file structure, ScanConversion techniques, line drawing: simple DDA, Bresenham’s Algorithm, Circle Drawing Algorithms. Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms

Unit-II 2D transformation: Translation, Rotation, Scaling, Shearing, Reflection. Inverse Transformation, Homogenous coordinate system, Matrices Transformation, Composite Transformation. Windowing & Clipping: World Coordinate System, Screen Coordinate System, Viewing Transformation, Line Clipping, Cohen Sutherland, Midpoint Line clipping algorithms, Polygon Clipping: Sutherland -Hodgeman, Weiler-Atherton algorithms.

Unit-III 3D transformations: translation, rotation, scaling. Parallel & Perspective Projection,Types of Parallel & Perspective Projection. Hidden Surface elimination: Depth comparison, Back face detection algorithm, Painters algorithm, Z-buffer algorithm. Curve generation, Bezier and B-spline methods.

Unit-IV Basic Illumination Model, Diffuse reflection, Specular reflection, Phong Shading Gourand shading, ray tracing, color models like RGB, YIQ, CMY, HSV.

Unit -V Multimedia System: An Introduction, Multimedia hardware, Multimedia System Architecture. Data & File Format standards. i.e RTF, TIFF, MIDI, JPeG, DIB, MPEG,Audio: digital audio, MIDI, processing sound, sampling, compression. Video: Avi, 3GP,MOV, MPEG , compression standards, compression through spatial and temporal redundancy. Multimedia Authoring .





Suggested Reading:

  1. Donald Hearn and M.P. Becker “Computer Graphics” Pearson Pub.
  2. Rogers, “Procedural Elements of Computer Graphics”, Tata McGraw Hill
  3. Folay Vandam, Feiner, Hughes “Computer Graphics Principle & Practice” , Pearson Pub.
  4. Sinha and Udai , “Computer Graphics”, Tata McGraw Hill
  5. Parekh “Principles of Multimedia” Tata McGraw Hill
  6. Prabhat k Andleigh, Kiran Thakral , “Multimedia System Design ” PHI Pub.
  7. Shuman “Multimedia in Action”, Cengage Learning

















RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL PROGRAMME: B.E. Computer Science & Engineering, V Semester Course: CS 505 Theory of Computation Course Contents


Branch: Computer Science and Engineering V Semester

Course: CS 505 Theory of Computation



The purpose of this subject is to cover the underlying concepts and techniques used in Theory of Computation. In this syllabus we cover finite automata, pushdown automata, Context free grammars and Turing machines.


The students should have general idea about computing and mathematical concepts , Transition graph, Transition matrix.



Basic machine, FSM , Transition graph, Transition matrix, Deterministic and non- deterministic FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines, minimization of finite automata, Two-way finite automata.

Regular Sets and Regular Grammars:

Alphabet, words, Operations, Regular sets, Finite automata and regular expression, Myhill- Nerode theorem Pumping lemma and regular sets, Application of pumping lemma, closure properties of regular sets.



Context -Free Grammars:

Introduction to CFG, Regular Grammars, Derivation trees and Ambiguity, Simplification of Context free grammars, Normal Forms (Chomsky Normal Form and Greibach Normal forms).

UNIT 3: Pushdown Automata:

Definition of PDA, Deterministic Pushdown Automata, PDA corresponding to given CFG, CFG corresponding to a given PDA.

Context Free Languages:

The pumping lemma for CFL’s, Closure properties of CFL’s, Decision problems involving CFL’s.

UNIT 4: Turing Machines:

Introduction, TM model, representation and languages acceptability of TM Design of TM,Universal TM & Other modification, Church’s hypothesis, composite & iterated TM. Turing machine as enumerators.Properties of recursive & recursively enumerable languages,Universal Turing machine

UNIT 5: Tractable and Untractable Problems:

P, NP, NP complete and NP hard problems, examples of these problems like satisfy ability problems, vertex cover problem, Hamiltonian path problem, traveling sales man problem, Partition problem etc.

Suggested Reading:

  1. John E. Hopcroft, Jeffery Ullman,”Introduction to Automata theory, Langauges & computation” , Narosa Publishers.
  2. K.L.P Mishra & N.Chandrasekaran,”Theory of Computer Science”, PHI Learning
  3. Michael Sipsev,”Theory of Computation”,Cenage Learning
  4. John C Martin, “Introdution to languages and theory of computation”, McGraw Hill
  5. Daniel I.A. Cohen,”Introduction to Computer Theory”,Wiley India.
  6. Kohavi,”Switching & Finite Automata Theory”,TMH



RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL PROGRAMME: B.E. Computer Science & Engineering, V Semester Course: CS 506 Computer Programming V(Unix/Linux-Lab) Course Contents


Branch: Computer Science and Engineering V Semester

Course: CS 5305/ CS506 Computer Programming V (Unix/Linux-Lab).


The purpose of this subject is to cover the concepts, Installation Process, Hardware Requirements and features of Unix/Linux. Basic Commands & Shell Programming.


The students should have general Idea about computing fundamentals & operating system and at least one year of experience in programming .

Overview of Unix/Linux: –

Concepts, Unix/Linux Installation Process, Hardware Requirements for Unix/Linux ,Advantages of Unix/Linux, Reasons for Popularity and Success of Linux/Unix Operating System, Features of Linux/Unix Operating System, Kernel, Kernel Functions, The Shell Basic Commands, Shell Programming:-Shell Variables, Branching Control Structures, Loop-Control Structure, Continue and break Statements, Sleep Command, Debugging Script. Use of Linux as web-server, file server, directory server, application server, DNS server, SMTP server, Firewall, Proxy server.

File System: –

Definition of File System, Defining Geometry, Disk Controller, Solaris File System, Disk Based File Systems, Network-Based File Systems, Virtual File systems, UFS File System, The Boot Block, The Super Block, The Inode, Tuning File System, Repairing File System.

Process Control: –

Viewing a Process, Command to display Process, Process Attributes, Process States, Process Fields, PS Commands options, PGREP, PRSTAT, CDE Process Manager, Scheduling Process, Scheduling Priorities, Changing the Priority of a time-sharing process, Killing Process.

System Security: –

Physical Security, Controlling System Access, Restricted Shells Controlling File Access, File Access Commands, Access Control List(ACLs), Setting ACL Entries, Modifying ACL entries on a file, Deleting ACL entries on a file, Restricting FTP, Securing Super User Access, Restricting Root Access, Monitoring super user Access, TCP Wrappers.

Dynamic Host Configuration Protocol: –

Introduction, DHCP Leased Time, DHCP Scopes, DHCP IP Address, Allocation Types, Planning DHCP Deployment, DHCP Configuration files, Automatic Startup of DHCP Server, Configuration of DHCP Clients, Manually Configuring the DHCP.

Case Study: –

Installation of Linux, Customization of Linux, Installation of SAMBA, APACHE, TOMCAT, Send MAIL, Postfix, Implementation of DNS, LDAP services, Firewall, Proxy server

List of Experiments:-

  1. To Study basic & User status Unix/Linux Commands.
  2. Study & use of commands for performing arithmetic operations with Unix/Linux.
  3. Create a file called wlcc.txt with some lines and display how many lines, words and characters are present in that file.
  4. Append ten more simple lines to the wlcc.txt file created above and split the appended file into 3 parts. What will be the names of these split files? Display the contents of each of these files.

How many lines will be there on the last file?

  1. Given two files each of which contains names of students. Create a program to display only those names that are found on both the files.
  2. Create a program to find out the inode number of any desired file.
  3. Study & use of the Command for changing file permissions.
  4. Write a pipeline of commands, which displays on the monitor as well as saves the information about the number of users using the system at present on a file called usere.ux.
  5. Execute shell commands through vi editor.
  6. Installation, Configuration & Customizations of Unix/Linux.
  7. Write a shell script that accepts any number of arguments and prints them in the reverse order.
  8. Write a shell script to find the smallest of three numbers that are read from the keyboard.
  9. Write a shell script that reports the logging in of a specified user within one minute after he/she logs in. The script automatically terminates if the specified user does not login during a specified period of time.
  10. Installation of SAMBA, APACHE, TOMCAT.
  11. Implementation of DNS, LDAP services,
  12. Study & installation of Firewall & Proxy server

Suggested Reading:

  1. Venkatesh Murthy, “Introduction to Unix &Shell”, Pearson Edu
  2. Forouzan, “Unix &Shell Programming”, Cengage Learning
  3. Sumitab Das,”Unix Concept & Application”,TMH
  4. Gopalan, Shivaselvan,”Beginners Guide to Unix ” PHI Learning
  5. Venkateshwavle,”Linux Programming Tools Unveil’ed”, BS Publication.
  6. Richard Peterson,”Linux Complete Reference”, TMH
  7. Richard Peterson,”Unix Complete Reference”, TMH

4 thoughts on “RGPV Syllabus for 5th Sem CSE Branch

  1. I am very proud to be this site to given knowledge about computer science etc.

  2. nice….its contain all the related topics in a particular manner but u have give the name of book which contain the topics in a vast and in easy language..

  3. syllebus contain studied very easy to way and so… simple

Leave a Reply

Your email address will not be published. Required fields are marked *