A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Let S be a stack of size n ≥ 1. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform n pop operations. Assume that Push and pop operation take X seconds each, and Y seconds elapse between the end of one such stack operation and the start of the next operation. For m ≥ 1, define the stack-life of m as the time elapsed from the end of Push(m) to the start of the pop operation that removes m from S. The average stack-life of an element of this stack is
a. n (X + Y)
b. 3Y + 2X
c. n (X + Y) - X
d. Y + 2X
Answer:n (X + Y) - X
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

How many queues are needed to implement a stack. Consider the situation where no other data structure like arrays, linked list is available to you.
Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?
Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
Consider the following C program segment:

char p[20];
char *s = "string";
int length = strlen(s);
int i;
for (i = 0; i < length; i++)
p[i] = s[length — i];
printf("%s",p);

The output of the program is
Which of the following is true about linked list implementation of stack?
The following C declarations

struct node
{
int i;
float j;
};
struct node *s[10] ;

define s to be
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
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest?
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));
}
Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x , +, -. The postfix expression corresponding to the infix expression a + b × c - d ^ e ^ f is
Get it on Google Play

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

NET General Paper 1

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.