Answer Posted / hr@tgksolutions.com
A linear data structure that executes operations in Last In First Out (LIFO) order is referred to as a stack.
Only the topmost element in a stack can be accessed, followed by the bottom element.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Write a program to generate a pulse width frequency of your choise,which can be variable by using the digital port of your processor
Explain how to reverse singly link list.
Explain how are 16- and 32-bit numbers stored?
why return type of main is not necessary in linux
What do you understand by friend-functions? How are they used?
What is cohesion in c?
count = 0; for (i = 1;i < = 10; i++);count = count + i; Value of count after execution of the above statements will be a) 0 b) 11 c) 55 d) array
Mention four important string handling functions in c languages .
What are enums in c?
What are dangling pointers? How are dangling pointers different from memory leaks?
a construct the"else" part of "if" statement contains anoth "if else" statement is called a) if-else b) else-if-else c) if-else-if-else d) chain if/if-else-if
develop algorithms to add polynomials (i) in one variable
Why we use void main in c?
What is the difference between test design and test case design?
An organised method of depicting the use of an area of computer memory used to signify the uses for different parts of the memory a) swap b) extended memory c) memory map d) all of the above