What is the fallacy in the following program segment ? int *f1() { int a=5;

What is the fallacy in the following program segment ?

int *f1()
{
int a=5;
return &a;
}
f()
int *b=f1()
int c=*b;
}

Question Posted / kiran

1 Answers
4228 Views
Geometric Software, I also Faced
E-Mail Answers

What is the fallacy in the following program segment ? int *f1() { int a=5; return &a; } ..

Answer / vaishav bachhav

function f() has no opening brackets.
and the first line of f() has no semicolon.

Is This Answer Correct ?

4 Yes

0 No

Post New Answer

More Engineering AllOther Interview Questions

Why do large ships like aircraft carriers not sink despite weighing several thousand tonnes?

0 Answers

difference between tcp ip and open system interconnection

0 Answers

How much engineering percentage is required to get admission in MS (USA)

1 Answers

which collection enforces type safety?

0 Answers

What is a computer without a hard disk called as technically ?

1 Answers

hi i have selected for nda and could please send me the courses offered in nda regarding engineering and all other courses????

0 Answers

i want to knw about what is lead,survey, oppertuinty , questionary,sales order,quotation,marketng conecpts in deatil and how it works in SAP CRM. Please send to my email- id as soon as possible. Thanks in Advance . :) nimi.nimisha1@gmail.com

0 Answers

WHY IBM MAINFRAME TECHNOLOY IS USED.THOUGH, SINCE ITS INTRODUCTION IT HAS NO MAJOR UPDATATION OR MODIFICATION;BUT STILL IT IS IN DEMAND........WWWWWWWWWWWWWWHHHHHYYYYYYYY????????????

0 Answers HCL,

WHAT IS DIFFERENT BETWEEN YOU AND OTHER APPLICANT TO GIVE YOU THE JOB

0 Answers ONGC,

What is HPLC ? and define it.

0 Answers

10. Write a program in ‘C’ language that will perform the following operation on double link list. Each node of this list contains the address of previous as well as next node. The previous pointer of first node & next pointer of last node should contain null. 1. Creation of list with as many records as user want 2. Search a node in the list 3. Deletion at last position 4. Display 5. Exit Create separate functions for each operation. The create () will be used to create the list. It should accept no argument & return the address of the starting node. Search() will search a node in the list. It receives rollno as argument & return that node if found otherwise return null. The delete () function will delete the last node. It does not receive any argument & return structure type value at last position. The starting node of the double list must be declared as external pointer variable. Each element of double link list will contain the following information Roll No, Std Name, Course. Use do-while loop & switch case for generating the above menu. The format of the output should is given below: S.No. Roll No. Student Name Course 1 cse01 Anil Singh B.Tech

0 Answers

how strcpy usingrecursive function

0 Answers

For more Engineering AllOther Interview Questions Click Here