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
Assembly Language
Comments: 0

List the operation modes of 8255

a) I.O Mode

i. Mode 0-Simple Input/Output.
ii. Mode 1-Strobed Input/Output (Handshake mode)
iii. Mode 2-Strobed bidirectional mode

b) Bit Set/Reset Mode.
Posted By:Callum Evans      Posted On: Nov 20

Assembly Language
Comments: 0

Name 5 different addressing modes?

Immediate, Direct, Register, Register indirect, Implied addressing modes.
Posted By:Brand Fischer      Posted On: Nov 19

C++ Programming
Comments: 0

What is Undirected Graph in dfs (data file structure)?

If number o9f directed edge is 0 then the graph is called undirected graph.
Posted By:Jasmine Brown      Posted On: Nov 19

C++ Programming
Comments: 0

What is Cycle in dfs (data file structure)?

Cycle is a path whose initial and terminal node is same.
Posted By:Blasa Fischer      Posted On: Nov 19

C++ Programming
Comments: 0

Which of the following operators cannot use friend functions for overloading?

I. ==
II. ( )
III. [ ]
IV. ->

Options

a) I only
b) II only
c) II, III and IV
d) I, II and III

Answer : c) II, III and IV
Posted By:Samuel Evans      Posted On: Nov 17

C++ Programming
Comments: 0

What is Preloading in dfs (data file structure)?

Arranging the numbers according to their priority is called preloading.
Posted By:Martha Hughes      Posted On: Nov 16

Assembly Language
Comments: 0

List the operation modes of 8255

a) I.O Mode

i. Mode 0-Simple Input/Output.
ii. Mode 1-Strobed Input/Output (Handshake mode)
iii. Mode 2-Strobed bidirectional mode

b) Bit Set/Reset Mode.
Posted By:Callum Evans      Posted On: Nov 20

Assembly Language
Comments: 0

Name 5 different addressing modes?

Immediate, Direct, Register, Register indirect, Implied addressing modes.
Posted By:Brand Fischer      Posted On: Nov 19

C++ Programming
Comments: 0

What is Undirected Graph in dfs (data file structure)?

If number o9f directed edge is 0 then the graph is called undirected graph.
Posted By:Jasmine Brown      Posted On: Nov 19

C++ Programming
Comments: 0

What is Cycle in dfs (data file structure)?

Cycle is a path whose initial and terminal node is same.
Posted By:Blasa Fischer      Posted On: Nov 19

C++ Programming
Comments: 0

Which of the following operators cannot use friend functions for overloading?

I. ==
II. ( )
III. [ ]
IV. ->

Options

a) I only
b) II only
c) II, III and IV
d) I, II and III

Answer : c) II, III and IV
Posted By:Samuel Evans      Posted On: Nov 17

C++ Programming
Comments: 0

What is Preloading in dfs (data file structure)?

Arranging the numbers according to their priority is called preloading.
Posted By:Martha Hughes      Posted On: Nov 16

  21  22  23  24  25  26  27  28  29  30  31