Scribd
Upload
49 views12 pages

Global Edge Technical Paper

CareerNet Consulting Pvt. Ltd is a pioneering company that provides career counseling, guidance and placement services to students. They have worked with over 75 IT and KPO companies and placed more than 2000 students in the last 3 years through their presence in over 100 engineering campuses across India. Their services also include research, corporate scholarships, managing relationships and internships.

Uploaded by

Jayanth Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
49 views12 pages

Global Edge Technical Paper

CareerNet Consulting Pvt. Ltd is a pioneering company that provides career counseling, guidance and placement services to students. They have worked with over 75 IT and KPO companies and placed more than 2000 students in the last 3 years through their presence in over 100 engineering campuses across India. Their services also include research, corporate scholarships, managing relationships and internships.

Uploaded by

Jayanth Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 12

CareerNet Consulting Pvt.

Ltd

Mail your Resume: jobs@careernet.co.in

Campus-Connect, a division of CareerNet Consulting is a pioneering concept aimed at providing solutions for strengthening industry-academia landscape. We are presently working with over 75 leading IT & KPO organizations and have a strong presence in more than 100 top engineering campuses across India. We have provided extensive career counseling and career guidance to over 80,000 students and have had success in placement of over 2000 students in hi-tech companies in last 3 years. Our services also include research, constituting corporate scholarships, managing relationships, career placements and internship. ____________________________________________________________________________________________ Company Name: Global Edge

Technical Written Paper


1. What is the output of the following code? int main ( ) { for (; ;); printf ("Hello\n"); return 0; } a. Give compilation error b. Prints Hello infinite times c. Runs in an infinite loop without printing anything. d. Prints Hello once.

2. Output of the code?

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


FUNC (int *p) { p = (int *) malloc (100); printf ("p: %x", p); } int main ( ) { int *ptr; FUNC(ptr); printf ("Ptr: %x", ptr); return 0; } a. Both printf statements print same values. b. Both print different values. c. Gives compile time error. d. Gives run time error.

3. Output of the code? int main () { char a [] = "world"; printf ("%d %d\n", strlen (a), sizeof (a)); return 0; }

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


a. 5, 5 b. 6, 5 c. 5, 6 d. 6, 6

4. What is the output generated? main () { char *s = "Hello"; printf ("%s", 1(s)); } a. Hello b. ello c. e d. None of these.

5. Interpret the given declaration char (* (f ( )) [ ]) ( ) a. f is a pointer to function returning char b. f is a pointer to an array of function returning a char c. Invalid declaration d. f is a function returning pointer to array [] of pointer to function returning char.

6. A binary tree of height h, h > 0 has

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


a. At least h and at most 2*h-1 elements in it. b. At least 2^h and at most (2^h) +1 elements in it. c. At least 2^h -1 and at most h^2 elements in it. d. At least h and at most (2^h) - 1 elements in it.

7. Thrashing is a. Flooding of pages in the memory. b. Increase in removal of pages from memory. c. Increase in page faults leading to decrease in CPU utilization. d. Removal of unused pages from memory making space for new ones.

8. Recursive Descent parser is a type of a. Bottom up parser. b. Top Down parser. c. None of these. d. Bottom down parser.

9. alloc () allocates memory from a. Heap. b. Reserved memory. c. Data segment. d. Stack.

10. What is the octal equivalent of decimal (5468).

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


a. 12360. b. 12560. c. None of these. d. 12650.

11. main () {int i; i= (2, 3); printf ("%d", i); } a. 2 b. 3 c. Compiler error d. Syntax error

12. main () { char str [] ="GESL"; printf ("%d %d", sizeof (str), strlen (str)); } a. 5, 5 b. 4, 4 c. 5, 4 d. 4, 5

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in

13. main () { for (i=0; i++; i<100) printf ("hello world\n"); } a. 100 times b. 0 times c. Infinite loop d. None of the above.

14. main () { for (i=1; i++; i<100) printf ("hello world\n"); } a. 100 times b. 0 times c. Infinite loop d. None of the above.

15. main () {

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


char c; scanf ("%s", c); } a. Compiler dependent b. Unpredictable c. Compiler error d. Scans the input

16. main () { int k=5; for (++k<5 && k++/5 || ++k<8); printf ("%d\n", k); } a. 5 b. 6 c. 7 d. 8 17. main () { int *ptr1,*ptr2; ptr1= (int *) malloc (sizeof (int)); ptr2=func (20, 10, ptr1); printf ("%d %d\n",*ptr1,*ptr2);

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


} int *func (int a, int b, int *c) { int x=a+b; *c=a-b; return (&x); } a. Bug in the code. b. No Bugs prints correctly c. Error d. None of the above.

18. int main () { int i = 10, j; if ((j = ~i) < i) printf (True); else printf (False); } a. True b. False c. Compiler Dependent

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


d. None of the above.

19. How many bytes are required to create a 3*3 matrix using double pointer

20. take int=4, float=8, char=1 main () { FILE *fp; printf ("%d\n", sizeof (fp)); } a. 2 b. 4 c. Compiler dependent d. Error

21. main () { int a=10, 20; a^=b^=a^=b; printf ("%d\n %d\n", a, b); a. a=20, b=10 b. a=10,b=20 c. Syntax error

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


d. Unpredictable

22. main () { int i=10; switch (i) { case 10: printf ("Hello "); { case 1: printf ("World "); } case 5: printf ("Hello World "); } } a. Hello b. Hello c. Hello World Hello World d. Syntax Error.

23. main () { char str1 [] ="Hello"; char str2 [] ="Hello"; if (str1==str2)

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


printf ("True\n"); else printf ("False\n"); } a. True b. False c. Error d. Unpredictable.

24. main () { # include <stdio.h> int i = 10; printf ("%d\n", i/2); } a. 10 b. 5 c. error d. Warning

25. #include <stdio.h> # pragma pack (2) struct SIZE {

Mail your resume: jobs@careernet.co.in

CareerNet Consulting Pvt. Ltd

Mail your Resume: jobs@careernet.co.in


int i; char ch; double db; }; main () { printf (%d\n", sizeof (struct SIZE)); } a.12 b.14 c.16 d. 8

Mail your resume: jobs@careernet.co.in

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy