Skill/Topic: Stacks using Linked ListA) the new node is placed at the front of the linked list.B) the new node is placed at the back of the linked list.C) the new node is placed at the middle of the linked list.D) No Changes happens

samba.bbs@gmail.com

• Jun 24th, 2023

The new node is placed at the front of the linked list

Softwaredeveloper

 Profile Answers by Softwaredeveloper Questions by Softwaredeveloper

• Mar 27th, 2010

With a linked list Push: Insert at front of list. Pop: Remove from front of list.

Answer Question  Select Best Answer

Skill/Topic: QueueA) TrueB) FalseExplanation: The ~Queue() member function is the destructor.It uses the delete operator to remove the array from memory when the instance of the Queue class goes out of scope.

sivanesh.a

 Profile Answers by sivanesh.a Questions by sivanesh.a

• Feb 6th, 2007

False.. it is destructor.

Answer Question  Select Best Answer

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) TrueB) False

Renuka Nagambika Nagambika Puvvadi

• Aug 19th, 2021

True

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• May 15th, 2012

True,insertnodeat() function specifies the index where to insert the new node in the linked list.

Answer Question  Select Best Answer

Skill/Topic: Queues Using Linked ListsA) TrueB) False

PRAGYA JAISWAL

• May 18th, 2021

A) TRUE
The size of linked list can be changes during the run time. Other data structures like stack, queue, tree, and graph can be static and dynamic depending on, whether these are implemented using an array or a linked list.

Sandhya

• Sep 5th, 2006

True

Answer Question  Select Best Answer

What is the tradeoff using a linked list!!

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

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

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

How will you identify Stack Overflow?

prem waghmare

• Sep 11th, 2018

What is stack overflow and underflow condition with example?

ahatesham ahamed

• Jan 6th, 2018

How to minimize overflow in stack?

Answer Question  Select Best Answer

Select one:
4
1
0.5
2

akash

• Jan 30th, 2018

0.5

suji

• Feb 15th, 2015

2

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

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

typedef struct listnode*list pointer;
typedef struct list node{
int data;
list pointer link;
};
list pointer concatenate(list pointer list1,list pointer list2){
}

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

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

Jenny

• May 10th, 2017

14

Diksha

• Oct 12th, 2015

14 is the answer

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

Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) An IntegerB) a variableC) a characterD) a boolean

Jenny

• May 10th, 2017

An Integer

shivam singh

• May 11th, 2016

B) a variable

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

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