R23B.TECH.

CSE

R23 (B. Tech CSE)

 R23B.TECH.CSE

Department: Computer Science & Engineering

Curriculum Structure & Syllabus
(Effectivefrom2023-24 admission batch)

1st Year 1st Semester

Hours per
Broad Course week Credit
Course
Sl.No. Categor Category Code Tota s
Title L T P l
y
A.THEORY
Programming for Problem
1 ENGG Major CS101 3 0 0 3 3
Solving
2 SCI Multidisciplinary CH(CS)101 Engineering Chemistry 2 0 0 2 2

3 SCI Multidisciplinary M(CS)101 Engineering Mathematics–I 3 0 0 3 3

Ability
4 HUM Enhancement HU101 ProfessionalCommunication 2 0 0 2 2
Course
5 HUM Value addedcourse HU102 Values and Ethics 2 0 0 2 2

6 Value addedcourse HU103 Constitution of India 1 0 0 1 1

HUM
B.PRACTICAL
Programming for Problem
1 ENGG Major CS191 0 0 3 3 1.5
Solving Lab
Ability
Professional
2 HUM Enhancement HU191 0 0 2 2 1
Communication Lab
Course
Skill enhancement
3 SCI CH(CS)191 Engineering Chemistry Lab 0 0 2 2 1
course
Skill enhancement Workshop & Manufacturing
4 ENGG ME(CS)191 0 0 3 3 1.5
course Practices Lab
Total of Theory & Practical 23 18

*HUM: Humanities; ENGG: Engineering; SCI: Science; PRJ: Project;

 R23B.TECH.CSE

1st Year 2nd Semester

Hours per
Broad Course week
Sl. Credits
Categor Category Code Course Title
No. L T P Total
y
A.THEORY
1 ENGG Major CS201 Data Structures 3 0 0 3 3
Basic Electrical &
2 Minor EE(CS)201 3 0 0 3 3
ENGG ElectronicsEngineering

3 SCI Multidisciplinary PH(CS)201 Engineering Physics 3 0 0 3 3

Engineering
SCI Multidisciplinary M(CS)201 3 0 0 3 3
4 Mathematics –II

HUM Value added

HU204 Environmental Science 2 0 0 2 2
5 course

HUM Value added Indian Knowledge

6 course HU205 System 1 0 0 1 1
B.PRACTICAL
1 ENGG Major CS291 Data Structures Lab 0 0 3 3 1.5
Basic Electrical &
2 Minor EE(CS)291 Electronics Engineering 0 0 3 3 1.5
ENGG Lab
Ability
HUM Enhancement HU292 Design Thinking 0 0 2 2 1
3
Course
Skill enhancement Engineering Physics
SCI PH(CS)291 0 0 3 3 1.5
4 course Lab
Skill enhancement Engineering Graphics &
ENGG ME(CS)291 0 0 3 3 1.5
5 course Design Lab
Total of Theory & Practical 29 22
 R23B.TECH.CSE

Curriculum & Syllabus forB.Tech under

Autonomy (NEP 2020Implemented)
Computer Science and Technology

(Effective from 2023-24 admission batch)

 R23B.TECH.CSE

Department: Computer Science & Engineering

Curriculum Structure & Syllabus
(Effectivefrom2023-24 admission
batch)
1st Year 1st Semester
Course Hours per week
Broad Course Credits
Sl.No. Category Code L T P Total
Category Title
A.THEORY
Programming for Problem
1 ENGG Major CS101 3 0 0 3 3
Solving
2 SCI Multidisciplinary CH(CS)101 Engineering Chemistry 2 0 0 2 2
Engineering Mathematics
3 SCI Multidisciplinary M(CS)101 3 0 0 3 3
–I
Ability
Professional
4 HUM Enhancement HU101 2 0 0 2 2
Communication
Course
Value added
5 HUM HU102 Values and Ethics 2 0 0 2 2
course
Value added
6 HU103 Constitution of India 1 0 0 1 1
HUM course
B.PRACTICAL
Programming for Problem
1 ENGG Major CS191 Solving Lab 0 0 3 3 1.5
Ability
Professional
2 HUM EnhancementCou HU191 0 0 2 2 1
Communication Lab
rse
Skill
Engineering Chemistry
3 SCI enhancement CH(CS)191 0 0 2 2 1
Lab
course
Skill Workshop &
4 ENGG enhancement ME(CS)191 Manufacturing Practices 0 0 3 3 1.5
course Lab
Total of Theory & Practical 23 18

*HUM: Humanities; ENGG: Engineering; SCI: Science; PRJ: Project;

5
 R23B.TECH.CSE

Course Name: Programming for problem solving

Course Code: CS101
Contact (Periods/Week):3L/Week
Total Contact Hours: 36
Credits: 3

Course Outcome(s):
CO1: To identify the working principle of input and output devices of Computers memorize
the basic terminology used in computer programming.
CO2: To express programs in C language and use different data types for writing the programs.
CO3: To implement programs using the dynamic behaviour of memory by the use of pointers.
CO4: To explain the difference between call by value and call by address.
CO5: To write programs using basic data files and developing applications for real world problems.

CO-PO-PSO Mapping:

PO PO PO PO PO PO PO PO PO PO PO PO1 PSO PSO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 3 2 2 2 3 2 3 3
CO2 2 2 3 3 3 3 2 2 3
CO3 2 3 2 2 2 3 2 3 2
CO4 3 2 2 3 3 2 2 2 2
CO5 2 2 2 1 1 2 3 3 3 3

Course Content:
Module-1: Fundamentals of Computer (9L)
History of Computer, Generation of Computer, Classification of Computers, Basic structure of
Computer System, Primary & Secondary Memory, Processing Unit, Input & Output devices.
Number System: basic of Binary, Octal, Decimal and Hexadecimal number systems;
Representation and interchanging of number in different number systems. Introduction to
complements system, Representation of signed and unsigned numbers in singed magnitude singed
1’s complement system and signed 2’s complementsystem.
Arithmetic– Addition and Subtraction (using1’s complement and 2’s complement). Representation
of Characters-ASCII Code, Basics of Compiler, Interpreter and Assembler
Problem solving – Basic concept of Algorithm. Representation of algorithm using flowchart
and pseudo code, Some basicexamples.

6
 R23B.TECH.CSE

Module-2: Introduction to C Programming (5L)

Overview of Procedural vs Structural language; History of C Programming Language. Variable

and Data Types: The C characters identifiers and keywords, data type & sizes, variable names,
declaration, statements.
Operators & Expressions: Arithmetic operators, relational operators, Logical operators, increment
and decrement operators, bitwise operators, Assignment operators, conditional operators, special
operators-type Conversion, C expressions, precedence and associativity. Input and Output:
Standard input and output, formatted output–printf, formatted input scanf.

Module-3: Branch and Loop (5L)

Branching: Concept of Statement and Blocks in C, Simple if, if -else, nested if-else and if-else
ladder. Switch Case: break and continue; switch-case, concept of go to and labels Loops- while,
for, do while.

Module-4: Program Structures (4L)

Function: Basics of Functions, function types, function prototypes, formal and actual parameter,
function calling, functions returning values, functions not returning values. Recursion and
RecursiveFunction.
Storage Class in C: Storage Class-auto, external, static and registers to rage class, scope rules and
lifetime of variables
C pre-processor: Pre-processing directive and macro, parameterized macro.

Module-5:Array and Pointer (7L)

Arrays: One dimensional array, Two-dimensional arrays Passing an array to a function Pointers:
Pointers, Pointer and Array, Pointer and functions.
Strings: Character array and string, array of strings, Passing a string to a function, String related
functions, Pointer and String. Dynamic memory allocation: Malloc, calloc, realloc and free with
example.

Module-6: Structures, Unions and Enum (3L)

Basic of structures, arrays of structures, structures and pointers, bit fields. Basics of union and
enum, difference between structure and union.

Module-7: File in C (3L)

Files handling-opening and closing a file indifferent mode, formatted and unformatted files,
Command line arguments, fopen, fclose, fgetc, fputc, fprintf, fscanf function.

7
 R23B.TECH.CSE

Textbook:

1. Byron Gottfried, Schaum's Outline of Programming with C,McGraw-Hill

th
2. Kanetkar Y.- Let us C, BPB Publication,15Edition

Reference Books:

1. Brian W.Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall
ofIndia
2. K R Venugopal& S R Prasad– MASTERINGC,TMH,2ndEdition

8
 R23B.TECH.CSE

Course Name: Engineering Chemistry

Paper Code: CH(CS)101
Total Contact Hours: 24
Credit: 2
Prerequisites:
COURSE OBJECTIVE

• To understand the basic principles of elements, organic reactions, drug synthesis and technological aspects of modern
chemistry
• To apply the knowledge of different engineering materials, advanced polymers, and nanomaterials to solve complex
engineering problems
• To analyse and evaluate quality parameters of water and its treatment
• Apply the knowledge of free energy, energy storage device, semiconductors, fuels and corrosion to design environment
friendly & sustainable devices
• Apply the knowledge of different instrumental techniques to analyse unknown engineering materials.

COURSE OUTCOME

CO1. Able to understand the basic principles of elements, organic reactions drug synthesis and computational chemistry
CO2. Able to apply the knowledge of different engineering materials, advanced polymers, and nanomaterials to solve complex
engineering problems
CO3. Able to analyse and evaluate water quality parameters and its treatment
CO4. Able to the knowledge of free energy, energy storage device, fuels and corrosion to design environment friendly & sustainable
devices
CO5. Able to apply the knowledge of different instrumental techniques to analyse unknown engineering materials

CO v/s PO MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 3 2 2 2 - - - - - 2 2
1
3 3 3 3 - - 2 - - - 2 2
2
3 3 3 - - - - 3 - - - 3 2
3 3 3 2 - - 3 - - - 3 2
4
3 3 3 3 2 - - - - - 2 2
5

COURSE CONTENT

Module 1 - Elements and their properties (6L)

1. Elements and their properties(3L)
Bohr’s theory for one electron system, Hydrogen spectrum, Quantum numbers, atomic orbitals,
Pauli’s exclusion principle, Hund’s rule, exchange energy, Aufbau principle, Electronic configuration
and Magnetic properties.

9
 R23B.TECH.CSE

2. Periodic Table for Engineers(3L)

Modern Periodic table, Periodic properties, study of advanced functional materials like Silicones,
Silicates, Zeolite and alloys like steel, mischmetall, Neodymium alloy and their applications.

Module 2 - Energy devices and Semiconductors (6L)

1. Use of free energy in chemical equilibria(3L)
Laws of Thermodynamics, Enthalpy, Entropy, Spontaneity, Electrochemical Cell, Dry Cell, Mercury
Cell, Lead Storage batteries, Ni-Cd Cells, Fuel Cells, Solar Cells, Nernst equation and applications,
Electrochemical sensors
2. Crystals and Semiconductors(3L)
Crystals and their defects, Stoichiometric and Non-stoichiometric defects, Band theory and Doping, n-
type and p-type semiconductors, Superconductors

Module 3 –Industrial Applications of Chemistry (8L)

1. Advanced Polymeric materials (3L)
Classification, Engineering Plastics, conducting polymers, bio polymers, polymer composites
2. Industrial corrosion(2L)
Classification, Effects of corrosion, Preventive measures
3. Analysis of Water Quality (1L)
Physicochemical and Biological parameters
4. Nano materials(1L)
Synthesis of Nano materials, Applications in modern devices
5. Basic Computational Chemistry(1L)
Introduction of computational chemistry and their applications

Module 4 – Organic Reaction Products and their spectroscopic analysis (4L)

1. Organic Reactions(2L)
Substitution, Elimination and Addition reactions
2. Drug designing and synthesis(1L)

10
 R23B.TECH.CSE

Paracetamol, Aspirin
3. Spectroscopic Analysis (1L) UV – Visible Spectra, IRspectra

11
 R23B.TECH.CSE

Course Name: Engineering Mathematics -I

Paper Code:M(CS)101
Contact (L: T: P): 3:0:0
Total Contact Hours: 36
Credit: 3
Prerequisites:
The students to whom this course will be offered must have the concept of (10+2) standard matrix
algebra, and calculus.
Course Objectives:
The objective of this course is to familiarize the prospective engineers with techniques in matrix algebra
and calculus. It aims to equip the students with standard concepts and tools at an intermediate to
advanced level that will serve them well towards tackling more advanced level of mathematics and
applications that they would find useful in theirdisciplines.

Course Outcomes (COs):

On successful completion of the learning sessions of the course, the learner will be able to:

CO1: Recall the properties related to matrix algebra and calculus.

CO2: Determine the solutions of the problems related to matrix algebra and calculus.

CO3: Apply the appropriate mathematical tools of matrix algebra and calculus for the solutions of the
problems.

CO4: Analyze different engineering problems linked with matrix algebra and calculus.

CO-PO/PSO Mapping:
PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10 P11 P12
CO
CO1 3 2 - - - - - - - - - 2

CO2 3 2 - - - - - - - - - 1

CO3 3 2 2 - - - - - - - - 1

CO4 2 3 1 2 - - - - - - - 1

2.75 2.25 1.5 2 - - - - - - - 1.25

CO
Weightage Values: Strongly mapped: ‘3’, Moderately mapped: ‘2’, Weakly mapped: ‘1’, Not mapped:
’-‘

12
 R23B.TECH.CSE

Course Content:
Module I: Liner Algebra (11L)
Echelon form and normal (canonical) form of a matrix; Inverse and rank of a matrix; Consistency and
inconsistency of system of linear equations, Solution of system of linear equations; Eigen values and
eigenvectors; Diagonalization of matrix, Cayley-Hamilton theorem.

Module II: Single Variable Calculus (5L)

Rolle’s Theorem, Mean value theorems, Taylor’s and Maclaurin theorems with remainders; Concept of
sequence and series, Power series; Taylor's series.

Module III: Multivariable Calculus (Differentiation) (13L)

Function of several variables; Concept of limit, continuity and differentiability; Partial derivatives, Total
derivative and its application; chain rules, Derivatives of implicit functions Euler’s theorem on
homogeneous function; Jacobian; Maxima and minima of functions of two variables.

Module IV: Multivariable Calculus (Integration) (7L)

Double Integral, Triple Integral; Change of order in multiple integrals; Line Integral, Surface Integral,
Volume Integral. Change of variables in multiple integrals.

Text Books:
1. Grewal, B.S., Higher Engineering Mathematics, Khanna Publishers, 36th Edition,2010.
2. Kreyszig, E., Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,2006.

ReferenceBooks:
1. Guruprasad, S. A text book of Engineering Mathematics-I, New age InternationalPublishers.
2. Ramana, B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11thReprint,
2010.
3. Veerarajan, T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi,2008.
4. Bali, N.P. and Goyal, M., A text book of Engineering Mathematics, Laxmi Publications, Reprint,
2008.
5. Thomas, G.B. and Finney, R.L., Calculus and Analytic geometry, 9th Edition, Pearson, Reprint,
2002.

13
 R23B.TECH.CSE

14
 R23B.TECH.CSE

Course Name: Professional Communication

Paper Code: HU101
Contact: 2:0:0
Total Contact Hours: 24
Credit: 2

Pre-requisites: Basic (10+2) level of knowledge of English grammar, vocabulary

reading and writing skills.

Course Objectives The course aims to impart domain and industry-specific communications
kill sin a globalized context and to promote the understanding of business
communication ractices and cross cultural dynamics.

Course By pursuing this course the students shall be able to

Outcomes:
1. Define, describe and classify the modalities and nuances of
communication in a workplace context.

2. Review, appraise and understand the modes, contextsand

appropriacy of communicating across cultures and societies.
3. Identify, interpret and demonstrate the basic formats, templates of
business and official communication.

4. Identify, compare and illustrate reading strategies and basic writing

strategies.

5.Interpret, analyze and evaluate semantic-structural, interpersonal and

multicultural dynamics in business communication.

Course Content:

Module1:
Verbal and Nonverbalcommunication 4L
Definition, Relevance and Effective Usage
Components of Verbal Communication: Written and Oral Communication
Components of Non-verbal Communication: Kinesics, Proxemics, Chronemics, Haptics
Paralanguage
Barriers to Effective Communication

Module2:
Workplace Communication Essentials and CrossCulturalCommunication 4L
Communication at the Workplace—Formal and Informal Situations
Language in Use—Jargon, Speech Acts/Language Functions, Syntactical and Grammatical Appropriacy
Cultural Contexts in Global Business: High Context and Low Context Cultures Understanding Cultural
15
 R23B.TECH.CSE

Nuances and Stereotyping Achieving Culturally Neutral Communication in Speech and Writing

Module3: 4L
Reading Strategies and Basic Writing Skills
Reading: Purposes and Nature of Reading
Reading Sub-Skills—Skimming, Scanning, Intensive Reading
Reading General and Business Texts (Reading for Comprehension and Detailed Understanding)
Basic Writing Skills—Paragraph and Essay writing, writing technical documents
Writing Technicalities—Paragraphing, Sentence Structure and Punctuation

Module4: 4L
Report Writing
Nature and Function of Reports
Types of Reports
Researching for a Business Report
Format, Language and Style
Report Documentation

Module5:
Employment Communication
a. WritingBusinessLetters—(Enquiry,Order,Sales,Complaint,Adjustment,JobApplication,Offer)
2L
b. Creating an Employee Profile—Preparing a CV orRésumé.
Creating a Digital/Online Profile–LinkedIn(Résumé/VideoProfile) 2L
c. Writing Other Interoffice Correspondence--E-mails: types, convention, and etiquette, Memo, Notices
andCirculars 2L
d. Preparing Meeting Documentation—Drafting Notice and Agenda of Meetings, Preparing Minutes of
Meetings. 2L

References:-

1. Meenakshi Raman and Sangeetha Sharma. Technical Communication. 3rdedition. New Delhi:
Oxford University Press,2015.
2. Mark Ibbotson. Cambridge English for Engineering. Cambridge: Cambridge University Press,
2008.
3. Mark Ibbotson. Professional English in Use: Engineering. Cambridge: Cambridge UP,2009.
4. Lesikar et al. Business Communication: Connecting in a Digital World. New Delhi:
TataMcGraw-Hill,2014.
5. John Seeley. Writing Reports. Oxford: Oxford University Press,2002.
6. Judith Leigh. CVs and Job Applications. Oxford: Oxford University Press,2002.
7. Judith Leigh. Organizing and Participating in Meetings. Oxford: Oxford University Press,
2002.
8. Michael Swan. Practical English Usage. Oxford: OUP,1980.
9. Pickett, Laster and Staples. Technical English: Writing, Reading & Speaking. 8 thed.London:

16
 R23B.TECH.CSE

Longman, 2001.
10. Diana Booher. E-writing: 21st Century Tools for EffectiveCommunication.

Links:-
1. PurdueUniversity’sOnlineWritingLab(OWL)-https://owl.purdue.edu/
2. BusinessEnglishPod-https://www.businessenglishpod.com/

CO-PO Mapping

PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 12
CO1 - - - - - 2 1 1 2 3 - 2
CO2 - - - - - 1 1 2 2 3 - 3
CO3 - - - - - 3 3 1 1 3 2 3
CO4 - - - - - 3 3 1 - 3 - 3
CO5 2 2 2 2 3 - 3

17
 R23B.TECH.CSE

Course Name: Values and Ethics

Course Code: HU102
Contacts: 2:0:0
Total Contact Hours: 24
Credit: 2
Prerequisite: None

Module: 1 Introduction:(4L)
Definition of Ethics; Approaches to Ethics: Psychological, Philosophical, and Social
Types of values-Social, Psychological, Aesthetic, Spiritual, and Organizational
Natural acceptance of human values. Definitiveness of Ethical Human Conduct. Basis for Humanistic
Education, Humanistic Constitution and Humanistic Universal Order.

Module 2: Universal Human Harmony. (4L)

Basic Human Aspirations, Happiness and Prosperity, Self-Exploration, Self and the Body
Understanding the harmony in the Nature.
Interconnectedness and mutual fulfilment among the four orders of nature- recyclability and self-
regulation innature.
Values Crisis in contemporary society Nature of values: Value Spectrum of a good life (Maslow’s
Pyramid)

Module: 3 Ethical Concerns: (6L)

Renewable Energy Resources, Environmental degradation and pollution. Eco-friendly Technologies.
Environmental Regulations, Environmental Ethics. Rapid Technological growth and depletion of
resources,Reportsofthe Club ofRome.
Problems of Technology transfer- Technology assessment impact analysis -Human Centered
Technology.

Module: 4 Ethics of Profession: (4L)

Work Ethics and Work Values, Business Ethics, Human values in organizations: Social and ethical
responsibilities of Technologists. Codes of professional ethics.
Types of Ethical issues-Internal Ethics of Business–
Whistle Blowing, Impact of Ethics on Business Policies and Strategies– Ethical Leadership –
Characteristics
Module: 5 Self Development AND Gender Awareness (6L)
Definition of Gender, Basic Gender Concepts and Terminology, Exploring Attitudes towards Gender,
Social Construction of Gender
Gender Roles and Relations, Types of Gender Roles, Gender Roles and Relationships Matrix, Gender-
based Division and Valuation of Labour. Gender Development Issues, Identifying Gender Issues

Text Books:
1. Beneria, Lourdes. (2004). Gender, Development, and Globalization: Economics as if All People
Mattered. Roultedge Press.(GDGE)
2. Molyneux and Razavi. (2002). Gender Justice, Development and Rights. Oxford University Press
(GJDR orWGD)
3. Visvanathan, Duggan,Wiegersma and Nisonoff.(2011).
4. The Women, Gender and Development Reader. 2nd Edition. Zed Press(WGD)
5. Stephen H Unger, Controlling Technology: Ethics and the Responsible Engineers, John Wiley &
Sons, New York 1994 (2ndEd)
6. DeborahJohnson,EthicalIssuesinEngineering,PrenticeHall,EnglewoodCliffs,NewJersey1991.
7. A N Tripathi, Human values in the Engineering Profession, Monograph published by IIM, Calcutta
1996.

17
 R23B.TECH.CSE

Course Outcomes:
CO 1 Understand the significance of values, various approaches to ethics and its
applications in life and profession.
CO2 Able to distinguish Self and the Body, to understand Harmony in the Self
CO3 To identify and eradicate environmental concerns through technology
CO4 Demonstrate work ethics and analyse business strategies
CO5 Ability to understand gender terminologies and to identify gender issues

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 - 2 - - - - - 3 3 - 2

CO2 - - - - - 3 3 - 3 2 - -

CO3 - 3 3 - 3 2 3 - - - - 2

CO4 2 - - 2 - - - 3 - - 2 -

CO5 - 3 - - - 2 1 - - 2 - 2

18
 R23B.TECH.CSE

Paper Name: Constitution of India

Paper Code: HU103
Credit: 01
No. of lectures: 12

Module 1: History of Making of the Indian Constitution: History. Drafting Committee, (Composition &
Working) 3L
Philosophy of the Indian Constitution: Preamble Salient Features
Module2:FundamentalRights,FundamentalDuties,DirectivePrinciplesofStatePolicy 6L

The Right to Equality

The Right to Freedom: I (Article 19)
The Right to Freedom: II (Articles 20, 21 and 22)
The Right against Exploitation
The Right to freedom of Religion
Cultural and Educational rights
The Right to Property
The Right to Constitutional Remedies
Fundamental Duties

Module-3:OrgansofGovernance: 3L
Parliament - Composition - Qualifications and Disqualifications -Powers and Functions – Executive-
President -Governor - Council of Ministers - Judiciary, Appointment and Transfer of Judges,
Qualifications - Powers andFunctions

Text / Reference Books:

1) Indian Constitution by D. D. Basu, The Publisher,LexisNexis
2) Constitution of India by Subhas C Kasyap, VitastaPublishing
3) TheConstitutionofIndia,P.MBakshi,UniversalLawPublishingCo.Ltd,NewDelhi,2003.
4) IndianConstitutionTextBook-Avasthi,Avasthi,Publisher:LAKSHMINARAINAGARWAL
5) Introduction to the Constitution of India, Brij Kishore Sharma,PHI

19
 R23B.TECH.CSE

Course Name: Programming for problem solving Lab

Course Code: CS191
Contact Hours: 3L/Week
Total Contact Hours: 36
Credits: 1.5

Course
Name of Course Outcomes
Outcomes
CO1 To identify the working of different operating systems like DOS, Windows, Linux

CO2 To express programs in C language

CO3 To implement programs connecting decision structures, loops

CO4 To experiment with user defined functions to solve real time problems

CO5
To write C programs using Pointers to access arrays, strings, functions, structures and files

CO-PO-PSO Mapping:

PS
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
CO O
1 2 3 4 5 6 7 8 9 10 11 12 1 2
3
CO1 3 3 3 2 2 2 3 2 3 3
CO2 2 2 3 3 3 3 2 2 3
CO3 2 3 2 2 2 3 2 3 2
CO4 3 2 2 3 3 2 2 2 2
CO5 2 2 2 1 1 2 3 3 3 3

Course Content:

Module- 1: Familiarization with some basic commands of DOS and Linux. File handling and Directory
structures, file permissions, creating and editing simple C program in different editor and IDE, compilation
and execution of C program. Introduction to Codeblock.

Module-2: Problem based on

a) Basic datatypes
b) Different arithmeticoperators.
c) Printf() and scanf()functions.

Module-3: Problem based on conditional statements using

a) if-else statements
b) different relationaloperators
c) different logicaloperators

20
 R23B.TECH.CSE

Module-4: Problem based on

a) forloop
b) whileloop
c) do-whileloop
Module-5: Problem based on
a) How to write a menu driven program using switch-casestatement
b) How to write a function and passing values toa function
c) How to write a recursivefunction.
Module-6: Problem based on
a) How to use array(bothI-Dand2-D).
b) How to pass an array to afunction.

Module-7: Problem based on manipulation of strings in different way.

Module-8: Problem based on
a) How to handle compound variable sinC
b) How to handle file inC
c) How to use command line argument inC

Textbook:

1. Byron Gottfried, Schaum's Outline of Programming with C,McGraw-Hill

th
2. Kanetkar Y.-Let us C,BPB Publication,15Edition

Reference Books:

1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India
K R Venugopal& S R Prasad–MASTERINGC,TMH, 2ndEdition

21
 R23B.TECH.CSE

Paper Name: Professional Communication Lab

Paper Code: HU191
Contact: (0:0:2)
Total Contact Hours: 26
Credit: 1

Pre requisites: Basic knowledge of LSRW skills.

Course Objectives: To train the students in acquiring interpersonal communication skills by focussing
on language skill acquisition techniques and errorfeedback.

Course Outcome:
By pursuing this course the students will be able to:
CO1: Recognize, identify and express advanced skills of Technical Communication in English through
Language Laboratory.
CO2: Understand, categorize, differentiate and infer listening, speaking, reading and writing skills in
societal and professional life.
CO3: Articulate and present the skills necessary to be a competent Interpersonal communicator.
CO4: Deconstruct, appraise and critique communication behaviours.
CO5: Adapt, negotiate and facilitate with multifarious socio-economical and professional arenas with
effective communication and interpersonal skills.

Course Contents:
Module 1: Introduction to the Language Lab
a. The Need for a LanguageLaboratory
b. Tasks in theLab
c. Writing a Laboratory NoteBook

Module 2: Active Listening

a. What is ActiveListening?
b. Listening Sub-Skills—Predicting, Clarifying, Inferencing, Evaluating,Note-taking
c. Listening in BusinessTelephony

Module 3: Speaking
a. Speaking—Accuracy and FluencyParameters
b. Pronunciation Guide—Basics of Sound Scripting, Stress andIntonation
c. Fluency-focussed activities—JAM, Conversational Role Plays, Speaking using Picture/Audio Visual
inputs
d. Accuracy-focussed activities—Identifying Minimal Pairs, Sound Mazes, Open and Closed Pair
Drilling, Student Recordings (usingsoftware)
e. Group Discussion: Principles andPractice
f. Giving a Presentation—Learning Presentation Basics and Giving MicroPresentations

Module 4: Lab Project Work

a. Writing a BookReview
b. Writing a FilmReview
c. Scripting a Short Presentation (2minutes)
d. Making a short video CV (1-2minutes)

22
 R23B.TECH.CSE

References:
1. IT Mumbai, Preparatory Course in Englishsyllabus
2. IIT Mumbai, Introduction to Linguisticssyllabus
3. Sasikumar et al. A Course in Listening and Speaking.New Delhi: Foundation Books, 2005.
4. Tony Lynch, Study Listening. Cambridge: Cambridge UP,2004.

CO-PO Mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 - - 2 - - 1 1 - 2 3 - 2
CO2 - - 2 2 - 3 3 - 2 3 - 3
CO3 - - 2 2 - 3 3 2 2 3 - 3
CO4 - - - - - 3 3 2 2 3 - 3
CO5 - - 2 2 - 3 3 2 2 3 - 3

23
 R23B.TECH.CSE

Course Name: Engineering chemistry lab

Paper Code: CH(CS)191
Total Contact Hours: 24
Credit: 1

Course Objective
• Study the basic principles of pH meter and conductivity meter for different applications
• Analysis of water for its various parameters & its significance in industries
• Learn to synthesis Polymeric materials and drugs
• Study the various reactions in homogeneous and heterogeneous medium

Course Outcome
CH191.1: Able to operate different types of instruments for estimation of small quantities chemicals
used in industries and scientific and technical fields.
CH191.2: Able to analyse and determine the composition and physical property of liquid and solid
samples when working as an individual and also as a team member
CH191.3: Able to analyse different parameters of water considering environmental issues
CH191.4: Able to synthesize drug and sustainable polymer materials.
CH191.5: Capable to design innovative experiments applying the fundamentals of modern chemistry

CO-PO Mapping

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 1 3 1 - 2 3 - - - - 1
1
2 2 1 1 - 1 - - - 1 - 1
2
3 - - - - - - - - 3 3 2 2
2 1 2 2 - - 1 - - - - 2
4
3 3 3 3 1 1 1 1 - - 2 2
5

COURSE CONTENT
1. Determination of the concentration of the electrolyte through conductance measurement.
2. Determination of water quality measurement techniques.
3. Determination of the concentration of the electrolyte through pH measurement.
4. Estimation of Cu in brass
5. Estimation of Fe2O3 in Cement
6. Isolation of graphene from dead dry batteries and their use for temporary soldering.

24
 R23B.TECH.CSE

7. Synthesis of Silver Nanoparticles doped organic thin film for organic transistors.
8. Estimation of corrosion in a given sample metal.
9. Preparation of Si-nano crystals for future memory devices.
10. Green Synthesis of ZnO based Polymer Nano composites.
11. Synthesis of polymers for electrical devices and PCBs.
12. Determination of Partition Coefficient of acetic acid between two immiscible liquids.
13. Drug design and synthesis
14. Rheological properties of the Newtonian fluids
15. Innovative Experiments

25
 R23B.TECH.CSE

Course Name: Workshop and Manufacturing

Practices Lab Course Code: ME(CS)191
Contact: 0:0:3
Credits: 1.5

Prerequisite: Physics & Mathematics (10+2 Level)

CO1: Gain basic knowledge of Workshop Practice and Safety useful for our daily living.
CO2: Understand the use of Instruments of a pattern shop like Hand Saw, Jack Plain, Chisels etc.
CO3: Apply and performing operations like such as Marking, Cuttingetc used in manufacturing
processes.
CO4: Analyze the various operations in the Fitting Shop using Hack Saw, various files, Scriber, etc to
understand the concept of tolerances applicable in all kind of manufacturing.
CO5: Gethandson practice of in Welding and apply various machining processes which give a lot of
confidence to manufacture physical prototype sin project works.

Course Content:
3P
(i)Theoreticaldiscussions:
1. ManufacturingMethods-casting, forming,machining,joining,advanced manufacturing methods
2. Fittingoperations&powertools
3. Carpentry
4. Welding(arcwelding&gaswelding),brazing
5. Electrical&Electronics
6. Metalcasting
7. CNCmachining,Additivemanufacturing, 3D Printing
8. Plasticmoulding&GlassCutting

(ii)WorkshopPractice:

At least 6 modules should be covered

Module 1-Machineshop 6P
Typicaljobsthatmaybemadeinthispracticemodule:
i. Tomakeapin fromamild steelrod inalathe.
ii. Tomakerectangularandveeslotinablockofcastironormildsteelinashapingand/ormillingmachine.

Module2-Fitting shop 6P
Typicaljobsthatmaybemadeinthispracticemodule: TomakeaGaugefromMSplate.

Module3 –Carpentry Shop 6P

Typicaljobsthatmaybemadeinthispracticemodule: Tomakewoodenjointsand/or apatternorlike.

Module4-Welding & Soldering shop 6P

Typicaljobsthatmaybemadeinthispracticemodule:
i. Arc Welding:To jointwothick (approx5mm)MSplatesby manualmetalarcwelding.
ii. Gas Welding:Tojointwothinmild steelplatesorsheetsbygaswelding.
iii. Housewiring,softSoldering

Module 5–Smithy & Casting 6P

26
 R23B.TECH.CSE

Typicaljobsthatmaybemadeinthispracticemodule:
i. Asimplejobofmakingasquarerodfromaroundbar or similar.
ii. One/twogreensandmodulstoprepare, andacastingbedemonstrated.

Module6– CNC Machining & LaserCutting 6P

Typicaljobsthatmaybemadeinthispracticemodule:
i. Atleastonesample shape on mild steel plate shouldbe made using CNC Milling / CNC Lathe Machine
ii. Atleastonesampleshape onglassshouldbe madeusinglasercuttingmachine.

Module 7 – 3D Printing 6P
i) Exposure to a 3D printing machine,
ii) 3D printing of at least one sample model using available materials.

Examinationscouldinvolvetheactualfabricationofsimplecomponents, utilizingoneormoreofthetechniques
coveredabove.

TextBooks:
1. HajraChoudhuryS.K.,
HajraChoudhuryA.K.andNirjharRoyS.K.,―ElementsofWorkshopTechnology‖,Vol.I2008andVol.II
2010,Media promotersandpublishersprivatelimited,Mumbai.
2. RaoP.N.,―ManufacturingTechnology‖,Vol.IandVol.II,
TataMcGrawHillHouse,2017.

ReferenceBooks:
1. GowriP.,HariharanandA.SureshBabu, ManufacturingTechnology–
I,PearsonEducation,2008.
2. RoyA.Lindberg,―Processes and MaterialsofManufacture‖,
4thedition,PrenticeHallIndia,1998.
3. KalpakjianS.andStevenS.Schmid,ManufacturingEngineeringandTe
chnology,4thedition,PearsonEducationIndiaEdition,2002.
4. ManufacturingScience byA.GhoshandA.K.Mallick,WileyEastern.
5. PrinciplesofMetalCutting/PrinciplesofMachineToolsby G.C.
SenandA.Bhattacharya,NewCentralBookAgency,Kolkata.

CO-PO/PSO Mapping:
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO12 PSO1 PSO PSO
Codes 0 1 2 3
CO1 3 2 2 2
CO2 3 2 2 2
CO3 3 2 2 2 2 2
CO4 3 2 2 2 2 2
CO5 3 2 2 2 2 2

27
 R-23 B. Tech CSE
1st Year 2nd Semester
Hours per
Sl. Broad Course week
Category Course Title Credits
No. Category Code L T P Total
A.THEORY
1 ENGG Major CS201 Data Structures 3 0 0 3 3
Basic Electrical &
2 Minor EE(CS)201 Electronics 3 0 0 3 3
ENGG
Engineering

3 SCI Multidisciplinary PH(CS)201 Engineering Physics 3 0 0 3 3

Engineering
SCI Multidisciplinary M(CS)201 3 0 0 3 3
4 Mathematics –II

HUM Value added

HU204 Environmental Science 2 0 0 2 2
5 course

HUM Value added Indian Knowledge

6 HU205 1 0 0 1 1
course System
B.PRACTICAL
1 ENGG Major CS291 Data Structures Lab 0 0 3 3 1.5
Basic Electrical &
2 Minor EE(CS)291 Electronics 0 0 3 3 1.5
ENGG Engineering Lab
Ability
HUM Enhancement HU292 Design Thinking 0 0 2 2 1
3
Course
Skill
Engineering Physics
SCI enhancement PH(CS)291 0 0 3 3 1.5
4 Lab
course
Skill
Engineering Graphics
ENGG enhancement ME(CS)291 0 0 3 3 1.5
5 & Design Lab
course
Total of Theory & Practical 29 22

27
 R-23 B. Tech CSE

Course Name: Data Structures

Course Code: CS201
Contact (Periods/Week):=3L/Week
Total Contact Hours: 36
Credits: 3

Course Objectives:
1. To learn the basics of abstract datatypes.
2. To learn the principles of linear and nonlinear datastructures.
3. To build an application using sorting andsearching.

Course
Name of Course Outcomes
Outcomes
CO1 To identify how the choices of data structure & algorithm methods impact the performance
ofprogram.
CO2 To express problems based upon different data structure for writingprograms.

CO3 To implement programs using appropriate data structure & algorithmic methods for solving
problems.
CO4 To explain the computational efficiency of the principal algorithms for sorting, searching,
and hashing.
CO5 To write programs using dynamic and static data structures and building applications for
real world problems.

CO-PO-PSO Mapping:
CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO 3 2 2 3 1 3 1 1 1
1
CO 3 2 2 2 2 2 3 2 2
2
CO 2 3 3 2 3 1 2 3 3 3
3
CO 2 2 2 3 1 1 2 1 2
4
CO 2 3 3 3 2 1 2 3 3 3
5
2.4 2.4 2.5 2.4 2.2
0 0 0 0 0 2.00 2.40 2.00 2.20

Course Content:

Module 1: Introduction [4L]

Concepts of data and information; Concept of Abstract Data Type, Data Structure and Data Type.
Classification of Data Structures- Primitive and Non-Primitive Data Structure, Linear and Non-Linear
Data Structure. Need of Data Structures. (1L)
28
 R-23 B. Tech CSE

Concept of algorithms and programs, Different methods of representing algorithm; Algorithm analysis,
time and space analysis of algorithms – Asymptotic notations like Big Oh (O), Small Oh(o), Big
Omega(Ω), Small Omega(ω) and Theta(Ɵ) notation (definition and significance).(3L)

Module 2: Non-Restricted Linear Data Structure[9L]

List or Linear List: Definition and Example, List as ADT. Representation of Linear List- Sequential
Representation and Linked Representation.
Array: Introduction to sequential representation, Linearization of multidimensional array. Application
ofarray-representationofpolynomialusingarray,RepresentationofSparsematrixusingarray.
Linked List: Introduction to linked representation, Implementation of different types of linked list-
Singly linked list, Doubly linked list, Circular linked list, Circular Doubly Linked List. Application of
Linked list- Representation ofpolynomial.

Module 3: Restricted Linear Data Structure [6L]

Stack: Definition of Stack, implementations of stack using array and linked list, Applications of stack-
infix to postfix conversion, Postfix Evaluation
Recursion: Principles of recursion - use of stack, tail recursion. Tower of Hanoi using recursion.
Queue: Definition of Queue; Implementation of queue using array-physical, linear and circular model;
Implementation of queue using linkedlist.
Dequeue - Definition and different types of dequeue.

Module 4: Nonlinear Data structures [9L]

Trees and Binary Tree:
Basic terminologies; Definition of tree and binary tree. Difference between tree and binary tree,
Representation of binary tree (using array and linked list)
Binary tree traversal (pre-, in-, post- order); Threaded binary tree- definition, insertion and deletion
algorithm; Binary search tree- Definition, insertion, deletion, searching algorithm;
Height balanced binary tree: AVL tree- definition, insertion and deletion with examples only.
m –Way Search Tree: B Tree – Definition, insertion and deletion with examples only; B+ Tree –
Definition, insertion and deletion with examples only.
Heap: Definition (min heap and max heap), creation, insertion and deletion algorithm. Application of
heap (priority queue and sorting).
Graphs: Definition and representation (adjacency matrix, incidence matrix and adjacency list).
Graph traversal– Depth-first search (DFS), Breadth-first search (BFS) - concepts of edges used in
DFS and BFS (tree-edge, back-edge, cross-edge, andforward-edge).

Module 5: Sorting and Searching [8L]

Sorting Algorithms: Definition and need of sorting, different types of sorting algorithm (internal,
external, stable, in-place, comparison based); Factors affecting sorting Methods, Bubble sort, Insertion
sort, Selection sort, Quick sort, Merge sort, Radix sort – algorithm with analysis (time complexity)
Searching: Factors affecting searching Methods; Sequential search –algorithm with analysis (time
complexity); improvement using sentinel.
Binary search and Interpolation Search algorithm with analysis (time complexity)
Hashing: Introduction and purpose of Hashing and Hash functions (division, folding and mid-square),
Collision resolution techniques.

Text book:
1. Data Structures Through 'C' Language by Samiran Chattopadhyay, Debabrata Ghosh Dastidar,
Matangini Chattopadhyay, Edition: 2001, BPBPublications
2. FundamentalsofDataStructuresofCbyEllisHorowitz,SartajSahni,SusanAnderson-freed2nd
Edition, Universities Press

Reference Books:
1. Data Structures, Algorithms, and Software Principles in C by Thomas A. Standish, 1 Edition,
Pearson.

29
 R-23 B. Tech CSE

2. Data Structures by S. Lipschutz, Special Indian Edition, Tata McGraw Hill Education (India)
Private
Limited
3. DataStructuresandProgramDesigninCbyRobertL.Kruse,BruceP.Leung2 Edition,Pearson
nd

4. DataStructuresinCbyAaronM.Tenenbaum,1 Edition,Pearson.
St

30
 R-23 B. Tech CSE

Course Name: Basic Electrical & Electronics Engineering

Course Code: EE(CS)201
Contact: 3:0:0
Total Contact Hours: 36
Credit: 3

Prerequisite: Basic 12th standard Physics and Mathematics, Concept of components of electric
circuit.

Course Outcomes: After successful completion of the course, student will be ableto
CO Statement
CO1 Apply fundamental concepts and circuit laws to solve
simple DC electric circuits
CO2 To solve simple ac circuits in steady state
CO3 Impart the knowledge of Basic Electronics Devices and ICs.
CO4 Analyze the simple electronics circuits

MODULE 1: Elementary Concepts of ElectricCircuits 6L

DC Circuits: Circuit Components: Conductor, Resistor, Inductor, Capacitor – Ohm’s Law -

Kirchhoff’s Laws –Independent and Dependent Sources – Simple problems- Nodal Analysis,
Mesh analysis with independent sources only (Steady state)
Introduction to AC Circuits and Parameters: Waveforms, Average value, RMS Value,
Instantaneous power, real power, reactive power and apparent power, power factor – Steady
state analysis of RLC circuits (Simple problemsonly)

MODULE 2:Electricalmachine 8L

Transformer: Magnetic materials, BH characteristics, ideal and practical transformer,

equivalent circuit, losses in transformers, regulation andefficiency.
DC Machines: Brief idea on constructional features, classifications, working principle of both
motor and generator. Simple problems on Voltage equation.

MODULE 3: Fundamentals ofSemiconductorDevices: 6L

Introduction to Semiconductor: Concept of energy band diagram; Comparison among metal,

insulator, semiconductor; Semiconductors-classifications and Fermi energy level; Charge
neutrality and Mass-Action law in semiconductor; Current flow in semiconductor due to drift&
diffusion process; Einsteinrelation.

MODULE 4: PNJunctionDiode: 4L

Principle of operation; V-I characteristics; principle of avalanche &Zener breakdown; Junction

resistances and capacitances; V-I characteristics of Zenerdiode.

MODULE 5: BipolarJunctionTransistors: 4L

PNP and NPN structures; Principle of operation; Current gains in CE, CB and CC mode;
input and output characteristics; Biasing & Stability Analysis-Concept of Fixed Bias,
3
 R-23 B. Tech CSE

Collector to base Bias & voltage divider bias.

MODULE 6: IntroductiontoIC: 8L

Integrated circuit-Basic idea, classifications, advantages, disadvantages; OPAMP(IC741)-Pin

configuration and equivalent circuit; Characteristics of OPAMP(IC741); Inverting & Non-
Inverting Amplifier; Adder, Subtractor, Differentiator & Integrator Circuit.

Textbooks:

1.A Textbook of Electrical Technology - Volume I (Basic Electrical Engineering) &

VolumeII(Ac&DCMachines)-B.LTheraja&A.K.Teraja,S.Chad,23 rdEdition,1959
2.D. Chattopadhyay, P.C Rakshit, “Electronics Fundamentals and Applications”, New
Age International (P) Limited Publishers, SenenthEdition,2006
3. BasicElectrical & Electronics Engineering by J.B. Gupta , S.K.Kataria& Sons,2013
4. BasicElectrical and Electronics Engineering-I by AbhijitChakrabartiand SudipDebnath,
McGraw Hill,2015
5. M.S.Sukhija and T.K.Nagsarkar, Basic Electrical and Electronics Engineering, Oxford
UniversityPress,2012.
6. DP Kothari and IJ Nagrath, “Basic Electrical & Electronics Engineering”, Tata McGraw
Hill,2020.

Reference Books
1. D C Kulshreshtha, “Basic ElectricalEngineering”,TataMcGrawHill,2010.
2. T.K. Nagsarkar, M.S. Sukhija, “Basic Electrical Engineering”, Oxford Higher
Education.
3. Hughes,“Electrical and Electronic Technology”, PearsonEducation”.
4. Parker and Smith, “Problems in Electrical Engineering”, CBS Publishers and
Distributors.
5. Anant Agarwal, Jeffrey Lang, Foundations of Analog and Digital Electronic Circuits,
Morgan Kaufmann Publishers,2005.
6. Bernard Grob, Basic Electronics,McGrawHill.
7. ChinmoySaha, ArindhamHalder and DebaratiGanguly, Basic Electronics-Principles and
Applications, Cambridge University Press,2018.

CO-PO Course Articulation Matrix Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO 7 PO8 PO9 PO PO PO

10 11 12
CO1 3 3 2 1 - - - - - - 2 2
CO2 3 3 2 1 - - - - - - 2 2
CO3 3 2 2 1 - - - - - - 1 2
CO4 2 3 2 1 - - - - - - 2 1

3
 R-23 B. Tech CSE

Course Name: Engineering Physics

Course Code: PH(CS)201
Contact: (3:0:0)
Total Contact Hours: 36
Credits: 3
Prerequisites: Knowledge of Physics up to 12th standard.

Course Objectives:
The aim of courses in Physic-I is to provide adequate exposure and develop insight about the basic
principles of physical sciences and its practical aspects which would help engineers to learn
underlying principles of various tools and techniques they use in core engineering and related
industrial applications. The course would also inculcate innovative mindsets of the students and can
create awareness of the vital role played by science and engineering in the development of new
technologies.

Course Outcomes (COs):

After attending the course students’ should be able to

CO Description
CO1 explain basic principles of laser and optical fibers.
CO2 understand the properties of Nano material.
CO3 analyze different crystallographic structures according to their co-ordination number and packing
factors.
CO4 analyze the structure, function and characteristics of different storage devices.
CO5 justify the need of a quantum mechanics as remedy to overcome limitations imposed by classical
physics.

CO-PO Mapping:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 -- -- -- -- -- -- -- 2
CO2 3 3 2 2 -- -- -- -- -- -- -- 2
CO3 3 3 2 2 -- -- -- -- -- -- -- 1
CO4 3 2 2 2 -- -- -- -- -- -- -- 2
CO5 3 3 3 2 2 -- -- -- -- -- -- 1

Course Content:

Module 1 (12L)
Modern Optics
1.01- Laser: Concepts of various emission and absorption processes, Einstein A and B coefficients
and
equations, working principle of laser, meta stable state, population inversion, condition necessary for
active laser action, optical resonator, illustrations of Ruby laser, He-Ne laser, Semiconductor laser,
applications of laser, related numericalproblems. 6L
1.02-Fibre optics-Principle and propagation of light in optical fibers (Step index, Graded index,
single and multiple modes) - Numerical aperture and Acceptance angle, Basic concept of losses in
optical fiber, related numerical problems.3L
1.03-Holography-Theory of holography, viewing of holography, applications 3L

Module 2 (6L)
Solid State Physics

3
 R-23 B. Tech CSE

2.01 Crystal Structure: Structure of solids, amorphous and crystalline solids (definition and
examples), lattice, basis, unit cell, Fundamental types of lattices –Bravais lattice, simple cubic, fcc
and bcc lattices, Miller indices and miller planes, co-ordination number and atomic packing factor,
Bragg’s equation, applications, numericalproblems.
3L
2.02 Semiconductor: Physics of semiconductors, electrons and holes, metal, insulator and
semiconductor, intrinsic and extrinsic semiconductor, p-njunction.3L

Module 3 (8L)
Quantum Mechanics
3.01 Quantum Theory: Inadequacy of classical physics-concept of quantization of energy, particle
concept of electromagnetic wave (example: photoelectric and Compton Effect; no derivation
required, origin of modified and unmodified lines), wave particle duality; phase velocity and group
velocity;deBrogliehypothesis;DavissonandGermerexperiment,relatednumericalproblems.
4L
3.02 Quantum Mechanics 1: Concept of wave function, physical significance of wave function,
probability interpretation; normalization of wave functions-Qualitative discussion; uncertainty
principle, relevant numerical problems, Introduction of Schrödinger wave equation (only
statement). 4L

Module 4 (4L)
Physics of Nano materials
Reduction of dimensionality, properties of nanomaterials, Quantum wells (two dimensional),
Quantum wires (one dimensional), Quantum dots (zero dimensional); Quantum size effect and
Quantum confinement. Carbon allotropes. Application of nanomaterials (CNT, graphene,
electronic, environment,medical).

Module 5 (6L)
Storage and display devices
Different storage and display devices-Magnetic storage materials, Hard disc (examples related to
computers compared with semiconductor storage viz. Pendrive), Operation and application of CRT,
CRO, Liquid crystal display (LCD), LED, OLED, Plasma display, Thin film transistor display).

Recommended Text Books for Physics I:

Text Books:
1. Refreshercoursesinphysics(Vol.1,Vol.2&Vol.3)-C.L.Arora(S.ChandPublishers)
2. Basic Engineering Physics-Amal Chakraborty (Chaya Prakashani Pvt.Ltd.)
3. Perspective & Concept of Modern Physics -ArthurBaiser
4. Principles of engineering physics – Md. N Khan and SPanigrahi.

3
 R-23 B. Tech CSE

Course Name: Engineering Mathematics - II

Paper Code: M(CS)201
Contact (L: T: P): 3:0:0
Total Contact Hours: 36
Credit: 3
Prerequisites:
The students to whom this course will be offered must have the concept of (10+2) standard calculus.
Course Objectives:
The objective of this course is to familiarize the prospective engineers with techniques in ordinary
differential equations, Laplace transform and numerical methods. It aims to equip the students with
standard concepts and tools at an intermediate to advanced level that will serve them well towards
tackling more advanced level of mathematics and applications that they would find useful in their
disciplines.

Course Outcomes (COs):

On successful completion of the learning sessions of the course, the learner will be able to:

CO1: Recall the properties related to ordinary differential equations, Laplace transform and
numericaltechniques.

CO2: Determine the solutions of the problems related to ordinary differential equations, Laplace
transform and numerical techniques.

CO3: Apply appropriate mathematical tools of ordinary differential equations, Laplace transform and
numerical techniques for the solutions of the problems.

CO4: Analyze engineering problems by using ordinary differential equation, Laplace transform and
numerical Methods.

CO-PO/PSO Mapping:

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10 P11 P12

CO1 3 2 - - - - - - - - - 2

CO2 3 2 - - - - - - - - - 1

CO3 3 2 2 - - - - - - - - 1

CO4 2 3 1 2 - - - - - - - 1

M(CS) 201 2.75 2.25 1.5 2 - - - - - - - 1.25

Weightage Values: Strongly mapped: ‘3’, Moderately mapped: ‘2’, Weakly mapped: ‘1’, Not mapped: ’-‘.

Course Content:

Module I: First Order Ordinary Differential Equations (ODE) (9L)

Solution of first order and first degree ODE: Exact ODE, Rules for finding Integrating factors,
Linear ODE, Bernoulli’s equation.

3
 R-23 B. Tech CSE

Solution of first order and higher degree ODE: solvable forp, solvable for y and solvable for x
and Clairaut’sequation.

Module II: Second Order Ordinary Differential Equations (ODE) (8L)

Solution of second order ODE with constant coefficients: C.F. &P.I., Method of variation of
parameters, Cauchy-Euler equations.

Module III: Laplace Transform (LT) (12L)

Concept of improper integrals; Definition and existence of LT, LT of elementary functions, First
and second shifting properties, Change of scale property, LT of tf(t), LT of f(t)t, LT of derivatives of
f(t), LT of integral of f(t), Evaluation of improper integrals using LT, LT of periodic and step
functions, Inverse LT: Definition and its properties, Convolution theorem (statement only) and its
application to the evaluation of inverse LT, Solution of linear ODE with constant coefficients (initial
value problem) usingLT.

Module IV: Numerical Methods (7L)

Introduction to error analysis, Calculus of finite difference. Interpolation: Newton forward and
backward interpolation, Lagrange’s interpolation. Numerical integration: Trapezoidal rule,
Simpson’s 1/3 rule. Numerical solution of ordinary differential equation: Euler method, Fourth
order Runge - Kuttamethod.

Text Books:
1. Grewal, B.S., Higher Engineering Mathematics, Khanna Publishers, 36th Edition,2010.
2. Kreyszig, E., Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,2006.

ReferenceBooks:
1. Guruprasad, S. A text book of Engineering Mathematics-I, New ageInternational Publishers.
2. Ramana, B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11th
Reprint,2010.
3. Veerarajan, T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi,2008.
4. Bali, N.P. and Goyal, M., A text book of Engineering Mathematics, Laxmi Publications,
Reprint,2008.
5. Thomas, G.B. and Finney, R.L., Calculus and Analytic geometry, 9thEdition, Pearson,
Reprint,2002.
6. Apostol, M., Calculus, Volumes 1 and 2 (2nd Edition), Wiley Eastern,1980.
7. Kumaresan, S., Linear Algebra - A Geometric approach, Prentice Hall of India, 2000.
8. Poole, D., Linear Algebra: A Modern Introduction, 2nd Edition, Brooks/Cole,2005.
9. Bronson, R., Schaum's Outline of Matrix Operations.1988.
10. Piskunov, N., Differential and Integral Calculus, Vol. I & Vol. II,Mir Publishers, 1969.

3
 R-23 B. Tech CSE

Course Name: Environmental Science

Paper Code: HU204
Contact (L: T: P): 2 : 0 : 0
Total Contact Hours: 24
Credit: 3

Course Objective(s)
This course will enable the students to,
• Realize the importance of environment and its resources.
• Apply the fundamental knowledge of science and engineering to assess environmental and
health risk.
• Know about environmental laws and regulations to develop guidelines and procedures for
health and safety issues.
• Solve scientific problem-solving related to air, water, land and noise pollution.

Course Outcome

CO Statement
C01 Able to understand the natural environment and its relationships with
human activities
C02 The ability to apply the fundamental knowledge of science and engineering
to assess environmental and health risk
C03 Ability to understand environmental laws and regulations to develop
guidelines and procedures for health and safety issues
CO4 Acquire skills for scientific problem-solving related to air, water, noise &
land pollution.

CO – PO Mapping
CO Statement
PO1 PO PO PO PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO1
2 3 4 2
Able to 2 2 3 - - 2 3 3 - - 1 2
1 understand the
natural
environment and
its relationships
with human
activities

3
 R-23 B. Tech CSE
The ability to 3 3 3 1 1 2 3 3 - - 1 2
2 apply the
fundamental
knowledge of
science and
engineering to
assess
environmental
and health risk

Ability to 3 3 3 2 1 2 3 3 - - 1 2
3 understand
environmental
laws and
regulations to
develop
guidelines and
procedures for
health and safety
issues

Acquire skills for 1 1 1 1 2 2 3 3 - - 1 2

4 scientific
problem-solving
related to air,
water, noise &
land pollution.

AVERAGE 2 2 2 1 1 2 3 3 - - 1 2

Module 1 - Resources and Ecosystem (6L)

1. Resources (2L)
Types of resources, resistance to resources, Human resource, Population Growth models: Exponential
Growth, logistic growth
2. Ecosystem (3L)
Components of ecosystem, types of ecosystem, Forest ecosystem, Grassland ecosystem, Desert
ecosystem, Aquatic ecosystems, Food chain, Food web.
3. Energy and Environment(1L)
Conventional energy sources, coal and petroleum, Green energy sources, solar energy, tidal energy,
geothermal energy, biomass
Module 2 – Environmental Degradation (9L)
1. Air Pollution and its impact on Environment (3L)
Air Pollutants, primary & secondary pollutants, Criteria pollutants, Smog, Photochemical smog and
London smog, Greenhouse effect, Global Warming, Acid rain, Ozone Layer Depletion.
2. Water Pollution and its impact on Environment (3L)
3
 R-23 B. Tech CSE
Water Pollutants, Oxygen demanding wastes, heavy metals, BOD, COD, Eutrophication, Hardness,
Alkalinity, TDS and Chloride, Heavy metal poisoning and toxicity.
3. Land Pollution and its impact on Environment (2L)
Solid wastes, types of Solid Waste, Municipal Solid wastes, hazardous wastes, bio-medical wastes, E-
wastes
4. Noise Pollution and its impact on Environment (1L)
Types of noise, Noise frequency, Noise pressure, Noise intensity, Noise Threshold limit, Effect of noise
pollution on human health.
Module 3 – Environmental Management (6L)
1. Environmental Impact Assessment (1L)
Objectives of Environmental management, Components of Environmental Management, Environmental
Auditing, Environmental laws and Protection Acts of India
2. Pollution Control and Treatment (2L)
Air Pollution controlling devices, Catalytic Converter, Electrostatic Precipitator, etc., Waste Water
Treatment, Noise pollution control.
3. Waste Management (3L)
Solid waste management, Open dumping, Land filling, incineration, composting, E-waste management,
Biomedical Waste management.
Module 4 – Disaster Management (3L)
1. Study of some important disasters (2L)
Natural and Man-made disasters, earthquakes, floods drought, landside, cyclones, volcanic eruptions,
tsunami, Global climate change. Terrorism, gas and radiations leaks, toxic waste disposal, oil spills,
forest fires.
2. Disaster management Techniques (1L)
Basic principles of disasters management, Disaster Management cycle, Disaster management policy,
Awareness generation program

Text Books:
1.Basic Environmental Engineering and Elementary Biology (For MAKAUT),
GourkrishnaDasmohapatra, Vikas Publishing.
2. Basic Environmental Engineering and Elementary Biology, Dr. MonindraNathPatra& Rahul Kumar Singha, Aryan
Publishing House.
3. Textbook of Environmental Studies for Undergraduate Courses, ErachBarucha for UGC, Universities Press

Reference Books:
1. A Text Book of Environmental Studies, Dr. D.K. Asthana & Dr. Meera Asthana, S.Chand Publications.
2.Environmental Science(As per NEP 2020), Subrat Roy, Khanna Publisher

3
 R-23 B. Tech CSE

Paper Name: Indian knowledge System

Paper Code: HU205
Credit: 01
No. of lectures: 12

Module-1 (3L)
An overview of Indian Knowledge System (IKS): Importance of Ancient Knowledge - Definition
of IKS - Classification framework of IKS - Unique aspects ofIKS.
The Vedic corpus: Vedas and Vedangas - Distinctive features of Vedic life.
Indian philosophical systems: Different schools of philosophy.

Module-2 (3L)
Salient features of the Indian numeral system - Importance of decimal representation - The
discovery of zero and its importance - Unique approaches to representnumbers.
Highlights of Indian Astronomy: Historical development of astronomy in India
Module-3 (3L)
Indian science and technology heritage - Metals and metalworking - Mining and ore extraction –
Physical structures in India - Irrigation and water management - Dyes and painting technology -
Surgical Techniques - Shipbuilding

Module-4 (3L)
Traditional Knowledge in Different Sectors: Traditional knowledge and engineering, Traditional
medicine system, Traditional Knowledge in agriculture, Traditional societies depend on it for their
food and healthcare needs.

References:
1. Introduction to Indian knowledge system: concepts and applications-MahadevanB.Bhat,
VinayakRajat, NagendraPavanaR.N.,PHI
2. Traditional Knowledge system in India, Amit Jha, AtlanticPublishers
3. S. N. Sen and K. S. Shukla, History of Astronomy in India, Indian National Science Academy,
2nd edition, New Delhi,2000

3
 R-23 B. Tech CSE

Course Name: Data Structures Lab

Course Code: CS291
Contact (Periods/Week): 3L/Week
Total Contact Hours: 36
Credits: 1.5

Course
Name of Course Outcomes
Outcomes
CO1 To identify the appropriate data structure as applied to specified problem definition.

CO2 To summarize operations like searching, insertion, deletion, traversing mechanism

used on various data structures.
CO3 To implement practical knowledge of data structures on the applications.

CO4 To illustrate how to store, manipulate and arrange data in an efficient manner.

CO5 To write programs to access queue and stack using arrays and linked list, binary tree
and binary search tree.

CO-PO-PSO Mapping:

CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

CO1
3 3 3 2 3 - - - - - - 2 1 1 1
CO2
3 2 2 3 3 - - - - - 3 2 3 2 2
CO3
2 3 3 - 2 - - - - - - 2 3 3 3
CO4
2 2 1 3 2 - - - - - 2 3 2 1 2
CO5
2 2 3 1 2 - - - - - - 3 3 3 3

2.4 2.4 2.4 2.3 2.4 - - - - - 2.5 2.4 2.4 2 2.2

Course Content:

Module 1: Implementing Non-Restricted Linear Data Structure [2 Lab]

Problem based on Implementation of Non-Restricted Linear Data Structure like- Implementation of
list as data structure using array. Implementation of list as data structure using linked list of different
types. Implementation of polynomial as data structure using array and linked list. Implementation of
sparse matrix as data stricture usingarray.

Module 2: Implementing Restricted Linear Data Structure [3 Lab] Problem based on

Implementation of Restricted Linear Data Structure like- Implementation of stack as data structure
using array. Implementation of stack as data structure using linked list. Implementation of queue as
data structure using array (physic al, linear and circular model). Implementation of queue as data
structure using linked list. Converting infix to post-fix and evaluating post-fix expression using
stack. Implementing Tower-of-Hanoiproblem.

40
 R-23 B. Tech CSE

Module 3: Implementing Non-Linear Data Structure [2 Lab]

Problem based on Implementation of Non-Linear Data Structure like Implementation of Binary
Tree as data structure using array and linked list. Implementation of Binary Search Tree (BST) as
data structure using linked list. Implementation of Heap as data structure using array.
Implementation of Priority Queue as data structure usingHeap.

Module 4: Implementing Sorting and Searching algorithm [5 Lab] Problem based on

Implementation of Sorting and Searching algorithm
Implementation of Bubble sort using appropriate data structure.
Implementation of Selection sort using appropriate data structure.
Implementation of Insertion sort using appropriate data structure. Implementation of Quick sort
using appropriate datastructure.
Implementation of Merge sort using appropriate data structure.
Implementation of Heap sort using appropriate data structure.
Implementation of Radix sort using appropriate data structure.
Implementation of Sequential Search using appropriate data structure.
Implementation of Binary Search using appropriate data structure.
Implementation of hashing with collision resolution using linear and quadratic probing.

Text books:
1. Data Structures Through 'C' Language by Samiran Chattopadhyay, Debabrata Ghosh
Dastidar, Matangini Chattopadhyay, Edition: 2001, BPBPublications.
2. Fundamentals of Data Structures of C by Ellis Horowitz, SartajSahni, Susan Anderson- freed
2nd Edition, UniversitiesPress.

Reference books:
1. Data Structures, Algorithms, and Software Principles in C by Thomas A. Standish, 1
Edition,Pearson.
2. Data Structures by S. Lipschutz, Special Indian Edition, Tata McGraw Hill Education
(India)Private.
3. Limited Data Structures and Program Design In C by Robert L. Kruse, Bruce P. Leung 2nd
Edition,Pearson.
4. Data Structures in C by Aaron M. Tenenbaum, 1St Edition,Pearson

41
 R-23 B. Tech CSE

Course Name: Basic Electrical & Electronics Engineering Lab

Course Code: EE(CS)291
L-T-P: 0-0-3
Total Lecture: 36
Credit: 1.5

CO Statement
CO1 To Analyze a given network by applying KVL and KCL.
CO2 To Examine the Operation of DC Motor.
CO3 To Examine the Operation of Basic Electronics Devices and ICs.
CO4 To design simple electronics circuits.

List of Experiments: -

1. Familiarization with different passive and active electrical &electroniccomponents.

2. Familiarization with different Electrical & ElectronicsInstruments.
3. Verification of KVL andKCL.
4. Forward and reversal of DC shuntmotor.
5. Speed control of DC shuntmotor.
6. Study of the P-N junction diode V-I characteristics (Forward & ReverseBias).
7. Study of the Characteristics of Zener diode (Forward &ReverseBias).
8. Study of the Input and Output characteristics of BJT in CEmode.
9. Determination of offset voltage, offset current &bias current of OPAMP(IC741).
10. Determination of CMRR and slew rate ofOPAMP(IC741).
11. Determination of inverting and non-inverting gain ofOPAMP(IC741).
12. ExtramuralExperiment.

Textbooks:

1. Handbook of Laboratory Experiments in Electronics Engineering Vol. 1, AuthorName:

A.M. Zungeru, J.M. Chuma, H.U. Ezea, and M. Mangwala, Publisher -Notion Press
Electronic Devices and Circuit Theory by Robert Boylestad Louis Nashelsky,7th Edition,
Prentice Hall
2. Experiments Manual for use with Grob's Basic Electronics 12th Edition by Wes Ponick,
Publisher-McGraw Hill,2015
3. Laboratory Manual for ‘Fundamentals of Electrical & Electronics Engineering’: A
handbook for Electrical & Electronics Engineering Students by ManojPatil(Author),
JyotiKharade(Author),2020
4. The Art of Electronics, Paul Horowitz, Winfield Hill,Cambridge University Press,2015.
5. A Handbook of Circuit Math for Technical Engineers, Robert L. Libbey CRC Press, 05-
Jun-1991

42
 R-23 B. Tech CSE

Reference Books
1. Basic Electrical and Electronics Engineering, Author:S.K. Bhattacharya, Publisher:
Pearson EducationIndia,2011
2. Practical ElectricalEngineering
3. By Sergey N. Makarov, Reinhold Ludwig, Stephen J. Bitar, Publisher: Springer
International Publishing,2016
4. Electronics Lab Manual (Volume 2) By Navas, K. A. Publisher: PHI Learning Pvt. Ltd.
2018
5. Practical Electronics Handbook, Ian R. Sinclair and John Dunton, Sixthedition 2007,
Published by ElsevierLtd.

CO-PO Course Articulation Matrix Mapping:

PO1 PO2 PO3 PO4 PO5 PO6 PO 7 PO8 PO9 PO PO PO

10 11 12
CO1 3 2 3 2 - 2 - - 2 - 2 3
CO2 3 3 2 3 - 2 - - 3 - 2 2
CO3 3 2 2 3 - 2 - - 2 - 3 3
CO4 3 3 2 2 - 2 - - 3 - 2 3

43
 R-23 B. Tech CSE

Course Name: Engineering Physics Lab

Code: PH(CS)191
Contact Hours: 0:0:3
Credit: 1.5
Prerequisites: Knowledge of Physics up to 12th standard.

Course Objectives:
The aim of course is to provide adequate exposure and develop insight about the basic principles of
physical sciences and its practical aspects which would help engineers to learn underlying
principles of various tools and techniques they use in core engineering and related industrial
applications. The course would also inculcate innovative mindsets of the students and can create
awareness of the vital role played by science and engineering in the development of new
technologies.

Course Outcomes (COs):

After attending the course students’ will be able to
CO1 : demonstrate experiments allied to their theoretical concepts
CO2 : conduct experiments using LASER, Optical fiber.
CO3 : participate as an individual, and as a member or leader in groups in laboratory sessions
actively CO4 : analyze experimental data from graphical representations, and to communicate
effectively them in Laboratory reports including innovativeexperiment.
CO5: Design solutions for real life challenges.

CO-PO Mapping:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 2 3 3 -- -- -- -- -- -- --
CO2 2 3 2 3 3 -- -- -- -- -- -- --
CO3 2 3 2 3 3 -- -- -- -- -- -- --
CO4 2 2 3 2 3 -- -- -- -- -- -- --
CO5 2 2 3 2 3 -- -- -- -- -- -- --

Course Content:

General idea about Measurements and Errors (One Mandatory):

Error estimation using Slide calipers/ Screw-gauge/travelling microscope for one experiment.
Experiments on Classical Physics (Any 4 to be performed from the following experiments ):
1. Study of Torsional oscillation of Torsional pendulum & determination of time using various load
of theoscillator.
2. DeterminationofYoung’smoduliofdifferentmaterials.
3. Determination of Rigidity moduli of differentmaterials.
4. Determination of wavelength of light by Newton’s ringmethod.
5. Determination of wavelength of light by Laser diffractionmethod.
6. Optical Fibre-numerical aperture, powerloss.

Experiments on Quantum Physics (Any 2 to be performed from the following experiments):

7. Determination of Planck’s constant using photoelectriccell.
8. Verification of Bohr’s atomic orbital theory through Frank-Hertzexperiment.
9. Determination of Stefan’s Constant.
10. Study of characteristics of solar cell.

Perform at least one of the following experiments:

44
 R-23 B. Tech CSE

11. Calibration of an oscillator using LissajousFigure.

12. Determination of specific charge of an electron (e/m) by J. J ThompsonMethod.

**In addition it is recommended that each student should carry out at least one experiment beyond
the syllabus/one experiment as Innovative experiment.

Probable experiments beyond the syllabus:

1. Study of dispersive power of material of aprism.

2. Study of viscosity using Poiseuille’s capillary flow method/using Stoke’slaw.
3. Determination of thermal conductivity of a bad/good conductor using Lees-Charlton / Searle
apparatus.
4. Determination of the angle of optical rotation of a polar solution usingpolarimeter.
5. Any other experiment related to thetheory.

Text Books:
1. Practical Physics by Chatterjee &Rakshit (Book & AlliedPublisher)
2. Practical Physics by K.G. Mazumder (New CentralPublishing)
3. Practical Physics by R. K. Kar (Book & AlliedPublisher)

45
 R-23 B. Tech CSE

Paper Name: Design thinking

Paper Code: HU292
Credit: 01
L:T:P:: 0:0:2
Module 1: Understanding the Learning Process, Kolb’s Learning Styles, Assessing and Interpreting.
2
Module 2: Memory: process, Sensory memory, STM and LTM, Problems in retention, Memory
enhancementtechniques. 4
Module 3: Emotions: Experience & Expression Understanding Emotions, Empathy, And Concept of
EmotionalIntelligence. 2
Module 4: Basics of Design Thinking Definition of Design Thinking, Need for Design Thinking, Objective
of Design Thinking, Concepts & Brainstorming, Stages of Design Thinking Process (explain with
examples) – Empathize, Define, Ideate,Prototype,Test. 6
Module 5: Understanding Creative thinking process, Understanding Problem Solving, Testing Creative
ProblemSolving 4
Unit 6: Prototyping & Testing -Rapid Prototype Development process, Testing, Sample Example, Test
GroupMarketing 2
Module-7: Design thinking for strategic innovations Growth –Change- Examples of Customer Challenges,
Use of Design Thinking to Enhance Customer Experience -Value redefinition - Extreme Competition –
Standardization ––Strategy– BusinessModeldesign. 4
References:
1. John.R.Karsnitz, Stephen O’Brien and John P. Hutchinson, “Engineering Design”, Cengage learning
(International edition) second Edition,2013.
2. Roger Martin, "The Design of Business: Why Design Thinking is the Next Competitive Advantage",
Harvard Business Press,2009.
3. Idris Mootee, "Design Thinking for Strategic Innovation: What They Can't Teach You at Business or
Design School", John Wiley & Sons2013
4. George,E,Dieter,Linda,C,Schmidt.(2017).EngineeringDesign,McGrawHillpublisher,4thedition

46
 R-23 B. Tech CSE

Course Name: Engineering Graphics & Design Lab

Course Code: ME(CS)291
Contact: 0:0:3
Credits: 1.5
Prerequisites: Basic knowledge of geometry
Course Outcomes: Upon successful completion of this course, the student will be able to:
CO1: Learn the basics of drafting
CO2: Understand the use of drafting tools which develops the fundamental skills of industrial
drawings.
CO3: Apply the concept of engineering scales, dimensioning and various geometric curves
necessary to understand design of machineelements.
CO4: Analyse the concept of projection of line, surface and solids to create the knowledge base of
orthographic and isometric view of structures and machine parts.
CO5: Evaluate the design model to different sections of industries as well as for research &
development.

Course Contents:
Basic Engineering Graphics: (3P)
Principles of Engineering Graphics; Orthographic Projection; Descriptive Geometry; Drawing
Principles; Isometric Projection; Surface Development; Perspective; Reading a Drawing;
Sectional Views; Dimensioning & Tolerances; True Length, Angle; intersection, Shortest
Distance.
Module 1: Introduction to Engineering Drawing (6P)
Principles of Engineering Graphics and their significance, Usage of Drawing instruments,
lettering, Conic sections including Rectangular Hyperbola (General method only); Cycloid,
Epicycloid and Involute; Scales – Plain, Diagonal and VernierScales.
Module 2: Orthographic & Isometric Projections (6P)
Principles of Orthographic Projections-Conventions - Projections of Points and lines inclined to
both planes; Projections of planes on inclined Planes - Auxiliary Planes; Projection of Solids
inclined to both the Planes- Auxiliary Views; Isometric Scale, Isometric Views of lines, Planes,
Simple and compound Solids; Conversion of Isometric Views to Orthographic Views and Vice-
versa.
Module 3: Sections and Sectional Views of Right Angular Solids (6P)
Drawing sectional views of solids for Prism, Cylinder, Pyramid, Cone and project the true shape
of the sectioned surface, Auxiliary Views; Development of surfaces of Right Regular Solids -
Prism, Pyramid, Cylinder and Cone; Draw sectional orthographic views of objects from industry
and dwellings (foundation to slabonly).
Computer Graphics: (3P)
Engineering Graphics Software; -Spatial Transformations; Orthographic Projections; Model
Viewing; Co-ordinate Systems; Multi-view Projection; Exploded Assembly; Model Viewing;
Animation; Spatial Manipulation; Surface Modeling; Solid Modeling.

47
 R-23 B. Tech CSE

Module 4: Overview of Computer Graphics: (3P)

Demonstration of CAD software [The Menu System, Toolbars (Standard, Properties, Draw,
Modify and Dimension), Drawing Area (Background, Crosshairs, Coordinate System), Dialog
boxesandwindows,Shortcutmenus(ButtonBars),Zoomingmethods,Selectanderaseobjects].
Module 5: CAD Drawing, Customization, Annotations, layering (6P)
Set up of drawing page including scale settings, ISO and ANSI standards for dimensioning and
tolerance; Using various methods to draw straight lines, circles, applying dimensions and
annotations to drawings; Setting up and use of Layers, changing line lengths (extend/lengthen);
Drawing sectional views of solids; Drawing annotation, CAD modeling of parts and assemblies
with animation, Parametric and nonparametric solid, surface and wireframe modeling, Part editing
and printingdocuments.
Module 6: Demonstration of a simple team design project (3P)
Illustrating Geometry and topology of engineered components: creation of engineering models and
their presentation in standard 2D blueprint form and as 3D wire-frame and shaded solids; Meshed
topologies for engineering analysis and tool-path generation for component manufacture, use of
solid-modeling software for creating associative models at the component and assembly levels.
Text Books:
1. Bhatt N.D., Panchal V.M. & Ingle P.R, (2014), Engineering Drawing, Charotar Publishing
House
2. K. Venugopal, Engineering Drawing + AutoCAD, New Age Internationalpublishers
Reference Books:
1. Pradeep Jain, AnkitaMaheswari, A.P. Gautam, Engineering Graphics & Design, Khanna
PublishingHouse
2. Agrawal B. & Agrawal C. M. (2012), Engineering Graphics, TMHPublication.
3. Shah, M.B. & Rana B.C. (2008), Engineering Drawing and Computer Graphics, Pearson
Education
4. Narayana, K.L. & P Kannaiah (2008), Text book on Engineering Drawing, Scitech
Publishers.

CO-PO/PSO Mapping:
COs PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

CO1 2 2 2 2 2

CO2 2 2 2 2 2

CO3 3 2 2 2 2

CO4 3 3 3 3 2

CO5 3 2 3 2 3 3 2

48
 R23 B. Tech CSE

2ND YEAR 3RD SEMISTER

Hours per week

Sl. Broad
Category Course
Category Course Title Credits
No. Code L T P
Total

A. THEORY

Computer Organization
1 ENGG Major CS301 3 0 0 3 3
and Architecture

Design and Analysis of

2 ENGG Major CS302 3 1 0 4 4
Algorithms

3 SCI Minor M(CS)301 Discrete Mathematics 3 0 0 3 3

Digital Logic and

4 ENGG Minor EC(CS)301 3 0 0 3 3
Electronics

A. PRACTICAL

1 ENGG Computer Organization

Major CS391 0 0 3 3 1.5
and Architecture Lab

2 ENGG Design and Analysis of

Major CS392 0 0 3 3 1.5
Algorithms Lab

1.5
3 ENGG Minor EC(CS)391 Digital Electronics Lab 0 0 3 3

Skill
4 IT Workshop Lab
ENGG Enhancem CS393 0 1 3 4 2.5
(SciLab/MATLAB/C++)
ent Course

Total of Theory, Practical 26 20

 R23 B. Tech CSE

Course Name: Computer Organization and Architecture

Course Code:CS301
Contact: 3:0:0
Total Contact Hours: 36L
Credits: 3

Prerequisite: Digital Electronics

Course Outcomes (COs):
After attending the course students should be able to

Illustrate the basic concept of computer architecture and its performance measurement,
parallel processing, Flynn’s classification and Amdahl’s law and apply this knowledge in
CO1
designing solutions for real life engineering problems.
Summarize the basic concept of pipeline, instruction pipeline, arithmetic pipeline hazards
detection and prevention and use this knowledge for designing and implementing
CO2
mathematical and engineering problems leading to lifelong learning.

CO3 Identify the concept of Instruction-Level Parallelism to solve engineering problems.

Illustrate and compare the concept of Multiprocessor architecture and parallel architecture
CO4 and apply this knowledge for developing an approach by means of existing and new
methods as a teamwork.
Understand the concept of message passing architecture and interconnection network and
CO5 design an optimized model for building a new solution as a professional engineering
practice as ateam.

Course Contents:

Module 1[8L]:

IntroductiontoCPUandconceptsofALU[2L],InstructionformatandInstructionCycle[1L],AddressingModes [1L] Fixed-

point multiplication -Booth's algorithm. [2L], Fixed-point division - Restoring and non-restoring algorithms[1L],
Floating-point number representation-IEEE754 format and Floating-point arithmetic operation[1L].

Module 2 [7L]:

Introduction to basic computer architecture [1L], Stored Program Concepts: Von Neumann & Harvard Architecture
[1L], RISC VS CISC [1L],Amdahl law [1L], Performance measurement parameters – MIPS, MFLOPS, SPEC ratings,
CPI etc. [2L] Micro programmed and hardwired control unit [1L].

Module 3[8L]:

Pipelining: Basic concepts, instruction and arithmetic pipeline[2L], data hazards, control hazards and
structuralhazards, techniques for handling hazards[2L]Pipeline vs. Parallelism, Levels of parallelism [1L], Instruction-
Level Parallelism: Basic Concepts, Techniques for Increasing ILP, Superscalar, SuperPipelined and VLIW Processor
Architectures [2L], Array and Vector Processors[1L]

Module 4[9L]:

Introduction to memory-RAM and ROM [1L], Register transfer, memory transfer, Tri-state bus buffer, Memory
Hierarchy: Secondary memory [1L], Main Memory [1L], Cache Memory [1L], Mapping Technique in cache memory:
 R23 B. Tech CSE

Direct, Full Associative and Set Associative [2L], Performance Implementation in Cache Memory [1L], Virtual
memory Concepts [1L], page replacement policies [1L].

Module 5[4L]:

Multiprocessor architecture: taxonomy of parallel architectures; Flynn Classification [1L], Centralized and Shared-
memory architecture: synchronization [1L], Interconnection Network (Omega, Baseline, Butterfly, Crossbar) [2L].

Text Books:

1. Advanced Computer Architecture Parallelism Scalability Programmability,Tata McGraw-Hill Education

Private Limited ISBN-13: 978-0-07-053070-6 ISBN-10:0-07-053070-X
2. Hwang & Briggs—Computer Architecture & Parallel Processing,TMH

Reference Books:

1. PattersonD.A.andHennessy,J.L.―Computerarchitectureaquantitativeapproach‖,2nded.MorganKaufman,1996
2. Hayes J. P., ―Computer Architecture & Organization, McGrawHill
3. Siegel,H.J.,―InterconnectionNetworkforLargeScaleparallelProcessing‖,2ndEd.McGrawHill,1990
4. Design and Analysis of Parallel Algorithm-Schism G. Akl

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11
CO1 3 3 3 2 - - - - - - - -
CO2 3 3 3 3 - - - - - - - 3
CO3 2 2 2 3 - - - - - - - -
CO4 3 3 3 3 - - - - - - - -
CO5 3 3 3 3 - - - - - - - -

CO-PSO Mapping

Cos PSO1 PSO2 PSO3

CO1 3 3 3

CO2 3 3 3

CO3 3 3 3

CO4 3 3 3

CO5 3 3 3
 R23 B. Tech CSE

Course Name: Design & Analysis of Algorithm

Course Code:CS302
Contact: 3:1:0
Total Contact Hours: 36L
Credits: 4

Prerequisites: To know data-structure and basic programming ability

Course Outcomes (COs):

After attending the course students should be able to

To understand and illustrate the concepts of time and space complexity, worst case, average case
CO1
and best-case complexities and the asymptotic notation.
To analyze and apply the design principles and concepts to various basic algorithm design viz.
CO2
dynamic programming, greedy methods etc.

CO3 To understand and analyze various string matching and graph algorithms.

CO4 To understand, illustrate and analyze the different complexity classes

To discuss, implement and analyze, verify the efficiency of the randomized and approximation
CO5
algorithms.

Course Content:

Module-1 [4L]

Algorithm Development & Complexity Analysis: [4L] Stages of algorithm development for solving a problem:
Describing the problem, identifying a suitable technique, Design of an algorithm, Proof of Correctness of the
algorithm. Time and Space Complexity, Different Asymptotic notations – their mathematical significance.Solving
Recurrences: Substitution Method, Recurrence Tree Method, Master Theorem (Statement Only).

Module-2 [14L]

Algorithm Design Techniques Brute force techniques – Traveling Salesman Problem, Divide and Conquer - Matrix
multiplication: Strassenalgorithm, Greedy techniques - Fractional Knapsack problem, Job Sequencing with Deadline,
Graph Coloring, Finding Minimum Cost Spanning Tree, Dynamic programming - O/1 Knapsack problem, Matrix
chain multiplication, Travelling Salesman Problem, Backtracking-N-Queens Problem, Knights Tour on Chess Board.

Module-3 [3L]

String matching problem:Different techniques – Naive algorithm, string matching using finite automata, and Knuth,
Morris, Pratt (KMP) algorithm with their complexities.

Module-4 [5L]

Graph Algorithms Single Source Shortest Path -DijkstraAlgorithm, All pair shortest path – Floyd-Warshall Algorithm.
Network Flows, Maximum Flows – Ford-Fulkerson Algorithm, Push Re-label Algorithm, Minimum Cost Flows –
Cycle Cancelling Algorithm.
 R23 B. Tech CSE

Module-5 [5L]

Complexity Classes:The Class P, The Class NP, Reducibility and NP-completeness – SAT (without proof), 3-SAT,
Vertex Cover, Independent Set, Maximum Clique.

Module-6 [5L]

Approximation and Randomized Algorithms [3L], Approximation Algorithms - The set-covering problem – Vertex
cover, K-center clustering. Randomized Algorithms - The hiring problem, Finding the global Minimum. Recent
Trends[2L]

Textbook:
1. "Introduction to Algorithms" by Cormen,Leiserson, Rivest,Stein.
2. "The Design and Analysis of Computer Algorithms" by Aho, Hopcroft, Ullman. 3. "Algorithm Design" by
Kleinberg andTardos.
3. Design & Analysis of Algorithms, Gajendra Sharma, Khanna Publishing House, New Delhi Reference
Books:
4. ―DesignAnalysis andAlgorithms‖by HariMohanPandey.

CO-POMapping

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

2 2 2 2 - - - - - - - 2
CO1

CO2 3 3 3 3 - - - - - - - 2

CO3 3 3 3 3 - - - - - - - 2

CO4 3 3 3 3 - - - - - - - 2

CO5 3 3 3 3 - - - - - - - 2

CO-PSO Mapping

COs PSO1 PSO2 PSO3

CO1 3 3 3

CO2 3 3 3

CO3 3 3 3

CO4 3 3 3

CO5 3 3 3
 R23 B. Tech CSE

Course Name: Discrete Mathematics

Course Code: M(CS)301
Contact: 3:0:0
Total Contact Hours: 36L
Credits: 3

Prerequisites: Higher Secondary Level Mathematics

Course Outcome(s):
After completion of the course students will be able to

Understand the fundamental concepts of Set Theory to Explain or Illustrate and Identify problems where
CO1
students can Apply the concept appropriately to Solve them.

Understand the fundamental concepts of Mathematical Logic and Proof Techniques so that they can
CO2
Prove theorems using Proof Techniques and Mathematical Logic Frameworks to justify a claim.

Explain or illustrate the fundamental Theory of Numbers and Identify problems where students can Use
CO3
the concept appropriately to Solve them.

Explain or illustrate the fundamental principles of Algebraic Structures and Identify problems where
CO4
students can Apply the concept appropriately to Solve them.

Develop ideas to Propose solutions to the problems of Graph Theory and Identify problems where
students can Apply the concept appropriately and analyze the
CO5 effectiveness as well as limitations of solutions making the students aware of its utilitarian importance
for further explorations leading towards lifelong learning.

CourseContent:

Module -1[16L]

Set Theory [8L]Set: Operations and Properties of set, Finite Set, Power Set, Cardinality of finite set, Cartesian
Product, Relation: Types of Relations, Properties of BinaryRelation, Equivalence Relation, Partial Ordering Relation
and Poset, Lattice.[4L] Combinatorics and Counting: Sum and product rule, Permutation and Combination Principle
of InclusionExclusion. Pigeon Hole Principle.[2L] Generating Functions and Recurrence Relations: Recursively
defined relation and functions, Discrete Numeric Function, Growth of Functions, Problems on Recurrence Relations
and their solutions using differentmethods.[2L]

Module-2[16L]

Mathematical Logic and Proof Techniques [8L] Propositional Logic:Basicsof Boolean Logic, Idea of Propositional
Logic, well-formed formula, Truth tables, Tautology, Satisfiability, Contradiction, Algebra of proposition, Inference
theory of Propositional Logic.[3L] Predicate Logic: Idea of First Order Predicate Logic and Quantifiers, well-formed
formula of predicate, Inference theory of Predicate Logic.[3L] Proof Techniques: Some Terminology, Proof Methods
and Strategies, Forward Proof, Proof by Contradiction, Proof by Contraposition, Proof of Necessity and
Sufficiency.[2L].
 R23 B. Tech CSE

Module-3 [8L]

Theory of Numbers [4L] Well-Ordering Principle, Divisibility theory and properties of Divisibility, Fundamental
theorem of Arithmetic, Prime and Composite Numbers. [2L] Greatest Common Divisor and Euclidean Algorithm,
Congruence, Residue Classes. [2L]

Module-4 [16L]

Algebraic Structures [8L] Concepts of Groups, Subgroups and Order, Cyclic Groups, Cosets, Normal Subgroups,
Permutation and Symmetric groups, Group Homomorphisms.[5L] Elementary properties of Rings and related
problems[1L] Elementary properties of Fields and related problems. [1L] Elementary properties of Vector Space and
related problems. [1L]

Module-5 [16L]

Graph Theory [8L] Graph Terminologies and their properties: Degree, Connectivity, Path, Cycle, Sub-Graph,
Isomorphism, Eulerian and Hamiltonian Walks, Matrix representation of graphs, Shortest Path in Graph. [2L] Graph
Colouring and Matching: Colouring Vertices and Chromatic Number, Colouring Edges and Total Colouring,
Independence and Chromatic Partitioning, Cliques, Perfect Graphs, Bounds on Chromatic Numbers, Chromatic
Polynomials, Matching.[3L] Tree: Rooted Trees,Binary Search Tree and Tree Sorting, Spanning Tree, Weighted Trees
and prefix codes. [3L]

Textbook:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw –Hill.
2. Susanna S. Epp, Discrete Mathematics with Applications,4th edition, Wadsworth Publishing Co.Inc.

Reference Books:
1. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer OrientedApproach, 3rd Edition by,
Tata McGraw –Hill.
2. J.P.TremblayandR.Manohar,DiscreteMathematicalStructureandItsApplicationtoComputerScience‖, TMG
Edition, TataMcGraw-Hill
3. Seymour Lipschutz, Marc Lipson, Discrete Mathematics (Schaum Outlines Series), Tata McGraw -Hill.
 R23 B. Tech CSE

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 2 - - - - - - - - -

CO2 3 3 2 2 - - - - - - - -

CO3 3 3 2 - - - - - - - - -

CO4 3 3 2 - - - - - - - - -

CO5 3 3 2 3 - - - - - - - -

CO-PSO Mapping

COs PSO1 PSO2 PSO3

CO1 2 2 2

CO2 2 2 2

CO3 2 2 2

CO4 2 2 2

CO5 2 2 2
 R23 B. Tech CSE

Course Name: Digital Logic and Electronics

Course Code: EC(CS)301
Contact: 3:0:0
Credit: 3
Total Contact Hours: 36L

Pre-requisite:

Basic concepts of Logic gates, Truth Tables, Concept of basic components of a digital computer.

Course Outcome(s):

CO1: To realize basic gate operations and laws Boolean algebra.

CO2: To understand basic mechanism of digital computers and digital logic behind different arithmetic and
control unit operations.
CO3: To design combinational circuits and combinational functions for larger more complex circuits. CO4: To
perform different operations with sequential circuits.
CO5: To understand fundamental concepts and techniques used in Logic families and PLDs
.

Course Content: –

Module – 1[8L]
Binary Number System [1L]; BCD, ASCII, EBDIC, Gray codes and their conversions [1L], Introduction and laws of
Boolean algebra [1L], Boolean functions, Minterm and maxterm, Prime implicants, Representation in SOP and POS
forms[2L], Minimization of logic expressions by Karnaugh Map and algebraic method [3L]

Module – 2[8L]
Combinational circuits:
Adder and Subtractor (half-full adder &subtractor) [2L], Serial & Parallel Adder, Carry look ahead adder and
Parity Generator[2L], Encoder, Decoder, Multiplexer [2L], Demultiplexer, Comparator, Code Converters [2L]

Module – 3[12L]
Sequential Circuits:
Flip-Flops, SR, JK, Master slave JK, D, T, characteristic Tables, Excitation tables [5L]. Basic concept of Synchronous
and Asynchronous counters, Up/Down Counters, Ring counter, Johnson counter, Design of Modulo-N Counter,
Counter applications [5L]. Registers (SISO, SIPO, PIPO, PISO) [2L].

Module – 4[8L]
A/D and D/A conversion techniques – Basic concepts (D/A:R-2-R only [2L], A/D: successive approximation
[2L])Logic families- TTL, ECL, MOS and CMOS - basic concepts [2L],Programmable logic Array, programmable
Array logic, Sequential Programmable Devices [2L].

Text Book:
1. Saliva Hanan S, Digital Circuits and Design,Oxford
2. MorriesMano- Digital Logic Design-PHI

Reference Book:
1. R.P.Jain—Modern Digital Electronics, 2/e, Mc GrawHill
2. Digital Fundamentals – A Systems Approach – Thomas L. Floyd,Pearson
 R23 B. Tech CSE

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 - - - - - 1 - - 1 -

CO2 3 3 - 2 - - 2 - - 1 - -

CO3 3 3 - - - - - 2 - 2 - 2

CO4 - - 3 3 3 - - - 2 - - -

CO5 3 2 - - - 2 - - 2 2 -
 R23 B. Tech CSE

Course Name: Computer Organization and Architecture Lab

Course Code: CS391
Contact: 0:0:3
Credits: 1.5

Prerequisites:
Knowledge of designing different circuits in Computer Organization Lab

Course Outcomes (COs):

After attending the course students should be able to

Illustrate and use proper syntax in appropriate platforms for developing programs to solve problems related
CO1
to Mathematics and Engineering fields leading to lifelong learning.
Apply the knowledge of algorithms in the computational area to efficient programming codes to design the
CO2
problem using modern tools for solving complex engineering problems.
Outline different types of digital electronic circuits such as adder, subtract or, encoder decoder, multiplexer,
demultiplexer, flip-flops, register, counter using various mapping and modern tools to prepare the most
CO3 simplified circuit and optimize using various mapping and mathematical methods for solving the problem
as a professional engineering practice as a team.
Apply the knowledge of digital electronic circuits to design memory and ALU and analyze the same to
CO4
solve engineering-related computational problems as a team.

Interpret the result of the experiments, prepare laboratory reports based on observed output and analyze it
CO5 to validate professional ethics and responsibilities and norms of theengineering
practice.

List of Experiment:
1. Implement different types of Basic gates and simulate for truth tableverification.
2. Implement half adder circuit and simulate for truth tableverification.
3. Implement full adder circuit and simulate for truth tableverification.
4. Implement half subtractor circuit and simulate for truth tableverification.
5. Implement a full subtractor circuit and simulate for truth tableverification.
6. Implement Multiplexer, De-Multiplexer circuit and simulate for truth tableverification.
7. Implement Encoder, Decoder circuit and simulate for truth table verification.
8. Implement different types of flip flop and simulate for truth tableverification.
9. Implement different types of parallel circuits (SISO, SIPO, PISO, PIPO) and simulate theresult.
10. Implement ALU and simulate theresult.
11. Implement a RAM chip and simulate theresult.
12. InnovativeExperiments.
 R23 B. Tech CSE

CO-PO Mapping

PO1
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11
2

CO1 3 3 3 2 3 - - - 3 - - -

CO2 3 3 3 3 3 - - - 3 - - -

CO3 3 3 3 3 3 - - - 3 - - -

CO4 3 3 3 3 3 - - - 3 - - -

CO5 3 3 3 3 3 - - - 3 - - -

CO-PSO Mapping

COs PSO1 PSO2 PSO3

CO1 3 3 3

CO2 3 3 3

CO3 3 3 3

CO4 3 3 3

CO5 3 3 3
 R23 B. Tech CSE

Course Name: Design & Analysis of Algorithm Lab

Course Code: CS392
Contact: 0:0:3
Credit: 1.5

Prerequisite:
Programming knowledge

Course Outcomes (COs):

After attending the course students should be able to

To identify and prove the correctness and analyze the running time of the basic algorithms forthose classic
CO1
problems in various domains.

To understand and illustrate methods for analyzing the efficiency and correctness of algorithms (such as
CO2
exchange arguments, recurrence, induction, and average case analysis)

To analyze and design algorithms using the dynamic programming, greedy method, Backtracking, Branch
CO3
and Bound strategy, and recite algorithms that employ this strategy.

To understand, compare, contrast, and choose appropriate implementation of the algorithmic design
CO4
techniques to present an algorithm that solves a given problem.

CO5 To Identify and analyze criteria and specifications appropriate to new problems.

Course Content:

A. Implementation of various Divide & Conquer Methods; viz. MatrixMultiplication.

B. Implementations of various Dynamic Programming Methods, viz. Matrix Chain Multiplication Method, Travelling
Salesman Problemetc.
C. Implementations of various Branch & Bound Techniques,viz.
D. Implementations of various Backtracking Methods, viz. n-QueenProblem.
E. Implementations of Greedy Method, viz. Fractional Knapsack Problem, Job Sequencing Problemetc.
F. Implementations of String-matching Algorithm viz. Naïve Algorithm, String Matching with Finite
Automataetc.
G. Implementations of Various Graph Algorithms, viz. Dijkstra ‘s Algorithm, Floyd Algorithmetc.
H. Implementation of some Real-Life TrendyProblems
 R23 B. Tech CSE

CO-PO Mapping

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 2 2 3 - - - 3 - - 3

CO2 3 3 3 2 3 - - - 3 - - 3

CO3 3 3 2 3 3 - - - 3 - - 3

CO4 3 3 2 2 3 - - - 3 - - 3

CO5 3 3 3 2 3 - - - 3 - - 3

CO-PSO Mapping

COs PSO1 PSO2 PSO3

CO1 3 3 3

CO2 3 3 3

CO3 3 3 3

CO4 3 3 3

CO5 3 3 3
 R23 B. Tech CSE

Course Name: Digital Electronics Lab

Course Code: EC(CS)391
Contact: 0:0:3
Credit: 1.5

Prerequisite:
Basic concepts of Logicgates, Truth Tables, function realization –minimization of Logic expressions by K-map,
Concept of basic components of a digital computer, Binary Arithmetic

Course Outcomes (COs):

After attending the course students should be able to

Knowledge of Electronic components such as Resistors, Capacitors, Diodes, Transistors measuring

CO1
equipment like DC power supply, Multimeter, CRO, Signal generator, DC power supply.

Analyze the characteristics of Junction Diode, Zener Diode, BJT & FET and different types of Rectifier
CO2
Circuits.

Determination of input-offset voltage, input bias current and Slew rate, Common- mode Rejection ratio,
CO3
Bandwidth and Off-set null of OPAMPs.

CO4 Able to know the application of Diode, BJT &OPAMP.

CO5 Familiarization and basic knowledge of Integrated Circuits

Course Content:

1. A) Realization of basic gates and universalgates.

B) Realization of basic gates using universal gates.
2. Design a Half adder and Full Adder circuit using basic gates and verify itsoutput.
3. Design a Half subtractor and Full Subtractor circuit using basic gates and verify itsoutput
4. Design an Adder/Subtractor compositeunit.
5. Design of a ‗Carry-Look-AheadAddercircuit.
6. Realization of a)Encoder, b)Decoder c) Multiplexer, d) De-mux, e)Comparator and their Truth Tableverification.
7. Realization of RS / JK / D flip flops using logicgates.
8. Design of Shift Register using J-K / D FlipFlop.
9. Realization of Synchronous Up/Downcounters.
10. Design of MOD- NCounter
11. Study ofDAC
12. Study of logic families andPLDs
 R23 B. Tech CSE

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 3 3 3 - - - - - - -

CO2 3 3 3 3 3 - - - - - - -

CO3 3 3 3 3 3 - - - - - - -

CO4 3 3 3 3 3 - - - - - - -

CO5 3 3 3 3 3 - - - - - - -

CO-PSO Mapping

COs PSO1 PSO2 PSO3

CO1 2 2 2

CO2 2 2 2

CO3 2 2

CO4 2 2 2

CO5 2 2 2
 R23 B. Tech CSE

Course Name: IT Workshop Lab (SciLab/MATLAB/C++)

Course Code: CS393
Contact: 0:1:3
Credits: 2.5

Prerequisite
Computer Fundamentals and principles of computer programming

Course Outcomes (COs):

After attending the course students should be able to

Demonstrate a thorough understanding of modular programming by designing programs that require

CO1 the use of programmer-definedfunctions.

Demonstrate a thorough understanding of arrays by designing and implementing programs that

CO2
search and sortarrays.
Demonstrate a thorough understanding of the object-oriented programming concepts of
encapsulation, data abstraction and composition by designing and implementing classes including the
CO3
use of overloaded functions and constructors.

Demonstrate a thorough understanding of the concept of pointers and dynamic memory allocation the
implementation of programmer-defined functions and classes by writing code, performing unit
CO4
testing and debugging of multiple complexprograms.
Demonstrate an understanding of the differences between C and C++ in the areas of strings, pass by
reference/passing pointers, and structs by designing and implementing programs that use C strings,
CO5
C++

Course Content:

1. Introduction of UNIX/Linux Operating System which includes preliminary commands, start-up & shutdown
methodology,file.
2. Handling as well as introduction to editors like Vi editor, introduction to GNU C & C++ compiler, as well as
introduction to GNU & GDBscript.
3. Introduction to C++, basic loop control, executingprograms.
4. Writing functions, selection statements, review of functions and parameters, command line arguments, recursion,
I/O streams, arrays and string manipulation, pointers, structures &unions.
5. Object-Oriented Programming in C++, fundamentals of classes,constructors-destructors.
6. Dealing with member functions, operator overloading and polymorphism (both static &dynamic).
7. Dealing with inheritance, derived classhandling.
8. Abstract class, virtual class, overriding, template class, name-space & exceptionhandling.
9. Dynamic memory allocation, implementation of Linked Lists, using C++.
10.MATLAB Environment, variable, constant, operators, loop, function.
11.MATLAB Toolbox, MATLAB Graphicfunction.
12. Reading and Writing to file, Numericalsimulation.
13. Innovativeexperiments/Projects
 R23 B. Tech CSE

Text Books

1. The C++ Programming Language by Bjarne Stroustrup Addison-Wesleypublisher

2. Object-Oriented Programming in C++ b by Robert Lafore Publisher:Sams

ReferenceBooks

1. Object Oriented Programming with C++ by Balaguruswamy McGraw Hill Education; Sixth edition Addison-
Wesleypublisher
2. Object-Oriented Programming in C++ b by Robert Lafore Publisher:Sams
3. MATLAB Getting StartedGuidehttps://www.mathworks.com/help/pdf_doc/matlab/getstart.pdf

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 3 2 2 - - - 3 - - -

CO2 3 2 2 2 2 - - - 3 - - -

CO3 3 3 3 2 2 - - - 3 - - -

CO4 3 3 3 2 2 - - - 3 - - -

CO5 3 3 3 2 2 - - - 3 - - -

CO-PSO Mapping

COs PSO1 PSO2 PSO3

CO1 3 3 3

CO2 3 3 3

CO3 3 3 3

CO4 3 3 3

CO5 3 3 3
R23 B. Tech CSE
 R23 B. Tech CSE

2nd Year 4thSemester

Sl Broad Course Hours per week
Category Course Title Credits
No. Category Code L T P Total
A. THEORY

1 ENGG Major CS401 Operating Systems 3 0 0 3 3

2 ENGG Major CS402 Computer Networks 3 0 0 3 3

Formal Language and

3 ENG Major CS403 3 0 0 3 3
Automata Theory
Probability and
4 SCI Minor M(CS)401 3 0 0 3 3
Statistics
Ability
Principles of
5 HUM Enhancement HU(CS)401 2 0 0 2 2
Management
Course
B. PRACTICAL
Operating Systems
1 ENGG Major CS491 0 0 3 3 1.5
Lab
Computer Networks
2 ENGG Major CS492 0 0 3 3 1.5
Lab
Programming using
3 ENGG Major CS493 0 0 3 3 1.5
Python
Numerical Methods
4 ENGG Minor M(CS)491 0 0 3 3 1.5
Lab
Ability
5 HUM Enhancement HU(CS)491 Soft Skill & Aptitude 2 0 0 2 1
Course
Total of Theory,Practical 28 21
 R23 B. Tech CSE

Paper Name: Operating System

Paper Code: CS401
Contact Hours/Week: 3
Credit: 3
Total Contact Hours: 36L

Prerequisites:
1. Computerorganization
2. ComputerArchitecture
3. DataStructures
4. Algorithms & ProgrammingConcept

Course Outcomes (COs):

After attending the course students should be able to

CO1 Understand the fundamental concepts of Operating System, Protection & Security and
differentiate different types of Operating System.

CO2 Understand and implement process & thread; understand, apply, compare different process
synchronization algorithm and inter process communication to solve engineering problems

CO3 Understand/explain/analyze different synchronization techniques, critical section problems

and deadlock and apply them to solve engineering problems.

CO4 Understand/explain different memory management techniques including virtual memory

management; also able to apply, compare, and implement different page replacement
algorithms to solve engineering problems.

CO5 Understand/explain different I/O mechanisms, File structures and disk management
techniques and solving engineering problems applying different disk scheduling
algorithms.

CourseContent:

Module – 1:[3L]
Functionalities of Operating System, Evolution of Operating System.
TypesofOperatingSystem:batch,multi-programmed,time-sharing,real-time,distributed,parallel,Structural overview,
Protection & Security.[3L]

Module – 2: [11L]
Processes: Concept of processes, process states, PCB, process scheduling, co-operating processes,
independentprocess,suspendedprocess,InteractionbetweenprocessesandOS,Inter-processcommunication:
Message passing. [3L]
Threads: overview, benefits of threads, user and kernel level threads, Thread models. [ 2L]
CPU scheduling: Scheduling criteria, preemptive & non-preemptive scheduling, scheduling algorithms
(FCFS, SJF, SRTF, RR, priority, multilevel queue, multilevel feedback queue scheduling). [6L]
 R23 B. Tech CSE

Module – 3: [11L]
Process Synchronization: background, critical section problem, synchronization hardware, classicalproblems
of synchronization (producer-consumer, readers-writer, dining philosophers, etc), semaphores, monitors.[6L]
Deadlocks: deadlock characterization, methods for handling deadlocks, deadlock prevention, deadlock
avoidance, deadlock detection, recovery fromdeadlock.[5L]

Module 4: [6L]
Background, logical vs. physical address space, swapping, contiguous memory allocation, paging,
Segmentation, TLB. [3L]
Virtual Memory: background, demand paging, page replacement algorithms (FCFS, LRU, Optimal),
thrashing, Working set model. [3L]

Module 5: [5L]
Disk structure, disk scheduling (FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK etc), disk reliability, disk
formatting, boot block, bad blocks. [2L]
File: File concept, access methods, directory structure, file system structure, UNIX file structure, allocation
methods (contiguous, linked, indexed), free-space management (bit vector). [2L]
I/O: I/O hardware, polling, interrupts, DMA, caching, buffering, blocking-non blocking I/O. [1L]

Text Book:
1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, Operating SystemConcepts.
2. Operating Systems & Systems Programming by P BalakrishnaPrasad
Reference Book:
1. Dietel H. N., ―An Introduction to Operating Systems‖, AddisonWesley.
2. Andrew Tanenbaum, Modern Operating Systems, Prentice Hall.
3. William Stallings, Operating Systems, PrenticeHall.

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 3 3 3

CO2 3 3 3 3 3

CO3 3 3 3 3 3

CO4 3 3 3 3 3

CO5 3 3 3 3 3
 R23 B. Tech CSE

CO-PSO Mapping

COs PSO1 PSO2 PSO3

CO1 3 3 3

CO2 3 3 3

CO3 3 3 3

CO4 3 3 3

CO5 3 3 3
 R23 B. Tech CSE

Course Name: Computer Networks

Course Code: CS402
Contact: 3:0:0
Total Contact Hours: 36
Credits: 3

Prerequisite:
1. Familiarity and knowledge of Operating Systems and ComputerArchitecture.
2. Also require a little bit of programming languages concepts like C,Java.

Course Outcomes (COs):

After attending the course students should be able to

CO1 Understand basics of computer network and different architecture and topologies of
computer network and analyze the requirements for a given organizational structure and
select the most appropriate networking architecture and technologies.
CO2 Understand/analyze different protocols of the data link layer and apply them to solve
engineering problems.
CO3 Understand/analyze different protocols of Network and Transport Layer and apply them
to solve engineering problems.
CO4 Understand/analyze different protocols of session and application layer and apply them to
solve engineering problems.
CO5 Develop, Analyze, specify and design the topological and routing strategies using socket
programming.
Course Contents:

Module 1: Introduction [6L]

Introduction (3L):
Introduction: Computer Network, data communication, topology, OSI & TCP/IP Reference Models, layers
and characteristics, Wireless Network, comparison to wired and wireless network.
Physical Layer: [3L]
Overview of data (analog & digital), signal (analog & digital), transmission (analog & digital) &
transmission media (guided & unguided); Circuit switching: time division & space division switch, TDM
bus; Telephone Network;

Module 2: Data Link Layer [10L]

Framing, Error Control, Error Detection and Correction, Flow Control, Data Link Protocols, Simple Stop-
and-Wait Protocol, ARQ mechanism, Sliding Window Protocols, One-Bit Sliding Window Protocol, Go-
Back-NandSelectiveRepeat,HDLC,PPPMediumAccessControlSub-layer,TheChannelAllocation.[5L]
Multiple Access Protocols: ALOHA, Carrier Sense Multiple Access Protocols, IEEE 802.x Ethernet,
Switched Ethernet, Fast Ethernet, Gigabit Ethernet, 10 Gigabit Ethernet, Wireless LANs - IEEE 802.xx,
Bluetooth, RFID,Bridges, Virtual LANs, Switching.[5L]

Module 3: Network Layer [10L]

IP Addressing, IPv4and IPv6. Difference IPv4and IPv6, Conversion ofIPv4and IPv6, Subnetting,
Supernetting,DesignIssues,Store-and-ForwardPacketSwitching,Virtual-CircuitandDatagramNetworks,
ARP,IP,ICMP,IPV6,BOOTPandDHCP–DeliveryprotocolsOtherProtocolssuchasmobileIPinwireless
 R23 B. Tech CSE

Network. [5L]
Routing: Shortest Path Algorithms, Flooding, Distance Vector Routing, Link State Routing, Hierarchical
Routing, Broadcast Routing, Multicast Routing, Anycast Routing: RIP, OSPF, BGP; Routing for Mobile
Hosts. [5L]

Module 4: Transport layer: [6L]

Process to Process delivery; UDP; TCP, SCTP, TCP RENO, TCP/IP in Wireless environment, Congestion
controlinTCP:CongestionControl:OpenLoop,ClosedLoopchokepackets;Qualityofservice:techniques to
improve QoS: Leaky bucket algorithm, Token bucket algorithm.[5L]
Advanced topic such as Remote Procedure Call, Delay Tolerant Networks. [ 1L]

Module 5: Application Layer [ 3L]

Introduction to DNS, SMTP, SNMP, FTP, HTTP & WWW: Cryptography (Public, Private Key based),
DigitalSignature, Firewalls

Module 6: Socket Programming [ 1L]

Introduction to Socket Programming, UDP socket and TCP Socket

Text books:
1. B. A.Forouzan –―DataCommunicationsand Networking(3rdEd.)―– TMH
2. S. Tanenbaum –―ComputerNetworks(4th Ed.)‖–Pearson Education/PHI
3. W. Stallings –―DataandComputer Communications (5th Ed.)‖– PHI/PearsonEducation
4. Zheng & Akhtar, Network for Computer Scientists & Engineers,OUP

Reference books:
1.Kuroseand Rose– ―Computer Networking -Atop-downapproach featuring the internet‖–
PearsonEducation
1. Leon,Garica,Widjaja–―Communication Networks‖–TMH
2. Walrand –―Communication Networks‖– TMH.
3. Comer–―InternetworkingwithTCP/IP, vol. 1,2,3(4th Ed.)‖– PearsonEducation/PHI

CO-PO Mapping
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 2 2 2 2 2 3
CO2 3 3 3 3 3 2 2 3
CO3 3 3 3 3 3 2 2 3
CO4 3 3 3 3 3 2 2 3
CO5 2 3 3 3 3 2 2 3
 R23 B. Tech CSE

CO-PSO Mapping
COs PSO1 PSO2 PSO3
3 3 3
CO1
3 3 3
CO2
3 3 3
CO3
3 3 3
CO4
3 3 3
CO5
 R23 B. Tech CSE

Course Name: Formal Language and Automata Theory

Course Code: CS403
Contacts: 3:0:0
Total Contact Hours: 36
Credits: 3

Prerequisites:
1. Digital Logic
2. Computerorganization
3. ComputerFundamentals

Course Outcomes (COs):

After attending the course students should be able to
Understand the fundamental concepts of Finite State Automata to Explain or Illustrate
CO1
andIdentify problems where students can Apply the concept appropriately to Solve them.
Understand the fundamental concepts of Regular Expressions and its relation with DFA so
CO2 thatthey can Develop regular expression for a specified language and Validate it.
Understand the fundamental concepts of Context Free Grammar so that they can Design
CO3 grammafor a specified language and Validate it.
Explain or Illustrate the fundamental operating principles of Push Down Automata
CO4
andUse it appropriately to Solve problems.
Understand the operating principles of Turing Machine and Design Turing Machines to
Proposesolutionstotherelatedproblemsappropriatelyandvalidatetheeffectivenessaswell as
CO5 limitationsof computations making the students aware of its utilitarian importance for
further explorations leading towards lifelonglearning.

Course Contents:
Module-1: [9L]

Fundamentals:Basicdefinitionofsequentialcircuit,blockdiagram,mathematicalrepresentation,conceptof
transition table and transition diagram, [1L]
Introduction to Finite State Model (FSM), Design of sequence detector, Finite State Machine, Finite
Automata, Deterministic Finite Automation (DFA) and Non-deterministic Finite Automation (NFA),
Transition diagrams, Transition tables and Language recognizers. [3L]
NFA with empty transitions, Equivalence between NFA with and without empty transitions. NFA to DFA
conversion. [2L]
Minimization of FSM: Minimization Algorithm for DFA, Introduction to Myhill-NerodeTheorem[2L]
Limitations of FSM, Application of Finite Automata[1L]

Module-2: [7L]
Finite Automata with output − Moore & Mealy machine. Representation of Moore & Mealy Machine,
ProcessingoftheStringthroughMoore&MealyMachine,EquivalenceofMoore&MealyMachine–Inter-
conversion.[2L]
Equivalent states and Distinguishable States, Equivalence and k-equivalence, Minimization of Mealy
Machine[1L]
Minimization of incompletely specified machine−Merger Graph, Merger Table, Compatibility Graph [2L]
Lossless and Lossy Machine – Testing Table, Testing Graph [2L]
 R23 B. Tech CSE

Module-3: [5L]
Regular Languages, Regular Sets, Regular Expressions, Algebraic Rules for Regular Expressions,
Arden‘sTheorem statement and proof[1L]
Constructing Finite Automata (FA) for given regular expressions, Regular string accepted by FA[2L]
Constructing Regular Expression for a given Finite Automata[1L]
Pumping Lemma of Regular Sets. Closure properties of regular sets[1L]

Module-4: [9L]
Grammar Formalism-Context Free Grammars, Derivation trees, sentential forms. Rightmost andleftmost
derivation of strings, Parse Tree, Ambiguity in context free grammars. [1L]
Minimization of Context Free Grammars. [1L], Removal of null and unit production[1L]Chomsky normal
form and Greibach normal form. [1L]
Pumping Lemma for Context Free Languages. [1L]
Enumeration of properties of CFL, Closure property of CFL, Ogden‘s lemma & its applications [1L],
Regular grammars−right linear and left linear grammars[1L]
Pushdown Automata: Pushdown automata, definition. Introduction to DCFL, DPDA, NCFL, NPDA[1L]
Acceptance of CFL, Acceptance by final state and acceptance by empty state and itsequivalence. [1L]
Equivalence of CFL and PDA, inter-conversion. [1L]

Module-5: [5L]
Turing Machine: Turing Machine, definition, model[1L]
Design of TM, Computable functions [1L], Church ‘s hypothesis, counter machine [1L] Types of
Turing machines[1L]
Universal Turing Machine, Halting problem[1L]

Textbook:
1. Introduction to Automata Theory Languages and Computation‖, Hopcroft.E. and Ullman J.D., Pearson
Education.
Reference Books:

1. Formal Languages and Automata Theory‖,C. K. Nagpal,Oxford

2. ―SwitchingandFiniteAutomata Theory‖,ZviKohavi, 2ndEdition, TataMcGrawHill

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3
CO2 2 2 2 2 3
CO3 3 3 3 3 3
CO4 3 3 3 3 3
CO5 3 3 3 3 2 2 3
 R23 B. Tech CSE

CO-PSO Mapping

COs PSO1 PSO2 PSO3

CO1 3 3 3

CO2 3 3 3

CO3 3 3 3

CO4 3 3 3

CO5 3 3 3
 R23 B. Tech CSE

Course Name: Probability and Statistics

Course Code: M(CS)401
Contacts: 3:0:0
Total Contact Hours: 36
Credits: 3

Prerequisite:
The students to whom this course will be offered must have the concept of (10+2) standard algebra
andcalculus.

Course Outcome(s):
After completion of the course students will be able to
CO1: Recall the distinctive principles of probability and statistics.
CO2: Understand the theoretical workings of theory of probability and tests of hypotheses.
CO3: Apply statistical methods to compute and explain point estimators and interval estimators for mean,
variance and proportion.
CO4: Analyze statistical data from engineering experiments.

Course Content
Module 1 (Probability and Random Variables) [15L]
The axioms of probability , Conditional probability, Baye‗s theorem, Discrete and continuous random
variables, probability mass, probability density and cumulative distribution functions, mathematical
expectation, Moments, Moment generating functions, Binomial, Poisson, Geometric, Uniform,
Exponential and Normaldistributions.

Module 2 (Two dimensional random variables) [5L]

Joint distributions, Marginal and conditional distributions, Covariance , Correlation and linear regression ,
Transformation of random variables , Central limit theorem (for independent and identically distributed
randomvariables).

Module 3 (Sampling Distribution) [3L]

Distributions of the sample mean and the sample variance for a normal population, Chi-Square, t and F
distributions, problems

Module 4 (Estimation) [4L]

Unbiasedness, consistency, the method of moments and the method of maximum likelihood estimation,
confidence intervals for parameters in one sample and two sample problems of normal populations,
confidence intervals for proportions, problems.
Module 5 (Testing of Hypotheses) [9L]
Nullandalternativehypotheses,thecriticalandacceptanceregions,twotypesoferror,powerofthetest,the most
powerful test and Neyman-Pearson Fundamental Lemma, tests for one sample and two sample problems
for normal populations, tests for proportions, Chi square goodness of fit test and its applications, problems.
 R23 B. Tech CSE

Project Domains:
1. Construction of Univariate and Bivariate frequencytables
2. Diagrammatic and Graphical representation ofdata.
3. Fitting of discrete and Continuousdistributions
4. RegressionAnalysis
5. CurveFitting
6. Tests of significance with regard to Single Mean, TwoMeans
7. Construction of Confidence intervals for Mean, Variance andProportion

Text and Reference Books:

1. Sheldon M.Ross,―IntroductiontoProbabilityandStatisticsforEngineersandScientists‖,Academic
Press,(2009).
2. D.C.Montgomeryand G.C.Runger, ―AppliedStatisticsandProbabilityforEngineers‖,5th edition, John
Wiley & Sons,(2009)..
3. Robert H.ShumwayandDavid S. Stoffer,―Time SeriesAnalysisand ItsApplicationswith R Examples‖,
Thirdedition, Springer Texts inStatistics, (2006).
4. N. G. Das: Statistical Methods,TMH.
5. Sancheti, D. S. &Kapoor ,V.K. : Statistics Theory , Method & Application, Sultan chand& sons ,
NewDelhi, N.K.Dutta (2004). Fundamentals of Biostatistics, KanishkaPublishers.

CO-PO Mapping:

Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 1 1 - - - - - - - - 1

CO2 3 2 1 - - - - - - - - 2

CO3 3 2 2 - - - - - - - - 1

CO4 3 3 2 3 - - - - - - - 2
 R23 B. Tech CSE

Course Name: Principles of Management

Course Code: HU(CS)401
Contacts: 2:0:0
Total Contact Hours: 24
Credits: 2

Course Outcomes (COs):

After attending the course students should be able to

CO1 Understand the basic concepts and technologies used in the field of management
informatioSystems
CO2 Have the knowledge of the different types of management information systems
CO3 Understand the processes of developing and implementing information systems.
CO4 Be aware of the ethical, social, and security issues of information systems.

CO5 An ability to effectively integrate IT-based solutions into the user environment

Course Content:

Module-1: Management Concepts: Definition, roles, functions and importance of Management, Evolution
ofManagement thought-contribution made by Taylor,Fayol,Gilbreth,EltonMayo,McGregor,Maslow(4L)

Module - 2: Planning and Control: Planning: Nature and importance of planning, -types of planning,
Levelsof planning - The Planning Process. –MBO, SWOT analysis, McKinsey‘s7S Approach.
Organizing for decision making: Nature of organizing, span of control, Organizational structure –line and
staffauthority.
Basic control process -control as a feedback system – Feed Forward Control –Requirements for
effectivecontrol – control (4L)

Module - 3: Group dynamics: Types of groups, characteristics, objectives of Group Dynamics.

Leadership: Definition, styles & functions of leadership, qualities for good leadership, Theories of
leadership(4L)

Module – 4: Work Study and work measurement: Definition of work study, Method Study Steps, Tools
and Techniques used in the Method Study and Work Measurement Time Study: Aim & Objectives, Use of
stopwatch procedure in making Time Study. Performance rating, allowances and its types. Calculation of
Standard Time. Work sampling(4L)

Module - 5: Marketing Management: Functions of Marketing, Product Planning and development,

Promotional Strategy (2L)

Module - 6: Quality management: Quality definition, Statistical quality control, acceptance sampling,
Control Charts –Mean chart, range chart,cchart,pchart,np chart, Zero Defects, Quality circles,, Kaizen &
Six Sigma,ISO -9000 Implementation steps, Total quality management(6L)
 R23 B. Tech CSE

Text Books:
1. Essentials of Management, by Harold Koontz & Heinz Weihrich TataMcGraw
2. Production and Operations Management-K.Aswathapa,K .ShridharaBhat,Himalayan PublishingHouse

References:
1. Organizational Behavior, by Stephen Robbins Pearson Education, NewDelhi
2. New era Management, Daft, 11th Edition, CengageLearning
3. Principles of Marketing, Kotlar Philip and Armstrong Gary, Pearsonpublication

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 3

CO2 3 2 2 2 3

CO3 3 3 2 2 3

CO4 3 2 2 2 3

CO5 3 2 2 2 3

CO-PSO Mapping

COs PSO1 PSO2 PSO3

2 2 2
CO1
2 2 2
CO2
2 2 2
CO3
2 2 2
CO4
2 2 2
CO5
 R23 B. Tech CSE

Course Name: Operating Systems Lab

Course Code: CS491
Allotted Hours: 36L

Prerequisites:
1. Computerorganization
2. ComputerArchitecture
3. DataStructures
4. Algorithms & ProgrammingConcept

Course Outcomes (COs):

After attending the course students should be able to

CO1 Analyze and simulate CPU Scheduling Algorithms like FCFS, Round Robin,
SJF,and Priority.
CO2 Understand the concepts of deadlock in operating systems.

CO3 Implement them in Multiprogramming system.

CO4 Create process creation and implement inter process communication
CO5 Analyze the performance of the various page replacement schemes

Course Content:
1. Essential Linux Commands[9P]: Commands for files and directories cd, cp, mv, rm, mkdir, more,
less, creating and viewing files, using cat, file comparisons, View files, kill, ps, who, sleep, grep,
fgrep, find,sort, cal, banner, touch, file related commands – ws, sat, cut, grep etc. Mathematical
commands –expr, factor, units, Pipes(use functions pipe, popen, pclose), named Pipes (FIFOs,
accessingFIFO)

2. Shell Programming [6P]: Creating a script, making a script executable, shell syntax (variables,
conditions,control structures, functions, andcommands).
3. Process [3P]: Starting new process, replacing a process image, duplicating a processimage.

4. Semaphore [3P]: Programming with semaphores (use functions semget, semop, semaphore_p,
semaphore_v).
5. POSIX Threads[6P]: Programming with pthreadfunctions(viz. pthread_create, pthread_join,
pthread_exit,pthread_attr_init, pthread_cancel).
6. Shared Memory [9P]:Create the shared memory , Attach the shared memory segment to theaddress
spaceofthecallingprocess,Readinformationfromthestandardinputandwritetothesharedmemory,
Readthecontentofthesharedmemoryandwriteontothestandardoutput,Deletethesharedmemory

Books:
1. Yashavant P. Kanetkar, UNIX Shell Programming, 1st edition, BPBPublications
2. Beej's Guide to UnixIPC
3. W. Richard Stevens, UNIX Network Programming, 2nd edition, PrenticeHall
 R23 B. Tech CSE

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3 3
CO2 3 3 3 3 3 3
CO3 3 3 3 3 3 3
CO4 3 3 3 3 3 3
CO5 3 3 3 3 3 3

CO-PSO Mapping

COs PSO1 PSO2 PSO3

3 3 3
CO1
3 3 3
CO2
3 3 3
CO3
3 3 3
CO4
3 3 3
CO5
 R23 B. Tech CSE

Course Name: Computer Networks Lab

Course Code: CS492
Allotted Hours: 36L

Prerequisites:
1. Familiarity and knowledge of Computer Networkand Computer Architecture
2. AlsorequirestrongknowledgeofprogramminglanguageslikeC,JavaandUNIXor Linuxenvironment.

Course Outcomes (COs):

After attending the course students should be able to

To design and implement small size network and to understand various networking
CO1
commands.
CO2 To provide the knowledge of various networking tools and their related concepts.
To understand various application layer protocols for its implementation inclient/server
CO3
environment
CO4 Understand the TCP/IP configuration for Windows and Linux
CO5 Learn the major software and hardware technologies used on computer networks

Course Contents:

1. Familiarization of UNIX or Linux environment, UNIX or Linux general Commands specially Network
Commands. Familiarization of Internetworking - Network Cables - Color coding - Crimping.
InternetworkingOperating Systems - Configurations.[6L]
2. Socket Programming using TCP and UDP[18L]

3. Implementing routing protocols such as RIP, OSPF.[2L]

4. FamiliarizationofadvancedsimulatorslikePacketTracer,NS2/NS3,OMNET++,TinyOS[4L]

5. Server Configuration: only web server (Iftime permit, Instructor can do more than that) [6L]

Textbooks:
1. TCPsocketsinCPrograms-PracticalguideforProgrammersByMicheal,JDonahooandKennethLcalvert.
2.Socket Programming by Raj KumarBuyaa.

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2 3 2
CO2 3 3 3 3 3 2
CO3 3 3 3 3 3 2
CO4 3 3 3 3 3 2
CO5 2 3 2 2 3 2
 R-23 B. Tech CSE

CO-PSO Mapping

COs PSO1 PSO2 PSO3

3 3 3
CO1
3 3 3
CO2
3 3 3
CO3
3 3 3
CO4
3 3 3
CO5
 R-23 B. Tech CSE

Course Name: Programming using Python

Course Code: CS493
Allotted Hours: 36L

Prerequisites:
Knowledge of Mathematics and basic concepts of Programming

Course Outcome(s):
After completion of the course students will be able to
CO1: Understand basic of Python Programming Language
CO2: Understand the use of Conditional statement and Loops
CO3: Learn functions in python and represent collection type data using List and Dictionary
CO4: Read and write data from & to files in Python
CO5: Understand Numpy array and numerical operations on Numpy array.

Course Contents:

1. Basics of Python: Python Installation, python variables, data types andOperator.

2. Loops: While and For loops, Python Syntax, Colon & Indentation, ConditionalStatements: if, elif
andelse.
3. Functions: Defining Functions in python; passingarguments.
4. String: Python Programming to explore stringfunctions
5. Lists: Python programs using Lists; understand the use of List methods, Slicing onList.
6. Sets: Working with Sets; Write programs to show different setoperations.
7. Dictionary: Demonstrate the use ofDictionaries
8. File handling: Reading & Writing data from a file, Redirecting output streams tofiles.
9. Numpy: Numerical operations using Numpy array; slicing numpy array; stacking numpy arrays;
Writeprograms to show different numerical operations on numpyarray;.

CO-PO Mapping:

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 2 - - 2 - - - - - - - 1

CO2 2 3 - 2 - - - - - - - -

CO3 2 3 3 2 - - - - - - - 1

CO4 2 3 2 2 - - - - - - - -

CO5 3 3 3 3 - - - - - - - 2
 R-23 B. Tech CSE

Course Name: Numerical Methods Lab

Course Code: M(CS)491
Allotted Hours: 30L

Prerequisite: Any introductory course on programming language (example. C/ Matlab).

Course Outcomes (COs):

After attending the course students should be able to

CO1 Describe and explain the theoretical workings of numerical techniques with the help of C
CO2 Compute basic command and scripts in a mathematical programming language
CO3 Apply the programming skills to solve the problems using multiple numerical approaches.

CO4 Analyze if the results are reasonable, and then interpret and clearly communicate the
CO5 Apply the distinctive principles of numerical analysis and the associated error measures.

Course Content:

1. Assignments on Newton forward /backward, Lagrange‘sinterpolation.

2. Assignments on numerical integration using Trapezoidal rule, Simpson‘s 1/3 rule, Weddle‘srule.

3. Assignments on numerical solution of a system of linear equations using Gauss

elimination,Tridiagonalmatrix algorithm, Gauss-Seidel iterations. LU Factorizationmethod.

4. Assignments on numerical solution of Algebraic Equation by Bisection method, Regula-

Falsimethod,Secant Method, Newton-Raphson method

5. Assignments on ordinary differential equation: Euler‘s method, Euler‘s modified method, Runge-
Kuttamethods, Taylor series method and Predictor-Correctormethod.

Implementation of numerical methods on computer through C/C++ and commercial Software

Packages:Matlab/Scilab / Labview / Mathematica/NAG (Numerical Algorithms Group) /Python.
 R-23 B. Tech CSE

CO-PO Mapping

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 3 2 3
CO2 3 3 2 2 3 2 3
CO3 3 3 2 2 3 2 3
CO4 3 3 2 2 3 2 3
CO5 3 3 2 2 3 2 3

CO-PSO Mapping

COs PSO1 PSO2 PSO3

CO1 2 2 2

CO2 2 2 2

CO3 2 2 2

CO4 2 2 2

CO5 2 2 2