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

Iterative algorithm for traversing a binary tree in postorder in dfs (data file structure).

PROCEDURE POSTORDER(T)
[Given a binary tree whose root node address is given by the pointer variable T, this algorithm traverses the tree in postorder in an iterative manner].

1. [Initialize]

If T = NULL
then write (“Empty Tree”)
...
Posted By:Klarissa Schmidt      Posted On: Jun 21

Assembly Language
Comments: 0

Why do we use XRA A instruction

The XRA A instruction is used to clear the contents of the Accumulator and store the value 00H.
Posted By:Adelheid Fischer      Posted On: Jun 19

C++ Programming
Comments: 0

What is Two Way Merge Sort in dfs (data file structure)?

The process to merge k sorted tables into a single sorted table is called multiple merging or k-way merging. Multiple merging can also be accomplished by performing a simple merge repeatedly.

Pass:

Initially the elements of the array are:
9...
Posted By:Lacey Hughes      Posted On: Jun 18

C++ Programming
Comments: 0

Which statement(s) is true about try block? - Select option

I. The try block is immediately followed by the catch block.
II. Try statement can have only one catch statement.
III. A program segment can have more than one catch statement with a try statement.
IV. All of the above

Options

a) I only
b) ...
Posted By:Giselle Miller      Posted On: Jun 13

C++ Programming
Comments: 0

List Properties of Queue in dfs (data file structure).

- Insertion is at last and Deletion is of first element from the list.
- Top of queue points to first in element.
- Queue can be static or dynamic in size.
- The indexing of particular element of queue depends on the basic list which we have u...
Posted By:Adalrik Fischer      Posted On: Jun 10

C++ Programming
Comments: 0

Iterative algorithm for traversing a binary tree in preorder in dfs (data file structure).

PROCEDURE PREORDER(T)
[Given a binary tree whose root node address is given by the pointer variable T, this algorithm traverses the tree in preorder in an iterative manner].

1. [Initialize]

If T = NULL
then write (“Empty Tree”)
...
Posted By:Sophia Hughes      Posted On: Jun 10

C++ Programming
Comments: 0

Iterative algorithm for traversing a binary tree in postorder in dfs (data file structure).

PROCEDURE POSTORDER(T)
[Given a binary tree whose root node address is given by the pointer variable T, this algorithm traverses the tree in postorder in an iterative manner].

1. [Initialize]

If T = NULL
then write (“Empty Tree”)
...
Posted By:Klarissa Schmidt      Posted On: Jun 21

Assembly Language
Comments: 0

Why do we use XRA A instruction

The XRA A instruction is used to clear the contents of the Accumulator and store the value 00H.
Posted By:Adelheid Fischer      Posted On: Jun 19

C++ Programming
Comments: 0

What is Two Way Merge Sort in dfs (data file structure)?

The process to merge k sorted tables into a single sorted table is called multiple merging or k-way merging. Multiple merging can also be accomplished by performing a simple merge repeatedly.

Pass:

Initially the elements of the array are:
9...
Posted By:Lacey Hughes      Posted On: Jun 18

C++ Programming
Comments: 0

Which statement(s) is true about try block? - Select option

I. The try block is immediately followed by the catch block.
II. Try statement can have only one catch statement.
III. A program segment can have more than one catch statement with a try statement.
IV. All of the above

Options

a) I only
b) ...
Posted By:Giselle Miller      Posted On: Jun 13

C++ Programming
Comments: 0

List Properties of Queue in dfs (data file structure).

- Insertion is at last and Deletion is of first element from the list.
- Top of queue points to first in element.
- Queue can be static or dynamic in size.
- The indexing of particular element of queue depends on the basic list which we have u...
Posted By:Adalrik Fischer      Posted On: Jun 10

C++ Programming
Comments: 0

Iterative algorithm for traversing a binary tree in preorder in dfs (data file structure).

PROCEDURE PREORDER(T)
[Given a binary tree whose root node address is given by the pointer variable T, this algorithm traverses the tree in preorder in an iterative manner].

1. [Initialize]

If T = NULL
then write (“Empty Tree”)
...
Posted By:Sophia Hughes      Posted On: Jun 10

  63  64  65  66  67  68  69  70  71  72  73