-
Why would you use a structure?
Skill/Topic: Variables and PointersA) You use a structure to access parts of a dataB) You use a structure to group together related data.C) You use a structure to declare an instance of data groupExplanation: Structure is used to group all related data together
-
How to reverse all the no using a single link list?
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...
-
_____ is the common programming technique used for hashing in all hashing functions.
Skill/Topic: Hash TableA) Bit Shifting
-
Design and develop database to track incoming and outgoing hard copy letters
Design and develop a database to track incoming and outgoing hard copy letters for a division with 35 employees are expected to use the database, ranging from clerical to managerial staff. Based on the information provided.What steps would you take to complete the assignment?Describe three or more exceptional features that you would design as part of the database?
-
The destroyList() member function deletes the contents of the linked list and ________________.
Skill/Topic: Linked ListA) does not delete the linked list itselfB) delete the linked list itselfC) adds the linked list itselfD) None of the aboveExplanation: The destructor is a member function called when the instance of the LinkedList class is deleted using the delete operator. In the example shown next, the destructor contains one statement that calls the destroyList() member function.The destroyList()...
Prabhakar
- Dec 20th, 2006
(B).
-
A pointer to a pointer is a variable whose value is an ________ of another _______ variable.
Skill/Topic: Variables and PointersA) Address, PointerExplanation: A pointer to a pointer is a variable whose value is an address of another pointer variable
ratish
- Dec 26th, 2006
Address,pointer
-
-
The size of a structure is determines by the Product of sizes of all primitive data types within the structure?
Skill/Topic: Variables and PointersA) TrueB) FalseExplanation: The size of a structure is the sum of the sizes of all the primitive data types within the structure
Chantigd
- Jan 1st, 2007
There is concept called as "Padding" which is completely Operating system dependend.ex:struct a{ int a; int b; char c; int d;}Answer : 2 + 2 + 1 + 2 (bytes) = 7Bytes (not correct always) can be 8byte...
-
Why is the binary numbering system used in computing?
Skill/Topic: Memory, Abstract Data Types, and AddressesA) The binary numbering system is used in computing because it contains 2 digits that can be stored by changing the state of a transistor. Off represents 0 and On represents 1.
mahesh
- Dec 12th, 2006
Because Internally data is stored in transisitor and it can be turned on or off depending on the voltage level .1-ON0-OffHence data is stored as 1's and 0's
-
Pointer to a pointer is used in a program to ?
Skill/Topic: Variables and PointersA) arrange data by moving data in memoryB) arrange data by moving pointer in memoryC) arrange data without having to move data in memory.D) None of the aboveExplanation: Pointer to a pointer is used in a program to arrange data without having to move data in memory.
-
The symbol * is also called as _________________.
Skill/Topic: Variables and PointersA) pointer dereferencing operatorExplanation: (sometimes called as dereferencing operator)
warisha
- Mar 18th, 2006
the symbol " *" is also called as "indirection operator".
-
Allocating memory at runtime is also called as?
Skill/Topic: ArrayA) Statically allocating memoryB) Dynamically allocating memoryC) Sequentially allocating memoryD) All of the aboveExplanation: Allocating memory at runtime is called a dynamically allocating memory. In this,you dynamically allocate memory by using the new operator when declaring the array, for example:int grades[] = new int[10];
-
_________ method places a value onto the top of a stack.
Skill/Topic: Stacks using an ArrayA) push() member methodB) pop() member methodC) isFull() member methodD) isEmpty() member methodExplanation: Push is the direction that data is being added to the stack. push() member method places a value onto the top of a stack.
Girish.T
- Sep 23rd, 2006
Ans is a) push()method
-
Popping removes an item from the stack.
Skill/Topic: Stacks using an ArrayA) TrueB) FalseExplanation: Popping is the reverse process of pushing: it removes an item from the stack. It is important to understand that popping an item off the stack doesn’t copy the item. Once an item is popped from the stack, the item is no longer available on the stack, although the value remains in the array
samiksc
- Jan 19th, 2006
True -- popping removes an item from the stack provided the stack is not empty.
-
What is the purpose of the isEmpty() member method?
Skill/Topic: Stacks using an ArrayA) The isEmpty() member method determines if a value is at the top of the stack and is called before an attempt is made to remove the value
sivanesh.a
- Feb 6th, 2007
To check whether the stack is empty or not...if yes returns 1 else returns 0.
-
What is a queue ?
Skill/Topic: QueueA) A Queue is a sequential organization of data.
samiksc
- Jan 19th, 2006
A queue is a first in first out type of data structure.An element is inserted at the last position and an element is always taken out from the first position.
-
The isFull() member method is called within the enqueue process to determine ?
Skill/Topic: QueueA) if there is room to place another item in the queue.B) if there is an item in the queue to be removedC) if there is an item in the queue to be locked
-
The dequeue process removes data from the front of the queue.
Skill/Topic: QueueA) TrueB) False
Masthan vali
- Aug 12th, 2006
DQ means double ended queue. we can remove the data from any end of the Queue.
-
What is a linked list?
Skill/Topic: Linked ListA) A linked list is a data structure consisting of elements called nodes. Each node points to the next and the previous node, thereby linking nodes together to form a linked list.
shekar
- Nov 22nd, 2006
In a linked list is one of the fundamental data structures used in It consists of a sequence of nodes, each containing arbitrary data fields and one or two ("links") pointing to...
-
Look at the following example LinkedList(){ front = NULL; back = NULL;}In this example, Both the front and back pointers are assigned a NULL value.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: In this example of a the LinkedList constructor , Both the front and back pointers are assigned a NULL value.The purpose of the constructor in the linked list example is to initialize the front and back pointers as shown in the following definition. Both the front and back pointers are assigned a NULL value, which is used by the appendNode() member...
Data Structures Interview Questions
Ans