CSE R20 Syllabus
CSE R20 Syllabus
(AUTONOMOUS)
(Affiliated to JNTUK, Kakinada), (Recognized by AICTE, New Delhi)
Accredited by NAAC with ‘A’ Grade
UG Programmes CE,CSE,ECE,EEE,IT & ME are Accredited by NBA
Chinna Amiram, Bhimavaram-534204. (AP)
Estd:1980
1
Course Code Category L T P C I.M E.M Exam
B20HS1101 HS 3 -- -- 3 30 70 3Hrs
ENGLISH
(Common to AIDS,CE,CSE,ECE,EEE,IT&ME)
Introduction:
The course is designed to train students in receptive as well as productive skills by incorporating a
comprehensive, coherent and integrated approach that improves the learners’ ability to effectively use
English language in academic/ workplace contexts. The shift is from learning about the language to
using the language. On successful completion of the compulsory English language course/s in B.Tech.,
learners would be confident of appearing for international language qualification/proficiency tests such
as GRE, GMAT, IELTS, TOEFL and BEC besides being able to handle the writing tasks and verbal
ability components ofcampusplacementtests.Activitybasedteaching-learningmethodswouldbeadoptedto
ensure that learners would engage in actual use of language both in the classroom and
laboratorysessions.
Course Objectives:
1. To facilitate effective listening skills for better comprehension of varied accents spoken at
national and global levels.
2. To focus on appropriate reading strategies for better comprehension of multiple texts and
authentic materials.
3. To improve speaking skills through participation in activities such as role plays, discussions and
structured talks/oral presentations.
4. To impart effective strategies for good writing and demonstrate the same in both summarizing
and analyzing; writing well-organized essays, letters, e-mails, CV’s and reports.
5. To provide knowledge of grammatical structures and vocabulary and encourage their
appropriate use in speech and writing.
Course Outcomes: At the end of the Course the students will be able to
S.No OutCome KL
1. Identify the context, topic and pieces of specific information by understanding K3
andresponding to the social or transactional dialogues spoken by native speakers of
English.
2. Apply suitable strategies for skimming and scanning to get the main idea of a textand K3
locate specific information.
3. Build confidence and adapt themselves to the social and public discourses,discussions K3
and presentations.
4. Apply the principles of writing to paragraphs, arguments, essaysand formal/informal K3
communication.
5. Construct sentences using proper grammatical structures and correct word forms. K4
SYLLABUS
2
Speaking: Self- introduction and introducing others. Asking and answering general
questions on topics such as home, family, work, studies and interests.
Reading: Skimming text to get the main idea. Scanning to look for specific
pieces of information.
Reading for Writing: Paragraph Writing (Hints Development), general essays
using suitable cohesive devices; linkers, sign posts and transition signals;
mechanics of writing, punctuation.
Vocabulary:Technical vocabulary from across technical branches (20) GRE
Vocabulary (20), antonyms and synonyms, word applications, verbal reasoning
and sequencing of words.
Grammar: Content words and function words; parts of Speech, tenses, word order
in sentences, sentence structures.
3
Grammar: Sentence Structures, Transformation of sentences (Active and
passive Voice, Degrees of comparison, Simple, Compound and Complex).
Text Books:
1 Infotech English, Maruthi Publications.
4
Reference Books:
1. Bailey, Stephen. Academic writing: A Handbook for International Students. Routledge,2014.
2. Chase. Becky Tarver. Pathways: Listening, Speaking and Critical Thinking. Heinley ELT;2nd
Edition, 2018.
3. Skilful Level 2 Reading & Writing Student’s Book Pack (B1). Macmillan Educational.
4. Hewing, Martin. Cambridge Academic English (B2). CUP, 2012.
E-Resources:
Grammar/Listening/Writing
1-language.com
http://www.5minuteenglish.com/
https://www.englishpractice.com/
Grammar/Vocabulary
English Language Learning Online
http://www.bbc.co.uk/learningenglish/
http://www.better-english.com/
http://www.nonstopenglish.com/
https://www.vocabulary.com/
BBC Vocabulary Games
Free Rice Vocabulary Game
Reading
https://www.usingenglish.com/comprehension/
https://www.englishclub.com/reading/short-stories.htm
https://www.english-online.at/
Listening
https://learningenglish.voanews.com/z/3613
http://www.englishmedialab.com/listening.html
Speaking
https://www.talkenglish.com/
BBC Learning English – Pronunciation tips
Merriam-Webster – Perfect pronunciation Exercises
All Skills
https://www.englishclub.com/
http://www.world-english.org/
http://learnenglish.britishcouncil.org/
Online Dictionaries
Cambridge dictionary online
MacMillan dictionary
Oxford learner’s dictionaries
5
Course Code Category L T P C I.M E.M Exam
B20BS1101 BS 3 -- -- 3 30 70 3 Hrs.
MATHEMATICS-I
(LINEAR ALGEBRA AND DIFFERENTIAL EQUATIONS)
(Common to AIDS, CE, CSE, ECE, EEE, IT & ME)
Course Outcomes: At the end of the course the student will be able to
S.No Outcome KL
1. Solve a given system of linear algebraic equations K3
2. Determine Eigen values and Eigen vectors of a system represented by a matrix. K3
3. Solve ordinary differential equations of first order and first degree. K3
4. Applythe knowledge in simple applications such as Newton’s law of cooling,
K3
orthogonal trajectories and simple electrical circuits
5. Solve linear ordinary differential equations of second order and higher order. K3
6. Determine Laplace transform, inverse Laplace transform and solve linear ODE K3
SYLLABUS
Linear systems of equations:
UNIT-I
Rank, Echelon form, Normal form, consistency of system of linear equations, Solution of
(10 Hrs)
linear systems by Gauss elimination, Jacobi and Gauss-Seidel methods.
6
Laplace transformation:
Laplace transforms of standard functions, properties,transforms of tf(t), f(t)/t, transforms of
UNIT-V derivatives and integrals, transforms of unit step function, Dirac delta function; Inverse
(12 Hrs) Laplace transforms, convolution theorem (without proof).
Applications: Solving ordinary differential equations (initial value problems) using Laplace
transforms.
Text Books:
1. B.S.Grewal, Higher Engineering Mathematics, 43rd Edition, Khanna Publishers.
2. B. V. Ramana,Higher Engineering Mathematics, 2007 Edition, Tata Mc. Graw Hill Education.
3. N.P.Bali&Manish Goyal, Engineering Mathematics, Lakshmi Publications.
Reference Books:
1. V. Ravindranath&P. Vijayalakshmi, Mathematical Methods, Himalaya Publishing House.
2. Erwin Kreyszig, Advanced Engineering Mathematics, 10 th Edition, Wiley-India.
3. Michael Greenberg, Advanced Engineering Mathematics, 9 th edition, Pearson.
4. Dean G. Duffy, Advanced engineering mathematics with MATLAB, CRC Press.
5. Peter O’Neil, Advanced Engineering Mathematics, Cengage Learning.
6. Srimanta Pal, Subodh C.Bhunia, Engineering Mathematics, Oxford University Press.
Dass H.K., Rajnish Verma. Er., Higher Engineering Mathematics, S. Chand Co. Pvt. Ltd, New
7.
Delhi.
7
Course Code Category L T P C I.M E.M Exam
B20BS1103 BS 3 -- -- 3 30 70 3Hrs
APPLIED CHEMISTRY
(Common to CSE,ECE &IT)
Course Objectives:
1. To understand the physical and mechanical properties of Polymers/Plastics/elastomers helps in
selecting suitable materials for different purpose.
2. To create awareness on fuels as a source of energy for industries like thermal power stations, steel
industry, fertilizer industry etc.
3. To understand the concept of galvanic cells and corrosion with theories like electro chemical
theory.
4. To understand the importance of water.
5. To understand about the materials which are used in major industries like steel and metallurgical
manufacturing industries, construction and electrical equipment manufacturing industries.
8
LCV – Bomb calorimeter; Coal : Proximate and ultimate analysis of coal – Significance of
the analysis – Manufacture of coke by Otto Hoffman’s by Product Process , Refining crude
oil; Knocking; Chemical structure-Knocking, Octane number of gasoline, Cetane number of
diesel oil, synthetic Petrol; LPG, CNG
Water technology
Sources of water – Hardness of water – Estimation of hardness of water by EDTA method;
UNIT-IV Boiler troubles – sludge and scale formation, Boiler corrosion, caustic embrittlement,
(8Hrs) Priming and foaming; Softening of water by Lime – Soda Process, Zeolite Process, Ion –
Exchange Process; Municipal water treatment; Desalination of sea water by Electrodialysis
and Reverse osmosis methods.
Text Books:
1. Engineering Chemistry by Jain and Jain, Dhanpat Rai Publishing co.
2. Engineering Chemistry by Willy India Pvt Ltd.
3. Engineering Chemistry by Dr.K.Anji Reddy and Dr.M.S.R.Reddy ; Silicon Publications.
Reference Books:
1. Engineering Chemistry by Shikha Aharwal; Cambridge University Press, 2015 edition.
2. A text of Engineering Chemistry by S.S.Dara; S.Chand& Co Ltd.
Chemistry in Engineering and Technology by JC Kuriacose and J. Rajaram Mc. Graw Hill
3.
edition.
9
Course Code Category L T P C I.M E.M Exam
B20CS1101 ES 3 -- -- 3 30 70 3 Hrs.
Course Outcomes:At the end of the course the students will be able to
S.No Outcome KL
1. Apply Precedence and Associativity rules to evaluate Expressions. K3
2. Make use of Decision Making and Looping statements to solve various problems in C K3
3. Illustrate the importance of Arrays and Strings and to apply various operations on them. K2
4. Solve various problems by making use of Structure and Union concepts K3
5. Design and implement programs to analyze the different pointer applications K3
6. Develop programs using Functions and Pointers. K3
SYLLABUS
Introduction to Computers: Creating and running Programs, Computer Numbering System,
Storing Integers, Storing Real Numbers Introduction to the C Language: Background, C
UNIT-I Programs, Identifiers, Types, Variable, Constants, Input/output, Programming Examples,
(10 Hrs) Scope, Storage Classes and Type Qualifiers. Structure of a C Program: Expressions
Precedence and Associativity, Side Effects, Evaluating Expressions, Type Conversion
Statements, Simple Programs, Command Line Arguments.
Bitwise Operators: Exact Size Integer Types, Logical Bitwise Operators, Shift Operators.
Selection & Making Decisions: Logical Data and Operators, Two Way Selection, Multiway
UNIT-II
Selection, More Standard Functions. Repetition: Concept of Loop, Pretest and Post-test
(10 Hrs)
Loops, Initialization and Updating, Event and Counter Controlled Loops, Loops in C, Other
Statements Related to Looping, Looping Applications, Programming Examples.
10
Pointers: Introduction, Pointers to pointers, Compatibility, L value and R value Pointer
UNIT-IV Applications: Arrays, and Pointers, Pointer Arithmetic and Arrays, Memory Allocation
(10 Hrs) Function, Array of Pointers, Programming Application. Processor Commands: Processor
Commands.
Text Books:
1. Programming for Problem Solving, Behrouz A. Forouzan, Richard F.Gilberg, CENGAGE
2. The C Programming Language, Brian W.Kernighan, Dennis M. Ritchie, 2e, Pearson
Reference Books:
1. Computer Fundamentals and Programming, Sumithabha Das, Mc Graw Hill.
2. Programming in C, Ashok N. Kamthane, Amit Kamthane, Pearson.
3. Computer Fundamentals and Programming in C, Pradip Dey, Manas Ghosh, OXFORD.
e-Resources:
1. https://www.geeksforgeeks.org/c-programming-language/
2. https://www.learn-c.org/
3. https://www.w3resource.com/c-programming-exercises/
11
Course Code Category L T P C I.M E.M Exam
B20CS1102 ES 3 -- -- 3 30 70 3 Hrs.
Course Outcomes: At the end of the course the students will be able to
S.No Outcome KL
1. Familiar with computer fundamentals and internet of things concepts. K1
2. Differentiate binary, decimal, octal and hexadecimal number system. K2
3. Implement the Boolean functions using logic gates and Simplification Boolean
K3
expression using K-Map.
4. Implement various combinational circuits. K3
5. Implement various Sequential circuits. K3
SYLLABUS
Computer Fundamentals: Basics of Introduction to Computer: History, Generations,
UNIT-I
Classifications of Computers, The Computer System Hardware: CPU, Memory, Input and
(10 Hrs)
Output Devices: Input Output Unit, Input Devices and Output devices, IO-Ports
Number Theory and BooleanAlgebra: Binary Systems and Boolean Algebra Digital
Systems. Binary Numbers. Number Base Conversions. Octal and Hexadecimal Numbers.
UNIT-II
Complements. Signed Binary Numbers. Binary Logic, Basic Definitions of Boolean
(10 Hrs)
algebra. Axiomatic Definition of Boolean Algebra. Basic Theorems and Properties of
Boolean Algebra, Boolean Functions.
Logic Gates and Gate-Level Minimization Canonical and Standard Forms. Logic
UNIT-III
Gates. The Map Method. Four-Variable Map. Five-Variable Map. Product of Sums
(10 Hrs)
Simplification. Don/t-Care Conditions.
Text Books:
1. Computer Fundamentals by Anitagoel Pearson education 2017
2. Internet of things Architecture and Design Principles Rajkamal public. Mcgraw-hill education
3. Digital design 5th edition by Morris Mano
12
Reference Books:
1. Switching and Finite Automata Theory by Zvi. Kohavi, Tata McGraw Hill.
2. Switching and Logic Design, C.V.S. Rao, Pearson Education
3. Digital Principles and Design – Donald D.Givone, Tata McGraw Hill, Edition.
Fundamentals of Digital Logic & Micro Computer Design , 5TH Edition, M. Rafiquzzaman John
4.
Wiley
13
Course Code Category L T P C I.M E.M Exam
B20CS1103 ES 0 0 3 1.5 15 35 3 Hrs.
LIST OF PROGRAMS
1 Exercise 1:
1. Write a C program to print a block F using hash (#), where the F has a height of six characters
and width of five and four characters.
2. Write a C program to compute the perimeter and area of a rectangle with a height of 7 inches and
width of 5 inches.
3. Write a C program to display multiple variables.
2 Exercise 2:
1. Write a C program to calculate the distance between the two points.
2. Write a C program that accepts 4 integers p, q, r, s from the user where r and s are positive and p
is even. If q is greater than r and s is greater than p and if the sum of r and s is greater than the sum
of p and q print "Correct values", otherwise print "Wrong values".
3 Exercise 3:
1. Write a C program to convert a string to a long integer.
2. Write a program in C which is a Menu-Driven Program to compute the area of the various
geometrical shape.
3. Write a C program to calculate the factorial of a given number.
4 Exercise 4:
1. Write a program in C to display the n terms of even natural number and their sum.
2. Write a program in C to display the n terms of harmonic series and their sum. 1 + 1/2 + 1/3 + 1/4
+ 1/5 ... 1/n terms.
3. Write a C program to check whether a given number is an Armstrong number or not.
5 Exercise 5:
1. Write a program in C to print all unique elements in an array.
2. Write a program in C to separate odd and even integers in separate arrays.
3. Write a program in C to sort elements of array in ascending order.
14
6 Exercise 6:
1. Write a program in C for multiplication of two square Matrices.
2. Write a program in C to find transpose of a given matrix.
7 Exercise 7:
1. Write a program in C to search an element in a row wise and column wise sorted matrix.
2. Write a program in C to print individual characters of string in reverse order.
8 Exercise 8:
1. Write a program in C to compare two strings without using string library functions.
2. Write a program in C to copy one string to another string.
9 Exercise 9:
1. Write a C Program to Store Information Using Structures with Dynamically Memory Allocation
2. Write a program in C to demonstrate how to handle the pointers in the program.
10 Exercise 10:
1. Write a program in C to demonstrate the use of & (address of) and *(value at address) operator.
2. Write a program in C to add two numbers using pointers
11 Exercise 11:
1. Write a program in C to add numbers using call by reference.
2. Write a program in C to find the largest element using Dynamic Memory Allocation
12 Exercise 12:
1. Write a program in C to swap elements using call by reference.
2. Write a program in C to count the number of vowels and consonants in a string using a pointer.
13 Exercise 13:
1. Write a program in C to show how a function returning pointer.
2. Write a C program to find sum of n elements entered by user. To perform this program, allocate
memory dynamically using malloc( ) function
14 Exercise 14:
1. Write a C program to find sum of n elements entered by user. To perform this program, allocate
memory dynamically using calloc( ) function. Understand the difference between the above two
programs
2. Write a program in C to convert decimal number to binary number using the function.
15 Exercise 15:
1. Write a program in C to check whether a number is a prime number or not using the function.
2. Write a program in C to get the largest element of an array using the function.
16. Exercise 16:
1. Write a program in C to append multiple lines at the end of a text file.
2. Write a program in C to copy a file in another name.
3. Write a program in C to remove a file from the disk.
Reference Books:
1. Programming for Problem Solving, Behrouz A. Forouzan, Richard F.Gilberg, CENGAGE
2. The C Programming Language, Brian W.Kernighan, Dennis M. Ritchie, 2e, Pearson
e-Resources:
1. https://www.geeksforgeeks.org/c-programming-language/
2. https://www.learn-c.org/
3. https://www.tutorialspoint.com/cprogramming/index.html
15
Course Code Category L T P C I.M E.M Exam
B20BS1108 BS -- -- 3 1.5 15 35 3Hrs
LIST OF PROGRAMS
Reference Books:
Engineering Chemistry Lab Manual Prepared by Chemistry Faculty of
1.
S.R.K.R.EngineeringCollege.
Laboratory manual on Engineering Chemistry by Dr.Sudha Rani; Dhanpat Rai Publishing
2.
Company.
3. Engineering Chemistry Laboratory manual – I & II by Dr.K.Anji Reddy; Tulip Publications.
16
Course Code Category L T P C I.M E.M Exam
B20CS1104 ES -- -- 3 1.5 15 35 3 Hrs.
Course Objectives: Skills and knowledge provided by this subject are the following:
1. PC Hardware: Identification of basic peripherals, Assembling a PC, Installation of system
software like MS Windows, device drivers, etc. Troubleshooting of PC Hardware and
Software issues.
2. Internet & World Wide Web: Different ways of hooking the PC on to the internet from home
and workplace and effectively usage of the internet, web browsers, email, newsgroups and
discussion forums. Awareness of cyber hygiene (protecting the personal computer from
getting infected with the viruses), worms and other cyber attacks.
3. Productivity Tools: Understanding and practical approach of professional word documents,
excel spread sheets, power point presentations and personal web sites using the Microsoft suite
office tools.
Course Outcomes
S.No Students will be able to KL
1 Identify, assemble and update the components of a computer K3
2 Configure, evaluate and select hardware platforms for the implementation and execution K3
of computer applications, services and systems
3 Make use of tools for converting pdf to word and vice versa K3
4 Develop presentation, documents and small applications using productivity tools such as K3
word processor, presentation tools, spreadsheets, HTML, LaTex
SYLLABUS
Note: Faculty to consolidate the workshop manuals using the textbook and references
List of Exercises:
Identification of the peripherals of a computer - Prepare a report containing the block
Task 1 diagram of the computer along with the configuration of each component and its
functionality. Describe about various I/O Devices and its usage.
Task 2: Practicing disassembling and assembling components of a PC
Task 3: Installation of Device Drivers, MS Windows, Linux Operating systems and Disk
Partitioning, dual boating with Windows and Linux
Introduction to Memory and Storage Devices, I/O Port, Assemblers, Compilers,
Task 4:
Interpreters, Linkers and Loaders.
Task 5: Demonstration of Hardware and Software Troubleshooting
Task 6: Demonstrating Importance of Networking, Transmission Media, Networking Devices-
Gateway, Routers, Hub, Bridge, NIC, Bluetooth Technology, Wireless Technology,
Modem, DSL, and Dialup Connection.
Task 7 Surfing the Web using Web Browsers, Awareness of various threats on the Internet and its
17
solutions, Search engines and usage of various search engines, Need of anti-virus,
Installation of anti-virus, configuring personal firewall and windows update.
(Students should get connected to their Local Area Network and access the Internet. In the
process they should configure the TCP/IP setting and demonstrate how to access the
websites and email. Students customize their web browsers using bookmarks, search
toolbars and pop up blockers)
Productivity Tools:
Basic HTML tags, Introduction to HTML5 and its tags, Introduction to CSS3 and its
properties. Preparation of a simple website/ homepage,
Task 8: Assignment: Develop your home page using HTML Consisting of your photo, name,
address and education details as a table and your skill set as a list.
Features to be covered:- Layouts, Inserting text objects, Editing text objects, Inserting
Tables, Working with menu objects, Inserting pages, Hyper linking, Renaming, deleting,
modifying pages,etc.,
Demonstration and Practice of various features of Microsoft Word Assignment:
1. Create a project certificate.
2.Creating a newsletter
Task 9: Features to be covered:-Formatting Fonts, Paragraphs, Text effects, Spacing,
Borders and Colors, Header and Footer, Date and Time option, tables, Images,
Bullets and Numbering, Table of Content, Newspaper columns, Drawing toolbar
and Word Art and Mail Merge in word etc.,
Demonstration and Practice of various features MicrosoftExcel
Assignment: 1. Creating a scheduler
2.CalculatingGPA
3.Calculating Total, average of marks invarious subjects and ranks of
Task 10:
Students based on marks
Features to be covered:- Format Cells, Summation, auto fill,Formatting
Text, Cell Referencing, Formulae in excel, Charts, Renaming and Inserting
worksheets,etc.,
Demonstration and Practice of various features Microsoft Power Point
Features to be covered:- Slide Layouts, Inserting Text, Word Art, Formatting Text,
Task 11:
Bullets and Numbering, Auto Shapes, Hyperlinks Tables and Charts, Master
Layouts, Types of views, Inserting – Background, textures, Design Templates, etc.,
Demonstration and Practice of various features LaTeX – document preparation,
Task 12:
presentation (Features covered in Task 9 and Task 11 need to be explored in LaTex)
Task 13: Tools for converting word to pdf and pdf to word
Internet of Things (IoT): IoT fundamentals, applications, protocols, communication
Task14: models, architecture, IoT devices.
Text Books:
1 Computer Fundamentals, Anita Goel, Pearson India Education,2017
2 PC Hardware Trouble Shooting Made Easy,TMH
Introduction to Information Technology, ITL Education Solutions Limited,2 nd
3
Edition, Perason, 2020
4 Upgrading and Repairing PCs, 18th Edition, Scott Mueller, QUE, Pearson,2008
18
5 LaTeX Companion – Leslie Lamport,PHI/Pearson
6 Introducing HTML5, Bruce Lawson, Remy Sharp, 2nd Edition, Pearson,2012
7 Teach yourself HTML in 24 hours, ByTechmedia
8 HTML 5 and CSS 3.0 to the Real World by Alexis Goldstein, Sitepointpublication.
Internet of Things, Technologies, Applications, Challenges and Solutions, B K Tripathy, J
9 Anuradha, CRCPress
19
Regulation: R20 I / IV - B.Tech. II - Semester
COMPUTER SCIENCE & ENGINEERING
SCHEME OF INSTRUCTION & EXAMINATION
(With effect from 2020-21 admitted Batch onwards)
Course Catego Int. Ext. Total
Course Name Cr L T P
Code ry Marks Marks Marks
B20 BS
Mathematics-II BS 3 3 0 0 30 70 100
1201
B20 BS
Applied Physics BS 3 3 0 0 30 70 100
1202
B20 BS Mathematical Foundations
ES 3 3 0 0 30 70 100
1204 of Computer Science
B20 CS
Computer Organization ES 3 3 0 0 30 70 100
1202
B20 CS
Data Structures ES 3 3 0 0 30 70 100
1203
B20 BS
Applied Physics Lab BS 1.5 0 0 3 15 35 50
1207
B20 HS Communication Skills
HS 1.5 0 0 3 15 35 50
1202 Lab
B20 CS
Data Structures Lab ES 1.5 0 0 3 15 35 50
1206
B20 MC Professional Ethics and -- -- --
MC 0 2 0 0
1202 Human Values
B20 MC National Service Scheme
MC 0 0 0 2 -- -- --
1203 (NSS)
TOTAL 19.5 17 0 11 195 455 650
20
Course Code Category L T P C I.M E.M Exam
B20BS1201 BS 3 -- -- 3 30 70 3 Hrs.
MATHEMATICS – II
(FOURIER ANALYSIS AND PARTIAL DIFFERENTIAL EQUATIONS)
(Common to AIDS, CE, CSE, ECE, EEE, IT & ME)
Prerequisites:Calculus of functions of a single variable and Geometry
Course Objectives: Students are expected to learn:
1. How to expand an aperiodic function in a Fourier series.
2. How to find Fourier transform for a given function and evaluate some real definite integrals.
3. Application of partial differentiation for determining maxima/ minima of functions.
4. Evaluation of real definite integrals.
5. Formation and solution of linear partial differential equations
6. Solution of one-dimensional wave equation and one-dimensional heat equation by the method of
separation of variables.
Fourier Transforms
UNIT-II Fourier integral theorem (without proof), Complex form of Fourier integral, Fourier sine
(12 Hrs) and cosine integrals, Fourier transform, Fourier sine and cosine transforms, Finite Fourier
transforms, properties, inverse transforms, Parseval’s Identities.
Partial differentiation:
Introduction, Homogeneous functions, Euler’s theorem, Chain rule, Total derivative,
Jacobians and their properties.
UNIT-III
Applications: Taylor series expansion for a function of two variables, Maxima and Minima
(10 Hrs)
of functions of two variables with and without constraints, Lagrange’s method.Leibnitz’s
rules for differentiation under integral sign.
21
First order and higher order partial differential equations:
Formation of partial differential equations by elimination of arbitrary constants and
UNIT-IV
arbitrary functions, solutions of Lagrange linear equation.Solutions of Linear
(10 Hrs)
homogeneous and non-homogeneous partial differential equations with constant
coefficients –source (RHS) terms of the type eax+by, sin (ax+by), cos (ax+by), xmyn.
Text Books:
rd
1. B.S.Grewal, Higher Engineering Mathematics, 43 Edition, Khanna Publishers.
2. N.P.Bali& Manish Goyal, A Text book of Engineering Mathematics, Lakshmi Publications.
3. B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc. Graw Hill Education.
Reference Books:
1. Dean G. Duffy, Advanced engineering mathematics with MATLAB, CRC Press.
2. V.Ravindranath and P. Vijayalakshmi, Mathematical Methods, Himalaya Publishing House.
th
3. Erwin Kreyszig, Advanced Engineering Mathematics, 10 Edition, Wiley-India.
rd
4. David Kincaid, Ward Cheney, Numerical Analysis-Mathematics of Scientific Computing, 3
Edition, Universities Press.
5. Srimanta Pal, Subodh C.Bhunia, Engineering Mathematics, Oxford University Press.
6. Dass H.K., RajnishVerma. Er., Higher Engineering Mathematics, S. Chand Co. Pvt. Ltd,
New Delhi.
22
Course Code Category L T P C I.M E.M Exam
B20BS1202 BS 3 -- -- 3 30 70 3 Hrs.
APPLIED PHYSICS
(Common to CSE, ECE &IT)
Course Objectives:
1. Impart the knowledge in basic concepts of wave optics through the Phenomena of interference
and diffraction, basic concepts and properties of dielectric and magnetic materials and
semiconductors.
2. Familiarize the student with modern technologies like lasers, optical fibers and ultrasonics with
an understanding of the science behind.
3. Impart the elementary concepts of nanomaterials and their significance in different engineering
branches.
Course Outcomes:At the end of the course the student will be able to
S.No Outcome KL
1. Interpret the behavior of light radiation in interference and diffraction Phenomena and K3
their applications.
2. Explain the classification and properties of dielectric and magnetic materials suitable
K3
for engineering applications.
3. Understand the basics of modern optical technologies like lasers and optical fibers K3
and their utility in various fields.
4. Explain the important aspects of semiconductors and electrical conductivity in them. K3
5. Understand the basics of technology of Ultrasonics in various fields and demonstrate K3
the synthesis and applications of nanomaterials.
SYLLABUS
WAVE OPTICS
Interference: Principle of super position. Interference of light, interference in thin films
UNIT-I (reflected light) – Wedge film and Newton`s rings – Applications
(10 Hrs) Diffraction: Types of diffraction, Fraunhoffer diffraction at a single alit, Diffraction
grating, grating spectrum. Missing order, Resolving power, Rayleigh’s Criterion, Resolving
power of Grating
23
LASERS AND FIBER OPTICS
Lasers: Introduction, Interaction of radiation with matter, condition for light amplification,
Einstein’s relations. Requirements of lasers device Types of lasers, Design and working of
Ruby and He – Ne lasers, Laser characteristics and applications.
UNIT-III Fiber Optics: Introduction to optical fibers, Principle of light propagation in fiber,
(10 Hrs) Acceptance angle, Numerical aperture, Modes of propagations, types of fibers,
classification of fibers based on refractive index profile, applications of fibers with
emphasis on fiber optic communication.
SEMICONDUCTORS
Introduction, intrinsic semi conductors, density of charge carries, Fermi energy, Electrical
UNIT-IV conductivity – Extrinsic semi conductors – P-type and N-type, Density of charge carriers,
(9 Hrs) dependence of Fermi energy on carrier concentration and temperature, direct and indirect
band – gap semi conductors, Hall effect, Applications of Hall effect. Drift and diffusion
currents, Continuity equation, applications of semi conductors.
Text Books:
A text Book of Engineering Physics – M.N. Avadhanulu and P.G.Kshirasagar.-S.Chand
1.
Publications 2017
2. Engineering Physics by HK Malik and A.K.Singh. McGrawhill Publishing Company Ltd.
3. Engineering Physics by V.Rajendran. McGrawhill Education (India)Pvt Ltd.
Reference Books:
1. Introduction to Solid State Physics by Charles Kittel , Wiley Publications 2011
2. Semiconductors Devices – Physics and Technology by S.M.Sze , Wiley Publications 2008
3. Text book of Nano Science and Nano technology by TataMcGrawhill 2013.
4. Optical fiber communications by Gerd Keiser, Tata McGraw hill 2008.
e-Resources:
1. http://library.iiti.ac.in/
2. https://onlinecourses.nptel.ac.in/
24
Course Code Category L T P C I.M E.M Exam
B20BS1204 BS 3 -- -- 3 30 70 3 Hrs.
SYLLABUS
Mathematical Logic:
Propositional Calculus: Statements and Notations, Connectives, Well-formed Formulae,
UNIT-I Truth Tables, Tautologies, Equivalence of Formulas, Duality Law, Normal Forms, Theory
(12 Hrs) of Inference for Statement Calculus, Consistency of Premises.
Predicate Calculus: Predicative Logic, Statement Functions, Variables and Quantifiers, Free
and Bound Variables, Inference Theory for Predicate Calculus.
Combinatorics:
Basics of Counting, Permutations, Permutations with Repetitions, Circular Permutations,
UNIT-II Restricted Permutations, Combinations, Restricted Combinations, Generating Functions of
(08 Hrs) Permutations and Combinations, Binomial and Multinomial Theorems, Binomial and
Multinomial Coefficients, Principle of Inclusion–Exclusion.
25
Recurrence Relations:
Generating Functions, Partial Fractions, Calculating Coefficient of Generating Functions,
UNIT-IV
Recurrence Relations, Formulation as Recurrence Relations, Solving Recurrence Relations
(10 Hrs)
by Substitution and Generating Functions, Method of Characteristic Roots, Solving
Inhomogeneous Recurrence Relations
Graph Theory:
Basic Concepts of Graphs, Sub graphs, Isomorphism of Graphs, Paths and Circuits,
UNIT-V Eulerian and Hamiltonian Graphs, Multigraphs, Bipartite graphs, Planar Graphs, Euler’s
(12 Hrs) Formula.
Trees: Definition of Tree, properties of Trees, Different tree structures, Binary trees,
Spanning trees, Minimal Spanning Trees, Kruskal’s and Prim’s Algorithms.
Text Books:
Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay and
1.
P. Manohar, Tata McGraw Hill.
Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A. Kandel, T.P.
2. nd
Baker, 2 Edition, Prentice Hall of India
Reference Books:
Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D.P.
1.
Mahopatra, 3rd Edition, Tata McGraw Hill.
Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K. H. Rosen,
2.
7th Edition, Tata McGraw Hill.
3. Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby, Sharon Cutler Ross, PHI.
4. Discrete Mathematics, S. K. Chakraborthy and B.K. Sarkar, Oxford, 2011.
26
Course Code Category L T P C I.M E.M Exam
B20CS1202 ES 3 -- -- 3 30 70 3 Hrs.
COMPUTER ORGANIZATION
(For CSE )
Course Objectives:
1. Learn basic building blocks of a computer and their organization.
2. Design a basic computer.
SYLLABUS
27
Text Books:
Computer System Architecture, M. Morris Mano, Prentice Hall of India Pvt. Ltd., Third Edition,
1.
Sept.2008.
Reference Books:
Computer Organization and Architecture-Designing for Performance, William Stallings, Pearson,
1.
9th ed.,2013
Essentials of Computer Organization and Architecture, Linda Null, JuliaLobur, Narosa Pub., 3rd
2.
ed.,2003,
Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat ZakyandZvonko Vranesic, 5th
3.
ed., TMH, 2011.
4. Computer System Architecture”, John. P. Hayes.
5. Computer Systems Organization & Architecture, JohnD.Carpinelli, Addison Wesley, 2001.
6. Computer Organization, Design and Architecture, SajjanG.Shiva, 4thed. CRCPress, 2008.
Fundamentals of Computer Organization and Design, Sivarama P. Dandamudi, Springer-
7.
Verlag,2003
Computer Architecture and organization: An Integrated Approach, Miles Murdocca and Vincent
8.
Heuring, Wiley, 2007.
Computer Organization and Architecture: Themes and Variations, Alan Clements, Cengage
9.
Learning, 2014.
28
Course Code Category L T P C I.M E.M Exam
B20CS1203 ES 3 -- -- 3 30 70 3 Hrs.
DATA STRUCTURES
(For CSE )
Course Objectives:
1. Be familiar with basic techniques of algorithm analysis
2. Master the implementation of data structures like stacks, queues, linked lists, binary trees, graphs.
3. Be familiar with basic techniques for algorithm development like recursion.
4. Be familiar with several sub-quadratic sorting algorithms including quick sort, merge sort and
heap sort
5. Master analyzing problems and writing program solutions to problems using the above techniques.
Course Outcomes:
S.No Outcome KL
1. Demonstrate the concept of recursion, the way arrays, records, linked structures, K3
stacks, queues, trees, and graphs are represented in memory.
2. Implement stacks, linked lists, queues and trees and apply them to solve different K3
Computer Science problems and Engineering problems.
3. Compare alternative implementations of data structures with respect to performance. K4
4. Apply the principal algorithms for sorting and searching to the given data and K3
analyze the computational efficiency.
5. Make use of Graphs to solve real life applications. K3
SYLLABUS
Stacks, Queues
Stack Abstract Data Type, Queue Abstract Data Type, Stacks and Queues using arrays,
UNIT-II
Introduction to Evaluation of Expressions, Evaluating Postfix Expressions, Infix to Postfix
(10 Hrs)
and Prefix conversion, Circular Queues using arrays. Pointers, Dynamically Allocated
Storage using pointers, Dynamically Linked Stacks and Queues
Linked Lists:
UNIT-III
Singly Linked Lists: Representation in memory, Algorithms of several operations:
(10 Hrs)
Traversing, Searching, Insertion into, Deletion from linked list, Radix Sort.
29
Circular Linked Lists: Representation in memory, Algorithms of several operations:
Traversing, Searching, Insertion into, Deletion from Circular Linked Lists.
Doubly Linked Lists: Representation in memory, Algorithms of several operations:
Traversing, Searching, Insertion into, Deletion from Doubly Linked Lists.
Polynomials: Representing Polynomials as Singly Linked Lists, Adding Polynomials,
Erasing Polynomials.
Trees: Representation of Trees, Binary Trees Abstract Data Type, Properties of Binary
Trees, Binary Tree Representations, Binary Tree Traversals, Additional Binary Tree
UNIT-IV Operations, Threaded Binary Trees, Heap Abstract Data Type, Insertion into a max heap,
(10 Hrs) Deletion from a max heap, Heap Sort, Introduction to Binary Search Trees, Searching a
Binary Search Tree, Inserting an Element into a Binary Search Tree, Deleting an Element
from a Binary Search Tree, Height of a Binary Search Tree.
Graphs: Graph Abstract Data Type, Definitions, Graph Representations, Elementary Graph
UNIT-V Operations, Depth First Search, Breadth First Search, Connected Components, Spanning
(10 Hrs) Trees, Minimum Cost Spanning Trees, Prim’s and Kruskal’s Algorithms, Shortest Paths
and Transitive Closure, Single Source All Destination - Dijkstra’s Algorithm
Text Books:
Fundamentals of Data Structures in C, 2nd edition, Horowitz, Sahni and Anderson-Freed,
1.
Universities Press, 2008.
Reference Books:
Data Structures using C by Aaron M. Tenenbaum,Y. Langsam and M.J. Augenstein, Pearson
1.
Education, 2009.
2. Data Structures with C by Seymour lipschutz, Schaum Outline series, 2010.
3. Data Structures using C by R. KrishnaMoorthy G. Indirani Kumaravel, TMH, New Delhi,2008.
e-Resources
1. https://nptel.ac.in/courses/106/102/106102064/
2. https://www.tutorialspoint.com/data_structures_algorithms/index.htm
3. https://www.geeksforgeeks.org/data-structures/
30
Course Code Category L T P C I.M E.M Exam
B20BS1207 BS -- -- 3 1.5 15 35 3 Hrs.
LIST OF EXPERIMENTS
1 Determination of the Wavelength of light from a source – Diffraction Grating – Normal incidence.
2 Determination of radius of curvature of Plano convex lens – Newton’s Rings.
3 Determination of the thickness of a thin spacer using interference – Air Wedge method.
Determination of Magnetic field along the axis of a current carrying coil –Stewart and Gee’s
4
apparatus.
5 Verification of Laws of series and parallel combinations of resistances – Carey Foster’s bridge.
6 Determination of Temperature Coefficient of Resistance of a thermistor
7 To study the characteristics of PN Junction diode
8 To determine the Numerical aperture of a given optical fiber and hence to find its acceptance angle.
9 Determination of Planck constant
10 Determination of the Rigidity modulus of elasticity of a material – Torsional pendulum.
11 Verification of the laws of vibrations in stretched stings - Sonometer.
12 Determination of the frequency of the AC supply – AC Sonometer.
13 To determine refractive indices (µo and µe) of a birefringent material (prism).
Reference Books:
1. Advanced Practical Physics Vol 1& 2 SP Singh & M.S Chauhan Pragati Prakashan ,Meerut
31
Course Code Category L T P C I.M E.M Exam
B20HS1202 HS -- -- 3 1.5 15 35 3Hrs
SYLLABUS
A list of communicative expressions
(Requests, Permissions, Asking/ giving directions, Thanking and Responding
UNIT-I to Thanks, Clarifying, Inviting, Congratulating, Advising, Agreeing and
disagreeing etc.,)
Common Errors
Interview Skills
Resume/ Curriculum Vitae
Covering Letter
UNIT-V FAQ's
Telephonic Interviews/ Etiquette
Mock Interviews
32
Text Books:
1. Interact – English Lab Manual for Undergraduate Students – Orient BlackSwan
Reference Books:
1. Exercises in Spoken English Part 1,2,3,4, OUP and CIEFI.
2. English Pronunciation in use- Mark Hancock, CUP.
3. English Pronunciation in use- Mark Hewings, CUP.
4. English Pronunciation Dictionary- Daniel Jones, CUP.
5. English Phonetics for Indian Students- P. BalaSubramanian, Mac MillanPublications
6. Technical Communication- Meenakshi Raman, Sangeeta Sharma, OUP.
7. Technical Communication- Gajendra Singh Chauhan, SmitaKashiramka, cengage
Publications
33
Course Code Category L T P C I.M E.M Exam
B20CS1206 ES 0 0 3 1.5 15 35 3 Hrs.
Course Outcomes:
1. Student will be able to write programs to implement stacks and queues. K3
2. Ability to implement various searching and sorting techniques. K4
3. Ability to implement programs using trees and graphs. K4
LIST OF PROGRAMS
1 Write a program for sorting a list using Bubble sort and then apply binary search.
2 Write a program to implement the operations on stacks.
3 Write a program to implement the operations on circular queues.
4 Write a program for evaluating a given postfix expression using stack.
5 Write a program for converting a given infix expression to postfix form using stack.
Write a program for implement the following using recursion
i) Towers of Hanoi
6
ii) GCD of two numbers
iii) Maximum element in an array
7. Write a program to implement insert, delete, traverse, search operations on singly linked lists
8. Write a program to implement insert, delete, traverse, search operations on circular linked lists
Write a program to implement insert, delete, traverse, search operations on doubly linked lists
9.
Write a program for the representation of polynomials using linked list and for the addition of two
10
such polynomials.
11 Write a program for quick sort .
12 Write a program for Merge sort.
13 Write a program for Heap sort .
Write a program to create a binary search tree and for implementing the in order, preorder, post
14
order traversal using recursion.
15 Write a program for finding the transitive closure of a digraph.
Write a program for finding the shortest path from a given source to any vertex in a digraph using
16
Dijkstra’s algorithm.
a)Write a program for finding the Depth First Search of a graph.
17
b)Write a program for finding the Breadth First Search of a graph
18 Write a program to implement Prims Algorithm.
34
Reference Books:
Fundamentals of Data Structures in C, 2nd edition, Horowitz, Sahani and Anderson-Freed,
1.
Universities Press, 2008.
e-Resources
1 https://nptel.ac.in/courses/106/102/106102064/
2 https://www.tutorialspoint.com/data_structures_algorithms/index.htm
3 https://www.geeksforgeeks.org/data-structures/
35
Course Code Category L T P C I.M E.M Exam
B20MC1202 MC 2 -- -- 0 -- -- --
Course Outcomes:At the end of the course students will be able to: KL
1 Identify and analyze an ethical issue in the subject matter under investigation or K1&K2
in a relevant field. Demonstrate knowledge of ethical values in non-classroom
classroom
activities, such as service learning, internships and field work.
2 Identifythemultipleethicalinterestsatstake
Identifythemultipleethicalinterestsatstakeinareal-worldsituationorpractice
worldsituationorpractice and K1&K2
Articulatewhat makesaparticularcourse
aparticularcourseofactionethicallydefensible.
3 Assess their own ethical values and the social context of problems. K3
4 Identify ethical concerns in research and intellectual contexts, including academic K3
integrity,useandcitationofsources,theobjectivepresentation
citationofsources,theobjectivepresentationofdata,andthetreatment
data,andthetreatment
of humansubjects.
5 Integrate, synthesize, and apply knowledge of ethical dilemmas and resolutions K4
in academic settings, including focused and interdisciplinary research.
SYLLABUS
Human Values:
UNIT-I Morals,ValuesandEthics
Morals,ValuesandEthics-Integrity-WorkEthic-ServicelearningCivicVirtue
ServicelearningCivicVirtue Respect for
(10 Hrs) others Living Peacefully Caring Sharing Honesty -Courage-Cooperation
Cooperation Commitment
Empathy Self Confidence CharacterSpirituality.
Engineering Ethics:
Senses of 'Engineering Ethics
Ethics-Variety of moral issued- Types of inquiry Moral dilemmas
UNIT-II
Moral autonomy
autonomy- Kohlberg's theory- -Consensus and
(10 Hrs)
controversy Models of professional rolesroles-Theories
Theories about right action-Self-interest
action -
Customs and religion Uses of Ethical ttheories
heories Valuing time Cooperation Commitment.
36
Global Issues: Globalization- Cross-culture issues-Environmental Ethics- Computer
UNIT-V Ethics Computers as the instrument of Unethical behavior Computers as the object
(10Hrs) of Unethical acts Autonomous Computers-Computer codes of Ethics- Weapons
Development -Ethics and Research Analyzing Ethical Problems in research.
Text Books:
"Engineering Ethics includes Human Values" by M.Govindarajan, S.Natarajan- and,
1.
V.S.Senthil Kumar-PHI Learning Pvt Ltd-2009.
"Engineering Ethics" by Harris, Pritchard and Rabins, CENGAGE Learning, India Edition,
2.
2009.
"Ethics in Engineering" by Mike W. Martin and Roland Schinzinger-Tata McGraw-Hill-2003.
3.
"Professional Ethics and Morals" by Prof.A.R.Aryasri, DhanikotaSuyodhana-Maruthi
4.
Publications.
"Professional Ethics and Human Values" by A.Alavudeen, R.Kalil Rahman and
5.
M.Jayakumaran-LaxmiPublications.
6. "Professional Ethics and Human Values" by Prof.D.R.Kiran
7. "Indian Culture, Values and Professional Ethics" by PSR Murthy- BS Publication.
8. Professional Ethics by R.Subramaniam - Oxford publications, New Delhi.
37
Code Category L T P C I.M E.M Exam
B20MC1203 MC -- -- 2 -- -- -- --
Course Objectives:
1. To understand the community and understand themselves in relation to their community.
2. Identify the needs and problems of the community and involve them in problem solving process.
3. Utilize their knowledge for finding practical solution to individual and community problems.
SYLLABUS
38