Register
Filter

Recent activity by Vaishnavi01

0 answers
3
Shortest Path
0 answers
4
Digital-logic
0 answers
5
Operating system
0 answers
6
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?
0 answers
7
Normalization
1 answer
8
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...
0 answers
10
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-...
0 answers
12
Computer Network
2 answers
13
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
0 answers
15
Algorithms arrays
1 answer
16
Heapsort
Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: 16 14 15 10 12 27 28 How many heapify operations have been performed on root of heap?
Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks...
1 answer
18
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.
1 answer
21
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...
1 answer
22
DLD GATE CSE
1 answer
23
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.
0 answers
24
Question on Array
Caption
Caption
1 answer
26
Compilers: Lexical Error
This screenshot is token from the book Ullman, How can following be a lexical error? because "elipseSize" should have a token recorded as an identifier.
This screenshot is token from the book Ullman,How can following be a lexical error? because "elipseSize" should have a token recorded as an identifier.
1 answer
27
self doubt
How are constants recogonized by the lexical analyser like interger 1234 floating point 1234.56789 and what happens when we have -1234 and -1234.56789 how many tokens are generated in this case(each of this case) ? is "-" considered seperately ?
How are constants recogonized by the lexical analyser like interger 1234 floating point 1234.56789and what happens when we have -1234 and -1234.56789 how many token...