QBASIC Solution

Friday, October 12, 2018

WAP to convert decimal number to octal number.

INPUT "ENTER OCTAL NUMBER"; N$
FOR I = LEN(N$) TO 1 STEP -1
B$ = MID$(N$, I, 1)
S = S + VAL(B$) * 8 ^ P
P = P + 1
NEXT I
PRINT "DECIMAL EQUIVALENT VALUE="; S
END
OR
USING SUB PROCEDURE
DECLARE SUB CONV(N)
CLS
INPUT "ENTER OCTAL NUMBER"; N
CALL CONV(N)
END
SUB CONV(N)
P = 0: S = 0
WHILE N <> 0
R = N MOD 10
S = S + R * 8 ^ P
P = P + 1
N = N \ 10
WEND
PRINT "DECIMAL EQUIVALENT VALUE="; S
END SUB

USING FUNCTION PROCEDURE
DECLARE FUNCTION CONV(N)
CLS
INPUT "ENTER OCTAL NUMBER"; N
PRINT "DECIMAL EQUIVALENT VALUE="; CONV(N)
END
FUNCTION CONV(N)
P = 0: S = 0
WHILE N <> 0
R = N MOD 10
S = S + R * 8 ^ P
P = P + 1
N = N \ 10
WEND
CONV = S
END FUNCTION

WAP to convert binary number to decimal number.

CLS
INPUT "ENTER BINARY NUMBER"; N$
FOR I = LEN(N$) TO 1 STEP -1
B$ = MID$(N$, I, 1)
S = S + VAL(B$) * 2 ^ P
P = P + 1
NEXT I
PRINT "DECIMAL EQUIVALENT VALUE="; S
END

USING SUB PROCEDURE
DECLARE SUB CONV(N)
CLS
INPUT "ENTER BINARY NUMBER"; N
CALL CONV(N)
END
SUB CONV(N)
P = 0: S = 0
WHILE N <> 0
R = N MOD 10
S = S + R * 2 ^ P
P = P + 1
N = N \ 10
WEND
PRINT "DECIMAL EQUIVALENT VALUE="; S
END SUB

USING FUNCTION PROCEDURE
DECLARE FUNCTION CONV(N)
CLS
INPUT "ENTER BINARY NUMBER"; N
PRINT "DECIMAL EQUIVALENT VALUE="; CONV(N)
END
FUNCTION CONV(N)
P = 0: S = 0
WHILE N <> 0
R = N MOD 10
S = S + R * 2 ^ P
P = P + 1
N = N \ 10
WEND
CONV = S
END FUNCTION

WAP to convert decimal number to binary number.

CLS
INPUT "ENTER DECIMAL NUMBER"; D
WHILE D < > 0
R = D MOD 2
S$ = STR$(R) + S$
D = D \ 2
WEND
PRINT "BINARY EQUIVALENT VALUE="; S$
END

USING SUB PROCEDURE
DECLARE SUB CONV(D)
CLS
INPUT "ENTER DECIMAL NUMBER"; D
CALL CONV(D)
END

SUB CONV(D)
WHILE D < > 0
R = D MOD 2
S$ = STR$(R) + S$
D = D \ 2
WEND
PRINT "BINARY EQUIVALENT VALUE="; S$
END

USING FUNCTION PROCEDURE
DECLARE SUB CONV$(D)
CLS
INPUT "ENTER DECIMAL NUMBER"; D
PRINT "BINARY EQUIVALENT VALUE="; CONV$(D)
END

SUB CONV$(D)
WHILE D < > 0
R = D MOD 2
S$ = STR$(R) + S$
D = D \ 2
WEND
CONV$ = S$
END FUNCTION

Monday, January 1, 2018

QBASIC Program code for finding the nearest and closest prime number

Programming Code

CLS
COLOR 10
LOCATE 1, 1: PRINT " * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * "
LOCATE 2, 2: PRINT "*"
LOCATE 3, 2: PRINT "*"
LOCATE 4, 2: PRINT "*"
LOCATE 5, 2: PRINT "*"
LOCATE 6, 2: PRINT "*"
LOCATE 7, 2: PRINT "*"
LOCATE 8, 2: PRINT "*"
LOCATE 9, 2: PRINT "*"
LOCATE 10, 2: PRINT "*"
LOCATE 11, 2: PRINT "*"
LOCATE 12, 2: PRINT "*"
LOCATE 13, 2: PRINT "*"
LOCATE 14, 2: PRINT "*"
LOCATE 15, 2: PRINT "*"
LOCATE 16, 2: PRINT "*"
LOCATE 17, 2: PRINT "*"
LOCATE 18, 2: PRINT "*"
LOCATE 19, 2: PRINT "*"
LOCATE 20, 2: PRINT "*"
LOCATE 21, 2: PRINT "*"
LOCATE 22, 2: PRINT "*"
LOCATE 23, 1: PRINT " * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * "
LOCATE 2, 66: PRINT "*"
LOCATE 3, 66: PRINT "*"
LOCATE 4, 66: PRINT "*"
LOCATE 5, 66: PRINT "*"
LOCATE 6, 66: PRINT "*"
LOCATE 7, 66: PRINT "*"
LOCATE 8, 66: PRINT "*"
LOCATE 9, 66: PRINT "*"
LOCATE 10, 66: PRINT "*"
LOCATE 11, 66: PRINT "*"
LOCATE 12, 66: PRINT "*"
LOCATE 13, 66: PRINT "*"
LOCATE 14, 66: PRINT "*"
LOCATE 15, 66: PRINT "*"
LOCATE 16, 66: PRINT "*"
LOCATE 17, 66: PRINT "*"
LOCATE 18, 66: PRINT "*"
LOCATE 19, 66: PRINT "*"
LOCATE 20, 66: PRINT "*"
LOCATE 21, 66: PRINT "*"
LOCATE 22, 66: PRINT "*"
LOCATE 23, 22: COLOR 25: PRINT "MADE BY ABHISHEK KANDEL"
LOCATE 2, 15: COLOR 5: PRINT "Program for Finding Nearest Prime Number"
COLOR 3
A:
LOCATE 4, 8: INPUT "Enter Any Number to find its Nearst Prime Number"; n
COLOR 7
IF n < 2 THEN
    LOCATE 5, 5: PRINT "The Prime Number After "; n; "is 2"
ELSEIF n = 2 THEN
    LOCATE 5, 5: PRINT "The Prime Number After 2 is 3"
ELSE
    ans$ = "n"
    k = 1
    WHILE ans$ = "n"
        a = n + k
        f = 0
        FOR i = 1 TO a
            IF a MOD i = 0 THEN f = f + 1
        NEXT i
        k = k + 1
        IF f = 2 THEN
            ans$ = "y"
            LOCATE 5, 5: PRINT "The Prime Number After"; n; "is "; a
        END IF
    WEND
    ans$ = "n"
    k = 1
    WHILE ans$ <> "y"
        a = n - k
        f = 0
        FOR i = 1 TO a
            IF a MOD i = 0 THEN f = f + 1
        NEXT i
        k = k + 1
        IF f = 2 THEN
            ans$ = "y"
            LOCATE 6, 5: PRINT "The Prime Number Before "; n; "is "; a
        END IF
    WEND
END IF

Output Screen