pointer-2

Pointers Output
Send Feedback

What will happen in this code?

int a = 100, b = 200;
int *p = &a, *q = &b; 

p = q;


Options
This problem may have one or more correct answers

q now points to a


What will be the output ?
Send Feedback
int a = 7;
int b = 17;
int *c = &b;
*c = 7; 

cout << a << " “ << b << endl;


Options
This problem may have one or more correct answers

17 17



What will be the output ?
Send Feedback
 int a = 50;
 int *ptr = &a;
 int *q = ptr;
 (*q)++; 

cout << a << endl;



Options
This problem may have one or more correct answers

None of these



What will be the output ?
Send Feedback
 int a = 50;
 int *ptr = &a;
 cout << (*ptr)++ << “ “; 

cout << a << endl;


Options
This problem may have one or more correct answers

50 50




What will be the output ?
Send Feedback
int *ptr = 0;
int a = 10;
*ptr = a; 

cout << *ptr << endl;


This problem may have one or more correct answers


 

Comments

Post a Comment

Popular posts from this blog

Kth Smallest and Largest Element of Array

  You are given an array ‘Arr’ consisting of ‘N’ distinct integers and a positive integer ‘K’. Find out Kth smallest and Kth largest element of the array. It is guaranteed that K is not greater than the size of the array. Example: Let ‘N’ = 4, ‘Arr’ be [1, 2, 5, 4] and ‘K’ = 3. then the elements of this array in ascending order is [1, 2, 4, 5]. Clearly, the 3rd smallest and largest element of this array is 4 and 2 respectively. Input format: The first line of input contains an integer ‘T’ denoting the number of test cases. The next 2*T lines represent the ‘T’ test cases. The first line of each test case contains two space-separated integers ‘N’ and ‘K’ respectively. The second line of the test case contains ‘N’ space-separated integers representing elements of the array ‘Arr’. Output format : For each test case, print a line consisting of two space-separated integers that represent the Kth smallest and Kth largest elements of the array. Note: You do not need to print anythin...
Read more

Code : All connected components

  Given an undirected graph G(V,E), find and print all the connected components of the given graph G. Note: 1. V is the number of vertices present in graph G and vertices are numbered from 0 to V-1. 2. E is the number of edges present in graph G. 3. You need to take input in main and create a function which should return all the connected components. And then print them in the main, not inside function. Print different components in new line. And each component should be printed in increasing order (separated by space). Order of different components doesn't matter. Input Format : The first line of input contains two integers, that denote the value of V and E. Each of the following E lines contains two space separated integers, that denote that there exists an edge between vertex a and b. Output Format : Print different components in new line. And each component should be printed in increasing order of vertices (separated by space). Order of different components doesn't matter....
Read more

Code : Queue Using LL

  Implement a Queue Data Structure specifically to store integer data using a Singly Linked List. The data members should be private. You need to implement the following public functions : 1. Constructor: It initialises the data members as required. 2. enqueue(data) : This function should take one argument of type integer. It enqueues the element into the queue and returns nothing. 3. dequeue() : It dequeues/removes the element from the front of the queue and in turn, returns the element being dequeued or removed. In case the queue is empty, it returns -1. 4. front() : It returns the element being kept at the front of the queue. In case the queue is empty, it returns -1. 5. getSize() : It returns the size of the queue at any given instance of time. 6. isEmpty() : It returns a boolean value indicating whether the queue is empty or not. Operations Performed on the Stack: Query-1(Denoted by an integer 1): Enqueues an integer data to the queue. Query-2(Denoted by an integer 2): Dequeu...
Read more