Recent questions without answers

0 votes

0 answers

1

self doubt
DOES TURING MACHINE ACCEPT EPSILON IS THIS PROBLEM DECIDABLE ?? PLEASE SOME ONE CLARIFY THIS

asked 2 hours ago in Theory of Computation by Venkat Sai Junior (875 points) | 4 views

0 votes

0 answers

2

Median

asked 3 hours ago in Probability by akash.dinkar12 Veteran (17.5k points) | 7 views

0 votes

0 answers

3

string length
#include <stdio.h> #include <string.h> void fun(char *arr) { int i; unsigned int n = strlen(arr); printf("n = %d\n", n); for (i=0; i<n; i++) printf("%c ", arr[i]); } // Driver program ... answer given n=11 siddissidj@ doubt why strlen is 11 , is it not 9 ? which 2 character are extra .... someone give detail explaination

asked 3 hours ago in Programming by sid1221 Active (2.1k points) | 8 views

+1 vote

0 answers

4

subnet-mask
For class B network, all even bit positions are selected for subnet mask bits. What is the possible subnet mask? (A) 255.25.170.170 (B) 255.255.85.85 (C) 255.255.255.240 (D) None

asked 4 hours ago in Computer Networks by shraddha priya Active (2.3k points) | 32 views

0 votes

0 answers

5

Which activity is not included in the first pass of two pass assemblers (UGC NET Dec 04)

asked 5 hours ago in Compiler Design by Sanjay Sharma Veteran (47.1k points) | 9 views

0 votes

0 answers

6

Co doubt
An IOSA define two different instruction formats. In the first format 6 bits are used for the opcode, among these of opcode bits pattern, three are used as special pattern. When any of these three patterns appear in the opcode field, the ... field. How many unique op code can this ISA support? 64 253 254 189 Can anybody please explain this question...

asked 5 hours ago in CO & Architecture by Surya Dhanraj Loyal (2.7k points) | 10 views

0 votes

0 answers

7

Boundary value analysis
BVA does not test cases for a) range b) condition c) value d) range bounded by a),b) Please explain

asked 5 hours ago in Non GATE by komal07 Active (1.7k points) | 1 view

0 votes

0 answers

8

Complete lattice and Bounded lattice

asked 5 hours ago in Set Theory & Algebra by VS Loyal (3k points) | 12 views

0 votes

0 answers

9

Sorting
Recommend sorts for the following scenario: i) A file of 15 records where each record is of a large size but the keys are simple. ii) A large file of about 100 records. iii) A file of 30 records where the records and keys are comparable in size. X: insertion sort Y: quick ... : Z C) i): Y, ii): Y , iii): X D) i): Z, ii): Y , iii): X Please provide explanation.

asked 6 hours ago in Algorithms by MiNiPanda Junior (567 points) | 6 views

0 votes

0 answers

10

Self doubt
If inefficiency of scheduling algorithm is $\frac{Burst Time wasted}{Total Burst Time} X 100$ Why do we have to multiply with 100?

asked 7 hours ago in Operating System by Syedarshadali (163 points) | 10 views

0 votes

0 answers

11

Decision Table
In a decision table if there are 3 variables and 3 rules, implies a) Specification may not be complete b) Design could be faulty c) Coding will be incorrect d) All of above http://www.competitiveguide.in/gate-question/it/SOFTWARE-ENGINEERING/12728

asked 8 hours ago in IS&Software Engineering by komal07 Active (1.7k points) | 1 view

0 votes

0 answers

12

Doubt: Little Endian and Big Endian

asked 9 hours ago in CO & Architecture by Hemant Parihar Boss (8.3k points) | 33 views

0 votes

0 answers

13

DPDA: One Liners
1) Can a Deterministic PDA has two epsilon transition each reading different Stack symbol to perform a transition? 2) Can a transition be performed without reading Stack symbol at all. Like $ a, λ/ λ$?

asked 10 hours ago in Theory of Computation by AskHerOut (263 points) | 11 views

0 votes

0 answers

14

Co doubt addressing
Let the address stored in the program counter be designated by the symbol X1. The instruction stored in X1 has an address part (operand reference) X2. The operand needed to execute the instruction is stored in the memory word ... . What is the relationship between these various quantities if the addressing mode of the instruction is **)PC relative.

asked 11 hours ago in CO & Architecture by Surya Dhanraj Loyal (2.7k points) | 3 views

+1 vote

0 answers

15

P and C
Right triangle PQR is to be constructed in the xy-plane so that the right angle is at P and line PR is parallel to the x-axis. The x and y coordinates of P, Q and R are to be integers that satisfy the inequalities :- $-4\leq x \leq 5$ and ... 16$ . How many different triangles could be constructed with these properties ? (a) 110 (b) 1,100 (c) 9,900 (d) 10,000

asked 12 hours ago in Mathematical Logic by just_bhavana Boss (7.6k points) | 22 views

0 votes

0 answers

16

Transactions Serializable schedule and Unserializable Schedule

asked 12 hours ago in Databases by Shubhanshu Boss (9.1k points) | 10 views

0 votes

0 answers

17

Decidabilty Question
We know given a TM (M) accepts an null string ϵ is an UD problem. Hence, L(M) will never be Recursive, but is it R.E? I mean, TM (M) can accept epsilon when it can go to an accept state on "B" on input tape. So, does it make it Semi-decidable and hence R.E? Thank you! Note/Credits: Blue line is copied from Arjun Sir's answer. Source - here

asked 13 hours ago in Theory of Computation by iarnav Loyal (4.6k points) | 5 views

0 votes

0 answers

18

union find
Is time complexity of union find algo on an undirected graph G with V vertices and E edges O(E) ?

asked 13 hours ago in Algorithms by A_i_$_h Boss (8.4k points) | 3 views

0 votes

0 answers

19

Regular expression
which book should be read for studying regular expression in depth

asked 23 hours ago in Theory of Computation by Arunkumarprajapati (35 points) | 17 views

+1 vote

0 answers

20

topological ordering of DAG
What is the method to find no of topological ordering of a Directed Acyclic Graph? For an instance, i found two graphs on internet, whose no of topological ordering is given but how to quickly calculate the total no of ordering? Graph 1 For ... I try to solve it by brute force method, then it's taking lot's of time. Is there any faster way?

asked 1 day ago in DS by stanchion (27 points) | 15 views

0 votes

0 answers

21

cache
I read in cache Effective time = hit ratio * cache access time + miss ratio*memory access time why not in miss penalty the additional searching in cache considered i.e. Penalty = memory access time + cache access time as unnecessary we need to search cache right?

asked 1 day ago in CO & Architecture by Na462 (175 points) | 20 views

+2 votes

0 answers

22

mod value
517 mod 55 when power is prime what is the method to solve

asked 1 day ago in Computer Networks by A_i_$_h Boss (8.4k points) | 30 views

+1 vote

0 answers

23

self doubt
what happens in semantic analysis phase ?? does the parser do the syntax directed translation or semantic analyser does it ?

asked 1 day ago in Compiler Design by Venkat Sai Junior (875 points) | 8 views

0 votes

0 answers

24

Self Doubt
Let < G, * > be a finite group and let H1 and H2 be it's sub group as per lagrange theorem we know order of sub group divides order of group, my doubt is, is it possible that we can have multiple subgroup of same cardinality for a particular group ? $\left | H1 \right |=\left | H2 \right |$

asked 1 day ago in Set Theory & Algebra by Tesla! Boss (9.6k points) | 10 views

+1 vote

0 answers

25

self doubts
A) Does digital signature provide privacy B) when questions are asked like RIP uses TCP or UDP, SMTP uses what etc etc....how do we know if it requires TCP or UDP...its smtn we should know or is there a way to find it or ... the receiver contains all 0's -true or false F) what is hamming distance and to detect d errors the hamming distance should be?

asked 1 day ago in Computer Networks by A_i_$_h Boss (8.4k points) | 17 views

+1 vote

0 answers

26

c++ Programming
Explain the following code..especially the loop part #1 & #2 of below code:- [Code is printing the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen integers is <=1]. int main() { int n,k,max = ... //#2 if(a[i]+a[i+1]> max) max = a[i]+a[i+1]; } cout<<max; return 0; }

asked 1 day ago in Programming by Naveen Kumar 3 (293 points) | 12 views

+1 vote

0 answers

27

self doubt
what is meant by reusing machine independent code optimizer in other compilers ???? generally the machine independent code is the intermediate code which can be used to build a back end for any platform ..please clarify

asked 1 day ago in Compiler Design by Venkat Sai Junior (875 points) | 5 views

0 votes

0 answers

28

I am unable to access the Video by Sachin Mittal on how to efficiently use Gate Overflow website.

asked 1 day ago in Study Resources by GäteMann (11 points) | 26 views

+3 votes

0 answers

29

Scheduling Overheads
Consider three processes that require 10, 20, 30 units and arrive at time 0, 2, 4. The number of scheduling overheads needed using S.R.T.F. scheduling is I think answer is 1 at time t = 10

asked 1 day ago in Operating System by Shivam Chauhan Boss (6.2k points) | 38 views

0 votes

0 answers

30

Os doubt
Assume two process p 0 and P1 share one Global Boolean array "flag()" and integer variable turn. Flag 0 and flag 1 are false. Consider the following code is executed by process pi where i equal to zero ... i. Which of the following condition is satisfied Mutual exclusion Mutual exclusion and progress Mutual exclusion progress and bounded waiting None

asked 2 days ago in Operating System by Surya Dhanraj Loyal (2.7k points) | 16 views

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 questions without answers

Recent Posts

Recent Blog Comments

Recent Badges