Logo 
Search:

c programming Interview FAQs

Submit Interview FAQ
No Records Found!!!
Go Ahead and Post your Interview FAQ
Home » Interview FAQs » c programmingRSS Feeds
C++ Programming
Comments: 0

What is the output of the program mentioned in the description? -

Consider the following code snippet:
int main()
{
vector v1(10);
vector v2(10);
v1.at(0)=24;
v1.at(1)=20;
v1.at(2)=38;
for(int i=0;i <3; i++)
{
cout< }
v2=v1;
cout< return 0;
}

What is the output of...
Posted By:Nathan Bouchard      Posted On: Oct 10

C++ Programming
Comments: 0

What is Bubble Sort in dfs (data file structure)?

It is a well-known sorting method. It differs from the selection sort in that, instead of finding the smallest record and then performing an interchange, two records are interchanged immediately upon discovering that they are out of order. In this ...
Posted By:Vilmos Fischer      Posted On: Oct 09

C++ Programming
Comments: 0

What is Malloc in dfs (data file structure)?

It allocates memory at run time and returns pointer to first byte of memory.
Posted By:Amalasand Miller      Posted On: Oct 06

Assembly Language
Comments: 0

Give the register organization of 8257?

The 8257 perform the DMA operation over four independent DMA channels. Each of the four channels of 8257 has a pair of two 16-bit registers. DMA address register and terminal count register. Also, there are two common registers for all the channels; ...
Posted By:Anna Schmidt      Posted On: Oct 05

C++ Programming
Comments: 0

What is Weighted Graph in dfs (data file structure)?

Whenever the graph shows the weight for each and every edge is called weighted graph.
Posted By:Audris Schmidt      Posted On: Oct 03

C++ Programming
Comments: 0

What is adjacent nodes in dfs (data file structure)?

The member nodes of V of a graph connected by the member of edge E is called adjacent nodes.
Posted By:Rosie Hughes      Posted On: Oct 03

C++ Programming
Comments: 0

What is the output of the program mentioned in the description? -

Consider the following code snippet:
int main()
{
vector v1(10);
vector v2(10);
v1.at(0)=24;
v1.at(1)=20;
v1.at(2)=38;
for(int i=0;i <3; i++)
{
cout< }
v2=v1;
cout< return 0;
}

What is the output of...
Posted By:Nathan Bouchard      Posted On: Oct 10

C++ Programming
Comments: 0

What is Bubble Sort in dfs (data file structure)?

It is a well-known sorting method. It differs from the selection sort in that, instead of finding the smallest record and then performing an interchange, two records are interchanged immediately upon discovering that they are out of order. In this ...
Posted By:Vilmos Fischer      Posted On: Oct 09

C++ Programming
Comments: 0

What is Malloc in dfs (data file structure)?

It allocates memory at run time and returns pointer to first byte of memory.
Posted By:Amalasand Miller      Posted On: Oct 06

Assembly Language
Comments: 0

Give the register organization of 8257?

The 8257 perform the DMA operation over four independent DMA channels. Each of the four channels of 8257 has a pair of two 16-bit registers. DMA address register and terminal count register. Also, there are two common registers for all the channels; ...
Posted By:Anna Schmidt      Posted On: Oct 05

C++ Programming
Comments: 0

What is Weighted Graph in dfs (data file structure)?

Whenever the graph shows the weight for each and every edge is called weighted graph.
Posted By:Audris Schmidt      Posted On: Oct 03

C++ Programming
Comments: 0

What is adjacent nodes in dfs (data file structure)?

The member nodes of V of a graph connected by the member of edge E is called adjacent nodes.
Posted By:Rosie Hughes      Posted On: Oct 03

  98  99  100  101  102  103  104  105  106  107  108