Here Total Question: 40
To show all question with answer click: See Answer or take exam
1. Which of the following is correct to initialize arrays in C?
2. What is the access methodology in array?
3. What is the output for the following C code segment?
int i;
if (printf("0")) i = 5;
else i = 3;
printf("%d", i);
4. In a shop, customers are provided the service as a first come first serve policy, but some special customers can be served at any time based on their importance. Which data structure most fits this scenario?
5. Which of the following is correct?
6. Which of the following data structures is more suitable for graph representation in Floyd-Warshall Algorithm?
7. Which of the following is not a method of the Thread class?
8. Which of the following statements is correct regarding abstract classes?
9. The feature in object-oriented programming that allows the same operation to be carried out differently, depending on the object, is:
10. In the following graph, determine the cost of the shortest path between node 1 and node 4.
11. Suppose you are searching student data using student number as the key. Which of the following arrangements of the student data is suited for binary search?
12. What is the output of this Java program?
class Test { int i; } class Main { public static void main(String args[]) {
Test t; System.out.println(t.i); } }
13. Suppose you are using an HTML browser at a client machine C to access a static HTML webpage hosted on an HTTP server S. The page contains exactly one static embedded image which also resides at S. Assuming no web caching, which of the following is correct when you load the webpage along with the embedded image?
14. Converting a primitive type data into its corresponding wrapper class object instance is called ___.
Converting a primitive type data into its corresponding wrapper class object instance is called ___.
15. An n x n array v is defined as follows:
v[i, j] = i - j for all
i, j, 1 <= i <= n, 1 <= j <= n
The sum of the elements of the array v is:
16. The combination of an IP address and a port number is known as ___.
17. To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is ___.
18. Consider the function fun(x, y) below. That is the value of fun(4, 3)?
int fun(int x, int y) { if (x == 0) return y; return fun(x - 1, x + y); }
19. What does the following function do?
int fun(int x, int y)
{ if (y == 0)
return 0; return (x + fun(x, y - 1)); }
20. Which of the following is not an in-place algorithm?
21. Which of the following statements is/are TRUE for an undirected graph?
P: Number of odd degree vertices is even
Q: Sum of degrees of all vertices is even
22. What is the full form of SMTP?
23. Table Employee has 10 records. It has a non-NULL SALARY column which is also UNIQUE. The SQL statement
SELECT COUNT(*) FROM Employee
WHERE SALARY > ANY (SELECT SALARY FROM EMPLOYEE);
24. An inversion in an array A[] is a pair (A[i], A[j]) such that A[i] > A[j] and i < j. An array will have maximum number of inversions if it is:
25. Which of the following is the regular expression to represent all the binary strings with odd number of 1's?
26. Which of the following data structures can be used both as Stack and Queue?
27. What is the correct output of the following C program statements?
int array[] = {6, 7, 8, 9, 0, 1, 2, 4, 5, 6}, *p = array+5;
printf("%d\n", p[1]);
28. What does the following function do for a given Linked List with the first node as head?
void fun1(struct node* head)
{ if (head == NULL) return; fun1(head->next); printf("%d", head->data); }
29. Suppose you want to insert n elements into an empty linked list while maintaining the sorted order. What is the worst-case time complexity?
30. Which of the following operations is not O(1) for an array of sorted data? You may assume that array elements are distinct.
31. Which protocol dynamically assigns IP addresses in a TCP/IP network?
32. The Post-order traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The In-order traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1, 3. What is the height of the above
33. Suppose you have an 8-bit binary number N. Which of the following operations does not change its lower 4 bits?
34. Which of the following is the appropriate set of test cases, (A, B) when the part of a program shown is tested by decision condition coverage (branch coverage)?
if (A OR B)
X = X+1;
else X = X-1;
35. Consider a virtual memory system where three pages are allocated for real memory. If the page replacement algorithm used is FIFO, how many page replacements take place for the access sequence: 1, 3, 2, 1, 4, 5, 2, 3, 4, 5?
36. #include
struct Testnode { char x, y, z; };
int main() {
struct Testnode node1 = {'(', '2', 'c'+3};
struct Testnode *node2 = &node1;
printf("%c, %c", *((char*)node2+1), *((char*)node2+2));
return 0;
}
37. The minimum number of comparisons required to determine if an integer appears more than n/2 times in an array of integers is:
38. Consider an Entity-relationship from entity set E1 to entity set E2. If E1 and E2 participate totally in R and cardinality of E1 is greater than the cardinality of E2. Which of the following is true about R?
39. Suppose, Y is an integer variable whose value is either 0 or 1. Which of the following is the equivalent of the statement: if (Y==0) Y=1; else Y=0;?
40. Following table shows the delivery record of an online shop. Which of the SQL statements results in the largest value?
