Class 12 CBSE

Chapter 5: File Handling in Python

Chapter 6: Recursion

Chapter 9: Data Structures - Stacks and Queues using Lists

Comments

Post a Comment

Popular posts from this blog

Recursion in Python

Recursion is an approach to solve a problem which involves a function calling itself either directly or indirectly. Such a function is known as a recursive function. Every recursive method must have a base case which would stop calling the function again and again indefinitely, because the function stack has a limit, which is platform dependent. A Python program to print a string backwards using a recursive function. def reverse(s, n):     if n > 0:         print(s[n], end = '')         reverse(s, n - 1)     elif n == 0:         print(s[0]) s = input('Enter the string: ') reverse(s, len(s) - 1) A Python program to calculate a b using a recursive function. def power(a, b):     if b == 0:         return 1     else:         return a * power(a, b - 1) a = int(input('a = ')) b = int(input('b = ')) p = power(a, b) print('a to the power b: ' + str(p)...
Read more

Encrypt Program ISC Specimen 2023 Theory

A class Encrypt has been defined to replace only the vowels in a word by the next corresponding vowel and forms a new word, i.e. A → E, E  → I, I  → O, O  → U and U  → A. Example : Input: COMPUTER Output: CUMPATIR Some of the members of the class are given below: Class name : Encrypt Data members/instance variables : wrd: to store a word len: integer to store the length of the word newWrd: to store the encrypted word Methods/Member functions : Encrypt(): default constructor to initialize data members with legal initial values void acceptWord(): to accept a word in uppercase void freqVowCon(): finds the frequency of the vowels void nextVowel(): replaces only the vowels from the word stored in 'wrd' by the next corresponding vowel and assigns it to 'newWrd', with the remaining alphabets unchanged void disp(): displays the original word along with the encrypted word Specify the class Encrypt giving details of the constructor, void acceptWord(), void freqVowCon(), void ...
Read more

Stack Program ISC Computer Science 2022 Semester 2 Theory

A stack is a kind of data structure which can store elements with the restriction that an element can be added or removed from the top end only. The details of the class Stack is given below: Class name : Stack Data members/instance variables : cha[]: array to hold the characters size: stores the maximum capacity of the stack top: to point the index of the topmost element of the stack Member functions/methods : Stack(int m): constructor to initialize the data member size = m, top = -1 and create the character array void pushChar(char v): to add characters from the top end if possible else display the message "Stack full" char popChar(): to remove and return characters from the top end, if any, else returns '$' void display(): to display elements of the stack Specify the class Stack, giving details of void pushChar(char) and char popChar(). Assume that the other functions have ben defined. The main() function and algorithm need not be written. import java.util.Scanner...
Read more