B.

Tech - CSE
R18

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY: PUTTUR

(AUTONOMOUS)
Department of Computer Science and Engineering

INDUCTION PROGRAM
3 WEEKS DURATION
(MANDATORY)
 Physical activity
Induction program for students to  Creative Arts
 Universal Human Values
be offered right at the start of the  Literary
first year.  Proficiency Modules
 Lectures by Eminent People
 Visits to local Areas
 Familiarization to Dept./Branch & Innovations

I B. Tech. – I Semester (CSE)

Course
S.No. Subject L T P/Drg C
Code
1 18HS0830 Mathematics-1 3 - - 3
2 18HS0801 Chemistry 3 1 - 4
3 18ME0302 Engineering Graphics & Design 1 - 4 3
4 18HS0810 English 3 - - 3
5 18HS0802 Chemistry Lab - - 3 1.5
6 18HS0811 English Lab - - 3 1.5
7 18ME0301 Workshop Practices Lab - - 4 2
Induction Program ( 3 weeks ) - - - -
10 01 14
Contact Periods / Week 18
Total/Week 25

I B. Tech. – II Semester (CSE)

S.No.Course Code Subject L T P C
1. 18HS0831 Mathematics-II 3 1 - 4
2. 18HS0851 Semi-Conductor Physics 3 1 - 4
3. 18CS0501 Programming for Problem Solving 3 - - 3
4. 18CS0502 Digital Logic Design 3 - - 3
5. 18EE0239 Basic Electrical Engineering 3 - - 3
6. 18CS0503 Programming for Problem Solving Lab - - 3 1.5
7. 18HS0852 Physics Lab - - 3 1.5
Non- Credit Course
8. 18HS0817 Essence of Indian Traditional Knowledge 3 - - -
18 02 06
Contact Periods / Week 20
Total/Week 26

Page 1 of 121
 B.Tech - CSE
R18

II B. Tech. – I Semester (CSE)

Course
S.No.. Subject L T P C
Code
1 18HS0835 Probability & Statistics 3 1 - 4
2 18EC0443 Analog Electronics Circuits 3 - - 3
3 18CS0504 Data Structures & Algorithms 3 - - 3
4 18CS0505 Computer Organization & Architecture 3 - - 3
5 18CS0506 Database Management Systems 3 - - 3
6 18CS0507 Data Structures & Algorithms Lab - - 3 1.5
7 18CS0508 Database Management Systems Lab - - 3 1.5
8 18EE0241 Basic Electrical & Electronics Engineering Lab - - 2 1
Non- Credit Course
9 18HS0816 Indian Constitution 3 0 0 0
18 01 08
Contact Periods / Week Total/Week 20
27

II B. Tech. – II Semester (CSE)

S. No. Course Code Subject L T P C

1 18HS0836 Discrete Mathematics 3 - - 3
2 18CS0509 Formal Languages and Automata Theory 3 1 - 4
3 18CS0510 Operating Systems 3 - - 3
4 18HS0803 Biology for Engineers 3 - - 3
5 18CS0511 Object Oriented Programming 3 - - 3
6 18CS0512 Operating Systems Lab - - 3 1.5
7 18CS0513 Object Oriented Programming Lab - - 3 1.5
Credit Course
8 COE-1 Comprehensive Online Examination – I - - - 1
Non- Credit Course
9 18HS0804 Environmental Sciences 3 - - 0
18 01 06
Contact Periods / Week 20
Total/Week 25

Page 2 of 121
 B.Tech - CSE
R18

III B. Tech. – I Semester (CSE)

S.No. Course Code Subject L T P C
1 18HS0812 Managerial Economics and Financial Analysis 3 - - 3
2 18CS0514 Compiler Design 3 - - 3
3 18CS0515 Computer Networks 3 1 - 4
4 18CS0516 Design and Analysis of Algorithms 3 - - 3
5 18CS0517 Python Programming 3 - - 3
6 18CS0518 Analysis of Algorithms Lab - - 3 1.5
7 18CS0519 Python Programming Lab - - 2 1
8 18CS0520 Object Oriented Analysis and Design Lab - - 3 1.5
Non- Credit Course
9 18HS0842 Aptitude Practices 3 - - 0
18 01 08
Contact Periods / Week 20
Total/Week 27

III B. Tech. – II Semester (CSE)

S. No. Course Code Subject L T P C
1 18CS0521 Data Warehousing and Data Mining 3 - - 3
2 18CS0522 Software Engineering 3 - - 3
3 18CS0523 Web Technologies 3 - - 3
Professional Elective Course (PEC)- I
18CS0531 Advanced Operating Systems
4 3 - - 3
18CS0532 Linux Programming
18CS0533 Quantum Computing
Open Elective-I
18CE0127 Elements of Road Traffic Safety
18EE0234 Industrial Instrumentation
5 3 - - 3
18ME0307 Non-Conventional Energy Resources
18EC0449 Introduction to IOT
18HS0814 Intellectual Property Rights
6 18CS0524 Data Mining Lab - - 2 1
7 18CS0525 Web Technologies Lab - - 2 1
8 18CS0526 Internship (60 Hours) - - - 2
Credit Course
9 COE-II Comprehensive Online Examination-II - - - 1
Non- Credit Course
10 18HS0859 English for Corporate Communication Skills Lab - - 2 -
15 - 06
Contact Periods / Week Total/Weeks 20
21

Page 3 of 121
 B.Tech - CSE
R18

IV B. Tech. – I Semester (CSE)

S.No. Course Code Subject L T P C

1 18HS0813 Management Science 3 - - 3
Professional Elective Course (PEC) –II
18CS0534 Artificial Intelligence & Machine Learning
2
18CS0535 Cloud Computing 3 - - 3
18CS0536 Information Retrieval System
Professional Elective Course (PEC) –III
18CS0537 Big Data Analytics
3
18CS0538 Human Computer Interaction 3 - - 3
18CS0539 Information Security
Professional Elective Course (PEC) –IV
18CS0540 E-Commerce
4
18CS0541 Mobile Application Development 3 - - 3
18CS0542 Soft Computing
Open Elective-II
18CE0122 Construction Project Management
18EE0236 Electrical Energy Conservation and Auditing
5
18ME0337 Mechatronics & Robotics 3 - - 3
18EC0450 MATLAB Programming
18HS0815 Entrepreneurship Development
6 18CS0527 Virtual Lab-1 - - 3 1.5
7 18CS0528 Virtual Lab-2 - - 3 1.5
8 18CS0529 Project Phase-I - - 4 2
15 - 10
Contact Periods / Week 20
Total/Week 25

Page 4 of 121
 B.Tech - CSE
R18

IV B. Tech. – II Semester (CSE)

Course
S. No. Subject L T P C
Code
Professional Elective Course (PEC) –V
18CS0543 Ad hoc Wireless Networks
1
18CS0544 Data Sciences 3 - - 3
18CS0545 Software Project Management
Professional Elective Course (PEC) –VI
18CS0546 Cyber Security
2
18CS0547 Deep Learning 3 - - 3
18CS0548 Real Time Systems
3 MOOC-I 3 - - 3
4 MOOC-II 3 - - 3
5 18CS0530 Project Phase-II - - 16 8
12 - 16
Contact Periods / Week Total/Week 20
28

*L-Lecture hours, T-Tutorial, P-Practical, C-Credit

Total Number of Credits=158

Page 5 of 121
 B.Tech - CSE
R18

Department of Computer Science and Engineering

List of Subjects
S.No. Course Code Subject
Core Subjects
1 18CS0501 Programming for Problem Solving
2 18CS0502 Digital Logic Design
3 18CS0503 Programming for Problem Solving Lab
4 18CS0504 Data Structures & Algorithms
5 18CS0505 Computer Organization & Architecture
6 18CS0506 Database Management System
7 18CS0507 Data Structures & Algorithms Lab
8 18CS0508 Database Management Systems Lab
9 18CS0509 Formal Languages and Automata Theory
10 18CS0510 Operating Systems
11 18CS0511 Object Oriented Programming
12 18CS0512 Operating Systems Lab
13 18CS0513 Object Oriented Programming Lab
14 18CS0514 Compiler Design
15 18CS0515 Computer Networks
16 18CS0516 Design and Analysis of Algorithms
17 18CS0517 Python Programming
18 18CS0518 Analysis of Algorithms Lab
19 18CS0519 Python Programming Lab
20 18CS0520 Object Oriented Analysis and Design Lab
21 18CS0521 Data Warehousing and Data Mining
22 18CS0522 Software Engineering
23 18CS0523 Web Technologies
24 18CS0524 Data Mining Lab
25 18CS0525 Web Technologies Lab
26 18CS0526 Internship
27 18CS0527 Virtual Lab-1
28 18CS0528 Virtual Lab-2
29 18CS0529 Project Phase-I
30 18CS0530 Project Phase-II
Professional Elective Courses
31 18CS0531 Advanced Operating Systems
32 18CS0532 Linux Programming
33 18CS0533 Quantum Computing
34 18CS0534 Artificial Intelligence and Machine Learning
35 18CS0535 Cloud Computing
36 18CS0536 Information Retrieval System
37 18CS0537 Big Data Analytics

Page 6 of 121
 B.Tech - CSE
R18

38 18CS0538 Human Computer Interaction

39 18CS0539 Information Security
40 18CS0540 E-Commerce
41 18CS0541 Mobile Application Development
42 18CS0542 Soft Computing
43 18CS0543 Ad hoc Wireless Networks
44 18CS0544 Data Sciences
45 18CS0545 Software Project Management
46 18CS0546 Cyber Security
47 18CS0547 Deep Learning
48 18CS0548 Real Time Systems
Subjects for other Departments
49 18CS0501 Programming for Problem Solving
50 18CS0503 Programming for Problem Solving Lab
Open Electives from CSE Department
51 18CS0517 Python Programming
52 18CS0534 Artificial Intelligence & Machine Learning
Open Electives from Other Departments
53 18CE0127 Elements of Road Traffic Safety
54 18EE0234 Industrial Instrumentation
55 18ME0307 Non-Conventional Energy Resources
56 18EC0449 Introduction to IOT
57 18HS0814 Intellectual Property Rights
58 18CE0122 Construction Project Management
59 18EE0236 Electrical Energy Conservation and Auditing
60 18ME0337 Mechatronics & Robotics
61 18EC0450 MATLAB Programming
62 18HS0815 Entrepreneurship Development
Subjects from Other Departments
63 18HS0830 Mathematics-1
64 18HS0801 Chemistry
65 18ME0302 Engineering Graphics & Design
66 18HS0810 English
67 18HS0802 Chemistry Lab
68 18HS0811 English Lab
69 18ME0301 Workshop Practices Lab
70 18HS0831 Mathematics-II
71 18HS0851 Semi-Conductor Physics
72 18EE0239 Basic Electrical Engineering
73 18HS0852 Physics Lab
74 18HS0835 Probability & Statistics
75 18EC0443 Analog Electronics Circuits

Page 7 of 121
 B.Tech - CSE
R18

76 18EE0241 Basic Electrical & Electronics Engineering Lab

77 18HS0836 Discrete Mathematics
78 18HS0803 Biology for Engineers
79 18HS0812 Managerial Economics and Financial Analysis
80 18HS0813 Management Science
Non-Credit Courses
81 18HS0817 Essence of Indian Traditional Knowledge
82 18HS0816 Indian Constitution
83 18HS0804 Environmental Sciences
84 18HS0842 Aptitude Practices
85 18HS0859 English for Corporate Communication Skills Lab

Page 8 of 121
 B.Tech - CSE
R18

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
I B. Tech – I Sem. L T P C

3 - - 3
(18HS0830) MATHEMATICS-I
(Common to all branches)

Course Objectives:

The objective of this course is to familiarize the prospective engineers with techniques in
calculus, multivariate analysis and linear algebra. 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. More precisely, the objectives are:

 To introduce the idea of applying differential and integral calculus to notions of

curvature and to improper integrals. Apart from some applications it gives a basic
introduction on Beta and Gamma functions.
 To introduce the fallouts of Rolle‟s Theorem that is fundamental to application of
analysis to Engineering problems.
 To develop the tool of power series and Fourier series for learning advanced
Engineering Mathematics.
 To familiarize the student with functions of several variables that is essential in most
branches of engineering.
 To develop the essential tool of matrices and linear algebra in a comprehensive
manner.

Course Outcomes:

The objective of this course is to familiarize the prospective engineers with

techniques in calculus, multivariate analysis and linear algebra. 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.

UNIT – I
Matrices: Inverse and rank of a matrix; System of linear equations; Symmetric,skew-
symmetric and orthogonal matrices; Eigen values and eigen vectors; Diagonalization of
matrices; Cayley-Hamilton Theorem, and Orthogonal transformation

Page 9 of 121
 B.Tech - CSE
R18

UNIT – II
Calculus: Evaluation of definite and improper integrals; Applications of definite integrals
to evaluate surface areas and volumes of revolutions; Beta and Gamma functions and their
properties. Rolle‟sTheorem, Mean value theorems (without proof) Taylor‟s and
Maclaurin‟s theorems.

UNIT – III
Multivariable Calculus : (Differentiation) Limit, continuity and partial derivatives, total
derivative; Maxima, minima and saddle points; Method of Lagrange multipliers; Gradient,
directional derivatives, curl and divergence.

UNIT – IV
Sequences and Series: Convergence of sequence and series, tests for convergence
(Geometric test, P- test, limit comparison test, D‟ Alember ratio test, Cauchy‟ s nth root
test); Power series, Taylor's series, series for exponential, trigonometric and logarithm
functions.

UNIT-V
Fourier series: Determination of Fourier coefficients- Fourier series- Even and
functions, Fourier Series in an arbitrary interval, Periodic function, Half range sine and
cosine series,

TEXT BOOKS:
1. Higher Engineering Mathematics, B.S.Grewal, Khanna publishers-42nd Edition(2012)
2. Engineering Mathematics Volume-I, by T.K.V. Iyengar, S.Chand
publication- 12thEdition
3. A Text book of B.Sc. mathematics volume-II, V.Venkateswara Rao
S.Chand Publications

REFERENCES:
1. Ramana B.V. Higher Engineering Mathematics,Tata McGraw Hill
New Delhi,11thReprint, 2010.
2. Engineering mathematics, volume-I&II, E.Rukmangadachari &
E.Keshava Reddy Pearson Publishers.
3. D. Poole, Linear Algebra: A Modern Introduction, 2nd Edition, Brooks/Cole, 2005.
4. N.P. Bali and Manish Goyal, A text book of Engineering
Mathematics, LaxmiPublications, Reprint, 2008.
5. Bhavanari Satyanarayana, T.V.Pradeepkumar&D.Srinivasulu “Linear Algebra
& Vector Calculus”, Studera Press, New Delhi

Page 10 of 121
 B.Tech - CSE
R18

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
I B. Tech – I Sem. L T P C

3 1 - 4
(18HS0801) CHEMISTRY
(Common to all Branches)
Course Objectives:
 Developed in this course will aid in quantification of several concepts in chemistry
that have been introduced at the 10+2 levels in schools.
 Technology is being increasingly based on the electronic, atomic and molecular level
modifications.
 Quantum theory is more than 100 years old and to understand phenomena at
Nanometer levels, one has to base the description of all chemical processes at
molecular levels.
Course Outcomes:
 Analyze microscopic chemistry in terms of atomic and molecular orbitals
and intermolecular forces.
 Able to design the flowchart and algorithm for real world problems
 Able to learn and understand new programming languages
 Able to construct modular and readable programs Rationalise bulk properties and
processes using thermodynamic considerations.
 Distinguish the ranges of the electromagnetic spectrum used for exciting different
molecular energy levels in various spectroscopic techniques Rationalise periodic
properties such as ionization potential, electronegativity, oxidation states and
electronegativity.

UNIT-I
Spectroscopic Techniques and Applications: Principles, selection rules and applications of
absorption (UV/Visible, Atomic Absorption, Infrared) and Emission spectroscopy (Flame
photometry and Fluorescence and its applications in medicine. Advanced Instrumental
Techniques and their Significance: XRD, Scanning Electron microscope (SEM) and
Transmission electron microscopy (TEM).

UNIT-II
Organic Reactions and Organic Polymers: Introduction to reactions involving
substitution, addition, elimination, oxidation, reduction, Synthesis of a commonly used drug
molecule. Organic polymers types (Thermosetting and Thermoplastics), Preparation,
Properties and Engineering Applications of PVC, Teflon, Nylon6,6, Bakelite), Moulding
Process and its uses, Conducting polymers (polyacetylene, Polyaniline).

Page 11 of 121
 B.Tech - CSE
R18

UNIT-III
Atomic, Molecular Structure and Periodic Properties: Schrodinger wave equation,
Molecular orbital‟s of diatomic molecules. Energy level diagrams of diatomic. Pi-molecular
orbitals of butadiene and benzene and aromaticity. Crystal field theory and the energy level
diagrams for transition metal ions and their magnetic properties.
Effective Nuclear charge, variations of s, p, d and f orbital energies of atoms in the periodic
table, atomic and ionic sizes, oxidation states, hard soft acids and bases, molecular
geometries.

UNIT-IV

Uses of Free Energy and Chemical Equilibria: Thermodynamic functions: Energy

Entropy and free energy, Cell potentials, Nernest equations and Its Applications. Acid base
Oxidation, reduction and Solubility Equilibria. Corrosion: Types of Corrosion, Factors
Influencing the rate of Corrosion, Prevention of Corrosion (Sacrificial anodic protection,
Impressed Cathodic Protection), Anodic and Cathodic Inhibitors, Electro plating (Copper,
Nickel, Chromium) and Electroless Plating.

UNIT-V
Water Technology: Hardness of water and its units, Estimation of Hardness by EDTA
method. Boiler Troubles: Scale & Sludge, Priming and Foaming and Boiler corrosion.
Municipal Solid waste Treatment.Water softening methods (Lime-Soda, Zeolite, Ion-
Exchange resins). Demineralization of Brackish Water: Reverse Osmosis and Electro
Dialysis.

TEXT BOOKS:
1. University chemistry, by B. H. Mahan
2. Chemistry: Principles and Applications, by M. J. Sienko and R. A. Plane
3. Fundamentals of Molecular Spectroscopy, by C. N. Banwell
4. Engineering Chemistry (NPTEL Web-book),by B. L. Tembe, Kamaluddin and
M. S. Krishnan
5. Physical Chemistry, by P. W. Atkins 1.
6. Organic Chemistry: Structure and Function by K. P. C. Volhardt and N. E.
Schore, 5th Edition
http://bcs.whfreeman.com/vollhardtschore5e/default.asp

Page 12 of 121
 B.Tech - CSE
R18

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
I B. Tech – I Sem.
1 - 4 3

(18ME0302) ENGINEERING GRAPHICS & DESIGN

Course Objectives:

 To familiarize the students in basic concept of conic sections, projections and

Development of Objects.
 To develop the imagination and drafting skills of students.

Course Outcomes:
Students undergoing this course are able to
 Frame ideas based on the conceptual modeling and design
 Provide good understanding of the methods involved in preparing various views in
Engineering drawings.
 Can prepare 2D and 3D diagrams of various objects

UNIT-I
Introduction to Engineering Drawing: Principles of Engineering Graphics and their
significance, usage of Drawing instruments, lettering, Conic sections, Cycloids and
Involutes.

UNIT-II
Projections of Points: Principles of Orthographic Projections-Conventions - Projections
of Points, Traces
Projections of straight lines: Inclined to both the planes - simple problems only, Traces

UNIT-III
Projections of Planes: Planes (Inclined to single plane only)
Projections of Solids: Introduction– Projections of right regular solids-Prisms, Pyramids
in different positions. (Single plane only)

UNIT-IV
Sections of solids: Sectional Views of Right regular Solids - Prisms, Pyramids.
Development of surfaces - Development of surfaces of Right Regular Solids -
Prisms, Pyramids.

UNIT-V
Orthographic Projections: Principles of Orthographic projection, Conversion of
objects from 3D to 2D
Isometric Projections: Principles of Isometric projection – Isometric Scale, Isometric
Views, Conventions; Isometric Views of lines, Planes, Simple and compound Solids,
Conversion of 2D to 3D.

Page 13 of 121
 B.Tech - CSE
R18

Auto CAD (for Practice only not for External Exam)

Introduction to CAD, Applications, commands, Tool bar, modeling of Simple parts, isometric
problems.

TEXT BOOKS:
1. Engineering Drawing, N.D.Bhatt, Charotar Publishers
2. A text Book of Engineering Drawing, K.L.Narayana, Kannaiah, Scitech Publishers, 2010
3. Engineering Graphics with using AutoCAD,2007. Jeyapoovan.T, Vikas Publishing House

REFERENCES:
1. Fundamentals of Engineering Drawing, Warren J.Luzadder and Jon. M.Duff,
Prentice Hall of India Pvt., Ltd., Eleventh Edition, 2001.
2. Engineering Graphics, Bhattacharyya, S.C.Bera, I.K .International Pvt Ltd. 2009.
3. A text Book of Engineering Drawing and Graphic, K.Venugopal New Age
PublishinNew Delhi, 2008.

Page 14 of 121
 B.Tech - CSE
R18

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – I Sem.
3 - - 3

(18HS0810) ENGLISH
(Common to all branches)

Course Objectives:
 To develop interest in reading English Literature for language learning.
 To improve knowledge and understanding of Grammar.
 To enhance the ability for making use of grammar in writing English.
 To enrich communication skills among the students.
 To develop their insight and positive attitude towards English language.
 To impart LSRW skills and inculcate the habit of learning.
 To build vocabulary.
 To enhance employability skills.

Course Outcomes
Students will be able:
1. To understand the rules of English grammar and their usage in writing English.
2. To use LSRW skills through the prescribed text and develop their ability
to communicate effectively.
3. To get the mastery of language to express ideas, views, feelings and experience.
4. To communicate well among themselves.
5. To inculcate values and ideal characteristic qualities in themselves.

UNIT-I
Reading:
1. All the World’s a Stage by William Shakespeare. (Act-II, Scene-VII).
2. After Twenty Years by O. Henry.
Writing: Nature and Style of Sensible Writing: Describing & Defining.
Speaking: Oral Communication (involves interactive practice sessions) Self -
introduction and introducing a friend.
Listening: Listening activity (Present tense).
Vocabulary: The concept of word formation & root words from foreign languages.
Grammar: Subject – Verb Agreement. Sentence Structures & use of phrases and clauses
in sentences. Identifyin common errors in noun, pronoun and adjectives.

UNIT-II
Reading:
1. I Have a Dream Martin Luther King jr.
2. Knowledge and Wisdom by Bertrand Russell.

Page 15 of 121
 B.Tech - CSE
R18

Writing: Importance of proper punctuation and creating coherence- Simple sentences.

Speaking: Expressing apology.
Listening: Listening activity. (Past
tense) Vocabulary: Prefixes and
Suffixes.
Grammar: Identifying common errors in Articles, Modifiers and degrees of comparison.

UNIT-III
Reading:
1) Nelson Mandela (Biography)
2) “The Happy Prince” by Oscar
wilde. Writing: Paragraph writing – letter
writing. Speaking: Situational dialogues.
Listening: Listening activity. (Future
tense) Vocabulary: Synonyms and
Antonyms.
Grammar: Identifying common errors in Prepositions and Link words and
complex sentences.

UNIT-IV
Reading:
1. Where the Mind is without Fear by RabindraNath Tagore.
2. Cause - Effect and Control Measures of Pollution (Air, Water, Noise) and
Nuclear Hazards.
Writing: Essay writing - Organizing principles of essay writing - Introduction
and Conclusion.
Speaking: Public speaking dynamics.
Listening: Listening activity. (Active voice and passive voice)
Vocabulary: Abbreviations and Acronyms.
Grammar: Identifying common errors in redundancies and compound sentences.

UNIT-V
Reading:
1. The Road not Taken by Robert Frost.
2. An Astrologer’s Day by R K Narayan.
Writing: Techniques for writing precisely.
Speaking: Interviews and formal
presentations.
Listening: speeches of A P J Abdul Kalam, Steve Jobs and so on.
Vocabulary: One word substitutes.
Grammar: Identifying common errors in clichés

Page 16 of 121
 B.Tech - CSE
R18

REFERENCE BOOKS:

1. Practical English Usage. Michael Swan. OUP. 1995.

2. Remedial English Grammar. F.T. Wood. Macmillan. 2007.
3. On Writing Well. William Zinsser. Harper Resource Book, 200.
4. Study Writing. Liz Hamp-Lyons and Ben Heasly. Cambridge University Press, 2006.
5. Communication Skills. Sanjay Kumar and PushpLata. Oxford University Press, 2011.
6. Exercises in Spoken English. Parts. I-III. CIEFL, Hyd. Oxford University
Press, 2005.
7. Oscar Wilde, Create Independence Publisher, Kindle Edition, 2017.
8. The Complete Works of William Shakespeare, Kindle Edition, 2017.
9. G. P. Editors, The Complete Works of William Shakespeare, Global Classic, 2018.
10. Robert Frost, Robert Frost Collection, Wider Publication, 2011.

Page 17 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – I Sem.
- - 3 1.5

(18HS0802) CHEMISTRY LAB

(Common to all Branches)
Course Outcomes:
The chemistry laboratory course will consist of experiments illustrating the
principles of chemistry relevant to the study of science and engineering. The students will
learn to:

 Estimate rate constants of reactions from concentration of reactants/products as

a function of time.
 Measure molecular/system properties such as surface tension, viscosity,
conductance of solutions, redox potentials, chloride content of water, etc.
 Synthesize a small drug molecule and analyse a salt sample.

List of Experiments
1. Estimation of copper by EDTA method
2. Determination of chloride content of water
3. Determination of acidity of water sample.
4. Determination of alkalinity of water sample
5. Potentiometric determination of Fe2+ by potassium permanganate.
6. Determination of Viscosity of an oil by Redwood Viscometer
7. Determination of dissolved oxygen in a water sample by Winkler‟s method
8. Conductometric titrations of strong acid against strong base.
9. Chemical analysis of a salt
10. Synthesis of a polymer/drug

Page 18 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – I Sem.
- - 3 1.5

(18HS0811) ENGLISH LAB

(Common to all branches)

Course Objectives:
To get the job students dream of today largely depends on the way they communicate. Due
to globalization, civilization and fast growing technologies, communication has become a
very important factor. Good communication skills increase the possibilities of getting good
jobs. To meet the requirement of corporate word one has to be capable of expressing oneself.
 To provide Computer Assisted Language Learning facility for the students on
self- instructional method for improving language.
 To improve the correct articulation as English is international language.
 To enhance the communication skills with a variety of activities and practice sessions.

Course Outcomes:
Students will be able:
1. To recognize sounds of English language with different classifications.
2. To know phonetic transcription and phonemic symbols of English language.
3. To understand international accent and utilize the same in their daily conversation.
4. To crease confidence for public speaking, for facing interviews, for making
effective oral presentations, for having discussions, and for delivering impromptu
speeches.

UNIT -I
a) Importance of Phonetics – Introduction, organs of speech, classification of
sounds, and Phonetic transcriptions.

UNIT-II
a) Syllable, Syllabification, Word stress, Stress Rules and Intonation.
b) Intonation (Falling, Raising, and fall-raise) - Pitch and Rhythm.
c) Influence of mother tongue (MTI) - Common Indian Variants in pronunciation.
d) Difference between British and American Pronunciation

UNIT-III
a) Vocabulary building.
b) Functional English; Telephone skills; Giving Directions; Situational dialogues;
Role play.
c) JAM, Oral presentation-Prepared and extempore and PPT presentation.

Page 19 of 121
 R18 B.Tech - CSE

UNIT-IV
a) Describing people, places, things and situations- Body language–- listening some
UNIT-V
a) Preparation of resume (C.V) & Cover Letter.
b) Interview Skills - mock interviews.
c) Group Discussion, Debate and Dress code.

Minimum requirement for ELCS LAB

1. Computer Assisted Language Learning (CALL) Lab: The Computer Aided
Language Lab for 60 Students with 60 systems one Master Console, LAN facility
and English Language Software for self-study by learners.
2. The Communication Skills Lab with movable chairs and audio visual aids with a P.
A. system, Projector, a Digital stereo audio & video system and Camcorder etc.
System Requirement (Hardware component):
Computer network with: LAN with minimum 60 multimedia systems with
the following.
Specifications:
i) P- IV Processor
a) Speed 2.8 GHZ
b) RAM – 512 MB Minimum
c) Hard Disk – 80 GB
ii) Headphones of High quality.

Software:

1. Clarity pronunciation power--- Part 1(sky pronunciation)

2. Clarity pronunciation power--- Part 2
3. K-Van Advanced Communication Skills.
4. Walden Info tech Software.

References Books:

1. A Textbook of English Phonetics for Indian Students, second edition

T. Balasubramanian. (Mcmillian) 2012.
2. A Course in Phonetics and spoken English, DhamijaSethi, Prentice-hall of
India Pvt. Ltd, 2000.
3. Speaking English Effectively, second Edition Krishna Mohan & NP Singh
2011 (Mcmillian).
4. A Hand Book of English Laboratories,E.Sureshkumar ,P.Sreehari,
Foundation books, 2011.
5. Spring Board Success, SharadaKoshik, BinduBajwa, Orient Black
Swan, Hyderabad, 2010.

Page 20 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
I B. Tech – I Sem.
- - 4 2

(18ME0301) WORKSHOP PRACTICES LAB

PART-A –Engineering Workshop
Course Objectives:
 The course provides hands-on training in the trades of Carpentry, Fitting, House-
wiring, Tin Smithy, and Foundry. Overview of metal cutting processes, plumbing and
welding is provided through live demonstrations.

Course Outcomes:

After completion of this course, a successful student will be able to:

 Utilize workshop tools for engineering practice.
 Employ skills for the production a component for real time applications.
 Appreciate the hard work and intuitive knowledge of the manual workers.

LIST OF EXPERIMENTS
1. TRADES FOR EXERCISES

a. Carpentry shop: Two joints (exercises) involving tenon and mortising, groove and
tongue: Making middle lap T joint, Cross lap joint, Mortise and tenon T joint, Bridle
T joint from soft wood stock.

b. Fitting shop: Two joints (exercises) from: Square joint, V joint, Half round joint or
Dovetail joint out of 100 x 50 x 5 mm M.S. stock.

c. Sheet metal shop: Two jobs (exercises) from: Tray, Cylinder, Hopper or Funnel from
out of 22 or 20 gauge G.I. sheet.

d. House-wiring: Two jobs (exercises) from: Wiring for ceiling rose and two lamps
(bulbs)with independent switch, two way switch, controls with or without looping,
wiring for stair case lamp, wiring for water pump with single phase starter.

e. Foundry: Preparation of two moulds (exercises): for a single pattern and a double
pattern.

f. Welding: Preparation of two welds (exercises): Single V butt joint, Lap joint, Double
V butt joint or T fillet joint.

Page 21 of 121
 R18 B.Tech - CSE

2. TRADES FOR DEMONSTRATION:

a. Plumbing
b. Machine Shop
c. Metal Cutting

Apart from the above the shop rooms should display charts, layouts, figures,
circuits, hand tools, hand machines, models of jobs, materials with names such as
different woods, wood faults, Plastics, steels, meters, gauges, equipment, CD or
DVD displays, First aid, shop safety etc. (though they may not be used for the
exercises but they give valuable information to the student). In the class work or in
the examination knowledge of all shop practices may be stressed upon rather than
skill acquired in making the job.

References:

1. Engineering Work shop practice for JNTU, V. Ramesh Babu, VRB Publishers Pvt.
Ltd., 2009
2. Work shop Manual, P.Kannaiah & K.L.Narayana, SciTech Publishers.
3. Dictionary of Mechanical Engineering, GHF Nayler, Jaico Publishing House.

PART-B – IT Workshop

Course Objectives:
To provide students with hands-on experience in basic hardware, productivity tools and
basic operating system installations.

Course Outcomes:
After Completion of this Course the Student would be able to
 Identify the basic computer peripherals.
 Gain sufficient knowledge on assembling and disassembling a PC.
 Learn the installation procedure of Windows and Linux OS.
 Acquire knowledge on basic networking infrastructure.
 Learn productivity tools like Word, Excel and Power point.
 Acquire knowledge on basics of internet and worldwide web.

Task 1:
Identification of the peripherals of a computer: To prepare a report containing the block
diagram of the CPU along with the configuration of each peripheral and its functions.
Description of various I/O Devices

Task 2:
A practice on disassembling the components of a PC and assembling them.

Page 22 of 121
 R18 B.Tech - CSE

Task 3:
1. Basic DOS commands, Installation of MS windows.
2. Basic Linux Commands,Installation ofLinux.

Task 4:
Hardware Troubleshooting (Demonstration): Identification of a problem and fixing the
solution (improper assembly or defective peripherals). Software Troubleshooting
(Demonstration): Identification of a problem and fixing the PC for any software issues

Productivity

tools Task 5:
1. MS Word Orientation: Accessing, overview of toolbars, saving files, Using help and
resources, rulers, formatting ,Drop Cap , Applying Text effects, Using Character
Spacing, using templates, Borders and Colors, Inserting Header and Footer, Using Date
and Time option, security features in word, converting documents while saving
2. Presentations: Creating, opening, saving and running the presentations, selecting the
style for slides, formatting the slides with different fonts, colors, creating charts and
tables, inserting and deleting text, graphics and animations, bulleting and numbering,
hyperlinking, running the slide show, setting the timing for slide show. Students should
submit a user manual of the Presentation tool considered.
3. Spreadsheet :Students should be able to create, open, save the application documents
and format them as per the requirement. Some of the tasks that may be practiced are
Managing the worksheet environment, creating cell data, inserting and deleting cell data,
format cells, adjust the cell size, applying formulas and functions, preparing charts,
sorting cells. Students should submit a user manual of the Spreadsheet application
considered.

Task 6:
Networking: Students should connect two computers directly using a cable or wireless
connectivity and share information. Students shouldconnect two or more computers using
switch/hub and share information. Crimpling activity, logical configuration etc should be
done by the student. The entire process has to be documented.

REFERENCES:

1. Introduction to Computers, Peter Norton, McGraw Hill

2. MOS study guide for word, Excel, Powerpoint & Outlook Exams”, Joan
Lambert,Joyce Cox, PHI.
3. Introduction to Information Technology, ITL Education Solutions limited,
Pearson Education.
4. Networking your computers and devices, Rusen, PHI
5. Trouble shooting, Maintaining& Repairing PCs”, Bigelows, TMH

Page 23 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – II Sem.
3 1 - 4

(18HS0831) MATHEMATICS-II
(Common to all branches)

Course Objectives:

The objective of this course is to familiarize the prospective engineers with

techniques in Multivariate integration, ordinary and partial differential equations and
complex variables. It aims to equip the students to deal with advanced level of mathematics
and applications that would be essential for their disciplines. More precisely, the objectives
are:
 To acquaint the student with mathematical tools needed in evaluating
multiple integrals and their usage.
 To introduce effective mathematical tools for the solutions of differential
equations that model physical processes.
 To introduce the tools of differentiation and integration of functions of
complex variable that are used in various techniques dealing engineering
problems.

Course Outcomes:

The objective of this course is to familiarize the prospective engineers with

techniques in calculus, multivariable calculus and complex analysis. 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.

UNIT-I
First order ordinary differential equations: Exact, linear and Bernoulli‟s equations,
Euler‟s equations, Equations not of first degree: equations solvable for p, equations solvable
for y, equations solvable for x and Clairaut‟s type.

UNIT-II
Ordinary differential equations of higher orders: Second order linear differential
equations with variable coefficients, method of variation of parameters, Cauchy-Euler
equation; Power series solutions; Legendre polynomials, Bessel functions of the first kind
and their properties.

Page 24 of 121
 R18 B.Tech - CSE

UNIT-III
Multivariable Calculus (Integration): Multiple Integration: Double integrals (Cartesian),
change of order of integration in double integrals, Change of variables (Cartesian to polar),
Applications: areas and volumes, Triple integrals (Cartesian), orthogonal curvilinear
coordinates.
UNIT-IV
Complex Variable – Differentiation: Differentiation, Cauchy-Riemann equations, analytic
functions, harmonic functions, finding harmonic conjugate; elementary analytic functions
(exponential, trigonometric, logarithm) and their properties; Conformal mappings, Mobius
transformations and their properties.

UNIT-V: Complex Variable – Integration: Contour integrals, Cauchy-Goursat theorem

(without proof), Cauchy Integral formula (without proof), Taylor‟s series, zeros of analytic
functions, singularities, Laurent‟s series; Residues, Cauchy Residue theorem (without
proof), Evaluation of definite integral involving sine and cosine.

TEXT BOOKS:
1. Higher Engineering Mathematics, B.S.Grewal, Khanna publishers
2. Engineering Mathematics Volume-I &III by T.K.V. Iyengar, S.Chand publication

REFERENCE BOOKS:
1. Engineering Mathematics, volume-I&III, E. Rukmangadachari& E.Keshava
Reddy Pearson Publishers
2. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New
Delhi, 11thReprint, 2010.
3. Engineering Mathematics-I & III, T.K.V.Iyengar S.Chand Publications.
4. D. Poole, Linear Algebra: A Modern Introduction, 2nd Edition, Brooks/Cole, 2005.
5. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics,
Laxmi Publications, Reprint, 2008.

Page 25 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – II Sem.
3 1 - 4

(18HS0851) SEMI-CONDUCTOR PHYSICS

(Common to ECE, CSE and CS&IT)

Course Objectives:
 Basic concepts of free electron theory and energy bands in solids.
 Key points, formation and importance of semiconductors.
 Will Understanding working principles and applications of optoelectronic devices.
 Will recognize the basic concepts related properties of Lasers and Optical Fibers..
 To understand the fundamentals Nano materials.
Course outcomes:
 Would understand the basic concepts of free electron theory and energy bands
in solids.
 Able to deliver importance of semiconductors.
 Would understand working principles and applications of optoelectronic devices.
 Able to explain concepts related toLasers and Optical fibers. .
 Understand the importance of Nanotechnology.

UNIT – I
ELECTRONIC MATERIALS: Free electron theory, density of states and energy band
diagrams – Energy bands in solids – E – K band diagram, direct and indirect band gaps,
types of electronic materials : metals , semiconductors and insulators – occupation
probability – Fermi level – effective mass .

UNIT – II
SEMICONDUCTORS: Intrinsic and Extrinsic semiconductors – Dependence of Fermi
level on carrier-concentration and temperature (equilibrium carrier statistics) - Carrier
generation and recombination - Carrier transport: diffusion and drift -Hall Effect- p -n
junction – Metal semiconductors junction-Ohmic and Schottky Junctions.

UNIT –III

LIGHTEMITING DIODE (LED) & PHOTODETECTORS: Rate equations for carrier

density – radiative and non - radiative recombination mechanisms in semiconductors – LED:
structure, materials, characteristics and figure of merits.

Photo detectors – PIN and Avalanche diode and their structure, materials working
principle and characteristics – Solar cell.- Principle and characteristics

Page 26 of 121
 R18 B.Tech - CSE

UNIT – IV
LASERS AND FIBER OPTICS: Characteristics of laser beams,Einstein‟s theory of matter
radiation interaction and A and B coefficients; amplification of light by population inversion,
different types of lasers: Semiconductor laser, applications of lasers in science, engineering
and medicine.
Principle of fiber optics – acceptance angle and numerical aperture – types of fibre
cables- loses in fiber optics – optical fiber communication system - applications of fiber
optics.

UNIT-V
PHYSICS OF NANOMATERIALS: Introduction, significance of nano scale – surface
area and quantum confinement- Quantum dot, Quantum well , Quantum wire -Synthesis of
nanomaterials- Top Down Process- Ball Milling ; Bottom Up Process: Sol-Gel method–
CNT-Properties of Graphene- Applications.

Text books:
1. J. Singh, Semiconductor optoelectronics, Physics and Technology, McGraw-Hill
Inc. (1995).
2. S.M. Sze, Semiconductor devices: Physics and Technology, Wiley (2008).
3. P. Bhattacharya, Semiconductor optoelectronic devices, Prentice Hall of India (1997).
4. B.E.A. Saleh and M.C, Tech, Fundamentals of photonics, John Wiley & Sons.
5. Engineering Physics – K.Thyagarajan, MCGrawHill Education Private Ltd,
New Delhi.

Page 27 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – II Sem.
3 - - 3

(18CS0501) PROGRAMMING FOR PROBLEM SOLVING

Solving Course Objectives:

• To understand the core aspects of computer problem solving techniques
• To understand the programming language constructs
• To understand the programming paradigms

Course Outcomes:
• Able to design the flowchart and algorithm for real world problems
• Able to learn and understand new programming languages
• Able to construct modular and readable programs
• Able to write C programs for real world problems using simple and compound data types

UNIT I

OVERVIEW OF COMPUTERS AND C-PROGRAMMING: Description of Computer

Hardware &Software.
Introduction to C:overview of C, executing a „c‟ program, c-character set, constants,
variables, data types, declaration of variables, assigning values to variables, managing input
& output operations, operators and expressions, basics of algorithm and flow chart

UNIT II

DECISION&LOOPCONTROL STATEMENTS: Introduction, If Statement, If-else

Statement, Nested- If-else Statement, Else if Ladder, Switch case – break – continue – go to
Statement ,for loop, nested for loop, while loop, do-while, do-while statement with while
loop

UNIT III

ARRAYS: Introduction, one-dimensional (1D)-Arrays, declaration and initialization of one-

dimensional (1D)-Arrays, Two- dimensional (2D)-Arrays, initialization of Two-
dimensional(2D)-Arrays, Multi-dimensional Arrays
FUNCTIONS: Introduction, need for user-defined functions, a multi function program,
elements of user-defined functions, definition of functions, return values and types, category
of functions, recursion, scope and life time of variables, preprocessor commands:#define,
#include, multi file programs

Page 28 of 121
 R18 B.Tech - CSE

UNIT IV
POINTERS: Introduction, understanding pointers, accessing address of a variable,
declaring and initialization of pointer variables, accessing variable through pointers, chain of
pointers, pointer expressions, pointer increment and scale factor, pointers and arrays, passing
arrays to functions, array of pointers, pointers as function arguments, functions returning
pointers.
STRINGS: Introduction, declaring and initializing string variables, reading and writing
strings, arithmetic operations on characters, putting strings together, comparison of two
strings, string handling functions, table of strings(array of strings)

UNIT V
STRUCTURES: Introduction , defining a structure , declaring structure variables ,accessing
structure members, structure initialization, copying and comparing structure variables,
operations on individual members , arrays of structures ,arrays within structures, structures
within structures, structures and functions, unions, typedef, enum
File Management in C: Introduction, Types of Files, Defining and Opening a File,
Closing a File, Input / Output Operations on Files, Error handling during IO
Operations, Random access to files, Command line arguments.

TEXT BOOKS:
1. C and Data Structures – Ashok Kamthane Pearson education
2. Programming in C and Data Structures – E Balagurusamy – Mc GrawHill.

REFERENCES:
1. Computer Fundamentals and C Programming - Dr. P.
Chenna Reddy, ISBN: 9789351045885, Publisher:
Pothi.com
2. Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill
3. Programming in C, Second Edition – Pradip Dey, Manas Ghosh, Oxford University Press.
4. “C from Theory to Practice”- George S. Tselikis- Nikolaos D. Tselikas- CRC Press.
5. “Programming with C”- R S Bichkar- University Press.
6. Programming in C and Data Structures, J.R.Hanly, Ashok N. Kamthane
and A.Ananda Rao, Pearson Education. (UNIT-I)

Page 29 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – II Sem.
3 - - 3

(18CS0502) DIGITAL LOGIC DESIGN

Course Objectives:
 To acquire the basic knowledge of digital logic levels and application
of knowledge to understand digital electronics circuits.
 To prepare students to perform the analysis and design of various
digital electronic circuits.
Course Outcomes:
At the end of this course, students will demonstrate the ability to
 Understand working of logic families and logic gates.
 Design and implement Combinational and Sequential logic circuits.
 Understand the process of Analog to Digital conversion and Digital to
Analog conversion.
 Be able to use PLDs to implement the given logical problem.

UNIT- I
Binary systems and Boolean algebra: Digital Systems, Binary Numbers, Number Base
Conversions, Octa land Hexa decimal Numbers, Complements, Signed Binary Numbers,
Binary Codes, Binary Storage and Registers, Axiomatic Definition of Boolean Algebra,
Basic Properties of Boolean Algebra, Boolean Functions, Canonical and Standard Forms,
Other Logic Operations, Digital Logic Gates.

UNIT- II
Gate–Level Minimization: The Map Method, Four Variable Map, Five-Variable Map,
Product of Sums Simplification, Don„t-Care Conditions, NAND and NOR Implementation,
Other Two Level Implementations, EX-OR Function, Tabular Minimization method.

UNIT- III
Combinational Logic: Combinational Circuits, Analysis Procedure, Design Procedure,
Binary Adder-Subtractor, Decimal Adder, Binary Multiplier, Magnitude Comparator,
Decoders, Encoders, Multiplexers, De-Multiplexers.

UNIT- IV
Synchronous Sequential Logic: Sequential Circuits, Latches, Flip-Flops, Analysis of
Clocked Sequential Circuits, State Reduction and Assignment, Design Procedure, Registers,
Shift Registers, Ripple counters, Synchronous counters, Ring Counter and Johnson Counter.

Page 30 of 121
 R18 B.Tech - CSE

UNIT- V
Memory And Programmable Logic: Random access memory, memory decoding, Error
Detection and Correction, Read-only Memory, Programmable Logic Array, Programmable
Array Logic, Sequential Programmable Devices, Integrated circuits.

TEXT BOOKS:

1. Digital Design, M.Morris Mano, Micheal D.Ciletti, 5th Edition, 2013, Pearson.

REFERENCE BOOKS:

1. Digital Logic & State Machine Design, David J. Comer, Oxford

University Press, 3rd Reprinted Indian Edition, 2012.
2. Digital Logic Design, R.D.Sudhakar Samuel, Elsevier Fundamentals
of Logic Design, 5/e, Roth, Cengage

Page 31 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – II Sem.
3 - - 3

(18EE0239) BASIC ELECTRICAL ENGINEERING

Course Objectives:
To make the student learn about:
 To understand the nature of different circuit elements, fundamental laws and
network Theorems.
 Understand the operation of dc machines and single phase transformers.

Course Outcomes:
Upon completion of the course, students will:
 Determine the equivalent impedance of given network by using network
reduction techniques.
 Determine the current through any element and voltage across any element
 Apply the network theorems suitably.
 Analyze the operating principles of electrical machines and transformer.

UNIT-I
DC Circuits: Electrical circuit elements (R, L and C), voltage and current sources, Kirchoff
current and voltage laws, analysis of simple circuits with dc excitation. Superposition,
Thevenin and Norton Theorems. Time-domain analysis of first-order RL and RC circuits.

UNIT-II
AC Circuits: Representation of sinusoidal waveforms, peak and rms values, phasor
representation, real power, reactive power, apparent power, power factor. Analysis of single-
phase ac circuits consisting of R, L, C, RL, RC, RLC combinations (series and parallel),
resonance. Three phase balanced circuits, voltage and current relations in star and delta
connections.

UNIT-III
Transformers: Magnetic materials, BH characteristics, ideal and practical transformer,
equivalent circuit, losses in transformers, regulation and efficiency. Auto-transformer and
three-phase transformer connections.

UNIT-IV
Electrical Machines: Generation of rotating magnetic fields, Construction and working of a
three-phase induction motor, Significance of torque-slip characteristic. Loss components and
efficiency, starting and speed control of induction motor. Single-phase induction motor.
Construction, working, torque-speed characteristic and speed control of separately excited dc
motor. Construction and working of synchronous generators.

Page 32 of 121
 R18 B.Tech - CSE

UNIT-V
Electrical Installations
Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, MCCB, Types of
Wires and Cables, Earthing. Types of Batteries, Important Characteristics for Batteries.
Elementary calculations for energy consumption, power factor improvement and
battery backup.

TEXT BOOKS:
1. D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill,2010.
2. D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill, 2009.

REFERENCES:
1. L. S. Bobrow, “Fundamentals of Electrical Engineering”, Oxford University Press,2011.
2. E. Hughes, “Electrical and Electronics Technology”, Pearson, 2010.
3. V. D. Toro, “Electrical Engineering Fundamentals”, Prentice Hall India, 1989.

Page 33 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – II Sem.
- - 3 1.5

(18CS0503) PROGRAMMING FOR PROBLEM SOLVING LAB

Course Objectives:
 To make the student learn C Programming language.
 To make the student solve problems, implement those using C &
C++ programming languages.
 To strengthen the ability to identify and apply the suitable data structure for
the given real world problem.

Course Outcomes:
At the end of the course, students will be able to
 Apply problem solving techniques of C to find solution.
 Use C language features effectively to implement solutions.
 Use C++ language features effectively to solve problems.
 Identify and develop apt searching and sorting technique for a given problem.
 Identity, design and develop the appropriate data structure for a
given problem or application.

Experiments List:
1. a) Acquainting students to “c” programming environment and DOS commands
b) Calculate sum of three numbers using c-program

2. a) Swap(exchange) values of two integer variables using c-program

b) Read an integer, a character and a float values through keyboard and display
c) Check operators precedence and associativity using c-program
d) Write a c-program using all basic data types of c language

3. a) Read 3 integer values through keyboard and display largest among them
b) Read marks of 5 subjects obtained by a student through keyboard and display
“fail” or “pass” message on console
c) Using switch() statement implement arithmetic operations.

4. a) check whether entered number is prime number

b) display factorial of entered number
c) display all multiples of an entered number upto given value(n)

5. a) Generate fibonacci series upto entered number(n)

b) find out sum of the digits of a number

Page 34 of 121
 R18 B.Tech - CSE

6. a) Find the binary equivalent of entered decimal number

b) Generation multiplication table of entered number(n)

7. a) Calculate sum of two integer matrices

b) Calculate product of two integer matrices

8. a) Create your header file by including 2 user(your) defined functions

and include them in a c-program student
b) Find out factorial of a number using recursive function
c) Find square of an entered number using “call by address(reference)” technique
d) A program that tells us purpose of few predefined functions in “math.h” header file.

9. a) Check whether entered string is palindrome.

b) Write a program to sort the entered set of strings using structure concept.

10. a) Count number of vowels, consonants, digits, white spaces and

special characters in entered string(a line of text)
b) Swap (exchange) values of two integer variables using pointers.

11. a) For 3 students with 3 subjects, calculate total marks and grade obtained by each
b) Read data from a file(text) and display it on the monitor

12. a) Copy contents of one file(text) to other created file

b) Merge contents of two files(text) and store it in another created file

REFERENCES:

1. How to solve it by Computer, R.G. Dromey, Pearson.

2. The C Programming Language, Brian W. Kernighan, Dennis M. Ritchie, Pearson.
3. Let us C Yeswant Kanetkar, BPB publications
4. Pointers in C, Yeswant Kanetkar, BPB publications.
5. Programming in C and Data Structures, J.R.Hanly, Ashok N. Kamthane
and A.Ananda Rao, Pearson Education

Page 35 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
I B. Tech – II Sem.
- - 3 1.5

(18HS0852) PHYSICS LAB

(Common to CIVIL, EEE, ME, ECE, CSE, CSIT and AG)

Course Objectives:
Physics practical course is meant for making the students to gain practical knowledge
to correlate with the theoretical studies. It covers experiments on principle of Mechanics and
Optics, measurement of magnetic field and studying resonance using LCR circuit.
Course Outcomes:
 To explore the application of Interference and Diffraction by doing
concerned experiments.
 Elucidate the concepts of Physics through involvement in the experiment by
applying theoretical knowledge.
 To understand the concept of energy gap, B-H curve and resonance phenomena
in LCR circuits.
 Develop an ability to apply the knowledge of physics experiments in the later studies.

Suggested list of experiments from the following: (Perform any EIGHT

experiments from the following)

1. Determination of wavelengths of variouscolors of Mercury spectrum

using Diffraction Grating – Normal Incidence method.
2. Determination of Dispersive power of prism.
3. Rigidity Modulus – Torsional Pendulum
4. Study of Resonance effect in Series and Parallel LCR circuit.
5. Determination of thickness of thin object by wedge method.
6. Determination of radius of curvature of Plano convex lens – Newton‟s Rings.
7. Determination of wavelength of a given laser source by using diffraction grating.
8. Determination of particle size using laser source.
9. Determinationof energy gap of a semi conductor using p – n junction diode.
10. B- H curve.
11. Magnetic field along the axis of current carrying coil – Stewart & Gee‟s Method.
12. Determination of frequency of tuning fork - Melde‟s Apparatus.
13. Determination of Spring constant – Coupled Oscillator.
14. Study of Characteristics of Solar Cell.
15. Determination of Numerical Aperture of an Optical fiber.

REFERENCE BOOKS:
1. Engineering Physics practical – NU Age Publishing House, Hyderabad.
2. Engineering Practical Physics – Cengage Learning, Delhi.

Page 36 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
I B. Tech – II Sem.
3 - - -

(18HS0817) ESSENCE OF INDIAN TRADITIONAL KNOWLEDGE

(NON-CREDIT COURSE)
Knowledge Course objectives:
The course aims at imparting basic principles of thought process, reasoning and
inference. Sustainability is at the core of Indian Traditional knowledge Systems connecting
society and nature. Holistic life style of yogic science and wisdom capsules in Sanskrit
literature are also important in modern society with rapid technological advancements and
societal disruptions. The course focuses on introduction to Indian Knowledge Systems,
Indian perspective of modern scientific world-view, and basic principles of Yoga and
holistic health care system.

Course Outcome:

 Ability to understand, connect up and explain basics of Indian traditional Knowledge

in modern scientific perspective.

UNIT-I
 Basic structure of Indian Knowledge System: Astadash Vidya- 4 ved 4 Upaved
(Ayurved, Dhanurved, Gandharva Ved & Sthapthya Adi.,)

UNIT-II
 6 Vedanga (Shisha, Kalppa, Nirukha, VYkaran, Jyothish & Chand) 4 Upanga
(Dharma Shastra, Meemamsa, Purana & Tharka Shastra)

UNIT-III
 Modern Science and Indian Knowledge System Yoga and Holistic Health care
Case studies

UNIT-IV
 Philosophical Tradition (Sarvadarshan) Nyaya, Vyshepec,Sankhya, Yog,
Meemamsa, Vedantha, Chavanka, Jain & Boudh
 Indian Linguistic Tradition –(Phonology, morphology, syntax and semantics)

Page 37 of 121
 R18 B.Tech - CSE

UNIT-V

 Indian Artistic Tradition - Chitra kala, Moorthi kala, Vasthu kala , Sthapthya,
Sangeetha, Nruthya Yevam Sahithya
 Case studies

TEXT BOOKS:
1. V. Sivaramakrishnan (Ed.), Cultural Heritage of India-course material, Bharatiya
Vidya Bhavan, Mumbai. 5th Edition, 2014
2. Swami Jitatmanand, Modern Physics and Vedant, Bharatiya Vidya Bhavan
3. Swami Jitatmanand, Holistic Science and Vedant, Bharatiya Vidya Bhavan
4. Fritzof Capra, Tao of Physics
5. Fritzof Capra, The Wave of life

REFERENCES:

1. VN Jha (Eng. Trans.), Tarkasangraha of Annam Bhatta, International Chinmay

Foundation, Velliarnad, Arnakulam
2. Yoga Sutra of Patanjali, Ramakrishna Mission, Kolkata GN Jha (Eng. Trans.),
Ed. RN Jha, Yoga-darshanam with Vyasa Bhashya, Vidyanidhi Prakashan, Delhi
2016
3. RN Jha, Science of Consciousness Psychotherapyand Yoga Practices, Vidyanidhi
Prakashan, Delhi 2016
4. P B Sharma (English translation), Shodashang Hridayan
5. V. Sivaramakrishnan (Ed.), Cultural Heritage of India-course material, Bharatiya
Vidya Bhavan, Mumbai. 5th Edition, 2014
6. S.C. Chaterjee & D.M. Datta, An Introduction to Indian Philosophy, University of
Calcutta, 1984
7. K.S. Subrahmanialyer, Vakyapadiya of Bhartrihari, (Brahma Kanda), Deccan
College Pune 1965.
8. Panini Shiksha, MotilalBanarasidas
9. V.N. Jha, Language, Thought and Reality, Vasudevasharan AGRAWAL Kala
yevam Samskruthi, Shithya Bhavan Elahabad, 1952
10. Pramod Chandra, India Arts, Howard Univ. Press, 1983
11. Krishna Chaitanya, Arts of India, Abhinav Publications, 1987
12. R. Nagaswamy, Foundations of Indian Art, Tamil Arts Academy, 2002

Page 38 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
II B. Tech – I Sem.
3 1 - 4

(18HS0835) PROBABILITY & STATISTICS

( Common to ME, CSE and CSIT branches )
Course Objectives:

 To train the students thoroughly in Mathematical concepts fundamentals of

probability, test of hypothesis, Test of significance.
 To prepare students for lifelong learning and successful careers using
mathematical concepts of probability, test of hypothesis, Test of significance.
 To develop the skill pertinent to the practice of the mathematical concepts
including the Student abilities to formulate and modeling the problems, to think
creatively and to Synthesize information

Course Outcomes:

At the end of the course, students would be expected to:

 Have acquired ability to participate effectively in group discussions
 Have developed ability in writing in various ontexts
 Have acquired a proper level of competence for employability

UNIT I
Basic Probability:
Probability spaces, Addition theorem,conditional probability, independence, Baye‟s rule.
Random variables:
Discrete and Continuous random variables- distribution functions, densities and their
properties. Expectation of Discrete and Continuous Random Variables, Moments

UNIT II
Probability Distributions:
Binomial, Poisson and Normal - evaluation of statistical parameters for these three
distributions.

UNIT III
Basic Statistics:
Measures of Central tendency: Moments, skewness and Kurtosis.Correlation and regression
– Rank correlation

Page 39 of 121
 R18 B.Tech - CSE

UNIT IV
Applied Statistics:
Curve fitting: Curve fitting by the method of least squares- fitting of straight lines, second
degree parabolas and more general curves (Exponential & Power curve).

Test of Hypothesis: Large sample test for single proportion, difference of proportions,
single mean, difference of means, and difference of standard deviations.

UNIT V
Test of significance:

Test for single mean, difference of means and correlation coefficients, test for ratio of
variances - Chi-square test for goodness of fit and independence of attributes.

TEXT BOOKS:

1. B.S. Grewal, “Higher Engineering Mathematics”, Khanna Publishers, 2000

2. Statistical methods by S.P. Gupta, S.Chand publications.
3. Probability & Statistics by T.K.V. Iyengar, S.Chand publications.

REFERENCE BOOKS:

1. Probability & Statistics by E. Rukmangadachari & E. Keshava Reddy, Pearson Publisher.

2. Probability & Statistics for engineers by Dr. J. Ravichandran WILEY-INDIA publishers.
3. Probability & Statistics for Science and Engineering by G.Shanker
Rao, Universities Press.
4. Probability and Statistics for Engineering and Sciences by Jay L.Devore, CENGAGE.
5. Probability and Statistics by R.A. Jhonson and Gupta C.B.

Page 40 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – I Sem.
3 - - 3

(18EC0443) ANALOG ELECTRONICS CIRCUITS

(Common to CSE, CSIT & EEE)
Course Objectives:
The objectives of this course is to
 Discuss the principle and operation of Diode Circuits, BJT and FET.
 Introduce the basic building blocks of linear integrated circuits.

Course Outcomes:
Upon completion of this course, student will be able to:
 Understand Diode Circuits, BJT and FET amplifiers.
 Become familiar with the basic building blocks of linear integrated circuits.

UNIT I
DIODE CIRCUITS: P-N junction diode, V-I characteristics of a diode; Half-wave and Full-
wave Rectifiers, filters, Zener diode, clipping and clamping circuits.

UNIT II
BJT CIRCUITS: Construction, Operation NPN transistor, Transistor Configuration: CB,
CE and CC, Transistor Characteristics, BJT as an Amplifier, Transistor Biasing Circuits, h-
parameter model for low frequency

UNIT III
FET CIRCUITS: FET Classification, FET configurations : CG, CS and CD, JFET-
Construction, Operation, Characteristics and Parameters, MOSFET- N-channel Enhancement
and Depletion MOSFETs: Construction, Working and Characteristics; Comparison of BJT
and FET, Biasing of FET, FET small signal model, FET amplifiers – CS amplifier, CD
amplifier, CG amplifier, High frequency model of FET.

UNIT IV
OPERATIONAL AMPLIFIER: Basic Information of Op-Amp, Ideal Op-Amp, Inverting
Amplifier, Non Inverting Amplifier, Voltage Follower, Differential Amplifier, Difference
and Common Mode gains, Operational Amplifier Internal Circuit, CMRR, DC
Characteristics – Input Bias Current, Input Offset Current, Input and Output Offset Voltage,
Thermal Drift, AC Characteristics – Frequency Response, Frequency Compensation, Slew
rate.

Page 41 of 121
 R18 B.Tech - CSE

UNIT V
APPLICATIONS OF OP-AMP: Scale Changer, Summing Amplifier, Subtractor,
Instrumentation Amplifier, Differentiator, Integrator, Fixed Voltage Series Regulator, IC 723
General purpose Regulator, Active filters: Low pass, High pass, Band pass and Band stop,
DAC – Weighted Resistor DAC, R-2R ladder DAC, Inverted R-2R Ladder DAC, ADC–
Flash Type ADC, Successive Approximation ADC, Dual Slope ADC, DAC/ADC
Specifications.

TEXT/REFERENCE BOOKS:

1. Electronic Devices and Circuits, Salivahanan, N.Suresh Kumar, McGraw

Hill Education, Third Edition.
2. Linear Integrated Circuits, D.Roy Choudhury, Shail B.Jain, New
Age International Publishers, Fourth Edition, 2010.

Page 42 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – I Sem.
3 - - 3

(18CS0504) DATA STRUCTURES & ALGORITHMS

Course Objective:
• Understand different data structures
• Understand searching and sorting techniques

Course Outcome:
At the end of the course, students will be able to:
• Design algorithms to implement various data structures.
• Understand and program stacks and list data structures.
• Write programs to implement different types of queues.
• Understand and make use of hash tables in applications like dictionary,
spell checker etc.,
• Understand why height balanced trees are advantageous over other
data structures.

UNIT-I
Arrays and Linked lists: One Dimensional array : insert, delete, merging operations, Multi
Dimensional array, Single linked list, Circular linked list, Double linked list, Circular
Double linked list, Applications of linked lists.

UNIT-II
Stacks: Introduction-Definition-Representation of Stack-Operations on Stacks-
Applications of Stacks. Queues: Introduction, Definition- Representations of Queues-
Various Queue Structures- Applications of Queues.

UNIT-III
Trees: Basic Terminologies- Definition and Concepts- Representations of Binary Tree-
Operation on a Binary Tree- Types of Binary Trees-Binary Search Tree, Heap Trees,
AVL Trees, Red black trees

Page 43 of 121
 R18 B.Tech - CSE

UNIT-IV
Graphs: Introduction- Graph terminologies- Representation of graphs, Graph traversal
techniques, Applications of Graph Structures: map colouring, Dijkstra‟s technique,
topological sorting.
Searching:
Linear Search, Binary Search, Hash based searching: Hashing Techniques,
Collision Resolution Techniques: Closed Hashing, Open Hashing.

UNIT-V
Sorting: Sorting Techniques: Sorting by Insertion: Straight Insertion sort- List insertion sort-
Sorting by selection: Straight selection sort- Heap Sort- Sorting by Exchange: bubble sort,
Shell Sort- Quick Sort, merge sort technique

TEXT BOOKS:

1. “Classic Data Structures”, Second Edition by Debasis Samanta, PHI.

2. “Data Structures A Pseudo code Approach with C”, Second Edition by Richard
F. Gilberg, Behrouz A. Forouzan, Cengage Learning.

REFERENCE BOOKS:

1. Fundamentals of Data Structures in C – Horowitz, Sahni, Anderson-

Freed, Universities Press, Second Edition.
2. Schaum‟ Outlines – Data Structures – Seymour Lipschutz – McGrawHill-
Revised First Edition.

Page 44 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – I Sem.
3 - - 3

(18CS0505) COMPUTER ORGANIZATION & ARCHITECTURE

Architecture Course Objectives:
To expose the students to the following:
 How Computer Systems work & the basic principles
 Instruction Level Architecture and Instruction Execution
 The current state of art in memory system design
 How I/O devices are accessed and its principles.
 To provide the knowledge on Instruction Level Parallelism
 To impart the knowledge on micro programming
 Concepts of advanced pipelining techniques.

Course outcomes:
 Draw the functional block diagram of a single bus architecture of a computer and
describe the function of the instruction execution cycle, RTL interpretation of
instructions, addressing modes, instruction set.
 Write assembly language program for specified microprocessor for computing 16 bit
multiplication, division and I/O device interface (ADC, Control circuit, serial port
communication).
 Write a flowchart for Concurrent access to memory and cache coherency in
Parallel Processors and describe the process.
 Given a CPU organization and instruction, design a memory module and analyze
its operation by interfacing with the CPU.
 Given a CPU organization, assess its performance, and apply design techniques
to enhance performance using pipelining, parallelism and RISC methodology

UNIT - I
Functional blocks of a computer: CPU, memory, input-output subsystems, control unit.
Basic operational concepts - Bus Structures - Instruction set architecture of a CPU –
registers, instruction execution cycle, addressing modes, instruction set, Data Transfer, Data
Manipulation and Program Control.

UNIT – II
Data Representation: signed number representation, fixed and floating point
representations, character representation. Computer arithmetic – integer addition and
subtraction, ripple carry adder, carry look-ahead adder, etc. multiplication – shift-and add,
Booth multiplier, carry save multiplier, etc. Division restoring and non-restoring techniques,
floating point arithmetic.

Page 45 of 121
 R18 B.Tech - CSE
UNIT - III
Basic Processing Unit: RTL interpretation of instructions - Register Transfer -Bus
and Memory Transfers -Arithmetic Micro operations-Logic Micro operations -Shift
Micro operations
CPU control unit design: hardwired and micro-programmed design approaches.
Address Sequencing

UNIT – IV
Memory organization:Concept of hierarchical memory organization, semiconductor
memory technologies – Secondary memories.Virtual Memory, Cache memory, mapping
functions, replacement algorithms, write policies.
Peripheral devices and their characteristics: Input-output subsystems, I/O
deviceinterface, I/O transfers –interrupt driven and DMA,

UNIT - V
Pipelining: Basic concepts of pipelining, throughput and speedup, instruction hazards
Parallel Processors: Introduction to parallel processors, Multiprocessor –Inter
Connection Structures- Concurrent access to memoryand cache coherency.

TEXT BOOKS:

1. “Computer Organization and Design: The Hardware/Software Interface”, 5th

Edition by David A. Patterson and John L. Hennessy, Elsevier.
2. “Computer Organization and Embedded Systems”, 6th Edition by Carl
Hamacher, McGraw Hill Higher Education.

REFERENCE BOOKS:

1. “Computer Architecture and Organization”, 3rd Edition by John P. Hayes,

WCB/McGraw- Hill
2. “Computer Organization and Architecture: Designing for Performance”, 10th
Edition by William Stallings, Pearson Education.
3. “Computer System Design and Architecture”, 2nd Edition by Vincent P.
Heuring and Harry F. Jordan, Pearson Education.

Page 46 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – I Sem.
3 - - 3

(18CS0506) DATABASE MANAGEMENT SYSTEMS

Course Objectives:
To understand the different issues involved in the design and implementation of
a database system.
To study the physical and logical database designs, database modeling,
relational, hierarchical, and network models
To understand and use data manipulation language to query, update, and manage
a database
To design and build a simple database system and demonstrate competence with
the fundamental tasks involved with modeling, designing, and implementing a
DBMS.
Course Outcomes:
For a given query write relational algebra expressions for that query and optimize
the developed expressions
For a given specification of the requirement design the databases using E_R
method and normalization.
For a given transaction-processing system, determine the transaction
atomicity, consistency, isolation, and durability.
Implement the isolation property, including locking, time stamping based
on concurrency control and Serializability of scheduling.

UNIT- I
Introduction: Database System Applications, Purpose of Database Systems, View of Data -
Data Abstraction, Data Independence , Data Models, Database Languages - DDL, DML,
Database Architecture, Database Users and Administrators.
Introduction to Data base design: ER diagrams, Entities, Attributes and Entity sets,
Relationships and Relationship sets, Conceptual Design with the ER Model.
Relational Model:Integrity Constraints over Relations, Logical data base Design,
Introduction to Views Destroying/ altering Tables and Views.

UNIT- II
Relational Algebra and Calculus: Relational Algebra - Selection and Projection, Set
operations, Renaming, Joins, Division, Examples of Algebra Queries, Relational calculus -
Tuple relational Calculus - Domain relational calculus.
Form of Basic SQL Query- Examples of Basic SQL Queries, Introduction to Nested
Queries, Correlated Nested Queries, Set - Comparison Operators, Aggregate Operators,
NULL values - Comparison using Null values - Logical connectives - AND, OR and NOT -
Outer Joins, Triggers.
Page 47 of 121
 R18 B.Tech - CSE

UNIT -III
Introduction to Schema Refinement- Problems Caused by redundancy, Functional
Dependencies, Armstrong‟s axioms, Normal Forms - FIRST, SECOND, THIRD Normal
forms - BCNF - Properties of Decompositions- Loss less join Decomposition, Dependency
preserving Decomposition - FOURTH Normal Form, FIFTH Normal form.

UNIT- IV
Transaction Management: Transaction Concept, Transaction State, ACID
Property, Serializability, Recoverability.
Concurrency Control: Lock - Based Protocols, Timestamp Based Protocols, Validation
- Based Protocols, Multiple Granularity.
Recovery System: Log - Based Recovery, Buffer Management, Remote Backup systems.

UNIT- V
Storage strategies and Indexing: RAID Levels, Indices.
Tree Structured Indexing: Indexed Sequential Access Methods (ISAM) B+ Trees:
Search, Insert, Delete.
Hash Based Indexing: Static Hashing, Extendable hashing, Linear Hashing, Extendible
vs. Linear Hashing.
Database Security: Authentication, Authorization and access control, DAC, MAC
and RBAC models

TEXT BOOKS:

1. Database Management Systems, Raghurama Krishnan, Johannes

Gehrke, McGrawHill Education, 3rd Edition, 2003.
2. Data base System Concepts, A.Silberschatz, H.F. Korth, S.Sudarshan,
McGraw Hill, VI edition, 2006.

REFERENCE BOOKS:

1. Database Systems, 6th edition, RamezElmasri, Shamkat B. Navathe,

Pearson Education, 2013.
2. “Principles of Database and Knowledge – Base Systems”, Vol 1 by J. D.
Ullman, Computer Science Press.
3. Database Systems Concepts, Peter Rob & Carlos Coronel, Cengage
Learning, 2008. 4.Introduction to Database Systems, C.J. Date, Pearson
Education.
4. Database Management Systems, G.K. Gupta, McGrawHillEducation.
5. “Foundations of Databases”, Reprint by Serge Abiteboul, Richard Hull,
Victor Vianu, Addison-Wesley

Page 48 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – I Sem.
- - 3 1.5

(18CS0507) DATA STRUCTURES & ALGORITHMS LAB

1. Write a program to perform the operations insertion, deletion, and traversing an array

2. Write a program to perform the operations creation, insertion, deletion, and

traversing a Singly linked list.

3. Write a program to perform the operations creation, insertion, deletion, and

traversing a Doubly linked list.

4. Write a program to implement stack using arrays and linked lists.

5. Write a program to convert infix expression to postfix expression

6. Write a program to implement queue using arrays and linked lists.

7. Write a program to implement circular queue using arrays

8. Write a program to implement Binary Tree

9. Write a program to perform different operations on Binary Search Trees

10. Write a program to implement depth first search and breadth first search on graphs.

11. A)Write a program to perform Linear Search on the elements of a given array

B) Write a program to perform Binary Search on the elements of a given array

12. Write a program to perform Hash Based Searching.

13. Write a program to sort the elements of an array using Selection Sort.

14. Write a program to sort numbers using insertion sort.

15. Write a program to implement quick sort using non-recursive function

REFERENCE BOOKS:
1. Fundamentals of Data Structures in C – Horowitz, Sahni, Anderson-Freed,
Universities Press, Second Edition.
2. Schaum‟ Outlines – Data Structures – Seymour Lipschutz – McGrawHill-
Revised First Edition.

Page 49 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – I Sem.
- - 3 1.5

(18CS0508) DATABASE MANAGEMENT SYSTEMS LAB

Course Objective:
 To know the components of DBMS.
 To understand design of ER Diagrams and represent using Relational model.
 To understand the concept of normal forms in the design of databases.
 To Understand representation of retrieval of data using relational algebra and calculus.

Course Outcome:
Apply ER concepts to design databases.
 Design simple database using a tool and implement it using SQL.
 Access normalization relations of relational model using normal forms
 Apply all constrains to develop a business application using cursors, triggers and stored

LIST OF EXPERIMENTS:

1. Practice session: Students should be allowed to choose appropriate DBMS software,

install it, configure it and start working on it. Create sample tables, execute some
queries, use SQLPLUS features, use PL/SQL features like cursors on sample
database. Students should be permitted to practice appropriate User interface creation
tool and Report generation tool.

2. A college consists of number of employees working in different departments. In this

context, create two tables employee and department. Employee consists of columns
empno, empname, basic, hra, da, deductions, gross, net, date-of-birth. The
calculation of hra, da are as per the rules of the college. Initially only empno,
empname, basic have valid values. Other values are to be computed and updated
later. Department contains deptno, deptname, and description columns. Deptno is the
primarykey in department table and referential integrity constraint exists between
employee and department tables.

Perform the following operations on the database:

 Create tables department and employee with required constraints.
 Initially only the few columns(essential) are to be added. Add the
remaining columns separately by using appropriate SQL command
 Basic column should not be null
 Add constraint that basic should not be less than 5000.
 Calculate hra, da, gross and net by using PL/SQL program.

Page 50 of 121
 R18 B.Tech - CSE

 Whenever salary is updated and its value becomes less than5000 a trigger has to
be raised preventing the operation.
 The assertions are: hra should not be less than 10% of basic and da should not
be less than 50% of basic.
 The percentage of hra and da are to be stored separately.
 When the da becomes more than 100%, a message has to be generated
and with user permission da has to be merged with basic.
 Empno should be unique and has to be generated automatically.
 If the employee is going to retire in a particular month, automatically a
message has to be generated.
 The default value for date-of-birth is1jan, 1970.
 When the employees called daily-wagers are to be added the constraint that salary
should be greater than or equal to5000 should be dropped. • Display the information
of the employees and departments with description of the fields.
 Display the average salary of all the departments.
 Display the average salary department wise.
 Display the maximum salary of each department and also all departments put together.
 Commit the changes whenever required and rollback if necessary.
 Use substitution variables to insert values repeatedly.
 Assume some of the employees have given wrong information about date-of-
birth. Update the corresponding tables to change the value.
 Find the employees whose salary is between 5000 and 10000 but not exactly 7500.
• Find the employees whose name contains „en‟.
 Try to delete a particular deptno. What happens if there are employees in it and
if there are no employees.
 Create alias for columns and use them in queries.
 List the employees according to ascending order of salary.
 List the employees according to ascending order of salary in each department.
 Use„&&‟wherever necessary
 Amount 6000 has to be deducted as CM relief fund in a particular month which has
to be accepted as input from the user. Whenever the salary becomes negative it has
to be maintained as1000 and the deduction amount for those employees is reduced
appropriately.
 The retirement age is 60 years. Display the retirement day of all the employees.
 If salary of all the employees is increased by 10% every year, what is the salary
of all the employees at retirement time.
 Find the employees who are born in leap year.
 Find the employees who are born on feb 29.
 Find the departments where the salary of at least one employee is more than 20000.
 Find the departments where the salary of all the employees is less than 20000.
 On first January of every year a bonus of 10% has to be given to all the
employees. The amount has to be deducted equally in the next 5 months.
Write procedures for it.
 As a designer identify the views that may have to be supported and create views.

Page 51 of 121
 R18 B.Tech - CSE

 As a designer identify the PL/SQL procedures necessary and create the musing cursors.
 Use appropriate Visual programming tools like oracle forms and reports, visual
basic etc. to create user interface screens and generate reports.

Note: As a designer identifies other operations that may be required and add to the above list.

The above operations are not in order. Order them appropriately. Use SQL or PL/SQL depending
on the requirement.

3. Students may be divided in to batches and the following experiments may be given
to them to better understand the DBMS concepts. Students should gather the
required information, draw ER diagrams, map them to tables, normalize, create
tables, triggers, procedures, execute queries, create user interfaces, and generate
reports.

 Student information system

 APSRTC reservation system
 Hostel management
 Library management
 Indian Railways reservation
 Supermarket management
 Postal system
 Banking system
 Courier system
 Publishing house system

REFERENCES:

1. “Learning Oracle SQL and PL/SQL”, Rajeeb C. Chatterjee,PHI.

2. “Oracle Database11g PL/SQL Programming”,M.McLaughlin,TMH.
3. “Introduction to SQL”,RickF.VanderLans, Pearson education.

Page 52 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – I Sem.
- - 2 1

(18EE0241) BASIC ELECTRICAL & ELECTRONICS ENGINEERING LAB

Lab Course Objectives:

 To enhance the student with knowledge on electrical and electronic equipment‟s.

Course Outcomes:

 Students will understand all the fundamental concepts involving electrical engineering.
 Students will understand all the fundamental concepts involving electronics engineering.

PART – A
BASIC ELECTRICAL ENGINEERING LAB

1. Verification of Superposition Theorem.

2. Verification of Thevenin‟s Theorem.
3. Determination of Open circuit and Short circuit parameters
4. Swinburne‟s Test on DC Shunt Machine (Predetermination of
Efficiency of a Given DC Shunt Machine Working as Motor
and Generator).
5. Brake Test on DC Shunt Motor. Determination of Performance Characteristics.
6. OC & SC Tests on Single-Phase Transformer
(Predetermination of Efficiency and Regulation at
Given Power Factors).
PART – B

ELECTRONICS
LABORATORY
(Any Six Experiments)
1. P-N Junction Diode and Zener Diode Volt-Ampere Characteristics.
2. Bipolar Junction Transistor in CB Configuration-Input and
Output Characteristics, Computation of α.
3. Half-Wave Rectifier- a) Without Filter b) With Capacitor Filter.
4. Full-Wave Rectifier- a) Without Filter b) With Capacitor Filter.
5. Bipolar Junction Transistor in CE Configuration-Input and
Output Characteristics, Computation of β.
6. Junction field effect Transistor in Common Source
Configuration Output and Transfer Characteristics.
7. Verification of Logic Gates- AND, OR, NOT, NAND, NOR, EX-OR, EX-NOR.

Page 53 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – I Sem.
3 - - -

(18HS0816) INDIAN CONSTITUTION

(NON-CREDIT COURSE)
Course Objectives:
Students will be able to:
Understand the premises informing the twin themes of liberty and freedom
from a civil rights perspective.
To address the growth of Indian opinion regarding modern Indian
intellectuals‟ constitutional role and entitlement to civil and economic
rights as well as the emergence of nationhood in the early years of Indian
nationalism.
To address the role of socialism in India after the commencement of the
Bolshevik Revolution in 1917 and its impact on the initial drafting of the
Indian Constitution.

Course Outcomes:
Students will be able to:
Discuss the growth of the demand for civil rights in India for the bulk of
Indians before the arrival of Gandhi in Indian politics.
Discuss the intellectual origins of the framework of argument that
informed the conceptualization of social reforms leading to revolution
in India.
Discuss the circumstances surrounding the foundation of the Congress Socialist
Party [CSP] under the leadership of Jawaharlal Nehru and the eventual failure of
the proposal of direct elections through adult suffrage in the Indian Constitution.
Discuss the passage of the Hindu Code Bill of 1956.

UNIT-I
Meaning of the Constitution Law

UNIT-II
Historical Perspective of the Constitution of India
Salient features and characteristics of the Constitution of India

UNIT-III
Scheme of the fundamental rights
The scheme of the Fundamental Duties and its legal status
The Directive Principles of State Policy – Its importance and implementation
Federal structure and distribution of legislative and financial
powers between the Union and the States .

Page 54 of 121
 R18 B.Tech - CSE

UNIT-IV
Parliamentary Form of Government in India – The constitution powers
and status of the President of India.
Amendment of the Constitutional Powers and Procedure.
The historical perspectives of the constitutional amendments in India.
Emergency Provisions : National Emergency, President Rule, Financial Emergency

UNIT-V
Local Self Government – Constitutional Scheme in India.
Scheme of the Fundamental Right to Equality.
Scheme of the Fundamental Right to certain Freedom under Article 19
Scope of the Right to Life and Personal Liberty under Article 21

TEXT BOOKS:

1. The Constitution of India, 1950 (Bare Act), Government Publication.

2. Dr. S. N. Busi, Dr. B. R. Ambedkar framing of Indian Constitution, 1st Edition, 2015,

REFERENCE BOOKS:

1. M. P. Jain, Indian Constitution Law, 7th Edn., Lexis Nexis, 2014.

D.D. Basu, Introduction to the Constitution of India, Lexis Nexis,
2015.

Page 55 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – II Sem.
3 - - 3

(18HS0836) DISCRETE MATHEMATICS

(Common to CSE and CSIT)
Course Objectives:
 To train the students thoroughly in Mathematical concepts of Mathematical logic,
Relations, Algebraic structures, Recurrence Relation, Graph Theory.
 To prepare students for lifelong learning and successful careers using Mathematical
concepts of Mathematical logic, Relations, Algebraic structures, Recurrence Relation,
Graph Theory.
 To develop the skill pertinent to the practice of the Mathematical concepts including
the students‟ abilities to formulate and modeling the problems, to think creatively and
to synthesize information.

Course Outcomes:

At the end of the course, students would be expected to:

 Have acquired ability to participate effectively in group discussions

 Have developed ability in writing in various contexts
 Have acquired a proper level of competence for employability

UNIT-I
Mathematical Logic: Statements and notations, Connectives, Well-formed formulas, Truth
Tables, tautology, equivalence implication, Normal forms, Quantifiers, universal quantifiers
Predicates: Predicative logic, Free & Bound variables, Rules of inference, Consistency, proof
of Contradiction, Automatic Theorem Proving.

UNIT-II
Relations: Properties of Binary Relations, equivalence, transitive closure, compatibility and
partial ordering relations, Functions: Inverse Function, Composition of functions, recursive
Functions
Algebraic structures: Algebraic systems examples and general properties, Semi groups
and monads, groups, sub groups homomorphism, Isomorphism.

UNIT-III
Elementary Combinatories: Basis of counting, Enumerating Combinations &
Permutations, with repetitions, Constrained repetitions, Binomial Coefficients, Binomial
Multinomial theorems, the principles of Inclusion – Exclusion. Pigeon hole principles and its
application

Page 56 of 121
 R18 B.Tech - CSE

UNIT-IV
Recurrence Relation: Generating Functions & Sequences , Calculating Coefficient of
generating function, Recurrence relations, Solving Recurrence relation by substitution and
Generating functions. Characteristic roots, solution of Inhomogeneous Recurrence Relation.

UNIT-V
Graph Theory: Representation of Graph, DFS, BFS, Spanning Trees, planar Graphs, Graph
Theory Applications: Basic Concepts Isomorphism and Sub graphs, Multi graphs and Euler
circuits, Hamiltonian graphs, Chromatic Numbers

TEXT BOOKS:
1. Discrete Mathematics with Applications, Thomas Koshy, Elsevier.
2. Discrete Mathematics and its applications, 6th edition, K.H.Rosen, TMH.

REFERENCES:
1. Elements of Discrete Mathematics- A Computer Oriented Approach, C.L.Liu,
D.P. Mohapatra, 3/e,TMH.
2. Discrete Mathematics for Computer Scientists & Mathematicians, 2/e,
J.L.Mott, Kandel, T.P. Baker, PHI
3. Discrete Mathematical Structures with Application to Computer Science,
Tremblay, Manohar McGraw Hill Publication
4. Discrete and Combinatorial Mathematics- An Applied Introduction,
Ralph. P.Grimaldi, 5/e, Pearson Education
5. Discrete Mathematical Structures, Mallik and Sen, Cengage Learning.
6. Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby, Sharon
Cutler Ross, PHI/ Pearson Education
7. Discrete Mathematics, Lovasz, Springer.

Page 57 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – II Sem.
3 1 - 4

(18CS0509) FORMAL LANGUAGES AND AUTOMATA THEORY

Course Objectives:
 Understand formal definitions of machine models.
 Classify machines by their power to recognize languages andunderstanding of formal grammars,
analysis.
 Understanding of hierarchical organization of problems depending on their complexity.
 Understanding of the logical limits to computational capacity.
 Understanding of decidable andundecidableproblems.

Course Outcomes:
At the end of the course, students will be able to
 Construct finite Automats for various problems.
 Design automata, regular expressions and context-free grammar accepting and generating a certain
language, design of new grammar and languages
 Define Push Down Automata performing simple tasks and equivalence of PDA and CFGs.
 Find solutions to the problems using Turing machines.
 Distinguish between computability , Decidability and un decidability problems

UNIT-I
Introduction: Basics of set theory, Relations on sets,Alphabet, languages and grammars, Chomsky
hierarchy of languages.
Finite Automata: Automata theory, Characteristics of Automata, Graphical notation of FA, DFA and
NFA, Conversion of an NFA to DFA,NFA with є(null)Move, Equivalence of DFA and NFA, Finite
Automata with Output, Conversion from Moore to Mealy and Mealy to Moore Machine , Minimization
of Finite Automata, Myhill-Nerode Theorem, Applications and Limitations FA.

UNIT-II
Regular Languages: Basics of Regular Expressions, Identities of Regular Expression, The Arden’s
Theorem, Construct RE from FA, Equivalence of Two FAs, Equivalence of Two REs, Regular grammars
and equivalence with finite automata, Pumping Lemma for RLs, Applications of Pumping Lemma,
Closure properties of Regular Sets, Applications of Regular Expressions.

UNIT-III
Context Free Grammar: Context-free grammars (CFG) , Derivation trees, Ambiguity in CFG , Left
recursion and Left factoring, Simplification of CFGs, Chomsky Normal form and Greibach Normal
form, Pumping lemma for Context-free languages, closure properties of CFLs.

UNIT-IV
Push Down Automata (PDA):The Formal Definition, Graphical notation, Instantaneous description,
Page 58 of 121
 R18 B.Tech - CSE

The Languages of a PDA, Equivalence of PDAs and CFGs, Deterministic Push Down Automata, Non-
Deterministic Push Down Automata.

UNIT-V
Turing Machines and Undecidability: The basic model of Turing machines (TM), Instantaneous
Description , Variants of Turing Machines, Conversion from RE to TM, LBA, Universal Turing
Machine, Turing Reducibility, PCP, MPCP.

Text books:
1. Introduction to Automata Theory, Formal Languages and Computation, Shyamalendukandar,
Pearson.
2. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata Theory,
Languages, and Computation, Pearson Education Asia.
Reference books:
1. Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation, Pearson
Education Asia.
2. Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer Science,Springer.
3. Michael Sipser, Introduction to the Theory of Computation, PWSPublishing.
4. John Martin, Introduction to Languages and The Theory of Computation, TataMcGraw Hill.

Page 59 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – II Sem.
3 - - 3

(18CS0510) OPERATING SYSTEMS

Course Objectives:
 To make the students understand the basic operating system concepts such as
processes, threads, scheduling, synchronization, deadlocks, memory management,
file and protection.
 To get acquaintance with the class of abstractions afford by general purpose
operating systems that aid the development of user applications.

Course Outcomes:
 Able to use operating systems effectively.
 Create processes and threads.
 Develop algorithms for process scheduling for a given specification of
CPU utilization, Throughput, Turnaround Time, Waiting Time, Response
Time.
 For a given specification of memory organization develop the techniques for
optimally allocating memory to processes by increasing memory utilization and for
improving the access time.
 Design and implement file management system.

UNIT I
Operating Systems Overview: What is an operating system, history of operating systems,
Operating system functions, Operating systems Operations, Types of Operating Systems,
Computing Environments.
System Structures: Operating System Services, User and Operating-System Interface,
systems calls, Types of System Calls, system programs, Structure of an OS - Layered,
Monolithic, Microkernel Operating Systems, Concept of Virtual Machine. Case study on
UNIX and WINDOWS Operating System.

UNIT II
Processes: Definition, Process Relationship, Different states of a Process, Process State
transitions, Process Control Block (PCB), Context switching.
Processes Scheduling: Foundation and Scheduling objectives, Types of Schedulers,
Scheduling criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time,
Response Time; Scheduling algorithms: Pre-emptive and Non pre-emptive, FCFS, SJF, RR;
Multiprocessor scheduling.
Threads: Definition, Various states, Benefits of threads, Types of threads, Concept of
multithreads.

Page 60 of 121
 R18 B.Tech - CSE

UNIT III
Process Synchronization: Inter process Communication, Critical Section, Race Conditions,
Mutual Exclusion, Hardware Solution, Strict Alternation, Peterson‟s Solution, The Producer-
Consumer Problem, Semaphores, Monitors, Message Passing, Classical IPC Problems:
Reader‟s & Writer Problem, Dinning Philosopher Problem

Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock

Prevention, Deadlock Avoidance: Banker‟s algorithm, Deadlock detection and Recovery.

UNIT IV
Memory Management: Basic concept, Logical and Physical address map, Memory
allocation: Contiguous Memory allocation – Fixed and variable partition– Internal and
External fragmentation and Compaction, Paging, Segmentation.
Virtual memory: Basics of Virtual Memory ,Demand paging, page-replacement,
Page Replacement algorithms, Thrashing.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN.

UNIT V
File Management: Concept of File, Access methods, File types, File operation, Directory
structure, File System structure, Allocation methods (contiguous, linked, indexed), Free-
space management (bit vector, linked list, grouping), directory implementation (linear list,
hash table).
Protection & Security: Protection Mechanisms, Protection matrix, Authentication
Techniques, Threats, intruders, Basics of Cryptography-Secret key, public key, One-Way
Function, Digital Signature.

TEXT BOOKS:
1. Operating System Concepts, Abraham Silberchatz, Peter B. Galvin, Greg Gagne,
Wiley , Eight Edition,
2. Modern Operating Systems, Andrew S Tanenbaum, 3rd edition, Pearson
Education International

REFERENCE BOOKS:
1. Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley,
Irwin Publishing
2. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt,
Addison- Wesley
3. Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall
of India
4. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati,
O'Reilly and Associates

Page 61 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – I Sem.
3 - - 3

(18HS0803) BIOLOGY FOR ENGINEERS

(Common to all Branches)
Course Objectives

 Describe how biological observations of 18th Century that lead to major

discoveries.
 Convey that classification per se is not what biology is all about but highlight the
underlying criteria, such as morphological, biochemical and ecological
 Highlight the concepts of recessiveness and dominance during the passage of genetic
material from parent to offspring
 Convey that all forms of life have the same building blocks and yet the manifestations
are as diverse as one can imagine
Course Outcomes

 Classify enzymes and distinguish between different mechanisms of enzyme action.

 Identify DNA as a genetic material in the molecular basis of information transfer.
 Analyse biological processes at the reductionistic level
 Apply thermodynamic principles to biological systems.
 Identify and classify microorganisms.

UNIT I
INTRODUCTION & CLASSIFICATIONS OF ORGANISMS
Introduction - classification based on (a) cellularity- Unicellular or multicellular
(b) ultrastructure - prokaryotes or eucaryotes. (c) energy and Carbon utilisation -Autotrophs,
heterotrophs, lithotropes (d) Ammonia excretion – aminotelic, uricoteliec,
ureotelic
(e) Habitata- acquatic or terrestrial (f) Molecular taxonomy- three major kingdoms of
life.Model organisms - study of different groups - E.coli, S.cerevisiae, D. Melanogaster, C.
elegance, A. Thaliana, M. musculus.

Page 62 of 121
 R18 B.Tech - CSE

UNIT II
GENETICS PURPOSE
Concept of allele.Gene mapping, Gene interaction, Epistasis. Meiosis- Concepts of
recessiveness and dominance - Concept of mapping of phenotype to genes - single gene
disorders in humans - Complementation in human genetics.

UNIT III
BIOMOLECULES PURPOSE & ENZYMES PURPOSE
Building blocks of Molecules of life&it‟s types.Introduction & Concepts- Monomer units
and polymeric structures,Sugars, starch, cellulose, Amino acids, proteins, Nucleotides,
DNA/RNA, Two carbon units and lipids.
Role of catalysis life in existed on earth Enzymology: Enzyme classification. Mechanism of
enzyme action. Enzyme kinetics and kinetic parameters related to Biology.RNA catalysis.
Classifications and Procedure for Enzyme catalysed reactions with two examples.

UNIT IV

INFORMATION TRANSFER PURPOSE & MACROMOLECULAR

ANALYSIS PURPOSE

Molecular basis of coding and decoding genetic information is universal Molecular basis of
information transfer. Genetic material of DNA, Hierarchy of DNA structure- from single
stranded to double helix to nucleosomes. Introduction and Explanation of genetic codeand
degeneracy of genetic code.Gene - complementation and recombination.

Biological processes at the reductionist level Proteins- structure and function. Hierarch in
protein structure.Primary secondary, tertiary and quaternary structure.Proteins as enzymes,
transporters, receptors and structural elements.

UNIT V
METABOLISM PURPOSE
The principles of energy transactions - in physical and biological world. Thermodynamics
as applied to biological systems. Exothermic and endothermic versus endergonic and
exergoinc reactions.Concept of Keq and its relation to standard free energy.Spontaneity.ATP
as an energy currency- including breakdown of glucose to CO2 + H2O (Glycolysis and
Krebs cycle) and synthesis of glucose from CO2 and H2O (Photosynthesis).Energy yielding
and energy consuming reactions.
Microbiology -single celled organisms -species and strains.Identification and classification
of microorganisms. Microscopy.Ecological aspects of single celled organisms.Sterilization
and media compositions.Growth kinetics.

Page 63 of 121
 R18 B.Tech - CSE

TEXT BOOKS:

1. Biology: A global approach: Campbell, N. A.; Reece, J. B.; Urry, Lisa; Cain, M, L.;
Wasserman, S. A.; Minorsky, P. V.; Jackson, R. B. Pearson Education Ltd
2. Outlines of Biochemistry, Conn, E.E; Stumpf, P.K; Bruening, G; Doi, R.H.John Wiley
and Sons
3. Principles of Biochemistry (V Edition), By Nelson, D. L.; and Cox, M. M.W.H. Freeman
and Company
4. Molecular Genetics (Second edition), Stent, G. S.; and Calender, R. W.H. Freeman and
company, Distributed by Satish Kumar Jain for CBS Publisher
5. Microbiology, Prescott, L.M J.P. Harley and C.A. Klein 1995. 2nd edition Wm, C. Brown

Page 64 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – II Sem.
3 - - 3

(18CS0511) OBJECT ORIENTED PROGRAMMING

Course Objectives:
The course will introduce standard tools and techniques for software development, using
object oriented approach, use of a version control system, an automated build process, an
appropriate framework for automated unit and integration tests

Course Outcomes: After taking the course, students will be able to:
 Specify simple abstract data types and design implementations, using
abstraction functions to document them.
 Recognize features of object-oriented design such as encapsulation,
polymorphism, inheritance, and composition of systems based on object identity.
 Name and apply some common object-oriented design patterns and give examples
of their use.
 Design applications with an event-driven graphical user interface.
 Develop applications to connect with database.

UNIT- I
The Java Language - Importance of Java- Programming Paradigms-The History and
Evolution of Java–Security-Portability-Java Byte Code-The Java Buzzwords - An Overview
of Java-Overview of JShell-Data Types-Java Tokens-Operators–Lambda Expression-Java
Statements-Type Casting-Arrays.

UNIT- II String
Introducing Classes - Class Fundamentals -Declaring Objects - Introducing Methods
Constructors - Garbage Collection -Understanding static - Introducing final - Command line
arguments -Varargs - Inheritance -Using Super - Method Overriding - Dynamic Method
Dispatch- abstract classes - Packages and Interfaces.

UNIT- III
Exception Handling - Exception Fundamentals - Exception Types -Uncaught Exceptions -
Using try and catch - Nested try Statements -throw -throws -finally - Java‟s Built-in
Exceptions -Creating Your Own Exception Subclasses - Chained Exceptions
Multithreaded Programming - The Java Thread Model -Thread Priorities - The Thread
Class and the Runnable Interface - Creating Multiple Threads -Using isAlive( ) and join( ) –
Thread Priorities, Synchronization- Handling.

Page 65 of 121
 R18 B.Tech - CSE

UNIT- IV
Generics-A simple Generic Example-General form of Generic class-Generic Interfaces
Collection Framework-Collections overview, Collection class, Collection interfaces.
The Applet Class - Event Handling -Two Event Handling Mechanism - The Delegation
Event Model - Event Classes -Source of Events -Event Listener Interfaces.

UNIT- V
Introducing the AWT - Using AWT Controls-Layout Managers and Menus Introducing
Swing -Exploring Swing.
Java.net package, basics of network programming, address ports, sockets, simple client
server program. Introduction to JDBC, java.sql package, JDBC architecture, Drivers,
Connections, Statement, Prepared Statement, Example Programs.

TEXT BOOKS:

1. The Complete Reference Java Eight Edition – Herbert Schildt – McGrawHill.

2. Introduction to Java programming – Y Daniel Liang – Que E & T.

REFERENCE BOOKS:

1. Java for Programmers, P.J. Deitel and H.M. Deitel, Pearson education
(OR) Java: How to Program P.J. Deitel and H.M. Deitel, PHI.
2. Thinking in Java, Bruce Eckel, Pearson Education

Page 66 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – II Sem.
- - 3 1.5

(18CS0512) OPERATING SYSTEMS LAB

1. Simulate the following CPU scheduling algorithms

a) Round Robin b) SJF c) FCFS d) Priority
2. Simulate producer and consumer problem
3. Simulate dining philosopher„s problem
4. Simulate Bankers Algorithm for Dead Lock Avoidance
5. Simulate MVT and MFT
6. Simulate Paging Technique of memory management
7. Simulate all page replacement algorithms
a) FIFO b) LRU c) Optimal
8. Simulate Disk Scheduling Algorithms
a) FCFS b) SSTF c) SCAN
9. Simulate all File allocation strategies
a) Sequential b) Indexed c) Linked
10. Simulate all File Organization Techniques
a. Single level directory b) Two level c) Hierarchical

REFERENCE BOOKS:

1. Operating System: A Design-oriented Approach, 1st Edition by Charles

Crowley, Irwin Publishing
2. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt,
Addison- Wesley.

Page 67 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – II Sem.
- - 3 1.5

(18CS0513) OBJECT ORIENTED PROGRAMMING LAB

1.a) Write a Java program to read and write different types of data through keyboard and display
them?
b) Write a java program to find maximum among three numbers.
c)How to working with JShell-opening JShell, Working with JShell.

2.a) Write a java program to find Factorial of given number.

b) Write a java program to find Fibonacci series of given number.

3.a) Write a java program to display prime number series up to N.

b) Write a java program to find the maximum and minimum of N array elements.
c)Write a java program to sort array elements using any sorting methods.

4.Create a class with the name “Dog” with properties(attributes) name, age, colour, gender
and create 3 objects to access those properties

5.Write java program to create a super class called Figure that receives the dimensions of two
dimensional objects. It also defines a method called area that computes the area of an object.
The program derives two subclasses from Figure. The first is Rectangle and second is
Triangle. Each of the sub class overridden area() so that it returns the area of a rectangle and a
triangle respectively.

6.a) Create a user(your) defined package and import it into a java program.
b) How to implement an interface in java program using your own example.

7.Write a Java program that prints all real and imaginary solutions to the quadratic equation ax2 +
bx + c = 0. Read in a, b, c and use the quadratic formula.

8.a) A simple Java program to illustrate Constructor Overloading.

b) Write a java program to method overloading

9.Use inheritance to create an exception super class called Exception A and exception sub class
Exception B and Exception C, where Exception B inherits from Exception A and Exception C
inherits from Exception B. Write a java program to demonstrate that the catch block for type
Exception A catches exception of type Exception B and Exception C

10. Write a Java program that creates three threads. First thread displays ―Good Morning,
every one second, the second thread displays Hello, every two seconds and the third
thread displays Welcome every three seconds.

11. Write a java program to accept a string from user and display number of vowels, consonants,
digits and special characters present in each of the words of the given text.
Page 68 of 121
 R18 B.Tech - CSE

12. How to create your own exception subclass and how to handle it.

13. Write a Java program that correctly implements producer consumer

problem using the concept of inter thread communication

14. a) Write a Java Program for waving a Flag using Applets and Threads.
b) Write a Java program to design Login Window using Applets.

15. A Simple Java program to show multiple type parameters in Java Generics.

16. a) Write a Java program for handling mouse events

b) Write a Java program to design simple calculator using Applet and
Event Handling

17. How to use swings to create frame and buttons in java program with your own
example.

18. Write a java JDBC program create a table student with properties name, register
number, mark1, mark2, mark3, mark4, mark5. Insert the values into the table by
using the java and display the information of the students at front end (Applet or
AWT or Swings).

TEXT BOOKS:
1. Java How to Program, Sixth Edition, H.M.Dietel and P.J.Dietel, Pearson
Education/PHI
2. Java The Complete Reference” by Herbert Schildt, TMH, 8th Edition

REFERENCE BOOKS:
1. Introduction to Java programming, Sixth edition, Y.Daniel Liang, Pearson Education
2. Programming in Java, Sachine
3. Big Java, 2nd edition, Cay Horstmann, Wiley Student Edition, Wiley
India Private Limited.
4. Introduction to Programming with Java, J.Dean&R.Dean, McGraw Hill

Page 69 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
II B. Tech – II Sem.
3 - - -

(18HS0804) ENVIRONMENTAL SCIENCES

(Common to all Branches)
(NON-CREDIT COURSE)

Course Objectives:

 Students have got an idea about the importance of pollution free air, water, soil
and food.
 They know about global environmental problems like Acid Rains, Global
Warming, Green House Effects, Ozone layer depletion.
 To understand the impacts of developmental activities and mitigation
measures along with the environmental policies and regulations.
 To recognize major concepts in environmental studies and demonstrate in-
depth understanding the environment.
Course Outcomes:
 Based on this course, the Engineering Student will be able to
understand/evaluate/develop technologies on the basis of Ecological principles and
environmental regulations along with Legislation, Laws and Policies which in turn
help in sustainable development.
 Take preventive measures to reduce air, water, soil pollutions and contaminants
in food.
 Effectively carry out waste disposal at individual level.
 Involve in preservation of natural resources.
UNIT- I
INTRODUCTION:
Definition, Scope and Importance-Need for Public Awareness
NATURAL RESOURCES: Classification of resources-Forest resources: Use and over-
exploitation, deforestation- Mining, dams and their effects on forests 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 –Energy resources:
Renewable and Non- Renewable sources of energy- Solar energy, Hydro electrical energy,
Wind energy, Nuclear energy, etc.

Page 70 of 121
 R18 B.Tech - CSE

UNIT-II
ECOSYSTEMS: Concept of an ecosystem– structural features of ecosystem- Producers,
Consumers and Decomposers–-Biogeochemical cycles- Ecological succession-Food chains,
food webs and ecological pyramids – Energy flow in the ecosystem-Types of ecosystems (a)
forest ecosystem (b) grassland ecosystem (c) desert ecosystem (d) aquatic ecosystems.

UNIT-III
BIODIVERSITY AND ITS CONSERVATION: Introduction, Definition, genetic, species
and ecosystem diversity, Bio-geographical classification of India, India as a Mega-diversity
Nation, Hot spots of biodiversity, Value of biodiversity, threats to biodiversity, endemic,
endangered and extinct species of India, In-Situ and Ex-situ conservation of biodiversity.

UNIT-IV
ENVIRONMENTAL POLLUTION AND GLOBAL ENVIRONMENTAL ISSUES:
Natural Disasters: Droughts, Floods, Cyclone, Landslides, Earthquake,
Pollution episodes: Air pollution, Water pollution, Land pollution, Noise pollution,
Automobile pollution and Nuclear pollution –Effects-Global warming, Acid Rain and Ozone
layer depletion and controlling measures.
Global Environmental Issues: Population Growth, Urbanizations, Land Management, Water
and Waste Water Management. Climate change and impacts on human environment
Solid Waste Management: causes, effects and control measures of Municipal solid wastes –
E-waste and management, Role of an individual in prevention of pollution – pollution case
studies.

UNIT-V
ENVIRONMENTAL LEGISLATION, LAWS, POLICIES FOR SUSTAINABLE
DEVELOPMENT: Environmental Legislation, Environmental Protection act – Air
Prevention and Control of Pollution act–Water Prevention and control of Pollution act–
Wildlife protection act – Forest conservation act – Municipal Solid Waste management,
International conventions/Protocols : Earth summit, Kyoto protocol and Montreal Protocol.
From Unsustainable to sustainable development, Role of NGO‟s for Sustainable
development, Concepts of Green belt development, Role of IT in Environment-Remote
Sensing and GIS methods for Sustainable development.
Field work- visit to a local area to document environmental assets-river forest grassland/hill,
mountain and polluted sites (urban/rural/industrial/Agriculture)- study simple ecosystems
(pond/river/hill slopes)

Page 71 of 121
 R18 B.Tech - CSE

TEXT BOOKS:
1. A.Kaushik and C.P.Kaushik, Environmental Sciences, 5 th edition, New age international
publishers, 2015.
2. Text Book of Environmental Science and Technology by M.Anji Reddy, BS Publications.

REFERENCES:
1. Anil Kumar and Arnab Kumar De, Environmental Studies, New Age International
Publishers, New Delhi, 3rd Edition 2015.
2. R.K. Trivedi, “Handbook of Environmental Laws, Rules, Guidelines, Compliances
andStandards”, Vol.I and II, Enviro Media.
3. Environmental Studies by Dr.K.Mukkanthi, S.Chand Publishers.
4. Rajagopalan.R, “Environmental Studies-From Crisis to Cure”, Oxford University
Press, 2005.
5. ErachBharucha, 2010 “Text Book of Environmental Studies”, University Grants
Commission, University Press (India) Pvt.Ltd., Hyderabad

E-learning resources:
1. http://nptel.ac.in/courses.php
2. http://jntuk-coeerd.

Page 72 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

L T P C
(AUTONOMOUS)
III B. Tech – I Sem. 3 - - 3

(18HS0812) MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS

COURSE OBJECTIVES
The Objectives of this course:
1. To familiarize the students with the concepts of microeconomics and make them understand
the concept of demand and supply analysis in business applications
2. To understand the pricing and output decisions under different market structures
3. To understand the basic financial statements and techniques of financial statement analysis

COURSE OUTCOMES (COs)

On successful completion of the course students will be able to
1. Understand the nature of managerial economics and the role of it in business firms
2. Identify the determinants of demand and apply cost analysis under different market
conditions
3. Integrate the concepts of price and output decisions of business firms
4. Appreciate the importance of market structures and implement appropriate price and
output decisions
5. To assess the financial statements of a firm and the financial performance of the firm
through the financial statements
6. To measure operating, investing and financial performance of a firm

UNIT-I
Introduction To Managerial Economics - Managerial Economics - Definition, nature and
scope – contemporary importance of Managerial Economics - Demand Analysis: Determinants-
Law of Demand - Elasticity of Demand. Significance –Types – measurement of elasticity of
demand - Demand forecasting- factors governing demand Forecasting- methods of demand
forecasting –Relationship of Managerial Economics with Financial Accounting and
Management.

UNIT-II
Theory Of Production and Cost Analysis -Production Function – Short-run and long- run
production - Isoquants and Isocosts, MRTS, least cost Combination of inputs - Cobb-Douglas
production function - laws of returns - Internal and External Economies of scale.
Cost Analysis: Cost concepts - Break-Even Analysis (BEA) – Managerial Significance and
limitations of BEA - Determination of Break Even Point (Simple Problems).

Page 73 of 121
 R18 B.Tech - CSE

UNIT-III
Introduction to Markets and New Economic Environment - Market structures: Types of
Markets - Perfect and Imperfect Competition - Features, Oligopoly -Monopolistic
competition. Price-Output determination - Pricing Methods and Strategies - New Economic
Environment- Economic systems – Economic Liberalization – Privatization and
Globalization

UNIT-IV
Capital and Capital Budgeting - Concept of Capital - Over and under capitalization –
Remedial measures - Sources of Short term and Long term capital - Estimating Working
Capital requirement – Capital budgeting – Features of Capital Budgeting proposals –
Methods and Evaluation of Capital budgeting – Pay Back Method – Accounting Rate of
Return (ARR) – Net Present Value (NPV) – Internal Rate Return (IRR) Method (simple
problems)

UNIT-V
Introduction to Financial Accounting and Analysis - Financial Accounting – Concept -
emerging need and importance - Double-Entry Book Keeping-Journal - Ledger – Trial
Balance - Financial Statements - - Trading Account – Profit & Loss Account –Balance Sheet
(with simple adjustments). Financial Analysis – Ratios – Techniques – Liquidity, Leverage,
Profitability, and Activity Ratios (simple problems).

TEXT BOOKS:
1. Aryasri, Managerial Economics and Financial Analysis, 4/e, TMH,2009.
2. Varshney & Maheswari, Managerial Economics, Sultan Chand,2009.

REFERENCES:
1. PremchandBabu, Madan Mohan, Financial Accounting and Analysis,Himalaya,
2009
2. S.A. Siddiqui and A.S. Siddiqui, Managerial Economics and Financial
Analysis,New Age International,.2009.
3. Pearson Joseph G. Nellis and David Parker, Principles of Business Economics, 2/e,
New Delhi.
4. Domnick Salvatore, Managerial Economics in a Global Economy, Cengage,2009.
5. H.L.Ahuja, Managerial Economics, S.Chand, 3/e,2009

Page 74 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS) L T P C
III B. Tech – I Sem.
3 - - 3
(18CS0514) COMPILER DESIGN

COURSE OBJECTIVES
The objectives of this course:
1. Realize that computing science theory can be used as the basis for real applications
2. Introduce the major concept areas of language translation and compiler design.
3. Learn how a compiler works
4. Know about the powerful compiler generation tools and techniques, which are useful to
the other non-compiler applications
5. Know the importance of optimization and learn how to write programs that execute
faster

COURSE OUTCOMES (COs)

On successful completion of the course students will be able to
1. Specify and analyze the lexical, syntactic and semantic structures of advanced language
features
2. Separate the lexical, syntactic and semantic analysis into meaningful phases for a
compiler to undertake language translation
3. Write a scanner, parser, and semantic analyzer without the aid of automatic
generators
4. Turn fully processed source code for a novel language into machine code for a novel
computer
5. Implement techniques for intermediate code and machine code optimization
6. Design the structures and support required for compiling advanced language features.

UNIT- I
Introduction: Language processors, The Structure of a Compiler, Bootstrapping,
applications of compiler technology, Compiler Construction Tools.
Lexical Analysis: The Role of the lexical analyzer, Input Buffering, Specification of tokens,
Recognition of tokens, Lexical Analyzer generator - LEX

UNIT- II
Syntax Analysis: Role of the parser, Context Free Grammars - Definition, Derivations, Parse
trees, Ambiguity, Eliminating ambiguity, Left recursion, Left factoring.
Top Down Parsing: Recursive descent parsing, Non-recursive predictive parsing,LL(1)
grammars, Error recovery in predictive parsing.

Page 75 of 121
 R18 B.Tech - CSE

UNIT- III
Bottom Up Parsing: Handle pruning, Shift-Reduce parsing, SLR Parsing, Canonical LR(1)
parsers, LALR parsers, YACC tool.
Semantic Analysis: Syntax Directed Definition, SDT, Evaluation order of SDD, Type
Checking.

UNIT- IV
Run Time Environment: Storage organization- Static, Stack, Heap management,
Activation Records, Symbol Table Entries, operations on ST, Symbol Table organization
Intermediate Code Generation: Types of Intermediate code, three address code-
Quadruples, Triples, Indirect Triples, Type checking, control flow statements.

UNIT- V
Code Optimization: Principle source of optimization, function preserving
transformations, loop optimization, global data flow analysis, machine dependent
optimization
Code Generation: Issues in the design of a code generator, The Target Machine, Basic
Blocks and flow graphs, optimization on basic blocks, simple code generator, Register
allocation and Register assignment.

TEXT BOOKS:
1. Alfred V. Aho, Monica, S.Lam, RaviSethi, Jeffrey D. Ullman, Compilers Principles,
Techniques and Tools, Second Edition, Pearson.
2. K. Muneeswaran, Compiler Design, Oxford University Press, 2012

REFERENCES:
1. K. Muneeswaran, Compiler Design,Oxford University Press, 2012
2. Keith D. Cooper & Linda Torczon., K Morgan - Kaufmann, Engineering A Compiler,
Second Edition - ELSEVIER
3. Parag H. Dave, Himanshu B. Dave, Compilers Principles and Practice‖, PEARSON
4. Sandeep Saxena, Rajkumar Singh Rathore., Compiler Design, S.Chand publications
5. Santanu Chattopadhyay., Compiler Design, PHI
6. Nadhni Prasad, Principals of Compiler Design, Elsevier

Page 76 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – I Sem.
3 1 - 4

(18CS0515) COMPUTER NETWORKS

COURSE OBJECTIVES
The objectives of this course:
1. Introduce Computer network Reference Models
2. Explain various layers of a TCP/IP network reference model
3. Explain various protocols present in different layers of TCP/IP network reference model

COURSE OUTCOMES (COs)

On successful completion of this course, the student will be able to
1. Explain the terminology and concepts of OSI and TCP/IP Reference models and
identify different physical media used for datatransmission
2. Illustrate and implement the services of Data linklayer
3. Describetheprinciplesofnetworklayerandcategorize routingalgorithmsusedfor
data transmission
4. Identify the essential services of transportlayer
5. Interpret the functioning of various protocols of Applicationlayer
6. Understand the principles ofnetworking

UNIT – I
Introduction: Networks, Network criteria, Physical structures - Reference Models: The OSI
Reference Model, The TCP/IP Reference Model- Introduction to physical layer: Data and
Signals, Data rate limits, Performance.
Transmission Media: Introduction,-Guided Media, -Unguided Media

UNIT – II
Introduction to Data Link Layer: Introduction, Link layer addressing- Error detection and
Correction: Cyclic codes, Checksum, Forward error correction- Data link control: DLC
Services- Data link layer protocols, HDLC, Point to Point Protocol- Media Access control:-
Random Access -Controlled Access- Channelization

UNIT – III
The Network Layer: Network layer design issues- Routing algorithms - Congestion control
algorithms - Quality of service- Internetworking- The network layer in the Internet: IPV4 -
IPV6, Internet Control protocols- OSPF- BGP

UNIT – IV
The Transport Layer: The Transport Service- Elements of Transport Protocols- Congestion
Control- The internet transport protocols: UDP, TCP- Performance problems in computer
networks

UNIT – V
Introduction to Application Layer: Introduction, WWW and HTTP – FTP - E-mail-
TELNET - Secure Shell - Domain Name System - SNMP.
Page 77 of 121
 R18 B.Tech - CSE

TEXT BOOKS:
1. Behrouz A. Forouzan, “Data communications and networking” TMH, 5th edition, 2012.
2. Andrew S. Tanenbaum, David J Wetherall, “Computer Networks”, Pearson.5th edition,
2010.

REFERENCES:
1.Bhushan Trivedi, Data Communication and Networks, Oxford Publications
2. Douglas E.Comer, Internetworking with TCP/IP – Principles, protocols, and architecture,
Volume 1, 5th edition, PHI
3. Davie Peterson, Computer Networks, 5E, Elsevier.
4. Chawan- Hwa Wu, Irwin, Introduction to Computer Networks and Cyber Security,
CRC Publications.

Page 78 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – I Sem.
3 - - 3

(18CS0516) DESIGN AND ANALYSIS OF ALGORITHMS

COURSE OBJECTIVES
The objectives of this course:
1. Demonstrate the importance of algorithms in computing.
2. Explain the analysis of algorithms
3. Illustrate the method of finding the complexity of algorithms
4. Describe the advanced algorithm design and analysis techniques
5. Introduce special classes of algorithms NP completeness and the classes P &NP

COURSE OUTCOMES (COs)

On successful completion of this course, the student will be able to
1. Determine the time complexity of an algorithm by solving the corresponding Recurrence
equation
2. Apply the Divide and Conquer strategy to solve searching, sorting and matrix
multiplication problems.
3. Analyze the efficiency of Greedy and Dynamic Programming design techniques to solve
the optimization problems.
4. Apply Backtracking technique for solving constraint satisfaction problems.
5. Analyze the LC and FIFO branch and bound solutions for optimization problems, and
compare the time complexities with Dynamic Programming techniques.
6. Define and Classify deterministic and Non-deterministic algorithms; P, NP, NP –hard
and NP-complete classes of problems.

UNIT- I
Introduction: Algorithm, Pseudo code for expressing algorithms, Performance Analysis-
Space complexity, Time complexity, Order of growth, Asymptotic Notation-Big oh (O)
notation, Omega notation, Theta notation and Little oh (o) notation. Recurrences - Towers of
Hanoi.
Disjoint Sets -disjoint set operations, union and find algorithms.

UNIT- II
Basic Traversal and Search Techniques: Techniques for Binary Trees, Techniques for
Graphs, Connected Components and Spanning Trees.
Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort,
Strassen‘s matrix multiplication.

UNIT- III
Greedy method: General method, applications-Job sequencing with dead-lines, knapsack
problem, Minimum-cost spanning trees, Single source shortest path.
Dynamic Programming: General method, applications-Optimal binary search trees, 0/1
knapsack, All pairs shortest path, The Travelling sales person problem.
Page 79 of 121
 R18 B.Tech - CSE

UNIT- IV
Backtracking: General method, applications-8-queen problem, sum of subsets, graph
coloring, Hamiltonian cycles.
Branch and Bound: General method, Applications -Travelling sales person, 0/1 knapsack
problem - LC Branch and Bound solution, FIFO Branch and Bound solution.

UNIT- V
NP-Hard and NP-Complete problems: Basic concepts, nondeterministic algorithms, The
classes-NP-Hard and NP Complete, Cook‘s theorem, Reduction Source Problems,
Reductions: Reductions for some known problems.

TEXT BOOKS:
1. Ellis Horowitz,S. Satraj Sahni and Rajasekharam, Fundamentals of Computer Algorithms,
Galgotia Publications Pvt. Ltd., 4th Edition, 1998.
2. Parag Himanshu Dave, Himanshu Bhalchandra Dave,Design and Analysis Algorithms -
Pearson Education India, 2007.

REFERENCES:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition,
Pearson Education, 2012.
2. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein,
“Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012.
3. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and
Algorithms”, Pearson Education, Reprint 2006.
4. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson
Education, 2009.
5. Steven S. Skiena, Second Edition, “The Algorithm Design Manual”, Springer, 2008.

Page 80 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – I Sem.
3 - - 3

(18CS0517) PYTHON PROGRAMMING

COURSE OBJECTIVES
The objectives of this course:
1. Introduce Scripting Language
2. Exposure to various problem solving approaches of computer science
3. Introduce function-oriented programming paradigm
4. Exposure to solve the problems using object oriented concepts, exceptional handling
5. Exposure to solve the problems using Files, Regular Expressions and, Standard Libraries

COURSE OUTCOMES (COs)

On successful completion of this course, the student will be able to
1. Solve the problems using control structures, input and output statements.
2. Summarize the features of lists, tuples, dictionaries, strings and files
3. Experience the usage of standard libraries, objects, and modules
4. Solve the problems using Object Oriented Programming Concepts
5. Build the software for real time applications using python
6. Install various Python packages

UNIT – I
Introduction: History of Python- Python features- Applications-Programming Using the
REPL-Running Python Scripts-Variables – Assignment- Keywords- Input-Output-
Indentation.
Data Types: Single-Value data types - int, float, Complex and Boolean.
Multi-Valued Data types - Lists, Tuples, Sets, Dictionaries, Strings- indexing and slicing.

UNIT – II
Operators and Expressions: Operators-Arithmetic Operators, Comparison Operators,
Assignment Operators, Logical Operators, Bitwise Operators, Membership Operators,
Identity Operators- Expressions and order of evaluations
Control Flow: Branching- simple if, if-else, if-elif-else, nested if, looping-while and for-
jumping – break- continue and pass

UNIT – III
Functions: Defining Functions, Calling Functions, Passing Arguments, Keyword Arguments,
Default Arguments, Variable-length arguments, Anonymous Functions, Fruitful Functions-
Nested functions, Recursive functions- Scope of the Variables in a Function.
Object Oriented Programming in Python: Classes and Objects- self-variable- Methods –
Constructor- Inheritance-polymorphism- Method Overloading- Method Overriding.

UNIT – IV
Modules: Creating modules, import statement, from...import statement and name spacing.
Python packages: Introduction to PIP- Installing Packages via PIP (Numpy, Pandas,
MatPlotlib etc.,)- Using Python Packages.
Page 81 of 121
 R18 B.Tech - CSE

Exception Handling: Introduction to Errors and Exceptions, Handing Exceptions, Raising

Exceptions, User Defined Exceptions, Regular Expressions-Searching and Matching.

UNIT – V
Functional Programming: Iterators and Generators - Maps and Filters.
Files: Text files- Reading and Writing files- Command line arguments.
Brief Tour of the Standard Library: Dates and Times- Data Compression- Python Runtime
Services- Data Management and Object Persistence.
GUI Programming - Turtle Graphics

TEXT BOOKS:
1. Reema Thareja, Python Programming: Using Problem Solving Approach, First Edition,
Oxford University Press.
2. Vamsi Kurama, Python Programming: A Modern Approach, Pearson.

REFERENCES:
1. Mark Lutz , Learning Python, O Reily, 4th Edition, 2009.
2. Mark Lutz , Programming Python , O Reily, 4th Edition, 2010.
3. Tim Hall and J-P Stacey , Python 3 for Absolute Beginners, 2009.
4. Magnus Lie Hetland , Beginning Python: From Novice to Professional, 2nd Edition, 2009.
5. Michael T. Goodrich , Roberto Tamassia, Michael H. Goldwasser, Data Structures and
Algorithms in Python,1st Edition , Kindle.

Page 82 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – I Sem.
- - 3 1.5

(18CS0518) ANALYSIS OF ALGORITHMS LAB

COURSE OBJECTIVES
The Objectives of this course:
1. Analyze the asymptotic performance of algorithms.
2. Write rigorous correctness proofs for algorithms.
3. Demonstrate a familiarity with major algorithms and data structures.
4. Apply important algorithmic design paradigms and methods of analysis.
5. Synthesize efficient algorithms in common engineering design situations.

COURSE OUTCOMES (COs)

On successful completion of this course, the student will be able to
1. Able to understand the techniques of proof by contradiction, mathematical induction and
recurrence relation, and apply them to prove the correctness and to analyze the running
time of algorithms.
2. Design new algorithms, prove them correct, and analyze their asymptotic and absolute
runtime and memory demands.
3. Analyse an algorithm to solve the problem (create) and prove that the algorithm solves
the problem correctly (validate) .
4. Understand the mathematical criterion for deciding whether an algorithm is efficient, and
know many practically important problems that do not admit any efficient algorithms.
5. Understand basic techniques for designing algorithms, including the techniques of
recursion, divide-and-conquer, and greedy.
6. Analyse NP-Completeness , NP-complete problems and synthesize efficient algorithms
in common engineering design situations.

LIST OF EXPERIMENTS:
1. Obtain the Topological ordering of vertices in a given digraph.
2. Sort a given set of elements using the Quick sort method and determine the time
required to sort the elements.
3. Sort a given set of elements using the Merge sort method and determine the time
required to sort the elements.
4. Check whether a given graph is connected or not using DFS method.
5. Print all the nodes reachable from a given starting node in a directed graph using BFS
method
6. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
7. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's
algorithm.
7. Implement 0/1 Knapsack problem using Dynamic Programming.

Page 83 of 121
 R18 B.Tech - CSE

8. Write a program to implement Travelling Sales Person problem using Dynamic

programming.
9. From a given vertex in a weighted connected graph, find shortest paths to other vertices
using Dijkstra's algorithm.
10. Design and implement the presence of Hamiltonian Cycle in an undirected Graph G of
n vertices.

TEXT BOOKS:
1. Ellis Horowitz, S.Satraj Sahni and Rajasekharam, Fundamentals of Computer Algorithms,
Galgotia Publications Pvt. Ltd., 4th Edition, 1998.
2. Parag Himanshu Dave, Himanshu Bhalchandra Dave, Design and Analysis Algorithms,
Pearson Education India, 2007.

REFERENCES:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition,
Pearson Education, 2012.
2. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein,
“Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012.
3. Alfred V. Aho, John E. Hopcroft and Jeffrey D.Ullman, “Data Structures and
Algorithms”, Pearson Education.

Page 84 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
III B. Tech – I Sem. L T P C

- - 2 1
(18CS0519) PYTHON PROGRAMMING LAB
COURSE OBJECTIVES
The Objectives of this course:
1. Exposure to various problem solving approaches of computer science
2. Learn how to carry out a range of commonly used statistical methods including analysis
of variance and linear regression.
3. Explore data-sets to create testable hypotheses and identify appropriate statistical tests.

COURSE OUTCOMES (CO’s)

On successful completion of the course students will be able to
1. Write, Test and Debug Python Programs
2. Implement Conditionals and Loops for Python Programs
3. Use functions and represent Compound data using Lists, Tuples and Dictionaries
4. Read and write data from & to files in Python and develop Application using Pygame
5. Build software for real needs.
6. Ability to work on a real life Project, implementing R Analytics to create Business
insights.

LIST OF EXPERIMENTS:
1. Implement the following tasks
a) Write a python program to check whether the number is positive or negative.
b) Write a python program to find whether a given number is even or odd.
c) Write a python program to find biggest number among three numbers.
2. Implement the following tasks
a) Write a python program to displaying reversal of a number.
b) Write a python program to print factorial of a number
c) Write a python program to generate prime numbers series up to N
3. Implement following problems using python script
a)Swapping of two number with and without using temporary variable.
b) If the age of Ram, Sam, and Khan are input through the keyboard, write a python
program to determine the eldest and youngest of the three.
c) Arithmetic operations (Addition, Subtraction, Multiplication, and Division) on
integers. Input the two integer values and operator for performing arithmetic
Operation through keyboard.
4. Implement the following tasks
a) Implement the python program to generate the multiplication table.
b) Implement Python program to find sum of natural numbers
c) If the first name of a student is input through the keyboard, write a program to
display the vowels and consonants present in his/her name.

Page 85 of 121
 R18 B.Tech - CSE

5. Implement the following tasks

a) The marks obtained by a student in 5 different subjects are input through the
keyboard. Find the average and print the student grade as per the SIETK examination
policy
b) Given a number x, determine whether it is Armstrong number or not. Hint: For
example,371 is an Armstrong number since 3**3 + 7**3 + 1**3 = 371. Write a
program to find all Armstrong number in the range of 0 and 999.
6. Implement the following tasks
a) Write a Python script to
 create a list
 access elements from a list
 slice lists
 change or add elements to a list
 delete or remove elements from a list
b) Write a Python script to read the values from a list and to display largest and
smallest numbers from list.
c) Write a Python script to compute the similarity between two lists.
7. Implement the following tasks:
a) Write a Python script to read set of values from a Tuple to perform various
operations.
b) Write a Python script to perform basic dictionary operations like insert, delete and
Display.
c) Write a Python program to count the occurrence of each word in a given sentence.
8. Implement the following tasks
a) Write a Python script to create Telephone Directory using dictionary and list to
perform basic functions such as Add entry, Search, Delete entry, Update entry,
View and Exit.
b) Implement Python script to display power of given numbers using function.
c) Implement a Python program that takes a list of words and returns the length of the
longest one using function.
9. Implement the following tasks
a) Implement Python program to perform various operations on string using string
libraries.
b) Implement Python program to remove punctuations from a given string.
c) Write a Python program to change the case of the given string (convert the string
from lower case to upper case). If the entered string is “computer”, your program
should output “COMPUTER” without using library functions.
10. Implement the following tasks
a) Implement Python program to capitalize each word in a string. For example, the
entered sentence “god helps only people who work hard” to be converted as “God
Helps Only People Who Work Hard”
b) Write a Python script to display file contents.
c) Write a Python script to copy file contents from one file to another.
11. Implement the following tasks
a) Write a Python script to combine two text files contents and print the number of
lines, sentences, words, characters and file size.
b) Write a Python commands to perform the following directory operations.
 List Directories and Files
 Making a New Directory

Page 86 of 121
 R18 B.Tech - CSE

 Renaming a Directory or a File

 Removing Directory or File
12. Implement the following tasks
a) Create a package named Cars and build three modules in it namely, BMW, Audi
and Nissan. Illustrate the modules using class. Finally we create the __init__.py
file. This file will be placed inside Cars directory and can be left blank or we can
put the initialization code into it.
b) Write a python script to display following shapes using turtle.

TEXT BOOKS:
1. Reema Thareja, Python Programming: Using Problem Solving Approach, First Edition,
Oxford University Press.
2. Vamsi Kurama, Python Programming: A Modern Approach, Pearson.

REFERENCES:
1. Mark Lutz , Learning Python, O Reily, 4th Edition, 2009.
2. Mark Lutz , Programming Python , O Reily, 4th Edition, 2010.
3. Tim Hall and J-P Stacey , Python 3 for Absolute Beginners, 2009.
4. Magnus Lie Hetland , Beginning Python: From Novice to Professional, 2nd Edition, 2009.
5. Michael T. Goodrich , Roberto Tamassia, Michael H. Goldwasser, Data Structures and
Algorithms in Python,1st Edition , Kindle.

Page 87 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
III B. Tech – I Sem. L T P C

- - 3 1.5

(18CS0520) OBJECT ORIENTED ANALYSIS AND DESIGN LAB

COURSE OBJECTIVES
The Objectives of this Course:
1. Illustrate the requirements specification for an intended software system
2. Demonstrate the UML diagrams for the given specification
3. Map the design properly to the code

COURSE OUTCOMES (COs)

On successful completion of the course students will be able to
1. Construct various UML models (including use case diagrams, class diagrams,
interaction diagrams, state chart diagrams, activity diagrams, and implementation
diagrams) using the appropriate notation
2. Describe the importance of systems analysis and design in solving complex problems
3. Explain how the object-oriented approach differs from the traditional approach to systems
analysis and design
4. Understand the role and function of each UML model in developing object oriented
software
5. Exhibit software development process
6. Recognize the difference between various object relationships: inheritance, association,
whole-part, and dependency relationships

List of Experiments:
Draw standard UML diagrams using an UML modeling tool for a given case study and map
design to code and implement a 3 layered architecture. Test the developed code and validate
whether the SRS is satisfied.
1. Identify a software system that needs to be developed.
2. Document the Software Requirements Specification (SRS) for the identified system.
3. Identify use cases and develop the Use Case model.
4. Identify the conceptual classes and develop a Domain Model and also derive a Class
Diagram from that.
5. Using the identified scenarios, find the interaction between objects and represent them
using UML Sequence and Collaboration Diagrams
6. Draw relevant State Chart and Activity Diagrams for the same system.
7. Implement the system as per the detailed design.
8. Test the software system for all the scenarios identified as per the use case diagram
9. Improve the re usability and maintainability of the software system by applying
appropriate design patterns.
10. Implement the modified system and test it for various scenarios.
Page 88 of 121
 R18 B.Tech - CSE

OOAD Problems that may be considered are

1. College information system
2. Hostel management
3. ATM system
4. Library management system
5. Passport Automation System
6. Political Administration System.

TEXT BOOKS:
1. Grady Booch, James Rumbaugh, Ivar Jacobson, The Unified Modeling Language, User
Guide, 2nd edition, Pearson Education, 2005.
2. Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado, UML 2 Toolkit, WILEY-
Dreamtech India Pvt. Ltd, 2009.

Page 89 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – I Sem.
3 - - -

(18HS0842) APTITUDE PRACTICES

(NON-CREDIT COURSE)
COURSE OBJECTIVES
The objectives of this course:
1. To evaluate various real life situations by resorting to Analysis of key issues and factors.
2. To read between the lines and understand various language structures.
3. To demonstrate various principles involved in solving Mathematical problems and there
by reducing the time taken for performing job functions.

COURSE OUTCOMES (COs)

On successful completion of this course, the student will be able to
1. Develop the subtle way of approaching in the candidate.
2. Acquired the decision making with in no time.
3. Implement logical thinking during professional tenure.
4. Improve knowledge on problem solving.
5. Understand problems on coding and decoding.
6. Apply the knowledge on the concept of reasoning in real life.

UNIT – I
Percentages, Partnership, Ratio and Proportion, Time and Distance, Time and Work.

UNIT – II
Clocks, Calendars, Blood relations, Profit and Loss, Simple Interest, Compound Interest.

UNIT – III
Permutations and Combinations, Probability.
Menstruation: Areas, Volumes of different solids, Problems on Areas, Volumes and Surface
Areas, Cubes.

UNIT – IV
Number and letter series: Difference series, Product series, Squares series, Cubes series,
Alternate series, Combination series, miscellaneous series, Place values of letters.
Number and Letter Analogies: Definition of Analogy, Problems on number analogy.
Odd man out: Problems on number Odd man out, Problems on letter Odd man out,
Problems on verbal Odd man out.

UNIT – V
Coding and decoding, Directions.
Critical Reasoning: Problems on assumption, Problems on conclusions, Problems on
inferences, Problems on strengthening and weakening of arguments, Problems on principle,
Problems on paradox.

Page 90 of 121
 R18 B.Tech - CSE

TEXTBOOKS:
1. Barrons GL, Thorpe’s verbal reasoning, McGraw Hills, LSAT Materials, 2010.
2. Agarwal R S, A Modern Approach to Logical reasoning, S.Chand, 2017.

REFERENCES:
1. Agarwal R S, Quantitative Aptitude, S Chand, 2017.
2. BARRONS G L , Quantitative Aptitude, 2010.
3. Abhijit Guha, Quantitative Aptitude, PHI Learning PVT. LTD, 2019.
4. Tyra, Magical Book on Quicker Maths, BSC publishing company, 2018.

Page 91 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

( 18CS0521) DATA WAREHOUSING AND DATA MINING

COURSE OBJECTIVES
The objectives of this course:
1. Know the basic concepts and principles of data warehousing and data mining
2. Learn pre-processing techniques and data mining functionalities.
3. Learn and create multidimensional models for data warehousing
4. Study and evaluate performance of Frequent Item sets and Association Rules.
5. Understand and Compare different types of classification and clustering algorithms

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. Understand the basic concepts of data warehouse and data mining
2. Apply pre-processing techniques for data cleansing
3. Analyze and evaluate performance of algorithms for Association Rules
4. Analyze Classification and Clustering algorithms
5. Developing practical work of Data Mining techniques and design hypotheses based on the
analysis to conceptualize a Data Mining Solution to practical problem
6. Utilizing Data mining algorithms to build analytical applications.

UNIT -- I
Introduction:
Motivation to Data Mining, Importance, Kinds of Data that can be mined, Data Mining
Functionalities, Classification of Data mining Systems, Data Mining Task Primitives, Major
Issues in Data Mining.
Data Preprocessing: Need for Preprocessing the Data, Data Cleaning, Data Integration and
Transformation, Data Reduction, Data Discretization and Concept Hierarchy Generation.

UNIT -- II
Data Warehouse and OLAP Technology: An Overview
Data Warehouse fundamentals - A Multidimensional Data Model: From Tables and
Spreadsheets to Data Cubes, Stars, Snowflakes, and Fact Constellations, Measures: Their
Categorization and Computation, Concept Hierarchies, OLAP Operations in
Multidimensional Data Model, A Starnet Query Model for Querying Multidimensional
Databases - Data Warehouse Architecture, Data Warehouse Implementation, From Data
Warehouse to Data Mining, Attribute Oriented Induction.

UNIT -- III
Mining Frequent Patterns, Associations and Correlations:
Basic Concepts and a Road Map, Efficient and Scalable Frequent Item Set Mining Methods,
Mining Various Kinds of Association Rules, From Association Mining to Correlation
Analysis, Constraint based Association Mining.

Page 92 of 121
 R18 B.Tech - CSE

UNIT -- IV
Classification and Prediction:
Classification and Prediction fundamentals, Issues Regarding Classification and Prediction,
Classification by Decision Tree Induction, Bayesian Classification, Rule-Based
Classification, Classification by Back propagation.
Prediction: Prediction, Accuracy and Error Measures, Evaluating the Accuracy of a
Classifier or Predictor.

UNIT -- V
Cluster Analysis:
Basics of Cluster Analysis, Types of Data in Cluster Analysis, A Categorization of Major
Clustering Methods, Partitioning Methods, Hierarchical Methods, Density Based Methods,
Grid Based Methods, Model Based Clustering Methods, Outlier Analysis, Data mining
applications.

TEXT BOOKS:
1. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Elsevier,
Second Edition,2010.
3. Prabhu C.S.R.,Data Ware housing: Concepts, Techniques, Products and Applications,
Prentice Hall of India, 2011

REFERENCES:
1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Introduction to Data Mining,
Pearson Education.
2. Arun K Pujari, Data Mining Techniques, University Press,2001.
3. Sam Aanhory & Dennis Murray,Data Warehousing in the Real World, Pearson EdnAsia
4. K.P.Soman, S.Diwakar,V.Ajay, Insight into Data Mining, PHI,2008.

Page 93 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

( 18CS0522) SOFTWARE ENGINEERING

COURSE OBJECTIVES
The objectives of this course:
1. Illustrate the Software Development Models
2. Explain Software Requirements Engineering Process and SRS document
3. Illustrate the importance of modeling and modeling languages
4. Explain various testing methodologies

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. Define and develop a software project from requirement gathering to implementation
2. Ability to code and test the software
3. Ability to plan, estimate and maintain software systems
4. Understand the basic testing procedures
5. Able to generate test cases and test suites.
6. Test the applications manually by applying different testing methods and automation tools.

UNIT – I
Introduction: Introduction to Software Engineering , Software Process, Software Myths, A
generic view of process, A layered Technology, A Process Framework, Software Process
Models., Unified process
Introduction to Agility: Agility, Agile Process, Extreme Programming, Other Agile Process
Models

UNIT – II
Requirements Analysis and Specification: Requirements Engineering, Establishing the
groundwork, Eliciting Requirements, Developing Use Cases, Building the requirements
model, Negotiating Requirements, Validating Requirements. Requirements Modeling
Scenarios, Information and Analysis Classes: Requirements Analysis, Scenario-Based
Modeling, UML Models that Supplement the Use Case, Data Modeling Concepts, Class-
Based Modeling, Behavioral Models

UNIT – III
Design Concepts: The Design Process, Design Concepts, Design Model.
Architectural Design: Software Architecture, Architecture Genres, Architecture Styles,
Architectural Design, Assessing Alternative Architectural Designs.

UNIT – IV
User Interface Design: The Golden Rules, User Interface Analysis and Design, Interface
Analysis, Interface Design Steps.
Web App Design: Introduction, Web App Interface Design, Aesthetic Design, Content
Design, Architecture Design, Navigation Design, Component-Level Design

Page 94 of 121
 R18 B.Tech - CSE

UNIT – V
Testing: : A strategic Approach to Software Testing, Strategic Issues, Test Strategies for
Conventional Software, Test Strategies for Object-Oriented Software, Validation Testing,
System Testing, The Art of Debugging.
Testing Conventional Applications: Software Testing Fundamentals, White-Box Testing,
Black-Box Testing, Testing for Specialized Environments, Architectures and Applications,
Object-Oriented Testing Strategies, Object-Oriented Testing Methods, Testing Methods
Applicable at the Class level, Interclass Test-Case Design.

TEXT BOOK:
1. Roger S.Pressman, Software engineering- A practitioner‘s Approach, McGraw-Hill
International Edition, seventh edition, 2001.

REFERENCES:
1. Ian Sommerville, Software Engineering, 8th Edition, Pearson Education, 2008.
2. Richard Fairley, Software EngineeringConcepts , McGraw Hill, 2004.
3. Stephan Schach, Software Engineering, Tata McGraw Hill, 2007.
4. Pfleeger and Lawrence, Software Engineering : Theory and Practice, Pearson Education,
2nd, 2001
5. Brian Marick, The craft of software testing, Pearson Education.
.

Page 95 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

( 18CS0523) WEB TECHNOLOGIES

COURSE OBJECTIVES
The objectives of this course:
1. Introduce the basic web concepts and Internet Protocols
2. Explain client side scripting with Javascript and DHTML
3. Introduce server side programming with Java servlets, JSP and PHP
4. Implement web services through XML.

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. Create dynamic and interactive web sites using HTML
2. Gain knowledge of client side scripting using java sript and DHTML
3. Design and develop CSS
4. Demonstrate understanding of what is XML and how to parse and use XML data
5. Able to do server side programming with Java Servelets, JSP and PHP
6. Design client presentation using AJAX

UNIT – I
Web Essentials: Clients, Servers, and Communication. The Internet-Basic Internet Protocols
-The World Wide Web-HTTP request message-response message-Web Clients Web Servers.
Markup Languages: An Introduction to HTML History-Versions-Basic XHTML Syntax
and Semantics-Some Fundamental HTML Elements-Relative URLs-Lists-tables-Frames-
Forms-HTML 5.0.

UNIT – II
Style Sheets: CSS-Introduction to Cascading Style Sheets-Features-Core Syntax-Style
Sheets and HTML- Style Rule Cascading and Inheritance-Text Properties-Box Model
Normal Flow Box Layout-Beyond the Normal Flow-CSS3.0.
Client-Side Programming: The JavaScript Language-History and Versions Introduction
JavaScript in Perspective-Syntax-Variables and Data Types-Statements-Operators-Literals-
Functions-Objects-Arrays-Built-in Objects-JavaScript Debuggers.

UNIT – III
Host Objects: Introduction to the Document Object Model DOM History and Levels-
Intrinsic Event Handling-Modifying Element Style-The Document Tree-DOM Event
Handling-Accommodating Noncompliant Browsers Properties of window.
Server-Side Programming: Java Servlets- Architecture -Overview-A Servlet-Generating
Dynamic Content-Life Cycle- Parameter Data-Sessions-Cookies-URL Rewriting-Other
Capabilities-Data Storage Servlets and Concurrency- Databases and Java Servlets.

UNIT – IV
Introduction to PHP: PHP- Using PHP- Variables- Program control-Built-in functions
connecting to Database – Using Cookies-Regular Expressions.
Page 96 of 121
 R18 B.Tech - CSE

Representing Web Data: XML-Documents and Vocabularies-Versions and Declaration-

Namespaces- DOM based XML processing Event-oriented Parsing: SAX-Transforming
XML Documents-Selecting XML Data.

UNIT – V
AJAX: Ajax Client Server Architecture-XML Http Request Object-Call Back Methods, web
services Writing a Java Web Service-Writing a Java Web Service Client-Describing.
XML Schema-Communicating Object Data: SOAP Related Technologies-Software
Installation-Storing Java Objects as Files.

TEXT BOOKS:
1. Jeffrey C. Jackson, Web Technologies–A Computer Science Perspective, Pearson
Education, 2006
2. Jason Gilmore, Beginning PHP and MySQL, 3rd Edition, Apress Publications (Dream
tech.).

REFERENCES:
1. Lee Babin, Nathan A Good, Frank M.Kromann and Jon Stephens, PHP 5 Recipes A
problem Solution Approach, Apress publisher, 1st Edition 2005.
2. Deitel and Deitel and Nieto, Prentice Hall, Internet and World Wide Web - How to
Program, 5 th Edition, 2011.
3. Herbert Schildt, Java-The Complete Reference, Eighth Edition, Mc Graw Hill
Professional,2011.
4. Brian Marick, The craft of software testing, Pearson Education

Page 97 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

(18CS0531) ADVANCED OPERATING SYSTEMS

(PROFESSIONAL ELECTIVE COURSE-I)
COURSE OBJECTIVES
The objectives of this course:
1. Understand and make effective use of memory management techniques.
2. Implement Distributed Mutual Exclusion Algorithms
3. Develop the skills necessary for Synchronous and Asynchronous Check Pointing and
Recovery
4. Develop the basic skills required to Real Time Systems
5. Develop Process Management Scheduling and Input-Output Management

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. Recognize the Process Scheduling Deadlocks
2. Describe Centralized and Distributed Deadlock Detection Algorithms
3. Analyze the fundamental skills required to Two-Phase Commit Protocol
4. Explain Mobile Operating Systems
5. Demonstrate the Linux System and Design Principles
6. Assess with Inter process Communication. iOS and Android

UNIT – I
FUNDAMENTALS OF OPERATING SYSTEMS: Overview – Synchronization
Mechanisms – Processes and Threads - Process Scheduling Deadlocks: Detection, Prevention
and Recovery – Models of Resources – Memory Management Techniques.

UNIT – II
DISTRIBUTED OPERATING SYSTEMS: Issues in Distributed Operating System –
Architecture – Communication Primitives – Lamport’s Logical clocks – Causal Ordering of
Messages – Distributed Mutual Exclusion Algorithms – Centralized and Distributed
Deadlock Detection Algorithms – Agreement Protocols.

UNIT – III
DISTRIBUTED RESOURCE MANAGEMENT: Distributed File Systems – Design Issues
- Distributed Shared Memory – Algorithms for Implementing Distributed Shared memory–
Issues in Load Distributing – Scheduling Algorithms – Synchronous and Asynchronous
Check Pointing and Recovery – Fault Tolerance – Two-Phase Commit Protocol – Non
blocking Commit Protocol – Security and Protection.

UNIT – IV
REAL TIME AND MOBILE OPERATING SYSTEMS: Basic Model of Real Time
Systems - Characteristics- Applications of Real Time Systems – Real Time Task Scheduling
- Handling Resource Sharing - Mobile Operating Systems – Micro Kernel Design - Client
Server Resource Access – Processes and Threads - Memory Management - File system.

Page 98 of 121
 R18 B.Tech - CSE

UNIT – V
CASE STUDIES: Linux System: Design Principles - Kernel Modules - Process
Management Scheduling - Memory Management - Input-Output Management - File System -
Inter process Communication. iOS and Android: Architecture and SDK Framework - Media
Layer - Services Layer - Core OS Layer - File System.

TEXT BOOKS:
1. Mukesh Singhal and Niranjan G. Shivaratri, Advanced Concepts in Operating Systems
Distributed Database and Multiprocessor Operating Systems, Tata McGraw-Hill, 2001.
2. Abraham Silberschatz; Peter Baer Galvin; Greg Gagne, Operating System Concepts,
Seventh Edition, John Wiley & Sons, 2004.

REFERENCES:
1. Andrew S. Tanenbaum and Maarten van Steen, Distributed Systems: Principles and
Paradigms, Prentice Hall, 2nd Edition, 2007.
2. Daniel P Bovet and Marco Cesati, Understanding the Linux kernel,, 3rd edition,
O’Reilly,2005.
3. Rajib Mall, Real-Time Systems: Theory and Practice, Pearson Education India, 2006.
4. Neil Smyth, iPhone iOS 4 Development Essentials – Xcode, Fourth Edition, Payload
media, 2011.

Page 99 of 121
 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

(18CS0532) LINUX PROGRAMMING

(PROFESSIONAL ELECTIVE COURSE-I)
COURSE OBJECTIVES
The objectives of this course:
1. Explain Linux utilities and shell scripting language
2. Implement standard Linux utilities
3. Develop the skills necessary for system programming including file system programming,
Korn shell and C shell

COURSE OUTCOMES (COs)

On successful completion of this course, the student will be able to
1. Understand the basic set of commands and editors in Linux operating system.
2. Implement and execute various shell scripts.
3. Work with filters, pipes and user communication, Vi-Editor commands.
4. Execute various commands related to regular expressions
5. Implement korn shell programming
6. Execute commands related to C shell.

UNIT – I
Introduction: The UNIX Environment, Unix structure, Accessing UNIX, common and
useful commands. The Vi Editor – Concepts, Modes and Commands.
File Systems: File names and types, regular files and Directories and their implementation.
Operations on directories, files and on both. Security levels, Changing permissions,
Ownership and group
UNIT – II
Introduction to Shells: Shells, UNIX Session, standard streams, redirection, pipes tee
Command, Command Execution and Substitution, Command-Line Editing, job control,
Aliases, Variable Types and options, Shell Customization.
UNIT – III
Filters: Filters and Pipes – related Commands. Commands for Translating Characters, Files
with duplicate Lines, Counting characters, words and Lines and Comparing files.
User Communication, Electronic mail, Remote access, and File Transfer. Vi Editor – Local,
Global and Range commands and Text manipulation in vi. Editor, Over view of ex Editor.

UNIT – IV
Regular Expressions: Atoms and Operators, grep – family and operations and searching for
file contents. Overview of sed and awk
Interactive korn shell : An overview on sed, Korn shell - Features, Files, Variables, input
and output. Environmental Variables and options. Startup Script, Command history and
Execution process.

Page 100 of 121

 R18 B.Tech - CSE

UNIT – V
Korn shell Programming- Script Concept, Expressions, Decision making and Repetition,
Special Parameters and variables, Changing Positional parameters, Argument Validation,
Debugging Scripts and Examples.
Interactive C shell : An overview on awk, C Shell – Features, Files and Variables, output,
input, eval Command, environmental Variables, on-off Variables, Startup and Shutdown
Scripts, Command history and execution Script.

TEXT BOOKS:
1. Behrouz A. Forouzan and Richard F. Gilberg, UNIX and Shell Programming, Cengage
learning publications, Indian Reprint 2012
2. Sumitabha Das, UNIX Concepts and Applications, 4th Edition, TMH.

REFERENCES:
1. N. Mathew, R. Stones, Wrox, Beginning Linux Programming, 4th Edition, Wiley India
Edition
2. Graham Glass, King Ables, LINUX for programmers and users, 3rd Edition, Pearson.
3. A. Hoover, System Programming with C and LINUX, Pearson.
4. S. G. Kochan and P. Wood, LINUX shell Programming, 3rd edition, Pearson Education
5. K. A. Robbins, LINUX System Programming, communication, Concurrency and Threads,
Pearson Education.
6. S. Parker, Shell Scripting, Wiley India Pvt. Ltd.

Page 101 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3
(18CS0533) QUANTUM COMPUTING
(PROFESSIONAL ELECTIVE COURSE-I)
COURSE OBJECTIVES
The objectives of this course:
1. Highlight the paradigm change between conventional computing and quantum computing
2. Translate fluently between the major mathematical representations of quantum operations
3. Implement basic quantum algorithms
4. Discuss the physical basis of uniquely quantum phenomena
5. Explain quantum de-coherence in systems for computation

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. The basic principles of quantum computing.
2. The fundamental differences between conventional computing and quantum computing.
3. Several basic quantum computing algorithms
4. The classes of problems that can be expected to be solved well by quantum computers
5. The implications of quantum computing on fields such as computer security and machine
learning

UNIT – I
Introduction and Background: Overview of traditional computing – Church-Turing thesis
– circuit model of computation – reversible computation – quantum physics – quantum
physics and computation
Linear Algebra and The Dirac Notation :Dirac notation and Hilbert Spaces – dual vectors
– operators – the spectral theorem –functions of operators – tensor products – Schmidt
decomposition theorem

UNIT – II
Qubits and The Framework of Quantum Mechanics: State of a quantum system – time
evolution of a closed system – composite systems – measurement – mixed states and general
quantum operations
A Quantum Model of Computation: Quantum circuit model – quantum gates – universal
sets of quantum gates – unitary transformations – quantum circuits.

UNIT – III
Super dense Coding and Quantum Teleportation: Super dense coding – quantum
teleportation – applications of teleportation
Introductory Quantum Algorithms: Probabilistic versus quantum algorithms – phase kick-
back – the Deutsch algorithm – the Deutsch- Jozsa algorithm – Simon's algorithm

UNIT – IV
Algorithms with Super Polynomial Speed-Up: Quantum phase estimation and quantum
Fourier Transform – eigenvalue estimation – Orders-finding problem – eigenvalue estimation
approach to order finding – Shor's algorithm for order finding – finding discrete logarithms –
hidden subgroups
Page 102 of 121
 R18 B.Tech - CSE

Algorithms Based on Amplitude Amplification: Grover's quantum search algorithm –

amplitude amplification – quantum amplitude estimation and quantum counting – searching
without knowing the success probability

UNIT – V
Quantum Computational Complexity: Computational complexity – black-box model –
lower bounds for searching – general black-box lower bounds – polynomial method – block
sensitivity – adversary methods
Quantum Error Correction: Classical error correction – classical three-bit code – fault
tolerance – quantum error correction – three- and nine-qubit quantum codes – fault-tolerant
quantum computation

TEXT BOOK:
1. P. Kaye, R. Laflamme, and M. Mosca, An introduction to Quantum Computing,
Oxford University Press, 1999
REFERENCES:
1. V. Sahni, Quantum Computing, Tata McGraw-Hill Publishing Company, 2007.
2. Michael A. Nielsen and Isaac L.Chuang (2000), Quantum Computation and Quantum
Information, Cambridge University Press.

Page 103 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

(18CE0127) ELEMENTS OF ROAD TRAFFIC SAFETY

(OPEN ELECTIVE-I)
COURSE OBJECTIVES
1. 1.To understand the accident statistics globally and in India specifically, its causes and
measures to overcome the situation.
2. 2.The traffic regulation, parking problems, understanding of road signs, signals and
marking are also taught; so that the student is well informed about all safety measures
that a traffic engineer need to understand
3. 3.To understand the various aspects of street lighting

COURSE OUTCOMES (COs)

On successful completion of this course, the student will be able to
1. Identify the causes for road accidents and can implement measures to prevent road
accidents
2. Describe traffic regulations and implement parking methods
3. Classify different traffic signal and can design traffic signal system
4. List and illustrate various traffic signs
5. List and discuss various road markings
6. Discuss importance of street lighting and classify various street lighting system

UNIT – I
Road Accidents – Causes & Prevention:Road Accidents & Traffic Engineering – Accident
Situation in India – International Comparison of Road Accidents – Road & its Effects on
Accidents – The Vehicle – The Driven – Skidding – Speed in Relation of Safety – Weather &
its Effects on Accidents – Pedestrian Safety -Cyclists – Motor Cycle & Scooter Rider –
Parking & Its Influence on Accident – Legislation, Enforcement, Education & Propaganda –
Cost of Road Accidents

UNIT – II
Regulations of Traffic:Basic Principals of Regulation – Regulation of Speed – Regulation of
Vehicles – Regulations Concerning the Driver – Regulations Concerning Traffic – Parking
Regulations – Enforcement of Regulations.
Parking:Traffic & Parking Problems – Ill-Effects of Parking – Zoning & Parking Space
Requirement Standards – Design Standards for On-Street Parking Facilities – Traffic
Regulatory Measures for On-Street Parking – Off-Street Parking Facilities – Peripheral
Parking Schemes – Loading & Unloading Facilities – Truck Terminals – Long Distance Bus
Terminals

Page 104 of 121

 R18 B.Tech - CSE

UNIT – III
Traffic Signs:Importance of Traffic Signs – Need for International Standardization – The
Situation in India – General Principals of Traffic Signing – Types of Traffic Signs – Danger
Signs (Warning Signs or Cautionary Signs) – Prohibitory Signs – Mandatory Signs –
Informatory Sings – Indication Signs – Direction Signs, Advance Direction Signs & Place
Identification Signs – Overhead Sings – Route Marker Sings – Location, Height&
Maintenance of Traffic Sings

UNIT – IV
Traffic Signals:Advantages & Disadvantages of Traffic Signals – Signal Indications – Signal
Face – Illustration of the Signals – Number & Location of Signals Faces – Amber Period,
Red/Amber Period & Inter Green Period – Fixed Time Signals & Vehicle Actuated Signals –
Determination of Optimum Cycle Length & Signal Settings for an Intersection with Fixed
Time Signals – Warrants for Signals – Co-ordinated Control of Signals – Signal Approach
Dimensions – Area Traffic Control – Delay at Signalized Intersection

UNIT – V
Road Markings:Function – Types of Road Marking – General Principals of Longitudinal
Pavement Markings – Material & Color – Centre Lines – Traffic Lane Lines – No Overtaking
Zone Markings – Pavement Edge Lines – Carriageway Width Reduction Transition Marking
– Obstruction Approach Markings – Stop Lines – Pedestrian Crossings – Cyclist Crossings –
Route Direction Arrows – Word Messages – Markings at Approaches to Intersections –
Parking Space Limits – Object Markings
Street Lighting:Need for Street Lighting – Definition of Common Terms – Some Laws of
Illumination – Mounting Height – Spacing – Lantern Arrangements – Type of Lamps – Lamp
Installation of T’ Junctions & Cross Roads – Illumination of Traffic Rotaries – Lighting of
Bends – Lighting of Dual Carriageways – Lighting of Roads Carrying Only Local Traffic –
Lighting Bridges – Tunnel Lighting – Maintenance of Lighting Installation

TEXTBOOKS
1. L.R.Kadiyali and Lal,Traffic Engineering and Transportation Planning, Khanna
Publications, 9th edition, 1999
2. S.K.Khanna&C.E.G.Justo,Highway Engineering,Published by Nemchand& Bros,10th
edition, 2012

REFERENCES
1. L.R.Kadiyali and Lal,Principles and Practice of Highway Engineering Design, Khanna
Publications, 7th edition, 2013
2. R.Srinivasa Kumar,Text book of Highway Engineering, Universities Press
3. James H Banks, Introduction to Transportation Engineering, Tata McGraw hill
Publications, 2nd edition

Page 105 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

(18EE0234) INDUSTRIAL INSTRUMENTATION

(OPEN ELECTIVE-I)
COURSE OBJECTIVES
The objectives of this course:
1. To Analyse the Common errors that occur in measurement systems, and their
classification.
2. To understand the characteristics of signals, their representation, and signal
modulation techniques.
3. To learn the Methods of Data Transmission, Telemetry, and Data acquisition.
4. To study working principles of different Signal Analyzers and Digital meters.
5. To learn about several types of transducers and their use for measurement of non-
electrical quantities.

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. Identify and explain the types of errors occuring in measurement systems.
2. Differentiate among the types of data transmission and modulation techniques.
3. Apply digital techniques to measure voltage, frequency and speed.
4. Analyse the working principles of different Signal Analyzers and Digitalmeters.
5. Understand the operation of several types of transducers.
6. Choose suitable Transducers for the measurement of non-electrical quantities.

UNIT – I
CHARACTERISTICS OF SIGNALS AND THEIR REPRESENTATION:
Measuring Systems, Performance Characteristics, Static Characteristics, Dynamic
Characteristics; Errors in Measurement Gross Errors, Systematic Errors, Statistical Analysis
of Random Errors. Signals and their Representation: Standard Test, Periodic, Aperiodic,
Modulated Signal, Sampled Data, Pulse Modulation and Pulse Code Modulation.

UNIT – II
DATA TRANSMISSION, TELEMETRY AND DAS: Methods of Data Transmission–
General Telemetry System .Frequency Modulation (FM), Pulse Modulation (PM), Pulse
Amplitude Modulation (PAM), Pulse Code Modulation (PCM)Telemetry. Comparison of
FM, PM, PAM and PCM. Analog and Digital Data Acquisition Systems –Components of
Analog DAS–Types of Multiplexing Systems: Time Division and Frequency Division
Multiplexing –Digital DAS–Block Diagram––Modern Digital DAS (Block Diagram)

Page 106 of 121

 R18 B.Tech - CSE

UNIT – III
SIGNAL ANALYZERS, DIGITAL METERS: Wave Analysers- Frequency Selective
Analyzers, Heterodyne, Application of Wave Analyzers-Harmonic Analyzers, Total
Harmonic Distortion, Spectrum Analyzers, Basic Spectrum Analyzers, Spectral Displays,
Vector Impedance Meter, QMeter. Peak Reading and RMS Voltmeters, Digital Voltmeters-
Successive Approximation, Ramp and Integrating Type- Digital Frequency Meter- Digital
Multimeter- Digital Tachometer

UNIT – IV
TRANSDUCERS: Definition of Transducers, Classification of Transducers, Advantages of
Electrical Transducers, Characteristics and Choice of Transducers; Principle of Operation of
Resistive, Inductive, Capacitive Transducers, LVDT, Strain Gauge and its Principle of
Operation, Gauge Factor, Thermistors, Thermocouples, Synchros, Piezo electric
Transducers, Photovoltaic, Photo Conductive Cells, Photo Diodes.

UNIT – V
MEASUREMENT OF NON-ELECTRICAL QUANTITIES: Measurement of strain,
Gauge Sensitivity, Measurement of Displacement, Velocity, Angular Velocity, Acceleration,
Force, Torque, Temperature, Pressure, Flow, Liquid level.

TEXT BOOKS:

1. A.K.Sawhney, DhanpatRai & Co., A course in Electrical and Electronic

Measurementsand Instrumentation, 2012.
2. D.V.S.Murty, Transducers and Instrumentation, Prentice Hall of India, 2 nd Edition,
2004.

REFERENCES:

1. A.Dhelfrick and W.D.Cooper, Modern Electronic Instrumentation and

Measurement technique, Pearson/Prentice Hall of India., 1990.
2. H.S. Kalsi , Electronic Instrumentation, Tata MCGraw-Hill Edition, 2010.
3. T.R.Padmanabhan, Industrial Instrumentation–Principles and Design, Springer-
Verlag London Limited 2000.

Page 107 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

(18ME0307) NON-CONVENTIONAL ENERGY RESOURCES

(OPEN ELECTIVE-I)
COURSE OBJECTIVES
To make the students understand
1. The importance of energy, resources of renewable energy, their usage and impact on
environment.
2. Solar energy, its harnessing technologies, types of solar collectors, measuring
devices. & its applications
3. Method of exploiting energy from wind and parameters to be considered for the
selection of site for wind turbine installation
4. The concept of bio energy and its conversion devices
5. Different renewable energies such as tidal energy, geothermal energy, fuel cells etc.

COURSE OUTCOMES(COs)
At the end of this course, the student will be able to
1. State various sources of Energies, its availability and explain the importance of them
by observing the global energy scenario.
2. Distinguish the types of solar energy tapping devices and describe the method of
harnessing the solar energy.
3. Summarize the Wind energy systems and elucidate the impact of it in environmental
aspects.
4. Describe the Biomass conversion process and list out various bioenergy applications.
5. Interpret the knowledge of renewable energies such as tidal energy, OTEC, Fuel cell,
etc. for effective construction of Hybrid systems.
6. Identify numerous applications renewable energy resources and illustrate its
harnessing technologies.

UNIT-I
Introduction -world energy use – classification of energy’s-reserves of energy resources–
environmental aspects of energy utilization – need of renewable energy– renewable Energy
scenario in Andhra Pradesh, India and around the world.

UNIT-II
Solar thermal conversion - Flat Plate and Concentrating Collectors – Solar direct Thermal
Applications– Solar thermal Power Generation
Photo voltaic Conversion: Fundamentals of Solar Photo Voltaic Conversion – Solar Cells –
Solar PV Power Generation – Solar PV Applications, Solar Radiation Measurements

UNIT-III
Wind Energy - Types of Wind Energy Systems – Performance – Site Selection – Details of
Wind Turbine–Wind Energy Measurements-Safety and Environmental Aspects
Page 108 of 121
 R18 B.Tech - CSE

UNIT-IV
Bio Energy- Biomass direct combustion – Biomass gasifiers – Biogas plants–Ethanol
production – Biodiesel – Cogeneration - Biomass Applications

UNIT-V
Other Sources of Energy - Tidal energy – Wave Energy – Open and Closed OTEC Cycles
–Geothermal Energy – Hydrogen and Storage - Fuel Cell Systems – Hybrid Systems.

TEXT BOOKS
1. R.K. Rajput, Non-conventional Energy Sources and Utilization, S. Chand Publishers,
2nd Edition, 2014.
2. G. D Rai, Non-Conventional Energy Sources, Khanna Publishers, 1st Edition, 2010.
3. Nicholas Jenkins & Janaka Ekanayake, Renewable Energy Engineering, Cambridge
University Press; 1st Edition, 2017.

REFERENCES
1. Dr. R K Singal, Non-Conventional Energy Resources, S.K Kataria & Sons, 4th
Edition, 2014.
2. John Twidell & Tony Weir, Renewable Energy Sources, Routledge publisher, 3rd
Edition, 2015.
3. Sukhatme. S.P, Solar Energy, Principles of Thermal Collection and Storage,Tata
McGraw Hill Publishing Company Limited, 6th Edition, 1990.

Page 109 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

(18EC0449) INTRODUCTION TO IOT

(OPEN ELECTIVE-I)

COURSE OBJECTIVES
The objectives of this course:
1. To provide an overview on the ICT ecosystem and enabling environment to foster Internet
of Things (including technology, standards, system management and applications)
deployments.
2. Define the infrastructure for supporting IoT deployments.
3. To provide an understanding of the technologies and the standards relating to the Internet
of Things.
4. Understand various case studies related to IoT domain.

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. Understand the technology and standards relating to IoTs.
2. Understand where the IoT concept fits within the broader ICT industry and possible future
trends.
3. Understand the key components that make up an IoT system.
4. Differentiate between the levels of the IoT stack and be familiar with the key technologies
and protocols employed at each layer of the stack.
5. Configure Raspberry Pi, Understand Sensors, Actuators & get started with python on
Raspberry Pi.
6. Apply the knowledge and skills acquired during the course to design, build and test a
complete, working IoT system involving prototyping, programming and data analysis.

UNIT – I
IoT Introduction & Concepts: Introduction to Internet of Things - Physical Design of IoT -
Logical Design of IoT - IoT Enabling Technologies - IoT Levels & Deployment Templates.

UNIT – II
Domain Specific IoTs: Home Automation – Cities – Environment – Energy – Retail –
Logistics - Agriculture – Industry - Health & Lifestyle.

UNIT – III
IoT and M2M: Introduction – M2M – Difference between IoT an M2M - Software Defined
Networking - Network Function Virtualization for IoT.
Developing Internet of Things: IoT Design Methodology – Motivation for using Python

UNIT – IV
IoT Physical Devices & Endpoints: IoT Device – Raspberry Pi Board - Linux on Raspberry
Pi – Raspberry Pi Interfaces – Programming raspberry Pi with Python – Other IoT devices.

Page 110 of 121

 R18 B.Tech - CSE

UNIT – V
Case Studies Illustrating IoT Design: Home Automation – Cities – Environment –
Agriculture – Productivity applications.

TEXT BOOKS:
1. Vijay Madisetti – Arshdeep Bahga, Internet of Things a Hands-on Approach,
ArshdeepBahga & Vijay Madisetti ,1st Edition, 2014.
2. Pethuru Raj and Anupama C. Raman, The Internet of Things: Enabling Technologies,
Platforms, and Use Cases, CRC Press,1stEdition, 2014.

REFERENCES:
1. Raj Kamal, Embedded Systems, Tata McGraw-Hill Education, 2ndEdition, 2011.
2. Adrian McEwen & Hakim Cassimally, Designing of Internet of Things, John Wiley
and sons Ltd, 1st Edition, 2014,
3. Daniel Kellmereit - Daniel Obodovski, The Silent Intelligence: The Internet of
Things,DnD Ventures, 1st Edition,2013.

Page 111 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
3 - - 3

(18HS0814) INTELLECTUAL PROPERTY RIGHTS

(OPEN ELECTIVE-I)
COURSE OBJECTIVES
The course should enable the students
1. Provide an understanding of the concept and significance of intellectual property rights.
2. Understand the concept of trademarks, copy rights, patents and the need for their
protection.
3. To comprehend the concept of competition, unfair competition and the latest
developments in the laws pertaining to intellectual property rights.

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. Become aware of intellectual property rights, concepts, treaties, agencies and
international organizations involved in sanctioning IP rights
2. Identify different types of intellectual properties, ownership rights and the scope of the
protection
3. Get an adequate knowledge on patents, trademarks, copy rights and to get property rights
for their intellectual work
4. Able to identify, apply, and assess ownership rights, registration processes for IP rights
5. To discern the approaches for intellectual property management and intellectual property
audits
6. Demonstrate knowledge and understanding on unfair competition and latest
developments in IP rights at international level

UNIT- I
INTRODUCTION TO INTELLECTUAL PROPERTY: Introduction, types of
intellectual property, international organizations, agencies and treaties, importance of
intellectual property rights.

UNIT- II
TRADE MARKS: Purpose and function of trademarks, acquisition of trade mark rights,
protectable matter, selecting and evaluating trade mark, trade mark registration processes.

UNIT- III
LAW OF COPY RIGHTS: Fundamental of copy right law, originality of material, rights of
reproduction, rights to perform the work publicly, copy right ownership issues, copy right
registration, notice of copy right, international copy right law.
LAW OF PATENTS: Foundation of patent law, patent searching process, ownership rights
and transfer

Page 112 of 121

 R18 B.Tech - CSE

UNIT - IV
TRADE SECRETS: Trade secrete law, determination of trade secrete status, liability for
misappropriations of trade secrets, protection for submission, trade secret elitigation.
UNFAIR COMPETITION: Misappropriation right of publicity, False advertising.

UNIT -V
NEW DEVELOPMENT OF INTELLECTUAL PROPERTY: new developments in trade
mark law; copy right law, patent law, intellectual property audits.
International overview on intellectual property, international - trade mark law, copy right law,
international patent law, international development in trade secrets law.

TEXT BOOKS:
1. Deborah, E. Bouchoux, Intellectual property right, cengage learning
2. Nityananda KV, Intellectual property rights: Protection and Management. India,
Cengage Learning India Private Limited.

REFERENCES:
1. Prabuddha ganguli, Intellectual property right - Unleashing the knowledge
economy, Tata McGraw Hill Publishing CompanyLtd.
2. Ahuja ,Law relating to Intellectual Property rights. India. VK IN: Lexis Nexis
3. Neeraj P & Khushdeep D, Intellectual Property Rights, India. PHI learning pvt
limited.

Page 113 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
- - 2 1

(18CS0524) DATA MINING LAB

COURSE OBJECTIVES
The objectives of the course:
1. Learn to perform data mining tasks using a data mining toolkit (such as open source
WEKA),
2. Explain the data sets and data preprocessing
3. Demonstrate the working of algorithms for data mining tasks such association rule
mining, classification, clustering and regression
4. Exercise the data mining techniques with varied input values for different parameters

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. Explore WEKAtool
2. Perform data preprocessing tasks
3. Demonstrate association rule mining on datasets
4. Implement classification techniques on datasets
5. Implement clustering and regression techniques on datasets
6. Design and implement data miningalgorithms

LIST OF EXPERIMENTS:
1. Credit Risk Assessment
Description: The business of banks is making loans. Assessing the credit worthiness of an
applicant is of crucial importance. You have to develop a system to help a loan officer decide
whether the credit of a customer is good, or bad. A bank's business rules regarding loans must
consider two opposing factors. On the one hand, a bank wants to makes many loans as
possible. Interest on these loans is the banks profit source. On the other hand, a bank cannot
afford to make too many bad loans. Too many bad loans could lead to the collapse of the
bank. The bank's loan policy must involve a compromise: not too strict, and not too lenient.
To do the assignment, you first and foremost need some knowledge about the world of credit.
You can acquire such knowledge in a number of ways.
a) Knowledge Engineering. Find a loan officer who is willing to talk. Interview her and
try to represent her knowledge in the form of production rules.
b) Books. Find some training manuals for loan officers or perhaps a suitable textbook on
finance. Translate this knowledge from text form to production rule form.
c) Common sense. Imagine yourself as a loan officer and make up reasonable rules
which can be used to judge the credit worthiness of a loan applicant.
d) Case histories. Find records of actual cases where competent loan officers correctly
judged when, and when not to, approve a loan application.

Page 114 of 121

 R18 B.Tech - CSE

2. The German Credit Data:

Actual historical credit data is not always easy to come by because of confidentiality rules.
Here is one such dataset, consisting of 1000 actual cases collected in Germany. credit dataset
(original) Excel spreadsheet version of the German credit data (Down load from web). In
spite of the fact that the data is German, you should probably make use of it for this
assignment. (Unless you really can consult a real loan officer !)
A few notes on the German dataset
 DM stands for Deutsche Mark, the unit of currency, worth about 90cents Canadian
(but looks and acts like a quarter).
 Owns telephone. German phone rates are much higher than in Canada so fewer people
own telephones.
 Foreign worker. There are millions of these in Germany (many from Turkey). It is
very hard to get German citizenship if you were not born of German parents.
 There are 20 attributes used in judging a loan applicant. The goal is the classify the
applicant into one of two categories, good or bad.

Sub tasks : (Turn in your answers to the following tasks)

a) List all the categorical (or nominal) attributes and the real-valued attributes separately.
b) What attributes do you think might be crucial in making the credit assessment? Come
up with some simple rules in plain English using your selected attributes.
c) One type of model that you can create is a Decision Tree - train a Decision Tree using
the complete dataset as the training data. Report the model obtained after training.
d) Suppose you use your above model trained on the complete dataset, and classify
credit good/bad for each of the examples in the dataset. What % of examples can you
classify correctly ? (This is also called testing on the training set) Why do you think
you cannot get 100 % training accuracy ?
e) Is testing on the training set as you did above a good idea ? Why or Why not ?
f) One approach for solving the problem encountered in the previous question is using
cross validation ? Describe what is cross validation briefly. Train a Decision Tree
again using cross validation and report your results. Does your accuracy
increase/decrease ?Why ?
g) Check to see if the data shows a bias against "foreign workers"(attribute 20),or
"personal-status" (attribute 9). One way to do this(perhaps rather simple minded) is to
remove these attributes from the dataset and see if the decision tree created in those
cases is significantly different from the full dataset case which you have already done.
To remove an attribute you can use the preprocess tab in Weka's GUI Explorer. Did
removing these attributes have any significant effect? Discuss.
h) Another question might be, do you really need to input so many attributes to get good
results? Maybe only a few would do. For example, you could try just having attributes
2, 3, 5, 7, 10, 17 (and21, the class attribute (naturally)). Try out some combinations.
(You had removed two attributes in problem 7. Remember to reload the raff data file
to get all the attributes initially before you start selecting the ones you want.)

Page 115 of 121

 R18 B.Tech - CSE

i) Sometimes, the cost of rejecting an applicant who actually has a good credit (case 1)
might be higher than accepting an applicant who has bad credit (case 2). Instead of
counting them is classifications equally in both cases, give a higher cost to the first
case (say cost 5) and lower cost to the second case. You can do this by using a cost
matrix in Weka. Train your Decision Tree again and report the Decision Tree and
cross-validation results. Are they significantly different from results obtained in
problem 6 (using equal cost)?
j) Do you think it is a good idea to prefer simple decision trees instead of having long
complex decision trees How does the complexity of a Decision Tree relate to the bias
of the model ?
k) You can make your Decision Trees simpler by pruning the nodes. One approach is to
use Reduced Error Pruning - Explain this idea briefly. Try reduced error pruning for
training your Decision Trees using cross-validation (you can do this in Weka) and
report the Decision Tree you obtain ? Also, report your accuracy using the pruned
model. Does your accuracy increase ?
l) (Extra Credit): How can you convert a Decision Trees into "if-then else rules". Make
up your own small Decision Tree consisting of 2-3 levels and convert it into a set of
rules. There also exist different classifiers that output the model in the form of rules -
one such classifier in Weka is rules. PART, train this model and report the set of rules
obtained. Sometimes just one attribute can be good enough in making the decision,
yes, just one ! Can you predict what attribute that might be in this dataset ? One R
classifier uses a single attribute to make decisions (it chooses the attribute based on
minimum error). Report the rule obtained by training a one R classifier. Rank the
performance of j48, PART and one R.

Task Resources:
Andrew Moore's Data Mining Tutorials (See tutorials on Decision Trees and Cross
Validation)
 Decision Trees (Source: Tan, MSU)
 Tom Mitchell's book slides (See slides on Concept Learning and Decision Trees)
 Weka resources:
1. Introduction to Weka (html version) (download ppt version)
2. Download Weka
3. Weka Tutorial
4. ARFF format

TEXT BOOKS:
1. Jiawei Han and Micheline Kamber, Elsevier, Data Mining: Concepts and Techniques,
Second Edition,2010.
2. Prabhu C.S.R.,Data Ware housing: Concepts, Techniques, Products and Applications,
Prentice Hall of India, 2011

Page 116 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
- - 2 1

(18CS0525) WEB TECHNOLOGIES LAB

COURSE OBJECTIVES
The objectives of the course:
1. Create web pages using HTML,DHTML and CSS.
2. Develop a servelet program using Java servelets
3. Develop online application using PHP
4. Implement simple web service using XML

COURSE OUTCOMES (COs)

On successful completion of this course, student will be able to
1. Create dynamic and interactive web sites using HTML
2. Design client side scripting using java sript and DHTML.
3. Develop servelet program using java servelets
4. Develop simple online application using servelets
5. Implement JDBC concepts
6. Develop client program using AJAX

LIST OF EXPERIMENTS:
1. Create a simple webpage using HTML5 Semantic and Structural Elements
2. Create a webpage using HTML5 Media Elements
3. Add a Cascading Style sheet for designing the web page.
4. Write a Java program which stores the user login information in database in a server,
creates user interface for inserting, deleting, retrieving information from the database, accepts
user login information and verifies it.
5. Write a Java Servlet Program to display the Current time on the server.
6. To write html and servlet to demonstrate invoking a servlet from a html.
7. Write a Java servlet program to change the Background color of the page by the color
selected by the user from the list box.
8. Write a Java servlet to get the personal details about the user(Like name, Address, City,
Age, Email id) and check whether the user is Eligible to vote or not.
9. Write a Java servlet Program to create a Cookie and keep it alive on the client for 30
minutes.
10. Write a java servlet program to display the various client information like Connection,
Host, Accept-Encoding, and User Agent.
11. To write java servlet programs to conduct online examination and to display student mark
list available in a database
12. Write a Java servlet Program to implement the Book Information using JDBC.
13. Write a Java Servlet Program to create a Session and display the various information like
Last accessed time, Modified time, Expiration)
14. Design a simple online test web page in PHP.
15. Design simple application for accessing the data using XML

Page 117 of 121

 R18 B.Tech - CSE

TEXT BOOKS:
1. Uttam K Roy, Web Technologies,Oxford University Press
2. Steven Holzner, The Complete Reference PHP,–Tata McGraw-Hill

REFERENCES:
1. Chris Bates, Wiley Dreamtech, Web Programming, building internet applications,
2nd edition.
2. PHP 5 Recipes A problem Solution Approach,Lee Babin, Nathan A Good, Frank
M.Kromann and Jon Stephens, Apress publisher, 1 st Edition 2005.
3. Internet and World Wide Web - How to Program, Deitel and Deitel and Nieto,
Prentice Hall, 5th Edition, 2011.

Page 118 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY::

PUTTUR
L T P C
(AUTONOMOUS)
III B. Tech – II Sem. - - - 2

( 18CS0526) INTERNSHIP

************

Page 119 of 121

 R18 B.Tech - CSE

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
L T P C
III B. Tech – II Sem.
- - 2 -

(18HS0859) ENGLISH FOR CORPORATE COMMUNICATION SKILLS LAB

( NON- CREDIT COURSE )
COURSE OBJECTIVES
The objectives of this course:
1. To improve the students’ fluency in English, through a well-developed vocabulary
2. To enable them listening spoken English at normal conversational speed by English
speakers
3. To respond appropriately in different social-cultural and professional contexts
4. To develop drafting skills among the students.
5. To develop Inter-personal and Intra-personal Skills

COURSE OUTCOMES (COs)

On successful completion of this course, the student will be able to
1. Flair in Writing by using cohesion and coherence.
2. Prepare effective job application.
3. 3.Presen Effective Speaking Abilities.
4. 4.Apply various communicative techniques in their professional lives.
5. 5.Cope with the employability skills.
6. Use effective communicative approaches by preparing job application, report and
7. otherkinds of spoken and written correspondences.

UNIT I
COMMUNICATIVE COMPETENCY
1. Reading Comprehension
2. Listening Comprehension
3. Vocabulary for competitive purpose
4. Spotting Errors

UNIT II
TECHNICAL WRITING
1. Report writing
2. Curriculum vitae
3. Cover Letter
4. E-mail writing

UNIT III
PRESENTATIONAL SKILLS
1. Oral presentation
2. Power point presentation
3. Poster presentation
4. Stage Dynamics
Page 120 of 121
 R18 B.Tech - CSE

UNIT IV
CORPORATE SKILLS
1. Dress code
2. Telephonic skills
3. Net-etiquettes

UNIT V
GETTING READY FOR JOB
1. Group Discussion
2. Interview skills
3. Psychometric test

Minimum requirements for English for Corporate Communication Skills Lab

1. Computer Assisted Language Learning (CALL) Lab: The Computer Assisted
Language Lab for 60 Students with 60 systems one Master Console, LAN facility and
English Language Software for self-study by learners.

2. English for Corporate Communication Skills Lab with movable chairs and audio
visual aids with a P. A. system, Projector, a Digital stereo audio & video system and
Camcorder etc.

System Requirement (Hardware component):

Computer network, LAN with minimum 60 multimedia systems with the following:
Specifications
i) a) Intel(R) core (TM) i3
b) Speed 3.10 GHZ
c) RAM – 4 GB
d) Hard Disk – 320 GB
ii) Headphones with High quality

Software
Walden Info Tech Software

REFERENCES:
1. Effective Tech Communication, Rizvi, Tata McGraw – Hill Education, 2007.
2. Communication skills, Sanjay Kumar &Pushpalatha, Oxford University Press, 2012.
3. Writing Tutor. Advanced English Learners’ Dictionary, 9th Edition, Oxford University
Press, 2015.
4. Powerful Vocabulary Builder, AnjanaAgarwal, New Age International Publishers,
2011.
5. Listening Extra, Miles Craven, Cambridge University Press, 2008.

Page 121 of 121