Logo 
Search:

Interview FAQs

Submit Interview FAQ
Home » Interview FAQsRSS Feeds
C++ Programming
Comments: 0

Write an algorithm for Creating a Binary Tree in dfs (data file structure).

PROCEDURE CREATE(ROOT)

1. [Initialize]

ROOT =0.

3. [Creating left child]

D <-- CALL POP(Q,F)
LPTR(D) <-- NODE
LPTR(LPTR(D)) <-- NULL
RPTR(LPTR(D)) <-- NULL
CALL PUSH(Q,R,LPTR(D))
READ(DATA(LPTR(D))).

4. [Creating rig...
Posted By:Noah Bouchard      Posted On: Oct 02

Assembly Language
Comments: 0

What is meant by interrupt?

Interrupt is an external signal that causes a microprocessor to jump to a specific subroutine.
Posted By:Vande Fischer      Posted On: Oct 01

Assembly Language
Comments: 0

List 16 – bit registers of 8085 microprocessor

Stack pointer (SP) and
Program counter (PC).
Posted By:Libby Hughes      Posted On: Oct 01

C++ Programming
Comments: 0

The default constructor for class A is - select option

Options

a) A :: A()
b) A :: A(int)
c) A :: A(int);
d) A :: A();

Answer : a) A :: A()
Posted By:Adalicia Fischer      Posted On: Sep 30

Assembly Language
Comments: 0

Give examples for Maskable interrupts?

RST 7.5, RST6.5, RST5.5 are Maskable interrupts
Posted By:Vilhelm Fischer      Posted On: Sep 29

C++ Programming
Comments: 0

Write an algorithm for Creating Circular Doubly Linked List in dfs.

PROCEDURE CREATE_CD(T)
[Where pointer ‘HEAD’ has been caought in pointer ‘T’ and pointer ‘head’ and ‘p’ are global variables]

1. [Allocating the memory for the node and taking value from the user]

Call GETNODE (T)
DATA (T) <-- ‘xyz’ ...
Posted By:Lauren Hughes      Posted On: Sep 28

  99  100  101  102  103  104  105  106  107  108  109