Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged nptel-quiz
0
votes
0
answers
1
NPTEL assignments links wanted...
I am unable to find any links to NPTEL assignments for any subject. Can anyone tell me how to find the list of the assignments? or give me the links to assignments……..
I am unable to find any links to NPTEL assignments for any subject. Can anyone tell me how to find the list of the assignments?or give me the links to assignments…….....
amitarp818
235
views
amitarp818
asked
Sep 23, 2023
Study Resources
general
nptel-quiz
query
+
–
1
votes
0
answers
2
NPTEL Assignment
Question : i. CISC architecture a. Symmetric registers ii. RISC architecture b. Multiple memory references iii. Misalignment c. Condition code register iv. Static data d. Single memory reference Options: i-a,ii-c,iii-b,iv-d i-c,ii-a,iii-b,iv-d i-c,ii-a,iii-b,iv-b i-c,ii-a,iii-d,iv-b
Question : i. CISC architecture a. Symmetric registersii. RISC architecture b. Multiple memory referencesiii. Misalignment c. Condition code regis...
lalitver10
234
views
lalitver10
asked
Jan 12, 2023
CO and Architecture
nptel-quiz
co-and-architecture
+
–
1
votes
1
answer
3
NPTEL
Let P,Q,R be regular expressions such that number of strings generated by P ,Q and R are p,q,r respectively. What is the number of strings generated by the expression (P+R)*Q + PQ ? Answer given was infinite … can someone explain me that how infinite is coming ? is it due to (*)?
Let P,Q,R be regular expressions such that number of strings generated by P ,Q and R are p,q,r respectively. What is the number of strings generated by the expression (P+...
shikhar500
741
views
shikhar500
asked
Oct 25, 2022
Theory of Computation
nptel-quiz
theory-of-computation
+
–
1
votes
2
answers
4
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$
The Number of Points $x \in \Re$ for which $\sin ^{2} x-3x=5$ is ,01more than one but finite$\infty$
Kabir5454
289
views
Kabir5454
asked
May 15, 2022
Mathematical Logic
nptel-quiz
calculus
+
–
0
votes
0
answers
5
nptel assignment
Please post the solution answer is option B.
Please post the solution answer is option B.
Amit puri
279
views
Amit puri
asked
Dec 28, 2021
Digital Logic
nptel-quiz
+
–
0
votes
0
answers
6
NPTEL ASSIGNMENT
The given answer is option B please post solution.
The given answer is option B please post solution.
Amit puri
466
views
Amit puri
asked
Dec 23, 2021
Digital Logic
nptel-quiz
+
–
1
votes
0
answers
7
NPTEL ASSIGNMENT DIGITAL CKTS
The answer given is XOR Gate . Please explain
The answer given is XOR Gate . Please explain
Amit puri
648
views
Amit puri
asked
Dec 17, 2021
Digital Logic
nptel-quiz
digital-circuits
+
–
0
votes
1
answer
8
Nptel Assignment Question
rsansiya111
571
views
rsansiya111
asked
Dec 8, 2021
Computer Networks
nptel-quiz
+
–
1
votes
1
answer
9
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.
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...
rsansiya111
604
views
rsansiya111
asked
Dec 8, 2021
DS
data-structures
nptel-quiz
binary-search-tree
time-complexity
+
–
2
votes
1
answer
10
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$)
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 ver...
rsansiya111
870
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
merge-sort
time-complexity
+
–
0
votes
1
answer
11
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))
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 single...
rsansiya111
1.3k
views
rsansiya111
asked
Dec 8, 2021
Algorithms
algorithms
array
time-complexity
nptel-quiz
+
–
0
votes
1
answer
12
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.
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 ed...
rsansiya111
667
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
graph-algorithms
sorting
+
–
0
votes
1
answer
13
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
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 wei...
rsansiya111
1.2k
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
dijkstras-algorithm
shortest-path
graph-theory
+
–
0
votes
1
answer
14
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.
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...
rsansiya111
1.3k
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
shortest-path
graph-search
graph-algorithms
+
–
0
votes
0
answers
15
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
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 ca...
rsansiya111
266
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
+
–
0
votes
2
answers
16
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
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)+ de...
rsansiya111
854
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
graph-algorithms
+
–
0
votes
0
answers
17
NPTEL Assignment Question
rsansiya111
197
views
rsansiya111
asked
Dec 8, 2021
Operating System
nptel-quiz
+
–
0
votes
0
answers
18
NPTEL Assignment Question
rsansiya111
195
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
+
–
0
votes
0
answers
19
NPTEL Assignment Question
rsansiya111
191
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
+
–
0
votes
3
answers
20
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)
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 ...
rsansiya111
728
views
rsansiya111
asked
Dec 8, 2021
Algorithms
algorithms
nptel-quiz
sorting
time-complexity
+
–
3
votes
1
answer
21
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][])
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 co...
rsansiya111
3.7k
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
+
–
0
votes
1
answer
22
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)
. 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 proble...
rsansiya111
7.5k
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
time-complexity
+
–
0
votes
0
answers
23
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.
Consider the following code :Load R1,MLoad R2,NCMP R1,R2JGE ENDStore [300],R2END: Store [300],R1 Assume that M=30 and N=25. The above sequence of instructions is to be ex...
rsansiya111
378
views
rsansiya111
asked
Dec 8, 2021
CO and Architecture
co-and-architecture
pipelining
operand-forwarding
nptel-quiz
branch-conditional-instructions
+
–
0
votes
1
answer
24
NPTEL Assignment Question
rsansiya111
291
views
rsansiya111
asked
Dec 8, 2021
Linear Algebra
nptel-quiz
+
–
0
votes
0
answers
25
NPTEL Assignment Question
rsansiya111
242
views
rsansiya111
asked
Dec 8, 2021
Theory of Computation
nptel-quiz
+
–
0
votes
0
answers
26
NPTEL Assignment Question
rsansiya111
385
views
rsansiya111
asked
Dec 8, 2021
Theory of Computation
nptel-quiz
+
–
0
votes
0
answers
27
NPTEL Assignment Question
rsansiya111
168
views
rsansiya111
asked
Dec 8, 2021
Theory of Computation
nptel-quiz
+
–
0
votes
1
answer
28
NPTEL Assignment Question
rsansiya111
352
views
rsansiya111
asked
Dec 8, 2021
Theory of Computation
nptel-quiz
+
–
0
votes
0
answers
29
NPTEL Assignment Question
rsansiya111
177
views
rsansiya111
asked
Dec 8, 2021
Theory of Computation
nptel-quiz
+
–
0
votes
0
answers
30
NPTEL Assignment Question
Its MSQ.
Its MSQ.
rsansiya111
244
views
rsansiya111
asked
Dec 8, 2021
Theory of Computation
nptel-quiz
+
–
Page:
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register