Computer Science and Engineering: Syllabus of Undergraduate Degree Course

Syllabus of
UNDERGRADUATE DEGREE COURSE
B.Tech. V Semester
Computer Science and Engineering
Rajasthan Technical University, Kota

Effective from session: 2019 – 2020
RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus
III Year-V Semester: B.Tech. Computer Science and Engineering
5CS3-01: Information Theory & Coding
Credit: 2 Max. Marks: 100(IA:20, ETE:80)

2L+0T+0P End Term Exam: 2 Hours
SN Contents Hours
1 Introduction:Objective, scope and outcome of the course. 01
2 Introduction to information theory: Uncertainty, Information

and Entropy, Information measures for continuous random 05
variables, source coding theorem. Discrete Memory less channels,
Mutual information, Conditional entropy.
3 Source coding schemes for data compaction: Prefix code,
Huffman code, Shanon-Fane code &Hempel-Ziv coding channel 05
capacity. Channel coding theorem. Shannon limit.
4 Linear Block Code: Introduction to error connecting codes, coding
& decoding of linear block code, minimum distance consideration, 05
conversion of non-systematic form of matrices into systematic
form.
5 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 & 06
decoder for cyclic codes.
6 Convolutional Code: Convolutional encoders of different rates.

Code Tree, Trllis and state diagram. Maximum likelihood decoding 06
of convolutional code: The viterbi Algorithm fee distance of a
convolutional code.
Total 28
Syllabus of 3rdYear B. Tech. (CS) for students admitted in Session 2017-18 onwards. Page 2
Syllabus
5CS4-02: Compiler Design

SN Contents Hours
2 Introduction: Objective, scope and outcome of the course.

Compiler, Translator, Interpreter definition, Phase of compiler,
Bootstrapping, Review of Finite automata lexical analyzer, Input, 06
Recognition of tokens, Idea about LEX: A lexical analyzer
generator, Error handling.
3 Review of CFG Ambiguity of grammars: Introduction to parsing.
Top down parsing, LL grammars & passers error handling of LL
parser, Recursive descent parsing predictive parsers, Bottom up
parsing, Shift reduce parsing, LR parsers, Construction of SLR, 10
Conical LR & LALR parsing tables, parsing with ambiguous
grammar. Operator precedence parsing, Introduction of automatic
parser generator: YACC error handling in LR parsers.
4 Syntax directed definitions; Construction of syntax trees, S-
Attributed Definition, L-attributed definitions, Top down
translation. Intermediate code forms using postfix notation, DAG,
10
Three address code, TAC for various control structures,
Representing TAC using triples and quadruples, Boolean
expression and control structures.
5 Storage organization; Storage allocation, Strategies, Activation
records, Accessing local and non-local names in a block structured
08
language, Parameters passing, Symbol table organization, Data
structures used in symbol tables.
6 Definition of basic block control flow graphs; DAG
representation of basic block, Advantages of DAG, Sources of
optimization, Loop optimization, Idea about global data flow
07
analysis, Loop invariant computation, Peephole optimization,
Issues in design of code generator, A simple code generator, Code
generation from DAG.
Total 42
Syllabus
5CS4-03: Operating System

SN Contents Hours
2 Introduction and History of Operating systems: Structure and

operations; processes and files
Processor management: inter process communication, mutual exclusion, 04

semaphores, wait and signal procedures, process scheduling and
algorithms, critical sections, threads, multithreading
3 Memory management: contiguous memory allocation, virtual memory,

paging, page table structure, demand paging, page replacement policies, 05
thrashing, segmentation, case study
4 Deadlock: Shared resources, resource allocation and scheduling,

resource graph models, deadlock detection, deadlock avoidance, deadlock
prevention algorithms 15
Device management: devices and their characteristics, device drivers,
device handling, disk scheduling algorithms and policies
File management: file concept, types and structures, directory structure,

5 cases studies, access methods and matrices, file security, user 07
authentication
UNIX and Linux operating systems as case studies; Time OS and case
6 08
studies of Mobile OS
Total 40
Syllabus
5CS4-04: Computer Graphics & Multimedia

SN Contents Hours
1 Introduction: Objective, scope and outcome of the course. 01
2 Basic of Computer Graphics:Basic of Computer Graphics, Applications

of computer graphics, Display devices, Random and Raster scan systems, 06
Graphics input devices, Graphics software and standards
3 Graphics Primitives:Points, lines, circles and ellipses as primitives, scan

conversion algorithms for primitives, Fill area primitives including scan-
line polygon filling, inside-outside test, boundary and flood-fill, character 07
generation, line attributes, area-fill attributes, character attributers.
Aliasing, and introduction to Anti Aliasing (No anti aliasing algorithm).
4 Two Dimensional Graphics:Transformations (translation, rotation,

scaling), matrix representation, homogeneous coordinates, composite
transformations, reflection and shearing, viewing pipeline and
08
coordinates system, window-to-viewport transformation, clipping
including point clipping, line clipping (cohen-sutherland, liang- bersky,
NLN), polygon clipping
5 Three Dimensional Graphics:3D display methods, polygon surfaces,

tables, equations, meshes, curved lies and surfaces, quadric surfaces,
spline representation, cubic spline interpolation methods, Bazier curves
and surfaces, B-spline curves and surfaces.3D scaling, rotation and 08
translation, composite transformation, viewing pipeline and coordinates,
parallel and perspective transformation, view volume and general (parallel
and perspective) projection transformations.
6 Illumination and Colour Models:Light sources – basic illumination

models – halftone patterns and dithering techniques; Properties of light –
Standard primaries and chromaticity diagram; Intuitive colour concepts – 06
RGB colour model – YIQ colour model – CMY colour model – HSV colour
model – HLS colour model; Colour selection.
7 Animations &Realism:Design of Animation sequences – animation

function – raster animation – key frame systems – motion specification –
morphing – tweening.
06
ComputerGraphics Realism: Tiling the plane – Recursively defined
curves – Koch curves – C curves – Dragons – space filling curves – fractals
– Grammar based models – fractals – turtle graphics – ray tracing.
Total 42
Syllabus
5CS4-05: Analysis of Algorithms

SN Contents Hours
2 Background: Review of Algorithm, Complexity Order Notations: definitions and

calculating complexity.
06
Divide And Conquer Method: Binary Search, Merge Sort, Quick sort and
Strassen's matrix multiplication algorithms.
3 Greedy Method: Knapsack Problem, Job Sequencing, Optimal Merge Patterns
and Minimal Spanning Trees.
10
Dynamic Programming: Matrix Chain Multiplication. Longest
CommonSubsequence and 0/1 Knapsack Problem.
4 Branch And Bound: Traveling Salesman Problem and Lower Bound Theory.
Backtracking Algorithms and queens problem. 08
Pattern Matching Algorithms: Naïve and Rabin Karp string matching

algorithms, KMP Matcher and Boyer Moore Algorithms.
5 Assignment Problems: Formulation of Assignment and Quadratic Assignment
Problem.
Randomized Algorithms- Las Vegas algorithms, Monte Carlo algorithms, 08
randomized algorithm for Min-Cut, randomized algorithm for 2- SAT. Problem
definition of Multicommodity flow, Flow shop scheduling and Network capacity
assignment problems.
6 Problem Classes Np, Np-Hard And Np-Complete: Definitions of P, NP-Hard
and NP-Complete Problems. Decision Problems.Cook's Theorem. Proving NP-
08
Complete Problems - Satisfiability problem and Vertex Cover Problem.
Approximation Algorithms for Vertex Cover andSet Cover Problem.
Total 41
Syllabus
5CS5-11: Wireless Communication

SN Contents Hours
2 Wireless Channels:Large scale path loss – Path loss models: Free

Space and Two-Ray models -Link Budget design – Small scale
fading- Parameters of mobile multipath channels – Time dispersion
parameters-Coherence bandwidth – Doppler spread & Coherence 06
time, Fading due to Multipath time delay spread – flat fading –
frequency selective fading – Fading due to Doppler spread – fast
fading – slow fading.
3 Cellular Architecture: Multiple Access techniques - FDMA,
TDMA, CDMA – Capacity calculations–Cellular concept- Frequency
reuse - channel assignment- hand off- interference & system 05
capacity- trunking & grade of service – Coverage and capacity
improvement.
4 Digital Signaling For Fading Channels: Structure of a wireless
communication link, Principles of Offset-QPSK, p/4-DQPSK,
Minimum Shift Keying, Gaussian Minimum Shift Keying, Error 05
performance in fading channels, OFDM principle – Cyclic prefix,
Windowing, PAPR.
5 Multipath Mitigation Techniques: Equalisation – Adaptive
equalization, Linear and Non-Linear equalization, Zero forcing and
LMS Algorithms. Diversity – Micro and Macrodiversity, Diversity 06
combining techniques, Error probability in fading channels with
diversity reception, Rake receiver,
6 Multiple Antenna Techniques: MIMO systems – spatial
multiplexing -System model -Pre-coding - Beam forming - 05
transmitter diversity, receiver diversity- Channel state information-
capacity in fading and non-fading channels.
Total 28
Syllabus
5CS5-12: Human Computer Interaction

SN Contents Hours
2 Historical evolution of the field, Interactive system design, Concept

of usability -definition and elaboration, HCI and software 02
Engineering, GUI design and Aesthetics, Prototyping techniques.
2 Model-based Design and evaluation: Basic idea, introduction to

different types of models, GOMS family of models (KLM and CMN- 03
GOMS), Fitts’ law and Hick-Hyman’s law, Model-based design case
studies,
3 Guidelines in HCI:Shneiderman’s eight, golden rules, Norman’s
seven principles, Norman’s model of interaction, Nielsen’s ten 05
heuristics with example of its use Heuristic evaluation, Contextual
inquiry, Cognitive walkthrough
4 Empirical research methods in HCI: Introduction (motivation,
issues, research question formulation techniques), Experiment 06
design and data analysis (with explanation of one-way ANOVA)
5 Task modelling and analysis: Hierarchical task analysis (HTA),
Engineering task models and Concur Task Tree (CTT),Iintroduction 06
to formalism in dialog design, design using FSM (finite state
machines) State charts and (classical) Petri Nets in dialog design
6 Introduction to CA, CA types, relevance of CA in IS design Model
05
Human Processor (MHP), OOP- Introduction OOM- Object
Oriented Modeling of User Interface Design
Total 28
Syllabus
5CS5-13: Bioinformatics

SN Contents Hours
2 Introduction: Basics of biology 02
3 Sequences: Problem Statement, Edit distance and substitution

matrices, HMMs and pairwise HMMs, Global and local alignments,
Spliced alignment, Space-efficient sequence alignment, Multiple 07
alignment, Database searching tools, Sequence by hybridization,
Profile HMMs
4 Structures: Protein structure alignment, Protein structure 06
prediction
5 Phylogenetic trees: Large parsimony and small parsimony 07
problems, Probabilistic approaches, Grammar-based approaches
6 Miscellaneous topics: Pathways and networks, Microarrays, 05
Biomedical images
Total 28
Syllabus
5CS4-21: Computer Graphics & Multimedia Lab
Credit: 1 Max. Marks:50 (IA:30, ETE:20)

SN List of Experiments
1 Implementation of Line, Circle and ellipse attributes
2 To plot a point (pixel) on the screen
3 To draw a straight line using DDA Algorithm
4 Implementation of mid-point circle generating Algorithm
5 Implementation of ellipse generating Algorithm
6 Two Dimensional transformations - Translation, Rotation, Scaling, Reflection, Shear
7 Composite 2D Transformations
8 Cohen Sutherland 2D line clipping and Windowing
9 Sutherland – Hodgeman Polygon clipping Algorithm
10 Three dimensional transformations - Translation, Rotation, Scaling
11 Composite 3D transformations
12 Drawing three dimensional objects and Scenes
13 Generating Fractal images
Syllabus
5CS4-22: Compiler Design Lab

2 To identify whether given string is keyword or not.
3 Count total no. of keywords in a file. [Taking file from user]
4 Count total no of operators in a file. [Taking file from user]
5 Count total occurrence of each character in a given file. [Taking file from user]
6 Write a C program to insert, delete and display the entries in Symbol Table.
7 Write a LEX program to identify following:
1. Valid mobile number

2. Valid url
3. Valid identifier
4. Valid date (dd/mm/yyyy)
5. Valid time (hh:mm:ss)
8 Write a lex program to count blank spaces,words,lines in a given file.
9 Write a lex program to count the no. of vowels and consonants in a C file.
10 Write a YACC program to recognize strings aaab,abbb using a^nb^n, where b>=0.
11 Write a YACC program to evaluate an arithmetic expression involving operators +,-,*

and /.
12 Write a YACC program to check validity of a strings abcd,aabbcd using grammar

a^nb^nc^md^m, where n , m>0
13 Write a C program to find first of any grammar.
Syllabus
5CS4-23: Analysis of Algorithms Lab

1 Sort a given set of elements using the Quicksort method and determine the
time required to sort the elements. Repeat the experiment for different values
of n, the number of elements in the list to be sorted and plot a graph of the
time taken versus n. The elements can be read from a file or can be generated
using the random number generator.
2 Implement a parallelized Merge Sort algorithm to sort a given set of elements

and determine the time required to sort the elements. Repeat the experiment
for different values of n, the number of elements in the list to be sorted and
plot a graph of the time taken versus n. The elements can be read from a file or
can be generated using the random number generator.
3 a. Obtain the Topological ordering of vertices in a given digraph. b. Compute

the transitive closure of a given directed graph using Warshall's algorithm.
4 Implement 0/1 Knapsack problem using Dynamic Programming.
5 From a given vertex in a weighted connected graph, find shortest paths to

other vertices using Dijkstra's algorithm.
Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's
6
algorithm.
a. Print all the nodes reachable from a given starting node in a digraph using
7 BFS method. b. Check whether a given graph is connected or not using DFS
method.
Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s
8.
algorithm.
9. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.
10 Implement N Queen's problem using Back Tracking.
Syllabus
5CS4-24: Advance Java Lab

L+0T+2P End Term Exam: 2 Hours
1 Introduction To Swing, MVC Architecture, Applets, Applications and Pluggable

Look and Feel, Basic swing components : Text Fields, Buttons, Toggle Buttons,
Checkboxes, and Radio Buttons
2 Java database Programming, java.sql Package, JDBC driver, Network

Programming With java.net Package, Client and Server Programs, Content And
Protocol Handlers
3 RMI architecture, RMI registry, Writing distributed application with RMI,

Naming services, Naming And Directory Services, Overview of JNDI, Object
serialization and Internationalization
4 J2EE architecture, Enterprise application concepts, n-tier application

concepts, J2EE platform, HTTP protocol, web application, Web containers and
Application servers
5 Server side programming with Java Servlet, HTTP and Servlet, Servlet API, life
cycle, configuration and context, Request and Response objects, Session
handling and event handling, Introduction to filters with writing simple filter
application
6 JSP architecture, JSP page life cycle, JSP elements, Expression Language, Tag
Extensions, Tag Extension API, Tag handlers, JSP Fragments, Tag Files, JSTL,
Core Tag library, overview of XML Tag library, SQL Tag library and Functions
Tag library
Syllabus of
UNDERGRADUATE DEGREE COURSE
B.Tech. VI Semester
Computer Science and Engineering
Rajasthan Technical University, Kota

Effective from session: 2019 – 2020
Syllabus
III Year-VI Semester: B.Tech. Computer Science and Engineering
6CS3-01: Digital Image Processing

SN Contents Hours
2 Introduction to Image Processing: Digital Image representation,

Sampling & Quantization, Steps in image Processing, Image 04
acquisition, color image representation.
3 Image Transformation & Filtering: Intensity transform functions,

histogram processing, Spatial filtering, Fourier transforms and its
06
properties, frequency domain filters, colour models, Pseudo
colouring, colour transforms, Basics of Wavelet Transforms.
4 Image Restoration: Image degradation and restoration process,

Noise Models, Noise Filters, degradation function, Inverse Filtering, 07
Homomorphism Filtering.
5 Image Compression: Coding redundancy, Interpixel redundancy,

Psychovisual redundancy, Huffman Coding, Arithmetic coding, 05
Lossy compression techniques, JPEG Compression.
6 Image Segmentation & Representation: Point, Line and Edge

Detection, Thresholding, Edge and Boundary linking, Hough
05
transforms, Region Based Segmentation, Boundary representation,
Boundary Descriptors.
Total 28
Syllabus
6CS4-02:Machine Learning

SN Contents Hours
2 Supervised learning algorithm: Introduction, types of learning,

application, Supervised learning: Linear Regression Model, Naive
09
Bayes classifier Decision Tree, K nearest neighbor, Logistic
Regression, Support Vector Machine, Random forest algorithm
3 Unsupervised learning algorithm: Grouping unlabelled items

using k-means clustering, Hierarchical Clustering, Probabilistic 08
clustering, Association rule mining, Apriori Algorithm, f-p growth
algorithm, Gaussian mixture model.
4 Introduction to Statistical Learning Theory, Feature extraction -
Principal component analysis, Singular value decomposition.
Feature selection – feature ranking and subset selection, filter, 08
wrapper and embedded methods, Evaluating Machine Learning
algorithms and Model Selection.
5 Semi supervised learning, Reinforcement learning: Markov

decision process (MDP), Bellman equations, policy evaluation using
Monte Carlo, Policy iteration and Value iteration, Q-Learning, State- 08
Action-Reward-State-Action (SARSA), Model-based Reinforcement
Learning.
6 Recommended system, Collaborative filtering, Content-based

filtering Artificial neural network, Perceptron, Multilayer network, 08
Backpropagation, Introduction to Deep learning.
Total 42
Syllabus
6CS4-03: Information Security System
Credit:2 Max. Marks: 100(IA:20, ETE:80)

SN Contents Hours
2 Introduction to security attacks: services and mechanism,

classical encryption techniques- substitution ciphers and 06
transposition ciphers, cryptanalysis, stream and block ciphers.
3 Modern block ciphers: Block Cipher structure, Data Encryption

standard (DES) with example, strength of DES, Design principles of
block cipher, AES with structure, its transformation functions, key
expansion, example and implementation. 06
Multiple encryption and triple DES, Electronic Code Book, Cipher
Block Chaining Mode, Cipher Feedback mode, Output Feedback
mode, Counter mode.
4 Public Key Cryptosystems with Applications: Requirements and

Cryptanalysis, RSA cryptosystem, Rabin cryptosystem, Elgamal 06
cryptosystem, Elliptic curve cryptosystem.
5 Cryptographic Hash Functions, their applications: Simple hash

functions, its requirements and security, Hash functions based on
Cipher Block Chaining, Secure Hash Algorithm (SHA).
Message Authentication Codes, its requirements and security, 05

MACs based on Hash Functions, Macs based on Block Ciphers.
Digital Signature, its properties, requirements and security, various
digital signature schemes (Elgamal and Schnorr), NIST digital
Signature algorithm.
6 Key management and distribution: symmetric key distribution

using symmetric and asymmetric encryptions, distribution of
public keys, X.509 certificates, Public key infrastructure. Remote
user authentication with symmetric and asymmetric encryption, 04
Kerberos
Web Security threats and approaches, SSL architecture and

protocol, Transport layer security, HTTPS and SSH.
Total 28
Syllabus
6CS4-04: Computer Architecture and Organization

SN Contents Hours

2 Computer Data Representation: Basic computer data types,
Complements, Fixed point representation, Register Transfer and
Micro-operations: Floating point representation, Register Transfer
language, Register Transfer, Bus and Memory Transfers (Tree-State
Bus Buffers, Memory Transfer), Arithmetic Micro-Operations, Logic
Micro-Operations, Shift Micro-Operations, Arithmetic logical shift 10
unit. Basic Computer Organization and DesignInstruction codes,
Computer registers, computer instructions, Timing and Control,
Instruction cycle, Memory-Reference Instructions, Input-output
and interrupt, Complete computer description, Design of Basic
computer, design of Accumulator Unit.
3 Programming The Basic Computer: Introduction, Machine
Language, Assembly Language, assembler, Program loops,
Programming Arithmetic and logic operations, subroutines, I-O
7
Programming. Micro programmed Control: Control Memory,
Address sequencing, Micro program Example, design of control
Unit
4 Central Processing Unit: Introduction, General Register
Organization, Stack Organization, Instruction format, Addressing
Modes, data transfer and manipulation, Program Control, Reduced
Instruction Set Computer (RISC)Pipeline And Vector Processing, 8
Flynn's taxonomy, Parallel Processing, Pipelining, Arithmetic
Pipeline, Instruction, Pipeline, RISC Pipeline, Vector Processing,
Array Processors
5 Computer Arithmetic: Introduction, Addition and subtraction,
Multiplication Algorithms (Booth Multiplication Algorithm), Division
Algorithms, Floating Point Arithmetic operations, Decimal
Arithmetic Unit. Input-Output Organization, Input-Output 8
Interface, Asynchronous Data Transfer, Modes Of Transfer, Priority
Interrupt, DMA, Input-Output Processor (IOP), CPUIOP
Communication, Serial communication.
6 Memory Organization: Memory Hierarchy, Main Memory,
Auxiliary Memory, Associative Memory, Cache Memory, Virtual
Memory.
Multipreocessors: Characteristics of Multiprocessors, 8
Interconnection Structures, Inter-processor Arbitration, Inter-
processor Communication and Synchronization, Cache Coherence,
Shared Memory Multiprocessors.
Total 42
Syllabus
6CS4-05: Artificial Intelligence

SN Contents Hours
2 Introduction to AI and Intelligent agent: Different Approach of

AI, Problem Solving : Solving Problems by Searching, Uninformed
search, BFS, DFS, Iterative deepening, Bi directional search, Hill 03
climbing, Informed search techniques: heuristic, Greedy search,
A* search, AO* search, constraint satisfaction problems.
3 Game Playing: Minimax, alpha-beta pruning, jug problem, chess

06
problem, tiles problem
4 Knowledge and Reasoning: Building a Knowledge Base:

Propositional logic, first order logic, situation calculus. Theorem
Proving in First Order Logic. Planning, partial order planning. 06
Uncertain Knowledge and Reasoning, Probabilities, Bayesian
Networks.
5 Learning: Overview of different forms of learning, Supervised base

learning: Learning Decision Trees, SVM, Unsupervised based 07
learning, Market Basket Analysis, Neural Networks.
6 Introduction to Natural Language Processing: Different issue

05
involved in NLP, Expert System, Robotics.
Total 28
Syllabus
6CS4-06: Cloud Computing

SN Contents Hours
Introduction Cloud Computing: Nutshell of cloud computing,
Enabling Technology, Historical development, Vision, feature
Characteristics and components of Cloud Computing. Challenges,
06
Risks and Approaches of Migration into Cloud. Ethical Issue in
Cloud Computing, Evaluating the Cloud's Business Impact and
economics, Future of the cloud. Networking Support for Cloud
Computing. Ubiquitous Cloud and the Internet of Things
3 Cloud Computing Architecture: Cloud Reference Model, Layer
and Types of Clouds, Services models, Data centre Design and
interconnection Network, Architectural design of Compute and
Storage Clouds. Cloud Programming and Software: Fractures of 10
cloud programming, Parallel and distributed programming
paradigms-Map Reduce, Hadoop, High level Language for Cloud.
Programming of Google App engine.
4 Virtualization Technology: Definition, Understanding and
Benefits of Virtualization. Implementation Level of Virtualization,
Virtualization Structure/Tools and Mechanisms, Hypervisor
10
VMware, KVM, Xen. Virtualization: of CPU, Memory, I/O Devices,
Virtual Cluster and Resources Management, Virtualization of
Server, Desktop, Network, and Virtualization of data-centre.
5 Securing the Cloud: Cloud Information security fundamentals,
Cloud security services, Design principles, Policy Implementation,
Cloud Computing Security Challenges, Cloud Computing Security
Architecture . Legal issues in cloud Computing. Data Security in 08
Cloud: Business Continuity and Disaster Recovery , Risk Mitigation
, Understanding and Identification of Threats in Cloud, SLA-Service
Level Agreements, Trust Management
6 Cloud Platforms in Industry: Amazon web services , Google
AppEngine, Microsoft Azure Design, Aneka: Cloud Application
Platform -Integration of Private and Public Clouds Cloud 07
applications: Protein structure prediction, Data Analysis, Satellite
Image Processing, CRM
Total 42
Syllabus
6CS5-11: Distributed System

SN Contents Hours
2 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
06
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.
3 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 05
not included).Inter-process Communication and Coordination: Message
Passing, Request/Reply and Transaction Communication, Name and
Directory services, RPC and RMI case studies
4 Distributed Process Scheduling: A System Performance Model, Static

Process Scheduling with Communication, Dynamic Load Sharing and
Balancing, Distributed Process Implementation. Distributed File Systems:
Transparencies and Characteristics of DFS, DFS Design and 06
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
5 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, Modelling a 06
Distributed Computation, Failures in a Distributed System, Distributed
Mutual Exclusion, Election, Distributed Deadlock handling, Distributed
termination detection.
6 Distributed Agreement: Concept of Faults, failure and recovery,

Byzantine Faults, Adversaries, Byzantine Agreement, Impossibility of
Consensus and Randomized Distributed Agreement. Replicated Data
05
Management: concepts and issues, Database Techniques, Atomic
Multicast, and Update Propagation. CORBA case study: Introduction,
Architecture, CORBA RMI, CORBA Services.
Total 28
Syllabus
6CS5-12: Software Defined Network

SN Contents Hours
2 History and Evolution of Software Defined Networking (SDN):

Separation of Control Plane and Data Plane, IETF Forces, Active
Networking. 03
Control and Data Plane Separation: Concepts, Advantages and
Disadvantages, the Open Flow protocol.
3 Network Virtualization: Concepts, Applications, Existing

Network Virtualization Framework (VMWare and others), Mininet
05
based examples. Control Plane: Overview, Existing SDN
Controllers including Floodlight and Open Daylight projects.
4 Customization of Control Plane: Switching and Firewall

Implementation using SDN Concepts. Data Plane: Software-based 07
and Hardware-based; Programmable Network Hardware.
5 Programming SDNs: Northbound Application Programming

Interface, Current Languages and Tools, Composition of SDNs.
Network Functions Virtualization (NFV) and 07
Software Defined Networks: Concepts, Implementation and
Applications.
6 Data Center Networks: Packet, Optical and Wireless

Architectures, Network Topologies. Use Cases of SDNs: Data
Centers, Internet Exchange Points, Backbone Networks, Home 05
Networks, Traffic Engineering. Programming Assignments for
implementing some of the theoretical concepts listed above.
Total 28
Syllabus
6CS5-13: Ecommerce & ERP

SN Contents Hours
2 Introduction to E-Commerce: Defining Commerce; Main Activities of
Electronic Commerce; Benefits of E-Commerce; Broad Goals of Electronic
Commerce; Main Components of E-Commerce; Functions of Electronic
Commerce – Communication, Process Management, Service Management,
03
Transaction Capabilities; Process of E-Commerce; Types of E-Commerce;
Role of Internet and Web in E-Commerce; Technologies Used; E-
Commerce Systems; Pre-requisites of E-Commerce; Scope of E-
Commerce; E-Business Models.
3 E-Commerce Activities: Various Activities of E-Commerce; Various

Modes of Operation Associated with E-Commerce; Matrix of E-Commerce
Types; Elements and Resources Impacting E-Commerce and Changes;
Types of E-Commerce Providers and Vendors; Man Power Associated with
05
E-Commerce Activities; Opportunity Development for E-Commerce
Stages; Development of E-Commerce Business Case; Components and
Factors for the Development of the Business Case; Steps to Design and
Develop an E-Commerce Website.
4 Internet – The Backbone for E-Commerce: Early Ages of Internet;

Networking Categories; Characteristics of Internet; Components of
Internet – Internet Services, Elements of Internet, Uniform Resource 07
Locators, Internet Protocol; Shopping Cart, Cookies and E-Commerce;
Web Site Communication; Strategic Capabilities of Internet.
5 ISP, WWW and Portals: Internet Service Provider (ISP); World Wide Web
(WWW); Portals – Steps to build homepage, Metadata; Advantages of
Portal; Enterprise Information Portal (EIP).E-Commerce & Online 07
Publishing: This unit explains the concept of online publishing, strategies
and approaches of online publishing, and online advertising.
6 XML and Data Warehousing: Definition of eXtensible Markup Language

(XML); XML Development Goals; Comparison between HTML and XML;
Business importance in using XML Based Technology; Advantages,
Disadvantages and Applications of XML; Structure of an XML Document;
XHTML and X/Secure; Data Warehousing; Data Marts and Operational
Data Stores. 05
E-Marketing: Traditional Marketing; E-Marketing; Identifying Web
Presence Goals – Achieving web presence goals, Uniqueness of the web,
Meeting the needs of website visitors, Site Adhesion: Content, format and
access; Maintaining a Website; Metrics Defining Internet Units of
Measurement; Online Marketing; Advantages of Online Marketing.
28
Syllabus
6CS4-21: Digital Image Processing Lab
Credit: 1.5 Max. Marks: 75(IA:45, ETE:30)

Point-to-point transformation. This laboratory experiment provides for

thresholding an image and the evaluation of its histogram. Histogram
1
equalization. This experiment illustrates the relationship among the
intensities (gray levels) of an image and its histogram.
Geometric transformations. This experiment shows image rotation, scaling,

2
and translation. Two-dimensional Fourier transform
3 Linear filtering using convolution. Highly selective filters.
Ideal filters in the frequency domain. Non Linear filtering using convolutional
4 masks. Edge detection. This experiment enables students to understand the
concept of edge detectors and their operation in noisy images.
Morphological operations: This experiment is intended so students can

appreciate the effect of morphological operations using a small structuring
5 element on simple binary images. The operations that can be performed are
erosion, dilation, opening, closing, open-close, close-open.
Syllabus
6CS4-22: Machine Learning Lab

1 Implement and demonstrate the FIND-Salgorithm for finding the most specific
hypothesis based on a given set of training data samples. Read the training
data from a .CSV file.
2 For a given set of training data examples stored in a .CSV file, implement and
demonstrate the Candidate-Elimination algorithmto output a description of the
set of all hypotheses consistent with the training examples.
3 Write a program to demonstrate the working of the decision tree based ID3
algorithm. Use an appropriate data set for building the decision tree and apply
this knowledge toclassify a new sample
4 Build an Artificial Neural Network by implementing the Backpropagation

algorithm and test the same using appropriate data sets
5 Write a program to implement the naïve Bayesian classifier for a sample
training data set stored as a .CSV file. Compute the accuracy of the classifier,
considering few test data sets.
6 Assuming a set of documents that need to be classified, use the naïve Bayesian
Classifier model to perform this task. Built-in Java classes/API can be used to
write the program. Calculate the accuracy, precision, and recall for your data
set.
7 Write a program to construct aBayesian network considering medical data. Use
this model to demonstrate the diagnosis of heart patients using standard Heart
Disease Data Set. You can use Java/Python ML library classes/API.
8 Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same
data set for clustering using k-Means algorithm. Compare the results of these
two algorithms and comment on the quality of clustering. You can add
Java/Python ML library classes/API in the program.
9 Write a program to implement k-Nearest Neighbour algorithm to classify the
iris data set. Print both correct and wrong predictions. Java/Python ML library
classes can be used for this problem.
10 Implement the non-parametric Locally Weighted Regression algorithm in order
to fit data points. Select appropriate data set for your experiment and draw
graphs.
Syllabus
6CS4-23: Python Lab

1 Write a program to demonstrate basic data type in python.
2 Write a program to compute distance between two points taking input from the
user
Write a program add.py that takes 2 numbers as command line arguments and
prints its sum.
3 Write a Program for checking whether the given number is an even number or
not.
Using a for loop, write a program that prints out the decimal equivalents of
1/2, 1/3, 1/4, . . . , 1/10
4 Write a Program to demonstrate list and tuple in python.
Write a program using a for loop that loops over a sequence.
Write a program using a while loop that asks the user for a number, and prints
a countdown from that number to zero.
5 Find the sum of all the primes below two million.
By considering the terms in the Fibonacci sequence whose values do not
exceed four million, WAP to find the sum of the even-valued terms.
6 Write a program to count the numbers of characters in the string and store
them in a dictionary data structure
Write a program to use split and join methods in the string and trace a
birthday of a person with a dictionary data structure
7 Write a program to count frequency of characters in a given file. Can you use
character frequency to tell whether the given file is a Python program file, C
program file or a text file?
Write a program to count frequency of characters in a given file. Can you use
character frequency to tell whether the given file is a Python program file, C
program file or a text file?
8 Write a program to print each line of a file in reverse order.

Write a program to compute the number of characters, words and lines in a
file.
9 Write a function nearly equal to test whether two strings are nearly equal. Two
strings a and b are nearly equal when a can be generated by a single mutation
on.
Write function to compute gcd, lcm of two numbers. Each function shouldn’t
exceed one line.
10 Write a program to implement Merge sort.
Write a program to implement Selection sort, Insertion sort.
Syllabus
6CS4-24: Mobile Application Development Lab

1 To study Android Studio and android studio installation. Create “Hello

World” application.
2 To understand Activity, Intent, Create sample application with login

module.(Check username and password).
3 Design simple GUI application with activity and intents e.g. calculator.
4 Develop an application that makes use of RSS Feed.
5 Write an application that draws basic graphical primitives on the screen
6 Create an android app for database creation using SQLite Database.
7 Develop a native application that uses GPS location information
8 Implement an application that writes data to the SD card.
9 Design a gaming application
10 Create an application to handle images and videos according to size.

Computer Science and Engineering: Syllabus of Undergraduate Degree Course

Uploaded by

Copyright:

Available Formats

Computer Science and Engineering: Syllabus of Undergraduate Degree Course

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Computer Science and Engineering: Syllabus of Undergraduate Degree Course

Uploaded by

Copyright:

Available Formats

Syllabus of

UNDERGRADUATE DEGREE COURSE

Computer Science and Engineering

Rajasthan Technical University, Kota

5CS3-01: Information Theory & Coding

Credit: 2 Max. Marks: 100(IA:20, ETE:80)

1 Introduction:Objective, scope and outcome of the course. 01

2 Introduction to information theory: Uncertainty, Information

6 Convolutional Code: Convolutional encoders of different rates.

5CS4-02: Compiler Design

Credit: 3 Max. Marks: 150(IA:30, ETE:120)

1 Introduction:Objective, scope and outcome of the course. 01

2 Introduction: Objective, scope and outcome of the course.

5CS4-03: Operating System

1 Introduction:Objective, scope and outcome of the course. 01

2 Introduction and History of Operating systems: Structure and

Processor management: inter process communication, mutual exclusion, 04

3 Memory management: contiguous memory allocation, virtual memory,

4 Deadlock: Shared resources, resource allocation and scheduling,

File management: file concept, types and structures, directory structure,

5CS4-04: Computer Graphics & Multimedia

Credit: 3 Max. Marks: 150(IA:30, ETE:120)

1 Introduction: Objective, scope and outcome of the course. 01

2 Basic of Computer Graphics:Basic of Computer Graphics, Applications

3 Graphics Primitives:Points, lines, circles and ellipses as primitives, scan

4 Two Dimensional Graphics:Transformations (translation, rotation,

5 Three Dimensional Graphics:3D display methods, polygon surfaces,

6 Illumination and Colour Models:Light sources – basic illumination

7 Animations &Realism:Design of Animation sequences – animation

5CS4-05: Analysis of Algorithms

Credit: 3 Max. Marks: 150(IA:30, ETE:120)

1 Introduction: Objective, scope and outcome of the course. 01

2 Background: Review of Algorithm, Complexity Order Notations: definitions and

Pattern Matching Algorithms: Naïve and Rabin Karp string matching

5CS5-11: Wireless Communication

Credit: 2 Max. Marks: 100(IA:20, ETE:80)

1 Introduction: Objective, scope and outcome of the course. 01

2 Wireless Channels:Large scale path loss – Path loss models: Free

5CS5-12: Human Computer Interaction

1 Introduction: Objective, scope and outcome of the course. 01

2 Historical evolution of the field, Interactive system design, Concept

2 Model-based Design and evaluation: Basic idea, introduction to

Credit: 2 Max. Marks: 100(IA:20, ETE:80)

1 Introduction: Objective, scope and outcome of the course. 01

2 Introduction: Basics of biology 02

3 Sequences: Problem Statement, Edit distance and substitution

5CS4-21: Computer Graphics & Multimedia Lab

Credit: 1 Max. Marks:50 (IA:30, ETE:20)

1 Implementation of Line, Circle and ellipse attributes

2 To plot a point (pixel) on the screen

3 To draw a straight line using DDA Algorithm

4 Implementation of mid-point circle generating Algorithm

5 Implementation of ellipse generating Algorithm

6 Two Dimensional transformations - Translation, Rotation, Scaling, Reflection, Shear

8 Cohen Sutherland 2D line clipping and Windowing

9 Sutherland – Hodgeman Polygon clipping Algorithm

10 Three dimensional transformations - Translation, Rotation, Scaling

12 Drawing three dimensional objects and Scenes