0% found this document useful (0 votes)
494 viewsTogether With (Python) Class-12 Term-2 2022
Uploaded by
raajeevmageshCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
494 viewsTogether With (Python) Class-12 Term-2 2022
Uploaded by
raajeevmageshCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 126
Study Material Based on the Latest CBSE Syllabus
and NCERT Textbooks
Together with®
omputer Science
with Python Language
Authors
Naveen Gupta Shailender Gupta
MPhil, MCA, M.Com, DNIT M.Sc Computer Science
‘Winner of National ICT Award, 2019 Microsoft Certified Professional
PGT Computer Science Java Certified Programmer
Teacher Mentor and Trainer
Adobe Creative Educator
Microsoft Certified Educator
Microsoft Technical Associate
(Python)
CLASS
12
TERM -2
RACHNA
SAGAR SYLLABU
tional Thinking and Programming ~ 2
Unit 1: Computat
Stack, operations on stack (push & pop). implementation of stack using list
+ Data Structure:
Unit tl; Computer Networks
+ Evolution of networking, introduction to computer networks. evolution of networking
(ARPANET. NSFNET, INTERNET)
«Data communication terminologies: concept of communication, components of data communication
(sender, receiver. message, communication media, protocols), measuring capacity of communica-
tion media (bandwidth, data transfer rate), IP address, switching techniques (Circuit switching,
Packet switching)
«Transmission media: Wired communication media (Twisted pair cable, Co-axial cable, Fiber-optic
cable), Wireless media (Radio waves, Micro waves, Infrared waves
+ Network devices (Modem, Ethemet card, R145, Repeater, Hub, Switch, Router, Gateway, WIFI card)
«Network topologies and Network types: types of networks (PAN, LAN, MAN, WAN), networking
topologies (Bus, Star, Tree)
+ Network protocol: HTTP, FTP, PPP, SMTP, TCP/P, POP3, HTTPS, TELNET, VoIP
+ Introduction to web services: WWW. Hyper Text Markup Language (HTML), Extensible
Markup Language (XML), domain names, URL, website, web browser, web servers, web
hosting
Unit Ill: Database Management
+ Database concepts: introduction to database concepts and its need
+ Relational data model: relation, attribute, tuple, domain, degree, cardinality, keys (candidate key,
primary key, alternate key, foreign key)
* Structured Query Language: introduction, Data Definition Language and Data Manipulation Lan-
guage, data type (char(n), varchar(n), int, float, date), constraints (not null, unique, primary key),
create database, use database, show databases, drop database, show tables, create table, describe
table, alter table (add and remove an attribute, add and remove primary key), drop table, insert,
delete, select, operators (mathematical, relational and logical), aliasing, distinct clause, where clause,
in, between, order by, meaning of null, is null, is not null, like, update command, delete command
* Aggregate functions (max, min, avg, sum, count), group by, having clause, joins : Cartesian product
on two tables, equi-join and natural join
(6) Interface of python with an SQL database: connecting SQL with Python, performing insert, up-
date, delete queries using cursor, display data by using fetchone(), fetchall(), rowcount, creating,
database connectivity applications
Term-2 |
S Marks Jerm-!
No Fotal 30) (15 Marks) | (15 Marks) |
Lab Test: Z 6 2
1. Python program _ ___}
2. 3 SQL Queries based on one/two table(s), 2 output le i 4
|___questions based on SQL queries
| Report file:
| Term — 1 : Minimum 15 Python programs based on Term - 1
"Syllabus
Term - 2:
| Minimum 3 Python programs based on Term-2 Sylla- 7 7 5
bus
|+ SQL Queries ~ Minimum 5 sets using one table / two
tables.
+ Minimum 2 programs based on Python - SQL
| connect fs a as Pes
| Project (using concepts learnt in Classes 11 and 12)
Term ~ | : Synopsis of the project to be submitted by the
students (documentation only, may not submit the code
3 | during Term - 1) 8 3 3
6.
t
Term - 2 : Final coding + Viva voce
| (Student will be allowed to modify their Term 1 docu-
_| ment and submit the final executable code.)
4 | Viva voce 3
Suggested Practical List
erm-2
Python Programming
Write a python program to implement a stack using list.
Database Management
Write a python program to implement a stack using list
Create a student table and insert data. Implement the following SQL commands on the student
table:
* ALTER table to add new attributes / modify data type / drop attribute
* UPDATE table to modify data
(2) + ORDER By to display data in ascending descending order
+ DELETE to remove tuple(s)
+ GROUP BY and find the min, max. sum, count and average
+ Joining of two tables.
* Similar exercise may be framed for other cases.
+ Integrate SQL with Python by importing suitable module
Suggested Reading Material
+ NCERT Textbook for COMPUTER SCIENCE (Class XII)
+ Support Materials on the CBSE website
8. Project
+ The aim of the class project is to create something that is tangible and useful using Python file
handling/ Python-SQL connectivity. This should be done in groups of two to three students and
should be started by students at least 6 months before the submission deadline. The aim here is
to find a real world problem that is worthwhile to solve.
+ Students are encouraged to visit local businesses and ask them about the problems that they are
facing. For example, if a business is finding it hard to create invoices for filing GST claims, then
students can do a project that takes the raw data (list of transactions), groups the transactions by
category, accounts for the GST tax rates, and creates invoices in the appropriate format. Students
can be extremely creative here. They can use a wide variety of Python libraries to create user
friendly applications such as games, software for their school, software for their disabled fellow
students, and mobile applications, of course to do some of these projects, some additional learning
is required; this should be encouraged. Students should know how to teach themselves.
The students should be sensitised to avoid plagiarism and violations of copyright issues while
working on projects. Teachers should take necessary measures for this. CONTENTS
Part-I
[Important Terms and Definitions, Solved Question Bank, Practice Question Bank]
5. Data Structure-Stack - 15
7. Database Management — SQL - 61
8 MYSQL with Python Interface .. - 14
9. Computer Networks (CN) ....... - 97
Part - II
[Sample Practical Paper]
« Sample Practical Paper........ - 108
Part - UI
[Practice Papers]
* Practice Papers 1 to 3 (Solved)...... 110 - 128 Qs IMPORTANT TERMS & DEFINITIONS
Q > SOLVED
* Question Bank Including
* Very Short Answer/Objective Type Questions [1 Mark]
¢ Short Answer Type Questions [2/3 Marks]
¢ Long Answer Type Questions [4 Marks]
* Competency/Case-based Questions
Q_ PRACTICE QUESTIONS
* Question Bank Including
* Very Short Answer Type Questions [1 Mark]
¢ Short Answer Type Questions [2/3 Marks]
¢ Long Answer Type Questions [4 Marks]
* Competency/Case-based Questions
Q ANSWERS TO PRACTICE QUESTIONS | |
|
| DATA STRUCTURE-STACK _
na sreeme
LEARNING OUTCOMES
After this chapter students will be able to:
+ describe the data structure along with its operations.
= understand the stack.
(SP SE SIE TS
DATA STRUCTURE USING LIST, STACKS AND QUEUES
1. Data Structure. It is a way to store a collection of arbitrary data. The data structure can be
implemented via the list, dictionary, tuple, set etc.
2. Classification of Data Structure.
2 Sse
Structure
an
Static or Fixed Dynamic
‘Structure, Structure
Non-Linear
Ds*
~~
y ’
Tree Graph
Linear DS
Linked
Sequential Lists*
Arrays Stacks Queues 12 Pagecher ewith® Computer Science (Python) 12
3. Ope nson Data Structu Some of in reverse order of their arrival. The stack is
the operations that are performed on data called Last In First Out (LIFO) arrangement.
structure are as follows: Hi a Ezz
Insertion (Addition of new elements in
the list.) East
lets
Deletion (Removal of an element from Insertion eal Deletion
tee ra
Traversal (Visiting elements of a list.) Orr
Searching (Finding an element in the rrr
list.)
4. Stack. Stack means arranging one object
over another and these objects are removed
§. Operations on Stack.
Push : Insertion of a new element (from the beginning) in stack.
[Push] [4] Pushy
[Push(2)
3} Top
2 }e Top 2
[He-top 1 1
Pop : Deletion of an element(from the beginning) in stack.
5
L>LPop P42} + Pop }>L2 [Pop OJ
1
6. Conditions associated with Stack/Queue:
© Overflow condi
full or range is overfilled with values,
: It is a situation where we are not able to add new element due to memory
© Underflow condition: It is a situation where there is no element left and we still wish to
remove an element or display the list,
7. Applications of Stack. Stack can be used to reverse a word or reverse a line and it can also used
in function call routines. SOLVED QUESTION BANK
Very Short Answer Type Questions [1 Mark]
Define data structure.
\ns. It is a way to store a collection of related
data together. The data structure can be
implemented via the list, dictionary, tuple,
set ete.
2. What is LIFO?
Last In First Out.
5. What is traversal?
Accessing each element is known as traversal.
4. Name some applications of Stack.
Application of Stack are:
(a) Reverse of a String or Line.
(b) Function call routines.
(c) Backtracking
5. Alist contains LST=[10,7,9,15,12]. 8 is added
to the list. What will be the output? If
(a) LST as Stack (6) LST as Queue
Ans. (a) LST as Stack
LST = [8,10,7,9,15,12]
(6) LST as Queue
LST = [10,7,9,15,12,8]
Short Answer Type Questions [2/3 Marks]
6. Python program to check whether the list
is empty or not.|FileName:ch-datas\QU5]
Ans. A = [J
if not A:
print(“List is empty”)
Long Answer Type Questions [4 Marks]
7. Write a program to implement the stack
using list.
Ans.s=[]
Data Structure-Stack 13
print("1. PUSH\n2. POP \n3
Display")
choice-int (input ("Enter your
choice: "))
if (choice==1):
azinput("Enter any nunber :")
s.append(a)
elif. (choice==2):
if (s=-[]):
print ("Stack Empty")
else:
print ("Deleted element
is : ",s.pop())
elif. (choice=
1slen(s)
for i in range(1-1,-1,-1):
print (s[i])
):
else:
print("Wrong Input")
c=input("Do you want to continue
or not? ")
8. Write Push(Book) and Pop(Book) methods
in Python to Add a new Book and Remove
a Book from a List of Books, considering
them to act as PUSH and POP operations
of the data structure Stack.
Ans. def push(Book)
a=input("Enter any number
Book. append (a)
def pop(Book) :
if (Book==[])
print (“Stack Empty
else
print
is:",Book.pop())
(“Deleted element
Write a menu driven python program
using funtion Push(), Pop( and Display)
to implement the stack. The program will
store the name of the books. 14
Ans.
Pogether wetk® Computer Science (Python)
def push(Book) :
name-input("Enter the book name")
Book. append(name)
def pop(Book) :
if Book=
print(
else:
Under Flow")
print ("Book Deleted” ,Book.pop())
def display (Book):
if Book==[]:
print ("Underflow!!!")
else:
print("Books in Stack")
1=1en(Book)
for i in range(1-1,-1,-1):
print(Book[i],
# main
Book=[]
while True:
print("\n1. Push\n2. Pop \n3. Display\
na. Exit")
ch=int(input (“Enter your choice")
if ch
push(Book)
elifch=
pop (Book)
elife!
display (Book)
else:
break
|. Write a menu driven python program
using function Push (), Pop () and Display)
to implement the stack, The program will
store the Employee details |.e. Employee
number, Employee name and Salary.
. def push(Emp)+
enozint(input ("Enter the Empolyee
Number") )
names input (“Enter the Employee Name")
sal-input("Enter the Salary")
Emp.append([eno, ename, sal})
def pop(Emp) +
if Emp=*[]:
print("Under Flow”)
else:
print("Employee
Deleted”, Emp. pop())
def display (Emp):
if Emp=-(]:
print("Underflow! !!")
else:
print("Employee record in Stack\n")
1=len(Emp)
for i in range(1-1,-1,-1):
print (Emp[i])
# main
Emp=(]
while True:
print("\nl.
n2. Pop \n3.
nu. Exit")
ch=int(input("Enter your choice”)
if ch==1:
push(Emp)
elif ch==2:
pop(Emp)
elif ch==3:
display (Emp)
else:
break
Recorg
Push
Display
: Competency/Case-based Question
11. Read the following code carefully which
is implementing the concept of STACK*
defisEmpty(STACK):
if len(STACK) =
Teturn True
else:
. return False
def pop(STACK):
if isEmpty (STACK):
return “Underflow”
else:
element = STACK.pop()
if len(STACK) == 0
top = None
else:
top =
return element
Jen(STACK) - 2
_ 4 (a) How are the above two functions inter-
related?
The function isEmpty(STACK) will be
called when pop(STACK) is called
(b) What is the difference in between
STACK pop() and pop(STACK)
STACK.pop() is pre defined and
pop(STACK) is user defined
(c) What is the retum type of the function
defisEmpty (STACK)
PRACTICE QUESTIONS
Very Short Answer Type Questions [1 Mark]
Write the full form FIFO.
A list contains LST=[10,7,9,15,12]. An
element is removed. What will be the output?
If
(a) LSTas Stack (6) LST as Queue
Which method accepts two arguments
(index,element)? If the index is more than
the size, then it will insert at the end.
Data Structure-Stack 15
©» Boolean
(d) What will the pop(STACK) function
return if the stack already consist
of [‘A’’B’] at the position 0 and I
respectively
An B
(c) if len(STACK) == 0: What is the
purpose of this line in the above code:
\ns. It checks if the stack is already empty.
4. Which is a situation when there is no element
left and still wish to remove element?
Long Answer Type Questions [4 Marks]
5, Write algorithm for PUSH(insert) operation
in stack.
Write algorithm for POP(Remove) operation
in stack.
2
ANSWERS TO PRACTICE QUESTIONS
1
2
a
First in first out.
(a) LST as Stack
LST = [7,9,15,12]
(b) LST as Queue
LST = [10,7,9,15,12]
. Insert()
Underflow
. Algorithm for PUSH in stack
1, Start
2.Element = Input("Enter the value to
be added as element in Stack.")
3.Stak.append(Element) # Stak is the
mame of Stack. append() is used to
insert the
# element in the end of stack.
4, Top=Tope1
5. End.
. Algorithm for POP in stack.
Start
StakLen = len(Stak)
# len() is used to calculate the length
of the Stack.
if StakLen <=0
To check whether stack is empty or not
Print("Pop is not possible as stack is
empty")
else:
val = Stak.pop()
® pop() is used to remove the last
inserted element in Stack
top = top-1
return top
End
2 DATABASE MANAGEMENT — SQL
LEARNING OUTCOMES
After going through this chapter students will be able to:
* understand RDBMS and its advantages
+ explain SQL and other related terminologies
compare and apply various keys in their relations
recognise the categories of SQL command
deploy the constraints in the table
identify the operator, clauses and functions
practice SQL commands
‘Soar eR CE RENEE AMBRE WE og ese
IMPORTANT TERMS & DEFINITIONS
z.
Data. It can be described as the raw of facts
and figures.
. Information. Processing of data into
meaningful form is called information.
. Database. Organised collection of logically
related data.
. DBMS. Data Base Management System. A
computer system that allows us to manage
Databases.
. Need for DBMS. Database provides
centralised control on its operational data.
Thus, with the help of a database
» redundancy can be reduced.
» inconsistency can be avoided.
« data integrity is maintained.
+ data can be shared.
security restrictions can be imposed.
6. Data Redundancy. Duplication (Replication)
of data is known as Data Redundancy.
7. Data Inconsistency. It is a situation/problem
where the same data is stored in two different
files in a different format.
. Data Security. Protection of data from
unauthorised persons against accidental’
intentional addition or modification or
deletion.
=
»
Data Privacy: It ensures security of data and
governs who has access to data.
10. Relation. Itis a two dimensional format which
contains rows and columns. A relation is also
known as a Table.
+ Domain. A set of unique values allowed for
@ column is known as its domain.
. Tuple. A row/record in a relation or #
horizontal subset is known as table. 4. Cardinalit
18. P:
Aw © A column/ Field in a relation or
vertical subset.
Number of rows in a relation
denotes cardinality of the table.
Number of columns in a relation
16. SQL: Stands for Structured Query Language,
Itisa standard programming language used to
store, retrieve and manage data in relational
databases.
. Candidate Key: A column or a set of columns
which uniquely identify a row in a relation.
A table/relation can have multiple candidate
keys.
ry Key: A column or a set of columns
which can uniquely identify a row in a
relation.
. Alternate key: A candidate key which is nota
primary key but can serve as a primary key.
Foreign Key: It is a column that references
the primary key of another table.
. DDL: Stands for Data Definition Language.
It is a category of SQL command which is
used to manipulate database objects like table
structure. Examples of DDL commands are:
Create Table, Alter Table, Drop Table. Create
23
23.
24,
25.
26.
Database Management-SQL 17
UML. Stands for Data Manipulation Language.
It is a category of SQL command which is
used to manipulate the data. Examples of
DML commands are Insert, Delete, Update
and Select.
Arithmetic Operator are the operator used for
mathematical calculation e.g. +, -, *, /, Ye
Relational Operators. These operators are
used to compare two values or a column with
value in SQL. Different relational operators
are >(less than), >=(less than or equal to),
<(greater than), <=(greater than or equal to),
=(equal to), ! < > (not equal to).
Logical Operators. These operators are used
to combine two or more conditions. Different
logical operators are AND(&&), OR(),
NOT(!)
Data Type. Data type is required to specify
that what sort of value will be shared in
Particular column. It is important for the
overall optimization of our database.
MySQL Data Types:
* Numeric Types
* String Types ©
parameter sade set
See apa 18
Pogether week® Computer Science (Python)—12
TEXT
Description
Holds up to 255 characters and allows,
a fixed length string.
Holds up to 255 characters and allows
a variable length string. If you store
characters greater than 55, then the data
type will be converted to TEXT type.
Allows a string with a maximum length
of 65,535 characters
Storage
(Declared column length of
characters * Number of bytes)
<= 255
+ String value(Len) + 1 WHERE.
column values require 0 ~ 255.
bytes
+ String value(Len) + 2 bytes
WHERE column values may
require more than 255 bytes
Actual length in bytes of String
value(Len) + 2 bytes, where Len
<216
Date and Time Data Type
; the date values in the
: YYYY-MM-DD, where}, 27. Create Table. This is a DDL Command used
to create anew table, We can specify the table
name, column name with its data-type.
Syntax
Create table