Answer / pavan mustyala

To start with data structures, Linked lists comes 1st.
Hands on experience with the following questions will give
good confidence to a programmer.
1. Creating a list (Single linked list or double linked
list)
a. add node to front of the list
b. add node to end of the list
c. add node to middle of the list
d. Delete first node
e. Delete last node
f. Delete middle node
2. Identifying Loop or circle in a single linked list
3. Reversing a linked list(single and double)
4. finding middle node of a list
5. All the above programs can be extended to develop a
generic linked list even.

In the above programs stacks and queues concepts are
covered. To develop Stack LIFO concept is followed.
To develop Queue FIFO concept is followed.

Answer / papa_structure

stacks, queues, linklist, trees, graphs and
sorting.....leave these topics and rest all are data
structures..................................................
............................................................
............................................................
............................................................
...........





dumbo!!!!!!!!!!!!think b4ore u ask.........

func(a,b) int a,b; { return( a= (a==b) ); } main() { int process(),func(); printf("The value of process is %d !\n ",process(func,3,6)); } process(pf,val1,val2) int (*pf) (); int val1,val2; { return((*pf) (val1,val2)); }

1 Answers   Satyam,

---

main() { float me = 1.1; double you = 1.1; if(me==you) printf("I love U"); else printf("I hate U"); }

1 Answers  

---

char *someFun() { char *temp = “string constant"; return temp; } int main() { puts(someFun()); }

1 Answers  

---

why nlogn is the lower limit of any sort algorithm?

0 Answers  

---

#include<stdio.h> main() { struct xx { int x=3; char name[]="hello"; }; struct xx *s; printf("%d",s->x); printf("%s",s->name); }

3 Answers   Hexaware,

---

enum colors {BLACK,BLUE,GREEN} main() { printf("%d..%d..%d",BLACK,BLUE,GREEN); return(1); }

2 Answers  

---

main() { int i = 257; int *iPtr = &i; printf("%d %d", *((char*)iPtr), *((char*)iPtr+1) ); }

1 Answers   CSC,

---

respected sir, i did my MCA in 2013 when i am going to attend to an interview i was asked about my project how will i explain my project could please help me in this and my project title is "Social Networking Site For Social Responsibility"

1 Answers   Genpact, Ozdocs,

---

In a gymnastic competition, scoring is based on the average of all scores given by the judges excluding the maximum and minimum scores. Let the user input the number of judges, after that, input the scores from the judges. Output the average score. Note: In case, more than two judges give the same score and it happens that score is the maximum or minimum then just eliminate two scores. For example, if the number of judges is 5 and all of them give 10 points each. Then the maximum and minimum score is 10. So the computation would be 10+10+10, this time. The output should be 10 because 30/3 is 10.

0 Answers   TCS,

---

main() { char *a = "Hello "; char *b = "World"; clrscr(); printf("%s", strcpy(a,b)); } a. “Hello” b. “Hello World” c. “HelloWorld” d. None of the above

4 Answers   Corporate Society, HCL,

---

Set up procedure for generating a wire frame display of a polyhedron with the hidden edges of the object drawn with dashed lines

0 Answers   IBM,

---

To reverse an entire text file into another text file.... get d file names in cmd line

0 Answers   Subex,

---