RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Syllabus
III Year-V Semester: B.Tech. Computer Science and Engineering
Syllabus of 5CS3-01: Information Theory & Coding

UNDERGRADUATE DEGREE COURSE 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

B.Tech. V Semester 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,
Computer Science and Engineering Huffman code, Shanon-Fane code &Hempel-Ziv coding channel
capacity. Channel coding theorem. Shannon limit.
05

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

Rajasthan Technical University, Kota

Effective from session: 2019 – 2020

rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-V Semester: B.Tech. Computer Science and Engineering III Year-V Semester: B.Tech. Computer Science and Engineering

5CS4-02: Compiler Design

5CS4-03: Operating System
Credit: 3 Max. Marks: 150(IA:30, ETE:120) Credit: 3 Max. Marks: 150(IA:30, ETE:120)
3L+0T+0P End Term Exam: 3 Hours 3L+0T+0P End Term Exam: 3 Hours
SN Contents Hours SN Contents Hours

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

2 Introduction: Objective, scope and outcome of the course. 2 Introduction and History of Operating systems: Structure and
Compiler, Translator, Interpreter definition, Phase of compiler, operations; processes and files
Bootstrapping, Review of Finite automata lexical analyzer, Input, 06 04
Processor management: inter process communication, mutual exclusion,
Recognition of tokens, Idea about LEX: A lexical analyzer
semaphores, wait and signal procedures, process scheduling and
generator, Error handling.
algorithms, critical sections, threads, multithreading
3 Review of CFG Ambiguity of grammars: Introduction to parsing.
Top down parsing, LL grammars & passers error handling of LL 3 Memory management: contiguous memory allocation, virtual memory,
parser, Recursive descent parsing predictive parsers, Bottom up paging, page table structure, demand paging, page replacement policies, 05
parsing, Shift reduce parsing, LR parsers, Construction of SLR, 10 thrashing, segmentation, case study
Conical LR & LALR parsing tables, parsing with ambiguous 4 Deadlock: Shared resources, resource allocation and scheduling,
grammar. Operator precedence parsing, Introduction of automatic resource graph models, deadlock detection, deadlock avoidance, deadlock
parser generator: YACC error handling in LR parsers. prevention algorithms 15
4 Syntax directed definitions; Construction of syntax trees, S-
Attributed Definition, L-attributed definitions, Top down Device management: devices and their characteristics, device drivers,
device handling, disk scheduling algorithms and policies
translation. Intermediate code forms using postfix notation, DAG,
10
Three address code, TAC for various control structures, File management: file concept, types and structures, directory structure,
Representing TAC using triples and quadruples, Boolean 5 cases studies, access methods and matrices, file security, user 07
expression and control structures. authentication
5 Storage organization; Storage allocation, Strategies, Activation
UNIX and Linux operating systems as case studies; Time OS and case
records, Accessing local and non-local names in a block structured 6 08
08 studies of Mobile OS
language, Parameters passing, Symbol table organization, Data
structures used in symbol tables. Total 40
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

rd rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-V Semester: B.Tech. Computer Science and Engineering III Year-V Semester: B.Tech. Computer Science and Engineering

5CS4-04: Computer Graphics & Multimedia 5CS4-05: Analysis of Algorithms

Credit: 3 Max. Marks: 150(IA:30, ETE:120) Credit: 3 Max. Marks: 150(IA:30, ETE:120)
3L+0T+0P End Term Exam: 3 Hours 3L+0T+0P End Term Exam: 3 Hours
SN Contents Hours SN Contents Hours

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

2 Basic of Computer Graphics:Basic of Computer Graphics, Applications 2 Background: Review of Algorithm, Complexity Order Notations: definitions and
of computer graphics, Display devices, Random and Raster scan systems, 06 calculating complexity.
Graphics input devices, Graphics software and standards 06
Divide And Conquer Method: Binary Search, Merge Sort, Quick sort and
3 Graphics Primitives:Points, lines, circles and ellipses as primitives, scan Strassen's matrix multiplication algorithms.
conversion algorithms for primitives, Fill area primitives including scan-
line polygon filling, inside-outside test, boundary and flood-fill, character 07 3 Greedy Method: Knapsack Problem, Job Sequencing, Optimal Merge Patterns
generation, line attributes, area-fill attributes, character attributers. and Minimal Spanning Trees.
Aliasing, and introduction to Anti Aliasing (No anti aliasing algorithm). 10
Dynamic Programming: Matrix Chain Multiplication. Longest
4 Two Dimensional Graphics:Transformations (translation, rotation, CommonSubsequence and 0/1 Knapsack Problem.
scaling), matrix representation, homogeneous coordinates, composite
transformations, reflection and shearing, viewing pipeline and 4 Branch And Bound: Traveling Salesman Problem and Lower Bound Theory.
08
coordinates system, window-to-viewport transformation, clipping Backtracking Algorithms and queens problem. 08
including point clipping, line clipping (cohen-sutherland, liang- bersky,
NLN), polygon clipping Pattern Matching Algorithms: Naïve and Rabin Karp string matching
algorithms, KMP Matcher and Boyer Moore Algorithms.
5 Three Dimensional Graphics:3D display methods, polygon surfaces,
tables, equations, meshes, curved lies and surfaces, quadric surfaces, 5 Assignment Problems: Formulation of Assignment and Quadratic Assignment
spline representation, cubic spline interpolation methods, Bazier curves Problem.
and surfaces, B-spline curves and surfaces.3D scaling, rotation and 08
translation, composite transformation, viewing pipeline and coordinates, Randomized Algorithms- Las Vegas algorithms, Monte Carlo algorithms, 08
parallel and perspective transformation, view volume and general (parallel randomized algorithm for Min-Cut, randomized algorithm for 2- SAT. Problem
and perspective) projection transformations. definition of Multicommodity flow, Flow shop scheduling and Network capacity
assignment problems.
6 Illumination and Colour Models:Light sources – basic illumination
models – halftone patterns and dithering techniques; Properties of light – 6 Problem Classes Np, Np-Hard And Np-Complete: Definitions of P, NP-Hard
Standard primaries and chromaticity diagram; Intuitive colour concepts – 06 and NP-Complete Problems. Decision Problems.Cook's Theorem. Proving NP-
RGB colour model – YIQ colour model – CMY colour model – HSV colour 08
Complete Problems - Satisfiability problem and Vertex Cover Problem.
model – HLS colour model; Colour selection.
Approximation Algorithms for Vertex Cover andSet Cover Problem.
7 Animations &Realism:Design of Animation sequences – animation
Total 41
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

rd rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-V Semester: B.Tech. Computer Science and Engineering III Year-V Semester: B.Tech. Computer Science and Engineering

5CS5-11: Wireless Communication

5CS5-12: Human Computer Interaction
Credit: 2 Max. Marks: 100(IA:20, ETE:80) Credit: 2 Max. Marks: 100(IA:20, ETE:80)
2L+0T+0P End Term Exam: 2 Hours 2L+0T+0P End Term Exam: 2 Hours
SN Contents Hours SN Contents Hours
1 Introduction: Objective, scope and outcome of the course. 01 1 Introduction: Objective, scope and outcome of the course. 01
2 Wireless Channels:Large scale path loss – Path loss models: Free 2 Historical evolution of the field, Interactive system design, Concept
Space and Two-Ray models -Link Budget design – Small scale of usability -definition and elaboration, HCI and software 02
fading- Parameters of mobile multipath channels – Time dispersion Engineering, GUI design and Aesthetics, Prototyping techniques.
parameters-Coherence bandwidth – Doppler spread & Coherence 06
time, Fading due to Multipath time delay spread – flat fading – 2 Model-based Design and evaluation: Basic idea, introduction to
frequency selective fading – Fading due to Doppler spread – fast different types of models, GOMS family of models (KLM and CMN- 03
fading – slow fading. GOMS), Fitts’ law and Hick-Hyman’s law, Model-based design case
3 Cellular Architecture: Multiple Access techniques - FDMA, studies,
TDMA, CDMA – Capacity calculations–Cellular concept- Frequency 3 Guidelines in HCI:Shneiderman’s eight, golden rules, Norman’s
reuse - channel assignment- hand off- interference & system 05
seven principles, Norman’s model of interaction, Nielsen’s ten 05
capacity- trunking & grade of service – Coverage and capacity heuristics with example of its use Heuristic evaluation, Contextual
improvement. inquiry, Cognitive walkthrough
4 Digital Signaling For Fading Channels: Structure of a wireless 4 Empirical research methods in HCI: Introduction (motivation,
communication link, Principles of Offset-QPSK, p/4-DQPSK, 06
05 issues, research question formulation techniques), Experiment
Minimum Shift Keying, Gaussian Minimum Shift Keying, Error design and data analysis (with explanation of one-way ANOVA)
performance in fading channels, OFDM principle – Cyclic prefix, 5 Task modelling and analysis: Hierarchical task analysis (HTA),
Windowing, PAPR. Engineering task models and Concur Task Tree (CTT),Iintroduction 06
5 Multipath Mitigation Techniques: Equalisation – Adaptive to formalism in dialog design, design using FSM (finite state
equalization, Linear and Non-Linear equalization, Zero forcing and machines) State charts and (classical) Petri Nets in dialog design
LMS Algorithms. Diversity – Micro and Macrodiversity, Diversity 06 6 Introduction to CA, CA types, relevance of CA in IS design Model
05
combining techniques, Error probability in fading channels with Human Processor (MHP), OOP- Introduction OOM- Object
Oriented Modeling of User Interface Design
diversity reception, Rake receiver,
Total 28
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

rd rd
 BIKANER TECHNICAL UNIVERSITY, BIKANER
RAJASTHAN TECHNICAL UNIVERSITY, KOTA chdkusj rduhdh fo”ofo|ky;] chdkusj
Syllabus
University College of Engineering & Technology, Bikaner Campus Karni Industrial Area.
III Year-V Semester: B.Tech. Computer Science and Engineering Pugal Road, Bikaner Pin Code: 334004 Ph. 0151-2250948
5CS5-13: Bioinformatics 5CS5-14: Understanding the Human Being Comprehensively
Credit: 2 Max. Marks: 100(IA:20, ETE:80) – Human Aspirations and its Fulfillment
2L+0T+0P End Term Exam: 2 Hours (Professional Elective Course)
SN Contents Hours
Prerequisites: Universal Human Values and Professional Ethics
1 Introduction: Objective, scope and outcome of the course. 01
Course Objectives:
2 Introduction: Basics of biology 02
1. To help the students having the clarity about human aspirations, goal, activities and
3 Sequences: Problem Statement, Edit distance and substitution purpose of life.
matrices, HMMs and pairwise HMMs, Global and local alignments, 2. To facilitate the competence to understand the harmony in nature/existence and
Spliced alignment, Space-efficient sequence alignment, Multiple 07 participation of human being in the nature/existence.
alignment, Database searching tools, Sequence by hybridization, 3. To help the students to develop the understanding of human tradition and its various
components.
Profile HMMs
4 Structures: Protein structure alignment, Protein structure 06 Course Methodology:
prediction
5 Phylogenetic trees: Large parsimony and small parsimony 07 1. The methodology of this course is explorational and thus universally adaptable. It
problems, Probabilistic approaches, Grammar-based approaches involves a systematic and rational study of the human being vis-a-vis the rest of
existence.
6 Miscellaneous topics: Pathways and networks, Microarrays, 05 2. It is free from any dogma or set of dos and don’ts related to values.
Biomedical images 3. It is a process of self-investigation and self-exploration, and not of giving sermons.
Total 28 Whatever is found as truth or reality is stated as a proposal and the students are
facilitated and encouraged to verify it in their own right, based on their Natural
Acceptance and subsequent Experiential Validation.
4. This process of self-exploration takes the form of a dialogue between the teacher and
the students to begin with, and then to continue within the student leading to
continuous self-evolution.
5. This self-exploration also enables them to critically evaluate their pre-conditionings
and present beliefs.

Course Content

Unit 1:Introduction - The basic human aspirations and their fulfillment through Right
understanding and Resolution; All-encompassing Resolution for a Human Being, its details
and solution of problems in the light of Resolution

Unit 2: Understanding Human Being and its Expansion -The domain of right
understanding starts from understanding the human being (the knower, the experiencer and
the doer).; and extends up to understanding nature/existence – its interconnectedness and co-
existence; and finally understanding the role of human being in existence (human conduct).

rd Applicable for students studying in 5th semester of BTU from academic session 2020-21 & onwards.
 BIKANER TECHNICAL UNIVERSITY, BIKANER
chdkusj rduhdh fo”ofo|ky;] chdkusj RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus
University College of Engineering & Technology, Bikaner Campus Karni Industrial Area.
Pugal Road, Bikaner Pin Code: 334004 Ph. 0151-2250948 III Year-V Semester: B.Tech. Computer Science and Engineering

Unit 3: Activities of the Self -Understanding the human being comprehensively is the first 5CS4-21: Computer Graphics & Multimedia Lab
step and the core theme of this course; human being as co-existence of the self and the body;
the activities and potentialities of the self; Reasons for harmony/contradiction in the self Credit: 1 Max. Marks:50 (IA:30, ETE:20)
0L+0T+2P End Term Exam: 2 Hours
Unit 4:Understanding Co-existence with other orders -The need and the process of inner SN List of Experiments
evolution (through self-exploration, self-awareness and self-evaluation)- particularly
awakening to activities of the Self: Realization, Understanding and Contemplation in the Self 1 Implementation of Line, Circle and ellipse attributes
(Realization of Co-Existence, Understanding of Harmony in Nature and Contemplation of
Participation of Human in this harmony/ order leading to comprehensive knowledge about 2 To plot a point (pixel) on the screen
the existence).
3 To draw a straight line using DDA Algorithm
Unit 5: Expansion of harmony from self to entire existence -Understanding different 4 Implementation of mid-point circle generating Algorithm
aspects of All-encompassing Resolution (understanding, wisdom, science etc.), Holistic way
of living for Human Being with All-encompassing Resolution covering all four dimensions of 5 Implementation of ellipse generating Algorithm
human endeavour viz., realization, thought, behavior and work (participation in the larger
order) leading to harmony at all levels from self to Nature and entire Existence 6 Two Dimensional transformations - Translation, Rotation, Scaling, Reflection, Shear

Reference Books: 7 Composite 2D Transformations

1. A Foundation Course in Human Values and Profession Ethics (Text Book and 8 Cohen Sutherland 2D line clipping and Windowing
Teachers Manual), R. R. Gaur, R. Sangal, G. P. Bagaria (2010), Excel Books, New
Delhi [ISBN 978-8-174-46781-2] 9 Sutherland – Hodgeman Polygon clipping Algorithm
2. Avartansheel Arthshastra, A. Nagraj, Divya Path Sansthan, Amarkantak, India
3. Economy of Permanence – (a quest for social order based on non-violence), J. C. 10 Three dimensional transformations - Translation, Rotation, Scaling
Kumarappa (2010), Sarva-Seva-Sangh-Prakashan, Varansi, India
4. Energy and Equity, Ivan Illich (1974), The Trinity Press, Worcester & Harper Collins, 11 Composite 3D transformations
USA
5. IshandiNauUpnishad, Shankaracharya, Geeta press, Gorakhpur, 12 Drawing three dimensional objects and Scenes
6. Manav Vyavahar Darshan, A. Nagraj, Divya Path Sansthan, Amarkantak, India
7. Manaviya Sanvidhan, A. Nagraj, Divya Path Sansthan, Amarkantak, India 13 Generating Fractal images
8. MahasatipatthanSutta , S N Goenka, Vipassana Research Institute, First Edition, 1996
9. Small Is Beautiful: A Study of Economics as if People Mattered, E. F. Schumacher,
1973, Blond & Briggs, UK
10. Slow is Beautiful, Cecile Andrews http://www.newsociety.com/Books/S/Slow-is-
Beautiful)
11. Science & Humanism – towards a unified worldview, P. L. Dhar & R. R. Gaur
(1990), Commonwealth Publishers, New Delhi
12. Sanchian Sri Guru Granth Sahib Ji ,Shiromani GurdwaraParbhandhak Committee,
2001
13. SamanSuttam, JinendraVami ,1974.
14. Vyavaharvadi Samajshastra, A. Nagraj, Divya Path Sansthan, Amarkantak, India
15. Vyavahatmak Janvad, A. Nagraj, Divya Path Sansthan, Amarkantak, India.

Applicable for students studying in 5th semester of BTU from academic session 2020-21 & onwards. rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-V Semester: B.Tech. Computer Science and Engineering III Year-V Semester: B.Tech. Computer Science and Engineering

5CS4-22: Compiler Design Lab 5CS4-23: Analysis of Algorithms Lab

Credit: 1 Max. Marks:50 (IA:30, ETE:20) Credit: 1 Max. Marks:50 (IA:30, ETE:20)
0L+0T+2P End Term Exam: 2 Hours 0L+0T+2P End Term Exam: 2 Hours
SN List of Experiments SN List of Experiments

1 Introduction: Objective, scope and outcome of the course. 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
2 To identify whether given string is keyword or not.
of n, the number of elements in the list to be sorted and plot a graph of the
3 Count total no. of keywords in a file. [Taking file from user] time taken versus n. The elements can be read from a file or can be generated
using the random number generator.
4 Count total no of operators in a file. [Taking file from user]
2 Implement a parallelized Merge Sort algorithm to sort a given set of elements
5 Count total occurrence of each character in a given file. [Taking file from user]
and determine the time required to sort the elements. Repeat the experiment
6 Write a C program to insert, delete and display the entries in Symbol Table. 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
7 Write a LEX program to identify following:
can be generated using the random number generator.
1. Valid mobile number
2. Valid url 3 a. Obtain the Topological ordering of vertices in a given digraph. b. Compute
3. Valid identifier the transitive closure of a given directed graph using Warshall's algorithm.
4. Valid date (dd/mm/yyyy)
5. Valid time (hh:mm:ss) 4 Implement 0/1 Knapsack problem using Dynamic Programming.

8 Write a lex program to count blank spaces,words,lines in a given file. 5 From a given vertex in a weighted connected graph, find shortest paths to
other vertices using Dijkstra's algorithm.
9 Write a lex program to count the no. of vowels and consonants in a C file.
Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's
10 Write a YACC program to recognize strings aaab,abbb using a^nb^n, where b>=0. 6
algorithm.
11 Write a YACC program to evaluate an arithmetic expression involving operators +,-,*
and /.
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
12 Write a YACC program to check validity of a strings abcd,aabbcd using grammar method.
a^nb^nc^md^m, where n , m>0
Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s
13 Write a C program to find first of any grammar. 8.
algorithm.

9. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.

10 Implement N Queen's problem using Back Tracking.

rd rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus
III Year-V Semester: B.Tech. Computer Science and Engineering

5CS4-24: Advance Java Lab

Syllabus of
Credit: 1 Max. Marks:50 (IA:30, ETE:20) UNDERGRADUATE DEGREE COURSE
L+0T+2P End Term Exam: 2 Hours
SN List of Experiments

1 Introduction To Swing, MVC Architecture, Applets, Applications and Pluggable

Look and Feel, Basic swing components : Text Fields, Buttons, Toggle Buttons, B.Tech. VI Semester
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 Computer Science and Engineering
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

Rajasthan Technical University, Kota

Effective from session: 2019 – 2020

rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-VI Semester: B.Tech. Computer Science and Engineering III Year-VI Semester: B.Tech. Computer Science and Engineering

6CS3-01: Digital Image Processing 6CS4-02:Machine Learning

Credit: 2 Max. Marks: 100(IA:20, ETE:80) Credit: 3 Max. Marks: 150(IA:30, ETE:120)
2L+0T+0P End Term Exam: 2 Hours 3L+0T+0P End Term Exam: 3 Hours
SN Contents Hours SN Contents Hours

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

2 Introduction to Image Processing: Digital Image representation, 2 Supervised learning algorithm: Introduction, types of learning,
Sampling & Quantization, Steps in image Processing, Image 04 application, Supervised learning: Linear Regression Model, Naive
09
acquisition, color image representation. Bayes classifier Decision Tree, K nearest neighbor, Logistic
Regression, Support Vector Machine, Random forest algorithm
3 Image Transformation & Filtering: Intensity transform functions,
histogram processing, Spatial filtering, Fourier transforms and its 3 Unsupervised learning algorithm: Grouping unlabelled items
06 using k-means clustering, Hierarchical Clustering, Probabilistic
properties, frequency domain filters, colour models, Pseudo 08
colouring, colour transforms, Basics of Wavelet Transforms. clustering, Association rule mining, Apriori Algorithm, f-p growth
algorithm, Gaussian mixture model.
4 Image Restoration: Image degradation and restoration process, 4 Introduction to Statistical Learning Theory, Feature extraction -
Noise Models, Noise Filters, degradation function, Inverse Filtering, 07 Principal component analysis, Singular value decomposition.
Homomorphism Filtering. Feature selection – feature ranking and subset selection, filter, 08
wrapper and embedded methods, Evaluating Machine Learning
5 Image Compression: Coding redundancy, Interpixel redundancy, algorithms and Model Selection.
Psychovisual redundancy, Huffman Coding, Arithmetic coding, 05
Lossy compression techniques, JPEG Compression. 5 Semi supervised learning, Reinforcement learning: Markov
decision process (MDP), Bellman equations, policy evaluation using
6 Image Segmentation & Representation: Point, Line and Edge Monte Carlo, Policy iteration and Value iteration, Q-Learning, State- 08
Detection, Thresholding, Edge and Boundary linking, Hough Action-Reward-State-Action (SARSA), Model-based Reinforcement
05
transforms, Region Based Segmentation, Boundary representation, Learning.
Boundary Descriptors.
6 Recommended system, Collaborative filtering, Content-based
Total 28 filtering Artificial neural network, Perceptron, Multilayer network, 08
Backpropagation, Introduction to Deep learning.

Total 42

rd rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-VI Semester: B.Tech. Computer Science and Engineering III Year-VI Semester: B.Tech. Computer Science and Engineering

6CS4-03: Information Security System 6CS4-04: Computer Architecture and Organization

Credit:2 Max. Marks: 100(IA:20, ETE:80) Credit: 3 Max. Marks: 150(IA:30, ETE:120)
2L+0T+0P End Term Exam: 2 Hours 3L+0T+0P End Term Exam: 3 Hours
SN Contents Hours SN Contents Hours

1 Introduction: Objective, scope and outcome of the course. 01 1 Introduction: Objective, scope and outcome of the course. 01
2 Computer Data Representation: Basic computer data types,
2 Introduction to security attacks: services and mechanism, Complements, Fixed point representation, Register Transfer and
classical encryption techniques- substitution ciphers and 06 Micro-operations: Floating point representation, Register Transfer
transposition ciphers, cryptanalysis, stream and block ciphers. language, Register Transfer, Bus and Memory Transfers (Tree-State
Bus Buffers, Memory Transfer), Arithmetic Micro-Operations, Logic
3 Modern block ciphers: Block Cipher structure, Data Encryption
Micro-Operations, Shift Micro-Operations, Arithmetic logical shift 10
standard (DES) with example, strength of DES, Design principles of
unit. Basic Computer Organization and DesignInstruction codes,
block cipher, AES with structure, its transformation functions, key
Computer registers, computer instructions, Timing and Control,
expansion, example and implementation. 06 Instruction cycle, Memory-Reference Instructions, Input-output
Multiple encryption and triple DES, Electronic Code Book, Cipher and interrupt, Complete computer description, Design of Basic
Block Chaining Mode, Cipher Feedback mode, Output Feedback computer, design of Accumulator Unit.
mode, Counter mode. 3 Programming The Basic Computer: Introduction, Machine
Language, Assembly Language, assembler, Program loops,
4 Public Key Cryptosystems with Applications: Requirements and Programming Arithmetic and logic operations, subroutines, I-O
Cryptanalysis, RSA cryptosystem, Rabin cryptosystem, Elgamal 06 7
Programming. Micro programmed Control: Control Memory,
cryptosystem, Elliptic curve cryptosystem. Address sequencing, Micro program Example, design of control
Unit
5 Cryptographic Hash Functions, their applications: Simple hash Central Processing Unit: Introduction, General Register
4
functions, its requirements and security, Hash functions based on
Organization, Stack Organization, Instruction format, Addressing
Cipher Block Chaining, Secure Hash Algorithm (SHA). Modes, data transfer and manipulation, Program Control, Reduced
Message Authentication Codes, its requirements and security, Instruction Set Computer (RISC)Pipeline And Vector Processing, 8
05
MACs based on Hash Functions, Macs based on Block Ciphers. Flynn's taxonomy, Parallel Processing, Pipelining, Arithmetic
Digital Signature, its properties, requirements and security, various Pipeline, Instruction, Pipeline, RISC Pipeline, Vector Processing,
digital signature schemes (Elgamal and Schnorr), NIST digital Array Processors
Signature algorithm. 5 Computer Arithmetic: Introduction, Addition and subtraction,
Multiplication Algorithms (Booth Multiplication Algorithm), Division
6 Key management and distribution: symmetric key distribution Algorithms, Floating Point Arithmetic operations, Decimal
using symmetric and asymmetric encryptions, distribution of Arithmetic Unit. Input-Output Organization, Input-Output 8
public keys, X.509 certificates, Public key infrastructure. Remote Interface, Asynchronous Data Transfer, Modes Of Transfer, Priority
user authentication with symmetric and asymmetric encryption, 04 Interrupt, DMA, Input-Output Processor (IOP), CPUIOP
Kerberos Communication, Serial communication.
6 Memory Organization: Memory Hierarchy, Main Memory,
Web Security threats and approaches, SSL architecture and Auxiliary Memory, Associative Memory, Cache Memory, Virtual
protocol, Transport layer security, HTTPS and SSH. Memory.
Total 28 Multipreocessors: Characteristics of Multiprocessors, 8
Interconnection Structures, Inter-processor Arbitration, Inter-
processor Communication and Synchronization, Cache Coherence,
Shared Memory Multiprocessors.
Total 42

rd rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-VI Semester: B.Tech. Computer Science and Engineering III Year-VI Semester: B.Tech. Computer Science and Engineering

6CS4-05: Artificial Intelligence 6CS4-06: Cloud Computing

Credit: 3 Max. Marks: 150(IA:30, ETE:120)
Credit: 2 Max. Marks: 100(IA:20, ETE:80)
3L+0T+0P End Term Exam: 3 Hours
2L+0T+0P End Term Exam: 2 Hours
SN Contents Hours
SN Contents Hours
1 Introduction: Objective, scope and outcome of the course. 01
1 Introduction: Objective, scope and outcome of the course. 01 2 Introduction: Objective, scope and outcome of the course.
Introduction Cloud Computing: Nutshell of cloud computing,
2 Introduction to AI and Intelligent agent: Different Approach of Enabling Technology, Historical development, Vision, feature
AI, Problem Solving : Solving Problems by Searching, Uninformed Characteristics and components of Cloud Computing. Challenges,
search, BFS, DFS, Iterative deepening, Bi directional search, Hill 03 06
Risks and Approaches of Migration into Cloud. Ethical Issue in
climbing, Informed search techniques: heuristic, Greedy search, Cloud Computing, Evaluating the Cloud's Business Impact and
A* search, AO* search, constraint satisfaction problems. economics, Future of the cloud. Networking Support for Cloud
Computing. Ubiquitous Cloud and the Internet of Things
3 Game Playing: Minimax, alpha-beta pruning, jug problem, chess
06 3 Cloud Computing Architecture: Cloud Reference Model, Layer
problem, tiles problem
and Types of Clouds, Services models, Data centre Design and
4 Knowledge and Reasoning: Building a Knowledge Base: interconnection Network, Architectural design of Compute and
Propositional logic, first order logic, situation calculus. Theorem Storage Clouds. Cloud Programming and Software: Fractures of 10
Proving in First Order Logic. Planning, partial order planning. 06 cloud programming, Parallel and distributed programming
Uncertain Knowledge and Reasoning, Probabilities, Bayesian paradigms-Map Reduce, Hadoop, High level Language for Cloud.
Networks. Programming of Google App engine.
4 Virtualization Technology: Definition, Understanding and
5 Learning: Overview of different forms of learning, Supervised base Benefits of Virtualization. Implementation Level of Virtualization,
learning: Learning Decision Trees, SVM, Unsupervised based 07 Virtualization Structure/Tools and Mechanisms, Hypervisor
learning, Market Basket Analysis, Neural Networks. 10
VMware, KVM, Xen. Virtualization: of CPU, Memory, I/O Devices,
Virtual Cluster and Resources Management, Virtualization of
6 Introduction to Natural Language Processing: Different issue
05 Server, Desktop, Network, and Virtualization of data-centre.
involved in NLP, Expert System, Robotics.
5 Securing the Cloud: Cloud Information security fundamentals,
Total 28 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

rd rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-VI Semester: B.Tech. Computer Science and Engineering III Year-VI Semester: B.Tech. Computer Science and Engineering

6CS5-11: Distributed System 6CS5-12: Software Defined Network

Credit: 2 Max. Marks: 100(IA:20, ETE:80) Credit: 2 Max. Marks: 100(IA:20, ETE:80)
2L+0T+0P End Term Exam: 2 Hours 2L+0T+0P End Term Exam: 2 Hours
SN Contents Hours
SN Contents Hours
1 Introduction: Objective, scope and outcome of the course. 01
1 Introduction: Objective, scope and outcome of the course. 01
2 Distributed Systems: Features of distributed systems, nodes of a
distributed system, Distributed computation paradigms, Model of 2 History and Evolution of Software Defined Networking (SDN):
distributed systems, Types of Operating systems: Centralized Operating Separation of Control Plane and Data Plane, IETF Forces, Active
System, Network Operating Systems, Distributed Operating Systems and
Networking. 03
Cooperative Autonomous Systems, design issues in distributed operating
06
systems. Systems Concepts and Architectures: Goals, Transparency,
Services, Architecture Models, Distributed Computing Environment (DCE).
Control and Data Plane Separation: Concepts, Advantages and
Theoretical issues in distributed systems: Notions of time and state, states Disadvantages, the Open Flow protocol.
and events in a distributed system, time, clocks and event precedence,
recording the state of distributed systems. 3 Network Virtualization: Concepts, Applications, Existing
Network Virtualization Framework (VMWare and others), Mininet
3 Concurrent Processes and Programming: Processes and Threads, Graph 05
Models for Process Representation, Client/Server Model, Time Services,
based examples. Control Plane: Overview, Existing SDN
Language Mechanisms for Synchronization, Object Model Resource Controllers including Floodlight and Open Daylight projects.
Servers, Characteristics of Concurrent Programming Languages (Language 05
not included).Inter-process Communication and Coordination: Message 4 Customization of Control Plane: Switching and Firewall
Passing, Request/Reply and Transaction Communication, Name and Implementation using SDN Concepts. Data Plane: Software-based 07
Directory services, RPC and RMI case studies and Hardware-based; Programmable Network Hardware.
4 Distributed Process Scheduling: A System Performance Model, Static
Process Scheduling with Communication, Dynamic Load Sharing and 5 Programming SDNs: Northbound Application Programming
Balancing, Distributed Process Implementation. Distributed File Systems: Interface, Current Languages and Tools, Composition of SDNs.
Transparencies and Characteristics of DFS, DFS Design and 06 Network Functions Virtualization (NFV) and
implementation, Transaction Service and Concurrency Control, Data and
07
File Replication. Case studies: Sun network file systems, General Parallel Software Defined Networks: Concepts, Implementation and
file System and Window’s file systems. Andrew and Coda File Systems Applications.
5 Distributed Shared Memory: Non-Uniform Memory Access Architectures,
Memory Consistency Models, Multiprocessor Cache Systems, Distributed 6 Data Center Networks: Packet, Optical and Wireless
Shared Memory, Implementation of DSM systems. Models of Distributed Architectures, Network Topologies. Use Cases of SDNs: Data
Computation: Preliminaries, Causality, Distributed Snapshots, Modelling a 06 Centers, Internet Exchange Points, Backbone Networks, Home 05
Distributed Computation, Failures in a Distributed System, Distributed
Networks, Traffic Engineering. Programming Assignments for
Mutual Exclusion, Election, Distributed Deadlock handling, Distributed
termination detection. implementing some of the theoretical concepts listed above.

6 Distributed Agreement: Concept of Faults, failure and recovery, Total 28

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

rd rd
 BIKANER TECHNICAL UNIVERSITY, BIKANER
RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus
chdkusj rduhdh fo”ofo|ky;] chdkusj
University College of Engineering & Technology, Bikaner Campus Karni Industrial Area.
III Year-VI Semester: B.Tech. Computer Science and Engineering Pugal Road, Bikaner Pin Code: 334004 Ph. 0151-2250948
6CS5-13: Ecommerce & ERP
6CS5-14: Values, Relationship & Ethical Human Conduct-For a Happy &
Credit: 2 Max. Marks: 100(IA:20, ETE:80) Harmonious Society
2L+0T+0P End Term Exam: 2 Hours (Professional Elective Course)
SN Contents Hours
1 Introduction: Objective, scope and outcome of the course. 01 Prerequisites: For this subject only those faculty will teach these courses who had done the FDP for
these courses.
2 Introduction to E-Commerce: Defining Commerce; Main Activities of Course Objectives:
Electronic Commerce; Benefits of E-Commerce; Broad Goals of Electronic
Commerce; Main Components of E-Commerce; Functions of Electronic 1. To help the students to understand the importance and types of relationship with
Commerce – Communication, Process Management, Service Management, expressions.
Transaction Capabilities; Process of E-Commerce; Types of E-Commerce;
03
Role of Internet and Web in E-Commerce; Technologies Used; E-
2. To develop the competence to think about the conceptual framework of undivided society
Commerce Systems; Pre-requisites of E-Commerce; Scope of E- as well as universal Human order.
Commerce; E-Business Models. 3. To help the students to develop the exposure for transition from current state to the
undivided society and universal human order.
3 E-Commerce Activities: Various Activities of E-Commerce; Various
Modes of Operation Associated with E-Commerce; Matrix of E-Commerce
Course Methodology:
Types; Elements and Resources Impacting E-Commerce and Changes;
Types of E-Commerce Providers and Vendors; Man Power Associated with
E-Commerce Activities; Opportunity Development for E-Commerce
05 1. The methodology of this course is explorational and thus universally adaptable. It
Stages; Development of E-Commerce Business Case; Components and involves a systematic and rational study of the human being vis-a-vis the rest of
Factors for the Development of the Business Case; Steps to Design and existence.
Develop an E-Commerce Website. 2. It is free from any dogma or set of do’s and don’ts related to values.
3. It is a process of self-investigation and self-exploration, and not of giving sermons.
4 Internet – The Backbone for E-Commerce: Early Ages of Internet;
Networking Categories; Characteristics of Internet; Components of Whatever is found as truth or reality is stated as a proposal and the students are facilitated
Internet – Internet Services, Elements of Internet, Uniform Resource 07 and encouraged to verify it in their own right, based on their Natural Acceptance and
Locators, Internet Protocol; Shopping Cart, Cookies and E-Commerce; subsequent Experiential Validation.
Web Site Communication; Strategic Capabilities of Internet. 4. This process of self-exploration takes the form of a dialogue between the teacher and the
students to begin with, and then to continue within the student leading to continuous self-
5 ISP, WWW and Portals: Internet Service Provider (ISP); World Wide Web
evolution.
(WWW); Portals – Steps to build homepage, Metadata; Advantages of
Portal; Enterprise Information Portal (EIP).E-Commerce & Online 07 5. This self-exploration also enables them to critically evaluate their pre-conditionings and
Publishing: This unit explains the concept of online publishing, strategies present beliefs.
and approaches of online publishing, and online advertising.
Course content
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,
Unit I: Introduction to the course - Basic aspiration of a Human Being and program for its
Disadvantages and Applications of XML; Structure of an XML Document; fulfillment, Need for family and relationship for a Human Being, Human-human relationship and
XHTML and X/Secure; Data Warehousing; Data Marts and Operational role of behavior in its fulfillment, Human-rest of Nature relationship and role of work in its
Data Stores. 05 fulfillment, Comprehensive Human Goal, Need for Undivided Society, Need for Universal
E-Marketing: Traditional Marketing; E-Marketing; Identifying Web Human Order, an appraisal of the Current State, Appraisal of Efforts in this Direction in Human
Presence Goals – Achieving web presence goals, Uniqueness of the web, History.
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

rd
Applicable for students studying in 6th semester of BTU from academic session 2020-21 and onwards.
 BIKANER TECHNICAL UNIVERSITY, BIKANER BIKANER TECHNICAL UNIVERSITY, BIKANER
chdkusj rduhdh fo”ofo|ky;] chdkusj chdkusj rduhdh fo”ofo|ky;] chdkusj
University College of Engineering & Technology, Bikaner Campus Karni Industrial Area. University College of Engineering & Technology, Bikaner Campus Karni Industrial Area.
Pugal Road, Bikaner Pin Code: 334004 Ph. 0151-2250948 Pugal Road, Bikaner Pin Code: 334004 Ph. 0151-2250948

Unit II: Understanding Human-Human Relationship & its fulfillment – Recognition of 16. Samagra kranti: Jaya Prakash Narayan’s philosophy of social change, Siddharth
Human-Human Relationship, Recognition of feelings in relationship, established values and Publications Renu Sinha, 1996.
Expressed Values in Relationship, interrelatedness of feelings and their purpose, mutual 17. Science & Humanism – towards a unified worldview, P. L. Dhar & R. R. Gaur (1990),
evaluation in relationship, meaning of justice in relationship, justice leading to culture, Commonwealth Publishers, New Delhi
civilization and human conduct. 18. Vyavaharvadi Samajshastra, A. Nagraj, Divya Path Sansthan, Amarkantak, India.
19. Vyavahatmak Janvad, A. Nagraj, Divya Path Sansthan, Amarkantak, India.
Unit III: Justice from family to world family order -Undivided Society as continuity and 20. The Communist Manifesto, Karl Marx, 1848.
expanse of Justice in behavior – family to world family order, continuity of culture and 21. Toward a True Kinship of Faiths: How the World’s Religions Can Come Together Dalai
civilization, Universal Order on the basis of Undivided Society, Conceptual Framework for Lama XIV, 2011.
Universal human order, Universal Human Order as continuity and expanse of order in living:
from family order to world family order, a conceptual framework for universal human order. Reference Videos.

Unit IV: Program for Ensuring Undivided Society and Universal Human Order -Education 1. kin school (30 minutes)
– Sanskar, Health – Sanyam, Production-work, Exchange – storage, Justice-preservation. 2. Technology (Solar City etc.).
3. Natural Farming.
Unit V: Human Tradition -Scope and Steps of Universal Human Order, Human Tradition (Ex. 4. Economics of Happiness ( 1h 8m)
Family order to world family order), Steps for transition from the current state, Possibilities of
participation of students in this direction, Present efforts in this direction, Sum up.

Text Books:

1. A Foundation Course in Human Values and Profession Ethics (Text Book and Teachers’
Manual), R. R. Gaur, R. Asthana, G. P. Bagaria (2010), Excel Books, New Delhi.
2. Avartansheel Arthshastra, A. Nagraj, Divya Path Sansthan, Amarkantak, India.
3. An Appeal by the Dalai Lama to the World: Ethics Are More Important Than Religion ,
Dalai Lama XIV, 2015.
4. Economy of Permanence – (a quest for social order based on non-violence), J. C.
Kumarappa (2010), Sarva-Seva-Sangh-Prakashan, Varansi, India.
5. Energy and Equity, Ivan Illich (1974), The Trinity Press, Worcester & Harper Collins,
USA.
6. Human Society, Kingsley Davis, 1949.
7. Hind Swaraj or, Indian home rule Mohandas K. Gandhi, 1909.
8. Integral Humanism, Deendayal Upadhyaya, 1965.
9. Lohiya Ke Vichar, Lok Bharti , Rammanohar Lohiya, 2008.
10. Manav Vyavahar Darshan, A. Nagraj, Divya Path Sansthan, Amarkantak, India.
11. Manaviya Sanvidhan, A. Nagraj, Divya Path Sansthan, Amarkantak, India
12. Samadhanatmak Bhautikvad, A. Nagraj, Divya Path Sansthan, Amarkantak, India
13. Small Is Beautiful: A Study of Economics as if People Mattered, E. F. Schumacher,
1973, Blond & Briggs, UK.
14. Slow is Beautiful, Cecile Andrews (http://www.newsociety.com/Books/S/Slow-is-
Beautiful)

15. Sociology Themes and Perspectives, Harper Collins; EIGHT edition (2014), Martin
Holborn and Peter Langley, 1980.

Applicable for students studying in 6th semester of BTU from academic session 2020-21 and onwards. Applicable for students studying in 6th semester of BTU from academic session 2020-21 and onwards.
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-VI Semester: B.Tech. Computer Science and Engineering III Year-VI Semester: B.Tech. Computer Science and Engineering

6CS4-22: Machine Learning Lab

6CS4-21: Digital Image Processing Lab

Credit: 1.5 Max. Marks: 75(IA:45, ETE:30)
Credit: 1.5 Max. Marks: 75(IA:45, ETE:30) 0L+0T+3P End Term Exam: 2 Hours
0L+0T+3P End Term Exam: 2 Hours SN List of Experiments
SN List of Experiments 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
Point-to-point transformation. This laboratory experiment provides for data from a .CSV file.
thresholding an image and the evaluation of its histogram. Histogram 2 For a given set of training data examples stored in a .CSV file, implement and
1
equalization. This experiment illustrates the relationship among the demonstrate the Candidate-Elimination algorithmto output a description of the
intensities (gray levels) of an image and its histogram. set of all hypotheses consistent with the training examples.
Geometric transformations. This experiment shows image rotation, scaling, 3 Write a program to demonstrate the working of the decision tree based ID3
2
and translation. Two-dimensional Fourier transform algorithm. Use an appropriate data set for building the decision tree and apply
this knowledge toclassify a new sample
3 Linear filtering using convolution. Highly selective filters.

Ideal filters in the frequency domain. Non Linear filtering using convolutional 4 Build an Artificial Neural Network by implementing the Backpropagation
4 masks. Edge detection. This experiment enables students to understand the algorithm and test the same using appropriate data sets
concept of edge detectors and their operation in noisy images. 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,
Morphological operations: This experiment is intended so students can considering few test data sets.
appreciate the effect of morphological operations using a small structuring 6 Assuming a set of documents that need to be classified, use the naïve Bayesian
5 element on simple binary images. The operations that can be performed are Classifier model to perform this task. Built-in Java classes/API can be used to
erosion, dilation, opening, closing, open-close, close-open. 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.

rd rd
 RAJASTHAN TECHNICAL UNIVERSITY, KOTA RAJASTHAN TECHNICAL UNIVERSITY, KOTA
Syllabus Syllabus
III Year-VI Semester: B.Tech. Computer Science and Engineering III Year-VI Semester: B.Tech. Computer Science and Engineering

6CS4-23: Python Lab 6CS4-24: Mobile Application Development Lab

Credit: 1.5 Max. Marks: 75(IA:45, ETE:30) Credit: 1.5 Max. Marks: 75(IA:45, ETE:30)
0L+0T+3P End Term Exam: 2 Hours 0L+0T+3P End Term Exam: 2 Hours
SN List of Experiments SN List of Experiments
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 1 To study Android Studio and android studio installation. Create “Hello
user World” application.
Write a program add.py that takes 2 numbers as command line arguments and
prints its sum. 2 To understand Activity, Intent, Create sample application with login
3 Write a Program for checking whether the given number is an even number or module.(Check username and password).
not.
Using a for loop, write a program that prints out the decimal equivalents of 3 Design simple GUI application with activity and intents e.g. calculator.
1/2, 1/3, 1/4, . . . , 1/10
4 Develop an application that makes use of RSS Feed.
4 Write a Program to demonstrate list and tuple in python.
Write a program using a for loop that loops over a sequence. 5 Write an application that draws basic graphical primitives on the screen
Write a program using a while loop that asks the user for a number, and prints
a countdown from that number to zero. 6 Create an android app for database creation using SQLite Database.
5 Find the sum of all the primes below two million.
By considering the terms in the Fibonacci sequence whose values do not 7 Develop a native application that uses GPS location information
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 8 Implement an application that writes data to the SD card.
them in a dictionary data structure
Write a program to use split and join methods in the string and trace a 9 Design a gaming application
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 10 Create an application to handle images and videos according to size.
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.

rd rd