CBCS

Board of Studies,OU Nominee

 @fiffi
Bhavan's Vivekananda College
of Science, Humanities and Commerce, Sainikpuri
Autonomous College lAffiliated to Osmania University
(Accredited with "A" grade by NAAC)
Autonomous College - Affiliated to Osmania University
Model Template for B.Sc. Computer Science under CBCS
Prescribed by TSCHE for implementation from 2023-24 onwards-Teotative
PHYSICAL SCIENCES
SEMESTER I 023-2021
COURSE COURSE HOURS/WEEK CREDITS
COURSE TITLE Total
CODE TYPE Theory Practical Total Theo Practical

CSI25 Programming in C DSC-3A 4 2 6 4 5

SEMESTER 023-202
COURSE COURSE HOURS/WEf,K CREDITS
COURSE TITLE Theory Practical Total
CODE TYPE Theory Practical Total

CS225 Programming in C+ DSC.3B .1 1 6 4 I 5

SEMESTER 3 02t-2
COURSE COURSE HOURS,A,VEE K CREDITS
COURSE ITLE Practical Total
CODE TYPE Theory Practical Total

CS325 Data Structure using C++ DSC-3C 4 2 6 4 I 5

,| ') 'l
SE325A Basics of Pyhon SEC-I 2
1 'l 1 1
SE325B PC Maintenance SEC-2
SEMESTER 2r-2022
COURSE COURSE HOUIIS/WEEK CREDITS
COURSE TITLE Total Theory Practical Total
CODE TYPE Theory Practical
Data Base Management 6 4 5
CS425 DSC-3D 4 2 I
Systems (DBMS)
1 1 1 1
SE425A PYTHON SEC-3

Libre office Spread Sheet SEC.4 1 1 a )

sE425B
SEMESTER 5(2022-2023)
COURSE COURSE HOURS/WEEK CREDITS
COURSE TITLE Practical Total T Practical Total
CODE TYPE Theo
CS525 Programming in Java DSC-38 4 6 4 I 5

SEMESTER 6 022-2
COURSE COURSE HOURS/WEEK CREDITS
COURSE TITLE T Total Theo Practical Total
CODE TYPE Practical
cs625 Web Technologies DSC-3F 4 2 6 4 I 5

C5625A PHP with M SQL DSE-IE l 2 6 3 I 4

TOTAL CREDITS t2

- Discipline Speci fic Course, DSE - Discipline Specilic Elective, SEC - Skill f,nhancement Course and GE - Generfll Elective

\-).
BOS iN
s
Bha'ran

ffil'-ilffix-:
 SEMESTER 2(2023-2024)
COURSE COURSE HOURS/WEEK CREDITS
COURSE ITLE
CODE TYPE Theory Practical Total Theory Practical Total
Fundamentals of )
AECC AECC 2 2 2
Computers (FOC)

AEC l(a) Basic Computer Skills AEC l(a) 2 1 2 2

SEMESTER 5(2022-2023)
COURSE COURSE HOURS/WEEK CRf,DITS
COURSE TITLE
CODE TYPf, Theory Practical Total Theory Practical Total

(;E Information
GE 4 4 4 4
Technologies
Multimedia
GE Applications using CE I 4 4 I
Gimp

GE P)4hon Programming GE 4 4 4 4

\.-)' \
ctl
U (. N. K\S
& $atica
rif;.[ P
A
\1Y
01 T.s.

\{Y

3lPage
 #tsIffi
Bhavan's Vivekananda College of Science, Humanities & Commerce
Sainikpuri, Secunderabad - 500094
Autonomous College - Afliliated to Osmania University
(Accredited with ,A' grade by NAAC)
Department of Computer Science

PROGRAM NAME: B.Sc. (CS) (w.e.I.2023_24)

COURSE NAME: PROGRAMMING IN.C'
COURSE CODE: CSt25 ppW:4
YEAR/SEMESTER: I/I NO. OFCREDITS:4

couRSE oBJECTIVE: To enable students with the conceprs of ,c, programming to Develop
Simple Applications.
UNIT.WISE COURSE OBJECTIVES:
Cob 1: To discuss the Basics of ,C, Language
cob 2: To illustrate different control and looping statements, Arrays and Strings with examples
Cob 3: To explain the usage ofFunctions, pointers.
Cob 4: To construct Structures, unions and working with text Files

UNIT.I:
Basics ofC, C Tokens, Input-Output, Control Statements 15 Hrs
Basics of c: overview of c, Developing programs in c, writing, compiling and Executing the
Program. Parts of simple c Program, Structure of a c program, comments, program Statements.
C Tokens: Keywords, Identifiers, Datatypes, variables, constants, operators and Expressions,
Expression Evaluation-Precedence and Associativity, Type Conversions.
Input-output: Non-Formatted and Formatted Input and output Functions, Escape Sequences.
control statements: Selection statements - if, if-else, nested if, nested if-else, conditional
Operator, switch.
(Ch: 8(8.l, 8.3, 8.6, 8.9, 8.12, 8.13, 8.16)), 9 (9.3,9.4),10 ( t0.4)).

UNIT-II:
Iterative Statements, Special Control Statement One Dimensional Array, Two Dimensional
Arrays, Character Arrays 15 Hrs
Iterative Statements: while, for, do-while.
Special Control Statement: goto, break, continue, return and exit.
One Dimensional Array: Declaration, Initializing, Accessing, Working with One Dimensional
Array.
Two Dimensional Arrays: Declaration of Two-Dimensional Array, working with Two-
Dimensional Array.
Character Arrays: Declaration of String, String lnitialization, Printing Strings, String Input
Functions from String.h (strlen0, strcat0,strrev0,strcmpO,strlwr0,strupr0).

ffit
Ch: 10 (10.5, 7, 10.8 10.9), lr(l t.2, 1t.3, lt.4.l, 11.4.6, ll.5.l, I t.5.2).

\) \
c
Bosll \\',r \
gha'{anr
UNIT-IIIt
Functions, Storage Classes, Pointers, Dynamic Memory Allocation 15 Hrs

Functions: Concept of Function: Need of Functions, Using Functions: Function Prototype

declaration. Function definition, Function calling, Call-by-Value mechanism, Scope of Variables
- Concept of Global and Local Variables.
Storage Classes: Storage Class specifiers for Variables, Recursive Function'
Pointers: lntroduction, Address of Operator (&), Pointer: Declaring a Pointer, Initializing
Pointers, lndirection operator and dereferencing, uses of Pointers and call-by-Reference.
Dynamic Memory Allocation: Dynamic Allocation of Arrays (calloc( ), malloc( )), freeing
memory (free( )).
Note: Theory Concept for Pointers and DMA.
(Ch:12(12.2, 12.4, 12.7,12.10), 13(13.1,13.3, 13.4' 13.t7,13.t7.1,13.t7'2\)'

UNIT.IV:
User Defined Data types, Union and Enumeration Type, Files 15 Hrs

User-Defined Data Types: Declaring a Structure and its members, lnitialization Structure,
Accessing members of a Structure, Array of Structures and Nested Structures'
Union and Enumeration Type: Declaring a Union and its members, Initialization, Accessing
members ofa Union, Structures versus Unions, Enumeration types'
Files: Introduction, Using Files: Declaration of file Pointer, opening a file, closing a file,
Working with Text Files: Character Input and Output.
$!9i Theory Concept for Files.
(Ch: 14(14.2.1, 14.2.3, 14.3, l4'3.1, 14.3.3, 14.4), ls(15'l' l5'2' l5'3)'

Prescribed Book:
Pradip Dey, Manas Ghosh, Computer Fundamentals and Programming in C (2e)

Refe rence Books:

1. lvor Horton, Beginning C.
2. Herbert Schildt, The Complete Reference C'
3. Paul Deitel, Harvey Deitel, C How to Program.
4. Byron 5. Gottfried, Theory and Problems of Programming with C'
5. Brian W. Kernighan, Dennis M. Ritchie, The C Programming Language'
6. B.A. Forouzan, R. F. Gilberg, A Structured Programming Approach Using C'

COURSE OUTCOMES: At the end of the course students will be able to:
CSl25 COl: Be Familiar and Develop Basic Programs in C'
Statements' Arrays and
CS125 CO2: Develop Program using Control Statements, Looping
String concepts.
CS125 CO3: Write Programs using Function and Pointers'

ffi:
CS125 CO4: Apply the concepts of Structures, Unions and
Working with Text Files in C
Programs.

t-), S ON
CHAt RP sclence
inPuter
BOS in Co College
ekanan da
inlkDLlrl
 #fiffi
Science, Humanities & Commerce
of
Bhavan's Vivekananda College
SainikPuri, Secunderabad - 500094
Autonomous College - AIfiliated to Osmania University
(Accredited with 'A' grade by NAAC)
Department of ComPuter Science

PROGRAM NAME: B.Sc. (CS) (w.e.f.2023-24\

COURSE NAME: PROGRAMMING IN'C'Lab

COURSE CODE: CSl25P PPW:2

YEAR/SEMESTER: I/I NO. OF CREDITS: I

COURSE OBJECTIVE: To Gain Knowledge on C Programming

COB1: To implement C Programs for Control Statements, Arrays, Functions and Recursion.
COB2: To implement C Programs for Structures, Unions' Enum and Files

1. lntroduction to Computers, Fundamentals (Seminar).

2. Classification of Computers & Anatomy of Computers (Seminar).
3. tntroduction to o.s, compiling, Loading, Linking, lnterpreting and software development
(Seminar).
4. Top-down Analysis, Modular Programming & Memory Hierarchy (Seminar)
5. Generation and Classification of Programming Languages. (Seminar)'
6. Different Algorithms (Step-form' Pseudo-code. Flow chart) (Seminar)
7. Write a program to demonstrate comma operator.
g. write a program to find the larger of two numbers using if and conditional operator.
g. write a program to calculate arithmetic operations of two numbers using switch.
10. Write a program to print the reverse of a given number'
11. Write a program to print whether the given number is a prime or not'
12. Write a program to find largest and smallest elements in a
given list of numbers.

13. Write a program to find the sum of two matrices'

14. Write a program to find the product of two matrices'
15. Write a program to print the reverse of a given string'
16. Write a program to demonstrate any four Functions of ctype'h'
17. Write a program to find the factorial o1 a positive integer using recursion'
18. Write a program to find the GCD of two positive integers using iteration'
lg.writeaprogramtodemonstratethecallbyvalueandthecallbyreferenceconcepts.
20. Write a program to demonstrate Passing Arrays to Functions'
21. Write a program to demonstrate Arrays and Pointers'
22. Write a program to demonstrate Pointers and Strings'
23. Write a program to illustrate the use of Enumeration data
type'
24. Write a program to illustrate the use of structure concept'
25. Write a program to illustrate the use of union concept'
26. Write gram to write content into a file and display contents of a file'
N KIS
HANace
\-\,\ r- D
Nla thematics
rt rnent o-t RSITY -ts
NIVE
A NIA U
D-500 007
HYDE RABA
.d,,ffid'?l*
COURSE OUTCOMES:

By the end ofthe Course, Students will be able to:

CO1: Execute C Programs for Control Statements, Arrays, Funclions and Recursion'
CO2: Execute C Programs for Structures, Unions, Enum and Files.

Note: Write the Pseudo Code and draw Flow Chart for the above Programs recommended
to use Open Source
Some are: GCC on Linux; Dev C++ (or) Code BIocks on Windows 10.

C
\
\). CH
sos in N.
ghaYan
$ D (.
P

TlPage
 GBIffi
Bhavan's Vivekananda College of
Science, Humanities & Commerce
Sainikpuri, Secunderabad - 500094
Autonomous College - Alliliated to Osmania University
(Accredited with 'A' grade by NAAC)
Department of Computer Science

PROGRAM NAME: B.Sc. (CS) (w.e.f.2023-24)

COURSE NAME: PROGRAMMING IN C++

COURSE CODE: CS225 PPW:4

YEAR/SEMESTER: I/II NO. OF CREDITS:4

COURSE OBJECTIVE: To enable students with the concepts of object-oriented Programming

and develop simple applications.

UNIT-WISE COURSE OBJECTIVES:

CObl: To explain basic concepts like control statements, Arrays, Pointers and Functions.
COb2: To explain the concepts ofOOP, class definition, constructors and destructors.
COb3: To illustrate different Programs on inheritance, polymorphism, virtual Functions and
C++ streams.
COM: To construct Programs using templates and exception handling.

UNIT.I:
Introduction to C+r, Control Structures, Arrays, Strings, Pointers, Functions. 15 Hrs
Introduction 1s Qr+: Applications, Example Programs.
Control Structures: if statement, if-else, iflelse-il nested if, switch statement, while, do While,
for.
Arrays: Arrays hold Multiple values, Accessing Arrays elements, lnputting and displaying
contents (using cin and cout), Array Initialization (One-Dimensional and Two-Dimensional)'
Functions: Introduction, Function Prototype Passing data by value (Call by Value), Reference
Variables definition and simple example Program.
(ch-2(2. l ,2.9),3,4(4.2,4.3,4.4,4.6,4. l 2),s(5.2,s.5,s.6),6(6.3,6.s,6. I 3),8(8. I ,8.2,8.3,8.4),
10 (r0.r,r0.2,10.5).

UNIT-II:
Object Oriented Programming, Classes, Constructors, Polymorphism' 15 Hrs
Object Oriented Programming: Procedural Programming versus Object Oriented
Programming Terminology, Benefits. OOP Languages and OOP Applications.
Classes: lntroduction, defining instance of a Class, why have Private members? Private Member
Functions, Inline Member Functions.
Constructors: Default Constructor, Passing Arguments to Constructors (Parameterized
Constructors), Copy Constructors, Destructors, Arrays of Objects.
(ch-13 (13.1 .2,t3.3,t3.4,13.5,13.6,13.7,13.8,13.9,13.1 1,13. l2).
KIS HAN
DTN ad
ematics
\ RS N r* TF $atu ITY
\\' oe Pa(t VERS
BOS in Compu ter Scienco c.MA NIA UNI500 0 07 TS
Vivekan anda collego YDE RAA AD.
Phavqn'9 H
Q?inirPurt
UNIT.III:
Inheritance, Polymorphism, Virtual Member Functions. 15 Hrs
lnheritance: Introduction, Protected Members and Class Access: Base Class Access
Specification, Single Inheritance, Multilevel Inheritance, And Hierarchical Inheritance
Polymorphism: Overloading Functions, Overloading Constructors, Operator Overloading
(Overloading with prefix ++Operator, Overloading Postfix - Operator)
Polymorphism and Virtual Member Functions (Simple example Program)
(ch-rs(r5.1, 15.2, 15.3, 15.4, 15.5, 15.6, t5.7, t5.8)).

UNIT-IV:
Exceptions, Templates. 15 Hrs
Exceptions: lntroduction, Throwing an Exception, Handling an Exception, Object-Oriented
Exception Handling with Classes, Multiple Exceptions, Re-Throwing an Exception
Templates: Function Templates-lntroduction, Function Templates with Multiple type,
Overloading with Function Templates, Class Templates-lntroduction, Defining Objects of the
Class Template.
(ch-16( 16. l , 16.2, t6.4, t6.5)).

Prescribed books:
1. Tony Gaddis, Starting out with C++, from Control Structures throuth objects (gel
2. Herbert Schildt, C++: The Complete Reference

Reference Books:
l. B. Lippman, C++ Primer.
2. Bruce Eckel, Thinking in Cr-r.
3. K.R. Venugopal, Mastering in C++.
4. Bjarne Stroustrup, The C++ Programming Language.
5. Sourav Sahay, Object Oriented Programming with C++.

COURSE OUTCOMES: At the end of the course students will be able to

CS225COl: Develop simple Programs using conditional statements and Functions.

CS225CO2: Illustrate the concepts ofclasses, constructors and destructors.
CS225CO3: Implement inheritance and polymorphism concepts in Programs.
CS225CO4: Apply the concepts of templates and exception handling.

N\.\ ---
BOS in
Bhavan'8

ser*$il.inim'::
9lPage
 6,1fiftmftfri
Bhavan's Vivekananda College of
Science. Humanities& Commerce
Sainikpuri, Secunderabad - 500094
Autonomous College - Alfiliated to Osmania University
(Accredited with 'A' grade by NAAC)
Department of Computer Science

PROGRAM NAME: B.Sc. (CS) (w.e.I.2023-24\

COURSE NAME: PROGRAMMING IN'C++' Lab

COURSE CODE: CS225P PPW:2

YEAR/SEMESTER: I/II NO.OF CREDITS: I

COURSE OBJECTIVE: To gain knowledge on C++

COBI: To implement C++ Programs for Control Statements, Functions, Recursion and Arrays.
COB2: To implement C++ Programs for Object-Oriented Concepts.

1. Write a program to print the sum of digits of a given number.

2. Write a program to check whether the given number is Armstrong or not.
3. Write a program to check whether the given string is Palindrome or not.
4. Write a program to implement
a) Linear Search b) Bubble Sort
5. Write a program to demonstrate Reference Variables as Parameters.
6. Write a program to demonstrate Passing Arrays to Functions.
7. Write a program on Pointers.
8. Write a program to read student name, roll no, marks and display the same using class
and object (Separating Class Specification from lmplementation example).
9. Write a program to find area of a rectangle, circle, and square using class and object.
10. Write a program to implement inline function inside and outside of a class
a) Finding the area of a square b) Finding the area of a cube
11. Write a program to implement friend function and friend class.
12. Write a program to demonstrate
Members b) Member-wise Assignment
a) lnstance and Static
13. Write a program to implement constructor and destructor with in a class (Constructor
Overloading and Constructor with Default Arguments).
14. Write a program to demonstrate hierarchical inheritance.
15. Write a program to demonstrate multiple inheritances.
16. Write a program implementing Constructor in lnheritance
17. Write a program to demonstrate static polymorphism.
18. Write a program to implement polymorphism using pure virtual Functions.
19. Write a program to demonstrate unformatted 1/0 operations (cin, cout, get0, put(),
getline() te0).
(- \rc9
\.-\ C 1,S
BOS in Gollege
s
Bhavut
 20. Write a program to demonstrate the function templates and class templates'
21. Write a program to demonstrate exception handling using try, catch, and finally'
22. Write a program to demonstrate for Re-throwing an Exception'
23. Write a program to demonstrate Class Templates and lnheritance'

CO OUTC MES:
By the end ofthe Course, Students will be able to:
COl: Execute C++ Programs for Control Statements, Functions, Recursion and Arrays'
C02: Execute C++ Programs for Object-Oriented Concepts.

Recommended to use open-sourceSoftware: GCC on Linux: Dev c++ or code BlOcks on

Windows.

(-

N\.
aOS in
ei'ovafts Pqi*ll[il'Iiq*r'rx

11 | Page
 #ffiffiffi
BHAVAN'S VIVEKANANDA COLLEGE
Of Science, Humanities and Commerce, Sanikpuri
Autonomous College I Affiliated to Osmania University
Accredired with .A' Grade by NAAC
Department of Computer Science
PROGRAM NAME: B.Sc.(Computer Science)
(w.e.f.2021-22)
COURSE NAME: Data Structures

COURSE CODE: CS325 P.P.W:4

YEAR/SEMESTER: II/III NO.OF. CREDITS:4
COURSE OBJECTIVE: To familiarize the students with concepts of Data Structures using C++
language.

UNIT-WISE COURSE OBJECTIVES:

CObl: To impart knowledge on Data Structures and Recursion.
COb2: To demonstrate the operations ofeueues and Linked Lists.
COb3: To discuss the concepts ofTrees, Sorting and Searching.
COb4: To exemplify the concepts ofGraphs, Hashing and Heap.
Unit-Il Basic Data Structure, Stacks and Recursion 15 Hrs.
Basic Data Structure: Introduction to Data Structures, Types of Data Structures and Introduction
to
Algorithms, Pseudo code- Definition. Relationship among data, data structures and algorithms,
lmplementation of data structures.

Stacks: Concept of Stacks, Stack Abstract Data Type, Representation of Stacks Using Sequential
Organization (Arrays), Applications of Stack, Processing of Function Calls, Reversing a
String with a
Stack

Recursion: Introduction, Use ofstack in Recursion, Recursive Functions, Iteration versus Recursion.
(Ch : I .3- l. 8, Ch3.2,3.3,3.4,3.7,3.9,3.1 O, Ch:4. 1,4.3,4.6,4.7
)

Unit -II: Queues and Linked Lists l5 Hrs.

Queues: concept ofQueues, Queue as Abstract Data Type, Realization ofeueues Using Arrays,
Deque-Definition, Priority Queue- Aray implementation of priority queue, Applications of
Queues-
Josephus problem.

Linked Lists: Introduction, Linked List, Linked List Abstract Data Type, Linked List Variants, Doubly
Linked List, Circular Linked List-Definition, Linked Stack, Linked eueue.
(Ch:s.1,5.2,s.3,5.6,s.7,5.8(5.8.1), Ch:6.1.6.2,6.5,6.6,6.7,6.8,6.1t,6.12)

3lPage
\ -i
\,"t>
cHAtRFd+6efi t't
Prc
sociate ar.h s 9.u
BOS in ComPutei Science ePl of
Bhavan's Vivekananda College
SainikPuri
Unit -III: Trees, Searching and Sorting 15 Hrs.
Trees: Introduction, Types of rrees, Binary Tree-Definition, Binary Tree Abstract Data Type,
Insertion ofa Node in Binary Tree, Binary Tree Traversal-Traversal techniques.

Searching and Sorting: Search Techniques-Linear Search (Sequential Search), Binary Search,
Sorting Techniques- Selection Sort, Bubble Sort, lnsertion Sort,
euick Sort.
(Ch:1 .1,7 .2,7 .3,7.4,7 .6,7 .7(7.7 .t,7.7 .2,7 .7 .3), Ch 9.2(s.2.1,9.2.2),9,3(9.3.3,9.3.4,s.3,5,9.3.6)

Unit -IV: Graphs, Hashing and Heaps 15 Hrs.

Graphs: Introduction, Representation of Graphs-Adjacency Matrix, Adjacency List, Graph rraversal
- Depth -First Search, Breadth -First Search, Spanning Tree-Connected Components, Kruskal's
A lgorithm.

Hashing: Introduction, Key Terms and Issues.

Heaps: Basic concepts, Implementation of Heap, Heap as Abstract Data Type, Heap Sort,
Heap Applications.

(Ch:8.1,8.3(8.3.1,8.3.2),8.4,8.5(8.s.1,8.5.3),(Ch:ll.l,l1.2, Ch:12.1,12.2,12.3,12.4,12.5)

Prescribed Books:

L Varsha H. Patil "Data structures using C++. Oxford University press, 201 2

References:
I' M.T' Goodrich, R. Tamassia and D. Mount, Data structures and Algorithms in c++,.yshn wip,
2. and Sons, Inc.,20l I
3. Adam Drozdek "Data structures and algorithm in C++,, Second edition, 2001
4. T'H. cormen, c.E. Leiserson, R.L. Rivest and c. Stein, Introduction to Algorithms, 2nd Ed.,
Prentice-Hall of India, 2006
5. Robert L. Kruse and A.J. Ryba, Data structures and program Design in c++, prentice Hall, Inc.,
NJ, 1998
6. B. Stroupstrup, The C++ Programming Language, Addison Wesley,2004
7. D.E. Knuth, Fundamental Algorithms (Vol. I), Addison Wesley, 1997

COURSE OUTCOMES: By the end of the course students will be able to:

COl: Acquire knowledge of Data Structures and Stacks.

CO2: Implement the operations of Queues and Linked Lists.
CO3: Comprehend the concepts ofTrees, Sorting and Searching.
C04: Deduce the concepts ofGraphs, Hashing and Heap.

4lPage
S&'$'i^t'iS'S:'l
EFlSON
BOS in Computer Sciencs
Bhavan's Vivekananda Colle ge
.-Sainikpuri
 G;ifiWffii
BHAVAN'S VIVEKANANDA COLLEGE
Of Science, Humanities and Commerce, Sanikpuri
Autonomous College lAffiliated to Osmania University
Accredited with 'A' Grade by NAAC
Department of Computer Science
PROGRAM NAME: B.Sc.(Computer Science)
(w.e.f.2021-22)
COURSE NAME: Data Structures Using C++ Lab

COURSE CODE: CS325P P.P.W:2

YEAR/SEMESTER: IIIIII NO. OF CREDITS: I
COURSE OBJECTIVE: To enable students with the knowledge of Searching and Sorting techniques,
Linear and Non-Linear Data Structures.

Cobl: To implement C++ Programs for Searching and Sorting Techniques.

Cob2: To implement C++ Programs for Linear Data structures and Non-Linear Data Structures.

Week l:
l. Write a C++ programs to implement the following using an array.
i. a) Stack ADT b) Queue ADT
Week 2:
2. Write a C++ program to convert infix expression to postfix expression and vice versa.
Week 3:

3. Write a C++ program to implement Circular queue using array.

4. Write a C++ programs to implement the following using a single linked list.
a) Stack ADT b) Queue ADT
Week 4:
Write a C++ program to implement Circular queue using Single linked list.
5.
6. Write a C++ program to implement the double ended queue ADT using double linked list.
Week 5:
7. Write a C++ program to solve tower of Hanoi problem recursively.
L Write a C++ program to perform the following operations:
i. a) Insert an element into a binary search tree.
ii. b) Delete an element from binary search tree.
iii. c) Search for a key in a binary search tree.

ess0f
5lPage ASS clate Prof o.u.
c Dep tof Maths
IRPERSON
BOS in Computer Scienca
Bhavan's Vivekananda Colle 0e
Sainikpurl
Week 6:
9. Write a C++ programs for the implementation tree traversal technique BFS.

10. Write a C++ program that uses recursive functions to traverse a binary search tree.
i. a) Pre-order b) In-order c) Post-order
ii.
Week 7:
I l. Write a C++ program to find height of a tree.
12. Write a C++ program to find MIN and MAX element of a BST.
Week 8:
13. Write a C++ program to find in Order Successor of a given node.

14. Write a C++ programs to perform the following operations on B-Trees and AVL Trees.
i. a) Insertion b) Deletion
Week 9:
15. Write a C++ programs for sorting a given list of elements in ascending order using the
following sorting methods.
i. a) Quick sort b) Merge sort
16. Write a C++ program to find optimal ordering of matrix multiplication.

Week 10:
17. Write a C++ program that uses dynamic programming algorithm to solve the optimal binary
search tree problem
18. Write a C++program to implement Hash Table.
Week 11:
19. Write a C++ programs to perform the following on Heap.
i. a) Build Heap b) Insertion c) Deletion
Week 12:
20. Write a C+* programs to perform following operations on Skip List. a)lnsertion b) Deletion
Week 13:
21. Write a C+t Program to Create a Graph using Adjacency Matrix Representation.
22.Write a C++ program to implement graph traversal techniques.
a) BFS b) DFS
Week 14:
23. Write a C++ program to Heap sort using tree structure.

COURSE OUTCOMES: By the end of the practical course students will be able to:

COl: Execute Searching and Sorting Techniques using C++.

CO2: Execute Linear Data Structures and Non- Linear Data Structures using C++.

:H'f'd:,I \
6lPage $:i?'lti,'
c
BOS in ComP t-
6666 Sottege
Bhavan' s Vivekan
gainikPurt
 GBfff;ffiPi#ii
BIIAVAN' S VIVEKANANDA COLLEGE
Of Science, Humanities and Commerce, Sanikpuri
Autonomous College I Aflliated to Osmania University
Accredited with .A, Grade by NAAC
Department of Computer Science
PROGRAM NAME: B.Sc.(Computer Science)
(w.e.f.2021-22)
COURSE NAIIIE: Basicj of python
Skill Enhancement Course (SEC_ 1)
CoURSE CODE: SE325A
P.P.W:2
YEAR/SEMESTER: II/III NO.OF CREDITS:2

COURSE OBJECTIVE: To help the students flamiliarize the concepts of python.

UNIT.WISE COURSE OBJECTIVES:

CObl: To impart knowledge on basics ofpyhon and decision structures.

COb2: To demonstrate functions, files and exceptions.

Unit - I: Introduction to Python programming, Decision structures

and Boorean
------ Logic,
Structures --E Repetition 15 hrs.
Introdu_ction to-Python Programming: How a program works, Using python, program
' Development
cycie- InpIt, and. o_ulput: Dispraying output with prini
. _Processing, it Furiction, comments,
variables, Reading Input from^the Keyboard, i"rrori.,ing ialcurations "
Expressions), More about Data Output.
top"rutor., iypl conversions,

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 Ioop, for loop, Calculating a Running

Total, Input Validation
Loops, Nested Loops. (Ch:1,2,3,4)

Unit-II: Functions, Files and Exceptions 15 hrs.

Functions: Introduction, Defining and Calling a Void Function, designing program
a to Use Functions,
Local Variables, Passing Arguments to Functions, Global Variables a=nd
Glo-bal Constants, value-
Returning Functions- Generating
l"ld9T Numbers, writing our own Varue-Returning Functions, the
math Module, Storing Functions in Modules.

Files and Exceptions: Introduction to File Input and output, Using Loops to process
Files, processing
Records,Exceptions. (Ch:5,6)

TlPage
\N"r" Asso
CHAIRPEFSON DePt 'lti':[fl'f53j
BOS ln Qo'rfi-Puter Scianoe
Bhavan's Vivet<ananda Collego
Sahtikeud
Prescribed Book:

l. Tony Gaddis, Starting Out with python (3e)

Reference Books:
L Kenneth A. Lambert, Fundamentals of python
2. clinton w. Brownley, Foundations for Analytics with python
3. James Payne, Beginning python using python2.6 andpython3
4. charles Dierach, Introduction to computer Science using python
5. Paul Gries, Practical Programming: An Introduction to Computer Science using python3
couRSE ourcoMES: By the end of the course students will be able to:
COl: Execute basic programs in python.
CO2: Implement functions, files and exceptions.

,n?ffi$sriitqo

8lPage
 #llffffi
BHAVAN'S VIVEKANANDA COLLEGE
Of Science, Humanities and Commerce, Sanikpuri
Autonomous College I Afliliated to Osmania University
Accredited with .A, Crade by NAAC
Department of Computer Science
PROGRAM NAME :-R.Sc.(Computer Science)
(w.e.f.2021-22)
COURSE NAME: pC Maintenance
Skill Enhancement Course (SEC- 2)

COURSE CODE:SE325B p.p.W:2

YEAR/SEMESTER: IIilII NO. OF CREDITS:2
CoURSE OBJECTIVE: To help the students familiarize the components of pC and Maintenance
of
PC,

UNIT-WISE COURSE OBJECTIVES:

CObl: To identify PC Components, Features, System Design, Motherboards and Bus.

cob2: To correlate the importance of Memory, Hard Disk Storage, Building or Upgrading Systems
ofa PC, Testing and Maintenance.

UNIT'I: PC components, Features, System Design, Motherboards and Buses 15 Hrs.

PC components, Features and system Design: what is a pc, who controls pc Software, who
Controls PC Hardware, PC Design Guides, System Types, and System Components.
Processor Types and Specifications: Microprocessor History, Processor, Processor Socket and Slot
Types, lntel Family: Intel P6 (686) Processors, Pentium III, Celeron, Intel Pentium 4 processors, pentium
4 Extreme Edition, Intel core Processors, others: AMD K6 processors, AMD K7 processors, AMD Kg
Processors.
Motherboards and Buses: Motherboard Form Factors, Chipsets (lntel Chipsets, North/South Bridge
Architecture, Fifth-Generation (P5 Pentium Class) Chipsets, Sixth-Ceneration (p6 pentium pro/llllll
class) chipsets, seventh/Eighth-Generation (pentium 4lD, core 2, and core i) chipsets, Third-party
Chipsets for Intel Processors, Chipsets for AMD Processors), Motherboard Connectors, System Bus
Types, Types of I/O Buses. (Ch-2, 3, 4)

9lPage _.
\e
CHAIRFERSON
BOS in Computei Stience
ASSocla
dept
li,t'.?t;E:'l
ot

tsnavan's Vivekananda Coileoe

__ Sainikpuri
 Practicals:

I ' Identifying external ports and interfacing of peripherals (Such as Monitor, Keyboard, Mice, Speakers,
Printers, Modem)
2' Identifying PC cards such as memory board, display card, NIC card and Sound
Blaster card.
3. Identifying the ports on cards.

UNIT-II: Memory, Power Supplies, Input Devices, Hard Disk Storage, Building or Upgrading
Systems and PC Diagnostics, Testing and Maintenance 15 Hrs.
Memory: Memory Basics, Memory standards, Memory Modules, Memory Banks.
Power Supplies: The Power Supply, Primary Function and Operation, power
Supply Form Factors,
Power Switches, Motherboard power Connectors.
Input Devices: Keyboards, Optical Mice, Pointing Device Interface Types, Wiretess Input
Devices.
Hard Disk Storage: Hard Drive Advancements, Form Factors, Basic HDD Components.
Building or Upgrading Systems: System Components, System Assembly and Disassembly,
Installing
the OS, Troubleshooting New Installations.
PC Diagnostics, Testing, and Maintenance: PC Diagnostics, Diagnostics Software, peripheral
Diagnostics, Operating System Diagnostics, Commercial Diagnostics Software,
Free/User Supported
Diagnostics, The Boot Process, Booting from Optical or Floppy, PC Maintenance
Tools.
(ch-6, lg, 15,9,19,20)

Practicals:
L Interfacing Hard disks.
2. Disassembling and assembling of pC
3. Preventive maintenance of pC
4. Understanding of CMOS setup
5. Loading windows operating system and device drivers
6. Installation of application software

Prescribed Book:
l. Scott Mueller -Upgrading and repairing PCs-2}th Edition, eUE (pHI) -21ll.
Reference Books:
l. IBM PC Clones by Govindarajalu, 2nd edition, McGraw-Hill education, 200g.

2. PC Upgrade & Repair Black Book by Ron Gilster.

couRsE ourcoMES: By the end of the course studenrs will be able to:

COl: Identify PC Components, Features, System Design, Motherboards and Bus.

CO2: Comprehend the importance of Memory, Building or Upgrading
Systems and pC
Diagnostics, Testing and Maintenance.

l0 lPage
\ryp Ass,ociate
P (ofessof
rhs o.u
Dep t0fMa
CHA}HFERSON
BOS in Computer Soionl::
Bhavan's VivekananrJ8 0 sihse
\ Sailtflr,
 @ffHiffi
BHAVAN'S VIVEKANANDA COLLEGE
Of Science, Humanities and Commerce, Sanikpuri
Autonomous College I Affiliated ro Osmania University
Accredited with ,A, Grade by NAAC
Department of Computer Science
PROGRAM NAME :^B,Sc.(Computer Science)
(w.e.t. Z02t_22)
COURSE NAME: Database Management Systems.

COURSE CODE:CS425
P.P.W:4
YEAR/SEMESTER: II/IV NO. OF CREDITS:4
Course Objectives:

CObl: To impart the basic concepts of database

COb2: To discrss Entity-Relation approach of data modeling
COb3: To study the relational model and Normalization.
COb4: To discuss Transaction Management concepts

Unit l:
Introduction to Databases:
_
Database-System Applications; Purpose
15 Hrs
of Database Systems; View of Data-Data Abstraction, Instances
and Schemas' Data Moders; Database Languages- Data Manipuration
Language, Data- Definition
Language; Database Access from Manipulation programs;
Data Storage and euerying- Storage Manager,
The Query Processor, Database Architecture; Database Users
and Administrators.

Introduction to the Relational Model: Structure of Relational Databases;

Database Schema; Keys;
Schema Diagrams; Relational euery Languages; Relational
Operations.

(Book l: Ch: 1,2)

Unit- II :Database Design and the E-R Model: 15 Hrs

Overview of the Design Process- Design Phases, Design Alternatives;
The Entity-Relationship Model-
Entity Sets, Relationship sets, Attributes; Constraints Mapping Cardinalities, participation
- constraints,
Keys; Entity-Relationship Diagrams- Basic Structure, Mapping cardinality,
complex Attributes;
Reduction to Relational Schemas- Representation of Strong Entity
sets with simple attributes,
Representation of Strong Entity Sets with complex attributes, Representation
of Weat Entity Sets,
Representation of Relationship Sets.

(Book l: Ch: 7)

Asso
11 lPage DePt 'ltt^:[fl'f8:'l
IRPERSON
BOS in Computer Science
Bhavan's Vivekananda Colleue
Sainikpurl
Unit- III: Extended ER Model and Normalization: 15 Hrs

Extended E-R Features - Specialization, Generalization, Attribute lnheritance, Constraints on

Generalization, Aggregation, Reduction to Relation Schemas-Representation of Generalization,
Representation of Generalization, Representation of Aggregation.

Relational Database Design: Features of Good Relational Designs- Design Alternative :Larger Schemas,
Design Alternative: Smaller Schemas; Atomic Domains and First Normal Form; Decomposition Using
Functional Dependencies- Keys and Functional Dependencies, Boyce-Codd Normal Form, BCNF and
Dependency Preservation, Third normal Form, Database Design Process.

(Book l; ch: 7, 8)

Unit- IV: Security ,Transaction Management and Recovery: 15 Hrs

Database Security: Threats, Computer-Based Controls - Authorization, Access Controls- Discretionary

Access Control (DAC), Mandatory Access Control (MAC), RAID ( 0, 1,0+l)

Transaction Management: Transaction Support- Properties of a transaction, Concurency Control- The

Need for Concurrency Control, Serializability and Recoverability((Definition of Conflict Serializability,
Definition of View Serializability), Locking Methods- 2PL(Definilion of 2-Phase LockingProtocol),
Deadlock- Deadlock prevention, Deadlock detection, Recovery from deadlock detection, Timestamping
Methods- Thomas's Write Rule, Granularity of data Items( only Introduction), Database Recovery- The
Need for Recovery, Recovery Facilities, Recovery Techniques

(Book2; Ch.,20,22)

Prescribed Books:
l. Silberschatz, H. Korth and S. Sudarshan, Database System Concepts, 7th Ed., Tata McGraw Hill, 2017
2. Thomas M. Connolly, Carolyn E. Begg, Database Systems-A Practical Approach to Design,
lmplementation, and Management (6e)

Course Outcomes: Student will be able to

COI: Understand the basic concepts of Database
CO2: Familiarize the Entity-Relation approach of Data Modeling
CO3: To gain knowledge of the Relational Model and Normalization.
CO4: To understand Transaction Management concepts

\"2)2
CHAIRPERSON i^'."?t:3:'1
BOS in Computer qeienc.]B
$:;?1f
Bhayan's Viy6kan0ndg eEiraqd
\--Sa,flfPurl
12 lPage
 ffiBrihviiff
VIVEKANANDA COLLEGE
BHAVAN'S
OF SCIENCE, HUMANITIES AND COMMERCE
(Accredited with'A' grade by NAAC)
Autonomous College
Affiliated to osmania UniversitY

PROGRAM NAME: B.Sc.(Computer Science)

(w.e.f. 2021-22)
COURSE NAME: Database Management Systems Lab

COURSE CODE: CS425P P.P.W:2

YEAR/SEMESTER: II/IV NO. OF CREDITS: 1

Course Objective: To acquire knowledge on SQL Commands, SQL Operators, Joins, Stored
Procedures and Triggers.

CObl: To impart basic concepts of SQL

COb2: To get equipped with the concepts of Joins, nested queries, views, Triggers and Stored
Procedures

Week 1:
1. SQL Data types
Week 2:
2. Data Definition Language, Data Manipulation Language
J. Data Control Language
Week 3:
Group By and Order BY Clauses
4.
5. Set Operators
Week 4:
6. Joins (Cartesian, Equi)
Week 5:
7. Joins (Outer, Self)
Week 6:
8. Create a database having two tables with the specified fields, to computerize
a library system
of a University College. Library Books (Accession number, Title, Author, Department,
Purchase Date, Price), Issued Books (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".
.j Change the Department of the book titled "Discrete Maths" to "CS".
d) List all books that belong to "CS" department.
13 lPage
.hn#
BOS inCorfiubr Science
Bhavan's Vivekananda College of
DePt
. Sainikpurl
 e) List all books that belong to "cS" department and are written by
author .Navathe,,.
f) List all computer (Department="CS,i that have been issued.
g) List all books which have a price less than 500 or purchased between ,,01/0111999"
and
"01/0U2004".

Week 7:

9 create a database having three tabres to store the detairs 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 whore number)
in percentage at r 0 + 2, phone
number) Paper Details (Paper code, Name ofthe 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 reast 5 records
in each
table.
b) Design a query that will return the records (from the second
tabre) arong with the name of
student from the first table, related to students who have
more than 7 5y;o attendance and
more than 60% marks in paper2.
c) List all students who live in ,,Warangal,, and have marks greater
than 60 in paperl.
d) Find the total attendance and total marks obtained by each
student.
e) List the name ofstudent who has got the highest marks
in paper2.
Week 8:

10. create the following tables and answer. the queries given berow:
customer (custrD, emair,
!3me, -Phona ReferrerrD) Bicycre (BicycleiD, Daf,purchased, coror, curilo, uoa.tNo;
BicycleModel (ModelNo, Manufacturer, Siyle) Service (StartDate, BicycielD,
eriO"t i
a) Identify primary and foreign keys. Create the tablei 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,,cl,,.
d) List the manufacturer of red colored bicycles.
e) List the models ofthe bicycles given lor service.
Week 9:

I l' Create the following tables, enter at least 5 records in each

table and answer the queries given
below. Employee (person_Name, Street, City
Salary)
) Works (p"oon_Nur., Corpuny_Nurr,

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 aI 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 a[ emproyees who live in the same city as the
company for which they
work.
f) Find the highest sarary, rowest sarary and average sarary paid
by
each company.
14 lPage

U P ERSON
BOS Computer Science
Bhavat's Vivekananda Collego $.i?$i'.ffir:;
-.-- Ssinikpurl
 g) Find the sum of salary and number of employees in each company.
h) Find the name ofthe company that pays highest salary.

Week l0:

12. Create thefollowing 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, eunatity)
a) ldentify 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 l6 pounds or are supplied by suppliers
52, or both.
h) Get the names of cities that store more than five red parts.
i) Get lull details ofparts supplied by a supplier in Hyderabad.
j) Get part numbers for part supplied by a supplier in Warangal to a project in Chennai.
k) Get the total number ofprojects supplied by a supplier(say, S'l).
l) Get the total quantity ofa part (say, Pl) supplied by a supplier (say, Sl).

Week 1l:

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

Week 12:
14. Write a PL/SQL program to Handle Exceptions.

Week 13:
15. Write a PL/SQL Program to perform a set of DML Operations.
Week 14:
16. Write a PL/SQL Program to demonstrate Trigger.

Course Outcomes:
By the end ofthe course, Students will be able to

COI: Execute various SQL commands and operators.

CO2: Practice SQL functions, Joins, nested queries and views. Triggers and Stored Procedures of
PL/SQL.

Assoclate ProfeSsor
15 lPage CH RPERSON
Maths v'u
BOS in Computor Science DePt of
Bhavan's Vivekananda Colleue
Sainikpuri
 {#'tsrffiffii
BHAVAN'S VIVEKANANDA COLLEGE
Of Science, Humanities and Commerce, Sanikpuri
Autonomous College I Affiliated to Osmania
Universitv
Accredited with ,A, Grade by NAA C
Department of Computer Science
PROGRAM NAME: Science)
'
"B.Sc.(lgmputer
(w.e.f.2021_22\
COURSE NAME: pvthon
Skill Enhancement Coursl (SEC _ 3)
COURSE CODE: SE425A
P.P.W:2
YEAR/SEMESTER: IIIIV NO. OF CREDITS:2

couRsE OBJECTIVE: To enabre students deverop programs through python

Scripts.
UNIT-WISE COURSE OBJECTIVES:
cobl: To describe the functionarities ofLists,
Tupres, Strings, Dictionaries and Sets.
COb2: To illustrate Object Oriented Concepts
and CUI Controls.

Introduction to python programming, Lists and

_UNIT-I: Tuples, Strings, Sets. l5Hrs.
Introduction to Python programming: How a program
works, Using plthon, program Deveropment
cycle, Input, Processing, and output: Disprayiig
output with the print Fun-ction, comments,
variables, Reading Input from the Keyboard,
t.rio,iing Carculations (operators. Type conversions,
Expressions), More about Data Output.
Lists and ruples: Sequences, to Lists, List slicing, Finding Items in Lists with the
^lntroduction
operator, List Methods and Useful Buirt-in rr".,iorr,'copying Lists, processing Lists,
in
Lists, Tuples. Two_Dimensionar

Strings: Basic String operations,. string Slicing,

Testing, searching, and Manipurating Strings.
Dictionaries and Sets: Dictionaries, Seis, Seriliiring
OTj..tr. tCf,upters-1, 2, 7, g,9)
UNIT-II: Object-Oriented programming and GUI programming l5Hrs.
object-oriented Programming: procedurar and object-oriented programming,
Inslances, Techniques for Designing Classes. crasses, working with
In}eritance: lnheritance, eolymorphism.
cul Programming: craphicar User Interfaces. Using the Tkinter Modure,
Widgets, Organizing Widgets:i,l FIT:I Dispray text with Laber
A_rtto,rWi[g.t. Diatog Boxei,6etting
Entry widget, Using Labels as output Fierds, nuaio 1ld l"!
erti8rr, check
Input with
Buttons. (chapters- r0, r r, 13)

16 lPage \"C2
CHAFfERSON... Professol
9'U'
#"ttltfr aths
Bf.?ii:fi:'T,i"Hffi:ilu'
Prescribed Book:
1. Tony Gaddis, Starting Out with Python (3e).

Reference Books:
1. Kenneth A. Lambert, Fundamentals of Python
2. Clinton W. Brownley, Foundations for Analyics with Python
3. James Payne, Beginning Python using Python2.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
COURSE OUTCOMES: By the end of the course students will be able to:

COI: Develop programs using Lists, Tuples, Strings, Dictionaries and Sets.
CO2: Apply concepts of Object-Oriented Programming and usage of GUI Controls in programs.

w
CHAIRPERSON
BOS in Computer Science
Bhavan's Vivekananda College
)

Sainikpuri

lTlPage
 ffirBrWffi
BHAVAN'S VIVEKANANDA COLLEGE
Of Science, Humanities and Commerce, Sanikpuri
Autonomous College lAffiliated to Osmania University
Accredited with ,A, Grade by NAAC
Department of Computer Science
PRO GRAM NAIUE T-B: pu ter S cien ce)
lt._(ggm
c o uRSE *o,ffi if
,l1:,':rile s p.eu o s r, e et
Skill Enhancement Course (SEC - 4)
COURSE CODE: SE425B
P.P.W:2
YEAT{/SEMESTER: IIAV
NO. OF CREDITS: 2
couRsE OBJECTIVE: To enable students with the concepts of spread
formulae and charts.
sheets to apply scientific

cobl: To describe the various Functions in worksheet.

COb2: To illustrate Conditional Formatting concepts.

1' To demonstrate aggregate functions, text functions, date & time functions, mathematical &
trigonometric functions.

2' create a column chart by including chart formats of labels

X and y axis, gridlines, titles and legends
for the given data.

A B
1 Favorite lreats Number of
2 is
a
4A
4 Cookies 80
5 Pizza 1 2

3' create a bar chart, cgmp{ilg two groups of data, add background image, by including chart
of labels X and y axis, gridlines, tities and legends. formats

Stand
Lemonade Annie's Profit Billy,s profit
Monday 15 20
Tuesday 20 15
Wednesday 30 25
Thursday 3 l0
Friday 7.5 l0

18 lPage

RPERSON
_ BOS in Computer Scianea fii?'l?hltf,:'E:'l
Btuvan's V-ivekana nda Co[e ge
Sainikgurl
4, Create a Pie Chart comparing two groups of data, chart formats including labels, titles and legends
Enough Sleep
Yes 175
No 325

5. Create a Calendar for the year 2020-2021 in a single Spreadsheet using FILL option.

6. Create a Student Marks list table with the following format.

Bhavan's Vivekananda College

Students Details

class:_ Yea r Teacher-

Name Addr€ss Marks Total

Average
S.no Flrst nam€ Laste name Full name H. No Clty state 1st Yr 2nd Yr 3rd Yr Marks
1
2
3

o Combine First and Last name and display in Full name column using functions.
o Display the State in upper case.
o Calculate Total and Average.

7, Create a Student Marks sheet of l0 students with 6 subjects and calculate Total, Average, Result
and Grade using the following condition:
Grade (Averag*9O A+, Average <90 &&> 80 A, Average <80 &,&> 70 B*, Average<TO &&>60
B, Average <60 &&>50 C, Less than 40 Fail).
Display all the subject marks in red colour which it is <35.
Display the total marks in green colour where the total is more than 500.
Display the result Fail in red colour with bold.

8. Create an employee work sheet with the following columns (EID, NAME, SALARY,
DEPT-NAME) Enter l0 records,
o
Display all the employees working for Sales dept.
o
Display all the employees working for accounting dept whose Salary >50000.
o
Use pivot table and pivot chart to display the count of employees in each department.
o
Use pivot table to display the sum of salary for each department using sub- total option.
Note: Implement the above problem solution using Filters, Pivot tables, Pivot chart, sub-total
option.

ASsociat
IRPERSON OI t^tlitf';:'l,
BOS in Computor Science BCFI
Bhavan's Vivekananda College
Sainiiipurl
lglPage
 -
9. The Overall Averages range from 44 to 85. Color each grade depending on a scale using Conditional
Formatting.
- A different color will apply to the following grades:
. 50 and below
o 5l to 60
. 6l to70
o 7lto80
o 8l and above
B n E H
1 Steven Ann Raynrond
2 I,ilaths 76 B9 43 ,48 51 76 87 56
3 English 55 85 ,o 61 47 a7 91 73
,1 Science 65 39 5B 52 b5 57 15
5 History 45 56 72 19 56 to 56
ti
7
;U
Geography
Art
Computer Studies
51
43
63
84
63
95
54
49
45
64
62
59
.17

39
41
61
B9
92
67
64
B9
67
63
52
I
'l Fre nc h 35 91 65 26 28 51 92 56 J
10
'1'1
Overall Average 54 13 85 00 53 63 56 25 44 25
1
72 50 78 13 58 50

concepts and using GUI controls.

COURSE OUTCOMES: By the end of the course students will be able to:

COl: Implement various Functions in work sheet.

CO2: Apply conditional Formatting concepts on data in Worksheets.

CHATHPEIlSON
BOS in Computer Sciencc
Bhavan's Vivekananda Colis ge
SainiiQurl
-

20 lPage