Sponsor Area
Evaluate the following Postfix notation of expression:
4,2,*,22,5,6,+,/,-
| Element | Stack Contents |
| 4 | 4 |
| 2 | 4,2 |
| * | 8 |
| 22 | 8, 22 |
| 5 | 8, 22, 5 |
| 6 | 8, 22, 5, 6 |
| + | 8, 22, 11 |
| / | 8, 2 |
| - | 6 |
Differentiate between file modes r+ and rb+ with respect to Python.
Difference b/w r+ and rb+ with respect to Python
| r+ | rb+ |
| r+ Opens a file for both reading and writing. The file pointer placed at the beginning of the file. | rb+ Opens a file for both reading and writing in binary format. The file pointer placed at the beginning of the file. |
Evaluate the following postfix notation of expression. Show status of the stack after every operation.
22,11,/,14,10,,+,5,2
| Element | Stack |
| 22 | 22 |
| 11 | 22, 11 |
| / | 2 |
| 14 | 2,14 |
| 10 | 2,14,10 |
| - | 2,4 |
| + | 6 |
| 5 | 6,5 |
| - | 1 |
Write a statement in Python to perform the following operations:
f1 = open('BOOK.TXT','r')
f2 = open('BOOK.TXT','w')Write a method in python to write multiple line of text contents into a text file myfile.txt line.
Numbers=[9,18,27,36]
def writel():
f = open('myfile.txt','w')
while True:
line = raw_input('Enter line')
f.write(line)
choice = raw_input('Are there more lines')
if choice == 'N':
break
f.close()Consider the following definition of class Staff, write a method in python to search and display the content in a pickled file staff.dat, where Staff code is matching with ‘S0105’.
class Staff:
def __init__(self,S,SNM):
self.Staffcode=S
self.Name=SNM
def Show(self):
print(self.Staffcode,' ',
self.Name)
def search():
f = open(“staff.dat”, ‘rb’)
try:
while True:
e = pickle.load(f)
if e.Staffcode == ‘S0105’:
e.Show()
except EOFError:
pass
f.close()Write PUSH (Books) and POP (Books) methods in python to add Books and remove Books considering them to act as Push and Pop operations of Stack.
def push(Books):
Stack.append(Books)
print 'Element:', Book, 'inserted successfully'
def pop():
if Stack == []:
print('Stack is empty!')
else:
print('Deleted element is',Stack.pop())Write a method in python to find and display the prime numbers between 2 to N. Pass N as an argument to the method.
def prime_numbers(N):
for I in range(2, N+1):
M = I // 2
IsPrime=1
for J in range(2, M+1):
if I % J == 0:
IsPrime=0
break
if IsPrime==1:
print(I)Evaluate the following postfix notation of expression. Show status of the stack after every operation.
84, 62, –, 14, 3, *, +
Stack status of every operation is given below:
| Element | Stack |
| 84 | 84 |
| 62 | 84,62 |
| - | 22 |
| 14 | 22,14 |
| 3 | 22, 14, 3 |
| * | 22, 42 |
| + | 64 |
Sponsor Area
Sponsor Area