Mindtree Sample Technical Placement Paper

Visit www.latestoffcampus.com for placement papers, interview tips & job updates. Toget freeupdates tomail http://groups.google.
com/group/latestoffcampus/subscribeLive updates on Facebook @ www.facebook.com/LatestOffCampus
Mindtree Technical Latest Sample Placement Paper

1. Compilation How to reduce a final size of executable? ANS: Size of the final executable can be reduced using dynamic linking for libraries. Linked Lists -- Can you tell me how to check whether a linked list is circular? Create two pointers, and set both to the start of the list. Update each as follows: while (pointer1) { pointer1 = pointer1->next; pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next; if (pointer1 == pointer2) { print ("circular"); } } If a list is circular, at some point pointer2 will wrap around and be either at the item just before pointer1, or the item before that. Either way, its either 1 or 2 jumps until they meet. 2. "Union" Data Type What is the output of the following program? Why? ANS: #include main() { typedef union { int a; char b[10]; float c; } Union; Union x, y = {100}; x.a = 50; strcpy(x.b, "hello"); x.c = 21.50; printf("Union x : %d %s %f n", x.a,x.b,x.c); printf("Union y : %d %s %f n", y.a,y.b,y.c); }
Visit www.latestoffcampus.com for placement papers, interview tips & job updates. Toget freeupdates tomail http://groups.google.com/group/latestoffcampus/subscribeLive updates on Facebook @ www.facebook.com/LatestOffCampus
3. String Processing --- Write out a function that prints out all the permutations of a string. For example, abc would give you abc, acb, bac, bca, cab, cba. ANS: void PrintPermu (char *sBegin, char* sRest) { int iLoop; char cTmp; char cFLetter[1]; char *sNewBegin; char *sCur; int iLen; static int iCount; iLen = strlen(sRest); if (iLen == 2) { iCount++; printf("%d: %s%s\n", iCount, sBegin, sRest); iCount++; printf("%d: %s%c%c\n", iCount, sBegin, sRest[1],sRest[0]); return; } else if (iLen == 1) { iCount++; printf("%d: %s%s\n", iCount, sBegin, sRest); return; } else { // swap the first character of sRest with each of // the remaining chars recursively call debug print sCur = (char*)malloc(iLen); sNewBegin = (char*)malloc(iLen); for (iLoop = 0; iLoop < iLen; iLoop ++) { strcpy(sCur, sRest); strcpy(sNewBegin, sBegin); cTmp = sCur[iLoop];
sCur[iLoop] = sCur[0]; sCur[0] = cTmp; sprintf(cFLetter, "%c", sCur[0]); strcat(sNewBegin, cFLetter); debugprint(sNewBegin, sCur+1); } } } void main() { char s[255]; char sIn[255]; printf("\nEnter a string:"); scanf("%s%*c",sIn); memset(s,0,255); PrintPermu(s, sIn); }E 4. What will the following piece of code do int f(unsigned int x) { int i; for (i=0; x!0; x>>=1){ if (x & 0X1) i++; } return i; } ANS: returns the number of ones in the input parameter X 5. What will be printed as the result of the operation below: main(){ int a=0; if(a==0) printf(Tech Preparation\n); printf(Tech Preparation\n); } ANS: Two lines with Tech Preparation will be printed. 6. Write down the equivalent pointer expression for referring the same element a[i] [j] [k] [l]?
ANS: a[i] == *(a+i) a[i][j] == *(*(a+i)+j) a[i][j][k] == *(*(*(a+i)+j)+k) a[i][j][k][l] == *(*(*(*(a+i)+j)+k)+l) 7. What are x, y, y, u #define Atype int* typedef int *p; p x, z; Atype y, u; ANS: x and z are pointers to int. y is a pointer to int but u is just an integer variable. 8. How do you show which page you're on (in a menu)? ANS: If PHP is not available to you, you could use the cascade. Put an id in your body tags and an id in each of your 'a' tags for the links. Let's say on page one you have this: CSS <body id="page1"> .... <a id="page1link" href="page1.htm">page one</a> ... </body> In your CSS, you can have something like this: CSS #page1 a#page1link { color: purple; 9. Which bit wise operator is suitable for checking whether a particular bit is on or off? ANS: The bitwise AND operator. Here is an example: enum { KBit0 = 1, KBit1, KBit31, }; if ( some_int & KBit24 )
printf ( Bit number 24 is ON\n ); else printf ( Bit number 24 is OFF\n ); 10. Why does malloc (0) return valid memory address? What's the use? ANS: Malloc (0) does not return a non-NULL under every implementation. An implementation is free to behave in a manner it finds suitable, if the allocation size requested is zero. The implementation may choose any of the following actions: * A null pointer is returned. * The behavior is same as if a space of non-zero size was requested. In this case, the usage of return value yields to undefined-behavior. Notice, however, that if the implementation returns a non-NULL value for a request of a zero-length space, a pointer to object of ZERO length is returned! Think, how an object of zero size should be represented? For implementations that return non-NULL values, a typical usage is as follows: void func ( void ) { int *p; /* p is a one-dimensional array, whose size will vary during the the lifetime of the program */ size_t c; p = malloc(0); /* initial allocation */ if (!p) { perror (FAILURE ); return; } /* */ while (1) {
c = (size_t) ; /* Calculate allocation size */ p = realloc ( p, c * sizeof *p ); /* use p, or break from the loop */ /* */ } return; } Notice that this program is not portable, since an implementation is free to return NULL for a malloc (0) request, as the C Standard does not support zero-sized objects. 11. How can we define method in multiple base classes with same name can be invoked from derived class simultaneously. ANS: ex: class x { public: m1(); }; class y { public: m1(); }; class z :public x, public y { public: m1() { x::m1(); y::m1(); } }; 12. How can we place multiple blocks next to each other? In theory, the following will produce 4 "columns": <DIV style="float: left; width: 25%;">Block 1</DIV> <DIV style="float: left; width: 25%;">Block 2</DIV> <DIV style="float: left; width: 25%;">Block 3</DIV> <DIV style="float: left; width: 25%;">Block 4</DIV>
ANS: Each "column" will occupy 25% of the screen. This relies on a correct implementation of float, which cannot be said of many legacy browsers. If you cannot accept display variances in older browsers, then it may be best to fall back to table-based solutions. By making the block an inline element and then use text-align property <DIV STYLE="text-align: center"> <TABLE STYLE="display: inline"> ... </TABLE> </DIV> This technique depends on the incorrect implementation of text-align behavior in older browsers. It will likely cease to work in future CSSconformant browsers, and eventually it will probably not be a viable solution. 13. When should the volatile modifier be used? ANS: The volatile modifier is a directive to the compilers optimizer that operations involving this variable should not be optimized in certain ways. There are two special cases in which use of the volatile modifier is desirable. The first case involves memory-mapped hardware (a device such as a graphics adaptor that appears to the computers hardware as if it were part of the computers memory), and the second involves shared memory (memory used by two or more programs running simultaneously). Most computers have a set of registers that can be accessed faster than the computers main memory. A good compiler will perform a kind of optimization called redundant load and store removal. The compiler looks for places in the code where it can either remove an instruction to load data from memory because the value is already in a register, or remove an instruction to store data to memory because the value can stay in a register until it is changed again anyway. If a variable is a pointer to something other than normal memory, such
as memory-mapped ports on a peripheral, redundant load and store optimizations might be detrimental. For instance, heres a piece of code that might be used to time some operation: time_t time_addition(volatile const struct timer *t, int a) { int n; int x; time_t then; x = 0; then = t->value; for (n = 0; n < 1000; n++) { x = x + a; } return t->value - then; } In this code, the variable t-> value is actually a hardware counter that is being incremented as time passes. The function adds the value of a to x 1000 times, and it returns the amount the timer was incremented by while the 1000 additions were being performed. Without the volatile modifier, a clever optimizer might assume that the value of t does not change during the execution of the function, because there is no statement that explicitly changes it. In that case, theres no need to read it from memory a second time and subtract it, because the answer will always be 0. The compiler might therefore optimize the function by making it always return 0. If variable points to data in shared memory, you also dont want the compiler to perform redundant load and store optimizations. Shared memory is normally used to enable two programs to communicate with each other by having one program store data in the shared portion of memory and the other program read the same portion of memory. If
the compiler optimizes away a load or store of shared memory, communication between the two programs will be affected. 14. How can we specify two different sets of link colors? By classifying each set of links and then attaching desired color to each set. CSS: <style type="text/css"> <!-A.set1:link {color: some_color; background: some_background_color} A.set1:visited {color: some_color; background: some_background_color} A.set1:active {color: some_color; background: some_background_color} A.set2:link {color: some_color; background: some_background_color} A.set2:visited {color: some_color; background: some_background_color} A.set2:active {color: some_color; background: some_background_color} --> </style> ANS: We can name set1 and set2 any way you like as long as the names are made up of letters a-z, A-Z, digits 0-9, period, hyphen, escaped characters, Unicode characters 161-255, as well as any Unicode character as a numeric code. Note: to avoid conflict with user's settings a background property (background color) should also be specified together with the color property (foreground color). 15. Write the equivalent expression for x%8? ANS: x&7
16. What is placement new? ANS: When you want to call a constructor directly, you use the placement new. Sometimes you have some raw memory that's already been allocated, and you need to construct an object in the memory you have. Operator new special version placement new allows you to do it. class Widget { public : Widget(int widgetsize); ... Widget* Construct_widget_int_buffer(void *buffer,int widgetsize) { return new(buffer) Widget(widgetsize); } }; This function returns a pointer to a Widget object that's constructed within the buffer passed to the function. Such a function might be useful for applications using shared memory or memorymapped I/O, because objects in such applications must be placed at specific addresses or in memory allocated by special routines. 17. How many levels of pointers can you have? ANS: The answer depends on what you mean by levels of pointers. If you mean How many levels of indirection can you have in a single declaration? The answer is At least 12. int i = 0; int *ip01 = & i; int **ip02 = & ip01; int ***ip03 = & ip02; int ****ip04 = & ip03; int *****ip05 = & ip04; int ******ip06 = & ip05; int *******ip07 = & ip06;
int ********ip08 = & ip07; int *********ip09 = & ip08; int **********ip10 = & ip09; int ***********ip11 = & ip10; int ************ip12 = & ip11; ************ip12 = 1; /* i = 1 */ The ANSI C standard says all compilers must handle at least 12 levels. Your compiler might support more. 18. What is name mangling? ANS: Name mangling is the process through which your C++ compilers give each function in your program a unique name. In C++, all programs have at-least a few functions with the same name. Name mangling is a concession to the fact that linker always insists on all function names being unique. Example: In general, member names are made unique by concatenating the name of the member with that of the class e.g. given the declaration: class Bar { public: int ival; ... }; ival becomes something like: // a possible member name mangling ival__3Bar Consider this derivation: class Foo : public Bar { public: int ival; ...
} The internal representation of a Foo object is the concatenation of its base and derived class members. // Pseudo C++ code // Internal representation of Foo class Foo { public: int ival__3Bar; int ival__3Foo; ... }; Unambiguous access of either ival members is achieved through name mangling. Member functions, because they can be overloaded, require an extensive mangling to provide each with a unique name. Here the compiler generates the same name for the two overloaded instances (Their argument lists make their instances unique). 19. How are portions of a program disabled in demo versions? ANS: If you are distributing a demo version of your program, the preprocessor can be used to enable or disable portions of your program. The following portion of code shows how this task is accomplished, using the preprocessor directives #if and #endif: int save_document(char* doc_name) { #if DEMO_VERSION printf(Sorry! You cant save documents using the DEMO version of this programming); return(0); #endif ... }
20. How can type-insensitive macros be created? ANS: A type-insensitive macro is a macro that performs the same basic operation on different data types. This task can be accomplished by using the concatenation operator to create a call to a type- sensitive function based on the parameter passed to the macro. The following program provides an example: #include #define SORT(data_type) sort_ ## data_type void sort_int(int** i); void sort_long(long** l); void sort_float(float** f); void sort_string(char** s); void main(void); void main(void) { int** ip; long** lp; float** fp; char** cp; ... sort(int)(ip); sort(long)(lp); sort(float)(fp); sort(char)(cp); ... } This program contains four functions to sort four different data types: int, long, float, and string (notice that only the function prototypes are included for brevity). A macro named SORT was created to take the data type passed to the macro and combine it with the sort_ string to form a valid function call that is appropriate for the data type being sorted. Thus, the string sort(int)(ip); translates into sort_int(ip); After being run through the preprocessor. 21. What is slicing? ANS: Slicing means that the data added by a subclass are discarded when an object of the subclass is passed or returned by value or from a function expecting a base class object. Explanation: Consider the following class declaration: class base
{ ... base& operator =(const base&); base (const base&); } void fun( ) { base e=m; e=m; } As base copy functions don't know anything about the derived only the base part of the derived is copied. This is commonly referred to as slicing. One reason to pass objects of classes in a hierarchy is to avoid slicing. Other reasons are to preserve polymorphic behavior and to gain efficiency. 22. Array is an lvalue or not? ANS: An lvalue was defined as an expression to which a value can be assigned. Is an array an expression to which we can assign a value? The answer to this question is no, because an array is composed of several separate array elements that cannot be treated as a whole for assignment purposes. The following statement is therefore illegal: int x[5], y[5]; x = y; Additionally, you might want to copy the whole array all at once. You can do so using a library function such as the memcpy() function, which is shown here: memcpy(x, y, sizeof(y)); It should be noted here that unlike arrays, structures can be treated as lvalues. Thus, you can assign one structure variable to another structure variable of the same type, such as this: typedef struct t_name {
char last_name[25]; char first_name[15]; char middle_init[2]; } NAME; ... NAME my_name, your_name; ... your_name = my_name; 23. What is a smart pointer? ANS: A smart pointer is an object that acts, looks and feels like a normal pointer but offers more functionality. In C++, smart pointers are implemented as template classes that encapsulate a pointer and override standard pointer operators. They have a number of advantages over regular pointers. They are guaranteed to be initialized as either null pointers or pointers to a heap object. Indirection through a null pointer is checked. No delete is ever necessary. Objects are automatically freed when the last pointer to them has gone away. One significant problem with these smart pointers is that unlike regular pointers, they don't respect inheritance. Smart pointers are unattractive for polymorphic code. Given below is an example for the implementation of smart pointers. Example: template class smart_pointer { public: smart_pointer(); // makes a null pointer smart_pointer(const X& x) // makes pointer to copy of x X& operator *( ); const X& operator*( ) const; X* operator->() const; smart_pointer(const smart_pointer &); const smart_pointer & operator =(const smart_pointer&);
~smart_pointer(); private: //... }; This class implements a smart pointer to an object of type X. The object itself is located on the heap. Here is how to use it: smart_pointer p= employee("Harris",1333); Like other overloaded operators, p will behave like a regular pointer, cout<<*p; p->raise_salary(0.5); 24. How do I know how many elements an array can hold? ANS: The amount of memory an array can consume depends on the data type of an array. In DOS environment, the amount of memory an array can consume depends on the current memory model (i.e. Tiny, Small, Large, Huge, etc.). In general an array cannot consume more than 64 kb. Consider following program, which shows the maximum number of elements an array of type int, float and char can have in case of Small memory model. main( ) { int i[32767] ; float f[16383] ; char s[65535] ; } 25. How do I write code that reads data at memory location specified by segment and offset? ANS: Use peekb ( ) function. This function returns byte(s) read from specific segment and offset locations in memory. The following program illustrates use of this function. In this program from VDU memory we have read characters and its attributes of the first row. The information stored in file is then further read and displayed using peek( ) function. #include <stdio.h> #include <dos.h>
main( ) { char far *scr = 0xB8000000 ; FILE *fp ; int offset ; char ch ; if ( ( fp = fopen ( "scr.dat", "wb" ) ) == NULL ) { printf ( "\nUnable to open file" ) ; exit( ) ; } // reads and writes to file for ( offset = 0 ; offset < 160 ; offset++ ) fprintf ( fp, "%c", peekb ( scr, offset ) ) ; fclose ( fp ) ; if ( ( fp = fopen ( "scr.dat", "rb" ) ) == NULL ) { printf ( "\nUnable to open file" ) ; exit( ) ; } // reads and writes to file for ( offset = 0 ; offset < 160 ; offset++ ) { fscanf ( fp, "%c", &ch ) ; printf ( "%c", ch ) ; } fclose ( fp ) ; } 26. What is an action class? ANS: The simplest and most obvious way to specify an action in C++ is to write a function. However, if the action has to be delayed, has to be transmitted 'elsewhere' before being performed, requires its own data, has to be combined with other actions etc. then it often becomes
attractive to provide the action in the form of a class that can execute the desired action and provide other services as well. Manipulators used with iostreams are an obvious example. Explanation: A common form of action class is a simple class containing just one virtual function. class Action { public: virtual int do_it( int )=0; virtual ~Action( ); } Given this, we can write code say a member that can store actions for later execution without using pointers to functions, without knowing anything about the objects involved, and without even knowing the name of the operation it invokes. For example: class write_file : public Action { File& f; public: int do_it(int) { return fwrite( ).suceed( ); } }; class error_message: public Action { response_box db(message.cstr( ),"Continue","Cancel","Retry"); switch (db.getresponse( )) { case 0: return 0;
case 1: abort(); case 2: current_operation.redo( );return 1; } }; A user of the Action class will be completely isolated from any knowledge of derived classes such as write_file and error_message. 27. What is conversion operator? ANS: Class can have a public method for specific data type conversions. for example: class Boo { double value; public: Boo(int i ) operator double() { return value; } }; Boo BooObject; double i = BooObject; // assigning object to variable i of type double. Now conversion operator gets called to assign the value. 28. Explain the ISA and HASA class relationships. How would you implement each in a class design? ANS: A specialized class "is" a specialization of another class and, therefore, has the ISA relationship with the other class. This relationship is best implemented by embedding an object of the Salary class in the Employee class. 29. What is diff between malloc ()/free () and new/delete? ANS: Malloc allocates memory for object in heap but doesn't invoke object's constructor to initialize the object. New allocates memory and also invokes constructor to initialize the
object. malloc() and free() do not support object semantics Does not construct and destruct objects string * ptr = (string *)(malloc (sizeof(string))) Are not safe Does not calculate the size of the objects that it construct Returns a pointer to void int *p = (int *) (malloc(sizeof(int))); int *p = new int; Are not extensible new and delete can be overloaded in a class "Delete" first calls the object's termination routine (i.e. its destructor) and then releases the space the object occupied on the heap memory. If an array of objects was created using new, then delete must be told that it is dealing with an array by preceding the name with an empty []:Int_t *my_ints = new Int_t[10]; ... delete []my_ints; 30. What is difference between template and macro? ANS: There is no way for the compiler to verify that the macro parameters are of compatible types. The macro is expanded without any special type checking. If macro parameter has a postincremented variable (like C++), the increment is performed two times. Because macros are expanded by the preprocessor, compiler error messages will refer to the expanded macro, rather than the macro definition itself. Also, the macro will show up in expanded form during debugging. for example: Macro: #define min(i, j) (i < j ? i : j) template: template<class T> T min (T i, T j) { return i < j ? i : j; }
31. What is placement new? ANS: When you want to call a constructor directly, you use the placement new. Sometimes you have some raw memory thats already been allocated, and you need to construct an object in the memory you have. Operator news special version placement new allows you to do it. class Widget { public : Widget(int widgetsize); Widget* Construct_widget_int_buffer(void *buffer,int widgetsize) { return new(buffer) Widget(widgetsize); } }; This function returns a pointer to a Widget object thats constructed within the buffer passed to the function. Such a function might be useful for applications using shared memory or memory- mapped I/O, because objects in such applications must be placed at specific addresses or in memory allocated by special routines. 32. Tell how to check whether a linked list is circular? ANS: Create two pointers, each set to the start of the list. Update each as follows: while (pointer1) { pointer1 = pointer1->next; pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next; if (pointer1 == pointer2) ??????{
print (\circular\n\); }} 33. What is an Iterator class? ANS: A class that is used to traverse through the objects maintained by a container class. There are five categories of iterators: input iterators, output iterators, forward iterators, bidirectional iterators, random access. An iterator is an entity that gives access to the contents of a container object without violating encapsulation constraints. Access to the contents is granted on a one-at-a-time basis in order. The order can be storage order (as in lists and queues) or some arbitrary order (as in array indices) or according to some ordering relation (as in an ordered binary tree). The iterator is a construct, which provides an interface that, when called, yields either the next element in the container, or some value denoting the fact that there are no more elements to examine. Iterators hide the details of access to and update of the elements of a container class. The simplest and safest iterators are those that permit read-only access to the contents of a container class. The following code fragment shows how an iterator might appear in code: cont_iter:=new cont_iterator(); x:=cont_iter.next(); while x/=none do ... s(x); ... x:=cont_iter.next(); end;
In this example, cont_iter is the name of the iterator. It is created on the first line by instantiation of cont_iterator class, an iterator class defined to iterate over some container class, cont. Successive elements from the container are carried to x. The loop terminates when x is bound to some empty value. (Here, none)In the middle of the loop, there is s(x) an operation on x, the current element from the container. The next element of the container is obtained at the bottom of the loop. 34. What are proxy objects? ANS: Objects that stand for other objects are called proxy objects or surrogates. Example: template class Array2D { public: class Array1D { public: T& operator[] (int index); const T& operator[] (int index) const; ... }; Array1D operator[] (int index); const Array1D operator[] (int index) const; ... }; The following then becomes legal: Array2Ddata(10,20); ........ cout<
Here data [3] yields an Array1D object and the operator [] invocation on that object yields the float in position (3, 6) of the original two dimensional array. Clients of the Array2D class need not be aware of the presence of the Array1D class. Objects of this latter class stand for one-dimensional array objects that, conceptually, do not exist for clients of Array2D. Such clients program as if they were using real, live, two-dimensional arrays. Each Array1D object stands for a onedimensional array that is absent from a conceptual model used by the clients of Array2D. In the above example, Array1D is a proxy class. Its instances stand for one-dimensional arrays that, conceptually, do not exist. 35. What is inheritance? ANS: Inheritance allows one class to reuse the state and behavior of another class. The derived class inherits the properties and method implementations of the base class and extends it by overriding methods and adding additional properties and methods. 36. What is problem with Runtime type identification? ANS: The run time type identification comes at a cost of performance penalty. Compiler maintains the class. 37. What happens when you make call "delete this;"? ANS: The code has two built-in pitfalls. First, if it executes in a member function for an extern, static, or automatic object, the program will probably crash as soon as the delete statement executes. There is no portable way for an object to tell that it was instantiated on the heap, so the class cannot assert that its object is properly instantiated. Second, when an object commits suicide this way, the using program might not know about its demise. As far as the instantiating program is concerned, the object remains in scope and continues to exist even though the object did itself in. Subsequent dereferencing of the pointer can and usually does lead to disaster.
You should never do this. Since compiler does not know whether the object was allocated on the stack or on the heap, "delete this" could cause a disaster. 38. What is Overriding? ANS: To override a method, a subclass of the class that originally declared the method must declare a method with the same name, return type (or a subclass of that return type), and same parameter list. The definition of the method overriding is: Must have same method name. Must have same data type. Must have same argument list. Overriding a method means that replacing method functionality in child class. To imply overriding functionality we need parent and child classes. In the child class you define the same method signature as one defined in the parent class. 39. What is the difference between new/delete and malloc/free? ANS: Malloc/free do not know about constructors and destructors. New and delete create and destroy objects, while malloc and free allocate and deallocate memory. 40. What is difference between new and malloc? ANS: Both malloc and new functions are used for dynamic memory allocations and the basic difference is: malloc requires a special "typecasting" when it allocates memory for e.g. if the pointer used is the char pointer then after the processor allocates memory then this allocated memory needs to be typecasted to char pointer i.e. (char*).but new does not requires any typecasting. Also, free is the keyword used to free the memory while using malloc and delete the keyword to free memory while using new, otherwise this will lead the memory leak.

Mindtree Sample Technical Placement Paper

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Mindtree Sample Technical Placement Paper

Загружено:

Авторское право:

Доступные форматы

Visit www.latestoffcampus.com for placement papers, interview tips & job updates. Toget freeupdates tomail http://groups.google.

com/group/latestoffcampus/subscribeLive updates on Facebook @ www.facebook.com/LatestOffCampus

Mindtree Technical Latest Sample Placement Paper

Вам также может понравиться