-
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.
-
Function f(x) is continuous
The function f(x) is continuous in [0,1], such that f(0)=-1, f(1/2)=1 and f(1)=-1, We can conclude that 1. f attains the value zero at least twice in [0,1] 2. f attains the value zero exactly once in [0,1] 3. f is non-zero in [0,1] 4. f attains the value zero exactly twice in [0,1]
zeptov
- Nov 7th, 2010
Colloquially, "continuous" means that you can graph it without picking up your pencil. What you can't tell is whether f(x) crosses the axis lots, or just twice.If the function were disco...
Ashish.Shekhar
- Feb 24th, 2008
Another way to look at the solution would be to just draw a mental plot of the given values on x and y axis and it would be easy to see that the graph would cut the x axis twice hence two zero's
-
An _________ data type is a keyword of a programming language that specifies the amount of memory needed to store data and the kind of data that will be stored in that memory location.
Skill/Topic: Memory, Abstract Data Types, and AddressesA) abstract
manishmodgil
- Dec 28th, 2007
Its ABSTRACT .The answer is conceptual and remains same for all the programming languages so this is the same answer even in case of C++ or .net
-
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...
-
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...
-
Can a linked list store data other than integers?
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) YesB) NoExplanation: Integers are usually used, but you can modify the data type of the data in the definition of the node to change the kind of data stored in the linked list.
-
scanf("%s",&A.name);
printf("Enter your age: ");
scanf("%d",&A.age);
printf("Name=%s Age=%d",A.name,A.age);
}">What would be the output of the following progam?union check{ char name[10]; int age;}A;void main(){ printf("Enter your name: "); scanf("%s",&A.name);printf("Enter your age: "); scanf("%d",&A.age);printf("Name=%s Age=%d",A.name,A.age);}
contact.nidhigupta
- Feb 19th, 2008
Since it is a union so both age and name will share same storage area. output will actually depend which data member was modified last. So in this case, since age is the last to be modified (entered), so name will come as character value of age.
-
What is a void pointer?
maheshnarala
- Jul 10th, 2010
A void pointer is a pointer that points nothing,it is also called generic pointer as we can type cast it to any pointer type.
bputhal
- Mar 25th, 2009
Void is generic pointer.Example void * vp;int *ip;char * cp;vp = ip;//okvp = cp;But viceversa not allowed.ie ip = vp; not allowed
-
What is the difference between function templates and function overloading?
prabhuvinoth
- Jun 29th, 2010
Function templates makes the function to performs the same task for different data type.Function overloading makes the function to performs different task for different parameters you are passing.
sureshds
- Dec 26th, 2009
In both cases function name is same.But, during function overloading, the function signature is different. Signature is like type of arguments, number of arguments and orderof arguments.For templates the signature is same and ready to accept any kind of data. There is no restriction on type of data.
-
Linear and Non-Linear Data Structures
Explain what are linear data structure & non-linear data structure?
-
Circular Queue
What is Circular Queue? Explain with examples.
siddhi parkar
- Jul 6th, 2014
In linear queue once the size is full we cannot add another items cause rear is at rightmost .
but in circular list to add element even if its full you will move front and rear in clockwise direction.piyushbeli
- Apr 13th, 2009
In a normal Queue when queue becomes full we can not add more items, so following items are lost. But in a circular queue when queue becomes full it will start overwriting the items from beg...
-
Pointer as Functions
How a value can be accessed through an address?How pointers can be used a funtions?
PPreksha
- Dec 15th, 2009
A value can be accesed through its address by use of pointers..Assigning any element as int x=10;int *p=&x;assigns the address of 'x' to pointer 'p'A pointer can be used as a funct...
-
Double Linked List
Make a middle node of doubly link list to the top of the list.
kronos
- Nov 17th, 2009
node *n1,*n2;n1 = n2 = head;while((n2->next) && (n2->next->next)){ n1 = n1->next; n2 = n2->next->next;]// n1 points to the mid...
f2003062
- Aug 19th, 2009
Lets say if the middle node of the doubly linked list is "middle" and the start node is "head".then the code as follows.middle->prev->next = middle->next;middle->next-&...
-
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
Data Structures Interview Questions
Ans