csabill

• Nov 2nd, 2006

void reverse() { Node < T > *currentNode = head, *nextNode = currentNode->next; while(nextNode) { Node < T > *newNextNode = nextNode->next; nextNode->next = currentNode; cur...

f2003062

• Oct 30th, 2006

A quite different way..! but same as the previous logic written by Rohit..!struct linkedlist { int x; struct linkedlist* next;}*head;Assume that "head" contains some nos ...example: 1->2->3->4...

yogitag

• Mar 4th, 2012

Data Structure is the way of organizing data as per the requirement and defining few operations that can be operated on it

snyder

• Feb 27th, 2012

Data Structure is way of organizing data in memory so as to use it in an efficient manner and is best suited for the algorithm to be implemented.

• If the depth of a tree is 3 levels, then what is the Size of the Tree?

Skill/Topic: TreeA) 8Explanation: You calculate the size of a tree by using the following formula: size = 2 ^ depth If the depth is 3 levels, then the size is 8, as shown here: 8 = 2 ^ 3

Shubh

• Nov 5th, 2018

ANS 8 is correct, 7 is not listed.

durga

• Apr 8th, 2015

But y v shld use 2^n or 2^n-2 formula only can any one give me the explanation

• _____________ Memory is Volatile.

Skill/Topic: Memory, Abstract Data Types, and AddressesA) CacheB) Random AccessC) VirtualD) MainExplanation: Random Access Memory is also called a Main Memory. It is called a Volatile memory because; instructions and data contained in main memory are lost once the computer is powered down.

ashlee_shayne

• Mar 3rd, 2009

B. Random Access

vaishali_naidu

• Feb 26th, 2009

Cache,Main memory and RAM all are volatile memory.