Recent questions

0 votes

0 answers

1

Made easy textbook
https://gateoverflow.in/?qa=blob&qa_blobid=6075540776642993895

asked 2 hours ago in Programming by Deepak Agrawal 10 (165 points) | 3 views

0 votes

0 answers

2

Made easy workbook

asked 3 hours ago in Algorithms by shweta sah (35 points) | 8 views

0 votes

2 answers

3

Regular Expressions
does this R.E satisfies for the language - no 2 a's come together where £=(a,b)? (b*ab*)*+b*

asked 5 hours ago in Theory of Computation by Kirandas R (51 points) | 16 views

0 votes

1 answer

4

Self-Doubt
What will be the time-complexity of the following ? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) { count++; } }

asked 8 hours ago in Algorithms by Phlegmatic (149 points) | 49 views

0 votes

1 answer

5

Self-Doubt
What is the time-complexity of Enqueue and Dequeue operations when Queue is implemented using linked list? What is the time complexity of inserting a element in single linked list ?

asked 10 hours ago in DS by Phlegmatic (149 points) | 26 views

0 votes

1 answer

6

Entity relationship
Minimum number of tables required and explain how

asked 11 hours ago in Databases by Iamgveeresh (7 points) | 13 views

0 votes

1 answer

7

Binary search

asked 14 hours ago in Programming by saumya mishra Junior (921 points) | 31 views

0 votes

1 answer

8

Rank of a matrix
Let A be a 4×3 real matrix with rank 2. Let B be transpose matrix of A. Which one of the following statement is TRUE? (a) Rank of BA is less than 2. (b) Rank of BA is equal to 2. (c) Rank of BA is greater than 2. (d) Rank of BA can be any number between 1 and 3.

asked 15 hours ago in Mathematical Logic by bts (99 points) | 13 views

0 votes

0 answers

9

Geeks for Geeks,ISRO CS 2017
int func(int num) { int count = 0; while(num) { count++; num >>= 1; } return(count) ; } ques:if func(435) what will be the result? [closed]

asked 16 hours ago in Programming by MeghnaJain (9 points) | 21 views

0 votes

1 answer

10

c language
02. main ( ) { char *P; P = “hello”; printf (“%c”, *&*P); } What will be the output of the above code? (A) h (B) e (C) l (D) o Ans: (A) How ans A came..please explain

asked 16 hours ago in Programming by dheeraj sawant (127 points) | 21 views

0 votes

0 answers

11

She said to me"do you know the person you are living with was thief (narration

asked 17 hours ago in Pure Web Development by Rahul please (7 points) | 10 views

0 votes

0 answers

12

Inverse of a matrix
Q.29- A isnt square matrix. How is its inverse possible?

asked 17 hours ago in Calculus by bts (99 points) | 19 views

0 votes

1 answer

13

OS Kernel
Please explain each point. My assumptions are; 1.kernel must save the register values.It should be FALSE as it can be the case if the process is terminated.Thus, no need to save. 2.kernel must close the files. Explain this point in both the cases(the ... has not dealt with registers earlier.Thus, no need to restore. 4.kernel must save the content of memory onto disk. Explain this too.

asked 17 hours ago in Operating System by MayankSharma (131 points) | 56 views

0 votes

1 answer

14

#DataStructure Heaps Self Doubt.
In a binary Heap of 100 elements time taken to find the 99th element? or in a binary heap on "n" elements, time taken to find (n-1)th element? Note ; I'm not asking about smallest or largest, but simply the 99th element.

asked 18 hours ago in DS by iarnav Loyal (7.2k points) | 62 views

0 votes

0 answers

15

Moore machine
Can Moore machine be minimized without converting into mealy machine?Is minimization possible directly?

asked 19 hours ago in Theory of Computation by Harshitha 123 (83 points) | 9 views

0 votes

0 answers

16

sorting
Is there any other way to know how many swaps will be required in any sorting algorithm (like quick merge) other than following the normal method( because it take lot of time in normal method)

asked 20 hours ago in Algorithms by piya (91 points) | 7 views

0 votes

1 answer

17

Scheduling algorithms
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin timesharing method. Which out of the following quantum times is the best value for small response times, ... processes have a short runtime, e.g. less than 10ms ? a)TQ=15ms b)TQ=40ms c)TQ=50ms D)TQ=45ms

asked 1 day ago in Operating System by Abhishek Malik (197 points) | 13 views

+1 vote

0 answers

18

Made easy

asked 1 day ago in Algorithms by Manoj Kumar Pandey (33 points) | 24 views

0 votes

0 answers

19

#TCP_Protocol
consider a sender sends 12 segments to a receiver.The RTD between the sender and receiver is 1 msec.The transmission time of each frame is 0.1 msec .The timeout value is 2 msec and there are no negative acknowledgement.In each of the following cases,how ... is used.The window size is 4.The 2nd segment is corrupted.The 4th and the 6th segments are lost during the first transmission.

asked 1 day ago in Computer Networks by Anil Ji Active (1.4k points) | 14 views

0 votes

1 answer

20

Made easy workbook
We've been given an unordered list having n distinct elements,the no. Of comparison to find an element that is neither the 2nd minimum nor the 2nd maximum is?

asked 1 day ago in Algorithms by Manoj Kumar Pandey (33 points) | 16 views

0 votes

1 answer

21

UGCNET-Nov-2017-III-52
Consider a system with five processes P0 through P4 and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C has six instances suppose at time T0 we have the following allocation. Process ... we claim that system is __________. (1) Semaphore (2) Deadlock State (3) Circular Wait (4) Not in deadlock state

asked 1 day ago in Operating System by Roma_nagpal (79 points) | 29 views

0 votes

0 answers

22

UGCNET-Nov-2017-III-70
Consider a Takagi - Sugeno - Kang (TSK) Model consisting of rules of the form : If x1 is Ai1 and ... and xr is Air THEN y =fi (x1, x2, ..., xr) = bi0+bi1 x1+.....+birxr assume, $\alpha$i is the matching degree of rule i, then the total output of the model is given by : (1) y ... 1}^{L}$ fi (x1,x2,....., xr)/$\sum_{i=1}^{L}\alpha$i (4) y = maxi [$\alpha$i fi (x1,x2,....., xr)]

asked 1 day ago in Mathematical Logic by Roma_nagpal (79 points) | 11 views

0 votes

1 answer

23

#selfdoubt
Find the time complexity? for(i=1;i<=n;i++) { for(j=1;j<i;j++) { if((i℅j)==0) { for (k=1;k<=n;k++) { sum+=k; } } } }

asked 1 day ago in Algorithms by Naveen Kumar 3 (449 points) | 53 views

0 votes

1 answer

24

UGC NET NOV 2017 PAPER III Q-71
Consider a single perceptron with sign activation function. The perceptron is represented by weight vector [0.4 −0.3 0.1]T and a bias θ=0. If the input vector to the perceptron is X=[0.2 0.6 0.5] then the output of the perceptron is : (1) 1 (2) 0 (3) −0.05 (4) −1

asked 1 day ago in Others by Roma_nagpal (79 points) | 26 views

0 votes

1 answer

25

#self
Q. int k; fun(int i) { k = i + 3; printf(k); } gun( int i) { int k = 4; k = i+4; fun(k); printf(k); } main(){ k=2 ; gun(k); printf(k); } my result static scoping - 9,6,2 ( here last print statement i have doubt ..it will print 2 or 9) dynamic scoping- 9,9,2

asked 1 day ago in Programming by Hradesh patel Loyal (6.7k points) | 19 views

0 votes

0 answers

26

Self DouBt
https://gateoverflow.in/549/gate1992-01-ix In this question why union find algo is used so the tym complexity became O(ElogN) ......E is no. of edges N is no. of vertices Instead of this we can use bfs to detect cycle in O(N+E) .... so what should be the answer??

asked 1 day ago in Algorithms by eyeamgj Active (2.3k points) | 12 views

0 votes

0 answers

27

self doubt
[closed]

asked 1 day ago in Algorithms by eyeamgj Active (2.3k points) | 11 views

0 votes

1 answer

28

Virtual memory
How does the virtual memory separates the logical memory as perceived by users from physical memory? Is it because we can load program with larger address space then physical memory but still we need physical memory to load our pages don't we ? Then what does the above statement actually trying to convey ?

asked 1 day ago in Operating System by Na462 Active (3.3k points) | 21 views

0 votes

1 answer

29

SELF DOUT
Heap Storage Allocation "SUPPORT RECURSION OR NOT"??

asked 1 day ago in Programming by pream sagar (131 points) | 22 views

0 votes

0 answers

30

Semi-decidability Vs Undecidability
Let L1 and L2 be 2 languages generated by an Unrestricted Grammar. I know that none of the following are decidable. But which of them are semi-decidable and which are Undecidable? 1. Whether L1 is Finite? 2. Whether L1 is Regular? 3. Whether L1 is Equivalent to ... complete? 8. Whether L1 is a subset of L2? 9. Whether (∑* - L1) is finite? 10. Whether L1 is Empty?

asked 1 day ago in Theory of Computation by Balaji Jegan Active (1.1k points) | 58 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

Recent Posts

Recent Blog Comments