R-20 Syllabus for CSE, JNTUK w. e. f.

2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

COURSE STRUCTURE AND SYLLABUS

For UG –R20

B. TECH - COMPUTER SCIENCE & ENGINEERING

(Applicable for batches admitted from 2020-2021)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA - 533 003, Andhra Pradesh, India

 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

COURSE STRUCTURE
I Year – I SEMESTER

Course
S. No Courses L T P Credits
Code

1 HS Communicative English 3 0 0 3
Mathematics - I
2 BS 3 0 0 3
(Calculus And Differential Equations)
3 BS Applied Physics 3 0 0 3
4 ES Programming for Problem Solving using C 3 0 0 3
5 ES Computer Engineering Workshop 1 0 4 3
6 HS English Communication Skills Laboratory 0 0 3 1.5

7 BS Applied Physics Lab 0 0 3 1.5

8 ES Programming for Problem Solving using C Lab 0 0 3 1.5

Total Credits 19.5

I Year – II SEMESTER

Course
S. No Courses L T P Credits
Code

Mathematics – II
1 BS 3 0 0 3
(Linear Algebra And Numerical Methods)
2 BS Applied Chemistry 3 0 0 3
3 ES Computer Organization 3 0 0 3
4 ES Python Programming 3 0 0 3
5 ES Data Structures 3 0 0 3
6 BS Applied Chemistry Lab 0 0 3 1.5
7 ES Python Programming Lab 0 0 3 1.5
8 ES Data Structures Lab 0 0 3 1.5
9 MC Environment Science 2 0 0 0

Total Credits 19.5

 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
I Year - II Semester
3 0 0 3
MATHEMATICS-II
(Linear Algebra And Numerical Methods)

Course Objectives:
x To instruct the concept of Matrices in solving linear algebraic equations
x To elucidate the different numerical methods to solve nonlinear algebraic equations
x To disseminate the use of different numerical techniques for carrying out numerical integration.
x To equip the students with standard concepts and tools at an intermediate to advanced level
mathematics to develop the confidence and ability among the students to handle various real
world problems and their applications.

Course Outcomes: At the end of the course, the student will be able to
x develop the use of matrix algebra techniques that is needed by engineers for practical
applications (L6)
x solve system of linear algebraic equations using Gauss elimination, Gauss Jordan, Gauss Seidel
(L3)
x evaluate the approximate roots of polynomial and transcendental equations by different
algorithms (L5)
x apply Newton’s forward & backward interpolation and Lagrange’s formulae for equal and
unequal intervals (L3)
x apply numerical integral techniques to different Engineering problems (L3)
x apply different algorithms for approximating the solutions of ordinary differential equations
with initial conditions to its analytical computations (L3)

UNIT – I: Solving systems of linear equations, Eigen values and Eigen vectors: (10hrs)
Rank of a matrix by echelon form and normal form – Solving system of homogeneous and non-
homogeneous linear equations – Gauss Eliminationmethod – Eigenvalues and Eigen vectors and
properties (article-2.14 in text book-1).

Unit – II: Cayley–Hamilton theorem and Quadratic forms: (10hrs)

Cayley-Hamilton theorem (without proof) – Applications – Finding the inverse and power of a matrix
by Cayley-Hamilton theorem – Reduction to Diagonal form – Quadratic forms and nature of the
quadratic forms – Reduction of quadratic form to canonical forms by orthogonal transformation.
Singular values of a matrix, singular value decomposition (text book-3).

UNIT – III: Iterative methods: (8 hrs)

Introduction– Bisection method–Secant method – Method of false position– Iteration method –
Newton-Raphson method (One variable and simultaneous Equations) – Jacobi and Gauss-Seidel
methods for solving system of equations numerically.

UNIT – IV: Interpolation: (10 hrs)

Introduction– Errors in polynomial interpolation – Finite differences– Forward differences– Backward
differences –Central differences – Relations between operators – Newton’s forward and backward
formulae for interpolation – Interpolation with unequal intervals – Lagrange’s interpolation formula–
Newton’s divide difference formula.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT – V: Numerical differentiation and integration, Solution of ordinary differential equations

with initial conditions: (10 hrs)
Numerical differentiation using interpolating polynomial – Trapezoidal rule– Simpson’s 1/3rd and 3/8th
rule– Solution of initial value problems by Taylor’s series– Picard’s method of successive
approximations– Euler’s method –Runge-Kutta method (second and fourth order).

Text Books:
1. B. S. Grewal, Higher Engineering Mathematics, 44th Edition, Khanna Publishers.
2. B. V. Ramana,Higher Engineering Mathematics, 2007 Edition, Tata Mc. Graw Hill Education.
3. David Poole, Linear Algebra- A modern introduction, 4th Edition, Cengage.

Reference Books:
1. Steven C. Chapra, Applied Numerical Methods with MATLAB for Engineering and
Science,Tata Mc. Graw Hill Education.
2. M. K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and Engineering
Computation, New Age International Publications.
3. Lawrence Turyn,Advanced Engineering Mathematics, CRC Press.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
I Year - II Semester
3 0 0 3
APPLIED CHEMISTRY

Course Objectives
x Importance of usage of plastics in household appliances and composites (FRP) in aerospace and
automotive industries.
x Outline the basics for the construction of electrochemical cells, batteries and fuel cells.
Understand the mechanism of corrosion and how it can be prevented.
x Explain the preparation of semiconductors and nanomaterials, engineering applications of
nanomaterials, superconductors and liquid crystals.
x Recall the increase in demand for power and hence alternative sources of power are studied due
to depleting sources of fossil fuels. Advanced instrumental techniques are introduced.
x Outline the basics of computational chemistry and molecular switches

UNIT I: POLYMER TECHNOLOGY 8 hrs

Polymerisation:- Introduction, methods of polymerization (emulsion and suspension), mechanical
properties.
Plastics: Compounding, fabrication (compression, injection, blown film and extrusion), preparation,
properties and applications (PVC, polycarbonates and Bakelite), mention some examples of plastic
materials used in electronic gadgets, recycling of e-plastic waste (waste to wealth).
Elastomers:- Introduction, preparation, properties and applications (Buna S, thiokol and polyurethanes).
Composite materials: Fiber reinforced plastics, conducting polymers, biodegradable polymers,
biopolymers, biomedical polymers.
Course Outcomes: At the end of this unit, the students will be able to
x Analyze the different types of composite plastic materials and interpret the mechanism of
conduction in conducting polymers.

UNIT II: ELECTROCHEMICAL CELLS AND CORROSION 10 hrs

Single electrode potential, electrochemical series and uses of series, standard hydrogen electrode,
calomel electrode, construction of glass electrode, batteries (Dry cell, Li ion battery and zinc air cells),
fuel cells (H2-O2, CH3OH-O2, phosphoric acid and molten carbonate).
Corrosion:-Definition, theories of corrosion (chemical and electrochemical), galvanic corrosion,
differential aeration corrosion, stress corrosion, galvanic series, factors influencing rate of corrosion,
corrosion control (proper designing and cathodic protection), Protective coatings (surface preparation,
cathodic coatings, anodic coatings, electroplating and electroless plating [nickel]), Paints (constituents,
functions and special paints).

Course Outcomes: At the end of this unit, the students will be able to
x Utilize the theory of construction of electrodes, batteries and fuel cells in redesigning new
engineering products and categorize the reasons for corrosion and study methods to control
corrosion.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT III: MATERIAL CHEMISTRY 10 hrs

Part I : Non-elemental semiconducting materials:- Stoichiometric, controlled valency & chalcogen
photo/semiconductors-preparation of semiconductors (distillation, zone refining, Czochralski crystal
pulling, epitaxy, diffusion, ion implantation) - Semiconductor devices (p-n junction diode as rectifier,
junction transistor).
Insulators & magnetic materials: electrical insulators-ferro and ferri magnetism-Hall effect and its
applications.
Part II: Nano materials:- Introduction, sol-gel method, characterization by (Brunauer Emmet Teller
[BET]), (scanning electron microscopy [SEM]) and (transmission electron microscopy [TEM]),
applications of graphene and fullerenes, carbon nanotubes (types, preparation and applications)
Liquid crystals:- Introduction-types-applications.
Super conductors:-Type –I, Type II-characteristics and applications
Course Outcomes: At the end of this unit, the students will be able to
x Synthesize nanomaterials for modern advances of engineering technology.
x Summarize the preparation of semiconductors; analyze the applications of liquid crystals and
superconductors.

UNIT IV: SPECTROSCOPIC TECHNIQUES & NON-CONVENTIONAL ENERGY SOURCES

10 hrs
Part A: SPECTROSCOPIC TECHNIQUES
Electromagnetic spectrum-UV (laws of absorption, instrumentation, theory of electronic spectroscopy,
Frank-condon principle, chromophores and auxochromes, intensity shifts, applications), FT-IR
[instrumentation and differentiation of sp, sp2, sp3 and IR stretching of functional groups (alcohols,
carbonyls, amines) applications], magnetic resonance imaging and CT scan (procedure & applications).
Part B: NON-CONVENTIONAL ENERGY SOURCES
Design, working, schematic diagram, advantages and disadvantages of photovoltaic cell, hydropower,
geothermal power, tidal and wave power, ocean thermal energy conversion.
Course Outcomes: At the end of this unit, the students will be able to
x Analyze the principles of different analytical instruments and their applications.
x Design models for energy by different natural sources.

UNIT V: ADVANCED CONCEPTS/TOPICS IN CHEMISTRY 8 hrs

Computational chemistry: Introduction to computational chemistry, molecular modelling and docking
studies
Molecular switches: characteristics of molecular motors and machines, Rotaxanes and Catenanes as
artificial molecular machines, prototypes – linear motions in rotaxanes, an acid-base controlled
molecular shuttle, a molecular elevator, an autonomous light-powered molecular motor

Course Outcomes: At the end of this unit, the students will be able to
x Obtain the knowledge of computational chemistry and molecular machines

Text Books:
1. P.C. Jain and M. Jain “Engineering Chemistry”, 15/e, Dhanpat Rai & Sons, Delhi, (Latest
edition).
2. Shikha Agarwal, “Engineering Chemistry”, Cambridge University Press, New Delhi, (2019).
3. S.S. Dara, “A Textbook of Engineering Chemistry”, S.Chand & Co, (2010).
4. Shashi Chawla, “Engineering Chemistry”, Dhanpat Rai Publicating Co. (Latest edition).
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Reference Books:
1. K. Sesha Maheshwaramma and Mridula Chugh, “Engineering Chemistry”, Pearson India Edn.
2. O.G. Palana, “Engineering Chemistry”, Tata McGraw Hill Education Private Limited, (2009).
3. CNR Rao and JM Honig (Eds) “Preparation and characterization of materials” Academic press,
New York (latest edition)
4. B. S. Murthy, P. Shankar and others, “Textbook of Nanoscience and Nanotechnology”, University
press (latest edition)
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
I Year - II Semester
3 0 0 3
COMPUTER ORGANIZATION

Course Objectives:
The purpose of the course is to introduce principles of computer organization and the basic
architectural concepts. It provides an in depth understanding of basic organization, design,
programming of a simple digital computer, computer arithmetic, instruction set design,
microprogrammed control unit, pipelining and vector processing, memory organization and
I/O systems.

Course Outcomes:
By the end of the course the student will be able to
x Demonstrate and understanding of the design of the functional units of a digital
computer system.
x Relate Postulates of Boolean algebra and minimize combinational functions
x Recognize and manipulate representations of numbers stored in digital computers
x Build the logic families and realization of logic gates.
x Design and analyze combinational and sequential circuits
x Recall the internal organization of computers, CPU, memory unit and Input/Outputs
and the relations between its main components
x Solve elementary problems by assembly language programming

UNIT I:
Digital Computers and Data Representation: Introduction ,Numbering Systems, Decimal
to Binary Conversion, Binary Coded Decimal Numbers, Weighted Codes, Self-
Complementing Codes, Cyclic Codes, Error Detecting Codes, Error Correcting Codes,
Hamming Code for Error Correction, Alphanumeric Codes, ASCI Code
Data Representation: Data types, Complements, Fixed Point Representation, Floating Point
Representation.
Boolean Algebra and Logical gates:
Boolean Algebra :Theorems and properties, Boolean functions, canonical and standard forms
, minimization of Boolean functions using algebraic identities; Karnaugh map representation
and minimization using two and three variable Maps ;Logical gates ,universal gates and
Two-level realizations using gates : AND-OR, OR-AND, NAND-NAND and NOR-NOR
structures

UNIT II:
Digital logic circuits: Combinatorial Circuits: Introduction, Combinatorial Circuit Design
Procedure, Implementation using universal gates, Multi-bit adder, Multiplexers, De-
multiplexers, Decoders
Sequential Switching Circuits: Latches and Flip-Flops, Ripple counters using T flip-flops;
Synchronous counters: Shift Registers; Ring counters
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT III:
Computer Arithmetic: Addition and subtraction, multiplication Algorithms,
Booth multiplication algorithm, Division Algorithms, Floating – point Arithmetic
operations.
Register Transfer language and microinstructions :Bus memory transfer,
arithmetic and logical micro-operations, shift and rotate micro-operations
Basic Computer Organization and Design: Stored program concept, computer
Registers, common bus system, Computer instructions, Timing and Control,
Instruction cycle, Memory Reference Instructions, Input–Output configuration and
program Interrupt.

UNIT IV:
Microprogrammed Control: Control memory, Address sequencing,
microprogram example, design of control unit.
Central Processing Unit: General Register Organization, Instruction Formats,
Addressing modes, Data Transfer and Manipulation, Program Control: conditional
Flags and Branching

UNIT V:
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary memory,
Associate Memory, Cache Memory.
Input-Output Organization: Input-Output Interface, Asynchronous data transfer,
Modes of Transfer, Priority Interrupt Direct memory Access.

Text Books:
1. Digital Logic and Computer Design,Moriss Mano,11thEdition,PearsonEducation.
2. Computer System Architecture,3rded., M.MorrisMano, PHI

Reference Books:
1. Digital Logic and Computer Organization, Rajaraman,Radhakrishnan,PHI,2006
2. Computer Organization, 5thed.,Hamacher, VranesicandZaky,TMH,2002
3. Computer Organization & Architecture :Designing for Performance, 7 thed.,
William Stallings, PHI, 2006
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
I Year – II Semester
3 0 0 3
PYTHON PROGRAMMING

Course Objectives:
The Objectives of Python Programming are
x To learn about Python programming language syntax, semantics, and the runtime
environment
x To be familiarized with universal computer programming concepts like data types,
containers
x To be familiarized with general computer programming concepts like conditional
execution, loops & functions
x To be familiarized with general coding techniques and object-oriented programming

Course Outcomes:
x Develop essential programming skills in computer programming concepts like data
types, containers
x Apply the basics of programming in the Python language
x Solve coding tasks related conditional execution, loops
x Solve coding tasks related to the fundamental notions and techniques used in object-
oriented programming

UNIT I
Introduction: Introduction to Python, Program Development Cycle, Input, Processing, and
Output, Displaying Output with the Print Function, Comments, Variables, Reading Input
from the Keyboard, Performing Calculations, Operators. Type conversions, Expressions,
More about Data Output.
Data Types, and Expression: Strings Assignment, and Comment, Numeric Data Types and
Character Sets, Using functions and Modules.
Decision Structures and Boolean Logic: if, if-else, if-elif-else Statements, Nested Decision
Structures, Comparing Strings, Logical Operators, Boolean Variables. Repetition Structures:
Introduction, while loop, for loop, Calculating a Running Total, Input Validation Loops,
Nested Loops.

UNIT II
Control Statement: Definite iteration for Loop Formatting Text for output, Selection if and if
else Statement Conditional Iteration The While Loop
Strings and Text Files: Accessing Character and Substring in Strings, Data Encryption,
Strings and Number Systems, String Methods Text Files.

UNIT III
List and Dictionaries: Lists, Defining Simple Functions, Dictionaries
Design with Function: Functions as Abstraction Mechanisms, Problem Solving with Top
Down Design, Design with Recursive Functions, Case Study Gathering Information from a
File System, Managing a Program’s Namespace, Higher Order Function.
Modules: Modules, Standard Modules, Packages.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT IV
File Operations: Reading config files in python, Writing log files in python, Understanding
read functions, read(), readline() and readlines(), Understanding write functions, write() and
writelines(), Manipulating file pointer using seek, Programming using file operations
Object Oriented Programming: Concept of class, object and instances, Constructor, class
attributes and destructors, Real time use of class in live projects, Inheritance , overlapping
and overloading operators, Adding and retrieving dynamic attributes of classes, Programming
using Oops support
Design with Classes: Objects and Classes, Data modeling Examples, Case Study An ATM,
Structuring Classes with Inheritance and Polymorphism

UNIT V
Errors and Exceptions: Syntax Errors, Exceptions, Handling Exceptions, Raising Exceptions,
User-defined Exceptions, Defining Clean-up Actions, Redefined Clean-up Actions.
Graphical User Interfaces: The Behavior of Terminal Based Programs and GUI -Based,
Programs, Coding Simple GUI-Based Programs, Other Useful GUI Resources.
Programming: Introduction to Programming Concepts with Scratch.

Text Books
1) Fundamentals of Python First Programs, Kenneth. A. Lambert, Cengage.
2) Python Programming: A Modern Approach, Vamsi Kurama, Pearson.

Reference Books:
1) Introduction to Python Programming, Gowrishankar.S, Veena A, CRC Press.
2) Introduction to Programming Using Python, Y. Daniel Liang, Pearson.
e-Resources:
https://www.tutorialspoint.com/python3/python_tutorial.pdf
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
I Year – II Semester
3 0 0 3
DATA STRUCTURES

Course Objectives:
The objective of the course is to
x Introduce the fundamental concept of data structures and abstract data types
x Emphasize the importance of data structures in developing and implementing efficient
algorithms
x Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are
represented in memory and used by algorithms
Course Outcomes:
After completing this course a student will be able to:
x Summarize the properties, interfaces, and behaviors of basic abstract data types
x Discuss the computational efficiency of the principal algorithms for sorting &
searching
x Use arrays, records, linked structures, stacks, queues, trees, and Graphs in writing
programs
x Demonstrate different methods for traversing trees

UNIT I
Data Structures - Definition, Classification of Data Structures, Operations on Data Structures,
Abstract Data Type (ADT), Preliminaries of algorithms. Time and Space complexity.
Searching - Linear search, Binary search, Fibonacci search.
Sorting- Insertion sort, Selection sort, Exchange (Bubble sort, quick sort), distribution (radix
sort), merging (Merge sort) algorithms.

UNIT II
Linked List: Introduction, Single linked list, Representation of Linked list in memory,
Operations on Single Linked list-Insertion, Deletion, Search and Traversal ,Reversing Single
Linked list, Applications on Single Linked list- Polynomial Expression Representation
,Addition and Multiplication, Sparse Matrix Representation using Linked List, Advantages
and Disadvantages of Single Linked list, Double Linked list-Insertion, Deletion, Circular
Linked list-Insertion, Deletion.

UNIT III
Queues: Introduction to Queues, Representation of Queues-using Arrays and using Linked
list, Implementation of Queues-using Arrays and using Linked list, Application of Queues-
Circular Queues, Deques, Priority Queues, Multiple Queues.
Stacks: Introduction to Stacks, Array Representation of Stacks, Operations on Stacks, Linked
list Representation of Stacks, Operations on Linked Stack, Applications-Reversing list,
Factorial Calculation, Infix to Postfix Conversion, Evaluating Postfix Expressions.

UNIT IV
Trees: Basic Terminology in Trees, Binary Trees-Properties, Representation of Binary Trees
using Arrays and Linked lists. Binary Search Trees- Basic Concepts, BST Operations:
Insertion, Deletion, Tree Traversals, Applications-Expression Trees, Heap Sort, Balanced
Binary Trees- AVL Trees, Insertion, Deletion and Rotations.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT V
Graphs: Basic Concepts, Representations of Graphs-Adjacency Matrix and using Linked list,
Graph Traversals (BFT & DFT), Applications- Minimum Spanning Tree Using Prims &
Kruskals Algorithm, Dijkstra’s shortest path, Transitive closure, Warshall’s Algorithm.

Text Books:
1) Data Structures Using C. 2nd Edition.Reema Thareja, Oxford.
2) Data Structures and algorithm analysis in C, 2nded, Mark Allen Weiss.

Reference Books:
1) Fundamentals of Data Structures in C, 2nd Edition, Horowitz, Sahni, Universities
Press.
2) Data Structures: A PseudoCode Approach, 2/e, Richard F.Gilberg, Behrouz A.
Forouzon, Cengage.
3) Data Structures with C, Seymour Lipschutz TMH

e-Resources:
1) http://algs4.cs.princeton.edu/home/
2) https://faculty.washington.edu/jstraub/dsa/Master_2_7a.pdf
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
I Year - II Semester
0 0 3 1.5
APPLIED CHEMISTRY LAB

Introduction to Chemistry laboratory – Molarity, normality, primary, secondary standard

solutions, volumetric titrations, quantitative analysis

1. Determination of HCl using standard Na2CO3 solution.

2. Determination of alkalinity of a sample containing Na2CO3 and NaOH.
3. Determination of Mn+2 using standard oxalic acid solution.
4. Determination of ferrous iron using standard K2Cr2O7 solution.
5. Determination of Cu+2 using standard hypo solution.
6. Determination of temporary and permanent hardness of water using standard EDTA
solution.
7. Determination of Fe+3 by a colorimetric method.
8. Determination of the concentration of acetic acid using sodium hydroxide (pH-metry
method).
9. Determination of iso-electric point of amino acids using pH-metry
method/conductometric method.
10. Determination of the concentration of strong acid vs strong base (by conductometric
method).
11. Determination of strong acid vs strong base (by potentiometric method).
12. Determination of Mg+2 present in an antacid.
13. Determination of CaCO3 present in an egg shell.
14. Estimation of Vitamin C.
15. Determination of phosphoric content in soft drinks.
16. Adsorption of acetic acid by charcoal.
17. Preparation of nylon-6, 6 and Bakelite (demonstration only).

Of the above experiments at-least 10 assessment experiments should be completed in a

semester.

Outcomes: The students entering into the professional course have practically very little
exposure to lab classes. The experiments introduce volumetric analysis; redox titrations with
different indicators; EDTA titrations; then they are exposed to a few instrumental methods of
chemical analysis. Thus at the end of the lab course, the student is exposed to different
methods of chemical analysis and use of some commonly employed instruments. They thus
acquire some experimental skills.

Reference Books
1. A Textbook of Quantitative Analysis, Arthur J. Vogel.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
I Year - II Semester
0 0 3 1.5
PYTHON PROGRAMMING LAB

Course Objectives:
The Objectives of Python Programming are
x To learn about Python programming language syntax, semantics, and the runtime
environment
x To be familiarized with universal computer programming concepts like data types,
containers
x To be familiarized with general computer programming concepts like conditional
execution, loops & functions
x To be familiarized with general coding techniques and object-oriented programming

Course Outcomes:
x Develop essential programming skills in computer programming concepts like data
types, containers
x Apply the basics of programming in the Python language
x Solve coding tasks related conditional execution, loops
x Solve coding tasks related to the fundamental notions and techniques used in object-
oriented programming

List of Experiments:
1) Write a program that asks the user for a weight in kilograms and converts it to
pounds. There are 2.2 pounds in a kilogram.
2) Write a program that asks the user to enter three numbers (use three separate input
statements). Create variables called total and average that hold the sum and average of
the three numbers and print out the values of total and average.
3) Write a program that uses a for loop to print the numbers 8, 11, 14, 17, 20, . . . , 83,
86, 89.
4) Write a program that asks the user for their name and how many times to print it. The
program should print out the user’s name the specified number of times.
5) Use a for loop to print a triangle like the one below. Allow the user to specify how
high the triangle should be.
*
**
***
****
6) Generate a random number between 1 and 10. Ask the user to guess the number and
print a message based on whether they get it right or not.
7) Write a program that asks the user for two numbers and prints Close if the numbers
are within .001 of each other and Not close otherwise.
8) Write a program that asks the user to enter a word and prints out whether that word
contains any vowels.
9) Write a program that asks the user to enter two strings of the same length. The
program should then check to see if the strings are of the same length. If they are not,
the program should print an appropriate message and exit. If they are of the same
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

length, the program should alternate the characters of the two strings. For example, if
the user enters abcde and ABCDE the program should print out AaBbCcDdEe.
10) Write a program that asks the user for a large integer and inserts commas into it
according to the standard American convention for commas in large numbers. For
instance, if the user enters 1000000, the output should be 1,000,000.
11) In algebraic expressions, the symbol for multiplication is often left out, as in 3x+4y or
3(x+5). Computers prefer those expressions to include the multiplication symbol, like
3*x+4*y or 3*(x+5). Write a program that asks the user for an algebraic expression
and then inserts multiplication symbols where appropriate.
12) Write a program that generates a list of 20 random numbers between 1 and 100.
(a) Print the list.
(b) Print the average of the elements in the list.
(c) Print the largest and smallest values in the list.
(d) Print the second largest and second smallest entries in the list
(e) Print how many even numbers are in the list.
13) Write a program that asks the user for an integer and creates a list that consists of the
factors of that integer.
14) Write a program that generates 100 random integers that are either 0 or 1. Then find
the longest run of zeros, the largest number of zeros in a row. For instance, the longest
run of zeros in [1,0,1,1,0,0,0,0,1,0,0] is 4.
15) Write a program that removes any repeated items from a list so that each item appears
at most once. For instance, the list [1,1,2,3,4,3,0,0] would become [1,2,3,4,0].
16) Write a program that asks the user to enter a length in feet. The program should then
give the user the option to convert from feet into inches, yards, miles, millimeters,
centimeters, meters, or kilometers. Say if the user enters a 1, then the program
converts to inches, if they enter a 2, then the program converts to yards, etc. While
this can be done with if statements,it is much shorter with lists and it is also easier to
add new conversions if you use lists.
17) Write a function called sum_digits that is given an integer num and returns the sum of
the digits of num.
18) Write a function called first_diff that is given two strings and returns the first location
in which the strings differ. If the strings are identical, it should return -1.
19) Write a function called number_of_factors that takes an integer and returns how many
factors the number has.
20) Write a function called is_sorted that is given a list and returns True if the list is
sorted and False otherwise.
21) Write a function called root that is given a number x and an integer n and returns x1/n.
In the function definition, set the default value of n to 2.
22) Write a function called primes that is given a number n and returns a list of the first n
primes. Let the default value of n be 100.
23) Write a function called merge that takes two already sorted lists of possibly different
lengths, and merges them into a single sorted list.
(a) Do this using the sort method. (b) Do this without using the sort method.
24) Write a program that asks the user for a word and finds all the smaller words that can
be made from the letters of that word. The number of occurrences of a letter in a
smaller word can’t exceed the number of occurrences of the letter in the user’s word.
25) Write a program that reads a file consisting of email addresses, each on its own line.
Your program should print out a string consisting of those email addresses separated
by semicolons.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

26) Write a program that reads a list of temperatures from a file called temps.txt, converts
those temperatures to Fahrenheit, and writes the results to a file called ftemps.txt.
27) Write a class called Product. The class should have fields called name, amount, and
price, holding the product’s name, the number of items of that product in stock, and
the regular price of the product. There should be a method get_price that receives the
number of items to be bought and returns a the cost of buying that many items, where
the regular price is charged for orders of less than 10 items, a 10% discount is applied
for orders of between 10 and 99 items, and a 20% discount is applied for orders of
100 or more items. There should also be a method called make_purchase that receives
the number of items to be bought and decreases amount by that much.
28) Write a class called Time whose only field is a time in seconds. It should have a
method called convert_to_minutes that returns a string of minutes and seconds
formatted as in the following example: if seconds is 230, the method should return
'5:50'. It should also have a method called convert_to_hours that returns a string of
hours, minutes, and seconds formatted analogously to the previous method.
29) Write a class called Converter. The user will pass a length and a unit when declaring
an object from the class—for example, c = Converter(9,'inches'). The possible units
are inches, feet, yards, miles, kilometers, meters, centimeters, and millimeters. For
each of these units there should be a method that returns the length converted into
those units. For example, using the Converter object created above, the user could call
c.feet() and should get 0.75 as the result.
30) Write a Python class to implement pow(x, n).
31) Write a Python class to reverse a string word by word.
32) Write a program that opens a file dialog that allows you to select a text file. The
program then displays the contents of the file in a textbox.
33) Write a program to demonstrate Try/except/else.
34) Write a program to demonstrate try/finally and with/as.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
I Year – II Semester
0 0 3 1.5
DATA STRUCTURES LAB

Course Objectives:
The objective of this lab is to
x Demonstrate the different data structures implementation.
Course Outcomes:
By the end of this lab the student is able to
x Use basic data structures such as arrays and linked list.
x Programs to demonstrate fundamental algorithmic problems including Tree
Traversals, Graph traversals, and shortest paths.
x Use various searching and sorting algorithms.
List of Experiments:

Exercise -1 (Searching)
a)Write C program that use both recursive and non recursive functions to perform Linear
search for a Key value in a given list.
b) Write C program that use both recursive and non recursive functions to perform Binary
search for a Key value in a given list.

Exercise -2 (Sorting-I)
a) Write C program that implement Bubble sort, to sort a given list of integers in ascending
order
b) Write C program that implement Quick sort, to sort a given list of integers in ascending
order
c) Write C program that implement Insertion sort, to sort a given list of integers in ascending
order

Exercise -3(Sorting-II)
a) Write C program that implement radix sort, to sort a given list of integers in ascending
order
b) Write C program that implement merge sort, to sort a given list of integers in ascending
order

Exercise -4(Singly Linked List)

a) Write a C program that uses functions to create a singly linked list
b) Write a C program that uses functions to perform insertion operation on a singly linked list
c) Write a C program that uses functions to perform deletion operation on a singly linked list
d) Write a C program to reverse elements of a single linked list.

Exercise -5(Queue)
a) Write C program that implement Queue (its operations) using arrays.
b) Write C program that implement Queue (its operations) using linked lists
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Exercise -6(Stack)
a) Write C program that implement stack (its operations) using arrays
b) Write C program that implement stack (its operations) using Linked list
c) Write a C program that uses Stack operations to evaluate postfix expression

Exercise -7(Binary Tree)

d) Write a recursive C program for traversing a binary tree in preorder, inorder and postorder.

Exercise -8(Binary Search Tree)

a) Write a C program to Create a BST
b) Write a C program to insert a node into a BST.
c) Write a C program to delete a node from a BST.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

L T P C
I Year – II Semester
2 0 0 0
ENVIRONMENT SCIENCE

Course Objectives:
The objectives of the course are to impart:
x Overall understanding of the natural resources.
x Basic understanding of the ecosystem and its diversity.
x Acquaintance on various environmental challenges induced due to unplanned
anthropogenic activities.
x An understanding of the environmental impact of developmental activities.
x Awareness on the social issues, environmental legislation and global treaties.

UNIT I
Multidisciplinary nature of Environmental Studies: Definition, Scope and Importance –
Sustainability: Stockholm and Rio Summit–Global Environmental Challenges: Global
warming and climate change, acid rains, ozone layer depletion, population growth and
explosion, effects. Role of information technology in environment and human health.
Ecosystems: Concept of an ecosystem. - Structure and function of an ecosystem; Producers,
consumers and decomposers. - Energy flow in the ecosystem - Ecological succession. - Food
chains, food webs and ecological pyramids; Introduction, types, characteristic features,
structure and function of Forest ecosystem, Grassland ecosystem, Desert ecosystem, Aquatic
ecosystems.

UNIT II
Natural Resources: Natural resources and associated problems.
Forest resources: Use and over – exploitation, deforestation – Timber extraction – Mining,
dams and other effects on forest and tribal people.
Water resources: Use and over utilization of surface and ground water – Floods, drought,
conflicts over water, dams – benefits and problems.
Mineral resources: Use and exploitation, environmental effects of extracting and using
mineral resources.
Food resources: World food problems, changes caused by non-agriculture activities-effects of
modern agriculture, fertilizer-pesticide problems, water logging, salinity.
Energy resources: Growing energy needs, renewable and non-renewable energy sources use
of alternate energy sources.
Land resources: Land as a resource, land degradation, Wasteland reclamation, man induced
landslides, soil erosion and desertification; Role of an individual in conservation of natural
resources; Equitable use of resources for sustainable lifestyles.

UNIT III
Biodiversity and its conservation: Definition: genetic, species and ecosystem diversity-
classification - Value of biodiversity: consumptive use, productive use, social-Biodiversity at
national and local levels. India as a mega-diversity nation - Hot-sports of biodiversity -
Threats to biodiversity: habitat loss, man-wildlife conflicts. - Endangered and endemic
species of India – Conservation of biodiversity: conservation of biodiversity.
 R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIT IV
Environmental Pollution: Definition, Cause, effects and control measures of Air pollution,
Water pollution, Soil pollution, Noise pollution, Nuclear hazards. Role of an individual in
prevention of pollution. - Pollution case studies, Sustainable Life Studies. Impact of Fire
Crackers on Men and his well being.
Solid Waste Management: Sources, Classification, effects and control measures of urban and
industrial solid wastes. Consumerism and waste products, Biomedical, Hazardous and e –
waste management.

UNIT V
Social Issues and the Environment: Urban problems related to energy -Water conservation,
rain water harvesting-Resettlement and rehabilitation of people; its problems and concerns.
Environmental ethics: Issues and possible solutions. Environmental Protection Act -Air
(Prevention and Control of Pollution) Act. –Water (Prevention and control of Pollution) Act -
Wildlife Protection Act -Forest Conservation Act-Issues involved in enforcement of
environmental legislation. -Public awareness.
Environmental Management: Impact Assessment and its significance various stages of EIA,
preparation of EMP and EIS, Environmental audit. Ecotourism, Green Campus – Green
business and Green politics.
The student should Visit an Industry / Ecosystem and submit a report individually on any
issues related to Environmental Studies course and make a power point presentation.

Text Books:
1) Environmental Studies, K. V. S. G. Murali Krishna, VGS Publishers, Vijayawada
2) Environmental Studies, R. Rajagopalan, 2nd Edition, 2011, Oxford University Press.
3) Environmental Studies, P. N. Palanisamy, P. Manikandan, A. Geetha, and K. Manjula
Rani; Pearson Education, Chennai

Reference Books:
1) Text Book of Environmental Studies, Deeshita Dave & P. Udaya Bhaskar, Cengage
Learning.
2) A Textbook of Environmental Studies, Shaashi Chawla, TMH, New Delhi
3) Environmental Studies, Benny Joseph, Tata McGraw Hill Co, New Delhi
4) Perspectives in Environment Studies, Anubha Kaushik, C P Kaushik, New Age
International Publishers, 2014