Shri Rawatpura Sarkar University,

Raipur

Examination Scheme & Syllabus

For
Bachelor of Technology
In
Computer Science & Engineering

Semester-III

(Effective from the session: 2022-23)

 SHRI RAWATPURA SARKAR UNIVERSITY, RAIPUR,
CHHATTISGARH
FACULTY OF ENGINEERING

Four Years B.TECH Programme

Scheme of Teaching and Examination
B.TECH Third Semester
Computer Science Engineering
Outcome Based Education (OBE) and Choice Based Credit System (CBCS)
(Effective from the Academic Year 2022-2023)

Sem
Hours / Week Credits Maximum Marks End
Course
S.No. Course Title Exam
Code Continuous Sem
L T P Total Duration
Evaluation End Exam (Hrs)

1 EBT04301 Mathematics-III 3 1 - 4 30 70 100 3 Hrs.

EBT04302 Basic Electronics 3 1 - 4 30 70 100 3 Hrs.

2
Principles of
EBT04303 3 1 - 4 30 70 100 3 Hrs.
3 Programming –I
EBT04304 Data Structure 3 1 - 4 30 70 100 3 Hrs.
4
Programming with
5 EBT04305 Visual Basic 3 1 - 4 30 70 100 3 Hrs.
Dotnet
Basic Electronics
6 EBT04391 - - 2 1 15 35 50 3 Hrs.
Lab
7 EBT04392 Data Structure Lab - - 2 1 15 35 50 3 Hrs.

Programming with
8 EBT04393 Visual Basic - - 2 1 15 35 50 3 Hrs.
Dotnet Lab
Total Contact hr. per week: 32 Total Credit: 23 Grand Total Marks: 650
 SHRI RAWATPURA SARKAR UNIVERSITY, RAIPUR,
CHHATTISGARH
FACULTY OF COMPUTER SCIENCE & ENGINEERING
B.TECH Third Semester

Course Title MATHEMATICS – III

Course Code EBT04301

L T P TC
Course
Credits
3 1 - 4

Prerequisites Basic knowledge about foundation of mathematic.

1. To make the students understand the Fourier series analysis is powerful methods
where the formulas are integrals and to have knowledge of expanding periodic
functions that explore variety of applications of Fourier series.
2. To provide knowledge of Laplace transform of elementary functions including its
properties and applications to solve ordinary differential equations.
3. To provide a sound background of complex analysis to perform a thorough
Course
investigation of major theorems of complex analysis and to apply these ideas to a wide
Objectives
range of problems that includes the evaluation of both complex line integrals and real
integrals.
4. To have a thorough knowledge of PDE that arises in mathematical descriptions of
situations in engineering.
5. To study about a quantity that may take any of a given range of values that can’t be
predicted as it is but can be described in terms of their probability.

Course UNIT - I
Contents Fourier series: Expansion of function as Fourier series, Change of interval, Even and
odd functions, Half-range Fourier series, Practical harmonic analysis.
UNIT - II
Laplace Transformation: Laplace transform of elementary functions, Properties of
Laplace transform, Laplace transform of derivatives and integrals, multiplication by
integrals and division by integrals, Laplace transform of periodic functions. Inverse
Laplace transform, Convolution theorem, Application of Laplace transform to solutions
of ordinary differential equations.
UNIT - III
Theory of Complex Variables: Limit, Derivative and Analytic functions; Cauchy-
Riemann equations and its
applications to flow problems; Complex Integration: Line and Contour integral, Cauchy
integral theorem and
Integral formula; Taylor series, Laurent series; singularities; Poles and their orders and
 residues; Evaluation of real definite integrals.
UNIT - IV
Partial Differential Equation: Formation of partial differential equations, Equations
solvable by direct integration, Lagrange’s linear equations, Homogeneous linear
differential equations with constant coefficients, Non homogeneous linear equations,
Solution of partial differential equations by the method of separation of variables.
UNIT - V
Random variable: Discrete and continuous probability distributions, Mathematical
expectation, Mean and
Variance, Moments, Moment generating function, probability distribution, Binomial,
Poisson and Normal distributions.

 After completion of this course the students will be able to apply Fourier series,
Laplace transformation, Theory of complex variable, Partial differential equations
Course
and Random variable to Computer Science problems and solve them. Hands on
Outcomes
these Mathematical topics will make them equipped to prepare for higher studies
through competitive examinations.

1. Advanced Engg. Mathematics by R.K. Jain Publishing House.

Text Books 2. Applied Mathematics by P.N. Wartikar& J.N. Wartikar. Vol - II– Pune Vidyarthi
GrihaPrakashan, Pune.

Reference 1. Applied Mathematics for Engineers & Physicists by Louis A. Pipes - TMH.
Books 2. Advanced Engg. Mathematics by S.R.K. Iyengar – Narosa Publishing House.
 SHRI RAWATPURA SARKAR UNIVERSITY, RAIPUR,
CHHATTISGARH
FACULTY OF COMPUTER SCIENCE & ENGINEERING
B.TECH Third Semester

Course Title BASIC ELECTRONICS

Course Code EBT04302

L T P TC
Course
Credits
3 1 - 4

Prerequisites Basic knowledge about electronic and computers.

1. To learn basic concepts of semiconductors.

Course 2. To understand working principle of Diode, Transistor and FET.
Objectives 3. To gain knowledge of applications of Diode and Transistor.
4. To learn concepts of transport phenomenon and amplifications through numerical.

Course UNIT - I
Contents Introduction: Transport Phenomena in semiconductor, Formation of P-N Junction,
Properties of P-N Junction, P-N Junction Diodes; Semiconductor Diodes, V-I
Characteristics, Effect of Temperature on V-I Characteristics, Ideal Diode, Diode
equation, Diode Resistance, Diode Capacitance: Transition and Diffusion Capacitance
UNIT - II
Rectifying circuits and DC Power Supplies: Load line analysis of diode circuit, Half
wave rectifier: Voltage regulation, Ripple factor, Ratio of rectification, Transformer
Utilization factor. Full wave rectifier, Bridge rectifier, Filter circuits for power supply:
Inductor filter, Capacitor filter, LC filter, Multiple LC filter, CLC or filter. Zener diode:
Break down mechanism, Characteristics, Specifications, Voltage regulator circuit using
zener diode.
UNIT - III
Transistor: Introduction, Construction, Types: npn and pnp, Current components.
Transistor as an amplifier,
Transistor Characteristics, Transistor Circuit Configuration: Common Base (CB)
Configuration, Common Emitter (CE) Configuration, Common Collector Configuration
(CC), Early Effect, Ebers-Moll Model, Maximum Voltage Ratings.
UNIT - IV
Transistor Biasing and Thermal stabilization: The operating point, Bias stability,
Stability factor, Emitter bias, Collector – to – base bias, Voltage divider bias with emitter
bias, Emitter bypass capacitor, Bias compensation.
UNIT - V
 Field Effect Transistor (FET): Introduction, Construction, Operation, V-I
Characteristics, Transfer Characteristics, Drain Characteristics, Small-Signal Model.
Metal Oxide Semiconductor Field Effect Transistor (MOSFET): Introduction,
Construction, Operation and characteristics, Depletion MOSFET, Enhancement MOSFET.

After completion of this course the students will be able to -

Course
1. Gain the knowledge of basics of semiconductor devices and their applications.
Outcomes
2. Apply concepts of Junction theory in designing and solving basic circuits.

1. Integrated Electronics: Analogy & Digital Circuit Systems – Jacob Millman&

Text Books Halkias, TMH.
2. Electronic Devices & Circuits – Allen Mottershead, PHI.

Reference 1. Electronic Devices and Circuit Theory – Boy lestad&Nashelsky, 8th Ed. PHI.
Books 2. Electronic Devices & Circuit Analysis – K. Lal Kishore, BS Publications.
 SHRI RAWATPURA SARKAR UNIVERSITY, RAIPUR,
CHHATTISGARH
FACULTY OF COMPUTER SCIENCE & ENGINEERING
B.TECH Third Semester

Course Title PRINCIPLES OF PROGRAMING –I

Course Code EBT04303

L T P TC
Course
Credits
3 1 - 4

Prerequisites Basic knowledge about computers programming.

1. To learn basic concepts of computer programming.

Course
Objectives 2. programming language constructs such as binding, binding times, data types and
implementation, operations.

UNIT - I
Preliminary Concepts:
Reasons for Studying Concepts of Programming Languages, Programming Domains,
Language Evaluation Criteria, Influences on Language Design, Language Categories,
Language Design Trade-Offs, Implementation Methods, Programming Environments.
Syntax and Semantics:
General Problem of Describing Syntax and Semantics, Formal Methods of Describing
Syntax, Attribute Grammars, Describing the Meanings of Programs.
UNIT - II
Course Names, Bindings, and Scopes:
Contents
Introduction, Names, Variables, Concept of Binding, Scope, Scope and Lifetime,
Referencing Environments, Named Constants
Data Types:
Introduction, Primitive Data Types, Character String Types, User Defined Ordinal Types,
Array, Associative Arrays, Record, Union, Tuple Types, List Types, Pointer and Reference
Types, Type Checking, Strong Typing, Type Equivalence
Expressions and Statements:
Arithmetic Expressions, Overloaded Operators, Type Conversions, Relational and
Boolean Expressions, Short Circuit Evaluation, Assignment Statements, Mixed-Mode
Assignment.
Control Structures:
Introduction, Selection Statements, Iterative Statements, Unconditional Branching,
Guarded Commands.
UNIT - III
Subprograms and Blocks:
Fundamentals of Sub-Programs, Design Issues for Subprograms, Local Referencing
Environments, Parameter Passing Methods, Parameters that Are Subprograms, Calling
Subprograms Indirectly, Overloaded Subprograms, Generic Subprograms, Design Issues
for Functions, User Defined Overloaded Operators, Closures, Coroutines.
Implementing Subprograms:
General Semantics of Calls and Returns, Implementing Simple Subprograms,
Implementing Subprograms with Stack-Dynamic Local Variables, Nested Subprograms,
Blocks, Implementing Dynamic Scoping.
Abstract Data Types:
The Concept of Abstraction, Introductions to Data Abstraction, Design Issues, Language
Examples, Parameterized ADT, Encapsulation Constructs, Naming Encapsulations.
UNIT - IV
Concurrency:
Introduction, Introduction to Subprogram Level Concurrency, Semaphores, Monitors,
Message Passing, Java Threads, Concurrency in Function Languages, Statement Level
Concurrency. Exception Handling and Event Handling: Introduction, Exception Handling
in Ada, C++, Java, Introduction to Event Handling, Event Handling with Java and C#.
UNIT - V
Functional Programming Languages:
Introduction, Mathematical Functions, Fundamentals of Functional Programming
Language, LISP, Support for Functional Programming in Primarily Imperative
Languages, Comparison of Functional and Imperative Languages.
Logic Programming Language:
Introduction, an Overview of Logic Programming, Basic Elements of Prolog,
Applications of Logic Programming.
Scripting Language:
Pragmatics, Key Concepts, Case Study: Python – Values and Types, Variables, Storage
and Control, Bindings and Scope, Procedural Abstraction, Data Abstraction, Separate
Compilation, Module Library.
 After completion of this course the students will be able to -
1. Knowledge of, and ability to use, language features used in current programming
languages.
Course
Outcomes 2. An ability to program in different language paradigms and evaluate their relative
benefits.
3. An understanding of the key concepts in the implementation of common features of
programming languages.

1. Concepts of Programming Languages Robert. W. Sebesta 10/E, Pearson Education.

Text Books
2. Programming Language Design Concepts, D. A. Watt, Wiley Dreamtech, 2007.

Reference 1. Programming Languages, 2nd Edition, A.B. Tucker, R. E. Noonan, TMH.

Books 2. Programming Languages, K. C. Louden, 2nd Edition, Thomson, 2003.
 SHRI RAWATPURA SARKAR UNIVERSITY, RAIPUR,
CHHATTISGARH
FACULTY OF COMPUTER SCIENCE & ENGINEERING
B.TECH Third Semester

Course Title DATA STRUCTURES

Course Code EBT04304

Course L T P TC
Credits 3 1 - 4
Know the classifications of data structures, i.e., linear and non-linear understand the basic
Prerequisites
operations onlinear and non- linear data structures;
1. Define the term ‘data structure’;
Course
2. Explain the memory representation of all types of data structures
Objectives
3. Explain how to implement the all kinds of data structures.
UNIT- I
Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of
an Algorithm, Time and Space Complexity, Asymptotic notations: Big-Oh, Time-Space
trade-off. Abstract Data Types (ADT) Arrays: Definition, Single and Multidimensional
Arrays, Representation of Arrays: Row Major Order, and Column Major Order,
Application of arrays.
UNIT-II
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions,
Evaluation of postfix expression, Recursion, Tower of Hanoi Problem, Simulating
Recursion, Principles of recursion, Tail recursion, Removal of recursion Queues,
Operations on.
Course UNIT- III
Contents Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation
and Dynamic
Representation, Complete Binary Tree, Algebraic Expressions, Extended Binary Trees,
Array and Linked
Representation of Binary trees, Tree Traversal algorithms: Inorder, Preorder and
Postorder, Threaded Binary trees, Traversing Threaded Binary trees, Huffman algorithm.
UNIT-IV
Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency
Matrices, Adjacency List,
Adjacency Multi list, Graph Traversal : Depth First Search and Breadth First Search,
Connected Component,
Spanning Trees, Minimum Cost Spanning Trees.
 UNIT-V
Searching : Sequential search, Binary Search, Comparison and Analysis Internal Sorting:
Insertion Sort, Selection, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort,
Radix Sort, Practical consideration for Internal Sorting. Search Trees: Binary Search
Trees(BST), Insertion and Deletion in BST.
 Have a comprehensive knowledge of the data structures and algorithms on which file
structures and data bases are based.
Course  Understand the importance of data and be able to identify the data requirements for
Outcomes an application.
 Have in depth understanding and practical experience of algorithmic design and
implementation.
1. Aaron M. Tenenbaum, YedidyahLangsam and Moshe J. Augenstein “Data
Structures Using C and C/C++” , PHI
Text Books
2. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia
Publication
1. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education
Reference
2. Lipschutz, “Data Structures” Schaum’s Outline Series, TMH
Books
3. G A V Pai, “Data Structures and Algorithms”, TMH
 SHRI RAWATPURA SARKAR UNIVERSITY, RAIPUR,
CHHATTISGARH
FACULTY OF COMPUTER SCIENCE & ENGINEERING
B.TECH Third Semester

Course Title PROGRAMMING WITH VISUAL BASIC DOTNET

Course Code EBT04305

L T P TC
Course Credits
3 1 - 4

Visual Basic .NET (VB.NET) is an object-oriented computer programming

language implemented on the .NET Framework. Although it is an evolution of
Prerequisites
classic Visual Basic language, it is not backwards-compatible with VB6, and any
code written in the old version does not compile under VB.NET.

1. Introduction to computer programming using VB.NET. Emphasis on the

Course fundamentals of structured design, development, testing, implementation, and
Objectives documentation. Includes language syntax, data and file structures, input/output devices,
and files.

Course Contents UNIT – I : Introduction to .NET

NET Framework features & architecture, CLR, Common Type System, MSIL,
Assemblies and class libraries. Introduction to visual studio, Project basics, types of
project in .Net, IDE of VB.NET- Menu bar, Tool-bar, Solution Explorer, Toolbox,
Properties Window, Form Designer, Output Window, Object Browser. The
environment: Editor tab, format tab, general tab, docking tab. visual development &
event drive Programming -Methods and events.
UNIT – II : The VB.NET Language
Variables -Declaring variables, Data Type of variables, Forcing variables declarations,
Scope & lifetime of a variable, Constants, Arrays, types of array, control array,
Subroutines, Functions, Returning value from function. Control flow statements,
conditional statement, loop statement. Msgbox & Inputbox.
UNIT – III : Object oriented Programming
Classes & objects, fields Properties, Methods & Events, constructor, inheritance.
Access Specifiers, Friend, Overloading Vs Overriding, Interfaces, Polymorphism,
Overview of OLE, Accessing the WIN32 API from VB.NET, Create User control,
register User Control, access com components in .net application.
UNIT – IV : Working with Forms
GUI Programming with Windows Form: Textbox, Label, Button, Listbox, Combobox,
Checkbox, PictureBox, RadioButton, Panel, Scroll bar, Timer, ListView, TreeView,
toolbar, StatusBar. There Properties, Methods and events. OpenFileDilog,
SaveFileDialog, FontDialog, ColorDialog, PrintDialog. Link Label. Designing menus,
Context Menu, access & shorcut keys, System.io Namespace, Reading and Writing
 data from and into files, File class and relatedMethods, Stream Reader, Stream Writer.
UNIT – V : Databases in VB.NET
Databases, Connections, Data adapters, and datasets, Data Reader, Connection to
database with server explorer, Multiple Table Connection, Creating Command, Data
Adapter and Data Set with OLEDB and SQLDB. Data Grid View, Data form wizard,
Data validation, Connection Objects, Command Objects, Data Adapters, Dataset
Class, Overview of ADO, from ADO to ADO.NET, Generate Reports Using Crystal
Report Viewer.

1. Design, formulate, and construct applications with VB.NET.

Course 2. Integrate variables and constants into calculations applying VB.NET.
Outcomes
3.Determine logical alternatives with VB.NET decision structures.r

1. VB.NET Programming Black Book by Steven Holzner – Dreamtech Publications.

Text Books
2. Mastering VB.NET by EvangelosPetroutsos - BPB Publications.

1. Introduction To.Net Framework –Work Publication.

Reference Books
2. Mastering Vb.Net by EvangelosPetroutsos–BPB Publications.
 SHRI RAWATPURA SARKAR UNIVERSITY, RAIPUR,
CHHATTISGARH
FACULTY OF COMPUTER SCIENCE & ENGINEERING
B.TECH Third Semester

Course Title BASIC ELECTRONICS LAB

Course Code EBT04391

L T P TC
Course
Credits
- - 2 1

Prerequisites Basic knowledge about electronics.

Course 1. To learn basic concepts of semiconductors.

Objectives 2. To gain knowledge of applications of Diode and Transistor.

List of Experiments:
1. To draw the characteristics of a semi conductor diode and to find cut-in voltage,
reverse resistance, static resistance and dynamic resistance.
2. To draw the characteristics of a zanier diode.
3. To design a half wave rectifier and to determine its efficiency and ripple factor.
4. To design a- full wave rectifier and determine the ripple factor and efficiency with
filter.
Course
Contents 5. To design a- full wave rectifier and determine the ripple factor and efficiency without
filter.
6. To draw the characteristics of FET using BFW – 10.
7. To draw the characteristics of CE configuration of a transistor amplifier.
8. To draw the characteristics of CB configuration of a transistor amplifier.
9. To draw the characteristics of CC configuration of a transistor amplifier.
10. To design a Zanier regulator circuit and to find the regulation characteristics.

 Gain the knowledge of basics of semiconductor devices and their applications.

Course  Apply concepts of Junction theory in designing and solving basic circuits.
Outcomes  Develop basic knowledge of PN junction diode, BJT and FET.
 Implement transistor based circuits that are used in IC technology.

1. Laboratory Manual for Electronic Devices and Circuits, 4th Ed., David A. Bell,
Text Books PHI.
2. Principal of electronic Author V.K Mehta &Rohit Mehta.
Reference 1. Basic electronic by M V Rao.
Books 2. Basic electronic by ChinamoySaha.
 SHRI RAWATPURA SARKAR UNIVERSITY, RAIPUR,
CHHATTISGARH
FACULTY OF COMPUTER SCIENCE & ENGINEERING
B.TECH Third Semester

Course Title DATA STRUCTURES LAB

Course Code EBT04392
Course L T P TC
Credits - - 2 1
Know the classifications of data structures, i.e., linear and non-linear understand the basic
Prerequisites
operations onlinear and non- linear data structures;
Course  Explain the memory representation of all types of data structures
Objectives  Explain how to implement the all kinds of data structures.
List of Experiments:
1. Write a program to perform following operations in one dimensional array,
Insertion, Deletion and Searching (Linear & Binary).
2. Write a program to implement stack and perform push and pop operations.
3. Write a program to convert infix to postfix expressions using stack.
4. Write a program to perform following operations on a linear queue - addition,
deletion, traversing.
5. Write a program to perform following operations on a circular queue - addition,
deletion, traversing.
6. Write a program to perform following operations on a double ended queue -
addition, deletion, traversing.
7. Write a program to perform following operations on a single link list-creation,
Course
inversion, deletion.
Contents
8. Write a program to perform following operations on a double link list – creation,
insertion, deletion.
9. Write a program to implement polynomial in link list and perform.
a. Polynomial arithmetic b) Evaluation of polynomial
10. Write a program to implement a linked stack and linked queue.
11. Write programs to perform Insertion, selection and bubble sort.
12. Write a program to perform quick sort.
13. Write a program to perform merge sort.
14. Write a program to perform heap sort.
15. Write a program to create a Binary search tree and perform –insertion, deletion &
traversal.
Course 1. Have a comprehensive knowledge of the data structures and algorithms on which
Outcomes file structures and data bases are based.
1. “Data structure using C” by Samir kumarBandyopadhyay, KashiNathDey
2. “C and Data structures” by Ashok K Kamthane Pearson Education.
Text Books
3. “An Introduction to Data Structures with Application” by Tremblay &
Sorenson ( TMH)
1. “Fundamentals of Data Structure” by Horowitz &Sahni (Golgotia)
2. “Data Structures using C/C++” by Rajesh Shukla, Wiley India
Reference
3. “Data Structures using C” by ISRD Group (TMH)
Books
4. “Data Structures using C/C++” by Langsam, Augenstein&Tananbaum (PHI)
5. “Data Structures & Program Design” by Robert L Kruse (PHI)
 SHRI RAWATPURA SARKAR UNIVERSITY, RAIPUR,
CHHATTISGARH
FACULTY OF COMPUTER SCIENCE & ENGINEERING
B.TECH Third Semester

Course Title PROGRAMMING WITH VISUAL BASIC DOTNET LAB

Course Code EBT04393

L T P TC
Course
Credits
- - 2 1

Prerequisites Basic knowledge of programming in C and Visual Basic.NET.

Course • Students should be apply their practical knowledge on C Program and Visual Basic.
Objectives Net in programming system.

1. Toolbox, Properties Window, Form Designer, Output Window, Object

Browser.
2. The environment: Editor tab, format tab, general tab conditional statement,
loops statement.
Course 3. Msgbox&Inputbox Form: Textbox, Label, Button, List box, Combo box,
Contents Checkbox,
4. Picture Box, Radio Button, Panel, Scroll bar, Timer, List View, Tree View,
Toolbar, and Status Bar.
5. C Language - If, if-else, forms of if-else statement. Variables and
Keywords.

Course • After completion of this course the students will be able to apply their practical
Outcomes knowledge about C and VB.Net.

1. Vb.Net Programming Black Book by Steven Holzner Dramatic Publications.

Text Books
2. Mastering Vb.Net by EvangelosPetroutsos–BPB Publications.

1. Balagurusamy, E. (2008). Programming with C. New Delhi: Tata Mc-Graw-

Hill.
Reference 2. Kernighan, Brian W. &Ritchie, Dennis M. (1988). The C Programming
Books Language ANSI C.Prentice.
1. Hall PTR 3 Singh, Minakshi&Singh, VishnuPriya.C Programming. Delhi: Asian
Publisher.