Dark Mode

Recent activity by Vaishnavi01

1 answer

1

MadeEasy Subject Test: Programming & DS - Programming in C

commented in Programming in C Dec 7, 2018

942 views

3 answers

2

GATE CSE 2014 Set 1 | Question: 15
Which one of the following is TRUE? The language $L = \left\{a^nb^n \mid n \geq 0\right\}$ is regular. The language $L = \left\{a^n \mid n \text{ is prime }\right\}$ is regular. The language $L$ ... is regular. The language $L = \left\{ww \mid w \in \Sigma^* \text{ with } \Sigma = \left\{0,1\right\}\right\}$ is regular.

commented in Theory of Computation Nov 29, 2018

9.2k views

0 answers

3

asked in Algorithms Nov 19, 2018

305 views

0 answers

4

asked in Digital Logic Oct 30, 2018

322 views

0 answers

5

Operating system

asked in Operating System Oct 26, 2018

339 views

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?

asked in Mathematical Logic Oct 24, 2018

301 views

0 answers

7

asked in Databases Oct 4, 2018

478 views

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.

asked in Programming in C Sep 28, 2018

660 views

0 answers

9

Data structures

commented in Programming in C Sep 28, 2018

714 views

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.

asked in Programming in C Sep 28, 2018

314 views

1 answer

11

Computer Network - ip addressing

commented in Computer Networks Sep 28, 2018

610 views

0 answers

12

Computer Network

commented in Computer Networks Sep 27, 2018

596 views

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

asked in Algorithms Sep 25, 2018

1.3k views

0 answers

14

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.

asked in Algorithms Sep 23, 2018

429 views

0 answers

15

Algorithms arrays

asked in Algorithms Sep 23, 2018

322 views

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?

commented in DS Sep 23, 2018

4.1k views

4 answers

17

GATE CSE 2008 | Question: 43
Consider the Quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists each of which contains at least one-fifth of the elements. Let $T(n)$ be the number of comparisons required to sort $n$ elements. Then $T(n) \leq 2T(n/5) + n$ $T(n) \leq T(n/5) + T(4n/5) + n$ $T(n) \leq 2T(4n/5) + n$ $T(n) \leq 2T(n/2) + n$

commented in Algorithms Sep 21, 2018

16.2k views

1 answer

18

Randomized Quicksort
True or False : In randomized quicksort , each key is involved in the same number of comparisons.

asked in Algorithms Sep 21, 2018

667 views

1 answer

19

Algorithms Complexity

commented in Algorithms Sep 21, 2018

703 views

0 answers

20

Computer Network GATE practice question

asked in Computer Networks Sep 19, 2018

374 views

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; } }

asked in Programming in C Sep 17, 2018

648 views

1 answer

22

commented in Digital Logic Sep 14, 2018

418 views

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.

commented in Computer Networks Sep 11, 2018

12.0k views

0 answers

24

Question on Array
Caption

asked in Programming in C Sep 10, 2018

855 views

1 answer

25

Complexity Question Based on array
Given an array A of size n*n, consists of 1's and 0's such that , in any row of A, all the 1's come before any 0's in that row. Assuming A is already in memory, what is the complexity of the most efficient algorithm for finding the row of A that contains the most 1's. A. O(n^2) B. O(n) C. O(log n) D. O(nlogn)

asked in Algorithms Sep 7, 2018

262 views

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.

answered in Compiler Design Sep 7, 2018

1.6k views

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 ?

answered in Compiler Design Sep 7, 2018

675 views

1 answer

28

C basic concept

commented in Programming in C Sep 3, 2018

526 views

6 answers

29

ISRO2015-8
Minimum number of $2 \times 1$ multiplexers required to realize the following function, $f = \overline{A} \;\overline{B} C + \overline{A}\; \overline{B} \;\overline{C}$ Assume that inputs are available only in true form and Boolean a constant $1$ and $0$ are available. $1$ $2$ $3$ $7$

commented in Digital Logic Aug 26, 2018

10.6k views

5 answers

30

GATE CSE 2007 | Question: 47
Consider the process of inserting an element into a $Max \: Heap$, where the $Max \: Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ performed is: $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$ $\Theta(n)$ $\Theta(n\log_2n)$

commented in DS Aug 3, 2018

19.4k views