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

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

Which of the following features that distinguish object oriented programming from conventional

i. Structural design
ii. Inheritance
iii. Modular programming
iv. bottom-up


Option


a) i only
b) Both ii and iii
c) Both ii and iv
d) iv only


Answer : c) Both ii and iv
Posted By:Jacob Evans      Posted On: Jun 09

C++ Programming
Comments: 0

Pick out the correct usage of the list function called, splice().

Options

a) Deletes a list from the invoking list
b) Arranges the list elements as specified
c) Inserts a list into the invoking list
d) Gives the size of the list

Answer : c) Inserts a list into the invoking list
Posted By:Isabel Hughes      Posted On: Jun 03

C++ Programming
Comments: 0

By default, the members of a class are

Options

a) private
b) public
c) protected
d) static

Answer : a) private
Posted By:Ballard Schmidt      Posted On: Jun 01

C++ Programming
Comments: 0

What is Circular Linked List in dfs (data file structure)?

A linked list in which the pointer of the last node points to the first node of the list is called circular linked list.
Posted By:Birk Fischer      Posted On: Jun 01

C++ Programming
Comments: 0

Which one of the following OOP concepts enables reusability of components?

Options

a) Inheritance
b) Encapsulation
c) Polymorphism
d) All of the above


Answer : a) Inheritance
Posted By:Louis Evans      Posted On: May 28

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

Which of the following features that distinguish object oriented programming from conventional

i. Structural design
ii. Inheritance
iii. Modular programming
iv. bottom-up


Option


a) i only
b) Both ii and iii
c) Both ii and iv
d) iv only


Answer : c) Both ii and iv
Posted By:Jacob Evans      Posted On: Jun 09

C++ Programming
Comments: 0

Pick out the correct usage of the list function called, splice().

Options

a) Deletes a list from the invoking list
b) Arranges the list elements as specified
c) Inserts a list into the invoking list
d) Gives the size of the list

Answer : c) Inserts a list into the invoking list
Posted By:Isabel Hughes      Posted On: Jun 03

C++ Programming
Comments: 0

By default, the members of a class are

Options

a) private
b) public
c) protected
d) static

Answer : a) private
Posted By:Ballard Schmidt      Posted On: Jun 01

C++ Programming
Comments: 0

What is Circular Linked List in dfs (data file structure)?

A linked list in which the pointer of the last node points to the first node of the list is called circular linked list.
Posted By:Birk Fischer      Posted On: Jun 01

C++ Programming
Comments: 0

Which one of the following OOP concepts enables reusability of components?

Options

a) Inheritance
b) Encapsulation
c) Polymorphism
d) All of the above


Answer : a) Inheritance
Posted By:Louis Evans      Posted On: May 28

  64  65  66  67  68  69  70  71  72  73  74