R21 B.

Tech Syllabus KGRCET Hyderabad

DISCRETE MATHEMATICS

Course Code: KG21CS301 L T P C

3 1 0 4
B.Tech. II Year I Semester

Prerequisites: An understanding of Mathematics in general is sufficient.

Course Objectives: The course will help students

1. To understand the fundamental knowledge on Mathematical Knowledge and Predicates.

2. To impart basics of relations and functions.

3. The effective usage of Recursions and Algorithms.

4. The effective use of combinatory principles for calculating probabilities and solving counting
problems.

5. To Learn the basic concepts of graph theory and some related theoretical problems

Course Outcomes: After successful completion of the course, students should be able to:

CO1: Make use of mathematical definitions and its notations for reformulating statements in formal logic
and validating normal forms.

CO2: Demonstrate operations on discrete mathematical structures like sets, functions, lattices for
representing the relations among them.

CO3: Apply addition rule and substitution rule for solving the problems of combinatory.

CO4: Develop solutions for recurrence relations and generating functions to obtain terms of equation.

CO5: Identify appropriate algorithms of graphs and trees for finding shortest path.

UNIT-I: MATHEMATICAL LOGIC AND PREDICATE CALCULUS (12 Hours)

Mathematical logic: Statements and notations, connectives, well-formed formulas, truth tables,
tautology, equivalence implication; Normal forms: Disjunctive normal forms, conjunctive normal forms,
principle disjunctive normal forms, principle conjunctive normal forms.

Predicate calculus: Predicative logic, statement functions, variables and quantifiers, free and bound
variables, rules of inference, consistency, proof of contradiction.
R21 B. Tech Syllabus KGRCET Hyderabad

UNIT-II: SETS, RELATIONS AND FUNCTIONS (12 Hours)

Relations: Sets, Properties, Properties of binary relations, equivalence, compatibility and partial ordering
relations, lattices, Hasse diagram.

Functions: Inverse function, composition of functions, recursive functions.

UNIT-III: RECURRENCE RELATION (12 Hours)

Recurrence relation: Generating functions, function of sequences calculating coefficient of generating

function, recurrence relations, solving recurrence relation by substitution and generating functions,
Characteristics roots solution of homogeneous recurrence relation

UNIT-IV: DISCRETE PROBABILITY AND ADVANCED COUNTING TECHNIQUES

(12
Hours)
Discrete Probability: An Introduction to Discrete Probability, Probability Theory, Bayes’ Theorem,
Expected Value and Variance.
Advanced Counting Techniques: Inclusion-Exclusion, Applications of Inclusion-Exclusion.

UNIT-V: GRAPHS AND TREES (12 Hours)

Graphs: Basic concepts of graphs, isomorphic graphs, Euler graphs, Hamiltonian graphs, planar graphs,
graph coloring, digraphs, directed acyclic graphs, weighted digraphs, region graph, chromatic numbers

Trees: Trees, spanning trees, minimal spanning trees.

TEXT BOOKS:

1. J.P. Tremblay and R. Manohar, “Discrete Mathematical Structures with Applications to Computer
Science”, Tata McGraw Hill, India, 1st Edition, 1997.

2. J.L. Mott, A. Kandel, T.P. Baker, “Discrete Mathematics for Computer Scientists &
Mathematician“, 2nd Edition, Pearson Education, PHI, 2010.

3. Kenneth H Rosen, “Discrete Mathematics and its Applications with Combinatorics and Graph
Theory”, 7th Edition, TMH.

REFERENCE BOOKS:

1. Richard Johnsonbaugh, “Discrete Mathematics”, 7th Edition, Pearson Education.

2. Ralph P. Grimaldi, B. V. Ramana, “Discrete and Combinatorial Mathematics - An Applied

Introduction”, Pearson Education, India, 5th Edition, 2011.

3. C. L. Liu, D. P. Mohapatra, “Elements of Discrete Mathematics”, 3 rd Edition, Tata Mcgraw Hill,

India, 2008.
R21 B. Tech Syllabus KGRCET Hyderabad

4. Edgar G. Goodaire, Michael M. Parmenter, “Discrete Mathematics with Graph Theory”, 2006,
Pearson Prentice Hall.

5. Grass Man & Trembley, “Logic and Discrete Mathematics”, Pearson Education.
R21 B. Tech Syllabus KGRCET Hyderabad

BUSINESS ECONOMICS AND FINANCIAL ANALYSIS

B. Tech. II Year I Semester (CSE, AI&ML, Data Science)

B. Tech. III Year I Semester (ECE, EEE & MCEH)
Course Code: KG21MB302 L T P C
3 0 0 3
B. Tech. II Year I Semester

Prerequisites: Kinds of Business, Sources of Finance

Course Objectives: The course will help students to

1. To explain various types of business and basic economic principles and concepts

2. To identify and analyze various determinants of demand and supply

3. Classify various market structures and determine the optimum price- output relationship

4. Explain the principles of Accounting and preparation of Final Accounts.

5. Explain the changes in financial position and operating positions through Financial Ratios

Course Outcomes: After completion of this course, the students will be able to

CO1: Identify the various types of business entities in the market.

CO2: Examine the Elasticity of Demand in decision making

CO3: Analyze the market structure for identifying the price- output relationship.

CO4: Apply the knowledge of accounting principle for Financial Analysis

CO5: Evaluate the financial performance of the organization through financial ratios.

UNIT – I: INTRODUCTION TO BUSINESS AND ECONOMICS (12

Hours)

Business: Structure of Business Firm, Theory of Firm, Types of Business Entities, Limited Liability
Companies, Sources of Capital for a Company, Non-Conventional Sources of Finance.

Economics: Significance of Economics, Micro and Macro Economic Concepts, Concepts and Importance of
National Income, Inflation, Money Supply and Inflation, Business Cycle, Features and Phases of Business
Cycle. Nature and Scope of Business Economics, Role of Business Economist, Multidisciplinary nature of
Business Economics.

UNIT - II: DEMAND AND SUPPLY ANALYSIS (12

Hours)
R21 B. Tech Syllabus KGRCET Hyderabad

Elasticity of Demand: Elasticity, Types of Elasticity, Law of Demand, Measurement and Significance of
Elasticity of Demand, Factors affecting Elasticity of Demand, Elasticity of Demand in decision making,

Demand Forecasting: Characteristics of Good Demand Forecasting, Steps in Demand Forecasting, Methods
of Demand Forecasting.

Supply Analysis: Determinants of Supply, Supply Function and Law of Supply.

UNIT- III: PRODUCTION, COST, MARKET STRUCTURES & PRICING (12

Hours)

Production Analysis: Factors of Production, Production Function, Production Function with one variable
input, two variable inputs, Returns to Scale, Different Types of Production Functions.

Cost analysis: Types of Costs, Short run and Long run Cost Functions.

Market Structures: Nature of Competition, Features of Perfect competition, Monopoly, Oligopoly,

Monopolistic Competition.

Pricing: Types of Pricing, Product Life Cycle based Pricing, Break Even Analysis, Cost Volume Profit
Analysis.

UNIT - IV: FINANCIAL ACCOUNTING (12

Hours)

Accounting concepts and Conventions, Accounting Equation, Double-Entry system of Accounting, Rules for
maintaining Books of Accounts, Journal, Posting to Ledger, Preparation of Trial Balance, Elements of
Financial Statements, Preparation of Final Accounts.

UNIT - V: FINANCIAL ANALYSIS THROUGH RATIOS (12 Hours)

Concept of Ratio Analysis, Importance, Liquidity Ratios, Turnover Ratios, Profitability Ratios, Proprietary
Ratios, Solvency, Leverage Ratios – Analysis and Interpretation (simple problems).

TEXT BOOKS:

1. D. Chaturvedi, S. L. Gupta, “Business Economics - Theory and Applications”, International Book

House Pvt. Ltd. 2013.

2. Dhanesh K Khatri, “Financial Accounting”, Tata Mc –Graw Hill, 2011.

REFERENCE BOOKS:

1. Geethika Ghosh, Piyali Gosh, Purba Roy Choudhury, “Managerial Economics”, 2e, Tata Mc Graw Hill
Education Pvt. Ltd. 2012.

2. Paresh Shah, “Financial Accounting for Management” 2e, Oxford Press, 2015.
R21 B. Tech Syllabus KGRCET Hyderabad

3. S. N. Maheshwari, Sunil K Maheshwari, Sharad K Maheshwari, “Financial Accounting”, 5e, Vikas

Publications, 2013.

COMPUTER ORGANIZATION AND ARCHITECTURE

Course Code: KG21CS303 L T P C

3 0 0 3

B. Tech. II Year I Semester

Prerequisites: A course on “Engineering Mathematics and Discrete Mathematics”.

Course Objectives: The course will help students

1. To learn the basic concepts of Architecture.

2. To gain knowledge on data representation and micro operations

3. To develop the computational algorithms using computer instructions.

4. To gain the knowledge on parallel processing.

5. To explore the various computer design architectures like Multi-computers and Multiprocessors.

Course Outcomes: Upon completion of this course, the students will be able to

CO1: Explore the basic concepts of digital design.

CO2: Design the circuits for various micro operations and processing.

CO3: Apply the computer instructions in developing the computer arithmetic algorithms

CO4: Deliberate the I/O and memory concepts.

CO5: Inspect the concepts of parallel processing and multiprocessors

Unit – 1: NUMBER SYSTEM, K – MAPS, AND COMBINATIONAL CIRCUITS (14 Hours)

Number System and K - maps: Number system and conversions, compliments, BCD addition, other
binary codes, Logic gates, Logic implementation, Sum-of- Products, Product-of-Sums, K-maps (2, 3, and
4 - variable), Error detection and correction.

Combinational Circuits: Adders, Multiplexers, Decoders, Encoders, BCD adder.

Unit – II: SEQUENTIAL CIRCUITS, RTL AND MICRO OPERATIONS (12 Hours)
R21 B. Tech Syllabus KGRCET Hyderabad

Sequential Circuits: Types of Flip flops, conversions, types of registers.

Digital Computers: Von-Neumann Vs Harvard architectures, Basic operational concepts, performance.

Register Transfer Language and Micro operations: Register Transfer language, Register Transfer, Bus
and memory transfers, Arithmetic Micro operations, logic micro operations, shift micro operations.

Unit – III: BASIC COMPUTER ORGANIZATION AND CENTRAL PROCESSING UNIT

(12 Hours)
Basic Computer Organization and Design: Instruction codes, Computer instructions, Timing and
Control, Instruction cycle, Input – Output and Interrupt.

Central Processing Unit: General Register Organization, Instruction Formats, Addressing modes, Data
Transfer and Manipulation, Program Control.

Unit – IV: COMPUTER ARITHMETIC AND I/O AND MEMORY ORGANIZATION

(12
Hours)
Computer Arithmetic: Addition and subtraction, multiplication Algorithms (Normal and Booths
multiplication), Division Algorithms, Floating – point Arithmetic operations.

I/O and Memory Organization: Asynchronous data transfer, Modes of Transfer, Direct memory
Access, cache memory and mapping techniques, virtual memory.

Unit – V: PIPELINE, VECTOR PROCESSING AND MULTIPROCESSORS

(10
Hours)
Pipeline and Vector Processing: RISC and CISC characteristics, Parallel Processing, Pipelining,
Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline, Vector Processing, Array Processor.

Multiprocessors: Multi-computers, Characteristics of Multiprocessors, Interconnection Structures, Inter-

processor arbitration, Cache Coherence.

TEXT BOOKS:

1. M. Moris Mano, “Computer System Architecture”, Pearson/PHI, India, 3rd Edition, 2006.

2. Carl Hamacher, Zvonks Vranesic, Safea Zaky, “Computer Organization”, McGraw Hill, New
Delhi, India, 5th Edition 2002.

3. Patterson, Hennessy, “Computer Organization and Design: The Hardware Software Interface”,
Morgan Kaufmann, 5th Edition, 2013.

REFERENCE BOOKS:

1. William Stallings, “Computer Organization and Architecture Designing for Performance”, Prentice
Hall, New Jersy, 8th Edition, 2010.
R21 B. Tech Syllabus KGRCET Hyderabad

2. Andrew S. Tanenbaum, “Structured Computer Organization”, Pearson Education Inc, NewJersy, 5 th

Edition, 2006.

3. Sivarama P. Dandamudi, “Fundamentals of Computer Organization and Design”, Springer Inc.

USA Edition,2003.

4. John P. Hayes, “Computer Architecture and Organization”, Tata McGraw Hill, New Delhi, India,
3rd Edition, 1998.

5. Carpinelli, “Computer Systems Organization & Architecture, 1e”, Pearson Education; 1 st Edition ,
2002.
R21 B. Tech Syllabus KGRCET Hyderabad

DATABASE MANAGEMENT SYSTEMS

Course Code: KG21CS304 L T P C

3 1 0 4
B. Tech. II Year I Semester

Prerequisites: A course on “Fundamentals of Programming”.

Course Objectives: The course will help students

1. To understand the basic concepts and the applications of database systems.

2. To master the basics of SQL and construct queries using SQL, PL/SQL and system
implementation Techniques.

3. To understand the relational database design principles and appropriate strategies for
optimization of queries.

4. To become familiar with the basic issues of transaction processing and concurrency control.

5. To become familiar with organization of Databases.

Course Outcomes: Upon completion of this course, the students will be able to:

CO1: Identify the fundamental concepts of Database Management System and create the conceptual data
model using ER Diagrams

CO2: Design Database using Normalization Techniques

CO3: Master the basics of SQL for retrieval and management of data.

CO4: Be acquainted with the basics of transaction processing and concurrency control.

CO5: Familiarity with database storage structures and access techniques

UNIT- I: INTRODUCTION TO DATABASE SYSTEMS AND DATABASE DESIGN (12 hours)

Database System Applications: A Historical Perspective, File Systems versus a DBMS, the Data Model,
Levels of Abstraction in a DBMS, Data Independence, Structure of a DBMS Introduction to Database
Design: Database Design and ER Diagrams, Entities, Attributes, and Entity Sets, Relationships and
Relationship Sets, Additional Features of the ER Model, Conceptual Design With the ER Model.
R21 B. Tech Syllabus KGRCET Hyderabad

UNIT-II: RELATIONAL MODEL AND RELATIONAL ALGEBRA (12 hours)

Introduction to the Relational Model: Integrity constraint over relations, enforcing integrity constraints,
querying relational data, logical database design, introduction to views, destroying/altering tables and
views. Relational Algebra, Tuple relational calculus, Domain relational calculus.

UNIT- III: SQL AND SCHEMA REFINEMENT (12 hours)

SQL language, constraints, triggers: form of basic SQL query, UNION, INTERSECT, and EXCEPT,
Nested Queries, aggregation operators, NULL values, complex integrity constraints in SQL, triggers and
active databases. Join Expressions.

Schema Refinement: Problems caused by redundancy, decompositions, problems related to

decomposition, reasoning about functional dependencies, FIRST, SECOND, THIRD normal forms,
BCNF, lossless join decomposition, multi-valued dependencies, FOURTH normal form, FIFTH normal
form

UNIT- IV: TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL (12 hours)

Transaction Concept, Transaction State, Implementation of Atomicity and Durability, Concurrent

Executions, Serializability, Recoverability, Implementation of Isolation, Testing for Serializability, Lock
Based Protocols, Timestamp Based Protocols, Validation- Based Protocols, Multiple Granularity,
Recovery and Atomicity, Log–Based Recovery, Recovery with Concurrent Transactions.

UNIT- V: STORAGE AND INDEXING (12 hours)

Data on External Storage, File Organization and Indexing, Cluster Indexes, Primary and Secondary
Indexes, Index data Structures, Hash Based Indexing, Tree base Indexing, Comparison of File
Organizations, Indexes and Performance Tuning, Intuitions for tree Indexes, Indexed Sequential Access
Methods (ISAM), B+ Trees: A Dynamic Index Structure.

TEXT BOOKS:

1. Raghu Ramakrishna, Johannes Gehrke, “Database Management Systems”, McGraw Hill, 3 rd Edition,
2014.

2. Abraham Silberschatz, Henry. F. Korth, S. Sudarshan, “Database System Concepts”, McGraw Hill,
7th Edition, 2019.

REFERENCE BOOKS:

1. Ivan Bayross, “SQL, PL/SQL: The Programming Language of Oracle”, BPB publications, 4 th
Edition, 2017.

2. Hector Garcia Molina, Jeffrey D. Ullman, Jennifer Widom, "Database System Implementation",
Pearson Education, United States, 1st Edition, 2000.
R21 B. Tech Syllabus KGRCET Hyderabad

3. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, 7 th Edition, Pearson,

2015.

4. Peter Rob, Corlos Coronel, "Database System, Design, Implementation and Management",
Thompson Learning Course Technology, 5th Edition, 2003.

5. Rajiv Chopra,”Database Management Systems (Dbms)”, S Chand Publishing; Fifth edition, 2016.

6. Connolly,”Database Systems: A Practical Approach to Design, Implementation and Management,”,

Pearson India; 4th edition,2008.
R21 B. Tech Syllabus KGRCET Hyderabad

DATA STRUCTURES

Course Code: KG21CS305 L T P C

3 1 0 4
B. Tech. II Year I-Semester

Prerequisites: A course on “Python Programming”.

Course Objectives: The course will help students to:

1. Study the basics of Linear and Non-linear Data structures.

2. Determine the working procedure of Stacks, Queues and Linked Lists.

3. Learn the working procedure of Trees and Graphs.

4. Gain knowledge on searching and sorting techniques.

5. Introduce Hashing and Pattern Matching Algorithms.

Course Outcomes: Upon completion of this course, the students will be able to

CO1: Analyze the linear data structures such as Linked Lists, Stacks and Queues for efficient data
organization and manipulation.

CO2: Select appropriate searching and sorting techniques for given problems.

CO3: Analyse the storage procedure of Non-Linear data structures.

CO4: Apply the Hash functions and collision resolution methods for efficient accessing of data with
respect to the performance.

CO5: Compare the pattern matching algorithms to identify the data.

UNIT – I: DATA STRUCTURES BASICS AND PYTHON SPECIFIC DATA STRUCTURES

Data structures basics: Collections, Linear and Non-linear data structures (12 Hours)

Linked list: Single linked list, double linked list and Circular linked list.

Python Specific data structures, Sorting elements using lambdas, 2D arrays, Matrix – accessing and
matrix operations.
R21 B. Tech Syllabus KGRCET Hyderabad

UNIT – II: LINEAR DATA STRUCTURES (12 Hours)

Stacks: Definition, stack operation using list and linked list

Queues: Definition, queue operation using list and linked list, Dequeue, priority queue and applications

UNIT – III: NONLINEAR DATA STRUCTURES (12 Hours)

Trees: Binary Search Trees, Definition, Implementation, Operations- Searching, Insertion and Deletion.
AVL Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and Searching. Tree
traversal.

Graphs: Types of graphs (directed, undirected, weighted, unweighted) and representations, Graph
Traversal Methods.

UNIT – IV: SEARCHING AND SORTING (12 Hours)

Searching Techniques: Linear and Binary search, Fibonacci search, interpolation search.

Sorting: Bubble sort, Insertion sort, Selection sort, Merge Sort, Quick sort, Heap Sort, stable and unstable
sorting, External sorting, and Internal sorting.

UNIT – V: HASHING AND PATTERN MATCHING (12 Hours)

Hashing: Hash functions, collision resolution-separate chaining, open addressing linear probing,
quadratic probing, double hashing, Rehashing, extendible hashing.

TEXT BOOKS:

1. Michael T. Goodrich, “Data Structures and Algorithms in Python”Wiley Edition, 2021

2. Dr Shriram K. Vasudevan, Mr Abhishek S. Nagarajan, “Data Structures using Python”, Oxford

Press, 1st Edition, 2021.

3. Rance D. Necaise, “Data Structures and Algorithms using Python”, Wiley StudentEdition, 2011.

REFERENCE BOOKS:

1. Samanta, “Classic Data Structures”, PHI Learning, 2nd Edition, 2004.

2. R. F. Gilberg and B.A. Forouzan, “Data Structures: A Pseudocode Approach with C”, Cengage
Learning, 2ndEdition, 2004.

3. Varsha H. Patil, “ Date Structurures Using C++”, Oxford Illustrated Edition, 2012.

4. S. Malik, “ Date Structurures Using C++”, Cengage, 2nd Edition, 2012.

5. S. Lipschutz, “Data Structures”, Tata McGraw Hill Education, 1st Edition, 2008.
R21 B. Tech Syllabus KGRCET Hyderabad

WEB REFERENCES:

1. https://www.tutorialspoint.com/data_structures_algorithms/algorithms_basics.html

2. https://www.codechef.com/certification/data-structures-and-algorithms/prepare

3. https://www.cs.auckland.ac.nz/software/AlgAnim/dsToC.html

4. https://online-learning.harvard.edu/course/data-structures-and-algorithms
R21 B. Tech Syllabus KGRCET Hyderabad

DATABASE MANAGEMENT SYSTEMS LAB

Course Code: KG21CS306 L T P C

0 0 2 1
B. Tech. II Year I-Semester

Prerequisites: A Course on “Programming Language”

Course Objectives: The course will help students to

1. Introduce E-R data model, database design and normalization

2. Learn SQL Basics for data definition and data manipulation.

3. Apply normalization techniques for refining of databases.

4. Design and implementation of a database for an organization.

5. Construct database models for different database applications.

Course Outcomes: Upon completion of this course, the students will be able to

CO1: Design database schema for a given application and apply normalization.

CO2: Acquire skills in using SQL Commands for data definition and data manipulation.

CO3: Develop and interpret PL/SQL blocks to centralize database applications for maintainability and
reusability using procedures, cursors, and triggers.

CO4: Investigate for data inconsistency.

CO5: Work independently and communicate effectively in oral and written forms.

LIST OF EXPERIMENTS:

1. Conceptual design with E-R Model.

2. Relational Model.

3. Practicing DDL commands.

4. Practicing DML commands.

R21 B. Tech Syllabus KGRCET Hyderabad

5. Normalization.

6. Querying (using ANY, ALL, IN, Exists, NOT EXISTS, UNION, INTERSECT, Constraints etc.).

7. Queries using Aggregate functions, GROUP BY, HAVING and Creation and dropping of Views.

8. Querying using JOINS Concepts.

9. Construct PL/SQL block for the following.

a. To determine whether a number is palindrome.

b. To determine whether a number is an Armstrong number.

c. To find greatest of three numbers.

d. To display Fibonacci series.

10. Triggers (Creation of insert trigger, delete trigger, update trigger).

11. Procedures.

12. Usage of Cursors.

TEXT BOOKS:

1. Raghurama Krishnan, Johannes Gehrke, “Database Management Systems, , Tata Mc Graw Hill, 3 rd
Edition

2. Silberschatz, Korth, “Database System Concepts”, McGraw Hill, V edition.

3. Peter Rob & Carlos Coronel, “Database Systems design, Implementation, and Management”, 7 th
Edition.

REFERENCES BOOKS:

1. Elmasri Navrate, “Fundamentals of Database Systems”, Pearson Education

2. C.J. Date, “Introduction to Database Systems”, Pearson Education

3. The X Team, S. Shah and V. Shah “Oracle for Professionals”, SPD.

4. Shah, “Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL”, PHI.

5. M. L. Gillenson, “Fundamentals of Database Management Systems”, Wiley Student Edition.

R21 B. Tech Syllabus KGRCET Hyderabad

DATA STRUCTURES LAB

Course Code: KG21CS307 L T P C

0 0 2 1
B. Tech. II Year I-Semester

Prerequisites: A Course on “Python Programming”.

Course Objectives: The course will help students

1. To impart the basic concepts of data structures and algorithms, searching and sorting techniques.

2. To gain the knowledge of about stacks, queues, lists, trees and graphs

3. To understand about writing algorithms and step by step approach in solving problems with the help
of fundamental data structures.

4. To strengthen the ability to the students to identify and apply the suitable data structure for the
given real world problem.

5. To enable them to gain knowledge in practical applications of data structures.

Course Outcomes: Upon completion of this course, the students will be able to

CO1: Implement linear data structures such as arrays, linked lists, stacks, queues for efficient data
organization and manipulation.

CO2: Develop solutions using data structures such as trees, graphs, heaps, hash tables for efficient search
and retrieval of data.

CO3: Select and apply appropriate techniques for searching trees and graph Problems.

CO4: Select and apply appropriate techniques for sorting problems.

CO5: Work independently and communicate effectively in oral and written forms.

LIST OF EXPERIMENTS:

1. A college has N number of students and the following details of all the students are maintained –
register number, name, branch, phone number. Write a program to store the details of the students
using a singly linked list. Develop functions to perform the following operations on the data.
R21 B. Tech Syllabus KGRCET Hyderabad

a. Insert new student’s details

b. Display the details of the students

c. Display the total number of students

d. Delete a given student’s information

2. A company has N number of employees and it maintains the following details of each of its
employees: ID, department, salary, phone number. Develop a menu driven program using doubly
linked list to store the employees’ data. Develop functions to perform the following operations on
the data.

a. Add and delete employees

b. Display total number of employees

c. Display details of employees with salary more than Rs. 50,000

d. Display the phone number of the employee given the ID

3. Write a program that uses functions to perform the following operations on circular linked list:

i) Creation ii) Insertion iii) Deletion iv) Traversal

4.Write a program that implement stack (its operations) using Arrays

5.Write a program that implement Queue (its operations) using Arrays

6. Write a program that implements the following sorting methods to sort a given list of integers in
ascending order

i) Bubble sort ii) Selection sort iii) Quick Sort

7. a) Write a program to sort a given set of integers using merge sort.

b) Write a program to read the marks obtained by students in a mathematics examination and store
the data using a heap data structure. Find out the maximum and minimum marks obtained by the
students.

8. Write a program that use both recursive and non-recursive functions to perform the following
searching operations for a Key value in a given list of integers:

i) Linear search ii) Binary search

9. Write a program to implement the tree traversal methods.

R21 B. Tech Syllabus KGRCET Hyderabad

10. There are train paths between cities. If there is a train between city A and city B then there is a
route between the cities. The cost of the route is the distance between city A and city B. Represent
the train travel route information as a graph. The node can be represented by the name of the city.
Write a program to perform the following operations.

a. Traverse the graph and display the details of all trains between the cities along with the cost
using breadth-first method.

b. Traverse the graph and display the details of all

ADDITIONAL EXPERIMENTS:

1. a) Write a Program to Sort the set of elements: (i.e., numbers or strings)

i). Quick Sort ii). Heap Sort. iii). Merge Sort

b) Write a Program to Sort the set of elements by using External sorting algorithms

i). Shell Sort ii). Linear Sort. iii). Binary Sort iv) Fibonacci sort

2. Write C programs for implementing the following graph traversal algorithms:

a)Depth first traversal b)Breadth first traversal.

3. Write a Program to implement all functions of a Dictionary by using Hashing.

4. Write a program to Implement Insertion and Deletion Operations on AVL Trees.

5. Write a Program to Implement Insertion, Deletion and Search Operations on SPLAY Trees.

Note: Use Classes and Objects to implement the above programs.

TEXT BOOKS:

1. Data structures and algorithms in python by Michael T. Goodrich.

2. Data Structures and Algorithmic Thinking with Python by NarasimhaKarumanchi.

REFERENCE BOOKS:

1. Hands-On Data Structures and Algorithms with Python: Write complex and powerful code using
the latest features of Python 3.7, 2nd Edition by Dr. Basant Agarwal, Benjamin Baka.

2. Data Structures and Algorithms with Python by Kent D. Lee and Steve Hubbard.

3. Problem Solving with Algorithms and Data Structures Using Python by Bradley N Miller and
David L. Ranum.
R21 B. Tech Syllabus KGRCET Hyderabad

4. Core Python Programming -Second Edition, R. Nageswara Rao, Dreamtech Press.

IT WORKSHOP LAB

Course Code: KG21CS308 L T P C

0 0 2 1
B. Tech. II Year I-Semester

Prerequisites: No Prerequisites.

Course Objectives: The course will help students

1. To understand basic computer peripherals and assembling of PC.

2. To understand the installation of system software like windows, Linux, required additional
software.

3. Master the usage of internet usage web browsers, email, news groups and discussion forums, cyber
hygiene.

4. To understand the development of web pages. Adding some features to that web pages

5. To understand the usage o product tools like word documents, excel spreadsheets, Power point
using LaTeX.

Course Outcomes: Upon completion of this course, the students will be able to

CO1: Student able to Perform Assembling and Disassembling of System Components.

CO2: Student able to install to Software’s Like Linux Windows Anti-Virus.

CO3: Student able to Efficient Usage of Web Content on Different Search Engines.

CO4: Student able to develop the Interactive Web Pages with HTML Tags and embedded with Audio
Video, Images in Web Page.

CO5: Student able to Master the Usage of Excel, Word, Spreadsheet, Power Point, Other Productivity
Tools Using LaTeX..

LIST OF EXPERIMENTS:

PC HARDWARE:
R21 B. Tech Syllabus KGRCET Hyderabad

Task 1: Identify the peripherals of a computer, components in a CPU and its functions. Draw the block
diagram of the CPU along with the configuration of each peripheral and submit to your
instructor.

Task 2: Every student should disassemble and assemble the PC back to working condition. Lab
instructors should verify the work and follow it up with a Viva. Also students need to go through
the video which shows the process of assembling a PC. A video would be given as part of the
course content.

Task 3: Every student should individually install MS windows on the personal computer. Lab instructor
should verify the installation and follow it up with a Viva.

Task 4: Every student should install Linux on the computer. This computer should have windows
installed. The system should be configured as dual boot with both windows and Linux. Lab
instructors should verify the installation and follow it up with a Viva

Task 5: Hardware Troubleshooting: Students have to be given a PC which does not boot due to
improper assembly or defective peripherals. They should identify the problem and fix it to get
the computer back to working condition. The work done should be verified by the instructor and
followed up with a Viva.

Task 6: Software Troubleshooting: Students have to be given a malfunctioning CPU due to system
software problems. They should identify the problem and fix it to get the computer back to
working condition. The work done should be verified by the instructor and followed up with a
Viva.

Task 7: Antivirus: Students should download freely available Antivirus software, install it and use
it to check for threats to the computer being used. Students should submit information
about the features of the antivirus used, installation process, about virus definitions, virus
engine etc.

INTERNET & WORLD WIDE WEB:

Task 1: Orientation & Connectivity Boot Camp: Students should get connected to their Local Area
Network and access the Internet. In the process they configure the TCP/IP setting. Finally,
student should demonstrate, to the instructor, how to access the websites and email. If there is
no internet connectivity preparations need to be made by the instructors to simulate the WWW
on the LAN.

Task 2: Web Browsers, Surfing the Web: Students customize their web browsers with the LAN proxy
settings, bookmarks, search toolbars and pop-up blockers. Also, plug-ins like Macromedia Flash
and JRE for applets should be configured.

Task 3: Search Engines & Netiquette: Students should know what search engines are and how to use
the search engines. A few topics would be given to the students for which they need to search on
Google. This should be demonstrated to the instructors by the student.
R21 B. Tech Syllabus KGRCET Hyderabad

Task 4: Cyber Hygiene: Students would be exposed to the various threats on the internet and would be
asked to configure their computer to be safe on the internet. They need to first install antivirus
software, configure their personal firewall and windows update on their computer. Then they
need to customize their browsers to block pop ups, block active x downloads to avoid viruses
and/or worms.

Task 5: Create an interactive web page using html and incorporate image, audio, video into web page.

LaTeX and WORD:

Task 1: Word Orientation:ThementorneedstogiveanoverviewofLaTeXandMicrosoft(MS)office 2007/

equivalent (FOSS) tool word: Importance of LaTeX and MS office 2007/ equivalent (FOSS) tool
Word as word Processors, Details of the four tasks and features that would be covered in each,
Using LaTeX and word – Accessing, overview of toolbars, saving files, Using help and
resources, rulers, format painter in word.

Task 2: Using LaTeX and Word to create project certificate. Features to be covered: - Formatting Fonts
in word, Drop Cap in word, Applying Text effects, Using Character Spacing, Borders and
Colors, Inserting Header and Footer, Using Date and Time option in both LaTeX and Word.

Task 3: Creating project abstract Features to be covered: -Formatting Styles, inserting table, Bullets and
Numbering, Changing Text Direction, Cell alignment, Footnote, Hyperlink, Symbols, Spell
Check, Track Changes.

Task 4: Creating a Newsletter: Features to be covered: - Table of Content, Newspaper columns, Images
from files and clipart, Drawing tool brand Word Art, Formatting Images, Text boxes, Paragraphs
and Mail Merge in word.

EXCEL:

Excel Orientation: The mentor needs to tell the importance of MS office 2007 / equivalent (FOSS) tool
Excel as a Spreadsheet tool, give the details of the four tasks and features that would be covered in each.
Using Excel – Accessing, overview of toolbars, saving excel files, Using help and resources.

Task 1: Creating a Scheduler – Features to be covered: Gridlines, Format Cells, Summation, auto fill,
Formatting Text

Task 2: Calculating GPA -Features to be covered: - Cell Referencing, Formulae in excel – average, std.
deviation, Charts, Renaming and Inserting worksheets, Hyper linking, Count function, LOOKUP
/ VLOOKUP.

Task 3: Performance Analysis - Features to be covered: - Split cells, freeze panes, group and outline,
Sorting, Boolean and logical operators, Conditional formatting.

LaTeX and MS / equivalent (FOSS) tool Power Point:

R21 B. Tech Syllabus KGRCET Hyderabad

Task 1: Students will be working on basic power point utilities and tools which help them create basic
power point presentation. Topic covered during this week includes: - PPT Orientation, Slide
Layouts, Inserting Text, Word Art, Formatting Text, Bullets and Numbering, Auto Shapes,
Lines and Arrows in both LaTeX and Power Point. Students will be given model power point
presentation which needs to be replicated (exactly how it’s asked).

Task 2: week helps students in making their presentations interactive. Topic covered during this week
includes: Hyperlinks, Inserting –Images, Clip Art, Audio, Video, Objects, Tables and Charts.

Task 3: Concentrating on the in and out of Microsoft power point and presentations in LaTeX. Helps
them learn best practices in designing and preparing power point presentation. Topic covered
during this week includes: - Master Layouts (slide, template, and notes), Types of views (basic,
presentation, slide slotter, notes etc), and Inserting – Background, textures, Design Templates,
Hidden slides.

REFERENCE BOOKS:

1. Vikas Gupta, “Comdex Information Technology course tool kit”, WILEY Dreamtech.

2. Cheryl A Schmidt, “The Complete Computer upgrade and repair book”, WILEY Dreamtech, 3rd
Edition.

3. Introduction to Information Technology, ITL Education Solutions limited, Pearson Education.

4. Kate J. Chase, “PC Hardware - A Handbook”, PHI (Microsoft).

5. Leslie Lamport, “LaTeX Companion”, PHI / Pearson.

6. David Anfinson and Ken Quamme, “IT Essentials PC Hardware and Software Companion Guide”,
CISCO Press, Pearson Education, 3rd Edition.

7. Patrick Regan, “IT Essentials PC Hardware and Software Companion Guide”, CISCO Press,
Pearson Education, 3rd Edition.
R21 B. Tech Syllabus KGRCET Hyderabad