Logo 
Search:

c sharp Interview FAQs

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

Which statement(s) is true about the visibility of inherited members? - Select option

Option

a) When a class is inherited in protected mode, the private members of the base class become protected members of the derived class
b) When a class is inherited in private mode, only the public members of the base class can be inherited to...
Posted By:Adalwolf Fischer      Posted On: Oct 13

C++ Programming
Comments: 0

What is BFS (Breadth First Search) in dfs (data file structure)?

Breadth First Search is the technique to find the shortest distance between some starting node and the remaining nodes of the graph. This shortest distance is the minimum number of edges traversed in order to travel from the start node to the specif...
Posted By:Eve Hughes      Posted On: Oct 12

Assembly Language
Comments: 0

Give the different types of command words used in 8259a?

The command words of 8259A are classified in two groups
1. Initialization command words (ICWs)
2. Operation command words (OCWs)
Posted By:Alberta Miller      Posted On: Oct 10

C++ Programming
Comments: 0

Which of the following statement(s) is NOT true regarding the above code? - select option

4. Consider the following code segment:
class A
{
int a;
public:
int b;
void inp();
}
class B : A
{
// members of B
}
Which of the following statement(s) is NOT true regarding the above code?

Options

a) The public members, namely ‘...
Posted By:Addie Fischer      Posted On: Oct 05

Assembly Language
Comments: 0

What is a microcomputer?

A computer that is designed using a microprocessor as its CPU is called microcomputer.
Posted By:Gabriel Silva      Posted On: Oct 04

C++ Programming
Comments: 0

Write an algorithm for Selection Sort in dfs (data file structure).

1. [Loop on pass index]
Repeat through step 4 for pass=1 to n-1.

2. Initialize minindex
minindex <-- pass.

3. [Make a pass and obtain element with smallest value]
Repeat for i=pass+1,pass+2,….n.
If k[i] < k[minindex]
th...
Posted By:Sofia Hughes      Posted On: Oct 04

C++ Programming
Comments: 0

Which statement(s) is true about the visibility of inherited members? - Select option

Option

a) When a class is inherited in protected mode, the private members of the base class become protected members of the derived class
b) When a class is inherited in private mode, only the public members of the base class can be inherited to...
Posted By:Adalwolf Fischer      Posted On: Oct 13

C++ Programming
Comments: 0

What is BFS (Breadth First Search) in dfs (data file structure)?

Breadth First Search is the technique to find the shortest distance between some starting node and the remaining nodes of the graph. This shortest distance is the minimum number of edges traversed in order to travel from the start node to the specif...
Posted By:Eve Hughes      Posted On: Oct 12

Assembly Language
Comments: 0

Give the different types of command words used in 8259a?

The command words of 8259A are classified in two groups
1. Initialization command words (ICWs)
2. Operation command words (OCWs)
Posted By:Alberta Miller      Posted On: Oct 10

C++ Programming
Comments: 0

Which of the following statement(s) is NOT true regarding the above code? - select option

4. Consider the following code segment:
class A
{
int a;
public:
int b;
void inp();
}
class B : A
{
// members of B
}
Which of the following statement(s) is NOT true regarding the above code?

Options

a) The public members, namely ‘...
Posted By:Addie Fischer      Posted On: Oct 05

Assembly Language
Comments: 0

What is a microcomputer?

A computer that is designed using a microprocessor as its CPU is called microcomputer.
Posted By:Gabriel Silva      Posted On: Oct 04

C++ Programming
Comments: 0

Write an algorithm for Selection Sort in dfs (data file structure).

1. [Loop on pass index]
Repeat through step 4 for pass=1 to n-1.

2. Initialize minindex
minindex <-- pass.

3. [Make a pass and obtain element with smallest value]
Repeat for i=pass+1,pass+2,….n.
If k[i] < k[minindex]
th...
Posted By:Sofia Hughes      Posted On: Oct 04

  27  28  29  30  31  32  33  34  35  36  37