Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Vaishnavi01
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Vaishnavi01
0
votes
1
answer
1
MadeEasy Subject Test: Programming & DS - Programming in C
909
views
asked
Dec 7, 2018
Programming in C
made-easy-test-series
programming-in-c
programming
+
–
0
votes
0
answers
2
Shortest Path
289
views
asked
Nov 19, 2018
Algorithms
algorithms
graph-algorithm
shortest-path
+
–
0
votes
0
answers
3
Digital-logic
304
views
asked
Oct 30, 2018
Digital Logic
digital-logic
+
–
0
votes
0
answers
4
Operating system
335
views
asked
Oct 26, 2018
Operating System
operating-system
process-scheduling
+
–
1
votes
0
answers
5
Combinations
In how many ways a team of 11 players be selected from 14 players when two of them can play as goalkeepers only?
In how many ways a team of 11 players be selected from 14 players when two of them can play as goalkeepers only?
284
views
asked
Oct 24, 2018
Mathematical Logic
combinatory
counting
+
–
1
votes
0
answers
6
Normalization
465
views
asked
Oct 4, 2018
Databases
databases
database-normalization
+
–
2
votes
1
answer
7
Binary tree
A. Total no. of trees that were there in the forest. B. Total no. of nodes in the forest. C. Total no. of nodes which have only right child. D. Return max element among all nodes.
A. Total no. of trees that were there in the forest.B. Total no. of nodes in the forest.C. Total no. of nodes which have only right child.D. Return max element among all...
642
views
asked
Sep 28, 2018
Programming in C
data-structures
binary-tree
+
–
0
votes
0
answers
8
Data structures
708
views
asked
Sep 28, 2018
Programming in C
data-structures
tree
empty
binary-tree
+
–
0
votes
0
answers
9
Data structures
A 3-ary tree is a tree in which every internal node has exactly 3 children. Use induction to prove that the number of leaves in a 3-ary tree with n interval nodes is 2(n-1)+3.
A 3-ary tree is a tree in which every internal node has exactly 3 children. Use induction to prove that the number of leaves in a 3-ary tree with n interval nodes is 2(n-...
310
views
asked
Sep 28, 2018
0
votes
0
answers
10
Computer Network
578
views
asked
Sep 27, 2018
Computer Networks
computer-networks
token-bucket
+
–
0
votes
2
answers
11
Greedy Method Algorithm
Single source shortest path problems can be implemented by greedy algorithms using A. Singly linked list B. Min heap C. AVL tree D. All of the above
Single source shortest path problems can be implemented by greedy algorithms usingA. Singly linked listB. Min heapC. AVL treeD. All of the above
1.3k
views
asked
Sep 25, 2018
Algorithms
greedy-algorithm
+
–
2
votes
0
answers
12
Algorithm Searching
Which is faster and by how much, a linear search of only 1000 elements on a 5-GHz computer or a binary search of 1 million elements on a 1-GHz computer. Assume that the execution of each instruction on the 5-GHz computer is five times ... 1-GHz computer and that each iteration of the linear search algorithm is twice as fast as each iteration of the binary search algorithm.
Which is faster and by how much, a linear search of only 1000 elements on a 5-GHz computer or a binary search of 1 million elements on a 1-GHz computer. Assume that the e...
423
views
asked
Sep 23, 2018
Algorithms
algorithms
searching
+
–
1
votes
0
answers
13
Algorithms arrays
309
views
asked
Sep 23, 2018
Algorithms
array
algorithms
programming
+
–
0
votes
1
answer
14
Randomized Quicksort
True or False : In randomized quicksort , each key is involved in the same number of comparisons.
True or False :In randomized quicksort , each key is involved in the same number of comparisons.
659
views
asked
Sep 21, 2018
Algorithms
sorting
algorithms
quick-sort
+
–
0
votes
1
answer
15
Algorithms Complexity
660
views
asked
Sep 20, 2018
Algorithms
algorithms
time-complexity
asymptotic-notation
+
–
0
votes
0
answers
16
Computer Network GATE practice question
368
views
asked
Sep 19, 2018
Computer Networks
computer-networks
subnet
network-layer
+
–
0
votes
1
answer
17
Linked List Problem
struct node* foo(struct node* a, struct node* b) { struct node* result, *rec; if(a==null) return b; else if(b==null) return a; else { rec=foo(a->next,b->next); result=a; a->next=b; b->next=rec; return result; } }
struct node* foo(struct node* a, struct node* b){ struct node* result, *rec; if(a==null) return b; else if(b==null) return a; else { rec=foo(a->next,b->next...
635
views
asked
Sep 17, 2018
Programming in C
data-structures
linked-list
algorithms
+
–
0
votes
1
answer
18
DLD GATE CSE
404
views
asked
Sep 14, 2018
Digital Logic
digital-logic
+
–
1
votes
1
answer
19
Computer Network - ip addressing
590
views
asked
Sep 12, 2018
Computer Networks
ip
ip-addressing
computer-networks
network-addressing
+
–
1
votes
1
answer
20
Computer Network Aloha
100 stations on a pure ALOHA network share a 1Mbps channel. If frames are 1000 bits long, find throughput if each station is sending 10 frames per second.
100 stations on a pure ALOHA network share a 1Mbps channel. If frames are 1000 bits long, find throughput if each station is sending 10 frames per second.
12.0k
views
asked
Sep 11, 2018
Computer Networks
computer-networks
data-link-layer
pure-aloha
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register