CSBS R23 II Year Syllabus
CSBS R23 II Year Syllabus
(AUTONOMOUS)
II B.Tech. I Semester
(Common to CSE and all CSE allied branches)
L T P C
3 0 0 3
Course Outcomes:
After successful completion of this course, the students should be able to:
CO1: Apply mathematical logic to solve problems. (L2, L3)
CO2: Understand the concepts and perform the operations related to sets, relations and
functions. Gain the conceptual background needed and identify structures of algebraic
nature. (L3, L5)
CO3: Apply basic counting techniques to solve combinatorial problems. (L3)
CO4: Formulate problems and solve recurrence relations. (L2, L3)
CO5: Apply Graph Theory in solving computer science problems. (L3, L5)
UNIT V Graphs
Basic Concepts, Isomorphism and Subgraphs, Trees and their Properties, Spanning
Trees, Directed Trees, Binary Trees, Planar Graphs, Euler’s Formula, Multigraphs and
Euler Circuits, Hamiltonian Graphs.
Textbooks:
1. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with
Applications to Computer Science, Tata McGraw Hill, 2002.
2. Kenneth H. Rosen, Discrete Mathematics and its Applications with
Combinatorics and Graph Theory, 7th Edition, McGraw Hill Education (India)
Private Limited.
Reference Books:
1. Joe L. Mott, Abraham Kandel and Theodore P. Baker, Discrete Mathematics for
Computer Scientists & Mathematicians, 2nd Edition, Pearson Education.
2. Narsingh Deo, Graph Theory with Applications to Engineering and Computer
Science.
Course Objectives:
1. To help the students appreciate the essential complementary between 'VALUES' and
'SKILLS' to ensure sustained happiness and prosperity which are the core aspirations
of all human beings.
2. 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.
3. 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:
At the end of the course, students will be able to
CO1: Define the terms like Natural Acceptance, Happiness and Prosperity (L1, L2)
CO2: Identify one’s self, and one’s surroundings (family, society nature) (L1, L2)
CO3: Apply what they have learnt to their own self in different day-to-day settings in real
life(L3)
CO4: Relate human values with human relationship and human society. (L4)
CO5: Justify the need for universal human values and harmonious existence (L5)
CO6: Develop as socially and ecologically responsible engineers (L3, L6)
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.
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
READINGS:
Textbook and Teachers Manual
a. The Textbook
R R Gaur, R Asthana, G P Bagaria, A Foundation Course in Human Values and
Professional Ethics, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-
93-87034-47-1
b. The Teacher’s Manual
R R Gaur, R Asthana, G P Bagaria, Teachers’ Manual for A Foundation Course in
Human Values and Professional Ethics, 2nd Revised Edition, Excel Books, New
Delhi, 2019. ISBN 978-93-87034-53-2
Reference Books
1. JeevanVidya: EkParichaya, A Nagaraj, Jeevan VidyaPrakashan, 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 analyzing 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.
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.
Online Resources
1. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%201-
Introduction%20to%20Value%20Education.pdf
2. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%202-
Harmony%20in%20the%20Human%20Being.pdf
3. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%203-
Harmony%20in%20the%20Family.pdf
4. https://fdp-si.aicte-india.org/UHV%201%20Teaching%20Material/D3-
S2%20Respect%20July%2023.pdf
5. https://fdp-si.aicte-india.org/UHV-
II%20Class%20Notes%20&%20Handouts/UHV%20Handout%205-
Harmony%20in%20the%20Nature%20and%20Existence.pdf
6. https://fdp-si.aicte-india.org/download/FDPTeachingMaterial/3-days%20FDP-
SI%20UHV%20Teaching%20Material/Day%203%20Handouts/UHV%203D%20D
3- S2A%20Und%20Nature-Existence.pdf
7. https://fdp-si.aicte-
india.org/UHV%20II%20Teaching%20Material/UHV%20II%20Lecture%2023-
25%20Ethics%20v1.pdf
8. https://www.studocu.com/in/document/kiet-group-of-institutions/universal-
human- values/chapter-5-holistic-understanding-of-harmony-on-professional-
ethics/62490385
9. https://onlinecourses.swayam2.ac.in/aic22_ge23/preview
SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY
(AUTONOMOUS)
II Year B.Tech. CSE (DS) – II Semester
(Common to CSM, CSD, CAI)
L T P C
3 0 0 3
Course Objectives:
The main objectives of the course are to
1. provide students with a comprehensive understanding of digital logic design
principles and computer organization fundamentals
2. Describe memory hierarchy concepts
3. Explain input/output (I/O) systems and their interaction with the CPU, memory,
and peripheral devices
Course Outcomes:
After completion of the course, students will be able to
1. Differentiate between combinational and sequential circuits based on their
characteristics and functionalities. (L2)
2. Demonstrate an understanding of computer functional units. (L2)
3. Analyze the design and operation of processors, including instruction execution,
pipelining, and control unit mechanisms, to comprehend their role in computer
systems. (L3)
4. Describe memory hierarchy concepts, including cache memory, virtual memory,
and secondary storage, and evaluate their impact on system performance and
scalability. (L3)
5. Explain input/output (I/O) systems and their interaction with the CPU, memory,
and peripheral devices, including interrupts, DMA, and I/O mapping techniques.
(L3)
6. Design Sequential and Combinational Circuits (L6)
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
Textbooks:
1. Computer Organization, Carl Hamacher, ZvonkoVranesic, SafwatZaky, 6th
edition, McGraw Hill, 2023.
2. Digital Design, 6th Edition, M. Morris Mano, Pearson Education, 2018.
3. Computer Organization and Architecture, William Stallings, 11thEdition,
Pearson, 2022.
Reference Books:
1. Computer Systems Architecture, M.Moris Mano, 3rdEdition, Pearson, 2017.
2. Computer Organization and Design, David A. Paterson, John L. Hennessy,
Elsevier, 2004.
3. Fundamentals of Logic Design, Roth, 5thEdition, Thomson, 2003.
Course Objectives:
The main objectives of the course is to
1. provide knowledge on advance data structures frequently used in Computer
Science domain
2. Develop skills in algorithm design techniques popularly used
3. 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)
6. Design new algorithms (L6)
UNIT – I
Introduction to Algorithm Analysis, Space and Time Complexity analysis, Asymptotic
Notations.
AVL Trees – Creation, Insertion, Deletion operations and Applications B-Trees –
Creation, Insertion, Deletion operations and Applications
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
NP Hard and NP Complete Problems: Basic Concepts, Cook’s theorem NP Hard Graph
Problems: Clique Decision Problem (CDP), Chromatic Number Decision Problem
(CNDP), Traveling Salesperson Decision Problem (TSP)
NP Hard Scheduling Problems: Scheduling Identical Processors, Job Shop Scheduling
Textbooks:
1. Fundamentals of Data Structures in C++, Horowitz, Ellis; Sahni, Sartaj;
Mehta, Dinesh 2nd Edition Universities Press
2. Computer Algorithms/C++ Ellis Horowitz, SartajSahni, 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
Course Objectives:
The learning objectives of this course are to:
1. Identify Java language components and how they work together in applications
2. Learn the fundamentals of object-oriented programming in Java, including defining
classes, invoking methods, using class libraries.
3. Learn how to extend Java classes with inheritance and dynamic binding and how
to use exception handling in Java applications
4. Understand how to design applications with threads in Java
5. Understand how to use Java apis for program development
Course Outcomes:
After completion of the course, students will be able to
1. Analyze problems, design solutions using OOP principles, and implement them
efficiently in Java. (L4)
2. Design and implement classes to model real-world entities, with a focus on attributes,
behaviors, and relationships between objects (L4)
3. Demonstrate an understanding of inheritance hierarchies and polymorphic behaviour,
including method overriding and dynamic method dispatch. (L3)
4. Apply Competence in handling exceptions and errors to write robust and fault-tolerant
code. (L3)
5. Perform file input/output operations, including reading from and writing to files using
Java I/O classes, graphical user interface (GUI) programming using JavaFX. (L3)
6. Choose appropriate data structure of Java to solve a problem (L6)
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 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, Result Set 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)
Textbooks:
1. JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
2. Joy with JAVA, Fundamentals of Object Oriented Programming, Debasis
Samanta, Monalisa Sarma, 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
Online Resources:
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_01288046
4547618 816347_shared/overview
SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY
(AUTONOMOUS)
II B.Tech. I Semester
(Common to CSE, CSM, CSC, CAI, CSO, IT, CSBS)
L T P C
0 0 3 1.5
Course Objectives:
The objective 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
CO1: Design and develop programs to solve real world problems with the popular
algorithm design methods. (L5)
CO2: Demonstrate an understanding of Non-Linear data structures by developing
implementing the operations on AVL Trees, B-Trees, Heaps and Graphs. (L2)
CO3: Critically assess the design choices and implementation strategies of algorithms and
data structures in complex applications. (L5)
CO4: Utilize appropriate data structures and algorithms to optimize solutions for specific
computational problems. (L3)
CO5: Compare the performance of different of algorithm design strategies (L4)
CO6: Design algorithms to new real world problems (L6)
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 bi-connected 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. Implement Job sequencing with deadlines using Greedy
strategy.
8. Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.
9. Implement N-Queens Problem Using Backtracking.
10. Use Backtracking strategy to solve 0/1 Knapsack problem.
11. Implement Travelling Sales Person problem using Branch and Bound approach.
Reference Books:
1. Fundamentals of Data Structures in C++, Ellis Horowitz, Sartaj
Sahni, 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.
Course Objectives:
The aim of this course is to
1. Practice object-oriented programming in the Java programming language
2. Implement Classes, Objects, Methods, Inheritance, Exception, Runtime
Polymorphism, User defined Exception handling mechanism
3. Illustrate inheritance, Exception handling mechanism, JDBC connectivity
4. Construct Threads, Event Handling, implement packages, Java FX GUI
Course Outcomes:
After completion of the course, students will be able to
1. Demonstrate a solid understanding of Java syntax, including data types, control
structures, methods, classes, objects, inheritance, polymorphism, and exception
handling. (L2)
2. Apply fundamental OOP principles such as encapsulation, inheritance,
polymorphism, and abstraction to solve programming problems effectively. (L3)
3. Familiar with commonly used Java libraries and APIs, including the Collections
Framework, Java I/O, JDBC, and other utility classes. (L2)
4. Develop problem-solving skills and algorithmic thinking, applying OOP concepts to
design efficient solutions to various programming challenges. (L3)
5. Proficiently construct graphical user interface (GUI) applications using JavaFX (L4)
6. Develop new programs for solving typical computer science problems (L6)
Sample Experiments:
Exercise – 1
a) Write a JAVA program to display default value of all primitive data type of JAVA
b) Write a java program that display the roots of a quadratic equation ax 2+bx=0.
Calculate the discriminate D and basing on value of D, describe the nature of
root.
Exercise - 2
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
bubble sort
c) Write a JAVA program using StringBuffer to delete, remove character.
Exercise - 3
a) Write a JAVA program to implement class mechanism. Create a class,
methods and invoke them inside main method.
b) Write a JAVA program implement method overloading.
c) Write a JAVA program to implement constructor.
d) Write a JAVA program to implement constructor overloading.
Exercise - 4
a) Write a JAVA program to implement Single Inheritance
b) Write a JAVA program to implement multi level Inheritance
c) Write a JAVA program for abstract class to find areas of different shapes
Exercise - 5
a) Write a JAVA program give example for “super” keyword.
b) Write a JAVA program to implement Interface. What kind of Inheritance can be
achieved?
c) Write a JAVA program that implements Runtime polymorphism
Exercise - 6
a) Write a JAVA program that describes exception handling mechanism
b) Write a JAVA program Illustrating Multiple catch clauses
c) Write a JAVA program for creation of Java Built-in Exceptions
d) Write a JAVA program for creation of User Defined Exception
Exercise - 7
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 implementing Runnable)
b) Write a program illustrating is Alive and join ()
c) Write a Program illustrating Daemon Threads.
d) Write a JAVA program Producer Consumer Problem
Exercise – 8
a) Write a JAVA program that import and use the user defined packages
b) Without writing any code, build a GUI that display text in label and image in
an ImageView (use JavaFX)
c) Build a Tip Calculator app using several JavaFX components and learn how
to respond to user interactions with the GUI
Exercise – 9
a) Write a java program that connects to a database using JDBC
b) Write a java program to connect to a database using JDBC and insert values into
it.
c) Write a java program to connect to a database using JDBC and delete values
from it
Textbooks:
1. JAVA one step ahead, Anitha Seth, B.L.Juneja, Oxford.
2. Joy with JAVA, Fundamentals of Object Oriented Programming, Debasis
Samanta, Monalisa Sarma, Cambridge, 2023.
3. JAVA 9 for Programmers, Paul Deitel, Harvey Deitel, 4th Edition, Pearson.
References Books:
1. The complete Reference Java, 11th edition, Herbert Schildt, TMH
2. Introduction to Java programming, 7th Edition, Y Daniel Liang, Pearson
Online Resources:
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lex_auth_012880464
547 618816347_shared/overview
SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY
(AUTONOMOUS)
II Year B.Tech. CSE (DS)– I Semester
(Common to CSE, CSM, CAI, CSD, CSC, CSO and IT Branches)
L T P C
0 1 2 2
(23ACS09) PYTHON PROGRAMMING (SKILL ENHANCEMENT COURSE)
Course Objectives:
The main objectives of the course are to
1. Introduce core programming concepts of Python programming language.
2. Demonstrate about Python data structures like Lists, Tuples, Sets and dictionaries
3. Implement Functions, Modules and Regular Expressions in Python Programming
and to create practical and contemporary applications using these
Course Outcomes:
After completion of the course, students will be able to
1. Classify data structures of Python (L4)
2. Apply Python programming concepts to solve a variety of computational problems
(L3)
3. Understand the principles of object-oriented programming (OOP) in Python,
including classes, objects, inheritance, polymorphism, and encapsulation, and apply
them to design and implement Python programs (L3)
4. Become proficient in using commonly used Python libraries and frameworks such as
JSON, XML, NumPy, pandas (L2)
5. Exhibit competence in implementing and manipulating fundamental data structures
such as lists, tuples, sets, dictionaries (L3)
6. Propose new solutions to computational problems (L6)
UNTI - I
History of Python Programming Language, Thrust Areas of Python, Installing
Anaconda Python Distribution, Installing and Using Jupyter Notebook.
Parts of Python Programming Language: Identifiers, Keywords, Statements
and Expressions, Variables, Operators, Precedence and Associativity, Data Types,
Indentation, Comments, Reading Input, Print Output, Type Conversions, the type
() Function and Is Operator, Dynamic and Strongly Typed Language.
Control Flow Statements: if statement, if-else statement, if...elif…else, Nested
if statement, while Loop, for Loop, continue and break Statements, Catching
Exceptions Using try and except Statement.
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.
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. Addition ii. Insertion iii. 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.
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. Gowrishankar S, Veena A., Introduction to Python Programming, CRC Press.
2. Python Programming, S Sridhar, J Indumathi, V M Hariharan, 2ndEdition,
Pearson, 2024
3. Introduction to Programming Using Python, Y. Daniel Liang, Pearson.
Course Objectives:
1. To make the students to get awareness on environment.
2. To understand the importance of protecting natural resources, ecosystems
for future generations and pollution causes due to the day to day activities of
human life
3. To save earth from the inventions by the engineers.
UNIT I
Multidisciplinary Nature of Environmental Studies: – Definition, Scope and
Importance – Need for Public Awareness.
Natural Resources : Renewable and non-renewable resources – Natural
resources and associated problems – Forest resources – Use and over –
exploitation, deforestation, case studies – Timber extraction – Mining, dams and
other effects on forest and tribal people – Water resources – Use and over
utilization of surface and ground water – Floods, drought, conflicts over water,
dams – benefits and problems – Mineral resources: Use and exploitation,
environmental effects of extracting and using mineral resources, case studies –
Food resources: World food problems, changes caused by agriculture and
overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water
logging, salinity, case studies. – Energy resources:
UNIT II
Ecosystems: Concept of an ecosystem. – Structure and function of an ecosystem
– Producers, consumers and decomposers – Energy flow in the ecosystem –
Ecological succession – Food chains, food webs and ecological pyramids –
Introduction, types, characteristic features, structure and function of the following
ecosystem:
a. Forest ecosystem.
b. Grassland ecosystem
c. Desert ecosystem.
d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
Biodiversity and its Conservation : Introduction 0 Definition: genetic, species
and ecosystem diversity – Bio-geographical classification of India – Value of
biodiversity: consumptive use, Productive use, social, ethical, aesthetic and option
values – Biodiversity at global, National and local levels – India as a mega-
diversity nation – Hot-sports of biodiversity – Threats to biodiversity: habitat loss,
poaching of wildlife, man-wildlife conflicts – Endangered and endemic species of
India – Conservation of biodiversity: In-situ and Ex-situ conservation of
biodiversity.
UNIT III
Environmental Pollution: Definition, Cause, effects and control measures of:
a. Air Pollution.
b. Water pollution
c. Soil pollution
d. Marine pollution
e. Noise pollution
f. Thermal pollution
g. Nuclear hazards
Solid Waste Management: Causes, effects and control measures of urban and
industrial wastes – Role of an individual in prevention of pollution – Pollution case
studies – Disaster management: floods, earthquake, cyclone and landslides.
UNIT IV
Social Issues and the Environment: From Unsustainable to Sustainable
development – Urban problems related to energy – Water conservation, rain water
harvesting, watershed management – Resettlement and rehabilitation of people;
its problems and concerns. Case studies – Environmental ethics: Issues and
possible solutions – Climate change, global warming, acid rain, ozone layer
depletion, nuclear accidents and holocaust. Case Studies – Wasteland
reclamation. – Consumerism and waste products. – Environment Protection Act.
– Air (Prevention and Control of Pollution) Act. – Water (Prevention and control of
Pollution) Act – Wildlife Protection Act – Forest Conservation Act – Issues involved
in enforcement of environmental legislation – Public awareness.
UNIT V
Human Population and the Environment: Population growth, variation among
nations. Population explosion – Family Welfare Programmes. – Environment and
human health – Human Rights – Value Education – HIV/AIDS – Women and Child
Welfare – Role of information Technology in Environment and human health –
Case studies.
Field Work: Visit to a local area to document environmental assets River/forest
grassland/hill/mountain – Visit to a local polluted site - Urban/Rural/Industrial/
Agricultural Study of common plants, insects, and birds – river, hill slopes, etc.
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.
References:
1. Deeksha Dave and E.Sai Baba Reddy, “Textbook of Environmental
Science”, Cengage Publications.
2. M.Anji Reddy, “Text book of Environmental Sciences and Technology”, BS
Publication.
3. J.P.Sharma, Comprehensive Environmental studies, Laxmi publications.
4. J. Glynn Henry and Gary W. Heinke, “Environmental Sciences and
Engineering”, Prentice hall of India Private limited
5. G.R.Chatwal, “A Text Book of Environmental Studies” Himalaya Publishing
House
6. Gilbert M. Masters and Wendell P. Ela, “Introduction to Environmental
Engineering and Science, Prentice hall of India Private limited.
Course Outcomes:
After successful completion of the course, the student will be able to
1. Develop the thinking ability to meet the challenges in solving Logical Reasoning
problems.
2. Solve campus placements aptitude papers covering Quantitative Ability and Verbal
Ability.
3. Apply different placement practice techniques.
UNIT-I 9 Hours
QUANTITATIVE ABILITY – I: Vedic Maths – Square - Square root – Cube - Cube root –
Higher Roots - Fractions (+, -, ×, ÷)– Decimal Fractions(+, -, ×, ÷) –LCM and HCF –
VBODMAS Rule - Simplifications - Number System [ Introduction –p/q forms –Factors
– Multiples – Prime Numbers – Composite Numbers – Twin Primes – Co-Primes,
Different Types of Numbers, Number of factors – Sum of factors – Unit’s place value –
Remainder theorem – Number of Zeros at the end of the product - Divisibility Rules –
Prime Number Checking –Relation among Quotient, Divident, Divisor & Remainder -
Formulae, Application type of problems]
UNIT-II 9 Hours
QUANTITATIVE ABILITY – II: Ratio, Proportion & Variation [Definition of ratio, Types of
Ratios, Principles of Ratios, Comparison of Ratios, Definition of Proportion, Types of
Proportion, Principle of Proportion, Properties of Proportion, Variation & Types of
variations]– Partnership & Share[Definition of partnership, Types of partnership, Simple
Partnership & Compound Partnership, profits ratio, Application type of problems] –
Average & Ages[Definition of Average, Average of Natural Numbers, Even Numbers,
Odd Numbers, Prime Numbers, Application type of problems] – Mixture & Alligation
[Definition of Mixture & Alligation, Mixture Formula, Alligation Rule, Application type of
Problems]
UNIT-III 9 Hours
REASONING ABILITY I: Number Series – Number Analogy – Number Odd Man Out –
Wrong Number – Letter Series – Letter Analogy – Letter Odd Man
UNIT-IV 9 Hours
VERBAL I: Verbal analogy - Types - Parts of Speech – Noun, Pronoun, Adjective, Verb,
Adverb, Preposition, Conjunction and Interjection - Prepositions –Preposition of Place,
Preposition of Placement, Preposition of Time and Preposition of Duration - Articles –
Usage of a, an, the, Omission of articles - Sentences - Pattern and Types.
UNIT-V 9 Hours
SOFT SKILL I: Communication Skills - Self-Confidence - Introductions & Greetings -
Presentation Skills - Self- Motivation
TEXT BOOKS:
1. Quantitative Aptitude, Logic Reasoning & Verbal Reasoning, R S Agarwal,
S.Chand Publications.
2. Quantitative Aptitude for Competitive Examinations, R S Agarwal, S.Chand
Publications
L T P C
2 0 0 2
Course Objectives:
• To inculcate the basic knowledge of microeconomics and financial accounting
• To make the students learn how demand is estimated for different products, input-
output relationship for optimizing production and cost
• To Know the Various types of market structure and pricing methods and strategy
• To give an overview on investment appraisal methods to promote the students to
learn how to plan long-term investment decisions.
• To provide fundamental skills on accounting and to explain the process of preparing
financial statements.
Course Outcomes:
CO1: Define the concepts related to Managerial Economics, financial accounting and
management(L2)
CO2: Understand the fundamentals of Economics viz., Demand, Production, cost,
revenue and markets (L2)
CO3: Apply the Concept of Production cost and revenues for effective Business
decision (L3)
CO4: Analyze how to invest their capital and maximize return. (L4)
CO5: Evaluate the capital budgeting techniques. (L5)
CO6: 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.
L T P C
2 0 0 2
Course Objectives:
• To enable student’s comprehension of organizational behavior
• To offer knowledge to students on self-motivation, leadership and management
• To facilitate them to become powerful leaders
• To Impart knowledge about group dynamics
• To make them understand the importance of change and development
Course Outcomes:
CO1: Define the Organizational Behaviour, its nature and scope. (L2)
CO2: Understand the nature and concept of Organizational behaviour. (L2)
CO3: Apply theories of motivation to analyse the performance problems. (L3)
CO4: Analyse the different theories of leadership (L4)
CO5: Evaluate group dynamics (L5)
CO6: Develop as powerful leader (L5)
Course Outcomes:
CO1: Define Business Environment and its Importance. (L2)
CO2: Understand various types of business environment. (L2)
CO3: Apply the knowledge of Money markets in future investment (L3)
CO4: Analyse India’s Trade Policy (L4)
CO5: Evaluate fiscal and monitory policy (L5)
CO6: Develop a personal synthesis and approach for identifying business opportunities (L5)
Course Outcomes: After successful completion of this course, the students should be able to:
CO1: Acquire knowledge in finding the analysis of the data quantitatively or categorically
and various statistical elementary tools. (L2, L3)
CO2: Develop skills in designing mathematical models involving probability, random
variables and the critical thinking in the theory of probability and its applications in
real life problems. (L3, L5)
CO3: Apply the theoretical probability distributions like binomial, Poisson, and Normal in the
relevant application areas. (L3)
CO4: Analyze to test various hypotheses included in theory and types of errors for large
samples. (L2, L3)
CO5: Apply the different testing tools like t-test, F-test, chi-square test to analyze the
relevant real-life problems. (L3, L5)
Course Outcomes:
After completion of the course, students will be able to
CO1: Describe the basics of the operating systems, mechanisms of OS to handle processes,
threads, and their communication. (L1)
CO2: Understand the basic concepts and principles of operating systems, including process
management, memory management, file systems, and Protection. (L2)
CO3: Make use of process scheduling algorithms and synchronization techniques to achieve
better performance of a computer system. (L3)
CO4: Illustrate different conditions for deadlock and their possible solutions. (L2)
CO5: Analyze the memory management and its allocation policies. (L4)
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.
Virtual Memory Management: Introduction, Demand paging, Copy-on-write,
Page replacement, Allocation of frames, Thrashing.
Storage Management: Overview of Mass Storage Structure, HDD Scheduling.
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.
Textbooks:
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
Online Learning Resources:
1. https://nptel.ac.in/courses/106/106/106106144/
2. http://peterindia.net/OperatingSystems.html
SRI VENKATESWARA COLLEGE OF ENGINEERING AND
TECHNOLOGY (AUTONOMOUS)
II B.Tech. II Semester
(Common to CSE, CSD, CSM, CSC, CAI, CSO, IT, CSBS)
L T P C
3 0 0 3
Course Outcomes:
After completion of the course, students will be able to
CO1: Understand the basic concepts of database management systems (L2)
CO2: Analyze a given database application scenario to use ER model for conceptual
design of the database (L4)
CO3: Utilize SQL proficiently to address diverse query challenges (L3).
CO4: Employ normalization methods to enhance database structure (L3)
CO5: Assess and implement transaction processing, concurrency control and
database recovery protocols in databases. (L4)
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.
UNIT IV Schema Refinement (Normalization)
Purpose of Normalization or schema refinement, concept of functional
dependency, normal forms based on functional dependency Lossless join and
dependency preserving decomposition, (1NF, 2NF and 3 NF), concept of
surrogate key, Boyce-Codd normal form(BCNF), MVD, Fourth normal form(4NF),
Fifth Normal Form (5NF).
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:
Textbooks:
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, Corlos Coronel, Steven Morris, Peter Robb, Cengage Learning.
Web-Resources:
1. https://nptel.ac.in/courses/106/105/106105175/
2. https://infyspringboard.onwingspan.com/web/en/app/toc/lexath_01275806667282
02 2456_shared/overview
SRI VENKATESWARA COLLEGE OF ENGINEERING AND
TECHNOLOGY (AUTONOMOUS)
II B.Tech. II Semester CSBS
L T P C
3 0 0 3
Course Objectives:
The main objectives of the course are to
• Provide insights into system calls, file systems, semaphores,
• Develop and debug CPU Scheduling algorithms, page replacement algorithms, thread
implementation
• Implement Bankers Algorithms to Avoid the Dead Lock
Course Outcomes:
After completion of the course, students will be able to
CO1: Trace different CPU Scheduling algorithms (L2).
CO2: Implement Bankers Algorithms to Avoid the Dead Lock (L3).
CO3: Evaluate Page replacement algorithms (L5).
CO4: Illustrate the file organization techniques (L4).
CO5: Illustrate Inter process Communication and concurrent execution of threads (L4)
Sample Experiments:
1. Practicing of Basic UNIX Commands.
2. Write programs using the following UNIX operating system calls fork, exec,
getpid, exit, wait, close, stat, opendir and readdir
3. Simulate UNIX commands like cp, ls, grep, etc.,
4. Simulate the following CPU scheduling algorithms
a) FCFS b) SJF c) Priority d) Round Robin
5. Control the number of ports opened by the operating system with
a) Semaphore b) Monitors.
6. Write a program to illustrate concurrent execution of threads using pthreads
library.
7. Write a program to solve producer-consumer problem using Semaphores.
8. Implement the following memory allocation methods for fixed partition
a) First fit b) Worst fit c) Best fit
9. Simulate the following page replacement algorithms
a) FIFO b) LRU c) LFU
10. Simulate Paging Technique of memory management.
11. Implement Bankers Algorithm for Dead Lock avoidance and prevention
12. Simulate the following file allocation strategies
a) Sequential b) Indexed c) Linked
Reference 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
3. Operating Systems -Internals and Design Principles, Stallings W, 9th edition,
Pearson, 2018
4. Operating Systems: A Concept Based Approach, D.M Dhamdhere, 3rd Edition,
McGraw- Hill, 2013
Online Learning Resources:
1. https://www.cse.iitb.ac.in/~mythili/os/
2. http://peterindia.net/OperatingSystems.html
SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY
(AUTONOMOUS)
II B.Tech. II Semester
(Common to CSE, CSD, CSM, CSC, CAI, CSO, IT, CSBS)
L T P C
0 0 3 1.5
Course Objectives:
This Course will enable students to
• Populate and query a database using SQL DDL/DML Commands
• Declare and enforce integrity constraints on a database
• Writing Queries using advanced concepts of SQL
• Programming PL/SQL including procedures, functions, cursors and triggers.
Course Outcomes:
After completion of the course, students will be able to
CO1: Utilizing Data Definition Language (DDL), Data Manipulation Language (DML), and
Data Control Language (DCL) commands effectively within a database environment
(L3)
CO2: Constructing and execute queries to manipulate and retrieve data from databases. (L3)
CO3: Develop application programs using PL/SQL. (L3)
CO4: Analyze requirements and design custom Procedures, Functions, Cursors, and Triggers,
leveraging their capabilities to automate tasks and optimize database functionality (L4)
CO5: Establish database connectivity through JDBC (Java Database Connectivity) (L3)
Experiments covering the topics:
• DDL, DML, DCL commands
• Queries, nested queries, built-in functions,
• PL/SQL programming- control structures
• Procedures, Functions, Cursors, Triggers,
• Database connectivity- ODBC/JDBC
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 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 were
found)
ii. Insert data into student table and use COMMIT, ROLLBACK and
SAPOINT in PL/SQL block.
6. Develop a program that includes the features NESTED IF, CASE and CASE
expression. The program can be extended using the NULLIF and COALESCE
functions.
7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested
loops using ERROR Handling, BUILT –IN Exceptions, USE defined
Exceptions, RAISE- APPLICATION ERROR.
8. Programs development using creation of procedures, passing parameters
IN and OUT of PROCEDURES.
9. Program development using creation of stored functions, invoke functions
in SQL Statements and write complex functions.
10. Develop programs using features parameters in a CURSOR, FOR UPDATE
CURSOR, WHERE CURRENT of clause and CURSOR variables.
11. Develop Programs using BEFORE and AFTER Triggers, Row and Statement
Triggers and INSTEAD OF Triggers
12. Create a table and perform the search operation on table using
indexing and non- indexing techniques.
13. Write a Java program that connects to a database using JDBC
14. Write a Java program to connect to a database using JDBC and insert values
into it
15. Write a Java program to connect to a database using JDBC and delete values
from it
Text Books/Suggested Reading:
1. Oracle: The Complete Reference by Oracle Press
2. Nilesh Shah, "Database Systems Using Oracle”, PHI, 2007
3. Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson Education,
2007
SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY
(AUTONOMOUS)
II B.Tech. II Semester CSBS
L T P C
0 1 2 2
Course Objectives:
This Course will enable students to
1. To understand the concepts of life skills and its importance
2. To motivate students to look within and create a better version of self.
3. To introduce them to key concepts of values, life skills and business communication
Course Outcomes:
After completion of the course, students will be able to
1. Understand the need for life skills and values.
2. Acquaint the learners with basics of pronunciation
3. Recognize own strengths and opportunities
4. Integrate the life skills to different situations
5. Comprehend the basic tenets of communication
6. Apply the basic communication practices in different types of communication
UNIT-I
Elementary Grammar & Vocabulary Enrichment
Understanding basic grammar-Parts of Speech; reading newspapers for
vocabulary development - Understanding Tenses& Common mistakes in everyday
conversation.
Phonics in English: Sounds – Vowels and Consonants – Minimal Pairs- Consonant
Clusters- Past Tense Marker and Plural Marker. Activity: Worksheets, Exercises
UNIT-II
Communication Skills:
Overview of Communication Skills Barriers of communication, Types of
communication- Verbal and Non-verbal &Effective communication.
UNIT-III
Introduction to Life Skills
Stress management, working with rhythm and balance, teamwork - Pursuit of
Happiness. What are the skills and values you can identify, what can you relate
to?
UNIT-IV
Art of Public Speaking:
Impromptu, Importance of Non-verbal Communication, Technical Talks, Dynamics
of Professional Presentations – Individual & Group
Writing Skill: Summary writing, story writing and creating a Podcast
UNIT-V
Correspondence and Career Development
Letter-Formal, Email &Application Writing Activity: Compose letters; Emails, leave
applications - Resume Preparation/CV– start writing your comprehensive CV
including every achievement in your life. Video Profile - Activity: Preparation of
Video Profile
Lab Experiments:
1. Listening: Casual and Academic
2. Speaking: Socializing Skills - Introducing Oneself- His / Her Goals & SWOT
3. Group Discussion: Factual, controversial and abstract issues
4. Presentation skill: JAM, Narrating a story/anecdote
5. Writing: Travelogue
6. Public Speaking: Extempore /Monologues
7. Roleplay: Understanding Inter and Cross-Cultural Communication Nuances
8. Life skill: Community service-work with an NGO and make a presentation -
Roleplay
9. Ted-talks: Famous Personalities motivational speakers – sports celebrities
10. Soft skills - Mock Job/Placement Interviews/ Video Resume
Text Books:
1. Kumar.Sanjay & Pushplata, Communication Skills, 2nd Edition, OUP, 2015
2. Koneru, ArunaProfessional Speaking Skills, OUP, 2015.
Reference Books:
1. English vocabulary in use – Alan Mc’carthyandO’dell
2. APAART: Speak Well 1 (English language andcommunication)
3. APAART: Speak Well 2 (SoftSkills)
4. Business Communication – Dr.SarojHiremath
5. Mc‘carthy,Michael &O‘dell,Felicity, English Vocabulary in use,CUP,2010
6. SarojHiremath, Saroj, Business communication, NiraliPrakashan, 2018.
Web References:
1. Train your mind to perform under pressure- Simon
sinekhttps://curiosity.com/videos/simon-sinek-on-training-your-mind-to-
perform- under pressure-capture-your-flag/
2. Brilliant way one CEO rallied his team in the middle of layoffs
https://www.inc.com/video/simon-sinek-explains-why-you-should-put-people-
beforenumbers.html
3. Will Smith's Top Ten rules for success
https://www.youtube.com/watch?v=bBsT9omTeh0
Online Resources:
1. https://www.coursera.org/learn/learning-how-to-learn
2. https://www.coursera.org/specializations/effective-business-communication
SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY
(AUTONOMOUS)
II B.Tech. II Semester
(Common to CSE, CSD, CSM, CSC, CAI, CSO, IT, CSBS)
L T P C
1 0 2 2
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
Online Learning Resources:
1. https://nptel.ac.in/courses/110/106/110106124/
2. https://nptel.ac.in/courses/109/104/109104109/
3. https://swayam.gov.in/nd1_noc19_mg60/preview
SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY
(AUTONOMOUS)
II B.Tech. – II Semester
L T P C
2 0 0 0
UNIT I 9 Hours
QUANTITATIVE ABILITY III: Percentage [Percentage values from ½ to 1/30, Successive
increase / Decrease, Increased / Decreased percentage, How much % more / less,
Population Problems, Election Problems, Application type of problems] – Profit & Loss[
Cost Price, Selling Price, Retail Price , Marked Price / List Price / Printed price, Discounts,
Error problems, Application type of problems] –Simple Interest[Principle, Time period,
Rate of interest, Interest, Amount, Annual Payment, Application type of problems] -
Compound Interest[Principle, Time period, Rate of interest, Interest, Different formulae
of amount, Annual Payment, Differences between C.I & S.I for 1 year, 2years & 3years]
UNIT II 9 Hours
QUANTITATIVE ABILITY IV: Time and Work [One person is working, 2 persons are
working, 3 persons are working, Relation among Men, days, hours & Work, Alternate
days, Graphical method, Application type of problems] – Pipes & Cisterns[Inlet, Outlet
or leakage, Alternate hours, Application type of problems] – Time, Speed and
Distance[Relation among time, speed & distance, Relative Speed, Average Speed,
Problems on trains, Application type of problems] –Boats and Streams[Still water,
Stream, Current rate, Boat’s rate, Downstream, Upstream, Downstream Speed,
Upstream speed, Application type of problems] – Races & Circular Tracks [2 persons
are running around a circular track, 3 persons are running around a circular track]
UNIT III 9 Hours
REASONING ABILITY II: Alphabet - Coding & Decoding - Directions - Ranking Test –
Blood Relations - Inserting the missing number – Venn diagrams – Symbols and
Notations - Syllogism – Statement and Conclusion – Data Arrangement – Linear and
Circular arrangement
UNIT IV 9 Hours
VERBAL II: Tense – Present Tense, Past Tense, Future Tense - Voice – Active voice,
Passive voice and Active to Passive Voice Conversion Rules – Speech – Direct Speech,
Indirect Speech and Direct to Indirect Speech Conversion Rules –Essay Writing – Types,
Steps, Format.
UNIT V 9 Hours
SOFT SKILL II: Time Management - Stress Management - Team Work - Accent and Voice
Communication - Interview Skills.
TEXT BOOKS:
1. Quantitative Aptitude, Logic Reasoning & Verbal Reasoning, R S Agarwal,
S.Chand Publications.
2. Quantitative Aptitude for Competitive Examinations, R S Agarwal, S.Chand
Publications.