Test my Merit My Results Create Exam

Higher Study | Programming and Data Structure

Programming in C Tree Linked List Queue Binary Heap Stack
Which of the following languages is more suited to a structured program?
Which of the following statements is/are incorrect?
Which of the following computer language is used for artificial intelligence?
What is the value of the following 'C' language expression in which x is an integer variable whose value is 4? (x - 5) ? 15: 25
Which of the following statement(s) is/are correct w.r.t 'C' language? (i) A part of the array can be passed to the function instead of the whole array. (ii) Numeric array elements cannot be assigned initial values if the array is defined as a pointer variable.
Consider a standard circular queue ‘q’ implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q[1], .... q[10]. The front and rear pointers are initialized to point at q[2]. In which position will the ninth element be added ?
Which one of the following is not correct when we define either a class that does not implement either a mathematical entity like a matrix or a complex number or a low level type such as linked list?
Consider the following code.
Consider the following pseudo-code fragment, where a and b are integer variables that have been initialized: /* Pre-conditions : (a > 1 ∧ a < b) */ /* Assume that overflow never occurs */ int x = 0; int p = 1; while (p < b) { p = p * a; x = x + 1; } When the while loop terminates, what will be the value of x in terms of a and b ?
The program written for binary search, calculates the midpoint of the span as mid : = (Low + High)/2. The program works well if the number of elements in the list is small (about 32,000) but it behaves abnormally when the number of elements is large. This can be avoided by performing the calculation as:
When an applet begins, which of the following sequence methods is CORRECT? 1) start() 2) paint() 3) init()
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is:
In context of Java Threads, which of the following statements are true? I: sleep () and yield () are static methods in thread class II: yield () voluntarily relinquishes CPU to other threads. III: Daemon will terminate when all non-Daemon threads terminate.
When a circular queue is implemented in an array of the following condition holds when there is only one element in the queue?
What is the sequence of nodes when applying in-order traversal on the binary tree given below?
Ads