INLAB-7

INLAB-7

Q.In a small village library, books are lended to the members for a period of one week. Details such as name of the book, author, date of purchase, accession number and availability status are stored for each book. Given the details of the 'n' books sorted by the accession number of book and an accession number to search, develop an algorithm and write the Python code to perform binary search in the given data. Print 'Found' or 'Not Found' appropriately.
Input Format
First line contains the number of books in the library, n
Next n*5 lines contains the details of the book in the following order:
name of the book
author of the book
date of purchase of the book
accession number of the book
availability status of the book
Next line contains the accession number of book to be searched 'n'
Output Format
Print Found or Not Found







INPUT:

First line contains the number of books in the library, n
Next n*5 lines contains the details of the book in the following order:
name of the book
author of the book
date of purchase of the book
accession number of the book
availability status of the book
Next line contains the accession number of book to be searched 'n'

OUTPUT:

Print Found or Not Found

PROGRAM:

n=int(input())
l=[]
l1=[]
l2=[]
l3=[]
l4=[]
for i in range(n):
    name=input().rstrip()
    author=input().rstrip()
    date=input().rstrip()
    accnum=int(input())
    avail=input().rstrip()
    l.append(accnum)
    l1.append(name)
    l2.append(author)
    l3.append(date)
    l4.append(avail)

l.sort()

entry=int(input())
i = 0
j = len(l)
while i < j:
    middle = int((i + j) // 2)
    if entry > l[middle]:
        i = middle + 1
    else:
        j = middle

if i==len(l):
    print("Not Found")
else:
    print("Found")

PROCESSING INVOLVED:

i=0
j=len(j)
while i < j:
    middle = int((i + j) / 2)
    if entry > l[middle]:
        i = middle + 1
    else:
        j = middle

if i==len(l):
    print("Not Found")
else:
    print("Found")


PSEUDO CODE:


READ n
START 5 empty lists, l, l1, l2, l3, l4
FOR i in n
    READ name
    READ author
    READ date
    READ accnum
    READ avail
    ADD name in l1, author in l2, date in l3, avail in l4 and accnum in l
END FOR
SORT list l
READ entry
LET i=0
j= LENGTH of l
WHILE i<j
    middle=(i+j)/2
    IF entry>l[middle]
        i=middle+1
    ELSE
        j=middle
    END IF
IF i=LENGTH(l)
    PRINT "Not Found"
ELSE
    PRINT "Found"
END IF

Comments

Post a Comment

Popular posts from this blog

MATLAB WEEK-2

Image
MATLAB Plotting of curves and surfaces Week: 2 METHOD 1 x=linspace(0,1,101) plot(x,x.^3, 'r+' ,x,sin(x), 'b-' ,x,exp(x), 'g.' ) METHOD 2 using Hold on clear all x=linspace(0,1,101) plot(x,x^3, 'r*' ) hold on plot(x,sin(x), 'g.' ) hold on plot (x,exp(x), 'b+' ) If we remove hold on, only last graph will be displayed. METHOD 3 using subplot x=0:.1:2*pi; subplot(2,2,1); plot (x,sin(x)); subplot(2,2,2); plot(x,cos(x)); subplot(2,2,3); plot(x,exp(-x)); subplot(2,2,4); plot(x,sin(3*x)); Diffrentiation syms x y f=x^2+2*x*y+y*sin(x) diff(f,x) diff(f,y) f =2*x*y + y*sin(x) + x^2 ans = 2*x + 2*y + y*cos(x) ans = 2*x + sin(x) Integration syms x f=x^3 + 3*x^2 + 5*x + 12 int(f,x,0,2) f = x^3 + 3*x^2 + 5*x + 12 ans = 46 Plotting graph syms x f=sin(2*x)+ cos(3*x) ezplot(f) ...
Read more

PRACTICE PROBLEM 8

Image
PRACTICE PROBLEM 8 Verification of 'L' shaped arrangement of Coins on Game Board (Id-2435) Consider a nxn board game with four types of coins red, green, blue and yellow. Given the state of the board with coins in all cells, develop an algorithm and write a C program to check if the same coins are placed in ‘L’ shape on the board. The number of cells in the vertical and horizontal line of ‘L’ shape should be same and should be greater than 1. Red coins are represented by ‘r’, blue coins are represented by ‘b’, green coins are represented by ‘g’ and yellow coins are represented by ‘y’.  For example, given the configuration of a 4 X 4 board with coins as shown below, b r y r r r y b y r b b b r r r the program must print 'Yes'. As there is a 'L' shape as shown in the figure below. Input Format Number of rows, r Number of columns, c Next ‘r x c’ lines contains the elements in the matrix Elements in the matrix given row by row ...
Read more

Practice Problem 6-Isomorphic Numbers

ISOMORPHIC NUMBERS Given ‘n’ integers, write an algorithm and the subsequent Python code to print all numbers that are isomorphic to the first number. Two numbers with non-distinct (numbers in which digits get repeated) are said to be isomorphic if they have the same number of digits in it and the sets of positions  having the same  digits are equal.. For example: • 12321 is isomorphic to 83538 . Both the  numbers are of length five.  In 12321, positions 2 and 4 have the same digit 2, Positions 1 and 5 have same digit 1. Hence the set of positions having the same digit are {{1,5},{2,4}. Similarly , for the number 83538, the set of positions having the same digit is {{1,5}, {2,4}}. • 1232 is not isomorphic to 2342 because set of places having same digits for 1232 is {{2, 4}} and for 2342 is {{1, 4}} (digits are numbered from left to right starting from 1). • 12 is not isomorphic to 10. Write a function to check whether two  numbers are isomorphic....
Read more