Create the following student table and answer the following queries.

 

Table: Student

No	Name	Age	Dept	DateofAdm	Fee	Gender
1	Pankaj	24	Computer	10/01/99	12000	M
2	Shalini	21	History	24/03/20	20000	F
3	Sanjay	22	Hindi	12/12/21	30000	M
4	Sudha	24	History	01/07/21	25000	F
5	Rakesh	22	Computer	27/12/21	30000	M
6	Shakeel	20	Hindi	31/07/99	21000	M

a)     a)  List the names of female students who are in Hindi Department

b)   b) List the names of all the students with their date of admission in ascending order.

c)   c)  Display student’s name,fee and age for male students only.

d)   d) Count the number of students with age <23.

e)   e) Change the fee of students whose fee is <15000.

Source code and Output:

Stack Program 2 Write a menu based python program to implement the the operations insert, delete, peek and display on stack.

 Member details: 

MemberNo                     integer

MemberName                String

Age                                integer

def isEmpty(stk):

   if stk==[]:

       return True

   else:

       return False

def push(stk,item):

    stk.append(item)

    top=len(stk)-1

def pop(item):

    if isEmpty(stk):

        return "underflow"

    else:

        item=stk.pop()

        if len(stk)==0:

            top=None

        else:

            top=len(stk)-1

        return item

def peek(stk):

    if isEmpty(stk):

        return "underflow"

    else:

        top=len(stk)-1

        return stk[top]

def Display(stk):

    if isEmpty(stk):

        print("stack empty")

    else:

        top=len(stk)-1

        print(stk[top],"<-top")

        for a in range(top-1,-1,-1):

            print(stk[a])

#main

stk=[]

top=None

while True:

    print("STACK OPERATIONS")

    print("1.push")

    print("2.pop")

    print("3.peek")

    print("4.display")

    ch=int(input("enter your choice(1-4)"))

    if ch==1:

        mno=int(input("enter the member number"))

        mname=input("enter the member name")

        age=int(input("enter the age of member"))

        item=[mno,mname,age]

        push(stk,item)

    elif ch==2:

        item=pop(stk)

        if item=="underflow":

            print("underflow")

        else:

            print("popped item is",item)

    elif ch==3:

        item=peek(stk)

        if item=="underflow":

            print("underflow")

        else:

            print("topmost item is",item)

    elif ch==4 :

        Display(stk)

    else:

       print("invalid")

Output

enter the member number2

enter the member namesathish

enter the age of member35

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

enter your choice(1-4)1

enter the member number3

enter the member namesuresh

enter the age of member36

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

enter your choice(1-4)3

topmost item is [3, 'suresh', 36]

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

enter your choice(1-4)4

[3, 'suresh', 36] <-top

[2, 'sathish', 35]

[1, 'umesh', 34]

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

enter your choice(1-4)2

popped item is [3, 'suresh', 36]

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

enter your choice(1-4)4

[2, 'sathish', 35] <-top

[1, 'umesh', 34]

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

enter your choice(1-4)2

popped item is [2, 'sathish', 35]

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

enter your choice(1-4)4

[1, 'umesh', 34] <-top

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

enter your choice(1-4)2

popped item is [1, 'umesh', 34]

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

enter your choice(1-4)2

underflow

STACK OPERATIONS

1.push

2.pop

3.peek

4.display

Stack based program 3 Write a Python Program to implement a Stack for the book details (bookno,bookname). That is, each item node of the stack contains two types of information- a book number and its name. Implement all the operations of Stack.

 

#source code:

def isEmpty(stk):

    if stk==[]:

        return True

    else:

        return False

def push(stk,item):

    stk.append(item)

    top=len(stk)-1

def pop(stk):

    if isEmpty(stk):

        print("underflow")

    else:

        item=stk.pop()

        if len(stk)==0:

            top=None

        else:

            top=len(stk)-1

        return item

def peek(stk):

    if isEmpty(stk):

        return "underflow"

    else:

        top=len(stk)-1

        return stk[top]

def display(stk):

    if isEmpty(stk):

        print("underflow")

    else:

        top=len(stk)-1

        print(stk[top],"<-top")

        for a in range(top-1,-1,-1):

            print(stk[a])

#main

stk=[]

top=None

while True:

    print("STACK OPERATIONS")

    print("1. Push")

    print("2. pop")

    print("3. peek")

    print("4. display")

    ch=int(input("enter choice"))

    if ch==1:

        bno=int(input("enter bookno to be inserted:"))

        bname=input("enter book name to be inserted:")

        item=[bno,bname]

        push(stk,item)

    elif ch==2:

        item=pop(stk)

        if item=="underflow":

            print("underflow")

        else:

            print("popped item is",item)

    elif ch==3:

        item=peek(stk)

        if item=="underflow":

            print("underflow")

        else:

            print("topmost item is:",item)

    elif ch==4:

        display(stk)

    else:

        print("invalid choice")

Output:

Create a dictionary of students to store names and marks obtained in 5 subjects

students=dict()

n=int(input("How many Students are there :"))

for i in range (n):

                sname = input (" Enter the name of the student :")

                marks =[]

                for j in range (5):

                                mark = float (input("enter marks : "))

                                marks.append(mark)

                students[sname] = marks

print ( "created dictionary of students is ", students )                                

name=input("enter name of the student ")

if name in students.keys():

                print (students [name])

else:

                print (" no student found with this name")

Output:

How many Students are there :3

 Enter the name of the student :sh

enter marks : 45

enter marks : 46

enter marks : 48

enter marks : 40

enter marks : 49

 Enter the name of the student :h

enter marks : 45

enter marks : 34

enter marks : 37

enter marks : 29

enter marks : 45

 Enter the name of the student :m

enter marks : 48

enter marks : 40

enter marks : 34

enter marks : 50

enter marks : 38

created dictionary of students is  {'sh': [45.0, 46.0, 48.0, 40.0, 49.0], 'h': [45.0, 34.0, 37.0, 29.0, 45.0], 'm': [48.0, 40.0, 34.0, 50.0, 38.0]}

enter name of the student s

 no student found with this name

======= RESTART: C:/Users/acer/AppData/Local/Programs/Python/Python310/SHAMBHAVEE MISHRA 11 TH D 16TH PROGRAMME.py =======

How many Students are there :3

 Enter the name of the student :sh

enter marks : 45

enter marks : 46

enter marks : 48

enter marks : 40

enter marks : 49

 Enter the name of the student :h

enter marks : 45

enter marks : 34

enter marks : 37

enter marks : 29

enter marks : 45

 Enter the name of the student :m

enter marks : 48

enter marks : 40

enter marks : 34

enter marks : 50

enter marks : 38

created dictionary of students is  {'sh': [45.0, 46.0, 48.0, 40.0, 49.0], 'h': [45.0, 34.0, 37.0, 29.0, 45.0], 'm': [48.0, 40.0, 34.0, 50.0, 38.0]}

enter name of the student sh

[45.0, 46.0, 48.0, 40.0, 49.0]

To print the highest and lowest values in the dictionary

 

Write a Python program to get the maximum and minimum value in a dictionary.

Sample Solution:-

Python Code:

my_dict = {'x':500, 'y':5874, 'z': 560}

key_max = max(my_dict.keys(), key=(lambda k: my_dict[k]))
key_min = min(my_dict.keys(), key=(lambda k: my_dict[k]))

print('Maximum Value: ',my_dict[key_max])
print('Minimum Value: ',my_dict[key_min])

Sample Output:

Maximum Value:  5874                                                                                          
Minimum Value:  500

Python Program to create a dictionary having state names and their capitals

 

Python Program for Binary Search( Iterative method)

 

In  this search algorithm takes advantage of a collection of elements that is already sorted by ignoring half of the elements after just one comparison. 

1. Compare x with the middle element.
2. If x matches with the middle element, we return the mid index.
3. Else if x is greater than the mid element, then x can only lie in the right (greater) half subarray after the mid element. Then we apply the algorithm again for the right half.
4. Else if x is smaller, the target x must lie in the left (lower) half. So we apply the algorithm for the left half.

# Iterative Binary Search Function

# It returns index of x in given array arr if present,

# else returns -1

def binary_search(arr, x):

    low = 0

    high = len(arr) - 1

    mid = 0

 

    while low <= high:

 

        mid = (high + low) // 2

 

        # If x is greater, ignore left half

        if arr[mid] < x:

            low = mid + 1

 

        # If x is smaller, ignore right half

        elif arr[mid] > x:

            high = mid - 1

 

        # means x is present at mid

        else:

            return mid

 

    # If we reach here, then the element was not present

    return -1

 

 

# Test array

arr = [ 2, 3, 4, 10, 40 ]

x = 10

 

# Function call

result = binary_search(arr, x)

 

if result != -1:

    print("Element is present at index", str(result))

else:

    print("Element is not present in array")