How many of the following matrices have an eigenvalue 1? (A) one (B) two (C) three (D) four Answer: (A) Explanation: EigenValues of is given… Read More
Aishwarya studies either computer science or mathematics everyday. If she studies computer science on a day, then the probability that she studies mathematics the next… Read More
If P, Q, R are Boolean variables, then (P + Q’)(PQ’ + PR)(P’R’ + Q’) simplifies (A) PQ’ (B) PR’ (C) PQ’ + R (D)… Read More
A point on a curve is said to be an extremum if it is a local minimum or a local maximum. The number of distinct… Read More
C++ programming language allows both auto(or stack allocated) and dynamically allocated objects. In java & C#, all objects must be dynamically allocated using new. C++… Read More
Given a singly linked list, sort it using bubble sort. Input : 10->30->20->5 Output : 5->10->20->30 Input : 20->4->3 Output : 3->4->20 // C program… Read More
The C standard says following about main function in C. The function called at program startup is named main. The implementation declares no prototype for… Read More
A year is a leap year if the following conditions are satisfied:  The year is multiple of 400. The year is multiple of 4 and… Read More
Given two numbers, write a C program to swap the given numbers. Input : x = 10, y = 20; Output : x = 20,… Read More
Like Stack, Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO).… Read More
Predict the output of following C programs.  C // PROGRAM 1 #include <stdio.h> int main(void) {     int arr[] = {10, 20};     int *p = arr;… Read More
The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.… Read More
The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.… Read More
The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.… Read More
The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.… Read More