Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which of the following should be used for freeing the memory allocated in the following C code?
#include struct p{ struct p *next; int x;};int main(){ struct p *p1 = (struct p*)malloc(sizeof(struct p)); p1->x = 1; p1->next = (struct p*)malloc(sizeof(struct p)); return 0;}
How far is point 'R' from Point 'T'? Statement (I): Point 'R' is 5 metres to the north of point 'M'. Point 'U' is 4 metres to the east of point 'R'. Point 'T' is to the west of point 'R' such that points 'U' 'R' and 'T' form a straight line of  metres. Statement (II): Point 'Z' is metres to the south of point 'T'. Point 'U' is  metres to the east of point 'T'. Point 'M' is  metres to the east of point 'Z'. Point 'R' is  metres to the north of point 'M'. Point 'R' lies on the line formed by joining points 'T' and 'U'.
Garima starts walking towards the south from point R. He walks for 5m to reach Point S then turns right and walks for 2m to reach point T from there he turns left and walks for 3m to reach Point Z. He then turns right from point Z and walks for 6m to reach point Y and then turns right and walks for 3m to reach point X. He then turns right from point X and walks for 4m to reach point W and then turns left and walks for 5m to reach point V and then turns left and walks for 4m till point U and stops. What is the shortest distance between point V and point R?
Point A is 3m in the north of point B. Point D is 2m in the east of point E. Point F is 9m in the west of point G. Point C is 4m in the west of point B. Point C is 3m in the south of point D. Point F is 5m in the south of point E. Point H is 5m in the north of point G. What is the shortest distance between point H and point A?
A doubly linked list is declared as struct Node{                 int Value;                 struct Note*fwd;                 struct Node * Bwd; } Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly liked list, if it is assumed that X points to neither the first nor the last node of the list?
Point P is 4m in the west of point V. Point R is 6m in the north of point Q. Point T is 5m in the south of point S. Point V is in the middle of point R and Q. Point U is 5m in the east of point R. Point V is in north of point Q. Point S is 5m in the east of point V. What is the area of triangle formed by point P, R and Q?
Study the following information and answer the questions. Point A is 8m to the west of Point B. Point C is 4m to the south of Point B. Point D is 4m to the east of Point C. Point F is 6m to the north of Point D. Point E is 8m to the west of Point F. Point G is 2m to the south of Point E. How far and in which direction is Point G from Point A?
Study the following information and answer the questions. Point A is 8m to the west of Point B. Point C is 4m to the south of Point B. Point D is 4m to the east of Point C. Point F is 6m to the north of Point D. Point E is 8m to the west of Point F. Point G is 2m to the south of Point E. If point G is 4m to the north of Point H, then what is the distance between H and D?
Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as
What is the output of this program? #include
using namespace std;
struct sec {
int a;
char b;
};
int main()
{
struct sec s ={25,50};
struct sec *ps =(struct sec *)&s;
cout << ps->a << ps->b;
return 0;
}