Mphasis solved technical questions
1) what is new ?
2) What is difference between new and malloc ?
3) What is diff. between link list and array ?
4) How many normal forms we have ?
5) What is cursor ?
6) What is spiral model ?
7) What are various phases of sdlc ?
8) What is the time complexity of following C code
9) name some protocols !
10)Tell output of a program !
11) Tell diff. b/w c and c++ ?
12 If in a circular queue, front and rear are at adjacent location then this is the condition for (overflow).
13. If address location is not allotted, malloc function returns (null pointer).
14. Notation for calloc is (p=(ptr *)calloc(10,6)).
15. Which of them returns a null pointer (malloc)?
16 Stack work on the basis of (LIFO).
17 An array is a (Collection of similar elements stored at adjacent memory location).
18 First element of a tree is (Root).
h. Main()
{ int a=5;
printf(a%d,a);
main();
getch();
}
( No output).
19 Something related to memory management.
20 What is 8085,8086?
21 Difference between 8085,8086?
22 What is segmentation of memory and others questions?
23 which of d following is efficient sorting algorithm.
1) Heap sort
2) Bubble sort
3) Selection sort
4) Quick sort
24 The following code consist of some error what is d error.
25 What is recursion
26 Write a pgm to swap two variable withought using third variable…
27 constructor, destructor….et
28 How is linked list implemented
Ans. By referential structures
29. What is meant by functional dependency
30. What is a semaphore
Ans. A method synchronization of multiple processes
31. What is the precedence order from high to low ,of the symbols ( ) ++ /
Ans.( ) , ++, /
32 Preorder of A*(B+C)/D-G
Ans.*+ABC/-DG
33 B-tree (failure nodes at same level)
34. Dense index (index record appears for every search -key in file)
35. What is the efficiency of merge sort
Ans. O(n log n)
36 program on swapping ( 10,5 )was given (candidate cannot recollect)
37. Which of the following sorting algorithem has average sorting behavior — Bubble sort, merge sort, heap sort, exchange sort
Ans. Heap sort
38. In binary search tree which traversal is used for getting ascending order values–Inorder ,post order,preorder
Ans. Inorder
39 What are device drivers used for
Ans. To provide software for enabling the hardware
40 Irrevalent to unix command ( getty)
41 What is fork command in unix
Ans. System call used to create process
42. What is make command in Unix
Ans. Used for creation of more than one file
43 In unix .profile contains
Ans. Start up program
44. In unix echo is used for
45 What is meant by polymorphism
Ans. Redfinition of a base class method in a derived class
46 . What is the essential feature of inheritance
Ans. All properties of existing class are derived
47 . What does the protocol FTP do
Ans. Transfer a file b/w stations with user authentification
48 . In the transport layer ,TCP is what type of protocol
Ans. Connection oriented
49 . Why is a gateway used
Ans. To connect incompatible networks
50 . Preorder of A*(B+C)/D-G
Ans.*+ABC/-DG
51. Dense index (index record appers for every search -key in file)
52. A program on swaping ( 10,5 )was given (candidate cannot recollect)
53. Irrevalent to unix command ( getty)
54. What is fork command in unix
Ans. System call used to create process
55. What is make command in unix
Ans. Used forcreation of more than one file
56. In unix .profile contains
Ans. Start up program