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

Write an algorithm for Pushing a Node above the top of stack using Singly Linked List in dfs

PROCEDURE PUSH_STACK(TOP)
[Where top of the stack has been caught in pointer ‘TOP’]

1. [Allocating the memory for new node & pushing it into stack]

Call GETNODE (I)
DATA (P) <-- ‘xyz’
LINK (P) <-- TOP
TOP <-- P
return (TOP).

2. [FINIS...
Posted By:Sarah Hughes      Posted On: May 25

C++ Programming
Comments: 0

What is Weight of a graph in dfs (data file structure)?

The number on any edge is called the weight of that graph. They are the number of paths from one node to another.
Posted By:Vid Fischer      Posted On: May 24

C++ Programming
Comments: 0

Operator overloading is necessary because - select option

Options

a) C++ attempts to make the user-defined classes act like built-in types
b) To provide new definitions for most of the C++ operators
c) To add user-defined data type like basic data types
d) All of the above

Answer : d) All of the ab...
Posted By:Sophie Campbell      Posted On: May 22

C++ Programming
Comments: 0

What is Priority Queues in dfs (data file structure)?

A queue in which we are able to insert items or remove items from any position based on some priority is called priority queue.
Posted By:Bourke Fischer      Posted On: May 21

C++ Programming
Comments: 0

What is Parenthetical Level in dfs (data file structure)?

Starting from the innermost parenthesis to the outermost parenthesis, we solve the expression based on the level of parenthesis is called the parenthetical level. [ Innermost parenthesis have the highest priority ].
Posted By:Lu Fischer      Posted On: May 15

Assembly Language
Comments: 0

List the allowed register pairs of 8085

a) B-C register pair
b) D-E register pair
c) H-L register pair
Posted By:Adelaide Fischer      Posted On: May 15

C++ Programming
Comments: 0

Write an algorithm for Pushing a Node above the top of stack using Singly Linked List in dfs

PROCEDURE PUSH_STACK(TOP)
[Where top of the stack has been caught in pointer ‘TOP’]

1. [Allocating the memory for new node & pushing it into stack]

Call GETNODE (I)
DATA (P) <-- ‘xyz’
LINK (P) <-- TOP
TOP <-- P
return (TOP).

2. [FINIS...
Posted By:Sarah Hughes      Posted On: May 25

C++ Programming
Comments: 0

What is Weight of a graph in dfs (data file structure)?

The number on any edge is called the weight of that graph. They are the number of paths from one node to another.
Posted By:Vid Fischer      Posted On: May 24

C++ Programming
Comments: 0

Operator overloading is necessary because - select option

Options

a) C++ attempts to make the user-defined classes act like built-in types
b) To provide new definitions for most of the C++ operators
c) To add user-defined data type like basic data types
d) All of the above

Answer : d) All of the ab...
Posted By:Sophie Campbell      Posted On: May 22

C++ Programming
Comments: 0

What is Priority Queues in dfs (data file structure)?

A queue in which we are able to insert items or remove items from any position based on some priority is called priority queue.
Posted By:Bourke Fischer      Posted On: May 21

C++ Programming
Comments: 0

What is Parenthetical Level in dfs (data file structure)?

Starting from the innermost parenthesis to the outermost parenthesis, we solve the expression based on the level of parenthesis is called the parenthetical level. [ Innermost parenthesis have the highest priority ].
Posted By:Lu Fischer      Posted On: May 15

Assembly Language
Comments: 0

List the allowed register pairs of 8085

a) B-C register pair
b) D-E register pair
c) H-L register pair
Posted By:Adelaide Fischer      Posted On: May 15

  65  66  67  68  69  70  71  72  73  74  75