Telangana Social Welfare Residential Degree College for

Women Nirmal

Department of Computer Science

Handbook
BSc Computer Science

2019-2020
 KAKATIYA UNIVERSITY, WARANGAL - 506 009
B.Sc. PROGRAMME
Under CBCS System
Scheme wef A.Y: 2019-20

FIRST YEAR
SEMESTER - I
Max. Marks
Course No. of Hrs Total
Code Title of the Paper Interna End
category Credits PW Lab Marks
l Exam Exam

BS101 AECC-1 Environmental Science 2 2 10 40 - 50

BS102 FL-1A English 4 4 20 80 - 100
BS103 SL-1A Second Language 4 4 20 80 - 100
Optional - I 4 4
BS104 DSC-1A 20 80 25 125
Optional – I Lab 1 3
Optional– II 4 4
BS105 DSC-2A 20 80 25 125
Optional – II LAB 1 3
DSC-3A Optional – III 4 4 25 125
BS106 20 80
Optional – III LAB 1 3
TOTAL: 25 - 110 440 75 625

SEMESTER – II
Max. Marks
Course No. of Hrs Total
Code Title of the Paper Interna End
category Credits PW Lab Marks
l Exam Exam
Basic Computer Skills
BS201 AECC-2 2 2 10 40 - 50
(Taught by: Computer Science)
BS202 FL-2B English 4 4 20 80 - 100
BS203 SL-2B Second Language 4 4 20 80 - 100
Optional - I 4 4
BS204 DSC-1B 20 80 25 125
Optional – I Lab 1 3
Optional – II 4 4
BS205 DSC-2B 20 80 25 125
Optional – II Lab 1 3
DSC-3B Optional – III 4 4 25 125
BS206 20 80
Optional – III LAB 1 3
TOTAL : 25 - 110 440 75 625
 KAKATIYA UNIVERSITY, WARANGAL - 506 009
B.Sc. PROGRAMME
Under CBCS System
Scheme wef A.Y: 2020-21

SECOND YEAR
SEMESTER - III
Max. Marks
Course No. of Hrs Total
Code Title of the Paper Interna End
category Credits PW Lab Marks
l Exam Exam
Fundamentals of
BS 301 SEC-1 Nano Technology 2 2 10 40 - 50
(Taught by : Physics)
Bio Statistics
BS 302 SEC-2 2 2 10 40 - 50
(Taught by : Statistics)
BS 303 FL-3 A English 3 3 15 60 - 75
BS 304 SL-3 B Second Language 3 3 15 60 - 75
Optional - I 4 4
BS 305 DSC-1C 20 80 25 125
Optional – I Lab 1 3
Optional – II 4 4
BS 306 DSC-2C 20 80 25 125
Optional– II Lab 1 3
DSC-3C Optional – III 4 4
BS 307 20 80 25 125
Optional – III Lab 1 3
TOTAL: 25 - 110 440 75 625

SEMESTER - IV
Max. Marks
Course No. of Hrs Total
Code Title of the Paper Interna End
category Credits PW Lab Marks
l Exam Exam
Fundamentals of Python
BS401 SEC-3 2 2 10 40 - 50
(Taught by: Computer Science)
Remedial Methods of Pollution –
BS402 SEC-4 Drinking Water & Soil Fertility 2 2 10 40 - 50
(Taught by: Chemistry)
BS403 FL-4 A English 3 3 15 60 - 75
BS404 SL-4 B Second Language 3 3 15 60 - 75
Optional - I 4 4
BS405 DSC-1D 20 80 25 125
Optional – I Lab 1 3
Optional – II 4 4
BS406 DSC-2D 20 80 25 125
Optional – II Lab 1 3
DSC-3D Optional – III 4 4
BS407 20 80 25 125
Optional– III Lab 1 3
TOTAL : 25 - 110 440 75 625
 KAKATIYA UNIVERSITY, WARANGAL - 506 009
B.Sc. PROGRAMME
Under CBCS System
Scheme wef A.Y: 2021-2022

THIRD YEAR
SEMESTER - V
Max. Marks
Course No. of Hrs Interna Total
Code Title of the Paper End
Type Credits PW l Lab Marks
Exam
Exam
BS 501 FL-5 A English 3 3 15 60 - 75

BS 502 SL-5 B Second Language 3 3 15 60 - 75

Water Resources Management
BS 503 G.E. 4 4 20 80 - 100
(Taught by: Any Science Dept.)
Optional – I 4 4
BS 504 DSE-1E 20 80 25 125
Optional – I Lab 1 3
Optional – II 4 4
BS 505 DSE-2E 20 80 25 125
Optional – II Lab 1 3
Optional – III 4 4
BS506 DSE-3E 20 80 25 125
Optional – III Lab 1 3
TOTAL: 25 - 110 440 75 625

SEMESTER - VI
Max. Marks
Course No. of Hrs Total
Code Title of the Paper Internal End
Type Credits PW
Exam Exam
Lab Marks

BS 601 FL-6A English 3 3 15 60 - 75

BS 602 SL-6 B Second Language 3 3 15 60 - 75

Optional: Public Health & Hygiene
BS 603
P.W / (Taught by: Zoology / Botany / 4 4 20 80 - 100
Optional
Biotechnology / Micro Biology )
Optional - I 4 4 20 80 25
BS 604 DSE-1F 125
Optional – I Lab 1 3
Optional – II 4 4 20 80 25
BS 605 DSE-2F 125
Optional – II Lab 1 3
Optional – III 4 4 20 80 25
BS 606 DSE-3F 125
Optional – III Lab 1 3
TOTAL: 25 - 110 440 75 625
 Credits
NSS/NCC/Sp under
orts/Extra Non – Up to 6 (2 in each Year) Up to 6 (2 in each Year) Up to 6 (2 in each Year)
Curricular CGPA

Summer Up to 4 ( 2 in each, after I & II Up to 4 ( 2 in each, after I & Up to 4 ( 2 in each, after I & II
4
internship years II years years

F.L : First Language;

S.L : Second Language;
A.E.C.C : Ability Enhancement Compulsory Course;
S.E.C : Skill Enhancement Course;
D.S.C : Discipline Specific Course;
D.S.E : Discipline Specific Effective;
G.E : Generic Elective;
P.W : Project Work;
 KAKATIYA UNIVERSITY
Under Graduate Courses (Under CBCS 2020–2021onwords)
B.Sc. Computer Science II Year
SEMESTER – III

DATA STRUCTURES USING C++

Theory: 4 Hours/Week; Credits: 4 Marks: 100 (Internal: 20; External: 80)
Practical: 3 Hours/Week Credits: 1 Marks: 25
Unit - I
Basic data Structure: Introduction to Data Structures, Types of Data Structures, and Introduction to
Algorithms, Pseudo code, and Relationship among data, data structures, and algorithms,
Implementation of data structures, Analysis of Algorithms.
Stacks: Concept of Stacks and Queues, Stacks, Stack Abstract Data Type, Representation of Stacks Using
Sequential Organization (Arrays), Multiple Stacks, Applications of Stack, Expression Evaluation and
Conversion, Polish notation and expression conversion, Processing of Function Calls, Reversing a String
with a Stack, Recursion.
Unit - II
Recursion: Introduction, Recurrence, Use of Stack in Recursion, Variants of Recursion, Recursive
Functions, Iteration versus Recursion.
Queues: Concept of Queues, Queue as Abstract Data Type, Realization of Queues Using Arrays, Circular
Queue, Multi-queues, Dequeue, Priority Queue, Applications of Queues,
Linked Lists: Introduction, Linked List, Linked List Abstract Data Type, Linked List Variants, Doubly
Linked List, Circular Linked List, Representation of Sparse Matrix Using Linked List, Linked Stack,
Linked Queue.
Unit - III
Trees: Introduction, Types of Trees, Binary Tree, Binary Tree Abstract Data Type, Realization of a Binary
Tree, Insertion of a Node in Binary Tree, Binary Tree Traversal, Other Tree Operations, Binary Search
Tree, Threaded Binary Tree, Applications of Binary Trees.
Searching and Sorting: Search Techniques-Linear Search, Binary Search, Sorting Techniques- Selection
Sort, Bubble Sort, Insertion Sort, Merge Sort, Quick Sort, Comparison of All Sorting Methods, Search
Trees: Symbol Table, Optimal Binary Search Tree, AVL Tree (Height-balanced Tree).
Unit - IV
Graphs: Introduction, Representation of Graphs, Graph Traversal – Depth First Search, Breadth First
Search, Spanning Tree, Prim’s Algorithm, Kruskal’s Algorithm.
Hashing: Introduction, Key Terms and Issues, Hash Functions, Collision Resolution Strategies, Hash
Table Overflow, Extendible Hashing
Heaps: Basic Concepts, Implementation of Heap, Heap as Abstract Data Type, Heap Sort, Heap
Applications.
Text books:
1. Varsha H. Patil “Data structures using C++” Oxford University press, 2012
2. M.T. Goodrich, R. Tamassia and D. Mount, Data Structures and Algorithms in C++, John Wiley and
Sons, Inc., 2011.
References:
1. Adam Drozdek “Data structures and algorithm in C++” Second edition, 2001
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms,2nd Ed., Prentice-Hall of
India, 2006.
3. Robert L. Kruse and A.J. Ryba, Data Structures and Program Design in C++, PrenticeHall, Inc., NJ, 1998.
4. B. Stroupstrup, The C++ Programming Language, Addison Wesley, 2004
5. D.E. Knuth, Fundamental Algorithms (Vol. I), Addison Wesley, 1997

Dr. B.Rama Chairperson Board of Studies, Department of Computer Science, KU

 KAKATIYA UNIVERSITY
Under Graduate Courses (Under CBCS 2020–2021 onwards)
B.Sc. Computer Science II Year
SEMESTER – III

DATA STRUCTURES USING C++ LAB

Practical 3 Hours/Week 1 Credit Marks: 25
Note:
• Programs of all the Concepts from Text Book including exercises must be practice and execute.
• In the external lab examination student has to execute two programs with compilation and deployment steps
are necessary.
• External Vice-Voce is compulsory.
1. Write C++ programs to implement the following using an array
a) Stack ADT b) Queue ADT
2. Write a C++ program to implement Circular queue using array.
3. Write C++ programs to implement the following using a single linked list.
a) Stack ADT b) Queue ADT
4. Write a C++ program to implement Circular queue using Single linked list.
5. Write a C++ program to implement the double ended queue ADT using double linked list.
6. Write a C++ program to solve tower of Hanoi problem recursively
7. Write C++ program to perform the following operations:
a) Insert an element into a binary search tree.
b) Delete an element from binary search tree.
c) Search for a key in a binary search tree.
8. Write C++ programs for the implementation tree traversal technique BFS.
9. Write a C++ program that uses recursive functions to traverse a binary search tree.
a) Pre-order b) In-order c) Post-order
10. Write a C++ program to find height of a tree.
11 Write a C++ program to find MIN and MAX element of a BST.
12 Write a C++ program to find Inorder Successor of a given node.
13. Write C++ programs to perform the following operations on B-Trees and AVL Trees.
a) Insertion b) Deletion
14 Write C++ programs for sorting a given list of elements in ascending order using the following sorting
methods.
a) Quick sort b) Merge sort
15. Write a C++ program to find optimal ordering of matrix multiplication.
16. Write a C++ program that uses dynamic programming algorithm to solve the optimal binary search tree
problem
17. Write a C++ program to implement Hash Table
18. Write C++ programs to perform the following on Heap
a) Build Heap b) Insertion c) Deletion
19. Write C++ programs to perform following operations on Skip List
a) Insertion b) Deletion
20. Write a C++ Program to Create a Graph using Adjacency Matrix Representation.
21. Write a C++ program to implement graph traversal techniques
a) BFS b) DFS
22. Write a C++ program to Heap sort using tree structure.

Dr. B.Rama Chairperson Board of Studies, Department of Computer Science, KU

 KAKATIYA UNIVERSITY - WARANGAL - TELANGANA
B.Sc. Programme under CBCS
With effect from the A.Y: 2019
Skill Enhancement Course- III
II Year
(Common to all Science Courses)
SEMESTER – IV

Fundamentals of Python
Theory: 2 Hours/Week; Credits: 2 Marks: 50 (Internal: 10; External: 40)

Unit – I
Introduction to Python Programming: How a Program Works, Using Python, Program Development
Cycle, Input, Processing, and Output, Displaying Output with the Print Function, Comments,
Variables, Reading Input from the Keyboard, Performing Calculations (Operators. Type conversions,
Expressions), More about Data Output. Decision Structures and Boolean Logic: if, if-else, if-elif-else
Statements, Nested Decision Structures, Comparing Strings, Logical Operators, Boolean Variables.
Repetition Structures: Introduction, while loop, for loop, Calculating a Running Total, Input Validation
Loops, Nested Loops.Lists and Tuples: Sequences, Introduction to Lists, List slicing, Finding Items in
Lists with the in Operator, List Methods and Useful Built-in Functions, Copying Lists, Processing
Lists,

Unit – II
Tuples- operations on tuples, Strings: Basic String Operations, String Slicing, Testing, Searching, and
Manipulating Strings. Dictionaries and Sets: Dictionaries, Sets- operations on sets and Dictionaries.
Functions: Introduction, Defining and Calling a Void Function, Designing a Program to Use Functions,
Local Variables, Passing Arguments to Functions, Global Variables and Global Constants, Value-
Returning Functions- Generating Random Numbers, Writing Our Own Value-Returning Functions,
The math Module, Storing Functions in Modules. File and Exceptions: Introduction to File Input and
Output, Using Loops to Process Files, Processing Records, Exceptions.

Text Book:
Tony Gaddis, Starting Out With Python (3e)

References:
1. Kenneth A. Lambert, Fundamentals of Python
2. Clinton W. Brownley, Foundations for Analytics with Python
3. James Payne, Beginning Python using Python 2.6 and Python 3
4. Charles Dierach, Introduction to Computer Science using Python
5. Paul Gries, Practical Programming: An Introduction to Computer Science using Python 3
 KAKATIYA UNIVERSITY
Under Graduate Courses (Under CBCS 2020 – 2021 onwards)
B.Sc. Computer Science II Year
SEMESTER – IV

DATA BASE MANAGEMENT SYSTEMS

Theory: 4 Hours/Week; Credits: 4 Marks: 100 (Internal: 20; External: 80)
Practical: 3 Hours/Week Credits: 1 Marks: 25
Unit - I
Introduction: Database-System Applications, Purpose of Database Systems, View of Data, Database
Languages, Relational Databases, Database Design, Data Storage and Querying, Transaction
Management, Database Architecture, Database Users and Administrators.
Introduction to the Relational Model: Structure of Relational Databases, Database
Schema, Keys, Schema Diagrams, Relational Query Languages, Relational Operations.

Unit - II
Database Design and the E-R Model: Overview of the Design Process, The Entity- Relationship
Model, Constraints, Removing Redundant Attributes in Entity Sets, Entity-Relationship Diagrams,
Reduction to Relational Schemas, Entity-Relationship Design Issues, Extended E-R Features,
Alternative Notations for Modeling Data, Other Aspects of Database Design.
Relational Database Design: Features of Good Relational Designs, Atomic Domains and First Normal
Form, Decomposition Using Functional Dependencies, Functional- Dependency Theory,
Decomposition Using Multivalued Dependencies, Normal Forms-2 NF, 3 NF, BCNF, The Database
Design Methodology for Relational Databases.

Unit - III
Introduction to SQL: Overview of the SQL Query Language, SQL Data Definition, Basic Structure of
SQL Queries, Additional Basic Operations, Set Operations, Null Values, Aggregate Functions, Nested
Subqueries, Modification of the Database.
Intermediate SQL: Join Expressions, Views, Transactions, Integrity Constraints, SQL Data Types and
Schemas, Authorization.
Advanced SQL: Accessing SQL from a Programming Language, Functions and Procedures, Triggers,
Recursive Queries.

Unit - IV
Transaction Management: Transaction Support–Properties of Transactions, Database Architecture,
Concurrency Control–The Need for Concurrency Control, Serializability and Recoverability, Locking
Methods, Deadlock, Time Stamping Methods, Multi-version Timestamp Ordering, Optimistic
Techniques, Granularity of Data Items, Database Recovery–The Need for Recovery, Transactions and
Recovery, Recovery Facilities, Recovery Techniques, Nested Transaction Model. Security: Database
Security–Threats, Computer-Based Controls–Authorization, Access Controls, Views, Backup and
Recovery, Integrity, Encryption, RAID.

Text book:
1. Silberschatz, H. Korth and S. Sudarshan, Database System Concepts, 6th Ed., Tata McGraw
Hill, 2011
2. Thomas M. Connolly, Carolyn E. Begg, Database Systems–A Practical Approach to Design,
Implementation, and Management (6e)

Dr. B.Rama Chairperson Board of Studies, Department of Computer Science, KU

 KAKATIYA UNIVERSITY
Under Graduate Courses (Under CBCS 2020 – 2021onwords)
B.Sc. Computer Science II Year
SEMESTER – IV

DATA BASE MANAGEMENT SYSTEMS - LAB

Practical 3 Hours/Week 1 Credit Marks: 25

Note:
• Programs of all the Concepts from Text Book including exercises must be practice and execute.
• In the external lab examination student has to execute two programs with compilation and deployment
steps are necessary.
• External Vice-Voce is compulsory.

1. Create a database having two tables with the specified fields, to computerize a library
system of a University College.
LibraryBooks (Accession number, Title, Author, Department, PurchaseDate, Price),
IssuedBooks (Accession number, Borrower)

a) Identify primary and foreign keys. Create the tables and insert at least
5 records in each table.
b) Delete the record of book titled “Database System Concepts”.
c) Change the Department of the book titled “Discrete Maths” to “CS”.
d) List all books that belong to “CS” department.
e) List all books that belong to “CS” department and are written by author
“Navathe”.
f) List all computer (Department=”CS”) that have been issued.
g) List all books which have a price less than 500 or purchased between
“01/01/1999” and “01/01/2004”.

2. Create a database having three tables to store the details of students of Computer
Department in your college.
Personal information about Student (College roll number, Name of student, Date of birth,
Address, Marks(rounded off to whole number) in percentage at 10 + 2, Phone number)
Paper Details (Paper code, Name of the Paper)
Student’s Academic and Attendance details (College roll number, Paper
Code, Attendance, Marks in home examination).

a) Identify primary and foreign keys. Create the tables and insert at least 5 records in
each table.
b) Design a query that will return the records (from the second table) along with the
name of student from the first table, related to students who have more than 75%
attendance and more than 60% marks in paper2.
c) List all students who live in “Warangal” and have marks greater than 60 in paper1.
d) Find the total attendance and total marks obtained by each student.
e) List the name of student who has got the highest marks in paper2.

Dr. B.Rama Chairperson Board of Studies, Department of Computer Science, KU

3. Create the following tables and answer the queries given below:
Customer (CustID, email, Name, Phone, ReferrerID)
Bicycle (BicycleID, DatePurchased, Color, CustID, ModelNo)
BicycleModel(ModelNo, Manufacturer, Style) Service
(StartDate, BicycleID, EndDate)

a) Identify primary and foreign keys. Create the tables and insert at least 5 records
in each table.
b) List all the customers who have the bicycles manufactured by manufacturer
“Honda”.
c) List the bicycles purchased by the customers who have been referred by
Customer “C1”.
d) List the manufacturer of red colored bicycles.
e) List the models of the bicycles given for service.

4. Create the following tables, enter at least 5 records in each table and answer the queries given
below.
Employee (Person_Name, Street, City )
Works (Person_Name, Company_Name, Salary)
Company (Company_Name, City )
Manages (Person_Name, Manager_Name )

a) Identify primary and foreign keys.

b) Alter table employee, add a column “email” of type varchar(20).
c) Find the name of all managers who work for both Samba Bank and NCB Bank.
d) Find the names, street address and cities of residence and salary of all
employees who work for “Samba Bank” and earn more than $10,000.
e) Find the names of all employees who live in the same city as the company
for which they work.
f) Find the highest salary, lowest salary and average salary paid by each
company.
g) Find the sum of salary and number of employees in each company.
h) Find the name of the company that pays highest salary.

5. Create the following tables, enter at least 5 records in each table and answer the queries given
below.
Suppliers (SNo, Sname, Status, SCity)
Parts (PNo, Pname, Colour, Weight, City)
Project (JNo, Jname,Jcity)
Shipment (Sno, Pno, Jno, Qunatity)

a) Identify primary and foreign keys.

b) Get supplier numbers for suppliers in Paris with status>20.
c) Get suppliers details for suppliers who supply part P2. Display the supplier list in
increasing order of supplier numbers.
d) Get suppliers names for suppliers who do not supply part P2.
e) For each shipment get full shipment details, including total shipment weights.
f) Get all the shipments where the quantity is in the range 300 to 750 inclusive.
g) Get part nos. for parts that either weigh more than 16 pounds or are supplied by suppliers
S2, or both.
h) Get the names of cities that store more than five red parts.
i) Get full details of parts supplied by a supplier in Hyderabad.

Dr. B.Rama Chairperson Board of Studies, Department of Computer Science, KU

 j) Get part numbers for part supplied by a supplier in Warangal to a project in
Chennai.
k) Get the total number of project supplied by a supplier (say, S1).
l) Get the total quantity of a part (say, P1) supplied by a supplier (say, S1).

6. Write a PL/SQL Program to demonstrate Procedure.

7. Write a PL/SQL Program to demonstrate Function.
8. Write a PL/SQL program to Handle Exceptions.
9. Write a PL/SQL Program to perform a set of DML Operations.
10. Create a View using PL/SQL program.
11. Write a PL/SQL Program on Statement Level Trigger.
12. Write a PL/SQL Program on Row Level Trigger.

Dr. B.Rama Chairperson Board of Studies, Department of Computer Science, KU