Logo 
Search:

cpp Interview FAQs

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

What is Loop in dfs (data file structure)?

Any edge whose initial and terminal nodes are same is called loop.
Posted By:Elizabeth Hughes      Posted On: Jan 19

C++ Programming
Comments: 0

List Basic Operations on Queue in dfs (data file structure).

- Insert
- Delete
- Top (Returns topmost element of queue)
- IsEmpty (Which returns TRUE if queue is empty)
Posted By:Raymund Fischer      Posted On: Jan 18

C++ Programming
Comments: 0

Write an algorithm for Inserting a Node using Singly Linked List in dfs (data file structure).

PROCEDURE INSERT(T, KEY)
[Where ‘head’ pointer has been caught in pointer ‘T’ & the value in ‘key’]

1. [Checking for insertion at beginning and inserting]

if(key <= 0)
Call GETNODE (I)
DATA (I) <-- ‘xyz’
LIN...
Posted By:Logan Bouchard      Posted On: Jan 18

C++ Programming
Comments: 0

Which of the following is the general form of using an exception specification? - Select option

Options


a) type function(arg-list) throw(type-list)
{
........
........ Function body
........
}
b) type function(arg-list) throw(arg-list)
{
........
........ Function body
........
}
c) type function(type-list) throw(type-list)
{ ...
Posted By:Adalbert Fischer      Posted On: Jan 18

Assembly Language
Comments: 0

What is assembler?

The assembler translates the assembly language program text which is given as input to the assembler to their binary equivalents known as object code. The time required to translate the assembly code to object code is called access time. The assemble...
Posted By:Lois Schmidt      Posted On: Jan 16

C++ Programming
Comments: 0

Which of the following statements is true about the function that contains the const argumen

Options

a) The function should not modify the const argument
b) Const declaration is necessary only when the arguments are passed by reference
c) Both b and c
d) None of the above


Answer : c) Both b and c
Posted By:Varick Fischer      Posted On: Jan 15

C++ Programming
Comments: 0

What is Loop in dfs (data file structure)?

Any edge whose initial and terminal nodes are same is called loop.
Posted By:Elizabeth Hughes      Posted On: Jan 19

C++ Programming
Comments: 0

List Basic Operations on Queue in dfs (data file structure).

- Insert
- Delete
- Top (Returns topmost element of queue)
- IsEmpty (Which returns TRUE if queue is empty)
Posted By:Raymund Fischer      Posted On: Jan 18

C++ Programming
Comments: 0

Write an algorithm for Inserting a Node using Singly Linked List in dfs (data file structure).

PROCEDURE INSERT(T, KEY)
[Where ‘head’ pointer has been caught in pointer ‘T’ & the value in ‘key’]

1. [Checking for insertion at beginning and inserting]

if(key <= 0)
Call GETNODE (I)
DATA (I) <-- ‘xyz’
LIN...
Posted By:Logan Bouchard      Posted On: Jan 18

C++ Programming
Comments: 0

Which of the following is the general form of using an exception specification? - Select option

Options


a) type function(arg-list) throw(type-list)
{
........
........ Function body
........
}
b) type function(arg-list) throw(arg-list)
{
........
........ Function body
........
}
c) type function(type-list) throw(type-list)
{ ...
Posted By:Adalbert Fischer      Posted On: Jan 18

Assembly Language
Comments: 0

What is assembler?

The assembler translates the assembly language program text which is given as input to the assembler to their binary equivalents known as object code. The time required to translate the assembly code to object code is called access time. The assemble...
Posted By:Lois Schmidt      Posted On: Jan 16

C++ Programming
Comments: 0

Which of the following statements is true about the function that contains the const argumen

Options

a) The function should not modify the const argument
b) Const declaration is necessary only when the arguments are passed by reference
c) Both b and c
d) None of the above


Answer : c) Both b and c
Posted By:Varick Fischer      Posted On: Jan 15

  83  84  85  86  87  88  89  90  91  92  93