-
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?
-
The size of a tree is the number of nodes on the tree?
Skill/Topic: TreeA) TrueB) False
-
What is the difference between declaration and definition?
ashok reddy chenikala
- Aug 31st, 2011
Declaration means just identify the datatype and some memory allocation. If we print the value it gives garbage value.
Definition means declaration and assign some value to that variable. i.e. definition = declaration + initialization.jontyrodes
- May 9th, 2008
Definitionint * ii is definitionsince we can store a address without allocating memory*i is definition since we can assign *i = 4 ;Definitionchar *cc is definition since it can store a address of a ch...
-
DS Trees
Is it possible to implement trees using arrays ? If yes, how?
hrshksh
- May 9th, 2010
This questions is ambigious. There are a lot of differences between a tree, k ordered tree, binary tree. There is no harm for any implementation to have array or list as the desired mode of implementa...
-
Which of the following abstract data types are NOT used by Integer Abstract Data type group?
Skill/Topic: Memory, Abstract Data Types, and AddressesA) ShortB) IntC) floatD) longExplanation: The integer abstract data type group consists of four abstract data types used to reserve memory to store whole numbers: byte, short, int , and long
Naila
- Jun 2nd, 2017
(C) float
-
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
-
How many parts are there in a declaration statement?
Skill/Topic: Variables and PointersA) 1B) 2C) 3D) 4
ahmarshi
- May 19th, 2007
3 parts. i. SCOPE (private/public/protected) ii. DATATYPE (int, short, long, byte, string, char, etc...)iii. VARIABLE NAMEe.g.private int id;private string name;
M.Ahmar
- May 19th, 2007
3 Parts.Scope (private/public/protected), DataType (integer, short, byte, string, etc...), Variable nameExamples:private int i;public string name;
-
What is the difference bitween NULL AND VOID pointer?
Gaurav bisht
- Nov 9th, 2011
NULL pointer means- it points to nothing
whereas,void pointer refers to the fact that the pointer has no data type declared with it and it can be used to point variable of any data-type-int,float,etc..
ex-int*(void_ptr)rohini.nitd
- Aug 17th, 2009
NULL pointer says that it is not pointing to any object, but a VOID pointer says that it can point to any object.
-
-
Priority Queue
What is Priority Queue? Explain with example.
Suresh-Blore
- Jul 25th, 2011
Waiting queue may not operate on strictly first in first out basis,,but on some complex priority scheme based on such factors as what compiler is being used,the execution time required,number of print lines etc.The resulting queue is called Priority queue.
Vishesh Bibhay
- Jul 9th, 2011
Hello!priority queue is a data structure which exhibits two properties1.structure property2.order propertyStructure property means that the queue will be a complete binary treeOrder property ...
-
Deletions at Both the Ends
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.a. Input-restricted dequeb. Output-restricted dequec. Priority queuesd. None of above
Shilpa chavare
- Sep 12th, 2011
Your qtn itself has the answer.. wen insertion is restricted to one end, then it obviously has to be input restricted dequeue..:)
-
Data Structure
Data structures provide many positive aspects like minimum disk-space efficiency, proper data management but at cost of complexity. What is your opinion?
snyder
- Mar 10th, 2012
Although you have to deal with the complexity but you curb many problems that the users may experience. For eg. imagine how much data is stored in the servers of facebook. . .its massive . . .and ye...
Rajan Patekar
- Aug 12th, 2011
Complexity is at the user side in understanding not for the compiler.
data structure is a way of organising and using the memory effectively and efficiently. -
Reverse Single Linked List
How will you reverse a single linked list which consists of nodes a to z using recursion?
sasibhushan.m
- Jul 31st, 2011
Node* reverse_recursive(node *root)
{
if(root->link != NULL)
{
reverse_recursive(root->link);
root->link->link = root;
return (root);
}
else
{
head = root;
}
} -
-
Ans