Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by mayurp7
1
answer
1
Computer Network
If VPN is using by a individual/company/bank then, Do ISP record every data like browsing history or any activity of them? If yes then why is it required? #question not related to text book, if answered then it is pretty much helpful... Thanks in advance.
If VPN is using by a individual/company/bank then, Do ISP record every data like browsing history or any activity of them? If yes then why is it required?#question not re...
413
views
commented
Nov 14, 2017
0
answers
2
Where to get PPT for An introduction to formal languages and automata, peter Linz 6th Edition book?
Can anyone please provide the link? It will be very helpful.
Can anyone please provide the link? It will be very helpful.
938
views
edited
Nov 14, 2017
Theory of Computation
theory-of-computation
peter-linz
regular-language
+
–
4
answers
3
GATE CSE 2011 | Question: 38
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as ... $t=80$, then the minimum number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with d...
15.6k
views
answered
Aug 28, 2017
Algorithms
gatecse-2011
algorithms
dynamic-programming
normal
+
–
1
answer
4
Doubly Linked List as parameter
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that a node of doubly linked list has previous pointer as prev and next pointer as next. void fun(struct node **head_ref) { struct node *temp = NULL; struct node *current = *head_ref; ... ; 1. D) 6 <--> 5 <--> 4 <--> 3 <--> 1 <--> 2
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that a node of doubly linked list has previous pointer as prev a...
8.5k
views
commented
Aug 28, 2017
DS
linked-list
programming-in-c
+
–
4
answers
5
GATE CSE 2000 | Question: 1.8
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non-pipelined but identical CPU, we can say that T1 ≤ T2 T1 ≥ T2 T1 < T2 T1 and T2 plus the time taken for one instruction fetch cycle
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non-pipelined but identical CPU, we can say thatT1 ≤ T2T1 ≥ T2T1 < T2T...
11.5k
views
commented
Aug 23, 2017
CO and Architecture
gatecse-2000
pipelining
co-and-architecture
easy
+
–
5
answers
6
GATE CSE 2005 | Question: 37
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$ Which one of the following is FALSE? $T(n)=O(n^2)$ $T(n)=\Theta(n \log n)$ $T(n)=\Omega(n^2)$ $T(n)=O(n \log n)$
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$Which one of the following is FALSE?$T(n)=O(n^2)$$T(n)=\Theta(n \log n)$$T(n)=\Omega(n^2)$$T(n)=O(n \log n)$
9.7k
views
answered
Aug 22, 2017
Algorithms
gatecse-2005
algorithms
asymptotic-notation
recurrence-relation
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register