Data structure

How many times is the comparison-

ison i <= n performed in the

the following program?

int i = 60 , n = 100;

main ( ) {

w h i l e ( i <= n ){

i = i +2;

n = n−3;

}

}

• 12

• 13

• 14

• 15

Which of the following is the infix expression?

• +A*BC

• A+B*C

• ABC+*

• None of the above

A(){

int i= 0,n=0,j=0;

for( i=0;i<n;i++){

    for(j=0;j<i;j++){

    SOP("hello")

}}}

time complexity of given code:

• O(n)

• O(logn)

• O(n^2)

• O(n^3)

Which of the following is not a disadvantage to the usage of an array?

• Fixed size

• Insertion based on position

• Accessing elements at specified positions

• There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size
  

3. What is the time complexity to count the number of elements in the linked list?

• O(1)

• O(logn)

• O(n²)

• O(n)

Time complexity of f (x) = (x^2 + 5logx)

• O(x^2)

• O(x^3)

• O(logx)

• O(1)

What data structure would you mostly likely see in non recursive implementation

of a recursive algorithm?

• Linked List

• Double lists

• Tree

• stacks

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

• AB+ CD*E – FG /**

• AB + CD* E – F **G /

• AB + CD* E – * F * G /

• AB + CDE* – *F *G /

If the elements ’1’, ’2’, ’3’ and ’4’ are added in a stack, so what would be the order

for the removal?

• 1234

• 2134

• 4321

• 3123

The term push and pop is related to the

• array

• lists

• stacks

• All of these