Related Questions

The correct statement for a function that takes pointer to a float, a pointer to a pointer to a char and returns a pointer to a pointer to a integer is ____________
The correct statement for a function that takes pointer to a float, a pointer to a pointer to a char and returns a pointer to a pointer to a integer is
When the friend operator overloading is converted into member operator overloading _______________
Which of the following statements is/are FALSE? (i) The size of an integer pointer is always less than the size of a float pointer. (ii) A pointer variable cannot be assigned NULL. (iii) A single pipe (|) symbol is used to represent logical OR operator in 'C'.
How many arguments will the subscript operator will take for overloading?
With reference to 8085 microprocessor, which of the following statements are correct? 1. The DAD instruction adds the contents of the specified register pair to the contents of the DE register pair 2. The program counter is an instruction pointer 3. Whenever an instruction uses the HL pointer, the addressing is called indirect addressing. 4. HL register pair is also called data pointer
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in the adjacency list of v. These are called twins of each other. A twin pointer is a pointer from an adjacency list entry to its twin. If |E| = m and |V| = n, and the memory size is not a constraint, what is the time complexity of the most efficient algorithm to set the twin pointer in each entry in each adjacency list?
The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?
Which of the following operations on pointers would never work out? (i) Pointer variables can be compared provided both variables point to objects of the same data type (ii) Addition of two pointers (iii) Division of a pointer with a constant (iv) Multiplication of a pointer with a constant