46. CSE - (CSC) II.B.Tech Syllabus
46. CSE - (CSC) II.B.Tech Syllabus
Course Objectives:
• To understand mathematical arguments using logical connectives and quantifiers and verify the
validity of logical flow of arguments using propositional, predicate logic, and truth
tables.
• To understand about elementary of combinatorics, the principle of inclusion and exclusion and
the pigeonhole principle.
• To expose the students to Binary relations, posets, Hasse diagram, lattice, and discuss various
properties of relations.
• To understand Algebraic structures like groups, semigroups, monoids.
• To introduce generating functions and recurrence relations.
Course Outcomes:
• Recall the concepts of Mathematical logic and statement &predicate calculus
• Recall the concepts of combinatorics, set theory, posets and lattices
• Recall the concepts of algebraic structures, recurrence relations and generating functions
• Use and interprettheconceptsofMathematicallogicandstatement&predicatecalculus
• Use and interpret the concepts of combinatorics, set theory, posets and lattices
• Use and interpret the concepts of algebraic structures, recurrence relations and generating
functions
• Apply the concepts of discreet mathematical structures to computer science and engineering
Unit-I:
Mathematical Logic & Statement Calculus
Statements and Connectives: statements, connectives, compound statements (Formulas), well-
formed formulas, truth tables, tautologies, equivalence of ormulas, converse, contrapositives&
inverse of an implication, duality law, tautological implications, Normal forms: Principal
disjunctive and conjunctive normal forms; Statement calculus: Validity of an argument using truth
tables and rules of inference, consistency of premises, indirect method of proof.
Unit-II:
Predicates &Predicate Calculus
Predicate calculus: Predicates, statement of functions, variables and quantifiers, predicate
formulas, free and bound variables, universe of discourse, valid formulas and equivalences
involving quantifiers, rules of inference, theory of inference for predicate calculus
Unit-III:
Combinatorics, Set Theory, Posets and Lattices
Combinatorics: Principles of counting (product and sum rules), Pigeonhole principle and its
applications, Principle of Inclusion-Exclusion and its applications.
Relations: Binary relation, properties, equivalence relation, partition of a set, equivalence classes
Partial ordering: Partial order relation, partially ordered set(poset), Chanhassen diagrams,
Lattices.
Unit-IV:
Algebraic Structures
Algebraic Systems (Structures): Binary operation, algebraic structures such as Semi group,
Monoid, Group, commutative group with suitable examples, properties satisfied by the algebraic
R23 Regulations
structures and the elements; Special group structures: Sub group and its criteria, order of an
element, Cosets ,index of sub group ,properties of cosets, order of a group, Lagrange’s theorem
Unit-V:
Recurrence Relations & Generating Functions
Recurrence Relations: Formation, iterative method of solving recurrence relations, solving
homogeneous and non-homogeneous recurrence relations by characteristic roots method;
Generating Functions: Generating functions of sequences, calculation of coefficients of
expansions, solving recurrence relations by generating functions
.
Textbooks:
1. J.P.Tremblay and R.Manohar, Discrete Mathematical Structures with Applications to CSc,
TataMcGrawHill,1997
2. S. Santha and EV Prasad, Mathematical Foundations for Computer Science, CENG AGE
Publishers
Reference Books:
1. Kenneth. H.Rosen,Discrete Mathematics and itsApplications,6/e, Tata McGraw-Hill, 2009.
2. Dr.DSChandrasekharaiah, Mathematical Foundations of Computer Science ,Prism Book Pvt Ltd.
3. Swapan Kumar Sarkar, Mathematical Foundation of Computer Science,9th Edition, SChand
Publishers.
******
R23 Regulations
Course Objectives:
• To help the students appreciate the essential complementarily between 'VALUES' and
'SKILLS' to ensure sustained happiness and prosperity which are the core aspirations of all
human beings.
• To facilitate the development of a Holistic perspective among students towards life and
profession as well as towards happiness and prosperity based on a correct understanding of the
Human reality and the rest of existence. Such holistic perspective forms the basis of Universal
Human Values and movement towards value-based living in a natural way.
• To highlight plausible implications of such a Holistic understanding in terms of ethical human
conduct, trustful and mutually fulfilling human behaviour and mutually enriching interaction
with Nature.
Course Outcomes:
• By the end of the course, students are expected to become more aware of themselves, and their
surroundings (family, society, nature); they would become more responsible in life, and in
handling problems with sustainable solutions, while keeping human relationships and human
nature in mind.
• They would have better critical ability.
• They would also become sensitive to their commitment towards what they have understood
(human values, human relationship and human society).
• It is hoped that they would be able to apply what they have learnt to their own self in different
day-to-day settings in real life, at least a beginning would be made in this direction.
Course Topics
The course has 28 lectures and 14 tutorials in 5 modules. The lectures and tutorials are of 1-hour
duration. Tutorial sessions are to be used to explore and practice what has been proposed during the
lecture sessions.
The Teacher’s Manual provides the outline for lectures as well as practice sessions. The teacher is
expected to present the issues to be discussed as propositions and encourage the students to have a
dialogue.
UNIT I Introduction to Value Education (6 lectures and 3 tutorials for practice session)
Lecture 1: Right Understanding, Relationship and Physical Facility (Holistic
Development and the Role of Education)
Lecture 2: Understanding Value Education
Tutorial 1: Practice Session PS1 Sharing about Oneself
Lecture 3: self-exploration as the Process for Value Education
Lecture4: Continuous Happiness and Prosperity – the Basic Human Aspirations
Tutorial 2: Practice Session PS2 Exploring Human Consciousness
Lecture 5: Happiness and Prosperity – Current Scenario
Lecture 6: Method to Fulfill the Basic Human Aspirations
Tutorial 3: Practice Session PS3 Exploring Natural Acceptance
UNIT II Harmony in the Human Being (6 lectures and 3 tutorials for practice session)
Lecture 7: Understanding Human being as the Co-existence of the self and the body.
Lecture 8: Distinguishing between the Needs of the self and the body
R23 Regulations
Tutorial 4: Practice Session PS4 Exploring the difference of Needs of self and body.
Lecture 9: The body as an Instrument of the self
Lecture 10: Understanding Harmony in the self
Tutorial 5: Practice Session PS5 Exploring Sources of Imagination in the self
Lecture 11: Harmony of the self with the body
Lecture 12: Programme to ensure self-regulation and Health
Tutorial 6: Practice Session PS6 Exploring Harmony of self with the body
UNIT III Harmony in the Family and Society (6 lectures and 3 tutorials for practice session)
Lecture 13: Harmony in the Family – the Basic Unit of Human Interaction
Lecture 14: 'Trust' – the Foundational Value in Relationship
Tutorial 7: Practice Session PS7 Exploring the Feeling of Trust
Lecture 15: 'Respect' – as the Right Evaluation
Tutorial 8: Practice Session PS8 Exploring the Feeling of Respect
Lecture 16: Other Feelings, Justice in Human-to-Human Relationship
Lecture 17: Understanding Harmony in the Society
Lecture 18: Vision for the Universal Human Order
Tutorial 9: Practice Session PS9 Exploring Systems to fulfil Human Goal
UNIT IV Harmony in the Nature/Existence (4 lectures and 2 tutorials for practice session)
Lecture 19: Understanding Harmony in the Nature
Lecture 20: Interconnectedness, self-regulation and Mutual Fulfilment among
the Four Orders of Nature
Tutorial 10: Practice Session PS10 Exploring the Four Orders of Nature
Lecture 21: Realizing Existence as Co-existence at All Levels
Lecture 22: The Holistic Perception of Harmony in Existence
Tutorial 11: Practice Session PS11 Exploring Co-existence in Existence
Practice Sessions for UNIT III – Harmony in the Family and Society
PS7 Exploring the Feeling of Trust
PS8 Exploring the Feeling of Respect
PS9 Exploring Systems to fulfil Human Goal
Practice Sessions for UNIT V – Implications of the Holistic Understanding – a Look at Professional
Ethics
PS12 Exploring Ethical Human Conduct
PS13 Exploring Humanistic Models in Education
PS14 Exploring Steps of Transition towards Universal Human Order
Readings:
Textbook and Teachers Manual
a. The Textbook A Foundation Course in Human Values and Professional Ethics, R R Gaur, R
Asthana, G P Bagaria, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-87034-47-
1
b. The Teacher’s Manual Teachers’ Manual for A Foundation Course in Human Values and
Professional Ethics, R R Gaur, R Asthana, G P Bagaria, 2nd Revised Edition, Excel Books, New
Delhi, 2019. ISBN 978-93-87034-53-2
Reference Books
1. JeevanVidya: EkParichaya, A Nagaraj, JeevanVidyaPrakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher.
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj – PanditSunderlal
9. Rediscovering India - by Dharampal
10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
12. Vivekananda - Romain Rolland (English)
13. Gandhi - Romain Rolland (English)
Mode of Conduct:
Lecture hours are to be used for interactive discussion, placing the proposals about the topics at hand
and motivating students to reflect, explore and verify them.
Tutorial hours are to be used for practice sessions.
While analysing and discussing the topic, the faculty mentor’s role is in pointing to essential elements
to help in sorting them out from the surface elements. In other words, help the students explore the
important or critical elements.
In the discussions, particularly during practice sessions (tutorials), the mentor encourages the student
to connect with one’s own self and do self-observation, self-reflection and self-exploration.
R23 Regulations
Scenarios may be used to initiate discussion. The student is encouraged to take up” ordinary”
situations rather than” extra-ordinary” situations. Such observations and their analyses are shared and
discussed with other students and faculty mentor, in a group sitting.
Tutorials (experiments or practical) are important for the course. The difference is that the laboratory
is everyday life, and practical are how you behave and work in real life. Depending on the nature of
topics, worksheets, home assignment and/or activity are included. The practice sessions (tutorials)
would also provide support to a student in performing actions commensurate to his/her beliefs. It is
intended that this would lead to development of commitment, namely behaving and working based on
basic human values.
It is recommended that this content be placed before the student as it is, in the form of a basic
foundation course, without including anything else or excluding any part of this content. Additional
content may be offered in separate, higher courses. This course is to be taught by faculty from every
teaching department, not exclusively by any one department.
Teacher preparation with a minimum exposure to at least one 8-day Faculty Development Program on
Universal Human Values is deemed essential.
******
R23 Regulations
UNIT – I:
Data Representation: Binary Numbers, Fixed Point Representation. Floating Point Representation.
Number base conversions, Octal and Hexadecimal Numbers, components, Signed binary numbers,
Binary codes
Digital Logic Circuits-I: Basic Logic Functions, Logic gates, universal logic gates, Minimization of
Logic expressions. K-Map Simplification, Combinational Circuits, Decoders, Multiplexers
UNIT – II:
Digital Logic Circuits-II: Sequential Circuits, Flip-Flops, Binary counters, Registers, Shift Registers,
Ripple counters
Basic Structure of Computers: Computer Types, Functional units, Basic operational concepts, Bus
structures, Software, Performance, multiprocessors and multi computers, Computer Generations, Von-
Neumann Architecture
UNIT – III:
Computer Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast Adders,
Multiplication of Positive Numbers, Signed-operand Multiplication, Fast Multiplication, Integer
Division, Floating-Point Numbers and Operations
Processor Organization: Fundamental Concepts, Execution of a Complete Instruction, Multiple-Bus
Organization, Hardwired Control and Multi programmed Control
UNIT – IV:
The Memory Organization: Basic Concepts, Semiconductor RAM Memories, Read-Only Memories,
Speed, Size and Cost, Cache Memories, Performance Considerations, Virtual Memories, Memory
Management Requirements, Secondary Storage
UNIT – V:
Input/Output Organization: Accessing I/O Devices, Interrupts, Processor Examples, Direct Memory
Access, Buses, Interface Circuits, Standard I/O Interfaces
R23 Regulations
Textbooks:
1. Computer Organization, Carl Hamacher, Zvonko Vranesic, Safwat Zaky, 6th edition, McGraw
Hill
2. Digital Design, 6th Edition, M. Morris Mano, Pearson Education.
Reference Books:
1. Computer Organization and Architecture, William Stallings, 11thEdition, Pearson.
2. Computer Systems Architecture, M.Moris Mano, 3rdEdition, Pearson
3. Computer Organization and Design, David A. Paterson, John L. Hennessy, Elsevier
4. Fundamentals of Logic Design, Roth, 5thEdition, Thomson
******
R23 Regulations
Course Objectives:
The main objectives of the course is to
• provide knowledge on advance data structures frequently used in Computer Science domain
• Develop skills in algorithm design techniques popularly used
• Understand the use of various data structures in the algorithm design
Course Outcomes:
After completion of the course, students will be able to
1. Illustrate the working of the advanced tree data structures and their applications (L2)
2. Understand the Graph data structure, traversals and apply them in various contexts. (L2)
3. Use various data structures in the design of algorithms (L3)
4. Recommend appropriate data structures based on the problem being solved (L5)
5. Analyze algorithms with respect to space and time complexities (L4)
UNIT – I:
Introduction to Algorithm Analysis, Space and Time Complexity analysis, Asymptotic Notations.
UNIT – II:
Heap Trees (Priority Queues) – Min and Max Heaps, Operations and Applications
Graphs – Terminology, Representations, Basic Search and Traversals, Connected Components and
Biconnected Components, applications
Divide and Conquer: The General Method, Quick Sort, Merge Sort, Strassen’s matrix multiplication,
Convex Hull
UNIT – III:
Greedy Method: General Method, Job Sequencing with deadlines, Knapsack Problem, Minimum
cost spanning trees, Single Source Shortest Paths
Dynamic Programming: General Method, All pairs shortest paths, Single Source Shortest Paths–
General Weights (Bellman Ford Algorithm), Optimal Binary Search Trees, 0/1 Knapsack, String
Editing, Travelling Salesperson problem
UNIT – IV:
Backtracking: General Method, 8-Queens Problem, Sum of Subsets problem, Graph Coloring, 0/1
Knapsack Problem
Branch and Bound: The General Method, 0/1 Knapsack Problem, Travelling Salesperson problem
UNIT – V:
Textbooks:
1. Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj; Mehta, Dinesh, 2nd
Edition Universities Press
2. Computer Algorithms in C++, Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, 2nd
Edition University Press
Reference Books:
1. Data Structures and program design in C, Robert Kruse, Pearson Education Asia
2. An introduction to Data Structures with applications, Trembley & Sorenson, McGraw Hill
3. The Art of Computer Programming, Vol.1: Fundamental Algorithms, Donald E Knuth, Addison-
Wesley, 1997.
4. Data Structures using C & C++: Langsam, Augenstein & Tanenbaum, Pearson, 1995
5. Algorithms + Data Structures & Programs:, N.Wirth, PHI
6. Fundamentals of Data Structures in C++: Horowitz Sahni & Mehta, Galgottia Pub.
7. Data structures in Java:, Thomas Standish, Pearson Education Asia
1. https://www.tutorialspoint.com/advanced_data_structures/index.asp
2. http://peterindia.net/Algorithms.html
3. https://www.youtube.com/playlist?list=PLDN4rrl48XKpZkf03iYFl-O29szjTrs_O
******
R23 Regulations
• Identify Java language components and how they work together in applications
• Learn the fundamentals of object-oriented programming in Java, including defining classes,
invoking methods, using class libraries.
• Learn how to extend Java classes with inheritance and dynamic binding and how to use
exception handling in Java applications
• Understand how to design applications with threads in Java
• Understand how to use Java apis for program development
UNIT I:
Object Oriented Programming: Basic concepts, Principles, 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 and by 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 and Static.
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
R23 Regulations
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.
Java I/O and File: Java I/O API, standard I/O streams, types, Byte streams, Character streams,
Scanner class, Files in Java (Text Book 2)
UNIT V:
String Handling in Java: Introduction, Interface Char Sequence, Class String, Methods for
Extracting Characters from Strings,Comparison, Modifying, Searching; Class String Buffer.
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
Java FX GUI: Java FX Scene Builder, Java FX App Window Structure, displaying text and image,
event handling, laying out nodes in scene graph, mouse events (Text Book 3)
Text Books:
1. JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
2. Joy with JAVA, Fundamentals of Object Oriented Programming, DebasisSamanta,
MonalisaSarma, Cambridge, 2023.
3. JAVA 9 for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson.
References Books:
1. The complete Reference Java, 11thedition, Herbert Schildt,TMH
2. Introduction to Java programming, 7th Edition, Y Daniel Liang, Pearson
R23 Regulations
Online Resources:
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012880464547618816347_
shared/overview
******
R23 Regulations
Course Objectives:
The objectives of the course is to
• Acquire practical skills in constructing and managing Data structures
• Apply the popular algorithm design methods in problem-solving scenarios
Course Outcomes:
After completion of the course, students will be able to
1. Design and develop programs to solve real world problems with the popular
algorithm design methods. (L5)
2. Demonstrate an understanding of Non-Linear data structures by developing
implementing the operations on AVL Trees, B-Trees, Heaps and Graphs. (L2)
3. Critically assess the design choices and implementation strategies of
algorithms and data structures in complex applications. (L5)
4. Utilize appropriate data structures and algorithms to optimize solutions for
specific computational problems. (L3)
5. Compare the performance of different of algorithm design strategies (L4)
Sample Programs:
1. Construct an AVL tree for a given set of elements which are stored in a file. And
implement insert and delete operation on the constructed tree. Write contents of tree
into a new file using in-order.
2. Construct B-Tree an order of 5 with a set of 100 random elements stored in array.
Implement searching, insertion and deletion operations.
3. Construct Min and Max Heap using arrays, delete any element and display the content
of the Heap.
4. Implement BFT and DFT for given graph, when graph is represented by
a) Adjacency Matrix b) Adjacency Lists
5. Write a program for finding the biconnected components in a given graph.
6. Implement Quick sort and Merge sort and observe the execution time for various
input sizes (Average, Worst and Best cases).
7. Compare the performance of Single Source Shortest Paths using Greedy method when
the graph is represented by adjacency matrix and adjacency lists.
8. Implement Job Sequencing with deadlines using Greedy strategy.
R23 Regulations
Reference Books:
1. Fundamentals of Data Structures in C++, Horowitz Ellis, Sahni Sartaj, Mehta, Dinesh,
2nd Edition, Universities Press
2. Computer Algorithms/C++ Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, 2nd
Edition, University Press
3. Data Structures and program design in C, Robert Kruse, Pearson Education Asia
4. An introduction to Data Structures with applications, Trembley & Sorenson, McGraw
Hill
******
R23 Regulations
Sample Experiments:
Exercise – 1:
1. Write a JAVA program to display default value of all primitive data type of JAVA
2. 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 of root.
Exercise - 2
1. Write a JAVA program to search for an element in a given list of elements using
binary search mechanism.
2. Write a JAVA program to sort for an element in a given list of elements using bubble
sort
3. Write a JAVA program using StringBuffer to delete, remove character.
Exercise - 3
1. Write a JAVA program to implement class mechanism. Create a class, methods and
invoke them inside main method.
2. Write a JAVA program implements method overloading.
3. Write a JAVA program to implement constructor.
4. Write a JAVA program to implement constructor overloading.
Exercise - 4
1. Write a JAVA program to implement Single Inheritance
2. Write a JAVA program to implement multi level Inheritance
3. Write a JAVA program for abstract class to find areas of different shapes
Exercise - 5
1. Write a JAVA program give example for “super” keyword.
2. Write a JAVA program to implement Interface. What kind of Inheritance can be
achieved?
3. Write a JAVA program that implements Runtime polymorphism
R23 Regulations
Exercise - 6
1. Write a JAVA program that describes exception handling mechanism
2. Write a JAVA program Illustrating Multiple catch clauses
3. Write a JAVA program for creation of Java Built-in Exceptions
4. Write a JAVA program for creation of User Defined Exception
Exercise - 7
1. 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
implementing Runnable)
2. Write a program illustrating is Alive and join ()
3. Write a Program illustrating Daemon Threads.
4. Write a JAVA program Producer Consumer Problem
Exercise – 8
1. Write a JAVA program that import and use the user defined packages
2. Without writing any code, build a GUI that display text in label and image in an
ImageView (use JavaFX)
3. Build a Tip Calculator app using several JavaFX components and learn how to
respond to user interactions with the GUI
Exercise – 9
1. Write a java program that connects to a database using JDBC
2. Write a java program to connect to a database using JDBC and insert values into it.
3. Write a java program to connect to a database using JDBC and delete values from it
******
R23 Regulations
Sample Experiments:
1. Write a program to find the largest element among three Numbers.
2. Write a Program to display all prime numbers within an interval
3. Write a program to swap two numbers without using a temporary variable.
4. Demonstrate the following Operators in Python with suitable examples.
i) Arithmetic Operators ii) Relational Operators iii) Assignment Operators iv) Logical
Operators v) Bit wise Operators vi) Ternary Operator vii) Membership Operators
viii) Identity Operators
5. Write a program to add and multiply complex numbers
6. Write a program to print multiplication table of a given number.
R23 Regulations
UNIT-II:
Functions: Built-In Functions, Commonly Used Modules, Function Definition and Calling
the function, return Statement and void Function, Scope and Lifetime of Variables, Default
Parameters, Keyword Arguments, *args and **kwargs, Command Line Arguments.
Strings: Creating and Storing Strings, Basic String Operations, Accessing Characters in
String by Index Number, String Slicing and Joining, String Methods, Formatting Strings.
Lists: Creating Lists, Basic List Operations, Indexing and Slicing in Lists, Built-In Functions
Used on Lists, List Methods, del Statement.
Sample Experiments:
7. Write a program to define a function with multiple return values.
8. Write a program to define a function using default arguments.
9. Write a program to find the length of the string without using any library functions.
10. Write a program to check if the substring is present in a given string or not.
11. Write a program to perform the given operations on a list:
i. additionii. insertioniii. slicing
12. Write a program to perform any 5 built-in functions by taking any list.
UNIT-III:
Dictionaries: Creating Dictionary, Accessing and Modifying key:value Pairs in Dictionaries,
Built-In Functions Used on Dictionaries, Dictionary Methods, del Statement.
Tuples and Sets: Creating Tuples, Basic Tuple Operations, tuple() Function, Indexing and
Slicing in Tuples, Built-In Functions Used on Tuples, Relation between Tuples and Lists,
Relation between Tuples and Dictionaries, Using zip() Function, Sets, Set Methods,
Frozenset.
Sample Experiments:
13. Write a program to create tuples (name, age, address, college) for at least two members
and concatenate the tuples and print the concatenated tuples.
14. Write a program to count the number of vowels in a string (No control flow allowed).
15. Write a program to check if a given key exists in a dictionary or not.
16. Write a program to add a new key-value pair to an existing dictionary.
17. Write a program to sum all the items in a given dictionary.
UNIT-IV:
Files: Types of Files, Creating and Reading Text Data, File Methods to Read and Write Data,
Reading and Writing Binary Files, Pickle Module, Reading and Writing CSV Files, Python
os and os.path Modules.
Object-Oriented Programming: Classes and Objects, Creating Classes in Python, Creating
Objects in Python, Constructor Method, Classes with Multiple Objects, Class Attributes Vs
Data Attributes, Encapsulation, Inheritance, Polymorphism.
R23 Regulations
Sample Experiments:
18. Write a program to sort words in a file and put them in another file. The output file
should have only lower-case words, so any upper-case words from source must be
lowered.
19. Python program to print each line of a file in reverse order.
20. Python program to compute the number of characters, words and lines in a file.
21. Write a program to create, display, append, insert and reverse the order of the items
in the array.
22. Write a program to add, transpose and multiply two matrices.
23. Write a Python program to create a class that represents a shape. Include methods to
calculate its area and perimeter. Implement subclasses for different shapes like circle,
triangle, and square.
UNIT-V:
Introduction to Data Science: Functional Programming, JSON and XML in Python, NumPy
with Python, Pandas.
Sample Experiments:
24. Python program to check whether a JSON string contains complex object or not.
25. Python Program to demonstrate NumPy arrays creation using array () function.
26. Python program to demonstrate use of ndim, shape, size, dtype.
27. Python program to demonstrate basic slicing, integer and Boolean indexing.
28. Python program to find min, max, sum, cumulative sum of array
29. Create a dictionary with at least five keys and each key represent value as a list where
this list contains at least ten values and convert this dictionary as a pandas data frame
and explore the data through the data frame as follows:
a) Apply head () function to the pandas data frame
b) Perform various data selection operations on Data Frame
30. Select any two columns from the above data frame, and observe the change in one
attribute with respect to other attribute with scatter and plot operations in matplotlib
Reference Books:
1. Gowri shankar S, Veena A., Introduction to Python Programming, CRC Press.
2. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2nd Edition, Pearson,
2024
3. Introduction to Programming Using Python, Y. Daniel Liang, Pearson.
*****
R23 Regulations
Textbooks:
1. Textbook of Environmental Studies for Undergraduate Courses Erach Bharucha for
University Grants Commission, Universities Press.
2. Palaniswamy, “Environmental Studies”, Pearson education
3. S.Azeem Unnisa, “Environmental Studies” Academic Publishing Company
4. K.Raghavan Nambiar, “Text book of Environmental Studies for Undergraduate
Courses as per UGC model syllabus”, Scitech Publications (India), Pvt. Ltd.
R23 Regulations
******
R23 Regulations
Course Outcomes:
• Define the concepts related to Managerial Economics, financial accounting and
management(L2)
• Understand the fundamentals of Economics viz., Demand, Production, cost,
revenue and markets (L2)
• Apply the Concept of Production cost and revenues for effective Business decision
(L3)
• Analyze how to invest their capital and maximize returns (L4)
• Evaluate the capital budgeting techniques. (L5)
• Develop the accounting statements and evaluate the financial performance of business
entity (L5)
Textbooks:
1. Varshney & Maheswari: Managerial Economics, Sultan Chand.
2. Aryasri: Business Economics and Financial Analysis, 4/e, MGH.
Reference Books:
1. Ahuja Hl Managerial economics Schand.
2. S.A. Siddiqui and A.S. Siddiqui: Managerial Economics and Financial Analysis, New
Age International.
3. Joseph G. Nellis and David Parker: Principles of Business Economics, Pearson, 2/e,
New Delhi.
4. Domnick Salvatore: Managerial Economics in a Global Economy, Cengage.
******
R23 Regulations
UNIT I:
Integers, Greatest common divisors and prime Factorization
The well-ordering property-Divisibility-Representation of integers-Computer operations with
integers-Prime Numbers-Greatest common divisors-The Euclidean algorithm -The fundamental
theorem of arithmetic-Factorization of integers and the Fermat numbers-Linear Diophantine equations
UNIT II
Congruences
Introduction to congruences -Linear congruences-The Chinese remainder theorem-Systems of linear
congruences
UNIT III
Applications of Congruences
UNIT IV
Finite fields & Primality, factoring
Finite fields- quadratic residues and reciprocity-Pseudo primes-rho method-Fermat factorization and
factor bases.
UNIT V
Cryptology
Basic terminology-complexity theorem-Character ciphers-Block ciphers-Exponentiation ciphers-
Public-key cryptography-Discrete logarithm-Knapsack ciphers- RSA algorithm-Some applications to
computer science.
Textbooks:
1. Kenneth H Rosen, Elementary number theory and its applications, AT & T Information
systems & Bell laboratories.
2. Neal Koblitz, A course in Number theory & Cryptography, Springer
R23 Regulations
Reference Books:
1. https://www.slideshare.net/ItishreeDash3/a-study-on-number-theory-and-its-applications
******
R23 Regulations
OPERATING SYSTEMS
Course Objectives:
UNIT - I
Operating Systems Overview: Introduction, Operating system functions, Operating systems
operations, Computing environments, Free and Open-Source Operating Systems
System Structures: Operating System Services, User and Operating-System Interface, system
calls, Types of System Calls, system programs, Operating system Design and
Implementation, Operating system structure, Building and Booting an Operating System,
Operating system debugging
UNIT - II
Processes: Process Concept, Process scheduling, Operations on processes, Inter-process
communication.
Threads and Concurrency: Multithreading models, Thread libraries, Threading issues.
CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple
processor scheduling.
UNIT – III
Synchronization Tools: The Critical Section Problem, Peterson’s Solution, Mutex Locks,
Semaphores, Monitors, Classic problems of Synchronization.
Deadlocks: system Model, Deadlock characterization, Methods for handling Deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from Deadlock.
UNIT - IV
Memory-Management Strategies: Introduction, Contiguous memory allocation, Paging,
Structure of the Page Table, Swapping.
R23 Regulations
UNIT - V
File System: File System Interface: File concept, Access methods, Directory Structure; File
system Implementation: File-system structure, File-system Operations, Directory
implementation, Allocation method, Free space management; File-System Internals: File-
System Mounting, Partitions and Mounting, File Sharing.
Protection: Goals of protection, Principles of protection, Protection Rings, Domain of
protection, Access matrix.
Text Books:
1. Operating System Concepts, Silberschatz A, Galvin P B, Gagne G, 10th Edition,
Wiley, 2018.
2. Modern Operating Systems, Tanenbaum A S, 4th Edition, Pearson , 2016
Reference Books:
1. Operating Systems -Internals and Design Principles, Stallings W, 9th edition, Pearson,
2018
2. Operating Systems: A Concept Based Approach, D.M Dhamdhere, 3rd Edition,
McGraw- Hill, 2013
******
R23 Regulations
UNIT I:
Introduction: Database system, Characteristics (Database Vs File System), Database Users,
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 the database.
Entity Relationship Model: Introduction, Representation of entities, attributes, entity set,
relationship, relationship set, constraints, sub classes, super class, inheritance, specialization,
generalization using ER Diagrams.
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, Relational Algebra, Relational Calculus. BASIC SQL:
Simple Database schema, data types, table definitions (create, alter), different DML
operations (insert, delete, update).
UNIT III:
SQL: Basic SQL querying (select and project) using where clause, arithmetic & logical
operations, SQL functions (Date and Time, Numeric, String conversion) 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.
R23 Regulations
UNIT IV:
UNIT V:
Transaction Concept: Transaction State, ACID properties, Concurrent Executions,
Serializability, Recoverability, Implementation of Isolation, Testing for Serializability, lock
based, time stamp based, optimistic, concurrency protocols, Deadlocks, Failure
Classification, Storage, Recovery and Atomicity, Recovery algorithm.
Introduction to Indexing Techniques: B+ Trees, operations on B+Trees, Hash Based
Indexing:
Text Books:
1) Database Management Systems, 3rd edition, Raghurama Krishnan, Johannes Gehrke,
TMH (For Chapters 2, 3, 4)
2) Database System Concepts,5th edition, Silberschatz, Korth, Sudarsan, TMH (For
Chapter 1 and Chapter 5)
Reference Books:
1) Introduction to Database Systems, 8thedition, C J Date, Pearson.
2) Database Management System, 6th edition, Ramez Elmasri, Shamkant B. Navathe,
Pearson
3) Database Principles Fundamentals of Design Implementation and Management, 10th
edition, Corlos Coronel, Steven Morris, Peter Robb, Cengage Learning, 2022
1) https://nptel.ac.in/courses/106/105/106105175/
2) https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012758066672820
22456_shared/overview
******
R23 Regulations
COMPUTER NETWORKS
Course Objectives:
The main objectives of the course is to
• To understand the different types of networks
• To discuss the software and hardware components of a network
• To develop an understanding the principles of computer networks.
• To familiarize with OSI model and the functions of layered structure.
• To explain networking protocols, algorithms and design perspectives
Course Outcomes:
After completion of the course, students will be able to
1. Identify the software and hardware components of a Computer network. (L1)
2. Explain the functionality of each layer of a computer network. (L2)
3. Identify and analyze flow control, congestion control, and routing issues. (L4)
4. Analyze and interpret the functionality and effectiveness of the routing protocols. (L4)
5. Choose the appropriate transport protocol based on the application requirements. (L3)
UNIT I:
Introduction: Types of Computer Networks, Broadband Access Networks, Mobile and
Wireless Access Networks, Content Provider Networks, Transit networks, Enterprise
Networks, Network technology from local to global, Personal Area Networks, Local Area
Networks, Home Networks, Metropolitan Area Networks, Wide Area Networks,
Internetworks, Network Protocols, Design Goals, Protocol Layering, Connections and
Reliability, Service Primitives, The Relationship of Services to Protocols ,Reference Models,
The OSI Reference Model, The TCP/IP Reference Model, A Critique of the OSI Model and
Protocols, A Critique of the TCP/IP Reference Model and Protocols.
UNIT II:
The Data Link Layer: Guided Transmission Media, Persistent Storage, Twisted Pairs,
Coaxial Cable, Power Lines, Fiber Optics, Data Link Layer Design Issues, Services Provided
To The Network Layer, Framing Error Control, Flow Control, Error Detection And
Correction, Error-Correcting Codes, Error-Detecting Codes, Elementary Data Link Protocols,
Initial Simplifying Assumptions Basic Transmission And Receipt, Simplex Link-Layer
Protocols, Improving Efficiency, Bidirectional Transmission, Multiple Frames In Flight,
Examples Of Full-Duplex, Sliding Window Protocols, The Channel Allocation Problem,
Static Channel Allocation, Assumptions For Dynamic Channel Allocation, Multiple Access
Protocols, Aloha, Carrier Sense Multiple Access Protocols, Collision-Free
Protocols, Limited-Contention Protocols, Wireless LAN Protocols, Ethernet,
Classic Ethernet Physical Layer, Classic Ethernet Mac Sublayer Protocol,
Ethernet Performance, Switched Ethernet, Fast Ethernet, Gigabit Ethernet,
10-Gigabit Ethernet,40- And 100-Gigabit Ethernet, Retrospective On
Ethernet.
R23 Regulations
UNIT III:
The Network Layer: Network Layer Design Issues, Store-And-Forward Packet Switching,
Services Provided To The Transport Layer, Implementation Of Connectionless Service,
Implementation Of Connection-Oriented Service, Comparison Of Virtual-Circuit And
Datagram Networks, Routing Algorithms In A Single Network, The Optimality Principle,
Shortest Path Algorithm, Flooding, Distance Vector Routing, Link State Routing,
Hierarchical Routing Within a Network, Broadcast Routing, Multicast Routing, Anycast
Routing, Traffic Management at The Network Layer, The Need for Traffic Management:
Congestion, Approaches To Traffic Management, Internetworking, Internetworks: An
Overview, How Networks differ, Connecting Heterogeneous Networks, Connecting
Endpoints Across Heterogeneous Networks, Internetwork Routing: Routing Across Multiple
Networks Supporting Different Packet Sizes: Packet Fragmentation, The Network Layer In
The Internet, The IP Version 4 Protocol, IP Addresses, IP Version 6, Internet Control
Protocols, Label Switching and MPLS, OSPF—An Interior Gateway Routing Protocol,
BGP—The Exterior Gateway Routing Protocol, Internet Multicasting.
UNIT IV:
The Transport Layer: The Transport Service, Services Provided To The Upper Layers,
Transport Service Primitives, Berkeley Sockets, An Example Of Socket Programming: An
Internet File Server, Elements Of Transport Protocols, Addressing, Connection
Establishment, Connection Release, Error Control And Flow Control, Multiplexing, Crash
Recovery, Congestion Control, Desirable Bandwidth Allocation, Regulating The Sending
Rate, Wireless Issues, The Internet Transport Protocols: UDP, Introduction To UDP, Remote
Procedure Call, Real-Time Transport Protocols, The Internet Transport Protocols: TCP,
Introduction To TCP, The TCP Service Model, The TCP Protocol, The TCP Segment
Header, TCP Connection Establishment, TCP Connection Release.
UNIT V:
The Application Layer: Electronic Mail, Architecture and Services, The User Agent,
Message Formats, Message Transfer, Final Delivery, The World Wide Web, Architectural
Overview, Static Web Objects, Dynamic Web Pages and Web Applications, HTTP and
HTTPS, Web Privacy, Content Delivery, Content and Internet Traffic, Server Farms and Web
Proxies, Content Delivery Networks, Peer-To-Peer Networks, Evolution of The Internet.
R23 Regulations
Text Books:
Andrew Tanenbaum, Feamster Wetherall, Computer Networks, 6th Edition, Global Edition.
Reference Books:
******
R23 Regulations
List of Activities/Experiments:
1. Study different types of Network cables (Copper and Fiber) and prepare cables
(Straight and Cross) to connect Two or more systems. Use crimping tool to connect
jacks. Use LAN tester to connect the cables. - Install and configure Network Devices:
HUB, Switch and Routers. Consider both manageable and non-manageable switches.
Do the logical configuration of the system. Set the bandwidth of different ports. -
Install and Configure Wired and Wireless NIC and transfer files between systems in
Wired LAN and Wireless LAN. Consider both adhoc and infrastructure mode of
operation.
2. Work with the commands Ping, Tracert, Ipconfig, pathping, telnet, ftp, getmac, ARP,
Hostname, Nbtstat, netdiag, and Nslookup
3. Find all the IP addresses on your network. Unicast, Multicast, and Broadcast on your
network.
4. Use Packet tracer software to build network topology and configure using Distance
vector routing protocol.
5. Use Packet tracer software to build network topology and configure using Link State
routing protocol.
6. Using JAVA RMI Write a program to implement Basic Calculator.
7. Implement a Chatting application using JAVA TCP and UDP sockets.
8. Hello command is used to know whether the machine at the other end is working or
not. Echo command is used to measure the round-trip time to the neighbor. Implement
Hello and Echo commands using JAVA.
9. Using Wireshark perform the following operations:
- Inspect HTTP Traffic
- Inspect HTTP Traffic from a Given IP Address,
- Inspect HTTP Traffic to a Given IP Address,
- Reject Packets to Given IP Address,
- Monitor Apache and MySQL Network Traffic.
10. Install Network Simulator 2/3. Create a wired network using dumbbell topology.
R23 Regulations
Reference Books:
1. ShivendraS.Panwar, Shiwen Mao, Jeong-dong Ryoo, and Yihan Li, “TCP/IP
Essentials:A Lab-Based Approach”, Cambridge University Press, 2004.
2. Cisco Networking Academy, “CCNA1 and CCNA2 Companion Guide”, Cisco
Networking Academy Program, 3rd edition, 2003.
3. Elloitte Rusty Harold, “Java Network Programming”, 3rd edition, O’REILLY, 2011.
******
R23 Regulations
Course Objectives:
Course Outcomes:
Sample Experiments:
1. Creation, altering and dropping of tables and inserting rows into a table (use
constraints while creating tables) examples using SELECT command.
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 the class.
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
R23 Regulations
5.
Reference Books:
******
R23 Regulations
Course Objectives:
Course Outcomes:
Sample Experiments:
4. Selector forms
a. Write a program to apply different types of selector forms
i. Simple selector (element, id, class, group, universal)
ii. Combinator selector (descendant, child, adjacent sibling, general sibling)
iii. Pseudo-class selector
iv. Pseudo-element selector
v. Attribute selector
5. CSS with Color, Background, Font, Text and CSS Box Model
a. Write a program to demonstrate the various ways you can reference a color in CSS.
b. Write a CSS rule that places a background image halfway down the page, tilting it
horizontally. The image should remain in place when the user scrolls up or down.
c. Write a program using the following terms related to CSS font and text:
i. font-size ii. font-weight iii. font-style
iv. text-decoration v. text-transformation vi. text-alignment
d. Write a program, to explain the importance of CSS Box model using
i. Content ii. Border iii. Margin iv. padding
Text Books:
1. John Dean, Web Programming with HTML5, CSS and JavaScript, Jones & Bartlett
Learning, 2019.
Reference Books:
1. Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson, 2013.
2. Pro MERN Stack: Full Stack Web App Development with Mongo, Express, React,
and Node, Vasan Subramanian, 2nd edition, APress, O’Reilly.
https://www.w3schools.com/html
https://www.w3schools.com/css
https://www.w3schools.com/js/
https://www.w3schools.com/nodejs
https://www.w3schools.com/typescript
******
R23 Regulations
Course Objectives:
The objective of this course is to familiarize students with design thinking process as a tool
for breakthrough innovation. It aims to equip students with design thinking skills and ignite
the minds to create innovative ideas, develop solutions for real-time problems.
Course Outcomes:
• Define the concepts related to design thinking. (L1, L2)
• Explain the fundamentals of Design Thinking and innovation (L1, L2)
• Apply the design thinking techniques for solving problems in various sectors. (L3)
• Analyse to work in a multidisciplinary environment (L4)
• Evaluate the value of creativity (L5)
• Formulate specific problem statements of real time issues (L3, L6)
UNIT I
Introduction to Design Thinking
Introduction to elements and principles of Design, basics of design-dot, line, shape, form as
fundamental design components. Principles of design. Introduction to design thinking, history
of Design Thinking, New materials in Industry.
UNIT II
Design Thinking Process
Design thinking process (empathize, analyze, idea & prototype), implementing the process in
driving inventions, design thinking in social innovations. Tools of design thinking - person,
costumer, journey map, brainstorming, product development
Activity: Every student presents their idea in three minutes, Every student can present design
process in the form of flow diagram or flow chart etc. Every student should explain about
product development.
UNIT III
Innovation
Art of innovation, Difference between innovation and creativity, role of creativity and
innovation in organizations- Creativity to Innovation- Teams for innovation- Measuring the
impact and value of creativity.
Activity: Debate on innovation and creativity, Flow and planning from idea to innovation,
Debate on value-based innovation.
R23 Regulations
UNIT V
Design Thinking in Business Processes
Design Thinking applied in Business & Strategic Innovation, Design Thinking principles that
redefine business – Business challenges: Growth, Predictability, Change, Maintaining
Relevance, Extreme competition, Standardization. Design thinking to meet corporate needs-
Design thinking for Startups- Defining and testing Business Models and Business Cases-
Developing & testing prototypes.
Activity: How to market our own product, About maintenance, Reliability and plan for
startup.
Textbooks:
1. Tim Brown,Change by design, Harper Bollins (2009)
2. Idris Mootee, Design Thinking for Strategic Innovation, 2013, John Wiley & Sons.
Reference Books:
1. David Lee, Design Thinking in the Classroom, Ulysses press
2. Shrutin N Shetty, Design the Future, Norton Press
3. William Lidwell, Universal Principles of Design- Kritinaholden, Jill Butter.
4. Chesbrough. H, The Era of Open Innovation – 2013
******