Answer Posted / core_coder

#include <stdio.h>

struct node {
int x;
int y;
};

unsigned int find_size ( void* p1, void* p2 )
{
return ( (char*)p2 - (char*)p1 );
}

int main ( int argc, char* argv [] )
{
struct node data_node;
int x = 0;

printf ( "\n The size :%d",
find_size ( (void*) &data_node,
(void*) ( &data_node +
1 ) ) );
printf ( "\n The size :%d", find_size ( (void*) &x,
(void*) ( &x + 1 ) ) );
}

this will work for any data type

Differentiate between full, complete & perfect binary trees.

1090

---

What is the use of static variable in c?

1089

---

What is 1d array in c?

1084

---

What is string function c?

1017

---

Explain the bubble sort algorithm.

1055

---

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

1205

---

A collection of data with a given structure for excepting storing and providing on demand data for multiple users a) linked list b) datastructer c) database d) preprocessor

1084

---

How can you draw circles in C?

1156

---

How can I determine whether a machines byte order is big-endian or little-endian?

1055

---

What are file streams?

1010

---

What is an arrays?

1072

---

What is the use of clrscr?

1102

---

What is the difference between arrays and pointers?

1121

---

What is the difference between procedural and declarative language?

1141

---

How to explain the final year project as a fresher please answer with sample project

975

---