6 answers
6
1 answer
10
What will the intersection of a recursive and recursive enumerable language.Will it be recursive???
2 answers
11
#include<stdio.h>int main(){ int arr[3] = {2, 3, 4}; char * p; p = arr; p =(char *)(int*)(p); printf("%d, ", *p); p = (int*)(p+2); printf("%d", *p); ...
1 answer
12
The product term to be included to remove possible static hazard for the function WX + W’Y’ is a. WY’ b. XY’ c. W’X’ d. XY
2 answers
13
#include <stdio.h>int main(){ int a=9; printf("%d %d %d",++a,a++,++a); return 0;}what is the output?According to me it should be 12 10 10
0 answers
14
include <stdio.h>int main(){ char *c[]={"abhi","abhishek","abhisheksing"}; printf("%s",(*(*(c+2)+7))); return 0;} What is the output?
1 answer
15
#include <stdio.h>int main(){ char *c[]={"abhi","abhishek","abhisheksing"}; printf("%s",c [7]); return 0;}What is the output?
1 answer
16
difference between point to point and peer to peer ???
0 answers
17
#include<stdio.h>void main(){ char c[]="abhishek"; for(int i=0;i<8;i++) {c[i]="a"; printf("%c",c[i]); } }What is the error in it?
0 answers
19
PLs tell what are all the topics that i hve to study at physical layer in networking
1 answer
21
0 answers
23
S - SS|AB A - Aa|a B - Bb|b Is this grammar is ambigious or Not?
1 answer
24
IF P1 IS REDUCIBLE TO P2 AND P1 IS RECURSIVE ENUMERABLE THEN P2 NEED NOT BE RECURSIVE ENUMERABLE ???IS IS TRUE ??WHAT I AM THINKING IS THAT P1 IS UNDECIABLE SO P2 WILL AL...
1 answer
25
0^i1^j0^k|j=max(i,k) is CFL or not pls explain?
1 answer
26
What is the difference between host to host network connection and end to end network connection? Why host to host connection for network layer and end to end connect...
1 answer
27
Except reliability and connection oriented what are the other functionalities which are produced by TCP but not by UDP?
0 answers
28
My doubt is that when a process makes a transition from Run to terminate step immediately a process is invoked from new to ready state
1 answer
29
My doubt is it always true that the number of state in NFA is always less than number of state required in DFA for all language which are regular?