Answer Posted / kirit vanani

#1 C is a type of computer programming language.
While embedded C is a set of language extensions for the C Programming language.

#2 C has a free-format program source code, in a desktop computer.
while embedded C has different format based on embedded processor (micro-controllers/microprocessors).

#3 C have normal optimization, in programming.
while embedded C high level optimization in programming.

#4 C programming must have required operating system.
while embedded C may or may not be required operating system.

#5 C can use resources from OS, memory, etc, i.e all resources from desktop computer can be used by C.
while embedded C can use limited resources, like RAM, ROM, and I/Os on an embedded processor.

#6 Compilers for C typically generate OS dependent executable. i.e you can run program from OS terminal directly.
While, embedded C requires compilers to create files, and downloaded to the processor, (microcontrollers/microprocessors) where it needs to run.

#7 C programing run in console, i.e you can see output, in your OS (desktop).
while, embedded C run in real time constraints. i.e you can't see output in OS.

#8 C has directly or indirectly influenced a lot of the later programming languages,
such as C#, D, Go, Java, JavaScript, Limbo, LPC, Perl, PHP, Python, and Unix's C shell.
While, Embedded C support only required processor.

#9 In C programming we can easily input program data, when running.
While, embedded C have pre-defined data, that have been given while programming.

#10 Example of C program is, OS based software, simple logic program, etc.
example of embedded C is TV, DVD, washing machine, etc.

What are conditional operators in C?

621

---

What is the use of printf() and scanf() functions?

630

---

What is pointer in c?

740

---

Explain what is wrong in this statement?

632

---

How can I generate floating-point random numbers?

602

---

---

You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

2712

---

Explain threaded binary trees?

676

---

Explain how can a program be made to print the line number where an error occurs?

694

---

What is the use of in c?

576

---

in multiple branching construct "default" case is a) optional b) compulsarily c) it is not include in this construct d) none of the above

635

---

Is c pass by value or reference?

595

---

How would you use the functions fseek(), freed(), fwrite() and ftell()?

702

---

What is a const pointer in c?

670

---

What are volatile variables in c?

519

---

write a program to print largest number of each row of a 2D array

1870

---