Select one:
None of the above
5
4
10

Jenny

• May 10th, 2017

None of the above

Babuns

• Sep 9th, 2016

10

Answer Question  Select Best Answer

Jenny

• May 10th, 2017

In 32 bit system - 4 byte
In 64 bit System - 8 byte

uvesh

• Jun 21st, 2016

It is only possible when we declare char pointer (char *p) and print the ("%d",sizeof(p)) while not giving 4 bytes on ("%d",sizeof(*p)) why?

Answer Question  Select Best Answer

Is double link list a linear data structure? If Yes, Why?If No, Why?

snyder

 Profile Answers by snyder Questions by snyder

• Mar 13th, 2012

If every element in a DS has almost two adjacent neighbors then it is called a linear DS. . . Hence doubly linked list is a linear DS

snyder

 Profile Answers by snyder Questions by snyder

• Mar 7th, 2012

To check if a DS is linear or not just do a simple test . . . check if the data elements of the given DS can be accessed in a sequential manner, if it can, then its a linear DS.

A doubly linked list can be accessed in a sequential manner, hence it is a linear linked list.

Answer Question  Select Best Answer

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; instructions and data contained in main memory are lost once the computer is powered down.

ashlee_shayne

 Profile Answers by ashlee_shayne Questions by ashlee_shayne

• Mar 4th, 2009

B. Random Access

vaishali_naidu

 Profile Answers by vaishali_naidu Questions by vaishali_naidu

• Feb 26th, 2009

Cache,Main memory and RAM all are volatile memory.

Answer Question  Select Best Answer

shiksha

• Aug 28th, 2011

Yes each entry in a link list is called node and this node consist of two parts-info, and next add.

Rajan Patekar

 Profile Answers by Rajan Patekar Questions by Rajan Patekar

• Aug 12th, 2011

True

Answer Question  Select Best Answer

Niyas Ibrahim

• Sep 2nd, 2013

Use of pointer is to store a memory address.since any location in the memory have same type(characters or digits) of memory address, size is same for all pointer types.

jignesh

• Dec 29th, 2012

Size of void pointer or size of character pointer are same because both variable contain address or we can say memory location

Answer Question  Select Best Answer

If you have one million named objects and you want to store them in a data structure that lets you insert new objects quickly and search for an object by name quickly, what data structure should you use?

Read Best Answer

Editorial / Best Answer

hrshksh  

 Profile Answers by hrshksh Questions by hrshksh

• Member Since May-2010 | May 9th, 2010

---

It depends on the amount of primary memory one has for the process. If we can store 1 million records in primary memory, then we can very well take a hash table with a consistent hashing scheme for avoiding collisions. It will take O(1). 

In most cases however this is not possible. In circumtances like this, there are two ways:

B Trees or Extensible Hashing both of them have interesting time complexities.

ptmich

 Profile Answers by ptmich Questions by ptmich

• May 28th, 2012

You can use a hash table or an array of objects You can use an array of objects because you already know that you need to store a specified number of objects, also you can store and access objects qu...

hrshksh

 Profile Answers by hrshksh Questions by hrshksh

• May 9th, 2010

It depends on the amount of primary memory one has for the process. If we can store 1 million records in primary memory, then we can very well take a hash table with a consistent hashing scheme for av...

Improve Answer

Which of the following data structure is linear type?a. Stringsb. Listsc. Queuesd. All of above

keben

• Jun 1st, 2015

C. Queues

Master

• Feb 26th, 2015

C

Answer Question  Select Best Answer

Skill/Topic: Stacks using Linked ListA) Back of the linked listB) Front of the linked listC) Middle of the Linked listD) None of the above

Jennny

• May 10th, 2017

Back of the linked list

Rishabh Bansal

 Profile Answers by Rishabh Bansal Questions by Rishabh Bansal

• Jul 19th, 2015

B) Front of the linked list

Answer Question  Select Best Answer

Teja

• Oct 21st, 2017

Main difference is in access. With stack we can not access values randomly but with array we can access any item any time.

Chandan Kumar Sahu

• Mar 1st, 2017

In an array, you have a list of elements and you can access any of them at any time. (Think of a bunch of wooden blocks all laid out in a row.) But in a stack, theres no random-access operation; th...

Answer Question  Select Best Answer

The way a card game player arranges his cards as h

• Aug 16th, 2017

3. insertion sort

jenny

• May 10th, 2017

Selection sort

Answer Question  Select Best Answer

yogitag

• Mar 5th, 2012

Data Structure is the way of organizing data as per the requirement and defining few operations that can be operated on it

snyder

 Profile Answers by snyder Questions by snyder

• Feb 27th, 2012

Data Structure is way of organizing data in memory so as to use it in an efficient manner and is best suited for the algorithm to be implemented.

Answer Question  Select Best Answer

anupam gangwar

• Apr 14th, 2020

The data items are arranged in an orderly manner where the elements are attached adjacently. example -: Array, queue, stack, linked list, etc.
It arranges the data in a sorted order and there exists a relationship between the data elements. example-:Tree and graph.

Soumya

• Mar 25th, 2018

In linear data structure,the data items are arranged in a linear sequence.
Ex.arrays
In non linear data structure,the data items are not in a sequence.
Ex.trees,graphs.

Answer Question  Select Best Answer