Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by srestha
0
votes
1
answer
101
Made Easy Test Series : Aptitude
Seetal wants to sell her bicycle, either a profit of $K$% or a loss of $K$%. What is value of $K?$ Statement $1:$ Difference between the amount Seetal gets in the $2$ cases is $Rs 2560$ Statement $2:$ If Seetal profit is $Rs. K$ her profit percentage is $7.5$%
asked
in
Quantitative Aptitude
Apr 18, 2019
441
views
made-easy-test-series
general-aptitude
quantitative-aptitude
0
votes
0
answers
102
Branch Address
To get branch address, do we need base register value or Program Counter value?
asked
in
CO and Architecture
Apr 17, 2019
542
views
co-and-architecture
0
votes
0
answers
103
Self doubt- Turing machine
$1)L=M$ is a turing machine $M$ accepts two strings of different length $2)L=M$ is a turing machine $M$ accepts atleast two strings of different length Which one RE? Which one REC? How to compute the different length string?
asked
in
Theory of Computation
Apr 13, 2019
284
views
turing-machine
theory-of-computation
0
votes
0
answers
104
Made Easy Test Series :TOC1
$(a,b,c)$ represents by reading input $a$, it replaces $a$ by $b$ and moved to $c$ direction. Which of the following language accepted by TM? My question is what $y$ is accepting in TM? I mean why $y$ is needed? What language is accepted ?
asked
in
Theory of Computation
Apr 12, 2019
244
views
made-easy-test-series
automata
0
votes
1
answer
105
Allen Career Institute:TOC1
The value of a regular expression r over ∑, denoted by Val(r), is defined as follows : 1. Val (Ø) = 0 2. Val (ε) = 0 3. Val (a) = 0 for every a ε ∑ 4. Val ((r. s)) = Val ((r + s)) = max(Val (r), Val (s)) 5. Val ((r*)) = Val (r) + 1 Find the value of regular expression (a (a + a*a a)) (1) 3 (2) 2 (3) 1 (4) 0 How max function working here?
asked
in
Theory of Computation
Apr 11, 2019
263
views
finite-automata
1
vote
1
answer
106
Allen Career Institute:Regular Expression
The regular expression 0*(10*)* denote the same set as (1) (1*0)*1* (2) 0+(0+10)* (3) (0+1)*10(0+1)* (4) None of these Isnot 1) as same as given expression?
asked
in
Theory of Computation
Apr 11, 2019
571
views
finite-automata
0
votes
0
answers
107
Allen Carrer Institute: TOC1
How many no. of states in DFA for the following required expression? $(a + b + c) (a + b + c) (a + b + c) (a + b + c) ……… (n – 2)$ times $(a + b + c)^{+}$ $(1) $ $n – 1$ $(2) $ $n$ $(3) $ $n + 1$ $(4) $ $n + 2$ Plz confirm me the answer . Is it $(n-1)$ or $n ?$
asked
in
Theory of Computation
Apr 11, 2019
436
views
finite-automata
0
votes
0
answers
108
Allen Carrer Institute: Algorithm
Using best first search for a shortest path from A to Z, the order in which nodes are considered best for the path is (Note :- that these are node orders not full paths.) (1) A < C < F < D < E (2) A < C < E < B (3) A < C < F < E < B (4) A < C < D < F
asked
in
Algorithms
Apr 5, 2019
446
views
algorithms
0
votes
0
answers
109
Allen Career Institute: Algorithm
Identify the algorithm which works on the principle that locally optimal solutions are globally optimal. $\left ( A \right )$ Divide and Conquer $\left ( B \right )$ Greedy $\left ( C \right )$ Dynamic Programming $\left ( D \right )$ All of the above
asked
in
Algorithms
Apr 5, 2019
1.3k
views
algorithms
1
vote
0
answers
110
Made Easy Test Series : Doubt on Automata
$\left \{ a^{n}.b^{n+k}\mid n\geq 0,k\geq 1 \right \}\cup \left \{ a^{n+k}.b^{n}\mid n\geq 0,k\geq 3 \right \}$ is DCFL Is it true? As we know union of two DCFL cannot be DCFL
asked
in
Theory of Computation
Apr 4, 2019
670
views
made-easy-test-series
theory-of-computation
dcfl
1
vote
0
answers
111
Stack-DS(Conceptual Doubt)
Is it TRUE or FALSE? Stack allocation can allocate and deallocate dynamic variables and can manage runtime storage
asked
in
Algorithms
Apr 3, 2019
1.6k
views
data-structures
stack
0
votes
0
answers
112
Programming:Self Doubt
Can somebody explain this code line by line. I am unable to get and what will be it's output? #include<stdio.h> #include<stdlib.h> void transpose(int n, const double *A, double *B, const int *lda, int *perm) { } int transpose_equal(const double *A, ... , B, r_dim, r_perm); transpose_equal(A, B, total); free(A); free(B); free(B_trans); printf("\n"); } }
asked
in
Programming in C
Apr 3, 2019
517
views
programming-in-c
output
0
votes
0
answers
113
Carl Hamacher: Machine Instruction and Programs-Chapter $2$
Register $R_{1}$ and $R_{2}$ of a computer contain the decimal values $1200$ and $4600$ . What is the effective address of the memory operand in each of the following instructions? $\left ( a \right )$ $Load$ ... //Auto Decrement $\left ( e \right )$ $Subtract$ $\left ( R_{1} \right )+,R_{5}$ Ans-1200//Autoincrement
asked
in
CO and Architecture
Apr 2, 2019
792
views
co-and-architecture
carl-hamacher
0
votes
0
answers
114
Self Doubt
What is control input and control output ? Is in SR output changes with control input and control output?
asked
in
Digital Logic
Apr 1, 2019
334
views
digital-logic
flip-flop
0
votes
0
answers
115
General Query: Self doubt(Math+Automata)
Can somebody explain What is identity permutation?
asked
in
Combinatory
Apr 1, 2019
329
views
discrete-mathematics
finite-automata
0
votes
2
answers
116
Allen Career Institute:General Aptitude
Select the best alternative Motorcycle : Battery : : Life : ? (1) Star (2) Moon (3) Sun (4) Earth I given answer as (4), but correct one is (3) why?
asked
in
Verbal Aptitude
Mar 29, 2019
571
views
general-aptitude
0
votes
1
answer
117
Allen Career Institute: Spanning tree
Let $G$ be a simple undirected complete and weighted graph with vertex set $V = {0, 1, 2, . 99.}$ Weight of the edge $(u, v)$ is $\left | u-v \right |$ where $0\leq u, v\leq 99$ and $u\neq v$. Weight ... tree is______________ Doubt:Here asking for maximum weight spanning tree. So, there weight will be $0$ to every node. Isnot it? but answer given 7351.
asked
in
Graph Theory
Mar 29, 2019
568
views
discrete-mathematics
0
votes
0
answers
118
Allen Career Institute:Programming
Do something (x, n) { m = n, temp = 1, z = x ; while (m > 0) do { while ((m mod z) == 0) do { m = |m/2|; z = z^{2} ; } m = m – 1; } return temp ; } Complexity of the above problem $1)\Theta \left ( log n \right )$ $2)\Theta \left ( nlog n \right )$ $3)\Theta \left (n^{2} \right )$ $4)\Theta \left (n\right )$
asked
in
Programming in C
Mar 28, 2019
453
views
programming-in-c
1
vote
1
answer
119
Allen Career Institute:Graph Theory
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
asked
in
Graph Theory
Mar 28, 2019
345
views
discrete-mathematics
1
vote
1
answer
120
Self Doubt on scoping
int x = 5, y = 10 ; void main ( ) { int i = 2, j = 3 A (i, j); } void A (int i, int j) { int x = 10, y = 5 ; i = i + x : j = i + y : printf ("%d %d", i, j); B (i, j); } void B (int i, int j) { i ... by-name 3. call-by-need 4. call-by-value 5.Static scoping 6.Dynamic scoping Any reference for call by name and call by need Is for static coping $12,17,54$ or $12,17,59$?
asked
in
Programming in C
Mar 23, 2019
450
views
programming-in-c
dynamic-scoping
parameter-passing
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
35
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...