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 Aryanishu2000
1
answer
1
Ace Academy Question Bank: Automata
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states. (a) $2^5$^0$ × $50^5$ (b) $2^1$^0$ × $10^5$^0$ (c) $2^5$ × $10^5$^0$ (d) $2^5$^0$ × $50^5$
Find the no. of DFA’s that can be constructed over the alphabet Σ with 5 symbols, and with 10 states.(a) $2^5$$^0$ × $50^5$ (b) $2^1$$^0$ × $10^5$$^0$(c) $2^5$ × ...
1.1k
views
commented
Aug 8, 2020
Theory of Computation
theory-of-computation
number-of-dfa
+
–
1
answer
2
Find the no. of tokens
Find no of tokens in below program. #include<stdio.h> main() { int I; int *pi = &I; //parent pointer scanf("%d",pi); printf("%d\n", I+5); }
Find no of tokens in below program.#include<stdio.h>main(){ int I; int *pi = &I; //parent pointer scanf("%d",pi); printf("%d\n", I+5);}
5.4k
views
commented
Mar 29, 2020
Compiler Design
compiler-tokenization
lexical-analysis
+
–
2
answers
3
UGC NET CSE | December 2019 | Part 2 | Question: 39
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n \leq 2$. $T(n) = 4T( \sqrt{n} ) + \lg^2n$ $T(n) = \theta (\lg ( \lg ^2 n) \lg n )$ $T(n) = \theta ( \lg ^2 n \lg n )$ $T(n) = \theta (\lg ^2 n \lg \lg n )$ $T(n) = \theta (\lg ( \lg n) \lg n )$
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n \leq 2$. $T(n) = 4T( \sqrt{n} ) + \lg^2n$$T(n) = \theta (\lg ( \lg ^2 n) \l...
2.3k
views
commented
Mar 25, 2020
Others
ugcnetcse-dec2019-paper2
+
–
2
answers
4
ISRO2020-31
Three CPU-bound tasks, with execution times of $15,12$ and $5$ time units respectively arrive at times $0,t$ and $8$, respectively. If the operating system implements a shortest remaining time first scheduling algorithm, what should be the value of $t$ to have $4$ context switches? Ignore the context switches at time $0$ and at the end. $0<t<3$ $t=0$ $t<=3$ $3<t<8$
Three CPU-bound tasks, with execution times of $15,12$ and $5$ time units respectively arrive at times $0,t$ and $8$, respectively. If the operating system implements a s...
4.3k
views
commented
Jan 24, 2020
Operating System
isro-2020
operating-system
process-scheduling
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register