Recent questions without answers

740
views
0 answers
2 votes
Inside a program loopif we write*ch1++it will give "lvalue required" errorbut without any loop if we write even++*ch1++;it will not give any lvalue error. Why?
463
views
0 answers
0 votes
1. What is the time complexity to design BST from given postorder and inorder traversal?2. What is the time complexity to design BST from given postorder only. I know time to design BST from Preorder is O(n).
550
views
0 answers
2 votes
A sender S sends a message m to receiver R, in which the message digest is digitally signed by S with its private key. In this scenario, one or more of the ... the answer as option Bwhat if it was case 2 the answer is still the same?
560
views
0 answers
0 votes
What type of questions are asked in nielit scientific assistant exam?
597
views
0 answers
5 votes
https://gateoverflow.in/118290/gate2017-1-10There is a confusion between option B and CIt cannot be option B because the variable c has no power , its always ... is not what the grammar saysOption C - should be the ans i feelplease help
249
views
0 answers
2 votes
1. Every 2 process solution satisfy Bounded waiting. I think yes2. Every 3 or more process solution satisfy Bounded waiting. I think no.Determine Which of the following ... ! Deadlock 9. ! Starvation --> Bounded Wait10. BW --> ! Starvation.
649
views
0 answers
3 votes
Hi! I want to prepare for Gate 2018 and it's aleady 24 Oct today. So is it possible to crack Gate with decent score like 50 or above? I wrote Gate ... . Please guide me. I'm determined to crack gate 2018 this time.Please advise me.
1.0k
views
0 answers
1 votes
https://gateoverflow.in/118698/gate2017-1-01Contra positive of ~p -> ~q is q->pinverse of ~p -> ~q is p->qam able to derive all the options from the questionwhere am i going wrong
567
views
0 answers
1 votes
What type of graph is STAR?A. BipartiteB. TripartiteC. MutipartitePS : I know a star graph is bipartite but can't we say that a bipartite graph is ... It can be partitioned into 3 independent sets.Similarly , it is mutipartite as well.
393
views
0 answers
3 votes
$L= { <G>$ is a CFG & not ambiguous $}$ RE or not? We can have 2 TMs where $T_{yes}\subset T_{no}$ just by adding additional ambiguous productions to an existing ... So it seems to me it is not RE, but given answer is RE. Where I am wrong?
347
views
0 answers
–1 votes
208
views
0 answers
1 votes
461
views
0 answers
1 votes
#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++) ... strlen is 11 , is it not 9 ? which 2 character are extra ....someone give detail explaination
816
views
0 answers
3 votes
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
2.6k
views
0 answers
2 votes
Q1. Which activity is not included in the first pass of two passassemblers?(A) Build the symbol table(B) Construct the intermediate code(C) Separate mnemonic opcode and operand fields(D) None of the above
262
views
0 answers
1 votes
BVA does not test cases for a) rangeb) condition c) valued) range bounded by a),b)Please explain
1.0k
views
0 answers
2 votes
Is every Bounded lattice Complete ?Eg : ( { x : 0<=x<= 1} , <= )This lattice is bounded , but is it complete ?(I have a doubt ; what if we consider irrational no.s as well)
475
views
0 answers
2 votes
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) ... Y , iii): XD) i): Z, ii): Y , iii): XPlease provide explanation.
946
views
0 answers
1 votes
In a decision table if there are 3 variables and 3 rules, implies a) Specification may not be completeb) Design could be faultyc) Coding will be ... ) All of abovehttp://www.competitiveguide.in/gate-question/it/SOFTWARE-ENGINEERING/12728
3.2k
views
0 answers
2 votes
I understand what is little endian and big endian. Suppose $\text{90AB12CD}_{16}$, this is the integer that is supposed to be stored in the memory. Then ... time we think, the first byte is from the rightmost side.Please, someone, confirm.
750
views
0 answers
2 votes
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 ... various quantities if the addressing mode of the instruction is **)PC relative.
509
views
0 answers
2 votes
Right triangle PQR is to be constructed in the xy-plane so that the right angle is at Pand line PR is parallel to the x-axis. The x and y coordinates of P, Q and R ... with these properties ?(a) 110 (b) 1,100 (c) 9,900 (d) 10,000
329
views
0 answers
2 votes
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 ... R.E?Thank you!Note/Credits: Blue line is copied from Arjun Sir's answer. Source - here
202
views
0 answers
2 votes
which book should be read for studying regular expression in depth
428
views
0 answers
1 votes
I read in cache Effective time = hit ratio * cache access time + miss ratio*memory access timewhy not in miss penalty the additional ... memory access time + cache access time as unnecessary we need to search cache right?
317
views
0 answers
3 votes
517 mod 55when power is prime what is the method to solve
318
views
0 answers
3 votes
what happens in semantic analysis phase ?? does the parser do the syntax directed translation or semantic analyser does it ?
370
views
0 answers
3 votes
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, ... cardinality for a particular group ? $\left | H1 \right |=\left | H2 \right |$
513
views
0 answers
2 votes
A) Does digital signature provide privacyB) when questions are asked like RIP uses TCP or UDP, SMTP uses what etc etc....how do we know if it requires ... ) what is hamming distance and to detect d errors the hamming distance should be?
396
views
0 answers
3 votes
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 ... max) max = a[i]+a[i+1]; } cout<<max; return 0; }