Register

is prolog a strongly typed langue?

644 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

445
views
0 answers
0 votes
iarnav asked May 13, 2018
445 views
#Algorithms #DFS How to find if a directed graph G is strongly connected using DFS in one pass?
I know, Kosaraju algorithm and there's one other algorithm which involves reversing of G and using DFS, but two times, but there's some algorithm which uses DFS only time, but I can't be able find that algorithm. Someone please share that.
User Avatar
116
views
1 answers
1 votes
shivamSK asked Jun 9
116 views
what is the output of following c code A:2 B:32 C:16 D:NONE
#include <stdio.h> double pom(double x,int n){ if(n==1) return x; else return x*pom(x,n-1); --n; } int main() { int a=pom(2,5); printf("%d",a); return 0; }what is the output of following c codeA:2B:32C:16D:NONE
User Avatar
1.1k
views
1 answers
0 votes
Harsh007 asked Jul 19, 2023
1,118 views
a sequential access file has a fixed size of 25 byte records. What is the logical location of the first byte of record 5?
User Avatar
Link Copied!