Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for nptel
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
1
answer
2
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
740
views
shikhar500
asked
Oct 25, 2022
Theory of Computation
nptel-quiz
theory-of-computation
+
–
3
votes
1
answer
3
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
+
–
1
votes
0
answers
4
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
+
–
0
votes
1
answer
5
NPTEL Assignment Question
rsansiya111
290
views
rsansiya111
asked
Dec 8, 2021
Linear Algebra
nptel-quiz
+
–
0
votes
3
answers
6
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
727
views
rsansiya111
asked
Dec 8, 2021
Algorithms
algorithms
nptel-quiz
sorting
time-complexity
+
–
0
votes
1
answer
7
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
4
answers
8
NPTEL
If the value of a counting semaphore s = 4, then the maximum number of requests for the critical section before it blocks is _____________ ? 1. 0 2. 1 3. 2 4. 4
If the value of a counting semaphore s = 4, then the maximum number of requests for the critical section before it blocks is _____________ ?1. 02. 13. 24. 4
gulsanchouhan
2.0k
views
gulsanchouhan
asked
Oct 14, 2017
Operating System
operating-system
nptel-quiz
+
–
2
votes
1
answer
9
NPTEL Assignment Question
Suppose we want to synchronize two concurrent processes P and Q
Suppose we want to synchronize two concurrent processes P and Q
rsansiya111
543
views
rsansiya111
asked
Dec 8, 2021
Operating System
nptel-quiz
operating-system
process-synchronization
binary-semaphore
+
–
1
votes
2
answers
10
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
+
–
2
votes
1
answer
11
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
867
views
rsansiya111
asked
Dec 8, 2021
Algorithms
nptel-quiz
merge-sort
time-complexity
+
–
1
votes
3
answers
12
NPTEL
State True/False Bakery algorithm ensures that no process is starved. 1. True 2. False
State True/False Bakery algorithm ensures that no process is starved.1. True2. False
gulsanchouhan
814
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
nptel-quiz
+
–
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
+
–
1
votes
1
answer
14
Security
Suppose a source code has bigger overflow vulnerabilities. Which of the following can cause buffer overflow vulnerabilities a. Scanf("%s",...) b. Strcpy(destination, source) c. Send command use for network connection Options are 1. Only a 2. b and c 3. a and b 4. All of the above
Suppose a source code has bigger overflow vulnerabilities. Which of the following can cause buffer overflow vulnerabilities a. Scanf("%s",...) b. Strcpy(destination, s...
Suman Acharya
498
views
Suman Acharya
asked
Sep 19, 2017
Operating System
operating-system
nptel-quiz
+
–
0
votes
1
answer
15
Nptel Assignment Question
rsansiya111
566
views
rsansiya111
asked
Dec 8, 2021
Computer Networks
nptel-quiz
+
–
0
votes
1
answer
16
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
17
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
+
–
1
votes
1
answer
18
NPTEL Assignment Question
Natural language constructs are (A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options
Natural language constructs are(A) Unambiguous (B) Ambiguous (C) May be unambiguous or ambiguous (D) None of the other options
rsansiya111
826
views
rsansiya111
asked
Dec 6, 2021
Compiler Design
compiler-design
nptel-quiz
ambiguous-grammar
+
–
1
votes
1
answer
19
NPTEL Assignment Question
In an array A[1..n] of n distinct elements, if i < j and A[i] > A[j], then the pair (i,j) is called an inversion of A. How many inversions are there in the array A = {n,n-1,n-2,...,3,2,1}? n(n-1) / 2 n(n+1) / 2 2n(n+1) None
In an array A[1..n] of n distinct elements, if i < j and A[i] A[j], then the pair (i,j) is called an inversion of A.How many inversions are there in the array A = {n,n-1...
rsansiya111
333
views
rsansiya111
asked
Dec 7, 2021
Algorithms
nptel-quiz
sorting
inversion
+
–
0
votes
1
answer
20
NPTEL Assignment Question
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change P only Q only Neither P nor Q Both P and Q
Let G be a weighted connected undirected graph with distinct positive edge weights.If every edge weight is increased by the same value, then which of the following statem...
rsansiya111
610
views
rsansiya111
asked
Dec 7, 2021
Algorithms
nptel-quiz
graph-algorithms
minimum-spanning-tree
shortest-path
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register