What are the container data structures other than Arrays, Lists and Queues?

AK Shukla

• Oct 7th, 2017

Stack

ayushi

• Sep 9th, 2017

Stack

Answer Question  Select Best Answer

Skill/Topic: TreeA) TrueB) False

Jenny

• May 10th, 2017

True

mahalakshmi

• Oct 23rd, 2016

B) False

Answer Question  Select Best Answer

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

 Profile Answers by jontyrodes Questions by 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...

Answer Question  Select Best Answer

Is it possible to implement trees using arrays ? If yes, how?

Vishesh Bibhay

 Profile Answers by Vishesh Bibhay Questions by Vishesh Bibhay

• Jul 9th, 2011

Hello A complete binary tree can be represented in an array

hrshksh

 Profile Answers by hrshksh Questions by 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...

Answer Question  Select Best Answer

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

jdoe123

 Profile Answers by jdoe123 Questions by jdoe123

• Aug 6th, 2007

Float

Answer Question  Select Best Answer

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.

sivanesh.a

 Profile Answers by sivanesh.a Questions by sivanesh.a

• Feb 6th, 2007

Binary system is used based on 0 - off and 1 - on

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

Answer Question  Select Best Answer

Skill/Topic: Variables and PointersA) 1B) 2C) 3D) 4

ahmarshi

 Profile Answers by ahmarshi Questions by 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;

Answer Question  Select Best Answer

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

 Profile Answers by rohini.nitd Questions by 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.

Answer Question  Select Best Answer

Guest

• Jan 17th, 2007

We over load this operator this process is known as cascading

Ram

• Jan 12th, 2007

We can reload increment and decrement operators as we do the other operators. But incase of the preincrement or predecrement we take an argument in the operator definition,?which?identifies?whether?it?is?pre?or?post,?other?thing?are?same.

Answer Question  Select Best Answer

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

 Profile Answers by Vishesh Bibhay Questions by 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 ...

Answer Question  Select Best Answer

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..:)

Rajan Patekar

 Profile Answers by Rajan Patekar Questions by Rajan Patekar

• Aug 12th, 2011

A.input-restricted queue.

Answer Question  Select Best Answer

Data structures provide many positive aspects like minimum disk-space efficiency, proper data management but at cost of complexity. What is your opinion?

snyder

 Profile Answers by snyder Questions by 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

 Profile Answers by Rajan Patekar Questions by 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.

Answer Question  Select Best Answer

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;
}
}

ilushka

 Profile Answers by ilushka Questions by ilushka

• Jul 29th, 2011

Lets see...

Code
 

Answer Question  Select Best Answer

Pooja Negi

• Nov 14th, 2011

The root node of b-tree has (k-1) keys where k=order of tree where as any other node except root node has min {ceiling value of(k/2)} so the ans will be 6

BAADAL

• Sep 6th, 2011

IN B tree non leaf node say p can have m -1 keys where m is the no of sub tree of p and all leaf node can have n-1 key where n is the order of the tree.

Answer Question  Select Best Answer

rjshkr

• Sep 28th, 2012

"c NODE insert(NODE head,int data,int pos) { NODE temp,new,prev = NULL; int i=1; new = (NODE)malloc(sizeof(struct node)); new->info = data; if(head == NULL) { new->link = ...

Rahul goyal

• Jul 20th, 2012

Code
//let the structure name be stud//accept the data

Answer Question  Select Best Answer

Select one:
8
11
3
4

Akshita Jain

• Mar 15th, 2019

H =n+1
n=4-1=3

kaushlendra

• Jun 15th, 2015

Min node: 2h-1 where his the height.
2(4-1): 23 is 8

Answer Question  Select Best Answer

n be the number of nodes and m be number of edges in a graph.

The number of edges in any undirected connected graph is at least
Select one:
a) n
b) n-1
c) None of the above
d) n(n-1)/2

Jenny

• May 10th, 2017

N-1

SHABNAM

• Mar 24th, 2016

N-1

Answer Question  Select Best Answer

A multi-way search tree has n items. The number of external nodes is Select one:

a) n2
b) logn
c) n
d) n+1

Jenny

• May 10th, 2017

N+1

Haneesha

• Oct 15th, 2015

N+1

Answer Question  Select Best Answer

Skill/Topic: Linked ListA) by repointing the previous and the next elements of existing nodes to the new nodeB) by repointing only the next elements of existing node to the new nodeC) by repointing only the Previous elements of existing node to the new nodeD) None of the above Explanation: by repointing the previous and the next elements of existing nodes to the new node You can insert a node in the...

manishmodgil

 Profile Answers by manishmodgil Questions by manishmodgil

• Dec 28th, 2007

1. Identify where to be inserted.2. nxt pointer of the new node to the next node.3. nxt pointer of the previous node to the new node.Do consider spl. cases :1. to insert at the start of the list2. to insert at the end of the list

sri

• Nov 11th, 2007

Firstly,  create a temporary node say "temp"!!!so,    prev->link=temp;         temp->link=next;

Answer Question  Select Best Answer

Skill/Topic: TreeA) 8Explanation: You calculate the size of a tree by using the following formula: size = 2 ^ depth If the depth is 3 levels, then the size is 8, as shown here: 8 = 2 ^ 3

Shubh

• Nov 5th, 2018

ANS 8 is correct, 7 is not listed.

durga

• Apr 8th, 2015

But y v shld use 2^n or 2^n-2 formula only can any one give me the explanation

Answer Question  Select Best Answer