RTU Syllabus Computer Science Engineering 3rd Semester: The Syllabus for RTU Computer Science engineering 3rd Semester gives students a clear understanding of the course structure and its objectives. With the latest RTU Syllabus Computer Science Engineering 3rd Semester students get to know the chapters and concepts to be covered in all subjects.
Based on the score in Computer Science Engineering degree, you can apply for better career opportunities. RTU Conducts Computer Science Engineering Semester Exams in every six months. If you know the latest RTU Syllabus Computer Science Engineering 3rd Semester then it will be very helpful to prepare for the exam.
In the depth knowledge in every topic of Computer Science Engineering 3rd Semester will also helpful to crack the various competitive exams like Gate.
Here we are providing you the complete guide on RTU Syllabus Computer Science Engineering 3rd Semester 2020 and Marking Scheme.
RTU Syllabus Computer Science Engineering 3rd Semester 2020
To boost your semester exam preparation, you should have Computer Science 3rd Semester books & study materials, Previous years questions paper along with the latest Computer Science 3rd sem Syllabus.
All semesters are important stages for every Computer Science Engineering student’s life. It is important to score morein Computer Science engineering if you need to have a bright career.
Before starting the complete guide on RTU Syllabus Computer Science Engineering 3rd Semester 2020, let’s check the highlights of RTU from the table below.
RTU Kota Highlights:
Establishment  2006 
Formation  Govt. of Rajasthan 
Type of University  State 
Approvals  UGC 
Admission through:  MeritBased 
Affiliations  AICTE 
University Location  Rajasthan Technical University, Rawathbhata Road Kota324010, Rajasthan, India. 
Check the latest syllabus for RTU Computer Science Engineering 3rd sem from below.
Advanced Engineering Mathematics
SN 
CONTENTS 
1 
Random Variables: Discrete and Continuous random variables, Joint distribution, Probability distribution function, conditional distribution.Mathematical Expectations: Moments, Moment Generating Functions, variance and correlation coefficients, Chebyshev’s Inequality, Skewness and Kurtosis. 
2 
Binomial distribution, Normal Distribution, Poisson Distribution and their relations, Uniform Distribution, Exponential Distribution. Correlation: Karl Pearson’s coefficient, Rank correlation. Curve fitting. Line of Regression. 
3 
Historical development, Engineering Applications of Optimization, Formulation of Design Problems as a Mathematical Programming Problems, Classification of Optimization Problems 
4 
Classical Optimization using Differential Calculus: Single Variable and Multivariable Optimization with & without Constraints, Langrangian theory, Kuhn Tucker conditions 
5 
Linear Programming: Simplex method, Two Phase Method and Duality in Linear Programming. Application of Linear Programming: Transportation and Assignment Problems. 
Technical Communication
SN 
CONTENTS 
1 
Introduction to Technical Communication Definition of technical communication, Aspects of technical communication, forms of technical communication, importance of technical communication, technical communication skills (Listening, speaking, writing, reading writing), linguistic ability, style in technical communication. 
2 
Comprehension of Technical Materials/Texts and Information Design & development Reading of technical texts, Readingand comprehending instructions and technical manuals, Interpreting and summarizing technical texts, Notemaking. Introduction of different kinds of technical documents, Information collection, factors affecting information and document design, Strategies for organization,Information design and writing for print and online media. 
3 
Technical Writing, Grammar and Editing– Technical writing process, forms of technical discourse, Writing, drafts and revising, Basics of grammar, common error in writing and speaking, Study of advanced grammar, Editing strategies to achieve appropriate technical style, Introduction to advanced technical communication. Planning, drafting and writing Official Notes, Letters, Email, Resume, Job Application, Minutes of Meetings. 
4 
Advanced Technical Writing– Technical Reports, types of technical reports, Characteristics and formats and structure of technical reports. Technical Project Proposals, types of technical proposals, Characteristics and formats and structure of technical proposals. Technical Articles, types of technical articles, Writing strategies, structure and formats of technical articles. 
Managerial Economics and Financial Accounting
SN 
CONTENTS 
1 
Basic economic concepts Meaning, nature and scope of economics, deductive vs inductive methods, static and dynamics, Economic problems: scarcity and choice, circular flow of economic activity, national incomeconcepts and measurement. 
2 
Demand and Supply analysis Demandtypes of demand, determinants of demand, demand function, elasticity of demand, demand forecasting –purpose, determinants and methods, Supplydeterminants of supply, supply function, elasticity of supply. 
3 
Production and Cost analysis Theory of production production function, law of variable proportions, laws of returns to scale, production optimization, least cost combination of inputs, isoquants. Cost conceptsexplicit and implicit cost, fixed and variable cost, opportunity cost, sunk costs, cost function, cost curves, cost and output decisions, cost estimation. 
4 
Market structure and pricing theory Perfect competition, Monopoly, Monopolistic competition, Oligopoly. 
5 
Financial statement analysis Balance sheet and related concepts, profit and loss statement and related concepts, financial ratio analysis, cashflow analysis, funds flow analysis, comparative financial statement, analysis and interpretation of financial statements, capital budgeting techniques. 
Digital Electronics
SN 
CONTENTS 
1 
Fundamental concepts: Number systems and codes, Basic logic Gates and Boolean algebra: Sign & magnitude representation, Fixed point representation, complement notation, various codes & arithmetic in different codes & their inter conversion. Features of logic algebra, postulates of Boolean algebra.Theorems of Boolean algebra. 
2 
Minimization Techniques and Logic Gates: Principle of Duality – Boolean expression Minimization of Boolean expressions –– Minterm – Maxterm – Sum of Products (SOP) – Product of Sums (POS) – Karnaugh map Minimization – Don’t care conditions – Quine – McCluskey method of minimization. 
3 
Digital Logic Gate Characteristics: TTL logic gate characteristics. Theory & operation of TTL NAND gate circuitry. Open collector TTL. Three state output logic. TTL subfamilies.MOS& CMOS logic families. Realization of logic gates in RTL, DTL, ECL, CMOS & MOSFET. 
4 
Combinational Circuits: Combinational logic circuit design, adder, subtractor, BCD adder encoder, decoder, BCD to 7segment decoder, multiplexer demultiplexer. 
5 
Sequential Circuits: Latches, Flipflops – SR, JK, D, T, and MasterSlave Characteristic table and equation,counters and their design, Synchronous counters– Synchronous Up/Down counters – Programmable counters – State table and state transition diagram ,sequential circuits design methodology. Registers –shift registers. 
Data Structures and Algorithms
SN 
CONTENTS 
1 
Stacks: Basic Stack Operations, Representation of a Stack using Static Array and Dynamic Array, Multiple stack implementation using single array, Stack Applications: Reversing list, Factorial Calculation, Infix to postfix Transformation, Evaluating Arithmetic Expressions and Towers of Hanoi. 
2 
Queues: Basic Queue Operations, Representation of a Queue using array, Implementation of Queue Operations using Stack, Applications of Queues Round Robin Algorithm. Circular Queues, DeQueue Priority Queues. Linked Lists:Introduction, single linked list, representation of a linked list in memory, Different Operations on a Single linked list, Reversing a single linked list, Advantages and disadvantages of single linked list, circular linked list, double linked list and Header linked list. 
3 
Searching Techniques: Sequential and binary search.Sorting Techniques: Basic concepts, Sorting by: bubble sort, Insertion sort, selection sort, quick sort, heap sort, merge sort, radix sort and counting sorting algorithms. 
4 
Trees: Definition of tree, Properties of tree, Binary Tree, Representation of Binary trees using arrays and linked lists, Operations on a Binary Tree, Binary Tree Traversals (recursive), Binary search tree, Btree , B+ tree, AVL tree, Threaded binary tree. 
5 
Graphs: Basic concepts, Different representations of Graphs, Graph Traversals (BFS & DFS), Minimum Spanning Tree(Prims &Kruskal), Dijkstra’s shortest path algorithms.Hashing: Hash function, Address calculation techniques, Common hashing functions, Collision resolution: Linear and Quadratic probing, Double hashing. 
ObjectOriented Programming
SN 
CONTENTS 
1 
Introduction to different programming paradigm, characteristics of OOP, Class, Object, data member, member function, structures in C++, different access specifiers, defining member function inside and outside class, array of objects. 
2 
Concept of reference, dynamic memory allocation using new and delete operators, inline functions, function overloading, function with default arguments, constructors and destructors, friend function and classes, using this pointer. 
3 
Inheritance, types of inheritance, multiple inheritance, virtual base class, function overriding, abstract class and pure virtual function 
4 
Constant data member and member function, static data member and member function, polymorphism, operator overloading, dynamic binding and virtual function 
5 
Exception handling, Template, Stream class, File handling. 
Software Engineering
SN 
CONTENTS 
1 
Introduction, software lifecycle models, software requirements specification, formal requirements specification, verification and validation. 
2 
Software Project Management: Objectives, Resources and their estimation, LOC and FP estimation, effort estimation, COCOMO estimation model, risk analysis, software project scheduling. 
3 
Requirement Analysis: Requirement analysis tasks, Analysis principles. Software prototyping and specification data dictionary, Finite State Machine (FSM) models. Structured Analysis: Data and control flow diagrams, control and process specification behavioral modeling 
4 
Software Design: Design fundamentals, Effective modular design: Data architectural and procedural design, design documentation. 
5 
Object Oriented Analysis: Object oriented Analysis Modeling, Data modeling. Object Oriented Design: OOD concepts, Class and object relationships, object modularization, Introduction to Unified Modeling Language 
Data Structures and Algorithms Lab
SN 
CONTENTS 
1 
Write a simple C program on a 32 bit compiler to understand the concept of array storage, size of a word. The program shall be written illustrating the concept of row major and column major storage. Find the address of element and verify it with the theoretical value. Program may be written for arrays up to 4dimensions. 
2 
Simulate a stack, queue, circular queue and dequeue using a one dimensional array as storage element. The program should implement the basic addition, deletion and traversal operations. 
3 
Represent a 2variable polynomial using array. Use this representation to implement addition of polynomials 
4 
Represent a sparse matrix using array. Implement addition and transposition operations using the representation. 
5 
Implement singly, doubly and circularly connected linked lists illustrating operations like addition at different locations, deletion from specified locations and traversal. 
6 
Repeat exercises 2, 3 & 4 with linked structure. 
7 
Implementation of binary tree with operations like addition, deletion, traversal. 
8 
Depth first and breadth first traversal of graphs represented using adjacency matrix and list. 
9 
Implementation of binary search in arrays and on linked Binary Search Tree. 
10 
Implementation of different sorting algorithm like insertion, quick, heap, bubble and many more sorting algorithms. 
ObjectOriented Programming Lab
SN 
CONTENTS 
1 
Understand the basics of C++ library, variables, data inputoutput. 
2 
C++ program using with the concept of structures. 
3 
Implement class and object concepts and function overloading. 
4 
Write programs to understand dynamic memory allocation and array of objects. 
5 
Program to understand different types of constructors and destructor. 
6 
Implement friend function to access private data of a class and usage of this pointer. 
7 
Write programs to understand the usage of constant data member and member function, static data member and member function in a class. 
8 
Implement different types of inheritance, function overriding and virtual function 
9 
Implement Operator overloading concepts. 
10 
Write programs to understand function template and class template. 
11 
Write programs to understand exception handling techniques. 
12 
Write programs to understand file handling techniques. 
Software Engineering Lab
SN 
CONTENTS 
1 
Development of requirements specification, function oriented design using SA/SD, objectoriented design using UML, test case design, implementation using Java and testing. Use of appropriate CASE tools and other tools such as configuration management tools, program analysis tools in the software life cycle. 
2 
Develop Software Requirements Specification (SRS) for a given problem in IEEE template. 
3 
Develop DFD model (level0, level1 DFD and Data dictionary) of the project. 
4 
Develop structured design for the DFD model developed. 
5 
Developed all Structure UML diagram of the given project. 
6 
Develop Behavior UML diagram of the given project. 
7 
Manage file, using ProjectLibre project management software tool. 
Digital Electronics Lab
SN 
CONTENTS 
1 
To verify the truth tables of basic logic gates: AND, OR, NOR, NAND, NOR. Also to verify truth table of ExOR, ExNOR (For 2, 3, & 4 inputs using gateswith 2, 3, & 4 inputs). 
2 
To verify the truth table of OR, AND, NOR, ExOR, ExNOR realized usingNAND& NOR gates. 
3 
To realize an SOP and POS expression. 
4 
To realize Half adder/ Subtractor& Full Adder/ Subtractor using NAND & NOR gatesand to verify their truth tables. 
5 
To realize a 4bit ripple adder/ Subtractor using basic Half adder/ Subtractor & basic Full Adder/ Subtractor. 
6 
To verify the truth table of 4to1 multiplexer and 1to4 demultiplexer. Realize the multiplexer using basic gates only. Also to construct and 8to1 multiplexer and 1to8 demultiplexer using blocks of 4to1 multiplexer and 1to4 demultiplexer. 
7 
Design & Realize a combinational circuit that will accept a 2421 BCD code and drive a TIL 312 sevensegment display. 
8 
Using basic logic gates, realize the RS, JK and Dflip flops with and without clock signal and verify their truth table. 
9 
Construct a divide by 2,4& 8 asynchronous counter. Construct a 4bit binary counter and ring counter for a particular output pattern using D flip flop. 
10 
Perform input/output operations on parallel in/Parallel out and Serial in/Serial out registers using clock. Also exercise loading only one of multiple values into the register using multiplexer. Note: As far as possible, the experiments shall be performed on bread board. However, experiment Nos. 14 are to be performed on bread board only. 
All Semester Syllabus for RTU Computer Science Engineering
You should have the following syllabus to boost your exam preparation for the RTU Computer Science Engineering.
Click on the link to access all semester syllabus related to Computer Science Engineering.
 4th Semester Computer Science Engineering Syllabus & Marking Scheme
 5th Semester Computer Science Engineering Syllabus & Marking Scheme
 6th Semester Computer Science Engineering Syllabus & Marking Scheme
 7th Semester Computer Science Engineering Syllabus & Marking Scheme
 8th Semester Computer Science Engineering Syllabus & Marking Scheme
RTU Computer Science Engineering 3rd Semester Marking Scheme
Here you can check the latest Computer Science Engineering 3rd Semester Marking Scheme.
RTU Computer Science Engineering 3rd Semester Theory Marking Scheme 

SN 
Categ ory 
Course 
Contact hrs/week 
Marks 
Cr 

Code 
Title 

L 
T 
P 
Exm Hrs 
IA 
ETE 
Total 

1 
BSC 
3CS201 
Advanced Engineering Mathematics 
3 
0 
0 
3 
30 
120 
150 
3 
2 
HSMC 
3CS102/ 3CS103 
Technical Communication/ Managerial Economics and Financial Accounting 
2 
0 
0 
2 
20 
80 
100 
2 
3 
ESC 
3CS304 
Digital Electronics 
3 
0 
0 
3 
30 
120 
150 
3 
4 
PCC 
3CS405 
Data Structures and Algorithms 
3 
0 
0 
3 
30 
120 
150 
3 
5 
3CS406 
Object Oriented Programming 
3 
0 
0 
3 
30 
120 
150 
3 

6 
3CS407 
Software Engineering 
3 
0 
0 
3 
30 
120 
150 
3 

Sub Total 
17 
0 
0 
170 
680 
850 
17 

RTU Computer Science Engineering 3rd Semester Practical & Sessional Marking Scheme 

7 
PCC 
3CS421 
Data Structures and Algorithms Lab 
0 
0 
3 
45 
30 
75 
1.5 

8 
3CS422 
Object Oriented Programming Lab 
0 
0 
3 
45 
30 
75 
1.5 

9 
3CS423 
Software Engineering Lab 
0 
0 
3 
45 
30 
75 
1.5 

10 
3CS424 
Digital Electronics Lab 
0 
0 
3 
45 
30 
75 
1.5 

11 
PSIT 
3CS730 
Industrial Training 
0 
0 
1 
0 
0 
50 
1 

12 
SODE CA 
3CS800 
Social Outreach, Discipline & Extra Curricular Activities 
25 
0.5 

Sub Total 
0 
0 
13 
180 
120 
375 
7.5 

TOTAL OF III SEMESTER 
17 
0 
13 
350 
800 
1225 
24.5 
Meaning Of various letters:
 L: Lecture, T: Tutorial, P: Practical, Cr: Credits ETE: End Term Exam, IA: Internal Assessment
We have covered the complete guide on RTU Syllabus Computer Science Engineering 3rd Semester 2020. feel free to ask us any questions in the comment section below