Question
counter = 0;
for (i = 1; i < = n; i++)
{
if (A[i] == 1)
counter++;
else {
f(counter);
counter = 0;
}
}
The complexity of this program fragment is
a.
Ω(n^2)
b.
Ω(nlog n) and O(n^2)
c.
θ(n)
d.
O(n)
Posted under GATE cse question paper Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Let A[1, ..., n] be an array storing a bit (1 or 0) at each location, and f(m) is a unction whose time complexity is θ(m). Consider the following program fragment written in a C...
Similar Questions
Discover Related MCQs
Q. The time complexity of the following C function is (assume n > 0)
int recursive (int n) {
if (n == 1)
return (1);
else
return (recursive (n - 1) + recursive (n - 1));
}
View solution
Q. A program takes as input a balanced binary search tree with n leaf nodes and computes the value of a function g(x) for each node x. If the cost of computing g(x) is min{no. of leaf-nodes in left-subtree of x, no. of leaf-nodes in right-subtree of x} then the worst-case time complexity of the program is
View solution
Q. Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2.
Group-1 Group-2
P. Functional 1. Command-based, procedural
Q. Logic 2. Imperative, abstract data type
R. Object-oriented 3. Side-effect free, declarative, expression evaluation
S. Imperative 4. Declarative, clausal representation, theorem proving
View solution
Q. How many B-tree of order 3 can be constructed using 3 district keys?
View solution
Q. Which of the following is a minimum number of leaf nodes in a B-Tree of order 4 with height 3?
View solution
Q. If we are accessing a block in 100 block index using binary search, how many block read is Required to access the data in 100th block?
View solution
Q. Find the minimum number of elements that need to be placed in a B-tree of order 3 to reach 4 Levels?
View solution
Q. Construct a B+ tree for (1, 4, 7, 10, 17, 21, 31, 25, 19, 20, 28, 42) with n = 4. What is the key value at the root node?
View solution
Q. Calculate the order of B – tree using the following:
Block size = 512 bytes
Record pointer = 7 bytes
Block pointer = 6 bytes
Key filed = 9 bytes
View solution
Q. How many B+ trees of order 3 can be constructed using 3 district keys?
View solution
Q. Find the order of B+ tree leaf node using the following:
Block size = 512 bytes
Record pointer = 7 bytes
Block pointer = 6 bytes
Key field = 9 bytes
View solution
Q. What is the name for the adjacency matrix?
View solution
Q. To identify articulation points in a graph, ……….is very useful?
View solution
Q. The name backtrack was first coined by ………..
View solution
Q. In the backtracking Method, the modified criterion function is also known as………
View solution
Q. In backtracking, the function which needs to be maximized or minimized for a given problem is known as………….
View solution
Q. If we represent solution space in the form of a tree, then the tree is referred as………
View solution
Q. The solution space tree of 8 queens contain…………
View solution
Q. Each node in the tree organization defines………..
View solution
Q. In sum of subsets problem, if n weights are considered then, the solution space consists of………
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
