Register
Filter

Recent questions

#19801
3.0k
views
2 answers
1 votes
made easy
Which of the following statements is incorrect?(a)Threads are bound to a single process.(b)It's much easier to communicate between processes than ... threads to inadvertently disrupt each other since they share the entire address space.
User Avatar
#19802
840
views
1 answers
0 votes
Please solve this recurence relation.... How we got option--a.
The recurrence equation:T(1) = 1T(n) = 2T(n - 1) + n, n ≥ 2evaluates to(a) 2n + 1 - n - 2 (b) 2n - ... (d) 2n - nSolution: Option (a)
User Avatar
#19803
279
views
0 answers
1 votes
self doubt
there is a property implies in propositional logic i.e. --->suppose p : he is honest , q : he is greedy ( anything u make according to u )now p --- ... U HAVE ANY MORE THEN PLZZZ COMMENTAND PLZZZ ALSO TELL HOW R U IDENTIFYING THESE P AND Q
User Avatar
#19804
272
views
0 answers
0 votes
ACE TEST SERIES
User Avatar
#19805
1.0k
views
1 answers
0 votes
made easy
A leaky bucket with the capacity of 200 MB is at the host network interface.The data rate on the network is 2 Mbytes/s.If the host has 450 Mbytes to send ... the host in order that no data is lost is_____ in Mbytes.(upto 1 decimal place)
User Avatar
#19806
388
views
1 answers
1 votes
Algorithms revision question
Please suggest some revision or must see questions for algorithms subject.It would be helpful for me to revise. Thanks
User Avatar
#19807
672
views
0 answers
0 votes
SudoGate Test Series - Virtual Memory
A computer system has TLB access time = 30 ns and the main memory access time is 150 ns and if the miss rate is 20 % the calculate the effective memory access time if 3 level of paging is applied. i am getting 270 ns
User Avatar
#19808
782
views
1 answers
0 votes
AAI Junior Executive Information Technology
It has been mentioned in Advertisement that Admit-Card for online exam will send to registered email-IDs. Does anyone received admit card yet?
User Avatar
#19809
762
views
2 answers
0 votes
Gateforum Test Series: Computer Networks - Lan Technologies
Let cluster of stations share 48kbps of pure aloha channel. Every station outputs frame of length 1024 bit in every 50 seconds. Then what is the maximum value of number of stations?
User Avatar
#19810
495
views
0 answers
0 votes
Self doubt
No of PRIME IMPLICANTS ??
User Avatar
#19811
2.9k
views
1 answers
0 votes
Number of sub-strings for a given sub string having repeated symbols
Lets for a a given string aabbbccddI need to find the number of substrings possible how to go about it? Does the n(n+1)/2 formula work here also?
User Avatar
#19812
348
views
0 answers
0 votes
Recursive language
https://gateoverflow.in/86546/theory-of-computation-22Total recursive functions are similar to a) Recursive Languages b) Recursive Enumerable languages ... Enumerable language is range of total recursive function"What it means?
User Avatar
#19813
460
views
0 answers
1 votes
Asymptotic Notation
Please explain 2nd line complexity.
User Avatar
#19814
1.6k
views
0 answers
5 votes
Spanning Tree
Calculate the number of Spanning trees possible for each of these graphs
User Avatar
#19815
701
views
1 answers
0 votes
Baud Rate
what is baud rate exactly? and what does it signifies?
User Avatar
#19816
238
views
0 answers
0 votes
discrete maths
User Avatar
#19817
358
views
0 answers
0 votes
self doubt
when an nfa is converted to dfa, is obtained dfa always minimal?
User Avatar
#19818
1.3k
views
0 answers
0 votes
Self Doubt
If you do every problem in this book, then you will learn discrete mathematics. You learned discrete mathematics. Therefore, you did every ... book.The above argument is AValid and SatisfiableBValid but not satisfiableCInvalid DTautology
User Avatar
#19819
4.4k
views
4 answers
0 votes
Self Doubt regarding C-SCAN
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is ... compared to the CSCAN algorithm is ________.Please also mention the method of C-SCAN.
User Avatar
#19820
2.5k
views
0 answers
1 votes
Intersection among elements of Linked List
Given two unsorted singly-linked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common ... in worst case, if it is allowed to use constant extra space only?
User Avatar
Page: