Cse-iot&Cs Incl BCT 1&2years CS& Syllabus Ug r20

R-20 Syllabus for CSE-IoT&CS incl., BCT, JNTUK w. e. f.
2020 – 21
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India
DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY
COURSE STRUCTURE AND SYLLABUS

For UG – R20
B. Tech - COMPUTER SCIENCE & ENGINEERING with Specialization
IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY
(Applicable for batches admitted from 2020-2021)

KAKINADA - 533 003, Andhra Pradesh, India
R-20 Syllabus for CSE-IoT&CS incl., BCT, JNTUK w. e. f. 2020 – 21

COURSE STRUCTURE
I Year – I SEMESTER
Course
S. No Subjects L T P Credits
Code
1 BS1101 Mathematics - I 3 0 0 3
2 BS1104 Applied Physics 3 0 0 3
3 HS1101 Communicative English 3 0 0 3
4 ES1101 Computer Engineering Workshop 1 0 4 3
5 ES1102 Programming for Problem Solving Using C 3 0 0 3
6 HS1102 English Communication skills Laboratory 0 0 3 1.5
7 BS1105 Applied Physics Lab 0 0 3 1.5
8 ES1103 Programming for Problem Solving Using C Lab 0 0 3 1.5
Total Credits 19.5
I Year – II SEMESTER
Course
S. No Subjects L T P Credits
Code
1 BS1202 Mathematics – II 3 0 0 3
2 BS1206 Applied Chemistry 3 0 0 3
3 ES1204 Problem Solving Using Python 3 0 0 3
4 ES1205 Basic Electrical& Electronics Engineering 3 0 0 3
5 ES1206 Digital Logic Design 3 0 0 3
6 ES1207 Problem Solving Using Python Lab 0 0 3 1.5
7 BS1207 Applied Chemistry Lab 0 0 3 1.5
8 ES1208 Digital Logic Design Lab 0 0 3 1.5
9 MC1203 Constitution of India 2 0 0 0
Total Credits 19.5

II Year – I SEMESTER
Course
S. No Course Title L T P C
Code
1. BSC2101 Mathematics – III 3 0 0 3
Mathematical Foundations of Computer
2. PCC2101 3 0 0 3
Science
3. PCC2102 Data Structures 3 0 0 3
4. PCC2103 Operating Systems 3 0 0 3
5. PCC2104 Java Programming 3 0 0 3
6. PCC2105 Data Structures Lab 0 0 3 1.5
7. PCC2106 OS&UNIX Programming Lab 0 0 3 1.5
8. PCC2107 Java Programming Lab 0 0 3 1.5
9. SC2101 Free and Open Source Software 0 0 4 2
10. MC2101 Essence of Indian Traditional Knowledge 2 0 0 0
TOTAL 21.5
II Year – II SEMESTER
Course
S. No Course Title L T P C
Code
1. ESC2201 Computer Organization& Architecture 3 0 0 3
2. BSC2201 Probability and Statistics 3 0 0 3
3. PCC2201 Formal Languages & Automata Theory 3 0 0 3
4. PCC2202 Database Management Systems 3 0 0 3
Managerial Economics and Financial
5. HSMC2201 3 0 0 3
Accountancy
6. ESC2202 Computer Organization& Architecture Lab 0 0 3 1.5
7. PCC2203 Database Management Systems Lab 0 0 3 1.5
8. PCC2204 R Programming Lab 0 0 3 1.5
9. SC2201 Android Application Development 0 0 4 2
TOTAL 21.5
Minor courses
4 0 0 4
(The hours distribution can be 3-0-2 or 3-1-0 also)
Internship 2 Months (Mandatory) during summer vacation

L T P C
I Year - I Semester
3 0 0 3
MATHEMATICS-I (BS1101)
Course Objectives
This course will illuminate the students in the concepts of calculus.

To enlighten the learners in the concept of differential equations and multivariable calculus.
To equip the students with standard concepts and tools at an intermediate to advanced level
mathematics to develop the confidence and ability among the students to handle various real
world problems and their applications.
utilize mean value theorems to real life problems (L3)
solve the differential equations related to various engineering fields (L3)
familiarize with functions of several variables which is useful in optimization (L3)
Apply double integration techniques in evaluating areas bounded by region (L3)
students will also learn important tools of calculus in higher dimensions. Students will
become familiar with 2- dimensional and 3-dimensional coordinate systems (L5 )
UNIT I: Sequences, Series and Mean value theorems: (10 hrs)
Sequences and Series: Convergences and divergence – Ratio test – Comparison tests – Integral test
– Cauchy’s root test – Alternate series – Leibnitz’s rule.
Mean Value Theorems (without proofs): Rolle’s Theorem – Lagrange’s mean value theorem –
Cauchy’s mean value theorem – Taylor’s and Maclaurin’s theorems with remainders.
UNIT II: Differential equations of first order and first degree: (10 hrs)
Linear differential equations – Bernoulli’s equations – Exact equations and equations reducible to
exact form.
Applications: Newton’s Law of cooling – Law of natural growth and decay – Orthogonal
trajectories – Electrical circuits.
UNIT III: Linear differential equations of higher order: (10 hrs)
Non-homogeneous equations of higher order with constant coefficients – with non-homogeneous

term of the type eax, sin ax, cos ax, polynomials in xn, eax V(x) and xnV(x) – Method of Variation of
parameters.
Applications: LCR circuit, Simple Harmonic motion.


UNIT IV: Partial differentiation: (10 hrs)
Introduction – Homogeneous function – Euler’s theorem – Total derivative – Chain rule – Jacobian
– Functional dependence – Taylor’s and Mc Laurent’s series expansion of functions of two
variables. Applications: Maxima and Minima of functions of two variables without constraints and
Lagrange’s method (with constraints).
UNIT V: Multiple integrals: (8 hrs)
Double and Triple integrals – Change of order of integration – Change of variables.
Applications: Finding Areas and Volumes.
Text Books:
1. B. S. Grewal, Higher Engineering Mathematics, 43rd Edition, Khanna Publishers.
2. B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc. Graw Hill
Education.
Reference Books:
1. Erwin Kreyszig, Advanced Engineering Mathematics, 10th Edition, Wiley-India.
2. Joel Hass, Christopher Heil and Maurice D. Weir, Thomas calculus, 14th Edition,
Pearson.
3. Lawrence Turyn, Advanced Engineering Mathematics, CRC Press, 2013.
4. Srimantha Pal, S C Bhunia, Engineering Mathematics, Oxford University Press.


L T P C
I Year - I Semester
3 0 0 3
APPLIED PHYSICS (BS1104)
(For All Circuital Branches like ECE, EEE, CSEetc)

Unit-I:WaveOptics 12hrs
Interference: Principle of superposition –Interference of light - Interference in thin films
(Reflection Geometry) & applications - Colors in thin films- Newton’s Rings- Determination
of wavelength and refractive index.
Diffraction: Introduction - Fresnel and Fraunhofer diffraction - Fraunhofer diffraction due

to single slit, double slit - N-slits (Qualitative) – Diffraction Grating - Dispersive power and
resolving power of Grating(Qualitative).
Polarization: Introduction-Types of polarization - Polarization by reflection, refraction and

Double refraction - Nicol’s Prism -Half wave and Quarter wave plates.
Unit Outcomes:
The students will be able to

 Explain the need of coherent sources and the conditions for sustained interference(L2)
 Identify engineering applications of interference(L3)
 Analyze the differences between interference and diffraction with applications(L4)
 Illustrate the concept of polarization of light and its applications(L2)
 Classify ordinary polarized light and extraordinary polarized light(L2)
Unit-II: Lasers andFiberoptics 8hrs

Lasers: Introduction – Characteristics of laser – Spontaneous and Stimulated emissions of
radiation – Einstein’s coefficients – Population inversion – Lasing action - Pumping
mechanisms – Ruby laser – He-Ne laser - Applications of lasers.
Fiber optics: Introduction –Principle of optical fiber- Acceptance Angle - Numerical Aperture -
Classification of optical fibers based on refractive index profile and modes –
Propagation of electromagnetic wave through optical fibers - Applications.
Unit Outcomes:

 Understand the basic concepts of LASER light Sources(L2)
 Apply the concepts to learn the types of lasers(L3)
 Identifies the Engineering applications of lasers(L2)
 Explain the working principle of optical fibers(L2)
 Classify optical fibers based on refractive index profile and mode of propagation(L2)
 Identify the applications of optical fibers in various fields(L2)

Unit III: Quantum Mechanics, Free Electron Theory andBand theory 10hrs
Quantum Mechanics: Dual nature of matter – Heisenberg’s Uncertainty Principle –
Significance and properties of wave function – Schrodinger’s time independent and dependent
wave equations– Particle in a one-dimensional infinite potential well.
Free Electron Theory: Classical free electron theory (Qualitative with discussion of merits
and demerits) – Quantum free electron theory– Equation for electrical conductivity based on
quantum free electron theory- Fermi-Dirac distribution- Density of states (3D) - Fermi
energy.
Band theory of Solids: Bloch’s Theorem (Qualitative) - Kronig - Penney model
(Qualitative)- E vs K diagram - V vs K diagram - effective mass of electron –
Classification of crystalline solids–concept of hole.
Unit Outcomes:
 Explain the concept of dual nature of matter(L2)
 Understand the significance of wave function(L2)
 Interpret the concepts of classical and quantum free electron theories(L2)
 Explain the importance of K-Pmodel
 Classify the materials based on band theory(L2)
 Apply the concept of effective mass of electron(L3)
Unit-IV: Dielectric andMagneticMaterials 8hrs

DielectricMaterials: Introduction - Dielectric polarization - Dielectric polarizability,
Susceptibility and Dielectric constant - Types of polarizations- Electronic (Quantitative),
Ionic (Quantitative) and Orientation polarizations (Qualitative) - Lorentz internal field-
Clausius- Mossotti equation-Piezoelectricity.
Magnetic Materials: Introduction - Magnetic dipole moment -Magnetization-Magnetic
susceptibility and permeability - Origin of permanent magnetic moment - Classificationof
magnetic materials: Dia, para, Ferro, antiferro&Ferri magnetic materials - Domain concept
for Ferromagnetism & Domain walls (Qualitative) - Hysteresis - soft and hard magnetic
materials- Eddy currents- Engineering applications.
Unit Outcomes:

 Explain the concept of dielectric constant and polarization in dielectric materials(L2)
 Summarize various types of polarization of dielectrics(L2)
 Interpret Lorentz field and Claussius- Mosotti relation indielectrics(L2)
 Classify the magnetic materials based on susceptibility and their temperature
dependence (L2)
 Explain the applications of dielectric and magnetic materials(L2)
 Apply the concept of magnetism to magnetic data storage devices(L3)
R-20 Syllabus for CSE-IoT&CS incl., BCT, JNTUK w. e. f. 2020 –

Unit – V: SemiconductorsandSuperconductors 10hrs
Semiconductors: Introduction- Intrinsic semiconductors – Density of charge carriers – Electrical

conductivity – Fermi level – extrinsic semiconductors – density of charge carriers – dependence of
Fermi energy on carrier concentration and temperature - Drift and diffusion currents – Einstein’s
equation- Hall effect – Hall coefficient –Applications of Hall effect.
Superconductors: Introduction – Properties of superconductors – Meissner effect – Type I and Type
II superconductors – BCS theory (Qualitative) – Josephson effects (AC and DC) – SQUIDs
– High Tc superconductors – Applications ofsuperconductors.
Unit Outcomes:

 Classify the energy bands of semiconductors(L2)
 Interpret the direct and indirect band gap semiconductors(L2)
 Identify the type of semiconductor using Hall effect(L2)
 Identify applications of semiconductors in electronic devices(L2)
 Classify superconductors based on Meissner’s effect(L2)
 Explain Meissner’s effect, BCS theory & Josephson effect in superconductors(L2)
Text books:
1. M. N. Avadhanulu, P.G.Kshirsagar& TVS Arun Murthy” A Text book ofEngineering
Physics”- S.Chand Publications, 11thEdition2019.
2. Engineering Physics” by D.K.Bhattacharya and PoonamTandon, 1 st edition, Oxford press, 2015.
3. Applied Physics by P.K.Palanisamy 3rd edition, SciTechpublications, 2013.
Reference Books:
1. Fundamentals of Physics – Halliday, Resnick and Walker,10th edition, John Wiley&Sons, 2013.
2. Engineering Physics by M.R.Srinivasan, New Age international publishers, 2009.
3. Shatendra Sharma, Jyotsna Sharma, “ Engineering Physics”, 1 st edition, Pearson Education,2018.
4. Engineering Physics - Sanjay D. Jain, D. Sahasrabudhe and Girish, 1st edition, UniversityPress,
2010.
5. Semiconductor physics and devices- Basic principle – Donald A, Neamen, 3rd edition, Mc
GrawHill, 2003.
6. B.K. Pandey and S. Chaturvedi, Engineering Physics, 1 st edition, CengageLearning, 2013.

L T P C
I Year - I Semester
3 0 0 3
COMMUNICATIVE ENGLISH (HS1101)
Introduction
The course is designed to train students in receptive (listening and reading) as well as productive and
interactive (speaking and writing) skills by incorporating a comprehensive, coherent and integrated
approach that improves the learners’ ability to effectively use English language in academic/ workplace
contexts. The shift is from learning about the language to using the language. On successful completion of
the compulsory English language course/s in B.Tech., learners would be confident of appearing for
international language qualification/proficiency tests such as IELTS, TOEFL, or BEC, besides being able to
express themselves clearly in speech and competently handle the writing tasks and verbal ability component
of campus placement tests. Activity based teaching-learning methods would be adopted to ensure that
learners would engage in actual use of language both in the classroom and laboratory sessions.
Course Objectives
➢ Facilitate effective listening skills for better comprehension of academic lectures and English spoken
by native speakers
➢ Focus on appropriate reading strategies for comprehension of various academic texts and authentic
materials
➢ Help improve speaking skills through participation in activities such as role plays, discussions and
structured talks/oral presentations
➢ Impart effective strategies for good writing and demonstrate the same in summarizing, writing well
organized essays, record and report useful information
➢ Provide knowledge of grammatical structures and vocabulary and encourage their appropriate use in
speech and writing
Learning Outcomes
At the end of the module, the learners will be able to
 understand social or transactional dialogues spoken by native speakers of English and identify the
context, topic, and pieces of specific information
 ask and answer general questions on familiar topics and introduce oneself/others
 employ suitable strategies for skimming and scanning to get the general idea of a text and locate
specific information
 recognize paragraph structure and be able to match beginnings/endings/headings with paragraphs
 form sentences using proper grammatical structures and correct word forms

Unit 1:
Lesson-1: A Drawer full of happiness from “Infotech English”, Maruthi Publications
Lesson-2: Deliverance by Premchandfrom “The Individual Society”,Pearson Publications. (Non-

detailed)
Listening: Listening to short audio texts and identifying the topic. Listening to prose, prose and
conversation.
Speaking: Asking and answering general questions on familiar topics such as home, family, work, studies
and interests. Self introductions and introducing others.
Reading: Skimming text to get the main idea. Scanning to look for specific pieces of information.
Reading for Writing: Paragraph writing (specific topics) using suitable cohesive devices; linkers, sign
posts and transition signals; mechanics of writing - punctuation, capital letters.
Vocabulary: Technical vocabulary from across technical branches (20) GRE Vocabulary (20) (Antonyms
and Synonyms, Word applications) Verbal reasoning and sequencing of words.
Grammar: Content words and function words; word forms: verbs, nouns, adjectives and adverbs; nouns:
countables and uncountables; singular and plural basic sentence structures; simple question form - wh-
questions; word order in sentences.
Pronunciation: Vowels, Consonants, Plural markers and their realizations
Unit 2:
Lesson-1: Nehru’s letter to his daughter Indira on her birthday from “Infotech English”, Maruthi
Publications
Lesson-2: Bosom Friend by HiraBansodefrom “The Individual Society”, Pearson Publications.(Non-

detailed)
Listening: Answering a series of questions about main idea and supporting ideas after listening to audio
texts, both in speaking and writing.
Speaking: Discussion in pairs/ small groups on specific topics followed by short structured talks. Functional
English: Greetings and leave takings.Reading: Identifying sequence of ideas; recognizing verbal techniques
that help to link the ideas in a paragraph together.
Reading for Writing: Summarizing - identifying main idea/s and rephrasing what is read; avoiding
redundancies and repetitions.
Vocabulary: Technical vocabulary from across technical branches (20 words). GRE Vocabulary Analogies
(20 words) (Antonyms and Synonyms, Word applications)
Grammar: Use of articles and zero article; prepositions.
Pronunciation: Past tense markers, word stress-di-syllabic words


Unit 3:
Lesson-1: Stephen Hawking-Positivity ‘Benchmark’ from “Infotech English”, Maruthi Publications
Lesson-2: Shakespeare’s Sister by Virginia Woolf from “The Individual Society”, Pearson
Publications.(Non-detailed)
Listening:Listening for global comprehension and summarizing what is listened to, both in speaking and
writing.
Speaking: Discussing specific topics in pairs or small groups and reporting what is
discussed.FunctionalEnglish:Complaining and Apologizing.
Reading: Reading a text in detail by making basic inferences - recognizing and interpreting specific context
clues; strategies to use text clues for comprehension.Critical reading.
Reading for Writing: Summarizing - identifying main idea/s and rephrasing what is read; avoiding
redundancies and repetitions. Letter writing-types, format and principles of letter writing.E-mail etiquette,
Writing CV’s.
Vocabulary: Technical vocabulary from across technical branches (20 words). GRE Vocabulary (20 words)
(Antonyms and Synonyms, Word applications) Association, sequencing of words
Grammar: Verbs - tenses; subject-verb agreement; direct and indirect speech, reporting verbs for academic
purposes.
Pronunciation: word stress-poly-syllabic words.
Unit 4:
Lesson-1: Liking a Tree, Unbowed: WangariMaathai-biography from “Infotech English”, Maruthi

Publications
Lesson-2: Telephone Conversation-Wole Soyinka from “The Individual Society”, Pearson

Publications.(Non-detailed)
Listening: Making predictions while listening to conversations/ transactional dialogues without video (only
audio); listening to audio-visual texts.
Speaking: Role plays for practice of conversational English in academic contexts (formal and informal) -
asking for and giving information/directions.Functional English: Permissions, Requesting, Inviting.
Reading: Studying the use of graphic elements in texts to convey information, reveal
trends/patterns/relationships, communicative process or display complicated data.
Reading for Writing: Information transfer; describe, compare, contrast, identify significance/trends based
on information provided in figures/charts/graphs/tables.Writing SOP, writing for media.
Vocabulary: Technical vocabulary from across technical branches (20 words) GRE Vocabulary (20 words)
(Antonyms and Synonyms, Word applications) Cloze Encounters.
Grammar: Quantifying expressions - adjectives and adverbs; comparing and contrasting; degrees of
comparison; use of antonyms
Pronunciation: Contrastive Stress


Unit 5:
Lesson-1: Stay Hungry-Stay foolish from “Infotech English”, Maruthi Publications
Lesson-2: Still I Rise by Maya Angelou from “The Individual Society”, Pearson Publications.(Non-
detailed)
Listening: Identifying key terms, understanding concepts and interpreting the concepts both in speaking and
writing.
Speaking: Formal oral presentations on topics from academic contexts - without the use of PPT
slides.Functional English: Suggesting/Opinion giving.
Reading: Reading for comprehension. RAP StrategyIntensive reading and Extensive reading techniques.
Reading for Writing: Writing academic proposals- writing research articles: format and style.
Vocabulary: Technical vocabulary from across technical branches (20 words) GRE Vocabulary (20 words)
(Antonyms and Synonyms, Word applications) Coherence, matching emotions.
Grammar: Editing short texts – identifying and correcting common errors in grammar and usage (articles,
prepositions, tenses, subject verb agreement)
Pronunciation: Stress in compound words

Prescribed text books for theory for Semester-I:
1. “Infotech English”, Maruthi Publications. (Detailed)
2. “The Individual Society”, Pearson Publications.(Non-detailed)
Prescribed text book for Laboratory for Semesters-I & II:
1. “Infotech English”, Maruthi Publications. (with Compact Disc)
Reference Books:
 Bailey, Stephen. Academic writing: A handbook for international students. Routledge, 2014.
 Chase, Becky Tarver. Pathways: Listening, Speaking and Critical Thinking. Heinley ELT;
2nd Edition, 2018.
 Skillful Level 2 Reading & Writing Student's Book Pack (B1) Macmillan Educational.
 Hewings, Martin. Cambridge Academic English (B2). CUP, 2012.

L T P C
I Year - I Semester
1 0 4 3
COMPUTER ENGINEERING WORKSHOP (ES1101)
Course Objectives:
 To make the students aware of the basic hardware components of a computer and installation of
operating system.
 To introduce Raptor Tool for flowchart creation.
 To introduce programming through Visual Programming tool using scratch.
 To get knowledge in awareness of cyber hygiene that is protecting the personal computer from
getting infected with the viruses, worms and other cyber-attacks.
 To introduce the usage of Productivity tools in crafting professional word documents, excel
spreadsheets and power point presentations using open office tools.
UNIT I
Simple Computer System: Central processing unit, the further need of secondary storage, Types of memory,
Hardware, Software and people. Peripheral Devices: Input, Output and storage, Data Preparation, Factors
affecting input, Input devices, Output devices, Secondary devices, Communication between the CPU and
Input/ Output devices.
TASK 1: PC Hardware: PC Hardware introduces the students to a personal computer and its basic
peripherals, the process of assembling a personal computer, installation of system software like MS
Windows, Linux and the required device drivers. In addition hardware and software level
troubleshooting process, tips and tricks would be covered.
Every student should identify the peripherals of a computer, components in a CPU and its functions.
Draw the block diagram of the CPU along with the configuration of each peripheral and submit to your
instructor. Every student should disassemble and assemble the PC back to working condition.
TASK 2: Hardware Troubleshooting: Students have to be given a PC which does not boot due to
improper assembly or defective peripherals. They should identify the problem and fix it to get the
computer back to working condition.
Software Troubleshooting: Students have to be given a malfunctioning CPU due to system software
problems. They should identify the problem and fix it to get the computer back to working condition.
UNIT II
Problem Solving and Programming: Algorithm development, Flowcharts, Looping, some programming
features, Pseudo code, the one-zero game, some structured programming concepts, documents.
Programming Languages: Machine Language and assembly language, high -level and low level languages,
Assemblers, Compilers, and Interpreters
TASK 3: Drawing flowcharts (Raptor Tool)

1. Create flowcharts for take-off landing of an Aeroplane.
2. Create a flowchart to validate an email id entered by user.
3. Create flowchart to print first 50 prime numbers.
TASK 4: Productivity tool:LaTeX and Microsoft (MS) office: Importance of MS office, Details of the
three tasks and features that should be covered in each, MS word, Power Point, Excel.

UNIT III
Operating systems: Introduction, Evolution of operating systems, , Command Interpreter, Popular operating
systems- Microsoft DOS, Microsoft Windows, UNIX and Linux.
Introduction to Unix Shell Commands, directory management commands, file operations, users commands,
Time and Date commands.
TASK 5: Operating System Installation: Every student should individually install operating system
like Linux or MS windows on the personal computer. The system should be configured as dual boot with
both windows and Linux.
TASK 6: Basic Commands:Unix Shell Commands, directory management commands, file operations,
users commands, Time and Date commands.
UNIT IV
Computer Networks: Introduction to computer Networks, Network topologies-Bus topology, star topology,
Ring topology, Mesh topology, Hybrid topology, Types of Networks: Local area Network, Wide Area
Networks, Metropolitan Networks, Campus/ Corporate Area Network, Personal Area Network, Network
Devices- Hub, Repeater, Switch, Bridge, Router, Gateway, Network interface Card, Basic Networking
Commands.
TASK 7: Orientation & Connectivity Boot Camp: Students should get connected to their Local Area
Network and access the Internet. In the process they configure the TCP/IP setting. Finally students
should demonstrate how to access the websites and email.
TASK 8: Networking Commands:
ping, ssh, ifconfig, scp, netstat, ipstat, nslookup, traceroute, telnet, host, ftp, arp, wget,route
UNIT V
Introduction to HTML : Basics in Web Design, Brief History of Internet ,World Wide Web Why create a
web site ,Web Standards, HTML Documents ,Basic structure of an HTML document Creating an HTML
document ,Mark up Tags ,Heading-Paragraphs ,Line Breaks ,HTML Tags.
Elements of HTML: Introduction to elements of HTML, Working with Text, Working with Lists, Tables
and Frames, Working with Hyperlinks, Images and Multimedia ,Working with Forms and controls.
TASK 9: Basic HTML tags

1.Head Section and Elements of Head Section, Paragraphs, Formatting Styles.
2. Colour tags, Creating Hyperlinks, Images, Tables, lists
3. HTML Forms, Form Attributes, Form Elements.

TASK 10: Web Browsers, Surfing the Web: Students customize their web browsers with the LAN proxy
settings, bookmarks, search toolbars and pop up blockers. Also, plug-ins like Macromedia Flash and JRE for
applets should be configured. Search Engines & Netiquette: Students should know what search engines are
and how to use the search engines. Usage of search engines like Google, Yahoo, ask.com and others should
be demonstrated by student.
TASK 11: Cyber Hygiene: Students should learn about viruses on the internet and install antivirus
software. Student should learn to customize the browsers to block pop ups, block active x downloads to
avoid viruses and/or worms.
Text Books:
1. Fundamentals of Computers –ReemaThareja-Oxford higher education
2. Computer Fundamentals, Anita Goel, Pearson Education, 2017
3. PC Hardware Trouble Shooting Made Easy, TMH
4. Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson, 2013.
Reference Books:
1) An Introduction to Web Design, Programming, 1st Edition, Paul S Wang, Sanda S Katila, Cengage
Learning, 2003.
2) An Introduction to Computer studies –Noel Kalicharan-Cambridge

L T P C
I Year - I Semester
3 0 0 3
PROGRAMMING FOR PROBLEM SOLVING USING C (ES1102)
Course Objectives
The objectives of Programming for Problem Solving Using C are
1) To learn about the computer systems, computing environments, developing of a computer program
and Structure of a C Program
2) To gain knowledge of the operators, selection, control statements and repetition in C
3) To learn about the design concepts of arrays, strings, enumerated structure and union types. To
learn about their usage.
4) To assimilate about pointers, dynamic memory allocation and know the significance of
Preprocessor.
5) To assimilate about File I/O and significance of functions
UNIT I
Introduction to Computers: Creating and running Programs, Computer Numbering System, Storing
Integers, Storing Real Numbers
Introduction to the C Language: Background, C Programs, Identifiers, Types, Variable, Constants,
Input/output, Programming Examples, Scope, Storage Classes and Type Qualifiers.
Structure of a C Program: Expressions Precedence and Associativity, Side Effects, Evaluating
Expressions, Type Conversion Statements, Simple Programs, Command Line Arguments.
UNIT II
Bitwise Operators: Exact Size Integer Types, Logical Bitwise Operators, Shift Operators.
Selection & Making Decisions: Logical Data and Operators, Two Way Selection, Multiway Selection,
More Standard Functions
Repetition: Concept of Loop, Pretest and Post-test Loops, Initialization and Updating, Event and Counter
Controlled Loops, Loops in C, Other Statements Related to Looping, Looping Applications, Programming
Examples
UNIT III
Arrays: Concepts, Using Array in C, Array Application, Two Dimensional Arrays, Multidimensional
Arrays, Programming Example – Calculate Averages
Strings: String Concepts, C String, String Input / Output Functions, Arrays of Strings, String
Manipulation Functions String/ Data Conversion, A Programming Example – Morse Code Enumerated,
Structure, and Union: The Type Definition (Type def), Enumerated Types, Structure, Unions, and
Programming Application
UNIT IV
Pointers: Introduction, Pointers to pointers, Compatibility, L value and R value
Pointer Applications: Arrays, and Pointers, Pointer Arithmetic and Arrays, Memory Allocation Function,
Array of Pointers, Programming Application
Processor Commands: Processor Commands

UNIT V
Functions: Designing, Structured Programs, Function in C, User Defined Functions, Inter-Function
Communication, Standard Functions, Passing Array to Functions, Passing Pointers to Functions, Recursion
Text Input / Output: Files, Streams, Standard Library Input / Output Functions, Formatting Input / Output
Functions, Character Input / Output Functions
Binary Input / Output: Text versus Binary Streams, Standard Library, Functions for Files, Converting File
Type.
COURSE OUTCOMES:
Upon the completion of the course the student will learn
1) To write algorithms and to draw flowcharts for solving problems

2) To convert flowcharts/algorithms to C Programs, compile and debug programs
3) To use different operators, data types and write programs that use two-way/ multi-way selection
4) To select the best loop construct for a given problem
5) To design and implement programs to analyze the different pointer applications
6) To decompose a problem into functions and to develop modular reusable code
To apply File I/O operations
TEXT BOOKS:
1. Programming for Problem Solving, Behrouz A. Forouzan, Richard F.Gilberg, CENGAGE
2. The C Programming Language, Brian W.Kernighan, Dennis M. Ritchie, 2e, Pearson
REFERENCES:
1. Computer Fundamentals and Programming, Sumithabha Das, Mc Graw Hill
2. Programming in C, Ashok N. Kamthane, Amit Kamthane, Pearson
3. Computer Fundamentals and Programming in C, PradipDey, Manas Ghosh, OXFORD

L T P C
I Year - I Semester
0 0 3 1.5
ENGLISH COMMUNICATION SKILLS LABORATORY (HS1102)
TOPICS
UNIT I:
Vowels, Consonants, Pronunciation, Phonetic Transcription, Common Errors in Pronunciation,
UNIT II:
Word stress-di-syllabic words, poly-syllabic words, weak and strong forms, contrastive stress
(Homographs)
UNIT III:
Stress in compound words,rhythm, intonation,accentneutralisation.
UNIT IV:
Listening to short audio texts and identifying the context and specific pieces of information toanswer a
series of questions in speaking.
UNIT V:
Newspapers reading;Understanding and identifying key terms and structures useful for writing reports.
Prescribed text book: “Infotech English”, Maruthi Publications.
References:
1. Exercises in Spoken English Part 1,2,3,4, OUP and CIEFL.
2. English Pronunciation in use- Mark Hancock, Cambridge University Press.
3. English Phonetics and Phonology-Peter Roach, Cambridge University Press.
4. English Pronunciation in use- Mark Hewings, Cambridge University Press.
5. English Pronunciation Dictionary- Daniel Jones, Cambridge University Press.
6. English Phonetics for Indian Students- P. Bala Subramanian, Mac Millan Publications.

L T P C
I Year - I Semester
0 0 3 1.5
APPLIED PHYSIC LAB (BS1105)
(For All Circuital Branches like CSE, ECE, EEE etc.)

(Any 10 of the following listed experiments)
List of Applied Physics Experiments
1. Determination of thickness of thin object by wedgemethod.

2. Determination of radius of curvature of a given plano convex lens by Newton’srings.
3. Determination of wavelengths of different spectral lines in mercury spectrumusing
diffraction grating in normal incidence configuration.
4. Determination of dispersive power of theprism.
5. Determination of dielectric constant using charging and dischargingmethod.
6. Study the variation of B versus H by magnetizing the magnetic material (B-Hcurve).
7. Determination of numerical aperture and acceptance angle of an opticalfiber.
8. Determination of wavelength of Laser light using diffractiongrating.
9. Estimation of Planck’s constant using photoelectriceffect.
10. Determination of the resistivity of semiconductor by four probemethod.
11. To determine the energy gap of a semiconductor using p-n junctiondiode.
12. Magnetic field along the axis of a current carrying circular coil by Stewart & Gee’s
Method
13. Determination of Hall voltage and Hall coefficient of a given semiconductor usingHall
Effect .
14. Measurement of resistance of a semiconductor with varyingtemperature.
15. Resistivity of a Superconductor using four probe method &Meissnereffect.
References:
1. S. Balasubramanian, M.N. Srinivasan “A Text Book of Practical Physics”- S Chand
Publishers,2017.

L T P C
I Year - I Semester
0 0 3 1.5
PROGRAMMING FOR PROBLEM SOLVING USING C LAB (ES1103)
Course Objectives:
Apply the principles of C language in problem solving.
To design flowcharts, algorithms and knowing how to debug programs.
To design & develop of C programs using arrays, strings pointers & functions.
To review the file operations, preprocessor commands.
Course Outcomes:
By the end of the Lab, the student
Gains Knowledge on various concepts of a C language.
Able to draw flowcharts and write algorithms.
Able design and development of C problem solving skills.
Able to design and develop modular programming skills.
Able to trace and debug a program
Exercise 1:
1. Write a C program to print a block F using hash (#), where the F has a height of six characters and
width of five and four characters.
2. Write a C program to compute the perimeter and area of a rectangle with a height of 7 inches and
width of 5 inches.
3. Write a C program to display multiple variables.
Exercise 2:
1. Write a C program to calculate the distance between the two points.
2. Write a C program that accepts 4 integers p, q, r, s from the user where r and s are positive and p is
even. If q is greater than r and s is greater than p and if the sum of r and s is greater than the sum of p
and q print "Correct values", otherwise print "Wrong values".
Exercise 3:
1. Write a C program to convert a string to a long integer.
2. Write a program in C which is a Menu-Driven Program to compute the area of the various
geometrical shape.
3. Write a C program to calculate the factorial of a given number.
Exercise 4:
1. Write a program in C to display the n terms of even natural number and their sum.
2. Write a program in C to display the n terms of harmonic series and their sum.
1 + 1/2 + 1/3 + 1/4 + 1/5 ... 1/n terms.
3. Write a C program to check whether a given number is an Armstrong number or not.
Exercise 5:
1. Write a program in C to print all unique elements in an array.
2. Write a program in C to separate odd and even integers in separate arrays.
3. Write a program in C to sort elements of array in ascending order.

Exercise 6:
1. Write a program in C for multiplication of two square Matrices.
2. Write a program in C to find transpose of a given matrix.
Exercise 7:
1. Write a program in C to search an element in a row wise and column wise sorted matrix.
2. Write a program in C to print individual characters of string in reverse order.
Exercise 8:
1. Write a program in C to compare two strings without using string library functions.
2. Write a program in C to copy one string to another string.
Exercise 9:
1. Write a C Program to Store Information Using Structures with Dynamically Memory Allocation
2. Write a program in C to demonstrate how to handle the pointers in the program.
Exercise 10:
1. Write a program in C to demonstrate the use of & (address of) and *(value at address) operator.
2. Write a program in C to add two numbers using pointers.
Exercise 11:
1. Write a program in C to add numbers using call by reference.
2. Write a program in C to find the largest element using Dynamic Memory Allocation.
Exercise 12:
1. Write a program in C to swap elements using call by reference.
2. Write a program in C to count the number of vowels and consonants in a string using a pointer.
Exercise 13:
1. Write a program in C to show how a function returning pointer.
2. Write a C program to find sum of n elements entered by user. To perform this program, allocate
memory dynamically using malloc( ) function.
Exercise 14:
1. Write a C program to find sum of n elements entered by user. To perform this program, allocate
memory dynamically using calloc( ) function. Understand the difference between the above two
programs
2. Write a program in C to convert decimal number to binary number using the function.
Exercise 15:
1. Write a program in C to check whether a number is a prime number or not using the function.
2. Write a program in C to get the largest element of an array using the function.
Exercise 16:
1. Write a program in C to append multiple lines at the end of a text file.
2. Write a program in C to copy a file in another name.
3. Write a program in C to remove a file from the disk.

L T P C
I Year - II Semester
3 0 0 3
MATHEMATICS - II (BS1202)
Course Objectives
To instruct the concept of Matrices in solving linear algebraic equations

To elucidate the different numerical methods to solve nonlinear algebraic equations
To disseminate the use of different numerical techniques for carrying out numerical integration.
To equip the students with standard concepts and tools at an intermediate to advanced level
mathematics to develop the confidence and ability among the students to handle various
realworld problems and their applications.
Course Outcomes: At the end of the course, the student will be able to
 Develop the use of matrix algebra techniques that is needed by engineers for practical
applications (L6)
 Solve system of linear algebraic equations using Gauss elimination, Gauss Jordan, Gauss
Seidel (L3)
 Evaluate approximating the roots of polynomial and transcendental equations by different
algorithms (L5)
 Apply Newton’s forward & backward interpolation and Lagrange’s formulae for equal and
unequal intervals (L3)
 Apply different algorithms for approximating the solutions of ordinary differential
equations to its analytical computations (L3)
Unit I: Solving systems of linear equations, Eigen values and Eigen vectors:(10 hrs)
Rank of a matrix by echelon form and normal form – Solving system of homogeneous and non-
homogeneous equations linear equations – Gauss Elimination for solving system of equations – Eigen
values and Eigen vectors and their properties.
Unit-II:Cayley-Hamilton theorem and Quadratic forms: (10 hrs)

Cayley- Hamilton theorem (without proof) – Finding inverse and power of a matrix by Cayley-Hamilton
theorem – Reduction to Diagonal form – Quadratic forms and nature of the quadratic forms –Reduction of
quadratic form to canonical forms by orthogonal transformation.
Singular values of a matrix, singular value decomposition (Ref. Book – 1).
UNIT III: Iterative methods: (8 hrs)

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

Introduction – Errors in polynomial interpolation – Finite differences – Forward differences – Backward
differences – Central differences – Relations between operators – Newton’s forward and backward formulae
for interpolation – Interpolation with unequal intervals – Lagrange’s interpolation formula – Newton’s
divide difference formula.

UNIT V: Numerical integration and solution of ordinary differential equations: (10 hrs)
Trapezoidal rule – Simpson’s 1/3rd and 3/8th rule – Solution of ordinary differential equations by Taylor’s
series – Picard’s method of successive approximations – Euler’s method – Runge-Kutta method (second and
fourth order).
Text Books:
1. B. S. Grewal, Higher Engineering Mathematics, 43rd Edition, Khanna Publishers.
2. B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc. Graw Hill Education.
Reference Books:
1. David Poole, Linear Algebra- A modern introduction, 4th Edition, Cengage.
2. Steven C. Chapra, Applied Numerical Methods with MATLAB for Engineering and Science, Tata
Mc. Graw Hill Education.
3. M. K. Jain, S. R. K. Iyengar and R. K. Jain, Numerical Methods for Scientific and Engineering
Computation, New Age International Publications.
4. Lawrence Turyn, Advanced Engineering Mathematics, CRC Press.

L T P C
3 0 0 3
APPLIED CHEMISTRY (BS1206)
Knowledge of basic concepts of Chemistry for Engineering students will help them as professional
engineers later in design and material selection, as well as utilizing the available resources.
COURSE OBJECTIVES
 Importance of usage of plastics in household appliances and composites (FRP) in aerospace and
automotive industries.
 Outline the basics for the construction of electrochemical cells, batteries and fuel cells. Understand
the mechanism of corrosion and how it can be prevented.
 Explain the preparation of semiconductors and nanomaterials, engineering applications of
nanomaterials, superconductors and liquid crystals.
 Recall the increase in demand for power and hence alternative sources of power are studied due to
depleting sources of fossil fuels. Advanced instrumental techniques are introduced.
 Outline the basics of computational chemistry and molecular switches
UNIT I: POLYMER TECHNOLOGY 8 hrs

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

Single electrode potential, electrochemical series and uses of series, standard hydrogen electrode, calomel
electrode, construction of glass electrode, batteries (Dry cell, Li ion battery and zinc air cells), fuel cells (H 2-
O2, CH3OH-O2, phosphoric acid and molten carbonate).
Corrosion:-Definition, theories of corrosion (chemical and electrochemical), galvanic corrosion, differential
aeration corrosion, stress corrosion, galvanic series, factors influencing rate of corrosion, corrosion control
(proper designing and cathodic protection), Protective coatings (surface preparation, cathodic coatings,
anodic coatings, electroplating and electroless plating [nickel]), Paints (constituents, functions and special
paints).
 Utilize the theory of construction of electrodes, batteries and fuel cells in redesigning new
engineering products and categorize the reasons for corrosion and study methods to control
corrosion.

UNIT III: MATERIAL CHEMISTRY 10 hrs

Part I: Non-elementalsemiconducting materials:- Stoichiometric, controlled valency&chalcogen
photo/semiconductors-preparation of semiconductors (distillation, zone refining, Czochralski crystal pulling,
epitaxy, diffusion, ion implantation) - Semiconductor devices (p-n junction diode as rectifier, junction
transistor).
Insulators &magnetic materials: electrical insulators-ferro and ferri magnetism-Hall effect and its
applications.
Part II:
Nano materials:- Introduction, sol-gel method, characterization by (BrunauerEmmet Teller [BET]),
(scanning electron microscopy [SEM]) and (transmission electron microscopy [TEM]), applications of
graphene and fullerenes, carbon nanotubes (types, preparation and applications)
Liquid crystals:- Introduction-types-applications.
Super conductors:-Type –I, Type II-characteristics and applications
 Synthesize nanomaterials for modern advances of engineering technology.
 Summarize the preparation of semiconductors; analyze the applications of liquid crystals and
superconductors.
UNIT IV:SPECTROSCOPIC TECHNIQUES &NON-CONVENTIONAL ENERGY SOURCES

10 hrs
Part A: SPECTROSCOPIC TECHNIQUES
Electromagnetic spectrum-UV (laws of absorption, instrumentation, theory of electronic spectroscopy,
Frank-condon principle, chromophores and auxochromes, intensity shifts, applications), FT-IR
[instrumentation and differentiation of sp, sp2, sp3 and IR stretching of functional groups (alcohols,
carbonyls, amines) applications], magnetic resonance imaging and CT scan (procedure & applications).
Part B: NON-CONVENTIONAL ENERGY SOURCES
Design, working, schematic diagram, advantages and disadvantages of photovoltaic cell, hydropower,
geothermal power, tidal and wave power, ocean thermal energy conversion.
 Analyze the principles of different analytical instruments and their applications.
 Design models for energy by different natural sources.
UNIT V: ADVANCED CONCEPTS/TOPICS IN CHEMISTRY 8 hrs

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

Standard Books:
1. P.C. Jain and M. Jain “Engineering Chemistry”, 15/e, DhanpatRai& Sons, Delhi, (Latest edition).
2. Shikha Agarwal, “Engineering Chemistry”, Cambridge University Press, New Delhi, (2019).
3. S.S. Dara, “A Textbook of Engineering Chemistry”, S.Chand& Co, (2010).
4. Shashi Chawla, “Engineering Chemistry”, DhanpatRaiPublicating Co. (Latest edition).
Reference:
1. K. SeshaMaheshwaramma and MridulaChugh, “Engineering Chemistry”, Pearson India Edn.
2. O.G. Palana, “Engineering Chemistry”, Tata McGraw Hill Education Private Limited, (2009).
3. CNR Rao and JM Honig (Eds) “Preparation and characterization of materials” Academic press,
New York (latest edition)
4. B. S. Murthy, P. Shankar and others, “Textbook of Nanoscience and Nanotechnology”, University
press (latest edition)

L T P C
I Year – II Semester
3 0 0 3
PROBLEM SOLVING USING PYTHON (ES1204)
Course Objectives:
The Objectives of Python Programming are
To learn about Python programming language syntax, semantics, and the runtime environment
To be familiarized with universal computer programming concepts like data types, containers
To be familiarized with general computer programming concepts like conditional execution, loops &
functions
To be familiarized with general coding techniques and object-oriented programming
Course Outcomes:
Develop essential programming skills in computer programming concepts like data types, containers
Apply the basics of programming in the Python language
Solve coding tasks related conditional execution, loops
Solve coding tasks related to the fundamental notions and techniques used in object-oriented
programming
UNIT I
Introduction: Introduction to Python, Program Development Cycle, Input, Processing, and Output,
Displaying Output with the Print Function, Comments, Variables, Reading Input from the Keyboard,
Performing Calculations, Operators. Type conversions, Expressions, More about Data Output.
Data Types, and Expression: Strings Assignment, and Comment, Numeric Data Types and Character Sets,
Using functions and Modules.
Decision Structures and Boolean Logic: if, if-else, if-elif-else Statements, Nested Decision Structures,
Comparing Strings, Logical Operators, Boolean Variables. Repetition Structures: Introduction, while loop,
for loop, Calculating a Running Total, Input Validation Loops, Nested Loops.
UNIT II
Control Statement: Definite iteration for Loop Formatting Text for output, Selection if and if else Statement
Conditional Iteration The While Loop
Strings and Text Files: Accessing Character and Substring in Strings, Data Encryption, Strings and Number
Systems, String Methods Text Files.
UNIT III
List and Dictionaries: Lists, Defining Simple Functions, Dictionaries
Design with Function: Functions as Abstraction Mechanisms, Problem Solving with Top Down Design,
Design with Recursive Functions, Case Study Gathering Information from a File System, Managing a
Program’s Namespace, Higher Order Function.
Modules: Modules, Standard Modules, Packages.

UNIT IV
File Operations: Reading config files in python, Writing log files in python, Understanding read functions,
read(), readline() and readlines(), Understanding write functions, write() and writelines(), Manipulating file
pointer using seek, Programming using file operations
Object Oriented Programming: Concept of class, object and instances, Constructor, class attributes and
destructors, Real time use of class in live projects, Inheritance , overlapping and overloading operators,
Adding and retrieving dynamic attributes of classes, Programming using Oops support
Design with Classes: Objects and Classes, Data modeling Examples, Case Study An ATM, Structuring
Classes with Inheritance and Polymorphism
UNIT V
Errors and Exceptions: Syntax Errors, Exceptions, Handling Exceptions, Raising Exceptions, User-defined
Exceptions, Defining Clean-up Actions, Redefined Clean-up Actions.
Graphical User Interfaces: The Behavior of Terminal Based Programs and GUI -Based, Programs, Coding
Simple GUI-Based Programs, Other Useful GUI Resources.
Programming: Introduction to Programming Concepts with Scratch.
Text Books
1) Fundamentals of Python First Programs, Kenneth. A. Lambert, Cengage.
2) Python Programming: A Modern Approach, VamsiKurama, Pearson.
Reference Books:
1) Introduction to Python Programming, Gowrishankar.S, Veena A, CRC Press.
2) Introduction to Programming Using Python, Y. Daniel Liang, Pearson.
e-Resources:
1) https://www.tutorialspoint.com/python3/python_tutorial.pdf

L T P C
3 0 0 3
BASIC ELECTRICAL & ELETRONICS ENGINEERING (ES1205)
This course introduces the student, the fundamentals of electrical engineering concepts needed for future
courses to be learned. The first three units cover the electric circuit laws, theorems and electrical machines.
The next two units cover the principles of Electro static and electromechanical conversions, measurement of
electrical quantities, electrical safety and batteries.
Course Objectives:
 Study the basic DC and AC networks used in electrical circuits.
 Study the basic concepts of electrical engineering.
 Demonstrate the concepts of electrical wiring and safety.
• To understand the principle of operation and construction details of DC machines &
Transformers.
• To understand the principle of operation and construction details of alternator and 3-Phase
Inductionmotor.
UNIT I
Introduction: Concept of Potential difference, voltage, current, Fundamental linear passive and active
elements to their functional current-voltage relation, voltage source and current sources, ideal and practical
sources, concept of dependent and independent sources, Kirchhoff-s laws and applications to network
solutions using mesh and nodal analysis, Concept of work, power and energy.
Series – Parallel Circuits – Inductive & Capacitive networks.
UNIT II
DC Circuits: Current-voltage relations of the electric network by mathematical equations to analyze the
network (Thevenin’s theorem, Norton's Theorem, Maximum Power Transfer theorem), Superposition
theorem. Simplifications of networks using series-parallel, Star/Delta transformation.
AC Circuits: AC waveform definitions, form factor, peak factor, study of R-L, R-C, RLC series circuit,
phasor representation in polar and rectangular form, concept of impedance, admittance, active, reactive,
apparent and complex power, power factor.
UNIT III
Dc Machines:
Principle of operation of DC generator – EMF equation - Types of DC machine – Torque equation –
Applications.
Transformers:
Principle of operation and construction of single phase transformers – EMF equation – Losses.
UNIT IV
AC Rotating Machines:
Principle of operation and construction of alternators– Types of alternators – Principle of operation
ofsynchronous motor - Principle of operation of 3-Phase induction motor – Slip-torque characteristics -
Efficiency –Applications.

Unit V
Rectifiers & Linear ICs:
PN junction diodes - Diode applications(Half wave and bridge rectifiers).Characteristics of operation
amplifiers(OP-AMP) - application of OP-AMPs (inverting, non-inverting, integrator and differentiator).
Transistors:PNP and NPN junction transistor, transistor as an amplifier- Transistor amplifier - Frequency
response of CEamplifier - Concepts of feedback amplifier.
Text Book(s)
1. B. L. Theraja, A Textbook of Electrical Technology, (vol. I), 1/e, Chand and Company Ltd., New
Delhi, 2005.
2. V. K. Mehta, Basic Electrical Engineering, 6/e, S. Chand and Company Ltd., New Delhi, 2012.
3. J. Nagrath and Kothari, Theory and problems of Basic Electrical Engineering, 2/e, Prentice Hall of
India Pvt. Ltd., 2017.
4. Electrical Technology by Surinder Pal Bali, Pearson Publications.
5. Electronic Devices and Circuits, R.L. Boylestad and Louis Nashelsky, 9th edition, PEI/PHI 2006.
References
1. T. K. Nagsarkar and M. S. Sukhija, Basic of Electrical Engineering, 2/e, Oxford University Press,
2011.
2. Smarjith Ghosh, Fundamentals of Electrical and Electronics Engineering, 1/e, Prentice Hall (India)
Pvt. Ltd., 2004.
3. Electrical Circuit Theory and Technology by John Bird, Routledge Taylor &Francis Group
4. Basic Electrical Engineering by M.S.Naidu and S.Kamakshiah,TMH Publication
5. Basic Electrical Engineering by Nagsarkar,Sukhija, Oxford Publications, 2nd edition
6. Industrial Electronics by G.K. Mittal, PHI

L T P C
3 0 0 3
DIGITAL LOGIC DESIGN (ES1206)
Course Objective
 To study the basic philosophy underlying the various number systems, negative number
representation, binary arithmetic, theory of Boolean algebra and map method for minimization
of switching functions.
 To introduce the basic tools for design of combinational and sequential digital logic.
 To learn simple digital circuits in preparation for computer engineering.
UNIT- I: Digital Systems and Binary Numbers

Digital Systems, Binary Numbers, Octal and Hexadecimal Numbers, Complements of Numbers, Signed
Binary Numbers, Arithmetic addition and subtraction, 4-bit codes: BCD, EXCESS 3, alphanumeric
codes, 9’s complement, 2421, etc..
UNIT -II: Concept of Boolean algebra

Basic Theorems and Properties of Boolean algebra, Boolean Functions, Canonical and Standard Forms,
Minterms and Maxterms.
Gate level Minimization
Map Method, Three-Variable K-Map, Four Variable K-Maps. Products of Sum Simplification, Sum of
Products Simplification, Don’t – Care Conditions, NAND and NOR Implementation, Exclusive‐OR
Function.
UNIT- III:Combinational Logic

Introduction, Analysis Procedure, Binary Adder–Subtractor, Binary Multiplier, Decoders, Encoders,
Multiplexers, Demultiplexers, Priority Encoder, Code Converters, Magnitude Comparator, HDL Models
of Combinational Circuits.
Realization of Switching Functions Using PROM, PAL and PLA.
UNIT- IV: Synchronous Sequential Logic

Introduction to Sequential Circuits, Storage Elements: Latches, Flip‐Flops, RS- Latch Using NAND and
NOR Gates, Truth Tables. RS, JK, T and D Flip Flops, Truth and Excitation Tables, Conversion of Flip
Flops.
UNIT -V: Registers and Counters

Registers, Shift Registers, Ripple Counters, Synchronous Counters, Ring Counter, Johnson Counter.

OUTCOMES:
A student who successfully fulfills the course requirements will have demonstrated:
An ability to define different number systems, binary addition and subtraction, 2’s
complement representation and operations with this representation.
An ability to understand the different switching algebra theorems and apply them forlogic
functions.
An ability to define the Karnaugh map for a few variables and perform an
algorithmic reduction of logic functions.
Students will be able to design various logic gates starting from simple ordinary gates
to complex programmable logic devices & arrays.
Students will be able to design various sequential circuits starting from flip-flop to
registers and counters.
TEXT BOOKS:
1. Digital Design, 5/e, M.Morris Mano, Michael D Ciletti, PEA.
2. Fundamentals of Logic Design, 5/e, Roth, Cengage.
REFERENCE BOOKS:
1. Digital Logic and Computer Design, M.Morris Mano, PEA.
2. Digital Logic Design, Leach, Malvino, Saha, TMH.
3. Modern Digital Electronics, R.P. Jain, TMH.

L T P C
0 0 3 1.5
PROBLEM SOLVING USING PYTHON LAB (ES1207)
Course Objectives:
The aim of Python Programming Lab is
To acquire programming skills in core Python.
To acquire Object Oriented Skills in Python
To develop the skill of designing Graphical user Interfaces in Python
To develop the ability to write database applications in Python
Course Outcomes:
By the end of this lab, the student is able to
Write, Test and Debug Python Programs
Use Conditionals and Loops for Python Programs
Use functions and represent Compound data using Lists, Tuples and Dictionaries
Use various applications using python
1) Write a program that asks the user for a weight in kilograms and converts it to pounds. There are 2.2
pounds in a kilogram.
2) Write a program that asks the user to enter three numbers (use three separate input statements).
Create variables called total and average that hold the sum and average of the three numbers and
print out the values of total and average.
3) Write a program that uses a for loop to print the numbers 8, 11, 14, 17, 20, . . . , 83, 86, 89.
4) Write a program that asks the user for their name and how many times to print it. The program
should print out the user’s name the specified number of times.
5) Use a for loop to print a triangle like the one below. Allow the user to specify how high the triangle
should be.
*
**
***
****
6) Generate a random number between 1 and 10. Ask the user to guess the number and print a message
based on whether they get it right or not.
7) Write a program that asks the user for two numbers and prints Close if the numbers are within .001
of each other and Not close otherwise.
8) Write a program that asks the user to enter a word and prints out whether that word contains any
vowels.
9) Write a program that asks the user to enter two strings of the same length. The program should then
check to see if the strings are of the same length. If they are not, the program should print an
appropriate message and exit. If they are of the same length, the program should alternate the
characters of the two strings. For example, if the user enters abcde and ABCDE the program should
print out AaBbCcDdEe.

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

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

L T P C
0 0 3 1.5
APPLIED CHEMISTRY LAB (BS1207)
Introduction to Chemistry laboratory – Molarity, normality, primary, secondary standard solutions,

volumetric titrations, quantitative analysis
Determination of HCl using standard Na2CO3 solution.
1. Determination of alkalinity of a sample containing Na2CO3 and NaOH.

2. Determination of Mn+2 using standard oxalic acid solution.
3. Determination of ferrous iron using standard K2Cr2O7 solution.
4. Determination of Cu+2 using standard hypo solution.
5. Determination of temporary and permanent hardness of water using standard EDTA solution.
6. Determination of Fe+3 by a colorimetric method.
7. Determination of the concentration of acetic acid using sodium hydroxide (pH-metry method).
8. Determination of iso-electric point of amino acids using pH-metry method/conductometric method.
9. Determination of the concentration of strong acid vs strong base (by conductometric method).
10. Determination of strong acid vs strong base (by potentiometric method).
11. Determination of Mg+2 presentin an antacid.
12. Determination of CaCO3 present in an egg shell.
13. Estimation of Vitamin C.
14. Determination of phosphoric content in soft drinks.
15. Adsorption of acetic acid by charcoal.
16. Preparation of nylon-6, 6 and Bakelite (demonstration only).
Of the above experiments at-least 10 assessment experiments should be completed in a semester.
Outcomes: The students entering into the professional course have practically very little exposure to lab
classes. The experiments introduce volumetric analysis; redox titrations with different indicators; EDTA
titrations; then they are exposed to a few instrumental methods of chemical analysis. Thus at the end of the
lab course, the student is exposed to different methods of chemical analysis and use of some commonly
employed instruments. They thus acquire some experimental skills.
Reference Books
1. A Textbook of Quantitative Analysis, Arthur J. Vogel.

L T P C
0 0 3 1.5
DIGITAL LOGIC DESIGN LAB (ES1208)
COURSE OBJECTIVES:
The objectives of this course are to:
 Introduce the concept of digital and binary systems.
 To know the concepts of Combinational circuits.
 Be able to design and analyze Sequential logic circuits.
 To understand the concepts of flip-flops, registers and counters.
 Students will learn and understand the basics of logic gates and circuits.
COURSE OUTCOMES:
 A student who successfully fulfils the course requirements will have demonstrated:
 CO1: To learn about the basics of gates.
 CO2: To understand, analyse and design the basic digital circuits and any digital design in real
time applications.
 CO3: Construct basic combinational circuits and verify their functionalities.
 CO4: Apply the design procedures to design basic sequential circuits.
 CO5: An ability to measure and record the experimental data, analyse the results, and prepare
a formal laboratory report.
List of Experiments:
1. Verification of Basic Logic Gates.
2. Implementing all individual gates with Universal Gates NAND & NOR.
3. Design a circuit for the given Canonical form, draw the circuit diagram and verify the De-
Morgan laws.
4. Design a Combinational Logic circuit for 8x1 MUX and verify the truth table.
5. Verify the data read and data write operations for the IC 74189.
6. Construct Half Adder and Full Adder using Half Adder and verify the truth table.
7. Design a 4-bit Adder/Subtractor.
8. Design and realization of 4-bit comparator.
9. Design and implement a 3 to 8 decoder using gates.
10. Design and realization of a 4-bit Gray to Binary and Binary to Gray converter.
11. Implementation of Master Slave Flip-Flop with J-K Flip- Flop and verify the truth table for
race around condition.
12. Design a Decade Counter and verify the truth table.
13. Design and implement a 4-bit shift register using Flip flops.
14. Design and Verify the 4-bit synchronous.
15. Design and verify 4-bit ripple counter (Asynchronous).

TEXT BOOKS:
1. Digital Design ,4/e, M.Morris Mano, Michael D Ciletti, PEA.
2. Fundamentals of Logic Design, 5/e, Roth, Cengage.
3. Digital Logic Design, Leach, Malvino, Saha,TMH.
REFERENCES:
1. Switching and Finite Automata Theory,3/e,Kohavi, Jha, Cambridge.
2. Verilog HDL primer, Jaya Bhaskar, PEA.
3. Modern Digital Electronics, R.P. Jain, TMH.
4. Digital Fundamentals, Thomas L. Floyd, Pearson Education, ISBN:9788131734483.

L T P C
2 0 0 0
CONSTITUTION OF INDIA (MC1203)
Course Objectives:
 To Enable the student to understand the importance of constitution
 To understand the structure of executive, legislature and judiciary
 To understand philosophy of fundamental rights and duties
 To understand the autonomous nature of constitutional bodies like Supreme Court and high
court
 Controller and auditor general of India and election commission of India.
 To understand the central and state relation financial and administrative.
UNIT-I
Introduction to Indian Constitution: Constitution meaning of the term, Indian Constitution - Sources
and constitutional history, Features - Citizenship, Preamble, Fundamental Rights and Duties,
Directive Principles of State Policy.
Learning outcomes:
After completion of this unit student will
● Understand the concept of Indian constitution
● Apply the knowledge on directive principle of state policy
● Analyze the History, features of Indian constitution
● Evaluate Preamble Fundamental Rights and Duties
UNIT-II
Union Government and its Administration Structure of the Indian Union: Federalism, Centre- State
relationship, President: Role, power and position, PM and Council of ministers, Cabinet and Central
Secretariat, LokSabha, RajyaSabha, The Supreme Court and High Court: Powers and Functions;
Learning outcomes:-After completion of this unit student will
● Understand the structure of Indian government
● Differentiate between the state and central government
● Explain the role of President and Prime Minister
● Know the Structure of supreme court and High court
UNIT-III
State Government and its Administration Governor - Role and Position - CM and Council of
ministers, State Secretariat: Organisation, Structure and Functions
● Understand the structure of state government
● Analyze the role Governor and Chief Minister
● Explain the role of state Secretariat
● Differentiate between structure and functions of state secretariat
UNIT-IV
A.Local Administration - District’s Administration Head - Role and Importance, Municipalities - Mayor
and role of Elected Representative - CEO of Municipal Corporation PachayatiRaj: Functions PRI:
ZilaPanchayat, Elected officials and their roles, CEO

Zila Panchayat: Block level Organizational Hierarchy - (Different departments), Village level - Role
of Elected and Appointed officials - Importance of grass root democracy
● Understand the local Administration
● Compare and contrast district administration role and importance
● Analyze the role of Myer and elected representatives of Municipalities
● Evaluate Zillapanchayat block level organisation
UNIT-V
Election Commission: Election Commission- Role of Chief Election Commissioner and Election
Commissionerate State Election Commission:,Functions of Commissions for the welfare of SC/ST/OBC
and women
● Know the role of Election Commission apply knowledge
● Contrast and compare the role of Chief Election commissioner and Commissiononerate
● Analyze role of state election commission
● Evaluate various commissions of viz SC/ST/OBC and women
References:
1. Durga Das Basu, Introduction to the Constitution of India, Prentice – Hall of India Pvt.Ltd.. New
Delhi
2. SubashKashyap, Indian Constitution, National Book Trust
3. J.A. Siwach, Dynamics of Indian Government & Politics
4. D.C. Gupta, Indian Government and Politics
5. H.M.Sreevai, Constitutional Law of India, 4th edition in 3 volumes (Universal Law Publication)
6. J.C. Johari, Indian Government andPolitics Hans
7. J. Raj IndianGovernment and Politics
8. M.V. Pylee, Indian Constitution Durga Das Basu, Human Rights in Constitutional Law, Prentice –
Hall of India Pvt. Ltd.. New Delhi
9. Noorani, A.G., (South Asia Human Rights Documentation Centre), Challenges to Civil Right),
Challenges to Civil Rights Guarantees in India, Oxford University Press 2012
ConstitutionCourse Outcomes:
At the end of the semester/course, the student will be able to have a clear knowledge on the following:
 Understand historical background of the constitution making and its importance for building a
democratic India.
 Understand the functioning of three wings of the government ie., executive, legislative and judiciary.
 Understand the value of the fundamental rights and duties for becoming good citizen of India.
 Analyze the decentralization of power between central, state and local self-government.
 Apply the knowledge in strengthening of the constitutional institutions like CAG, Election
Commission and UPSC for sustaining democracy.
1. Know the sources, features and principles of Indian Constitution.
2. Learn about Union Government, State government and its administration.
3. Get acquainted with Local administration and Pachayati Raj.
4. Be aware of basic concepts and developments of Human Rights.
5. Gain knowledge on roles and functioning of Election Commission
***

L T P C
II Year - I Semester 3 0 0 3
MATHEMATICS - III (BSC2101)
Course Objectives:
To familiarize the techniques in partial differentialequations
To furnish the learners with basic concepts and techniques at plus two level to lead them
into advanced level by handling various real worldapplications.
Course Outcomes:
At the end of the course, the student will be able to
Interpret the physical meaning of different operators such as gradient, curl and divergence(L5)
Estimate the work done against a field, circulation and flux using vector calculus (L5)
Apply the Laplace transform for solving differential equations(L3)
Find or compute the Fourier series of periodic signals(L3)
Know and be able to apply integral expressions for the forwards and inverse Fourier
transform to a range of non-periodic waveforms(L3)
Identify solution methods for partial differential equations that model physical processes(L3)
UNIT I: Vectorcalculus:
Vector Differentiation: Gradient – Directional derivative – Divergence – Curl – Scalar Potential.
Vector Integration: Line integral – Work done – Area – Surface and volume integrals – Vector
integral theorems: Greens, Stokes and Gauss Divergence theorems (without proof).
UNIT II: LaplaceTransforms:

Laplace transforms of standard functions – Shifting theorems – Transforms of derivatives and
integrals – Unit step function – Dirac’s delta function – Inverse Laplace transforms – Convolution
theorem (without proof).
Applications: Solving ordinary differential equations (initial value problems) using Laplace
transforms.
UNIT III: Fourier series andFourierTransforms:

Fourier Series: Introduction – Periodic functions – Fourier series of periodic function – Dirichlet’s
conditions – Even and odd functions – Change of interval – Half-range sine and cosine series.
Fourier Transforms: Fourier integral theorem (without proof) – Fourier sine and cosine integrals –
Sine and cosine transforms – Properties – inverse transforms – Finite Fourier transforms.
UNIT IV: PDE of first order:

Formation of partial differential equations by elimination of arbitrary constants and arbitrary
functions – Solutions of first order linear (Lagrange) equation and nonlinear (standard types)
equations.

UNIT V: Second order PDE and Applications:

Second order PDE: Solutions of linear partial differential equations with constant coefficients –
RHS term of the type eax by,sin( ax by), cos(ax by), x myn.
Applications of PDE: Method of separation of Variables – Solution of One dimensional Wave, Heat and
two-dimensional Laplace equation.
Text Books:
1) B. S. Grewal, Higher Engineering Mathematics, 43rd Edition, KhannaPublishers.
2) B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc. GrawHill
Education.
Reference Books:
1) Erwin Kreyszig, Advanced Engineering Mathematics, 10thEdition,Wiley-India.
2) Dean. G. Duffy, Advanced Engineering Mathematics with MATLAB, 3rd Edition, CRC
Press.
3) Peter O’ Neil, Advanced Engineering Mathematics,Cengage.
4) Srimantha Pal, S C Bhunia, Engineering Mathematics, Oxford UniversityPress.

L T P C
II Year – I Semester
3 0 0 3
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (PCC2101)
Course Objectives:
This course is designed to:
 To introduce the students to the topics and techniques of discrete methods and
combinatorialreasoning
 To introduce a wide variety of applications. The algorithmic approach to the solution of
problems is fundamental in discrete mathematics, and this approach reinforces the close
ties between this discipline and the area of computerscience
Course Outcomes:
At the end of the course student will be able to
 Demonstrate skills in solving mathematicalproblems
 Comprehend mathematical principles andlogic
 Demonstrate knowledge of mathematical modeling and proficiency in using mathematical
software
 Manipulate and analyze data numerically and/or graphically using appropriateSoftware
 Communicate effectively mathematical ideas/results verbally or inwriting
UNIT I
Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives, Well
Formed Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality Law,
Tautological Implications, Normal Forms, Theory of Inference for Statement Calculus,
Consistency of Premises, Indirect Method of Proof, Predicate Calculus: Predicates, Predicative
Logic, Statement Functions, Variables and Quantifiers, Free and Bound Variables, Inference
Theory for Predicate Calculus.
UNIT II
Set Theory: Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties,
Operations, Partition and Covering, Transitive Closure, Equivalence, Compatibility and Partial
Ordering, Hasse Diagrams, Functions: Bijective, Composition, Inverse, Permutation, and
Recursive Functions, Lattice and its Properties, Algebraic Structures: Algebraic Systems,
Properties, Semi Groups and Monoids, Group, Subgroup and Abelian Group, Homomorphism,
Isomorphism.
UNIT III
Combinatorics: Basis of Counting, Permutations, Permutations with Repetitions, Circular and
Restricted Permutations, Combinations, Restricted Combinations, Binomial and Multinomial
Coefficients and Theorems, Number Theory: Properties of Integers, Division Theorem, Greatest
Common Divisor, Euclidean Algorithm, Least Common Multiple, Testing for Prime Numbers,
The Fundamental Theorem of Arithmetic, Modular Arithmetic, Fermat’s and Euler’sTheorems

UNIT IV
Recurrence Relations: Generating Functions, Function of Sequences, Partial Fractions, Calculating
Coefficient of Generating Functions, Recurrence Relations, Formulation as Recurrence Relations,
SolvingRecurrence Relations by Substitution and Generating Functions, Method of Characteristic
Roots, Solving Inhomogeneous Recurrence Relations.
UNIT V
Graph Theory: Basic Concepts, Graph Theory and its Applications, Sub graphs, Graph
Representations: Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits,
Eulerian and Hamiltonian Graphs, Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem,
Graph Colouring and Covering, Chromatic Number, Spanning Trees, Prim’s and Kruskal’s
Algorithms, BFS and DFS Spanning Trees.
Text Books:
1) Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay
and P. Manohar, Tata McGrawHill.
2) Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D. P.
Mohapatra, 3rd Edition, Tata McGrawHill.
Reference Books:
1) Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A. Kandel
and T. P. Baker, 2nd Edition, Prentice Hall ofIndia.
2) Discrete Mathematical Structures, BernandKolman, Robert C. Busby and Sharon Cutler
Ross,PHI.
3) Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K. H.
Rosen, 7th Edition, Tata McGrawHill.
e-Resources:
1) https://nptel.ac.in/courses/106/106/106106094/

L T P C
3 0 0 3
DATA STRUCTURES(PCC2102)
Course Objectives:
The objective of the course is to
Introduce the fundamental concept of data structures and abstract datatypes
Emphasize the importance of data structures in developing and implementing efficient
algorithms
Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are
represented in memory and used byalgorithms
Course Outcomes:
After completing this course a student will be able to:
Summarize the properties, interfaces, and behaviors of basic abstract datatypes
Discuss the computational efficiency of the principal algorithms for sorting &searching
Use arrays, records, linked structures, stacks, queues, trees, and Graphs in writing
programs
Demonstrate different methods for traversingtrees
UNIT I
Data Structures - Definition, Classification of Data Structures, Operations on Data Structures,
Abstract Data Type (ADT), Preliminaries of algorithms. Time and Space complexity.
Searching - Linear search, Binary search, Fibonacci search.
Sorting- Insertion sort, Selection sort, Exchange (Bubble sort, quick sort), distribution (radix sort),
merging (Merge sort) algorithms.
UNIT II
Linked List: Introduction, Single linked list, Representation of Linked list in memory, Operations
on Single Linked list-Insertion, Deletion, Search and Traversal ,Reversing Single Linked list,
Applications on Single Linked list- Polynomial Expression Representation ,Addition and
Multiplication, Sparse Matrix Representation using Linked List, Advantages and Disadvantages
of Single Linked list, Double Linked list-Insertion, Deletion, Circular Linked list-Insertion,
Deletion.
UNIT III
Queues: Introduction to Queues, Representation of Queues-using Arrays and using Linked list,
Implementation of Queues-using Arrays and using Linked list, Application of Queues-Circular
Queues, Deques, Priority Queues, Multiple Queues.
Stacks: Introduction to Stacks, Array Representation of Stacks, Operations on Stacks, Linked list
Representation of Stacks, Operations on Linked Stack, Applications-Reversing list, Factorial
Calculation, Infix to Postfix Conversion, Evaluating Postfix Expressions.
UNIT IV
Trees: Basic Terminology in Trees, Binary Trees-Properties, Representation of Binary Trees
using Arrays and Linked lists. Binary Search Trees- Basic Concepts, BST Operations: Insertion,
Deletion, Tree Traversals, Applications-Expression Trees, Heap Sort, Balanced Binary Trees-
AVL Trees, Insertion, Deletion andRotations.

UNIT V
Graphs: Basic Concepts, Representations of Graphs-Adjacency Matrix and using Linked list,
Graph Traversals (BFT & DFT), Applications- Minimum Spanning Tree Using
Prims&KruskalsAlgorithm, Dijkstra’s shortest path, Transitive closure, Warshall’s Algorithm.
Text Books:
1) Data Structures Using C. 2ndEdition.ReemaThareja,Oxford.
2) Data Structures and algorithm analysis in C, 2nded, Mark AllenWeiss.
Reference Books:
1) Fundamentals of Data Structures in C, 2nd Edition, Horowitz, Sahni, UniversitiesPress.
2) Data Structures: A PseudoCode Approach, 2/e, Richard F.Gilberg, BehrouzA. Forouzon,
Cengage.
3) Data Structures with C, Seymour LipschutzTMH
e-Resources:
1) http://algs4.cs.princeton.edu/home/
2) https://faculty.washington.edu/jstraub/dsa/Master_2_7a.pdf

L T P C
3 0 0 3
OPERATING SYSTEMS(PCC2103)
Course Objectives:
The objectives of this course is to
 Introduce to the internal operation of modern operatingsystems
 Define, explain, processes and threads, mutual exclusion, CPU scheduling,deadlock,
memory management, and filesystems
 Understand File Systems in Operating System like UNIX/Linux andWindows
 Understand Input Output Management and use of Device Driver and Secondary Storage
(Disk)Mechanism
 Analyze Security and Protection Mechanism in OperatingSystem
Course Outcomes:
After learning, the course the students should be able to:
 Describe various generations of Operating System and functions of OperatingSystem
 Describe the concept of program, process and thread and analyze various CPU Scheduling
Algorithms and compare theirperformance
 Solve Inter Process Communication problems using Mathematical Equations by various
methods
 Compare various Memory Management Schemes especially paging and Segmentation in
Operating System and apply various Page ReplacementTechniques
Outline File Systems in Operating System like UNIX/Linux andWindows
UNIT I
Operating Systems Overview: Operating system functions, Operating system structure, Operating
systems operations, Computing environments, Open-Source Operating Systems.
System Structures: Operating System Services, User and Operating-System Interface, systems
calls, Types of System Calls, system programs, operating system structure, operating system
debugging, System Boot.
UNIT II
Process Concept: Process scheduling, Operations on processes, Inter-process communication,
Communication in client server systems.
Multithreaded Programming: Multithreading models, Thread libraries, Threading issues.
Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple
processor scheduling, Thread scheduling.
Inter-process Communication: Race conditions, Critical Regions, Mutual exclusion with busy
waiting, Sleep and wakeup, Semaphores, Mutexes, Monitors, Message passing, Barriers, Classical
IPC Problems - Dining philosophers problem, Readers and writers problem.

UNIT III
Memory-Management Strategies: Introduction, Swapping, Contiguous memory allocation,
Paging,Segmentation.
Virtual Memory Management: Introduction, Demand paging, Copy on-write, Page replacement,
Frame allocation, Thrashing, Memory-mapped files, Kernel memory allocation.
UNIT IV
Deadlocks: Resources, Conditions for resource deadlocks, Ostrich algorithm, Deadlock detection
and recovery, Deadlock avoidance, Deadlock prevention.
File Systems: Files, Directories, File system implementation, management and optimization.
Secondary-Storage Structure: Overview of disk structure, and attachment, Disk scheduling, RAID
structure, Stable storage implementation.
UNIT V
System Protection: Goals of protection, Principles and domain of protection, Access matrix,
Access control, Revocation of access rights.
System Security: Introduction, Program threats, System and network threats, Cryptography for
security, User authentication, Implementing security defenses, Firewalling to protect systems and
networks, Computer security classification.
Case Studies: Linux, Microsoft Windows.
Text Books:
1) SilberschatzA, Galvin P B, and Gagne G, Operating System Concepts, 9th edition, Wiley,
2013.
2) Tanenbaum A S, Modern Operating Systems, 3rd edition, Pearson Education, 2008.
(forInterprocess Communication and Filesystems.)
Reference Books:
1) Dhamdhere D M, Operating Systems A Concept Based Approach, 3rd edition, Tata
McGraw-Hill,2012.
2) Stallings W, Operating Systems -Internals and Design Principles, 6th edition, Pearson
Education,2009
3) Nutt G, Operating Systems, 3rd edition, Pearson Education,2004.
e-Resources:

L T P C
3 0 0 3
JAVA PROGRAMMING(PCC2104)
Course Objectives:
The learning objectives of this course are:
 To identify Java language components and how they work together inapplications
 To learn the fundamentals of object-oriented programming in Java, including defining
classes, invoking methods, using classlibraries.
 To learn how to extend Java classes with inheritance and dynamic binding and how to use
exception handling in Javaapplications
 To understand how to design applications with threads inJava
 To understand how to use Java APIs for programdevelopment
Course Outcomes:
By the end of the course, the student will be
 Able to realize the concept of Object Oriented Programming & Java Programming
Constructs
 Able to describe the basic concepts of Java such as operators, classes, objects, inheritance,
packages, Enumeration and variouskeywords
 Apply the concept of exception handling and Input/ Outputoperations
 Able to design the applications of Java &Javaapplet
 Able to Analyze& Design the concept of Event Handling and Abstract Window Toolkit
UNIT I
Program Structure in Java: Introduction, Writing Simple Java Programs, Elements or Tokens in Java
Programs, Java Statements, Command Line Arguments, User Input to Programs, Escape Sequences
Comments, Programming Style.
Data Types, Variables, and Operators :Introduction, Data Types in Java, Declaration of Variables,
Data Types, Type Casting, Scope of Variable Identifier, Literal Constants, Symbolic Constants,
Formatted Output with printf() Method, Static Variables and Methods, Attribute Final, Introduction
to Operators, Precedence and Associativity of Operators, Assignment Operator ( = ), Basic
Arithmetic Operators, Increment (++) and Decrement (- -) Operators, Ternary Operator, Relational
Operators, Boolean Logical Operators, Bitwise Logical Operators.
Control Statements: Introduction, if Expression, Nested if Expressions, if–else Expressions, Ternary

Operator?:, Switch Statement, Iteration Statements, while Expression, do–while Loop, for Loop, Nested for
Loop, For–Each for Loop, Break Statement, Continue Statement.

UNIT II
Classes and Objects: Introduction, Class Declaration and Modifiers, Class Members, Declaration of
Class Objects, Assigning One Object to Another, Access Control for Class Members, Accessing
Private Members of Class, Constructor Methods for Class, Overloaded Constructor Methods, Nested
Classes, Final Class and Methods, Passing Arguments by Value andby Reference, Keyword this.
Methods: Introduction, Defining Methods, Overloaded Methods, Overloaded Constructor Methods, Class
Objects as Parameters in Methods, Access Control, Recursive Methods, Nesting of Methods, Overriding
Methods, Attributes Final andStatic.
UNIT III
Arrays: Introduction, Declaration and Initialization of Arrays, Storage of Array in Computer
Memory, Accessing Elements of Arrays, Operations on Array Elements, Assigning Array to
Another Array, Dynamic Change of Array Size, Sorting of Arrays, Search for Values in Arrays,
Class Arrays, Two-dimensional Arrays, Arrays of Varying Lengths, Three-dimensional Arrays,
Arrays as Vectors.
Inheritance: Introduction, Process of Inheritance, Types of Inheritances, Universal Super Class-

Object Class, Inhibiting Inheritance of Class Using Final, Access Control and Inheritance,
Multilevel Inheritance, Application of Keyword Super, Constructor Method and Inheritance, Method
Overriding, Dynamic Method Dispatch, Abstract Classes, Interfaces and Inheritance.
Interfaces: Introduction, Declaration of Interface, Implementation of Interface, Multiple Interfaces, Nested
Interfaces, Inheritance of Interfaces, Default Methods in Interfaces, Static Methods in Interface, Functional
Interfaces,Annotations.
UNIT IV
Packages and Java Library: Introduction, Defining Package, Importing Packages and Classes into
Programs, Path and Class Path, Access Control, Packages in Java SE, Java.lang Package and its Classes,
Class Object, Enumeration, class Math, Wrapper Classes, Auto-boxing and Auto- unboxing, Java util
Classes and Interfaces, Formatter Class, Random Class, Time Package, Class Instant (java.time.Instant),
Formatting for Date/Time in Java, Temporal Adjusters Class, Temporal Adjusters Class.
Exception Handling: Introduction, Hierarchy of Standard Exception Classes, Keywords throws and throw,
try, catch, and finally Blocks, Multiple Catch Clauses, Class Throwable, Unchecked Exceptions, Checked
Exceptions, try-with-resources, Catching Subclass Exception, Custom Exceptions, Nested try and catch
Blocks, Rethrowing Exception, Throws Clause.
UNIT V
String Handling in Java: Introduction, Interface Char Sequence, Class String, Methods for Extracting
Characters from Strings, Methods for Comparison of Strings, Methods for Modifying Strings, Methods for
Searching Strings, Data Conversion and Miscellaneous Methods, Class String Buffer, Class StringBuilder.

Multithreaded Programming: Introduction, Need for Multiple Threads Multithreaded Programming

for Multi-core Processor, Thread Class, Main Thread- Creation of New Threads, Thread States,
Thread Priority-Synchronization, Deadlock and Race Situations, Inter-thread Communication -
Suspending, Resuming, and Stopping of Threads.
Java Database Connectivity: Introduction, JDBC Architecture, Installing MySQL and MySQL Connector/J,
JDBC Environment Setup, Establishing JDBC Database Connections, ResultSet Interface, Creating JDBC
Application, JDBC Batch Processing, JDBC Transaction Management.
Text Books:
1) JAVA one step ahead, Anitha Seth, B.L.Juneja,Oxford.
2) The complete Reference Java, 8th edition, Herbert Schildt,TMH.
3) JAVA Programming for Core and Advanced Learners, Sagayaraj, Denis, Karthik, Gajalakshmi,
Universities Press.
References Books:
1) Introduction to java programming, 7th edition by Y Daniel Liang,Pearson
2) Constructive JAVA Programming, Sagayaraj, Denis, Karthik, Gajalakshmi, Universities Press.
e-Resources:
2) https://www.w3schools.com/java/java_data_types.asp
R-20 Syllabus for CSE-IoT&CS incl., BCT, JNTUK w. e. f. 20

L T P C
0 0 3 1.5
DATA STRUCTURES LAB (PCC2105)
Course Objectives:
The objective of this lab is to
Demonstrate procedural and object oriented paradigm with concepts of streams, classes, functions,
dataandobjects.
Understand dynamic memory management techniques using pointers, constructors, destructors,etc
Demonstrate the concept of function overloading, operator overloading, virtual functions and
polymorphism,inheritance.
Demonstrate the different data structuresimplementation.
Course Outcomes:
By the end of this lab the student is able to
Use basic data structures such as arrays and linkedlist.
Programs to demonstrate fundamental algorithmic problems including Tree Traversals, Graph
traversals, and shortestpaths.
Use various searching and sortingalgorithms.
Exercise1:
Write recursive program which computes the nthFibonacci number, for appropriate values of n.
Analyzebehavior of the program Obtain the frequency count of the statement for various values of n.
Exercise 2:
Write recursive program for the following
a) Write recursive and non recursive C program for calculation of Factorial of aninteger
b) Write recursive and non recursive C program for calculation of GCD (n,m)
c) Write recursive and non recursive C program for Towers of Hanoi : N disks are to be transferred from
peg S to peg D with Peg I as the intermediatepeg.
Exercise 3:
a) Write C program that use both recursive and non recursive functions to perform Linear search for a Key
value in a givenlist.
b) Write C program that use both recursive and non recursive functions to perform Binary search for a Key
value in a givenlist.
c) Write C program that use both recursive and non recursive functions to perform Fibonacci search for a
Key value in a givenlist.
Exercise 4:
a) Write C program that implement Bubble sort, to sort a given list of integers in ascendingorder
b) Write C program that implement Quick sort, to sort a given list of integers in ascendingorder
c) Write C program that implement Insertion sort,to sort a given list of integers in ascendingorder
Exercise 5:
a) Write C program that implement heap sort, to sort a given list of integers in ascendingorder
b) Write C program that implement radix sort, to sort a given list of integers in ascendingorder
c) Write C program that implement merge sort, to sort a given list of integers in ascendingorder
Exercise 6:
a) Write C program that implement stack (its operations) usingarrays
b) Write C program that implement stack (its operations) using Linkedlist
R-20 Syllabus for CSE-IoT&CS incl., BCT, JNTUK w. e. f. 20

Exercise 7:
a) Write a C program that uses Stack operations to Convert infix expression into postfix expression
a) Write C program that implement Queue (its operations) usingarrays.
b) Write C program that implement Queue (its operations) using linkedlists
Exercise 8:
a) Write a C program that uses functions to create a singly linkedlist
b) Write a C program that uses functions to perform insertion operation on a singly linkedlist
c) Write a C program that uses functions to perform deletion operation on a singly linkedlist
Exercise 9:
a) Adding two large integers which are represented in linked listfashion.
b) Write a C program to reverse elements of a single linkedlist.
c) Write a C program to store a polynomial expression in memory using linkedlist
d) Write a C program to representation the given Sparse matrix usingarrays.
e) Write a C program to representation the given Sparse matrix using linkedlist
Exercise10:
a) Write a C program to Create a Binary Tree ofintegers
b) Write a recursive C program for Traversing a binary tree in preorder, inorderandpostorder.
c) Write a non recursive C program for Traversing a binary tree in preorder, inorderandpostorder.
d) Program to check balance property of atree.
Exercise 11:
a) Write a C program to Create aBST
b) Write a C program to insert a node into aBST.
c) Write a C program to delete a node from aBST.

L T P C
0 0 3 1.5
OS & UNIX PROGRAMMING LAB (PCC2106)
Course Objectives:
 To understand the design aspects of operatingsystem
 To study the process management concepts & Techniques
 To study the storage managementconcepts
 To familiarize students with the Linuxenvironment
 To learn the fundamentals of shellscripting/programming
Course Outcomes:
 To use Unix utilities and perform basic shell control of theutilities
 To use the Unix file system and file accesscontrol
 To use of an operating system to developsoftware
 Students will be able to use Linux environmentefficiently
 Solve problems using bash for shellscripting
1) a) Study of Unix/Linux general purpose utility command list: man,who,cat, cd, cp, ps, ls,
mv, rm, mkdir, rmdir, echo, more, date, time, kill, history, chmod, chown, finger, pwd, cal,
logout,shutdown.
b) Study of vieditor
c) Study of Bash shell, Bourne shell and C shell in Unix/Linux operatingsystem
d) Study of Unix/Linux file system (treestructure)
e) Study of .bashrc, /etc/bashrc and Environmentvariables.
2) Write a C program that makes a copy of a file using standard I/O, and systemcalls
3) Write a C program to emulate the UNIX ls–lcommand.
4) Write a C program that illustrates how to execute two commands concurrently with a
command pipe. Ex: - ls–l |sort
5) Simulate the following CPU scheduling algorithms:
(a) Round Robin (b) SJF (c) FCFS (d)Priority
6) Multiprogramming-Memory management-Implementation of fork (), wait (), exec() and
exit (), System calls
7) Simulate the following:
a) Multiprogramming with a fixed number of tasks (MFT)
b) Multiprogramming with a variable number of tasks (MVT)
8) Simulate Bankers Algorithm for Dead Lock Avoidance
9) Simulate Bankers Algorithm for Dead Lock Prevention.

10) Simulate the following page replacementalgorithms:

a) FIFO b) LRU c) LFU
11) Simulate the following File allocationstrategies
(a) Sequenced (b) Indexed (c)Linked
12) Write a C program that illustrates two processes communicatingusingshared memory
13) Write a C program to simulate producer and consumer problemusingsemaphores
14) Write C program to create a thread using pthreads library and let it run itsfunction.
15) Write a C program to illustrate concurrent execution of threads using pthreadslibrary.


L T P C
0 0 3 1.5
JAVA PROGRAMMING LAB (PCC2107)
Course Objectives:
The aim of this lab is to
 Practice programming in theJava
 Gain knowledge of object-oriented paradigm in the Java programminglanguage
 Learn use of Java in a variety of technologies and on differentplatforms
Course Outcomes:
By the end of the course student will be able to write java program for
 Evaluate default value of all primitive data type, Operations, Expressions, Control-flow,
Strings
 Determine Class, Objects, Methods, Inheritance, Exception, Runtime Polymorphism, User
defined Exception handlingmechanism
 Illustrating simple inheritance, multi-level inheritance, Exception handlingmechanism
 Construct Threads, Event Handling, implement packages, developingapplets
Exercise - 1 (Basics)
a) Write a JAVA program to display default value of all primitive data type ofJAVA
b) Write a java program that display the roots of a quadratic equation ax2+bx=0. Calculate the
discriminate D and basing on value of D, describe the nature ofroot.
c) Five Bikers Compete in a race such that they drive at a constant speed which may or may not
bethesame as the other. To qualify the race, the speed of a racer must be more than the average
speed of all 5 racers. Take as input the speed of each racer and print back the speed of qualifying
racers.
Exercise - 2 (Operations, Expressions, Control-flow, Strings)
a) Write a JAVA program to search for an element in a given list of elements using binary search
mechanism.
b) Write a JAVA program to sort for an element in a given list of elements using bubblesort
c) Write a JAVA program to sort for an element in a given list of elements using mergesort.
d) Write a JAVA program using StringBuffer to delete, removecharacter.
Exercise - 3 (Class, Objects)
a) Write a JAVA program to implement class mechanism. Create a class, methods and invoke
them inside mainmethod.
b) Write a JAVA program to implementconstructor.
Exercise - 4 (Methods)
a) Write a JAVA program to implement constructor overloading.
b) Write a JAVA program implement methodoverloading.
Exercise - 5 (Inheritance)
a) Write a JAVA program to implement SingleInheritance
b) Write a JAVA program to implement multi levelInheritance
c) Write a java program for abstract class to find areas of differentshapes

Exercise - 6 (Inheritance - Continued)

a) Write a JAVA program give example for “super”keyword.
b) Write a JAVA program to implement Interface. What kind of Inheritance can beachieved?
Exercise - 7 (Exception)
a) Write a JAVA program that describes exception handlingmechanism
b) Write a JAVA program Illustrating Multiple catchclauses
Exercise – 8 (Runtime Polymorphism)
a) Write a JAVA program that implements Runtimepolymorphism
b) Write a Case study on run time polymorphism, inheritance that implements in aboveproblem
Exercise – 9 (User defined Exception)
a) Write a JAVA program for creation of Illustratingthrow
b) Write a JAVA program for creation of Illustratingfinally
c) Write a JAVA program for creation of Java Built-inExceptions
d) d)Write a JAVA program for creation of User DefinedException
Exercise – 10 (Threads)
a) Write a JAVA program that creates threads by extending Thread class .First thread display
“Good Morning “every 1 sec, the second thread displays “Hello “every 2 seconds and the third
display “Welcome” every 3 seconds ,(Repeat the same by implementingRunnable)
b) Write a program illustrating isAliveandjoin()
c) Write a Program illustrating DaemonThreads.
Exercise - 11 (Threads continuity)
a) Write a JAVA program Producer ConsumerProblem
b) Write a case study on thread Synchronization after solving the above producer consumer
problem
Exercise – 12 (Packages)
a) Write a JAVA program illustrate classpath
b) Write a case study on including in class path in your os environment of yourpackage.
c) Write a JAVA program that import and use the defined your package in the previous Problem
Exercise - 13 (Applet)
a) Write a JAVA program to paint like paint brush inapplet.
b) Write a JAVA program to display analog clock usingApplet.
c) Write a JAVA program to create different shapes and fill colors usingApplet.

L T P C
II Year - I Semester
0 0 4 2
FREE AND OPEN SOURCE SOFTWARE (SC2101)
Course Objectives:
The student should be made to:
 Be exposed to the context and operation of free and open source software (FOSS)
communities and associated software projects.
 Be familiar with participating in a FOSS project
 Learn scripting language like Python or Perl
 Learn programming language like Ruby
 Learn some important FOSS tools and techniques
1. Getting started with Linux basic commands and directory structure, execute file, directory operations.
2. Linux commands for redirection, pipes, filters, job control, file ownership, file permissions, link sand
file system hierarchy.
3. Shell Programming: Write shell script to show various system configuration like
1 Currently logged user and his logname
2 Your current shell
3 Your home directory
4 Your operating system type
5 Your current path setting
6 Your current working directory
7 Show Currently logged number of users
4. Write shell script to show various system configuration like

1About your OS and version, release number, kernel version
2 Show all available shells
3 Show mouse settings
4 Show computer CPU information like processor type, speed etc
5 Show memory information
6 Show hard disk information like size of hard-disk, cache memory, modeletc
7 File system (Mounted)
5. Shell script program for scientific calculator.
6. Version Control System setup and usage using GIT.

1 Creating a repository
2 Checking out a repository
3 Adding content to the repository
4 Committing the data to a repository

7. Shell script to implement a script which kills every process which uses more than aspecified
value of memory or CPU and is run upon system start.
8. Running PHP : simple applications like login forms after
9. Advanced linux commands curl, wget, ftp, ssh and grep
10. Application deployment on a cloud-based LAMP stack/server with PHP eg: Openshift,
Linode etc.
11. Virtualisation environment (e.g., xen, kqemu, virtualbox or lguest) to test anapplications, new
kernels and isolate applications. It could also be used to exposestudents to other alternate
OSs like *BSD
12. Introduction to packet management system : Given a set of RPM or DEB, how to buildand
maintain, serve packages over http or ftp. and also how do you configure clientsystems to
access the package repository.
13. Installing various software packages. Either the package is yet to be installed or anolder
version is existing. The student can practice installing the latest version. Of course, this might
need Internet access.
1 Install samba and share files to windows
2 Install Common Unix Printing System(CUPS)
TEXT BOOK:
Ellen Siever, Stephen Figgins, Robert Love, Arnold Robbins, “Linux in a Nutshell”, Sixth Edition,
OReilly Media, 2009.
REFERENCES:
1. Philosophy of GNU URL: http://www.gnu.org/philosophy/.
2. Linux Administration URL: http://www.tldp.org/LDP/lame/LAME/linux-admin-made-easy/.
3. The Python Tutorial available at http://docs.python.org/2/tutorial/.

L T P C
II Year - I Semester
2 0 0 0
ESSENCE OF INDIAN TRADITIONAL KNOWLEDGE (MC2101)
Course Objectives:
To facilitate the students with the concepts of Indian traditional knowledge and to make them
understand the Importance of roots of knowledge system
The course aim of the importing basic principle of third process reasoning and inference
sustainability is at the course of Indian traditional knowledgesystem
To understand the legal framework and traditional knowledge and biological diversity act
2002 and geographical indication act2003
The courses focus on traditional knowledge and intellectual property mechanism of
traditional knowledge andprotection
To know the student traditional knowledge in differentsector
Course Outcomes:
After completion of the course, students will be able to:
Understand the concept of Traditional knowledge and itsimportance
Know the need and importance of protecting traditionalknowledge
Know the various enactments related to the protection of traditionalknowledge
Understand the concepts of Intellectual property to protect the traditionalknowledge
UNITI
Introduction to traditional knowledge: Define traditional knowledge, nature and characteristics,
scope and importance, kinds of traditional knowledge, the physical and social contexts in which
traditional knowledge develop, the historical impact of social change on traditional knowledge
systems. Indigenous Knowledge (IK), characteristics, traditional knowledge vis-à-vis indigenous
knowledge, traditional knowledge Vs western knowledge traditional knowledge vis-à-vis formal
knowledge
UNIT II
Protection of traditional knowledge: the need for protecting traditional knowledge Significance of
TK Protection, value of TK in global economy, Role of Government to harness TK.
UNIT III
Legal framework and TK: A: The Scheduled Tribes and Other Traditional Forest Dwellers (Recognition of
Forest Rights) Act, 2006, Plant Varieties Protection and Farmers Rights Act,
2001 (PPVFR Act);B:The Biological Diversity Act 2002 and Rules 2004, the protection of
traditional knowledge bill, 2016. Geographical indications act 2003.
UNIT IV
Traditional knowledge and intellectual property: Systems of traditional knowledge protection,
Legal concepts for the protection of traditional knowledge, Certain non IPR mechanisms of
traditional knowledge protection, Patents and traditional knowledge, Strategies to increase
protection of traditional knowledge, global legal FORA for increasing protection of Indian
Traditional Knowledge.

UNIT V
Traditional knowledge in different sectors: Traditional knowledge and engineering, Traditional medicine
system, TK and biotechnology, TK in agriculture, Traditional societies depend on it for their food and
healthcare needs, Importance of conservation and sustainable development of environment, Management of
biodiversity, Food security of the country and protection of TK.
Reference Books:
1) Traditional Knowledge System in India, by Amit Jha,2009.
2) Traditional Knowledge System and Technology in India by Basanta Kumar Mohanta and
Vipin Kumar Singh, PratibhaPrakashan2012.
3) Traditional Knowledge System in India by Amit Jha Atlantic publishers,2002
4) "Knowledge Traditions and Practices of India" Kapil Kapoor, MichelDanino
e-Resources:
1) https://www.youtube.com/watch?v=LZP1StpYEPM
2) http://nptel.ac.in/courses/121106003/

L T P C
II Year – II Semester
3 0 0 3
COMPUTER ORGANIZATION & ARCHITECTURE (ESC2201)
Course Objectives:
The course objectives of Computer Organization are to discuss and make student familiar with the
 Principles and the Implementation of ComputerArithmetic
 Operation of CPUs including RTL, ALU, Instruction Cycle andBusses
 FundamentalsofdifferentInstructionSetArchitecturesandtheirrelationshiptothe CPU
Design
 Memory System and I/OOrganization
 Principles of Operation of Multiprocessor Systems andPipelining
Course Outcomes:
By the end of the course, the student will
 Develop a detailed understanding of computersystems
 Cite different number systems, binary addition and subtraction, standard, floating-point,
and microoperations
 Develop a detailed understanding of architecture and functionality ofcentral processing
unit
 Exemplify in a better way the I/O and memoryorganization
 Illustrate concepts of parallel processing, pipelining and inter processor communication
UNIT I
Basic Structure of Computers: Basic Organization of Computers, Historical Perspective, Bus
Structures, Data Representation: Data types, Complements, Fixed Point Representation. Floating,
Point Representation. Other Binary Codes, Error Detection Codes.
Computer Arithmetic: Addition and Subtraction, Multiplication Algorithms, Division Algorithms.
UNIT II
Register Transfer Language and Micro operations: Register Transfer language. Register Transfer
Bus and Memory Transfers, Arithmetic Micro operations, Logic Micro Operations, Shift Micro
Operations, Arithmetic Logic Shift Unit.
Basic Computer Organization and Design: Instruction Codes, Computer Register, Computer
Instructions, Instruction Cycle, Memory – Reference Instructions. Input –Output and Interrupt,
Complete Computer Description.
UNIT III
Central Processing Unit: General Register Organization, STACK Organization. Instruction
Formats, Addressing Modes, Data Transfer and Manipulation, Program Control, Reduced
Instruction Set Computer.
Micro programmed Control: Control Memory, Address Sequencing, Micro Program example,
Design of Control Unit.

UNIT IV
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary Memory, Associative
Memory, Cache Memory, Virtual Memory.
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous data transfer,
Modes of Transfer, Priority Interrupts, Direct Memory Access.
UNIT V
Multi Processors: Introduction, Characteristics of Multiprocessors, Interconnection Structures,
Inter Processor Arbitration.
Pipeline: Parallel Processing, Pipelining, Instruction Pipeline, RISC Pipeline, Array Processor.
Text Books:
1) Computer System Architecture, M. Morris Mano, Third Edition, Pearson,2008.
2) Computer Organization, Carl Hamacher, ZvonkoVranesic, SafwatZaky, 5/e, McGraw
Hill,2002.
Reference Books:
1) Computer Organization and Architecture, William Stallings, 6/e, Pearson,2006.
2) Structured Computer Organization, Andrew S. Tanenbaum, 4/e, Pearson,2005.
3) Fundamentals of Computer Organization and Design, Sivarama P. Dandamudi, Springer,
2006.
e-Resources:
2)http://www.cuc.ucc.ie/CS1101/David%20Tarnoff.pdf

L T P C
3 0 0 3
PROBABILITY AND STATISTICS (BSC2201)
Course Objectives:
 To familiarize the students with the foundations of probability and statisticalmethods
 To impart probability concepts and statistical methods in various applicationsEngineering
Course Outcomes:
Upon successful completion of this course, the student should be able to
● Classify the concepts of data science and its importance (L4) or(L2)
● Interpret the association of characteristics and through correlation and regression tools
(L4)
● Make use of the concepts of probability and their applications(L3)
● Apply discrete and continuous probability distributions(L3)
● Design the components of a classical hypothesis test(L6)
● Infer the statistical inferential methods based on small and large sampling tests(L4)
UNIT I
Descriptive statistics and methods for data science: Data science – Statistics Introduction –
Population vs Sample – Collection of data – primary and secondary data – Type of variable:
dependent and independent Categorical and Continuous variables – Data visualization –
Measures of Central tendency – Measures of Variability (spread or variance) – Skewness
Kurtosis.
UNIT II
Correlation and Curve fitting: Correlation – correlation coefficient – rank correlation – regression
coefficients and properties – regression lines – Method of least squares – Straight line – parabola
– Exponential – Powercurves.
UNIT III
Probability and Distributions: Probability – Conditional probability and Baye’s theorem –
Random variables – Discrete and Continuous random variables – Distribution function –
Mathematical Expectation and Variance – Binomial, Poisson, Uniform and Normaldistributions.
UNIT IV
Sampling Theory:Introduction – Population and samples – Sampling distribution of Means and Variance
(definition only) – Central limit theorem (without proof) – Introduction to t, 2 and F- distributions –
Point and Interval estimations – Maximum error of estimate.

UNIT V
Tests of Hypothesis: Introduction – Hypothesis – Null and Alternative Hypothesis – Type I and
Type II errors – Level of significance – One tail and two-tail tests – Tests concerning one mean
and two means (Large and Small samples) – Tests on proportions.
Text Books:
1) Miller and Freund’s, Probability and Statistics for Engineers,7/e, Pearson,2008.
2) S. C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e,Sultan
Chand & Sons Publications,2012.
Reference Books:
1) Shron L. Myers, Keying Ye, Ronald E Walpole, Probability and Statistics Engineersand
the Scientists,8th Edition, Pearson2007.
2) Jay l. Devore, Probability and Statistics for Engineering and the Sciences, 8thEdition,
Cengage.
3) Sheldon M. Ross, Introduction to probability and statistics Engineers and the Scientists,4th
Edition, Academic Foundation, 2011.
4) Johannes Ledolter and Robert V. Hogg, Applied statistics for Engineers and Physical
Scientists, 3rd Edition, Pearson,2010.

L T P C
3 0 0 3
FORMAL LANGUAGES AND AUTOMATA THEORY (PCC2201)
Course Objectives:
 To learn fundamentals of Regular and Context Free Grammars andLanguages
 To understand the relation between Regular Language and Finite Automata andmachines
 To learn how to design Automata’s and machines as Acceptors, Verifiers and Translators
 To understand the relation between Contexts free Languages, PDA andTM
 To learn how to design PDA as acceptor and TM asCalculators
Course Outcomes:
By the end of the course students can
 Classify machines by their power to recognize languages.
 Summarize language classes & grammars relationship among them with the
helpofChomskyhierarchy
 Employ finite state machines to solve problems incomputing
 Illustrate deterministic and non-deterministicmachines
 Quote the hierarchy of problems arising in the computerscience
UNIT I
Finite Automata: Need of Automata theory, Central Concepts of Automata Theory, Automation,
Finite Automation, Transition Systems, Acceptance of a String, DFA, Design of DFAs, NFA,
Design of NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA, Finite Automata
with Є-Transitions, Minimization of Finite Automata, Finite Automata with output-Mealy and
Moore Machines, Applications and Limitation of Finite Automata.
UNIT II
Regular Expressions, Regular Sets, Identity Rules, Equivalence of two RE, Manipulations of REs,
Finite Automata and Regular Expressions, Inter Conversion, Equivalence between FA and RE,
Pumping Lemma of Regular Sets, Closure Properties of Regular Sets, Grammars, Classification
of Grammars, Chomsky Hierarchy Theorem, Right and Left Linear Regular Grammars,
Equivalence between RG and FA, InterConversion.
UNIT III
Formal Languages, Context Free Grammar, Leftmost and Rightmost Derivations, Parse Trees,
Ambiguous Grammars, Simplification of Context Free Grammars-Elimination of Useless
Symbols, Є-Productions and Unit Productions, Normal Forms-Chomsky Normal Form and
Greibach Normal Form, Pumping Lemma, Closure Properties, Applications of Context Free
Grammars.

UNIT IV
Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description, Language
Acceptance of
Pushdown Automata, Design of Pushdown Automata, Deterministic and Non – Deterministic Pushdown
Automata,
Equivalence of Pushdown Automata and Context Free Grammars, Conversion, Two Stack Pushdown
Automata, Application of Pushdown Automata.
UNIT V
Turning Machine: Definition, Model, Representation of TMs-Instantaneous Descriptions,
Transition Tables and Transition Diagrams, Language of a TM, Design of TMs, Types of TMs,
Church’s Thesis, Universal and Restricted TM, Decidable and Un-decidable Problems, Halting
Problem of TMs, Post’s Correspondence Problem, Modified PCP, Classes of P and NP, NP-Hard
and NP-Complete Problems.
Text Books:
1) Introduction to Automata Theory, Languages and Computation, J. E. Hopcroft, R.
Motwani and J. D. Ullman, 3rd Edition, Pearson,2008
2) Theory of Computer Science-Automata, Languages and Computation, K. L. P. Mishraand
N. Chandrasekharan, 3rd Edition, PHI, 2007
Reference Books:
1) Elements of Theory of Computation, Lewis H.P. &Papadimition C.H., Pearson/PHI
2) Theory of Computation, V. Kulkarni, Oxford University Press,2013
3) Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw Hill,2014
e-Resources:
R-20 Syllabus for IoT& CS including BCT JNTUK w. e. f. 2020-21
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA

L T P C
3 0 0 3
DATABASE MANAGEMENT SYSTEMS (PCC2202)
Course Objectives:
 To introduce about database managementsystems
 To give a good formal foundation on the relational model of data and usage of RelationalAlgebra
 To introduce the concepts of basic SQL as a universal Databaselanguage
 To demonstrate the principles behind systematic database design approaches
bycovering conceptual design, logical design throughnormalization
 To provide an overview of physical design of a database system, by discussing
Databaseindexing techniques and storagetechniques
Course Outcomes:
By the end of the course, the student will be able to
 Describe a relational database and object-orienteddatabase
 Create, maintain and manipulate a relational database usingSQL
 Describe ER model and normalization for databasedesign
 Examine issues in data storage and query processing and can formulate appropriatesolutions
 Outline the role and issues in management of data such as efficiency, privacy, security, ethical
responsibility, and strategic advantage
UNIT I
Introduction: Database system, Characteristics (Database Vs File System), Database Users(Actors
on Scene, Workers behind the scene), Advantages of Database systems, Database applications.
Brief introduction of different Data Models; Concepts of Schema, Instance and data
independence; Three tier schema architecture for data independence; Database system structure,
environment, Centralized and Client Server architecture for thedatabase.
UNIT II
Relational Model: Introduction to relational model, concepts of domain, attribute, tuple, relation,
importance of null values, constraints (Domain, Key constraints, integrity constraints) and their
importance BASIC SQL: Simple Database schema, data types, table definitions (create, alter),
different DML operations (insert, delete, update), basic SQL querying (select and project) using
where clause, arithmetic & logical operations, SQL functions(Date and Time, Numeric,
Stringconversion).
UNIT III
Entity Relationship Model: Introduction, Representation of entities, attributes, entity set,
relationship, relationship set, constraints, sub classes, super class, inheritance, specialization,
generalization using ER Diagrams. SQL: Creating tables with relationship, implementation of key
and integrity constraints, nested queries, sub queries, grouping, aggregation, ordering,
implementation of different types of joins, view(updatable and non-updatable), relational set
operations.
UNIT IV
Schema Refinement (Normalization): Purpose of Normalization or schema refinement, concept of
functional dependency, normal forms based on functional dependency(1NF, 2NF and 3 NF),
concept of surrogate key, Boyce-codd normal form(BCNF), Lossless join and dependency
preserving decomposition, Fourth normal form(4NF), Fifth Normal Form(5NF).

UNIT V
Transaction Concept: Transaction State, Implementation of Atomicity and Durability, Concurrent
Executions, Serializability, Recoverability, Implementation of Isolation, Testing for
Serializability, Failure Classification, Storage, Recovery and Atomicity, Recovery algorithm.
Indexing Techniques: B+ Trees: Search, Insert, Delete algorithms, File Organization and
Indexing, Cluster Indexes, Primary and Secondary Indexes , Index data Structures, Hash Based
Indexing: Tree base Indexing ,Comparison of File Organizations, Indexes and PerformanceTuning
Text Books:
1) Database Management Systems, 3/e, Raghurama Krishnan, Johannes Gehrke,TMH
2) Database System Concepts,5/e, Silberschatz, Korth,TMH
Reference Books:
1) Introduction to Database Systems, 8/e C J Date,PEA.
2) Database Management System, 6/e RamezElmasri, Shamkant B. Navathe,PEA
3) Database Principles Fundamentals of Design Implementation and Management, Corlos
Coronel, Steven Morris, Peter Robb, CengageLearning.
e-Resources:
2)https://www.geeksforgeeks.org/introduction-to-nosql/

L T P C
3 0 0 3
MANAGERIAL ECONOMICS AND FINANCIAL ACCOUNTANCY (HSMC2201)
Course Objectives:
 The Learning objectives of this paper are to understand the concept and nature of Managerial
Economics and its relationship with other disciplines and also to understand the Concept of
Demand and Demand forecasting.
 To familiarize about the Production function, Input Output relationship, Cost-Output
relationship and Cost-Volume-ProfitAnalysis.
 To understand the nature of markets, Methods of Pricing in the different market structures and
to know the different forms of Business organization and the concept of BusinessCycles.
 To learn different Accounting Systems, preparation of Financial Statement and uses of
different tools for performanceevaluation.
 Finally, it is also to understand the concept of Capital, Capital Budgeting and the techniques
used to evaluate Capital Budgetingproposals.
Unit-I
Introduction to Managerial Economics and demand Analysis:
Definition of Managerial Economics –Scope of Managerial Economics and its relationship with
other subjects –Concept of Demand, Types of Demand, Determinants of Demand- Demand
schedule, Demand curve, Law of Demand and its limitations- Elasticity of Demand, Types of
Elasticity of Demand and Measurement- Demand forecasting and Methods of forecasting,
Concept of Supply and Law of Supply.
Unit – II:
Theories of Production and Cost Analyses:
Theories of Production function- Law of Variable proportions-Isoquants and Isocosts and choice
of least cost factor combination-Concepts of Returns to scale and Economies of scale-Different
cost concepts: opportunity costs, explicit and implicit costs-Fixed costs, Variable Costs and Total
costs –Cost –Volume- Profit analysis-Determination of Breakeven point(problems)-Managerial
significance and limitations of Breakeven point.
Unit – III:
Introduction to Markets, Theories of the Firm & Pricing Policies:
Market Structures: Perfect Competition, Monopoly, Monopolistic competition and Oligopoly –
Features – Price and Output Determination – Managerial Theories of firm: Marris and
Williamson’s models – other Methods of Pricing: Average cost pricing, Limit Pricing, Market
Skimming Pricing, Internet Pricing: (Flat Rate Pricing, Usage sensitive pricing) and Priority
Pricing, Business Cycles : Meaning and Features – Phases of a Business Cycle. Features and
Evaluation of Sole Trader, Partnership, Joint Stock Company – State/Public Enterprises and their
forms.

Unit – IV:
Introduction to Accounting & Financing Analysis:
Introduction to Double Entry System, Journal, Ledger, Trail Balance and Preparation of Final
Accounts with adjustments – Preparation of Financial Statements-Analysis and Interpretation
of Financial Statements-Ratio Analysis – Preparation of Funds flow and cash flow analysis
(Problems)
Unit – V:
Capital and Capital Budgeting: Capital Budgeting: Meaning of Capital-Capitalization-Meaning
of Capital Budgeting-Time value of money- Methods of appraising Project profitability:
Traditional Methods(pay back period, accounting rate of return) and modern methods(Discounted
cash flow method, Net Present Value method, Internal Rate of Return Method and
ProfitabilityIndex)
Course Outcomes:
 The Learner is equipped with the knowledge of estimating the Demand and demand
elasticities for aproduct.
 The knowledge of understanding of the Input-Output-Cost relationships and estimation of the
least cost combination ofinputs.
 The pupil is also ready to understand the nature of different markets and Price Output
determination under various market conditions and also to have the knowledge of different
BusinessUnits.
 The Learner is able to prepare Financial Statements and the usage of various Accounting
tools forAnalysis.
 The Learner can able to evaluate various investment project proposals with the help of
capital budgeting techniques for decisionmaking.
TEXT BOOKS:
A R Aryasri, Managerial Economics and Financial Analysis, The McGraw – Hill companies.
REFERENCES:
1. Varshney R.L, K.L Maheswari, Managerial Economics, S. Chand &CompanyLtd,
2. JL Pappas and EF Brigham, Managerial Economics, Holt, R & W; New editionedition
3. N.P Srinivasn and M. SakthivelMurugan, Accounting for Management, S. Chand &CompanyLtd,
4. MaheswariS.N,AnIntroduction to Accountancy, Vikas Publishing House PvtLtd
5. I.M Pandey, Financial Management , Vikas Publishing House PvtLtd
6. V. Maheswari, Managerial Economics, S. Chand &CompanyLtd,
R-20 Syllabus for CSE-IOT&CS incl., BCT, JNTUK w. e. f. 2020 – 21

DEPARTMENT OF CSE - IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY
L T P C
0 0 3 1.5
COMPUTER ORGANIZATION& ARCHITECTURELAB (ESC2202)
Course Objectives:
Upon completion of the Course, the students will be able to:
 Know the characteristics of various components.
 Understand the utilization of components
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.
 Solve elementary problems by assembly language programming
 Implement assembly language program for given task for 8086 microprocessor.
List of Experiments:
1. Realization of Boolean Expressions using Gates
2. Design and realization logic gates using universal gates
3. Design a JK Flip‐Flop, Edge triggered J‐K NAND Flip Flop and show its functionality
Handle race condition and clock gating in your circuit.
4. Design a 4 – bit Adder / Subtractor
5. Combinational logic circuits: Implementation of Boolean functions using logic gates
6. Arithmetic operations using logic gates; Implementation of Multiplexers, Demultiplexers,
Encoders, Decoders; Implementation of Boolean functions using Multiplexers/Decoders
7. Study of sequential logic circuits: Implementation of flip flops, Verify the excitation
tables of various FLIP-FLOPS.
8. Design and realization a Synchronous and Asynchronous counter using flip-flops
9. Design and realization of an 8-bit parallel load and serial out shift register using flipflops
10. Implementation of counters, Design and realization a Synchronous and Asynchronous
counter using flip-flops
11. Design and realization of 4x1 mux, 8x1mux using 2x1 mux
Write assembly language programs in 8086 for the following: (MASAM can also beused)
1. To add two 8 bit number (A+B=RESULT with a carry and without a carry).
2. To subtract one 8 bit number from another (A-B=RESULT with a borrow and without a
borrow).
3. To find out AND, OR, NOT, XOR, NAND, NOR, XNOR of two 8 bit number.
4. To find out addition of two 16 bit numbers.
5. To find out subtraction of two 16 bit numbers.
6. To evaluate the expression a = b + c –d * e
Considering 8-bit, 16 bit and 32-bit binary numbers as b, c, d, e.
Take the input in consecutive memory locations and results also Display the results by
using “int xx” of 8086. Validate program for the boundary conditions.

7. To take N numbers as input. Perform the following operations on them.

a. Arrange in ascending and descending order.
b. Find max and minimum
c. Find average
Considering 8-bit, 16-bit binary numbers and 2-digit, 4 digit and 8-digit BCD numbers. Display
the results by using “int xx” of 8086. Validate program for the boundary conditions.
8. To implement the above operations as procedures and call from the main procedure.
9. To find the factorial of a given number as a Procedure and call from the main program
which display the result.
Note: Experiments can be done using Logic board, EasyCPU, RTSlim, Little Man Computer
(LMC), Assemblers for 8085 programming, 8086 based trainer kits, MIPS simulator PCSpim,
Xilinx schematic editor and simulation tools or any other choice

L T P C
0 0 3 1.5
DATABASE MANAGEMENT SYSTEMS LAB (PCC2203)
Course Objectives:
This Course will enable students to
 Populate and query a database using SQL DDL/DMLCommands
 Declare and enforce integrity constraints on adatabase
 Writing Queries using advanced concepts ofSQL
 Programming PL/SQL including procedures, functions, cursors andtriggers
Course Outcomes:
At the end of the course the student will be able to:
 Utilize SQL to execute queries for creating database and performing data
manipulation operations
 Examine integrity constraints to build efficientdatabases
 Apply Queries using Advanced Concepts ofSQL
Build PL/SQL programs including stored procedures, functions, cursorsandtriggers
List of Exercises:
1. Creation, altering and droping of tables and inserting rows into a table (use
constraints while creating tables) examples using SELECTcommand.
2. Queries (along with sub Queries) using ANY, ALL, IN, EXISTS,
NOTEXISTS, UNION, INTERSET, Constraints. Example:- Select the roll
number and name of the student who secured fourth rank in theclass.
3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN),
GROUP BY, HAVING and Creation and dropping of Views.
4. Queries using Conversion functions (to_char, to_number and to_date),
string functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap,
length, substr and instr), date functions (Sysdate, next_day, add_months,
last_day, months_between, least, greatest, trunc, round, to_char,to_date)
5.
i. Create a simple PL/SQL program which includes declaration section,
executable section and exception –Handling section (Ex. Student marks
can be selected from the table and printed for those who secured first
class and an exception can be raised if no records werefound)
ii. Insert data into student table and use COMMIT, ROLLBACK and
SAVEPOINT in PL/SQLblock.
6. Develop a program that includes the features NESTED IF, CASE and CASE
expression. The program can be extended using the NULLIF and
COALESCEfunctions.
7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested
loops using ERROR Handling, BUILT –IN Exceptions, USE defined
Exceptions, RAISE- APPLICATIONERROR.

8. Programs development using creation of procedures, passing parameters IN

and OUT ofPROCEDURES.
9. Program development using creation of stored functions, invoke functions in
SQL Statements and write complexfunctions.
10. Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR
11. Develop Programs using BEFORE and AFTER Triggers, Row and Statement
Triggers and INSTEAD OFTriggers
12. Create a table and perform the search operation on table using indexing and
non-indexing techniques.
Text Books/Suggested Reading:
1) Oracle: The Complete Reference by OraclePress
2) Nilesh Shah, "Database Systems Using Oracle”, PHI,2007
13. Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson
Education,2007

L T P C
0 0 3 1.5
R PROGRAMMING LAB (PCC2204)
Course Objective: In this course student will learn about the fundamentals of R
programming, standard R libraries,solid understanding of R functions,write programs
using the R and gain skills in R programming Language, get acquaintances with Arrays,
Files, Strings, Packages, and distributions using R.
Course Outcomes: At the end of the course, the student will be able to:
1. Implement basic concepts of R programming, and its different module that
includes conditional, looping, lists, Strings, Functions, Frames, Arrays, and File
programming.
2. Implement the concepts of R Script to extract the data from data frames and file
operations.
3. Implement the various statistical techniques using R.
4. Extend the functionality of R by using add-on packages
5. Use R Graphics and Tables to visualize results of various statistical operations on data
LIST OF LAB PROGRAMS:

Week 1:
Installing R and RStudio
Basic functionality of R, variable, data types in R
Week 2:
a) Implement R script to show the usage of various operators available in Rlanguage.
b) Implement R script to read person‘s age from keyboard and display whether
he is eligiblefor voting ornot.
c) Implement R script to find biggest number between two numbers.
d) Implement R script to check the given year is leap year ornot.
Week 3:
a) Implement R Script to generate first N naturalnumbers.
b) Implement R Script to check given number is palindrome ornot.
c) Implement R script to print factorial of anumber.
d) Implement R Script to check given number is Armstrong ornot.
Week 4:
a) Implement R Script to perform various operations on string using stringlibraries.
b) Implement R Script to check given string is palindrome ornot.
c) Implement R script to accept line of text and find the number of characters,
number of vowels and number of blank spaces init.
d) d) Implement R script for Call-by-value and Call-by-reference

Week 5:
a) Implement R Script to create a list.
b) Implement R Script to access elements in the list.
c) Implement R Script to merge two or more lists. Implement R Script to perform matrix
operation
Week 6:
Implement R script to perform following operations:
d) various operations on vectors
e) Finding the sum and average of given numbers using arrays.
f) To display elements of list in reverse order.
g) Finding the minimum and maximum elements in the array.
Week 7:
a) Implement R Script to perform various operations on matrices
b) Implement R Script to extract the data from dataframes.
c) Write R script to display file contents.
d) Write R script to copy file contents from one file to another
Week 8:
a) Implement R Script to create a Pie chart, Bar Chart, scatter plot andHistogram.
b) Implement R Script to perform mean, median, mode, range, summary, variance,
standard deviation operations.
Introduction to ggplot2 graphics
Week 9:
a) Implement R Script to perform Normal, Binomialdistributions.
b) Implement R Script to perform correlation, Linear and multipleregression.
Week 10:
Introduction to Non-Tabular Data Types: Time series, spatial data, Network data.
Data Transformations: Converting Numeric Variables into Factors, Date
Operations, String Parsing, Geocoding
Week 11:
Introduction Dirty data problems: Missing values, data manipulation, duplicates, forms of data
dates, outliers, spelling
Week 12:
Data sources: SQLite examples for relational databases, Loading SPSS and SAS files, Reading
from Excel and Google Spreadsheets, API and web scraping examples
REFERENCES:
1. R Cookbook Paperback – 2011 by Teetor Paul O Reilly Publications
2. Beginning R: The Statistical Programming Language by Dr. Mark Gardener, Wiley
Publications
3. R Programming For Dummies by JorisMeysAndrie de Vries, Wiley Publications
4. Hands-On Programming with R by Grolemund, O Reilly Publications

5. Statistical Programming in R by KG Srinivas G.M. Siddesh, Chetan Shetty &Sowmya

B.J. - 2017 edition
6. R Fundamentals and Programming Techniques, ThomasLumely.
7. R for Everyone Advanced Analytics and Graphics, Jared P. Lander- Addison
WesleySeries
8. The Art of R Programming, Norman Matloff, CengageLearning
9. Maria DoloresUgarte,AnaF.Militino,AlanT.Arnholt―ProbabilityandStatisticswithR‖2nd
Edition on, CRC Press,2016.
10. R-programming for Data science, RogerD.Peng.
11. An Introduction to statistical learning-with applications in R, Trevor Hastie and Rob
Tibshirani.
Web Links
1. URL: https://cran.r-project.org/doc/manuals/r-release/R-intro.pdf ( Online Resources)
2. http://nptel.ac.in/courses/106104135/48
3. http://nptel.ac.in/courses/110106064/
SOFTWARE requirements:
1. The R statistical software program. Available from: https://www.r-project.org/
RStudio an Integrated Development Environment (IDE) for R. Available from:
https://www.rstudio.com/

L T P C
0 0 4 2
ANDROID APPLICATION DEVELOPMENT (SC2201)
Course Objectives:
 To learn how to develop Applications in android environment.
 To learn how to develop user interface applications.
 To learn how to develop URL related applications.
1. Create an Android application that shows Hello + name of the user and run it on an emulator.
(b) Create an application that takes the name from a text box and shows hello message along
with the name entered in text box, when the user clicks the OK button.
2. Create a screen that has input boxes for User Name, Password, Address, Gender (radio buttons
for male and female), Age (numeric), Date of Birth (Date Picket), State (Spinner) and a Submit
button. On clicking the submit button, print all the data below the Submit Button. Use
(a) Linear Layout , (b) Relative Layout and
(c) Grid Layout or Table Layout.
3. Develop an application that shows names as a list and on selecting a name it should show the
details of the candidate on the next screen with a “Back” button. If the screen is rotated to
landscape mode (width greater than height), then the screen should show list on left fragment and
details on right fragment instead of second screen with back button. Use Fragment transactions
and Rotation event listener.
4. Develop an application that uses a menu with 3 options for dialing a number, opening a
website and to send an SMS. On selecting an option, the appropriate action should be invoked
using intents.
5. Develop an application that inserts some notifications into Notification area and whenever a
notification is inserted, it should show a toast with details of the notification.
6. Create an application that uses a text file to store user names and passwords (tab separated
fields and one record per line). When the user submits a login name and password through a
screen, the details should be verified with the text file data and if they match, show a dialog
saying that login is successful. Otherwise, show the dialog with Login Failed message.
7. Create a user registration application that stores the user details in a database table.
8. Create a database and a user table where the details of login names and passwords are stored.
Insert some names and passwords initially. Now the login details entered by the user should be
verified with the database and an appropriate dialog should be shown to the user.

Note:
Android Application Development with MIT App Inventor:For the first one week, the student
is advised to go through the App Inventor from MIT which gives insight into the various
properties of each component.
The student should pay attention to the properties of each components, which are used later in
Android programming. Following are useful links:
1. http://ai2.appinventor.mit.edu
2. https://drive.google.com/file/d/0B8rTtW_91YclTWF4czdBMEpZcWs/view

Cse-iot&Cs Incl BCT 1&2years CS& Syllabus Ug r20

Uploaded by

Copyright:

Available Formats

Cse-iot&Cs Incl BCT 1&2years CS& Syllabus Ug r20

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cse-iot&Cs Incl BCT 1&2years CS& Syllabus Ug r20

Uploaded by

Copyright:

Available Formats

R-20 Syllabus for CSE-IoT&CS incl., BCT, JNTUK w. e. f.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

COURSE STRUCTURE AND SYLLABUS

B. Tech - COMPUTER SCIENCE & ENGINEERING with Specialization

IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

(Applicable for batches admitted from 2020-2021)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

This course will illuminate the students in the concepts of calculus.

UNIT I: Sequences, Series and Mean value theorems: (10 hrs)

UNIT III: Linear differential equations of higher order: (10 hrs)

Non-homogeneous equations of higher order with constant coefficients – with non-homogeneous

Applications: LCR circuit, Simple Harmonic motion.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

UNIT IV: Partial differentiation: (10 hrs)

UNIT V: Multiple integrals: (8 hrs)

Double and Triple integrals – Change of order of integration – Change of variables.

Applications: Finding Areas and Volumes.

3. Lawrence Turyn, Advanced Engineering Mathematics, CRC Press, 2013.

4. Srimantha Pal, S C Bhunia, Engineering Mathematics, Oxford University Press.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

APPLIED PHYSICS (BS1104)

(For All Circuital Branches like ECE, EEE, CSEetc)

Diffraction: Introduction - Fresnel and Fraunhofer diffraction - Fraunhofer diffraction due

Polarization: Introduction-Types of polarization - Polarization by reflection, refraction and

The students will be able to

Unit-II: Lasers andFiberoptics 8hrs

The students will be able to

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

Unit-IV: Dielectric andMagneticMaterials 8hrs

The students will be able to

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

Unit – V: SemiconductorsandSuperconductors 10hrs

Semiconductors: Introduction- Intrinsic semiconductors – Density of charge carriers – Electrical

The students will be able to

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

COMMUNICATIVE ENGLISH (HS1101)

At the end of the module, the learners will be able to

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

Lesson-1: A Drawer full of happiness from “Infotech English”, Maruthi Publications

Lesson-2: Deliverance by Premchandfrom “The Individual Society”,Pearson Publications. (Non-

Lesson-2: Bosom Friend by HiraBansodefrom “The Individual Society”, Pearson Publications.(Non-

Grammar: Use of articles and zero article; prepositions.

Pronunciation: Past tense markers, word stress-di-syllabic words

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – IOT & CS INCLUDING BLOCK CHAIN TECHNOLOGY

Lesson-1: Stephen Hawking-Positivity ‘Benchmark’ from “Infotech English”, Maruthi Publications