0% found this document useful (0 votes)
6 views2 pages

Board Practical Programs1

The document outlines practical programming tasks for Class XII Sec D, which include various programming exercises such as word counting, file copying, stack operations, palindrome checking, and SQL queries. Each task is designed to enhance students' programming skills in different areas, including data structures and database management. Additionally, the document provides specific examples and constraints for each program to guide students in their implementations.

Uploaded by

mitraujan98
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views2 pages

Board Practical Programs1

The document outlines practical programming tasks for Class XII Sec D, which include various programming exercises such as word counting, file copying, stack operations, palindrome checking, and SQL queries. Each task is designed to enhance students' programming skills in different areas, including data structures and database management. Additionally, the document provides specific examples and constraints for each program to guide students in their implementations.

Uploaded by

mitraujan98
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Board Practical Programs(for Practical file)

Class: XII Sec: D


You will append these programs with previous practical file that you had submitted to half yearly
examination.
1. Write a program to search total count of the words starts and ends with same alphabet from a file
“WELCOME.CSV”.
2. Write a program to copy the content of a file “SOURCE.TXT” to another file“Destination.txt”.
3. Write a program to create a stack named STUDENT that will perform the following operations:
i. push(): to push 5 user given data
ii. pop(): to pop existing 2 data from stack
iii. peek(): to show present index position of the stack
iv. show(): to display the updated stack.
4. Write a program to take a string from user and reverse the string using stack.
5. Write a program to check a user given number is palindrome or not using stack.
6. Write a program to take two positive integers m and n, where m < n, and to determine how many
unique-digit integers are there in the range between m and n (both inclusive) and output them. A
unique digit integer is a positive integer (without leading zeros) with no duplicate digits. For
example, 7, 135, 214 are all unique-digit integers whereas 33, 3121, 300 are not.
7. A number is said to be a Goldbach number, if the number can be expressed as the addition of
two odd prime number pairs. If we follow the above condition, then we can find that every even
number larger than 4 is a Goldbach number because it must have any pair of odd prime number
pairs. Example: 6 = 3, 3 (One pair of odd prime) 10 = 3, 7 and 5, 5 (Two pairs of odd prime)
Write a program to enter any positive even natural number ‘N’ where 1 ≤ N ≤ 50 and generate
odd prime twin of ‘N’.
8. Write an SQL query to enforce the following constraints on the table named Student.
i. Marks must be greater than or equal to 0 and less than or equal to 100.
ii. RollNo should be unique.
9. Consider the following sample tables:

Table: Students

RollNo Name Class TeacherID

101 Alice 12 1

102 Bob 12 1

103 Charlie 11 2

104 David 11 2

Table: Teachers

1
TeacherID Name Subject

1 Mr. Smith Mathematics

2 Ms. Johnson English

i. Write an SQL query to display the student name, class, and the subject taught by their teacher.
ii. Write an SQL query to display the names of students who are taught by "Mr. Smith."
10. Write a program to show all the four digits Tech numbers. A Tech number is a number that has
an even number of digits and if the number is split into two equal halves (From the middle), then
the square of the sum of these halves is equal to the number itself.
Example: N=2025
First half= 20
Second half=25
(20+25)2
452 =2025
11. Write a program to take two strings from user and check these strings are anagram to each other
or not. Ignore case sensitivity. An anagram of a string is another string that contains the same
characters, only the order of characters can be different.
Example:
S1=”flow”
S2=”wolf”
S1 and S2 are anagram to each other.

You might also like