Articles by Team EasyExamNotes

Team EasyExamNotes

Pushdown Automata

by

A Pushdown automata (PDA) works similar as DFA. A DFA can remember a finite amount of information, but a PDA can remember an infinite amount … Read more

Mealy to Moore Machine

by

Mealy Machine to Moore Machine Conversion Mealy machine for an input string of length ‘n’, Transition table for Mealy machine. PRESENT STATE NEXT STATE INPUT … Read more

C Program GATE 2018 -8

by

Consider the following C code. Assume that unsigned long int type length is 64 bits. unsigned long int fun(unsigned long int n){     unsigned long int i, j = 0, sum = 0;     for (i = n; i > 1; i = i/2) j++;     for ( ; j > 1; j = j/2) sum++;     return(sum); } The value returned when … Read more

C Program GATE 2018 -7

by

Consider the following C program: #include<stdio.h>   void fun1(char *s1, char *s2){      char *tmp;      tmp = s1;      s1 = s2;      s2 = tmp; } void fun2(char **s1, char **s2){      char *tmp;      tmp = *s1;      *s1 = *s2;      *s2 = tmp; } int main(){     char *str1 = “Hi”, *str2 = “Bye”;     fun1(str1, str2); printf(“%s %s “, str1, str2);     fun2(&str1, &str2); printf(“%s %s”, str1, str2);     return 0; } … Read more

C Program GATE 2018 -5

by

Consider the following C program. #include <stdio.h> struct Ournode{     char x,y,z; }; int main(){     struct Ournode p = {‘1’, ‘0’, ‘a’+2};     struct Ournode *q = &p;     printf (“%c, %c”, *((char*)q+1), *((char*)q+2));     return 0; } The output of this program is?