Answer Posted / devarathnam .c, s.v.university

Hi Sujatha,

Program for your question no.52.

#include<stdio.h>
main()
{
if(Printf("Hello World!!!"))
}
Here I didn't use semicolon, I hope I met your criteria.

What is the code in while loop that returns the output of given code?

1313

---

find out largest elemant of diagonalmatrix

1647

---

How many levels of pointers can you have?

697

---

What is a const pointer?

630

---

in programming languages a statement or part of a statement that specifies several different execution sequences a) constructs b) distructs c) executes d) none

597

---

---

What is the difference between typedef and #define?

541

---

What is the scope of global variable in c?

551

---

Describe static function with its usage?

607

---

What is uint8 in c?

639

---

explain what is an endless loop?

608

---

string reverse using recursion

1805

---

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 }

2711

---

What is a structural principle?

638

---

Write a C program in Fibonacci series.

629

---

what is the c source code for the below output? 10 10 10 10 10 10 10 10 10 10 9 9 7 6 6 6 6 6 6 9 7 5 9 7 3 2 2 5 9 7 3 1 5 9 7 3 5 9 7 4 4 4 4 5 9 7 8 8 8 8 8 8 8 8 9

1426

---