create or replace package circle AS function area(r IN number, ar OUT number) return number; procedure circum(r IN number, cir OUT number); . . . . . . DO YOU WANT FULL ANSWER THEN DOWNLOAD ATTACHMENT:
create or replace package circle AS
function area(r IN number, ar OUT number) return number;
Q.Write a procedure to calculate factorial of a number entered by user https://sikshapath.in/question/write-a-procedure-to-calculate-factorial-of-a-number-entered-by-user-3/
Q.Write a procedure to calculate factorial of a number entered by user
Q. Write a procedure and call it into main pl/sql program to find a factorial of a number. ANSWER: https://sikshapath.in/question/write-a-procedure-and-call-it-into-main-pl-sql-program-to-find-a-factorial-of-a-number/
Q.
Write a procedure and call it into main pl/sql program to find a factorial of a number.
Following question: traversing a graph data structure using queue and stack data structure means we have to implement BFS and DFS. BFS: It uses a Queue data structure that follows first in first out. DFS: It uses the Stack data structure, performs two stages, first visited vertices are pushed into tRead more
Following question: traversing a graph data structure using queue and stack data structure means we have to implement BFS and DFS.
BFS: It uses a Queue data structure that follows first in first out.
DFS: It uses the Stack data structure, performs two stages, first visited vertices are pushed into the stack, and second if there are no vertices then visited vertices are popped.
The full answer in the below attachment just tap on it:
Create a package circle having the following functions: Area of circle. Circumference of circle. Radius is to be passed as argument to both the functions to calculate values.
create or replace package circle AS function area(r IN number, ar OUT number) return number; procedure circum(r IN number, cir OUT number); . . . . . . DO YOU WANT FULL ANSWER THEN DOWNLOAD ATTACHMENT:
create or replace package circle AS
function area(r IN number, ar OUT number) return number;
procedure circum(r IN number, cir OUT number);
. . . . . .
DO YOU WANT FULL ANSWER THEN DOWNLOAD ATTACHMENT:
See lessWrite a procedure and call it into main pl/sql program to find a factorial of a number. Write a procedure …
Q.Write a procedure to calculate factorial of a number entered by user https://sikshapath.in/question/write-a-procedure-to-calculate-factorial-of-a-number-entered-by-user-3/
Q.Write a procedure to calculate factorial of a number entered by user
See lessWrite a procedure and call it into main pl/sql program to find a factorial of a number. Write a procedure …
Q. Write a procedure and call it into main pl/sql program to find a factorial of a number. ANSWER: https://sikshapath.in/question/write-a-procedure-and-call-it-into-main-pl-sql-program-to-find-a-factorial-of-a-number/
Q.
Write a procedure and call it into main pl/sql program to find a factorial of a number.
ANSWER:
See lessWrite a procedure and call it into main pl/sql program to find a factorial of a number.
declare f number(10); n number(5); PROCEDURE fac(n number) is begin. . . . . . . . . DOWNLOAD ATTACHMENT FOR FULL ANSWER:
declare
f number(10);
n number(5);
PROCEDURE fac(n number)
is
begin. . . . . . . . .
DOWNLOAD ATTACHMENT FOR FULL ANSWER:
See lessWrite a procedure to calculate factorial of a number entered by user
CREATE or replace PROCEDURE fact(n number) as f number:=1; begin for i in 1..n loop.................. For Full Answer Tap on Attachment button:
CREATE or replace PROCEDURE fact(n number) as
f number:=1;
begin for i in 1..n
loop………………
For Full Answer Tap on Attachment button:
See lessWrite a program to traverse a graph data structure using queue and stack data structure
Following question: traversing a graph data structure using queue and stack data structure means we have to implement BFS and DFS. BFS: It uses a Queue data structure that follows first in first out. DFS: It uses the Stack data structure, performs two stages, first visited vertices are pushed into tRead more
Following question: traversing a graph data structure using queue and stack data structure means we have to implement BFS and DFS.
BFS: It uses a Queue data structure that follows first in first out.
DFS: It uses the Stack data structure, performs two stages, first visited vertices are pushed into the stack, and second if there are no vertices then visited vertices are popped.
The full answer in the below attachment just tap on it:
See less