Answer Posted / mobashyr

#include<stdio.h>
#include<conio.h>


int main()
{
FILE *fin;
char c;
fin=fopen("prntsrccode.c","r");
if(fin==NULL)
{
printf("Error Opening file in read mode");
exit(1);
}
do
{
c=fgetc(fin);
fputchar(c);
}while(c!=EOF);

fclose(fin);

getch();
return 0;
}

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

625

---

Can stdout be forced to print somewhere other than the screen?

612

---

What do you understand by normalization of pointers?

619

---

Explain spaghetti programming?

681

---

What is the difference between malloc calloc and realloc in c?

643

---

---

Array is an lvalue or not?

632

---

What are types of functions?

558

---

How do you do dynamic memory allocation in C applications?

626

---

Why can't I perform arithmetic on a void* pointer?

634

---

Explain how does flowchart help in writing a program?

622

---

What is conio h in c?

617

---

What is array in C

704

---

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 }

2709

---

Explain what are the different file extensions involved when programming in c?

629

---

What standard functions are available to manipulate strings?

557

---