-
Bit Transformation
The process of transforming 1 bit pattern into another is called ______________
snyder
- Feb 29th, 2012
It is called conditioning. This question is actually related to electronics and you can find it in "Telecommunication Networks".
-
Equivalent Pointer Expression
What is the equivalent pointer expression for referring the same element a[i][j][k][l]
KS111
- Jun 21st, 2010
Similar to what Shekhar has already mentioned, with a small correction:To print the value of a[i][j][k][l], we need to use *(*(*(*(a+i) + j) + k) + l).Explanation:Let us first take a simple example of...
-
Consider a linked list implemented of a queue with two pointers: front and rear. What is the time needed to insert an element if the queue is of length n?
ankitschopra
- Nov 3rd, 2013
In Queue Insertion can only take place in the end. Since we have pointer to front and rear, We only require one step to insert at the rear.
Shahnawaz
- Sep 2nd, 2013
O(1). Insert element at rear.
-
Let A be an adjacency matrix of a directed graph in G
Let A be an adjacency matrix of a directed graph in G. Then sum of all entries in the matrix is equal to
Select one:
a) twice the number of vertices in G
b) the number of edges in G
c) the number of vertices in G
d) twice the number of edges in G
-
Container Data Structures
What are the container data structures other than Arrays, Lists and Queues?
-
What does the symbol * signifies?
Skill/Topic: Variables and PointersA) Tells the computer that you are declaring a pointerB) Tells the computer that you are declaring a variableC) Both a) and b)D) None of the aboveExplanation: The symbol * Tells the computer that you are declaring a pointer
Zalmodegikos
- Dec 5th, 2009
Seeing as a pointer is a variable, answer C might be a good bet.However, it's obvious that the question needs clarification.
-
__________ Method removes the value from the top of a stack?
Skill/Topic: Stacks using an ArrayA) push() member methodB) pop() member methodC) isFull() member methodD) isEmpty() member methodExplanation: The pop() member method removes the value from the top of a stack, which is then returned by the pop() member method to the statement that calls the pop() member method.
-
A Linked list can grow and shrink in size dynamically at _______.
Skill/Topic: Linked ListA) BeginningB) Run timeC) EndingD) None of the above
manishmodgil
- Dec 28th, 2007
Runtime.The node deleted could be freed.Memory for the new node could be allocated at run time , so size of the linked-list is only limited to the physical memory available.
-
The node in a single linked list can reference the previous node in the linked list.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: A single linked list is a linked list consisting of nodes that have only the next element and not the previous element. This links the node to only the next node in the linked list. There is no way for the node to reference the previous node in the linked list
Vikram.N
- Sep 3rd, 2007
True: Only in the case of a circular linked list with two elements!
-
Value of the first linked list index is _______.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) OneB) ZeroC) -1D) None of the above
laxmanavasu
- Mar 11th, 2015
B)Zero
-
What is a leaf node?
Skill/Topic: TreeA) A leaf node is the last node on a branch
Manish
- Jan 13th, 2007
A leaf node is a node which does not contain any child node.A leaf node have zero or one node is connected to it.
-
The depth of a tree is the _______ of a tree.
Skill/Topic: TreeA) number of nodes on the treeB) number of levels of a treeC) Number of branches
-
What is the most efficient way of finding a loop in linklist?
Traversing the link list with two pointers, both traversing at different speed.
-
Boolean Expression
The boolean expression X + XY equals 1. X + Y2. Y + YX3. XY + YX4. None of these
rohini.nitd
- Aug 17th, 2009
X+XY=X(1+Y)from boolean properties we know that 1+Y=Yso X+XY=Xnone of these is answer.
-
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
-
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".
-
Elements of an array are stored _______ in memory.
Skill/Topic: ArrayA) PeriodicalB) SequentiallyC) ParallelyD) None of the aboveExplanation: Elements of an array are stored sequentially in memory. For example,First, create an array called letters and assign characters to it, as shown here: char letters[3];letters[0] = 'C';letters[1] = 'B';letters[2] = 'A';In this, each letter appears one after the other in memory. This is because these values are...
bahwesh
- Feb 21st, 2006
basically elements are stored in contineous memory lacations, but as per need we can also store them in chunks of memory. by making use of link list. various other techniques can also be used
-
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.
-
Link list does not have any advantage when compared to an Array.
Skill/Topic: Linked ListA) TrueB) FalseExplanation: A linked list can grow and shrink in size dynamically at runtime, whereas an array is set to a fixed size at compile time.
manishmodgil
- Dec 28th, 2007
FALSEAdvantages of linked list :1. Insertion and deletion are less costly.2. Dynamic addition of new elements is possible.3. Sorting is less costly.
Vikram.N
- Sep 3rd, 2007
False: In linked list, items can be inserted anywhere with O(1), while in an array you need to shift certain elements, i.e O(n). Same applies to deletion. Also every node can contain multiple values.
-
The benefit of using a stack-linked list is that the number of nodes on the stack can increase or decrease as needed while the program runs.
Skill/Topic: Stacks using Linked ListA) TrueB) False
manisha.somavanshi
- Dec 17th, 2007
If we use stack as an array there is limitation of size. but if we use stack as linked list we can dynamically store elements on the stack.
Pushpa
- Nov 7th, 2007
True
Data Structures Interview Questions
Ans