Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

Chowgule Interview Questions
Questions Answers Views Company eMail

Write a C Program to create a structured data file named Student.dat to store the roll no, name and course. Provide following functions: 1. Accept the values from the user using structure variables. Store the contents in a file. 2. Display the file. 3. The user should be able to add new records to the existing file. And display the new file.

4 40571

Post New Chowgule Interview Questions


Chowgule Interview Questions


Un-Answered Questions

What is exclusive process?

190


what is an function of air cell bag in air cell conservator

2848


How would you add elements and pictures to listitems in listview control?

1436


What is the difference between synchronous and asynchronous update? : abap bdc

632


Wind mill

1406






What is the difference between a subquery and a join?

520


What new in zend framework 2.0?

147


What is difference between visualforce components and lightning components ? : salesforce lightning component

192


Can we store pictures in the database and if so, how it can be done?

578


Are there apis to read rss/atom feeds?

629


What is the purpost of using $http service and ajax request in angualrjs?

457


#include #include #include #include void insert(struct btreenode **, int); void inorder(struct btreenode *); struct btreenode { struct btreenode *leftchild; struct btreenode *rightchild; int data; }; main() { struct btreenode *bt; bt=(struct btreenode *)NULL; int req,i=1,num; clrscr(); printf("Enter number of nodes"); scanf("%d",&req); while(i<=req) { printf("Enter element"); scanf("%d",&num); insert(&bt,num); i++; } inorder(bt); } void insert(struct btreenode **sr, int num) { if(*sr==NULL) { *sr=(struct btreenode *)malloc (sizeof(struct btreenode)); (*sr)->leftchild=(struct btreenode *)NULL; (*sr)->rightchild=(struct btreenode *)NULL; (*sr)->data=num; return; } else { if(num < (*sr)->data) insert(&(*sr)->leftchild,num); else insert(&(*sr)->rightchild,num); } return; } void inorder(struct btreenode *sr) { if(sr!=(struct btreenode *)NULL) { inorder(sr->leftchild); printf("\n %d",sr->data); inorder(sr->rightchild); } else return; } please Modify the given program and add two methods for post order and pre order traversals.

3235


Who generates bytecode in java?

498


Does mongodb require a schema?

1


can the activities of test case design be automated?

1443