Dark Mode

Recent questions tagged nptel-quiz

1 vote

2 answers

1

No of solution of the given equation
The Number of Points $x \in \Re$ for which $\sin ^{2} x-3x=5$ is , 0 1 more than one but finite $\infty$

Kabir5454 asked in Mathematical Logic May 15

77 views

0 votes

0 answers

2

nptel assignment
Please post the solution answer is option B.

Amit puri asked in Digital Logic Dec 28, 2021

183 views

0 votes

0 answers

3

NPTEL ASSIGNMENT
The given answer is option B please post solution.

Amit puri asked in Digital Logic Dec 23, 2021

254 views

1 vote

0 answers

4

NPTEL ASSIGNMENT DIGITAL CKTS
The answer given is XOR Gate . Please explain

Amit puri asked in Digital Logic Dec 17, 2021

203 views

0 votes

1 answer

5

Nptel Assignment Question

rsansiya111 asked in Computer Networks Dec 9, 2021

116 views

1 vote

1 answer

6

NPTEL Assignment Question
What is the complexity of inorder traversal for a binary search tree with n nodes? O(log n) whether the tree is balanced or unbalanced. O(log n) if the tree is balanced, O(n) otherwise. O(n) whether the tree is balanced or unbalanced. O(n) if the tree is balanced, O(n log n) otherwise.

rsansiya111 asked in DS Dec 8, 2021

155 views

0 votes

1 answer

7

NPTEL Assignment Question
Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge. What would the worst-case complexity of this version be? O($n^2$) O($n^2$ log3n) O(n log2n) O(n $(log2n)^2$)

rsansiya111 asked in Algorithms Dec 8, 2021

138 views

0 votes

1 answer

8

NPTEL Assignment Question
Suppose we want to extend the union-find data structure to support the operation Reset(c), which takes as input the name of a component c and then breaks up c into singleton components, like MakeUnionFind(). For instance if c = 3 and c currently ... representation: O(n), Pointer representation: O(size(c)) Array representation: O(size(c)), Pointer representation: O(size(c))

rsansiya111 asked in Algorithms Dec 8, 2021

134 views

0 votes

1 answer

9

Nptel Assignment Question
Consider the following algorithm on a graph with edge weights. Sort the edges as [e1,e2,...,em] in decreasing order of cost. Start with the original graph. Consider each edge ej. If this edge is part of a cycle delete it. Which of the following is not ... at the end is a minimum cost spanning tree. Exactly m-n+1 edges will be deleted. At most n-1 edges will be deleted.

rsansiya111 asked in Algorithms Dec 8, 2021

126 views

0 votes

1 answer

10

Nptel Assignment Question
Consider the following strategy to convert a graph with negative edge weights to one that does not have negative edge weights. Let the maximum magnitude negative edge weight in the graph be -k. Then, for each edge in the graph with weight w, ... all graphs. The claim is true for connected acyclic graphs. The claim is not true in general for connected graphs with cycles

rsansiya111 asked in Algorithms Dec 8, 2021

137 views

0 votes

1 answer

11

NPTEL Assignment Question
Consider the following strategy to solve the single source shortest path problem with edge weights from source s. 1. Replace each edge with weight w by w edges of weight 1 connected by new intermediate nodes 2. Run BFS(s) on the modified graph to ... 's algorithm.s st This strategy will not solve the problem correctly. This strategy will only work if the graph is acyclic.

rsansiya111 asked in Algorithms Dec 8, 2021

188 views

0 votes

0 answers

12

NPTEL Assignment Question
Anjali has enrolled for a part-time Masters programme where she has to complete 8 courses, numbered 1, 2, . . . , 8. Each course takes a full semester to complete. She can take as many or as few courses as she wants in each semester. Some courses are ... for course 4: course 8 Prerequisites for course 5: course 8 Prerequisites for course 6: course 7,8 Options are: 3 4 5 6

rsansiya111 asked in Algorithms Dec 8, 2021

66 views

0 votes

2 answers

13

NPTEL Assignment Question
An undirected graph G has 300 edges. The degree of a vertex v, deg(v), is the number of edges connected to v. Suppose V = {v1,v2,...,v30}. What is the value of deg(v1)+ deg(v2) + · · · + deg(v30)? 300 600 900 None of these

rsansiya111 asked in Algorithms Dec 8, 2021

232 views

0 votes

0 answers

14

NPTEL Assignment Question

rsansiya111 asked in Operating System Dec 8, 2021

79 views

0 votes

0 answers

15

NPTEL Assignment Question

rsansiya111 asked in Algorithms Dec 8, 2021

73 views

0 votes

0 answers

16

NPTEL Assignment Question

rsansiya111 asked in Algorithms Dec 8, 2021

100 views

0 votes

1 answer

17

NPTEL Assignment Question
Suppose there are k sorted lists (decreasing order) with n/k elements in each list. What is the time complexity to merge them into one single sorted list. Hint: Maintain a heap of k elements. Think which k elements to choose. A. O(nlogk) B. O(n) C. O(nk) D. O(nlogn)

rsansiya111 asked in Algorithms Dec 8, 2021

129 views

3 votes

0 answers

18

NPTEL Assignment Question
Which of the following function singatures are correct for passing a two dimensional array A of 10 rows and 10 columns to a function xyz() in C? There should not be any compiler error or warning when you do so. A. xyz(int A[]) B. xyz(int *A[]) C. xyz(int A[][10]) D. xyz(int A[10][])

rsansiya111 asked in Algorithms Dec 8, 2021

890 views

0 votes

1 answer

19

NPTEL Assignment Question
. You are given a set of n points on the number line. They are given in arbitrary order. The task is to find the points that are closest to each other. To solve the problem you decide to take one point and compute its distance to all other points and repeat ... closest pair. What is the running time of this algorithm ? O(nlgn) O(n^2) Runtime is independent of n. O(log n)

rsansiya111 asked in Algorithms Dec 8, 2021

2.8k views

0 votes

0 answers

20

NPTEL Assignment Question
Consider the following code : Load R1,M Load R2,N CMP R1,R2 JGE END Store [300],R2 END: Store [300],R1 Assume that M=30 and N=25. The above sequence of instructions is to be executed on a pipelined processor with IF , ... instructions. The branch outcome is known after EX stage. Determine the number of clock cycles required for completion of execution of all instructions.

rsansiya111 asked in CO and Architecture Dec 8, 2021

107 views

0 votes

0 answers

21

NPTEL Assignment Question

rsansiya111 asked in Linear Algebra Dec 8, 2021

57 views

0 votes

0 answers

22

NPTEL Assignment Question

rsansiya111 asked in Theory of Computation Dec 8, 2021

127 views

0 votes

0 answers

23

NPTEL Assignment Question

rsansiya111 asked in Theory of Computation Dec 8, 2021

291 views

0 votes

0 answers

24

NPTEL Assignment Question

rsansiya111 asked in Theory of Computation Dec 8, 2021

75 views

0 votes

1 answer

25

NPTEL Assignment Question

rsansiya111 asked in Theory of Computation Dec 8, 2021

88 views

0 votes

0 answers

26

NPTEL Assignment Question

rsansiya111 asked in Theory of Computation Dec 8, 2021

96 views

0 votes

0 answers

27

NPTEL Assignment Question
Its MSQ.

rsansiya111 asked in Theory of Computation Dec 8, 2021

77 views

0 votes

0 answers

28

NPTEL Assignment Question

rsansiya111 asked in Theory of Computation Dec 8, 2021

58 views

0 votes

0 answers

29

NPTEL Assignment Question
Its MSQ. Please help

rsansiya111 asked in Theory of Computation Dec 8, 2021

58 views

2 votes

1 answer

30

NPTEL Assignment Question
Suppose we want to synchronize two concurrent processes P and Q

rsansiya111 asked in Operating System Dec 8, 2021

98 views

Page:

1
2
3
4
5
next »

Recent questions tagged nptel-quiz