Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Sumiran Agrawal
1
answer
1
Peter Linz Edition 5 Exercise 12.4 Question 8 (Page No. 321)
Let $G_1$ and $G_2$ be grammars with $G_1$ regular. Is the problem $L(G_1) = L(G_2)$ decidable when $\text(a)$ $G_2$ is unrestricted, $\text(b)$ when $G_2$ is context-free, $\text(c)$ when $G_2$ is regular$?$
Let $G_1$ and $G_2$ be grammars with $G_1$ regular. Is the problem $L(G_1) = L(G_2)$ decidable when $\text(a)$ $G_2$ is unrestricted,$\text(b)$ when $G_2$ is context-free...
310
views
answered
Jun 24, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
decidability
proof
difficult
+
–
0
answers
2
#DBMS_ER Model
A university database contains information about professors (identified by SSN) and courses (identified by courseid). Professors teach courses; each of the following situations concerns the Teaches relationship set. For below situation, draw the ER diagram: ... in a team can teach the course. Model this situation introducing additional entity sets and relationship sets if necessary.
A university database contains information about professors (identified by SSN) and courses (identified by courseid). Professors teach courses; each of the following situ...
912
views
asked
May 24, 2019
Databases
er-diagram
databases
+
–
2
answers
3
Direct Mapped Cache Multiplexer
Is there any multiplexer(s) present in the implementation of Direct Mapped Cache? If yes, then the Hit latency would be Multiplexer latency + Comparator Latency?
Is there any multiplexer(s) present in the implementation of Direct Mapped Cache?If yes, then the Hit latency would be Multiplexer latency + Comparator Latency?
3.6k
views
commented
May 17, 2019
CO and Architecture
co-and-architecture
icache-memory
direct-mapping
+
–
9
answers
4
GATE CSE 2018 | Question: 2
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: 0, c 0, a+2 '0', 'a+2' '0', 'c'
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",...
20.8k
views
commented
May 13, 2019
Programming in C
gatecse-2018
programming-in-c
programming
structure
normal
1-mark
+
–
0
answers
5
#KennethRosen#DiscreteMaths
R is iff $R ^{-1}$ is Total ? a function ? a surjection ? an injection ? a bijection ? Fill in the entries in the table.
R isiff $R ^{-1}$ isTotal?a function?a surjection?an injection?a bijection?Fill in the entries in the table.
259
views
asked
Mar 30, 2019
Set Theory & Algebra
relations
kenneth-rosen
+
–
1
answer
6
Context Free Languages
Which of the following is/are CFL? 1) L = { xy | |x|=|y| } 2) L = { x#y | |x|=|y| }
Which of the following is/are CFL?1) L = { xy | |x|=|y| }2) L = { x#y | |x|=|y| }
509
views
commented
Jul 19, 2017
Theory of Computation
context-free-language
+
–
1
answer
7
Regular Languages and Finite Automata
A language L = {w|w contain 'a' in every odd position, w belongs to {a, b}*} Doubt: Here, null string will be accepted or not. Please explain? This is really confusing in these types of questions whether to include null string or not. Please suggest some way to sort this out.
A language L = {w|w contain 'a' in every odd position, w belongs to {a, b}*}Doubt: Here, null string will be accepted or not. Please explain? This is really confusing in ...
729
views
answer selected
Jul 8, 2017
Theory of Computation
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register