McqMate

Q. |
## Assuming int is of 4bytes, what is the size of int arr[15];? |

A. | 15 |

B. | 19 |

C. | 11 |

D. | 60 |

Answer» D. 60 |

1.6k

0

Do you find this helpful?

1

View all MCQs in

Data Structures (DS)No comments yet

- public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; while(temp.getNext() != head) temp = temp.getNext(); if(temp == head) { var = head.getItem(); head = null; return var; } temp.setNext(head.getNext()); var = head.getItem(); head = head.getNext(); return var; } What is the functionality of the following code? Choose the most appropriate answer.
- What is the functionality of the following code? Choose the most appropriate answer. public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; Node cur; while(temp.getNext() != head) { cur = temp; temp = temp.getNext(); } if(temp == head) { var = head.getItem(); head = null; return var; } var = temp.getItem(); cur.setNext(head); return var; }
- Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?
- What will be the value of top, if there is a size of stack STACK_SIZE is 5
- What will be the value of top, if there is a size of stack STACK_SIZE is 5
- Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
- Pushing an element into stack already having five elements and stack size of 5, then stack becomes
- A normal queue, if implemented using an array of size MAX_SIZE, gets full when
- Using division method, in a given hash table of size 157, the key of value 172 be placed at position
- What is the table size when the value of p is 7 in multiplication method of creating hash functions?