LONGEST, SHORTEST WORD ASCENDING, DESCENDING STRINGS




239.  WAP to enter any ten strings and display the longest strings.
CLS
INPUT "ENTER FIRST STRING"; A$
FOR I = 2 TO 10
INPUT "ENTER NEXT STRING"; B$
IF LEN(B$) > LEN(A$) THEN A$ = B$
NEXT I
PRINT "LONGEST STRING="; A$
END

USING SUB PROCEDURE
DECLARE SUB LON( A$ )
CLS
INPUT "ENTER FIRST STRING"; A$
CALL LON (A$)
END
SUB LON (A$)
FOR I = 2 TO 10
INPUT "ENTER NEXT STRING"; B$
IF LEN(B$) > LEN(A$) THEN A$ = B$
NEXT I
PRINT "LONGEST STRING="; A$
END SUB

USING FUNCTION PROCEDURE

DECLARE FUNCTION LON$( A$ )
CLS
INPUT "ENTER FIRST STRING"; A$
PRINT "LONGEST STRING=";  LON (A$)
END
FUNCTION LON (A$)

FOR I = 2 TO 10
INPUT "ENTER NEXT STRING"; B$
IF LEN(B$) > LEN(A$) THEN A$ = B$
NEXT I
LON$ = A$
END FUNCTION






240.  WAP to enter any ten strings and display the shortest string.
CLS
INPUT "ENTER FIRST STRING"; A$
FOR I = 2 TO 10
INPUT "ENTER NEXT STRING"; B$
IF LEN(B$) < LEN(A$) THEN A$ = B$
NEXT I
PRINT "SHORTEST STRING="; A$
END
USING SUB PROCEDURE
DECLARE SUB SHRT( A$ )
CLS
INPUT "ENTER FIRST STRING"; A$
CALL SHRT (A$)
END
SUB SHRT (A$)
FOR I = 2 TO 10
INPUT "ENTER NEXT STRING"; B$
IF LEN(B$) < LEN(A$) THEN A$ = B$
NEXT I
PRINT "SHORTEST STRING="; A$
END SUB

USING FUNCTION PROCEDURE

DECLARE FUNCTION SHRT$( A$ )
CLS
INPUT "ENTER FIRST STRING"; A$
PRINT "SHORTEST STRING=";  SHRT$(A$)
END
FUNCTION SHRT$(A$)
FOR I = 2 TO 10
INPUT "ENTER NEXT STRING"; B$
IF LEN(B$) < LEN(A$) THEN A$ = B$
NEXT I
SHRT$ = A$
END FUNCTION



241. WAP to enter any ten strings and sort in ascending order.
CLS
DIM N(10) AS STRING
FOR I = 1 TO 10
INPUT "ENTER THE STRINGS"; N(I)
NEXT I
FOR I = 1 TO 10
FOR J = 1 TO 10 - I
IF N(J) > N(J + 1) THEN SWAP N(J), N(J + 1)
NEXT J
NEXT I
PRINT "STRINGS ARRANGED IN ASCENDING ORDER"
FOR I = 1 TO 10
PRINT N(I)
NEXT I

END

USING SUB PROCEDURE

DECLARE SUB SORT (N())
CLS
DIM N(10) AS STRING
FOR I = 1 TO 10
INPUT "ENTER THE STRINGS"; N(I)
NEXT I
CALL SORT(N())
PRINT "STRINGS ARRANGED IN ASCENDING ORDER"
FOR I = 1 TO 10
PRINT N(I)
NEXT I
END


SUB SORT (N())
FOR I = 1 TO 10
FOR J = 1 TO 10 - I
IF N(J) > N(J + 1) THEN SWAP N(J), N(J + 1)
NEXT J
NEXT I

END SUB


242. WAP to enter any ten strings and sort in descending order.
CLS
DIM N(10) AS STRING
FOR I = 1 TO 10
INPUT "ENTER THE STRINGS"; N(I)
NEXT I
FOR I = 1 TO 10
FOR J = 1 TO 10 - I
IF N(J) < N(J + 1) THEN SWAP N(J), N(J + 1)
NEXT J
NEXT I
PRINT "STRINGS ARRANGED IN DESCENDING ORDER"
FOR I = 1 TO 10
PRINT N(I)
NEXT I

END

USING SUB PROCEDURE

DECLARE SUB SORT (N())
CLS
DIM N(10) AS STRING
FOR I = 1 TO 10
INPUT "ENTER THE STRINGS"; N(I)
NEXT I
CALL SORT(N())
PRINT "STRINGS ARRANGED IN DESCENDING ORDER"
FOR I = 1 TO 10
PRINT N(I)
NEXT I
END


SUB SORT (N())
FOR I = 1 TO 10
FOR J = 1 TO 10 - I
IF N(J) < N(J + 1) THEN SWAP N(J), N(J + 1)
NEXT J
NEXT I

END SUB



243. WAP to enter any three strings and print the shortest one.

CLS
INPUT "ENTER FIRST STRING"; A$
INPUT "ENTER SECOND STRING"; B$
INPUT "ENTER THIRD STRING"; C$
IF LEN(A$) < LEN(B$) AND LEN(A$) < LEN(C$) THEN
S$ = A$
IF LEN(B$) < LEN(A$) AND LEN(B$) < LEN(C$) THEN
S$ = B$
ELSE
S$ = C$
END IF
PRINT "SHORTEST STRING="; S$
END

USING SUB PROCEDURE
DECLARE SUB SHRT( A$, B$, C$)
CLS
INPUT "ENTER FIRST STRING"; A$
INPUT "ENTER SECOND STRING"; B$
INPUT "ENTER THIRD STRING"; C$
CALL SHRT$(A$, B$, C$)
END

SUB SHRT$(A$, B$, C$)
IF LEN(A$) < LEN(B$) AND LEN(A$) < LEN(C$) THEN
S$ = A$
IF LEN(B$) < LEN(A$) AND LEN(B$) < LEN(C$) THEN
S$ = B$
ELSE
S$ = C$
END IF
PRINT “SHORTEST STRING=”; S$
END SUB
USING FUNCTION PROCEDURE
DECLARE FUNCTION SHRT$( A$, B$, C$)
CLS
INPUT "ENTER FIRST STRING"; A$
INPUT "ENTER SECOND STRING"; B$
INPUT "ENTER THIRD STRING"; C$
PRINT "SHORTEST STRING="; SHRT$( A$, B$, C$)
END

FUNCTION SHRT$( A$, B$, C$)
IF LEN(A$) < LEN(B$) AND LEN(A$) < LEN(C$) THEN
S$ = A$
IF LEN(B$) < LEN(A$) AND LEN(B$) < LEN(C$) THEN
S$ = B$
ELSE
S$ = C$
END IF
SHRT$ = S$
END FUNCTION

244. WAP to enter any three strings and print the longest one.
CLS
INPUT "ENTER FIRST STRING"; A$
INPUT "ENTER SECOND STRING"; B$
INPUT "ENTER THIRD STRING"; C$
IF LEN(A$) > LEN(B$) AND LEN(A$) > LEN(C$) THEN
G$ = A$
IF LEN(B$) > LEN(A$) AND LEN(B$) > LEN(C$) THEN
G$ = B$
ELSE
G$ = C$
END IF
PRINT "LONGEST STRING="; G$
END

USING SUB PROCEDURE
DECLARE SUB LON ( A$, B$, C$)
CLS
INPUT "ENTER FIRST STRING"; A$
INPUT "ENTER SECOND STRING"; B$
INPUT "ENTER THIRD STRING"; C$
CALL LON(A$, B$, C$)
END

SUB LON (A$, B$, C$)
IF LEN(A$) > LEN(B$) AND LEN(A$) > LEN(C$) THEN
G$ = A$
IF LEN(B$) > LEN(A$) AND LEN(B$) > LEN(C$) THEN
G$ = B$
ELSE
G$ = C$
END IF
PRINT “LONGEST STRING=”; G$
END SUB
USING FUNCTION PROCEDURE
DECLARE FUNCTION LON$( A$, B$, C$)
CLS
INPUT "ENTER FIRST STRING"; A$
INPUT "ENTER SECOND STRING"; B$
INPUT "ENTER THIRD STRING"; C$
PRINT "LONGEST STRING="; LON$( A$, B$, C$)
END

FUNCTION LON$( A$, B$, C$)
IF LEN(A$) > LEN(B$) AND LEN(A$) > LEN(C$) THEN
G$ = A$
IF LEN(B$) > LEN(A$) AND LEN(B$) > LEN(C$) THEN
G$ = B$
ELSE
G$ = C$
END IF
LON$ = S$
END FUNCTION

Comments

Post a Comment

Popular posts from this blog

PROGRAM TO FIND SQUARE, CUBE, SQUARE ROOT AND CUBE ROOT OF GIVEN NUMBER

7. Display square of an input number. REM PROGRAM TO DISPLAY SQUARE OF AN INPUT NUMBER CLS INPUT “ENTER ANY NUMBER”; N S = N ^ 2 PRINT “SQUARE OF NUMBER ”; S END USING SUB PROCEDURE DECLARE SUB SQUARE (N) CLS INPUT “ENTER ANY NUMBER”; N CALL SQUARE(N) END SUB SQUARE (N) S = N ^ 2 PRINT “SQUARE OF NUMBER “; S END SUB USING FUNCTION PROCEDURE DECLARE FUNCTION SQUARE (N) CLS INPUT “ENTER ANY NUMBER”; N S = SQUARE(N) PRINT “SQUARE OF NUMBER “; S END FUNCTION SQUARE (N) SQ= N ^ 2 SQUARE = SQ END FUNCTION 8. Display cube of an input number. REM PROGRAM TO DISPLAY CUBE OF AN INPUT NUMBER CLS INPUT “ENTER ANY NUMBER”; N C = N ^ 3 PRINT “CUBE OF NUMBER ”; C END USING SUB PROCEDURE DECLARE SUB CUBE (N) CLS INPUT “ENTER ANY NUMBER”; N CALL CUBE(N) END SUB CUBE (N) C = N ^ 3 PRINT “CUBE OF NUMBER “; C END SUB USING FUNCTION PROCEDURE DECLARE FUNCTION CUBE (N) CLS INP
Read more

PROGRAM TO DISPLAY SUM, PRODUCT, DIFFERENCE AND PRODUCT OF TWO / THREE NUMBERS

1. Enter any two numbers and display its sum. REM PROGRAM TO DISPLAY SUM OF TWO NUMBERS CLS INPUT “ENTER FIRST NUMBER”; A INPUT “ENTER SECOND NUMBER”; B S = A + B PRINT “SUM OF TWO NUMBERS”; S END USING SUB PROCEDURE DECLARE SUB SUM (A, B) CLS INPUT “ENTER FIRST NUMBER”; A INPUT “ENTER SECOND NUMBER”; B CALL SUM(A, B) END SUB SUM (A, B) S = A + B PRINT “SUM OF TWO NUMBERS”; S END SUB USING FUNCTION PROCEDURE DECLARE FUNCTION SUM (A, B) CLS INPUT “ENTER FIRST NUMBER”; A INPUT “ENTER SECOND NUMBER”; B S = SUM(A, B) PRINT “SUM OF TWO NUMBERS”; S END FUNCTION SUM (A, B) SU = A + B SUM = SU END FUNCTION 2. Enter any two numbers and display its difference. REM PROGRAM TO DISPLAY DIFFERENCE OF TWO NUMBERS CLS INPUT “ENTER FIRST NUMBER”; A INPUT “ENTER SECOND NUMBER”; B D = A - B PRINT “DIFFERENCE OF TWO NUMBERS”; D END USING SUB PROCEDURE DECLARE SUB DIFF (A, B) CLS INPUT “ENTER FIRST NUM
Read more

PALINDROME AND ARMSTRONG PROGRAMS

120.  WAP to input any number and check whether the given no. is palindrome or not. CLS INPUT "ENTER ANY NUMBER"; N A = N S = 0 WHILE N < > 0 R = N MOD 10 S = S * 10 + R N = N \ 10 WEND IF A = S THEN PRINT A; "IS PALINDROME" ELSE PRINT A; "IS NOT PALINDROME" END IF END USING SUB PROCEDURE DECLARE SUB PALIN (N) CLS INPUT "ENTER ANY NUMBER"; N CALL PALIN (N) END SUB PALIN (N) A = N S = 0 WHILE N < > 0 R = N MOD 10 S = S * 10 + R N = N \ 10 WEND IF A = S THEN PRINT A; "IS PALINDROME" ELSE PRINT A; "IS NOT PALINDROME" END IF END SUB USING FUNCTION PROCEDURE DECLARE FUNCTION PALIN (N) CLS INPUT "ENTER ANY NUMBER"; N P = PALIN ((N)) IF P = N THEN PRINT N; "IS PALINDROME" ELSE PRINT N; "IS NOT PALINDROME" END IF END FUNCTION PALIN (N) S = 0 WHILE N < > 0 R = N MOD 10
Read more