Interested to Buy Any Domain ? << Click Here >> for more details...
What are the key features of C?
- 6 Answers
- 1430 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nashiinformaticssolutions
Simple and efficient
Portable
Procedural language
Rich set of built-in functions and operators
Low-level access to memory
Pointer support
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / nashiinformaticssolutions
• Object-Oriented Programming: Encapsulation, Inheritance, Polymorphism.
• Memory management via pointers.
• Support for both high-level and low-level programming.
• Strong type checking.
• STL (Standard Template Library) for reusable components.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / glibwaresoftsolutions
Simple and efficient
Portable
Procedural language
Rich set of built-in functions and operators
Low-level access to memory
Pointer support.
| Is This Answer Correct ? | 0 Yes | 0 No |
Simple and efficient
Portable
Procedural language
Rich set of built-in functions and operators
Low-level access to memory
Pointer support
| Is This Answer Correct ? | 0 Yes | 0 No |
• Object-Oriented Programming: Encapsulation, Inheritance, Polymorphism.
• Memory management via pointers.
• Support for both high-level and low-level programming.
• Strong type checking.
• STL (Standard Template Library) for reusable components.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / glibwaresoftsolutions
• Object-Oriented Programming: Encapsulation, Inheritance, Polymorphism.
• Memory management via pointers.
• Support for both high-level and low-level programming.
• Strong type checking.
• STL (Standard Template Library) for reusable components.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is a nested loop?
write a program to copy a string without using a string?
What is the difference between void main() and int main()?
Method Overloading exist in c ?
How can I find out how much memory is available?
what is the program to display your name in any color?
There is a 100-story building and you are given two eggs. The eggs (and the building) have an interesting property that if you throw the egg from a floor number less than X, it will not break. And it will always brake if the floor number is equal or greater than X. Assuming that you can reuse the eggs which didn't broke; you got to find X in a minimal number of throws. Give an algorithm to find X in minimal number of throws.
Explain is it valid to address one element beyond the end of an array?
What is hashing in c?
What should malloc(0) do?
Is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
Is c is a procedural language?
C 
