Data Structures

1. _____________ 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;
Latest Answer: Random Access memory...
(Answers : 6 ) Read / Add

Last Updated By sivanesh.a on February 06, 2007 Subscribe
Answers
2. What is a Register? Skill/Topic: Memory, Abstract Data Types, and AddressesA) A register is a small amount of memory
within the CPU that is used to temporarily store instructions and data.Explanation: Random Access Memor
Latest Answer: A register is nothing but a combination of number of flip-flops that has the capacity of ...
Last Updated By ranjan kumar on July 06, 2006 Subscribe
Answers
3. An _________ data type is a keyword of a programming language that specifies the amount of memory 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
Last Updated By Shilpi on June 18, 2006 Subscribe
Answers
4. What are the different Abstract Data Type Groups? Skill/Topic: Memory, Abstract Data Types, and AddressesA)
Integer, Floating-Type, Character & Boolean are the four different data type groupsExplanation: You determine the amount
of memory to reserve
Read / Add Answers Subscribe
5. 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 sto
Latest Answer: float...

Last Updated By swaroop on February 16, 2006 Subscribe
Answers
6. The byte abstract data type is the smallest abstract data type in the integer group and is declared The byte
abstract data type is the smallest abstract data type in the integer group and is declared by using the keyword
byte. Skill/Topic: Memory, Abstract Data Types, and AddressesA) TrueB) FalseExplanation: The byte abstract data type is
the smallest abstract data type in the integer group and is declared by using the keyw
Last Updated By Sameeksha on January 19, 2006 Subscribe
Answers
7. What is precision? Skill/Topic: Memory, Abstract Data Types, and AddressesA) Precision refers the accuracy of the
decimal portion of a value
Latest Answer: Precision is the number of digits allowed after the decimal point...

Answers
8. 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 re
Latest Answer: binary system is used based on 0 - off and 1 - on...

Answers
9. Signed numbers do not have any impact on the memory . Skill/Topic: Memory, Abstract Data Types, and
AddressesA) TrueB) FalseExplanation: The sign takes up 1 bit of memory that could otherwise be used to represent
a value. For example, a byte has 8 bits,
Latest Answer: (B) False: Sign of the number is the first bit of the storage allocated for that number. So you get ...
Answers
10. How is memory reserved using a declaration statement? Skill/Topic: Variables and PointersA) Memory is reserved
by using a data type in a declaration statement.Explanation: The form of a declaration statement varies depending on the
programming language y
Latest Answer: Dear Pramod, memory is allocated at the time of declaration of the variable.in ur programint i;if yo...

Last Updated By Pradeep Kumar on November 27, 2006 Subs
Answers
Total Answers and Comments: 3
Skill/Topic: Variables and Pointers
A) 1
B) 2
C) 3
D) 4
The Data type of a declaration statement tells how much _____ to
reserve and the kind of ______ that will be stored in that ______
location.
A) Memory, Data, Memory
Explanation: The Data type of a declaration statement tells how much memory to reserve and
the kind of data that will be stored in that memory location
What is a user-defined data type?
A user defined data type is a structure which contains variables of basic data types.
For example user can define a data type called employee which contains variables like string
empname, int deptno, float salary etc.
structures, union, class are all user defined datatypes.

A) A user-defined data type is a group of primitive data types defined by the programmer.
11. How many parts are there in a declaration statement? Skill/Topic: Variables and PointersA) 1B) 2C)
3D) 4
Latest Answer: 4 parts i. storage class(optional, default is auto) ii. data type modifier or qu...
Last Updated By A.Rajeshwari on March 07, 2007 Subscribe
Answers
12. The Data type of a declaration statement tells how much _____ to reserve and the kind of ______
tha The Data type of a declaration statement tells how much _____ to reserve and the kind of ______ that
will be stored in that ______ location. Skill/Topic: Variables and PointersA) Memory, Data,
MemoryExplanation: The Data type of a declaration statement tells how much memory to reserve and the
kind of data that will be stored in that memory
13. What is a user-defined data type? Skill/Topic: Variables and PointersA) A user-defined data type is a
group of primitive data types defined by the programmer.
Latest Answer: structures, union, class are all user defined datatypes....
Answers
14. The size of a structure is determines by the Product of sizes of all primitive data types within
th 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
Answers
15. 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 groupExpl
Latest Answer: the differnecebetween structure and union is ....the size of structure is sum of all data types
cont...
Last Updated By naidu saptagiri on November 02, 2006 Subscribe
Answers
16. A Pointer is a Variable. Skill/Topic: Variables and PointersA) FalseB) TrueExplanation: A pointer is a
variable and can be used as an element of a structure and as an attribute of a class in some programming
languages such as
Latest Answer: yeh, we can call pointer as a variable .it is used in some languages which supports its
use.the data...
Last Updated By warisha on March 18, 2006 Subscribe
Answers
17. 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
Latest Answer: address,pointer...

Last Updated By ratish on December 27, 2006 Subscribe
Answers
18. 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 aboveExplanat
Latest Answer: ans: C...

Answers
19. Char *ptGrade;Which is the data type in this declaration? Skill/Topic: Variables and PointersA) The
data type in this is CharExplanation: The data type of the memory address stored in the pointer is of
Character type
Latest Answer: The datatype is char * type that is the variable points to a location(stores the address of the
loca...
Last Updated By s on June 18, 2006 Subscribe
Answers
20. 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 sy
Latest Answer: ans: A...

21. Char *ptGrade;The use of the symbol ; ( semi colon) in the above example is wrong. Skill/Topic:
Variables and PointersA) TrueB) FalseExplanation: the symbol ; ( semi colon) tells the computer this is an
instruction (statement)
Latest Answer: (B) False. In several prog langauges like C C++ every statement ends with a semicolon....
Answers
22. The symbol * is also called as _________________. Skill/Topic: Variables and PointersA) pointer
dereferencing operatorExplanation: (sometimes called as dereferencing operator)
Latest Answer: deferencing operator....

Answers
23. An array is a way to reference a series of memory locations using the ______. Skill/Topic: ArrayA)
Same nameB) different nameC) Multiple namesD) Unique nameExplanation: An array is a way to reference
a series of memory locations using the same name. Each memory location is repr
Latest Answer: (A) Same name...

Answers
24. The way to declare an array is not dependent on the programming language used to write your
program The way to declare an array is not dependent on the programming language used to write your
program. Skill/Topic: ArrayA) TrueB) FalseExplanation: The way to declare an array depends on the
programming language used to write your program. It is similar in C, C++ while in Java, you must initialize th
25. A multidimensional array consists of ______ arrays defined by sets of array elements. Skill/Topic:
ArrayA) Two or MoreExplanation: A multidimensional array consists of two or more arrays defined by sets of
array element.Each set of array elements is an array. The first set of array ele
26. Why do we Use a Multidimensional Array? Skill/Topic: ArrayA) A multidimensional array can be
useful to organize subgroups of data within an array. In addition to organizing data stored in elements of an
array, a multidimensional array can s
Latest Answer: Multidimensional arrays are used to store information in a matrix form -- e.g. a railway
timetable, ...
Answers
27. How do you assign an address to an element of a pointer array ? Skill/Topic: ArrayA) by using the
address operator, which is the ampersand (&), in an assignment statementB) by using the address operator,
which is the asterisks (*), in an assignment statementC) by
Latest Answer: sayint * ptoia[10];int a=10;so we can writeptoia[0]=&a;.... and so on,....

Last Updated By Munish on April 14, 2006 Subscribe
Answers
28. 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
Latest Answer: basically elements are stored in contineous memory lacations, but as per need we can also
store them...
Last Updated By bahwesh on February 21, 2006 Subscribe
Answers
29. 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 a
Latest Answer: dynamic allocation of memory....

Answers
30. _________ is the way you groups things together by placing one thing on top of another and
then rem _________ is the way you groups things together by placing one thing on top of another and then
removing things one at a time from the top. Skill/Topic: Stacks using an ArrayA) ArrayB) StackC) PointerD)
All of the above
Last Updated By prabhat mishra on January 06, 2006 Subscribe
Answers
Difference between calloc and malloc?

malloc: allocate n bytes
calloc: allocate m times n bytes initialized to 0
What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical
data model.
1. RDBMS– Array (i.e. Array of structures)
2. Network data model– Graph
3. Hierarchical data model– Trees.
Which file contains the definition of member functions?
Definitions of member functions for the Linked List class are contained in the
LinkedList.cpp file.
How is any Data Structure application is classified among files?
A linked list application can be organized into a header file, source file and main
application file. The first file is the header file that contains the definition of the NODE
structure and the LinkedList class definition. The second file is a source code file
containing the implementation of member functions of the LinkedList class. The last file
is the application file that contains code that creates and uses the LinkedList class.
What member function places a new node at the end of the linked list?
The appendNode() member function places a new node at the end of the linked list. The
appendNode() requires an integer representing the current data of the node.
What is Linked List ?
Linked List is one of the fundamental data structures. It consists of a sequence of nodes,
each containing arbitrary data fields and one or two (”links”) pointing to the next and/or
previous nodes. A linked list is a self-referential datatype because it contains a pointer or
link to another data of the same type. Linked lists permit insertion and removal of nodes
at any point in the list in constant time, but do not allow random access.
What does each entry in the Link List called?

Each entry in a linked list is called a node. Think of a node as an entry that has three sub
entries. One sub entry contains the data, which may be one attribute or many attributes.
Another points to the previous node, and the last points to the next node. When you enter
a new item on a linked list, you allocate the new node and then set the pointers to
previous and next nodes.
How is the front of the queue calculated ?

The front of the queue is calculated by front = (front+1) % size.
Why is the isEmpty() member method called?
The isEmpty() member method is called within the dequeue process to determine if there
is an item in the queue to be removed i.e. isEmpty() is called to decide whether the queue
has at least one element. This method is called by the dequeue() method before returning
the front element.
Which process places data at the back of the queue?

Enqueue is the process that places data at the back of the queue.
What is the relationship between a queue and its underlying array?
Data stored in a queue is actually stored in an array. Two indexes, front and end will be
used to identify the start and end of the queue.
When an element is removed front will be incremented by 1. In case it reaches past the
last index available it will be reset to 0. Then it will be checked with end. If it is greater
than end queue is empty.
When an element is added end will be incremented by 1. In case it reaches past the last
index available it will be reset to 0. After incrementing it will be checked with front. If
they are equal queue is full.
What is a queue ?
A Queue is a sequential organization of data. 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.
What does isEmpty() member method determines?
isEmpty() checks if the stack has at least one element. This method is called by Pop()
before retrieving and returning the top element.
What method removes the value from the top of a stack?
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.
What method is used to place a value onto the top of a stack?
push() method, Push is the direction that data is being added to the stack. push() member
method places a value onto the top of a stack.
Run Time Memory Allocation is known as….
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];
How do you assign an address to an element of a pointer array ?
We can assign a memory address to an element of a pointer array by using the address
operator, which is the ampersand (&), in an assignment statement such as ptemployee[0]
= &projects[2];
Why do we Use a Multidimensional Array?
A multidimensional array can be useful to organize subgroups of data within an array. In

addition to organizing data stored in elements of an array, a multidimensional array can
store memory addresses of data in a pointer array and an array of pointers.
Multidimensional arrays are used to store information in a matrix form.
e.g. a railway timetable, schedule cannot be stored as a single dimensional array.
One can use a 3-D array for storing height, width and length of each room on each floor
of a building.
What is significance of ” * ” ?
The symbol “*” tells the computer that you are declaring a pointer.
Actually it depends on context.
In a statement like int *ptr; the ‘*’ tells that you are declaring a pointer.
In a statement like int i = *ptr; it tells that you want to assign value pointed to by ptr to
variable i.
The symbol “*” is also called as Indirection Operator/ Dereferencing Operator
What is Data Structure?

A data structure is a group of data elements grouped together under one name. These data
elements, known as members, can have different types and different lengths. Some are
used to store the data of same type and some are used to store different types of data.
Is Pointer a variable?
Yes, a pointer is a variable and can be used as an element of a structure and as an attribute
of a class in some programming languages such as C++, but not Java. However, the
contents of a pointer is a memory address of another location of memory, which is
usually the memory address of another variable, element of a structure, or attribute of a
class.
How many parts are there in a declaration statement?
There are two main parts, variable identifier and data type and the third type is optional
which is type qualifier like signed/unsigned.
How memory is reserved using a declaration statement ?
Memory is reserved using data type in the variable declaration. A programming language
implementation has predefined sizes for its data types.
For example, in C# the declaration int i; will reserve 32 bits for variable i.
A pointer declaration reserves memory for the address or the pointer variable, but not for
the data that it will point to. The memory for the data pointed by a pointer has to be
allocated at runtime.
What is impact of signed numbers on the memory?

Sign of the number is the first bit of the storage allocated for that number. So you get one
bit less for storing the number. For example if you are storing an 8-bit number, without
sign, the range is 0-255. If you decide to store sign you get 7 bits for the number plus one
bit for the sign. So the range is -128 to +127
What is precision?
Precision refers the accuracy of the decimal portion of a value. Precision is the number of
digits allowed after the decimal point.
What is the difference bitween NULL AND VOID pointer?
NULL can be value for pointer type variables.
VOID is a type identifier which has not size.
NULL and void are not same. Example: void* ptr = NULL;
What is the difference between ARRAY and STACK?
STACK follows LIFO. Thus the item that is first entered would be the last removed.
In array the items can be entered or removed in any order. Basically each member access
is done using index. No strict order is to be followed here to remove a particular element.
Tell how to check whether a linked list is circular.
Create two pointers, each set to the start of the list. Update each as follows:
while (pointer1)
{
pointer1 = pointer1->next;
pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next;
if (pointer1 == pointer2)
{
print (\”circular\n\”);
}
}
Whether Linked List is linear or Non-linear data structure?
According to Access strategies Linked list is a linear one.
According to Storage Linked List is a Non-linear one
What is the data structures used to perform recursion?

Stack. Because of its LIFO (Last In First Out) property it remembers its ‘caller’ so knows
whom to return when the function has to return. Recursion makes use of system stack for
storing the return addresses of the function calls.Every recursive function has its
equivalent iterative (non-recursive) function. Even when such equivalent iterative
procedures are written, explicit stack is to be used.
If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
The heterogeneous linked list contains different data types in its nodes and we need a
link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go
for void pointer. Void pointer is capable of storing pointer to any type as it is a generic
pointer type.
List out the areas in which data structures are applied extensively?
Compiler Design,
Operating System,

Database Management System,
Statistical analysis package,
Numerical Analysis,
Graphics,
Artificial Intelligence,
Simulation
What is placement new?

When you want to call a constructor directly, you use the placement new. Sometimes you
have some raw memory that’s already been allocated, and you need to construct an object
in the memory you have. Operator new’s special version placement new allows you to do
it.
class Widget
{
public :
Widget(int widgetsize);
…
Widget* Construct_widget_int_buffer(void *buffer,int widgetsize)
{
return new(buffer) Widget(widgetsize);
}
};
This function returns a pointer to a Widget object that’s constructed within the buffer
passed to the function. Such a function might be useful for applications using shared
memory or memory-mapped I/O, because objects in such applications must be placed at
specific addresses or in memory allocated by special routines.
When can you tell that a memory leak will occur?
A memory leak occurs when a program loses the ability to free a block of dynamically
allocated memory.
What is a node class?
A node class is a class that, relies on the base class for services and implementation,
provides a wider interface to te users than its base class, relies primarily on virtual
functions in its public interface depends on all its direct and indirect base class can be
understood only in the context of the base class can be used as base for further derivation
can be used to create objects. A node class is a class that has added new services or
functionality beyond the services inherited from its base class.
How many different trees are possible with 10 nodes ?

1014 - For example, consider a tree with 3 nodes(n=3), it will have the maximum
combination of 5 different (ie, 23 - 3 = 5) trees.
Minimum number of queues needed to implement the priority queue?
Two. One queue is used for actual storing of data and another for storing priorities.
In an AVL tree, at what condition the balancing is to be done?
If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1.
What is the bucket size, when the overlapping and collision occur at same time?
One. If there is only one entry possible in the bucket, when the collision occurs, there is
no way to accommodate the colliding value. This results in the overlapping of values.
What is the easiest sorting method to use?
The answer is the standard library function qsort(). It’s the easiest sort by far for several
reasons:
It is already written.
It is already debugged.
It has been optimized as much as possible (usually).
Void qsort(void *buf, size_t num, size_t size, int (*comp)(const void *ele1, const void
*ele2));
What is the heap?
The heap is where malloc(), calloc(), and realloc() get memory.
Getting memory from the heap is much slower than getting it from the stack. On the other
hand, the heap is much more flexible than the stack. Memory can be allocated at any time
and deallocated in any order. Such memory isn’t deallocated automatically; you have to
call free().
Recursive data structures are almost always implemented with memory from the heap.
Strings often come from there too, especially strings that could be very long at runtime. If
you can keep data in a local variable (and allocate it from the stack), your code will run
faster than if you put the data on the heap. Sometimes you can use a better algorithm if
you use the heap—faster, or more robust, or more flexible. It’s a tradeoff.
If memory is allocated from the heap, it’s available until the program ends. That’s great if
you remember to deallocate it when you’re done. If you forget, it’s a problem. A
“memory leak” is some allocated memory that’s no longer needed but isn’t deallocated. If
you have a memory leak inside a loop, you can use up all the memory on the heap and
not be able to get any more. (When that happens, the allocation functions return a null
pointer.) In some environments, if a program doesn’t deallocate everything it allocated,
memory stays unavailable even after the program ends.
How can I search for data in a linked list?

Unfortunately, the only way to search a linked list is with a linear search, because the
only way a linked list’s members can be accessed is sequentially. Sometimes it is quicker
to take the data from a linked list and store it in a different data structure so that searches
can be more efficient.
What is the quickest sorting method to use?
The answer depends on what you mean by quickest. For most sorting problems, it just
doesn’t matter how quick the sort is because it is done infrequently or other operations
take significantly more time anyway. Even in cases in which sorting speed is of the
essence, there is no one answer. It depends on not only the size and nature of the data, but
also the likely order. No algorithm is best in all cases.There are three sorting methods in
this author’s “toolbox” that are all very fast and that are useful in different situations.
Those methods are quick sort, merge sort, and radix sort.
The Quick Sort

The quick sort algorithm is of the “divide and conquer” type. That means it works by
reducing a sorting
problem into several easier sorting problems and solving each of them. A “dividing”
value is chosen from the input data, and the data is partitioned into three sets: elements
that belong before the dividing value, the value itself, and elements that come after the
dividing value. The partitioning is performed by exchanging elements that are in the first
set but belong in the third with elements that are in the third set but belong in the first
Elements that are equal to the dividing element can be put in any of the three sets—the
algorithm will still work properly.
The Merge Sort

The merge sort is a “divide and conquer” sort as well. It works by considering the
data to be sorted as a
sequence of already-sorted lists (in the worst case, each list is one element long).
Adjacent sorted lists are merged into larger sorted lists until there is a single sorted
list containing all the elements. The merge sort is good at sorting lists and other data
structures that are not in arrays, and it can be used to sort things that don’t fit into
memory. It also can be implemented as a stable sort.
The Radix Sort

The radix sort takes a list of integers and puts each element on a smaller list,
depending on the value of its least significant byte. Then the small lists are
concatenated, and the process is repeated for each more significant byte until the list
is sorted. The radix sort is simpler to implement on fixed-length data such as ints.
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But
it doesn’t mean that the distance between any two nodes involved in the minimum-
spanning tree is minimum.
What is a spanning Tree?
A spanning tree is a tree associated with a network. All the nodes of the graph appear on
the tree once. A minimum spanning tree is a spanning tree organized so that the total edge
weight between nodes is minimized.
In RDBMS, what is the efficient data structure used in the internal storage representation?
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching
easier. This corresponds to the records that shall be stored in leaf nodes.
List out few of the Application of tree data-structure?
The manipulation of Arithmetic expression,Symbol Table construction,Syntax analysis.
What are the methods available in storing sequential files ?
Straight merging,Natural merging,Polyphase sort,Distribution of Initial runs.
What is the data structures used to perform recursion?
Stack. Because of its LIFO (Last In First Out) property it remembers its ‘caller’ so knows
whom to return when the function has to return. Recursion makes use of system stack for
storing the return addresses of the function calls.Every recursive function has its
equivalent iterative (non-recursive) function. Even when such equivalent iterative
procedures are written, explicit stack is to be used.
If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
The heterogeneous linked list contains different data types in its nodes and we need a
link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go
for void pointer. Void pointer is capable of storing pointer to any type as it is a generic
pointer type.
List out the areas in which data structures are applied extensively?
Compiler Design,,Operating System,Database Management System,Statistical analysis
package,Numerical Analysis,Graphics,Artificial Intelligence,Simulation

Data Structures

Încărcat de

Informații document

Descriere originală:

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Data Structures

Încărcat de

Drepturi de autor:

Formate disponibile

1. _____________ Memory is Volatile.

Skill/Topic: Memory, Abstract Data Types, and AddressesA) CacheB) Random

Latest Answer: Random Access memory...

(Answers : 6 ) Read / Add

Latest Answer: float...

(Answers : 1 ) Read / Add

Latest Answer: binary system is used based on 0 - off and 1 - on...

(Answers : 5 ) Read / Add

structures, union, class are all user defined datatypes.

Latest Answer: address,pointer...

Latest Answer: ans: C...

Latest Answer: ans: A...

Latest Answer: deferencing operator....

Latest Answer: (A) Same name...

Latest Answer: sayint * ptoia[10];int a=10;so we can writeptoia[0]=&a;.... and so on,....

Latest Answer: dynamic allocation of memory....

Difference between calloc and malloc?

What does each entry in the Link List called?

How is the front of the queue calculated ?

Which process places data at the back of the queue?

A multidimensional array can be useful to organize subgroups of data within an array. In

The symbol “*” is also called as Indirection Operator/ Dereferencing Operator

What is Data Structure?

What is impact of signed numbers on the memory?

Tell how to check whether a linked list is circular.

Whether Linked List is linear or Non-linear data structure?

According to Access strategies Linked list is a linear one.

According to Storage Linked List is a Non-linear one

What is the data structures used to perform recursion?

Compiler Design,

Operating System,

Statistical analysis package,

Numerical Analysis,

Artificial Intelligence,

What is placement new?

How many different trees are possible with 10 nodes ?

The heap is where malloc(), calloc(), and realloc() get memory.

How can I search for data in a linked list?

The Quick Sort

The Merge Sort

The Radix Sort

S-ar putea să vă placă și