.jpg)
Date: 6 April 2013 Venue: Pune
Pattern of Written Test
15 Computer Science Questions
15 C Questions
40 IQ Test(Reasoning,anlaytical)
for 90 minutes
Online coding round 3 programs for 90 minutes
1) A input array and number was given.And ques was to find the total no of perfect sum of array elements which matched the number
eg {2,4,8,10} num=12
output is "2" as (10,2) and (8,4) gives 12.
Technical Interview
BE Project
Initializer List in C++
Structure padding in C
decimal to binary conversion in c
STL in C++
Storage classes in C
user space and kernel space in linux
big endian to little endian conversion
need of function pointers
virtual functions in c++
need of friend functions
Access specifiers
different scheduling algorithms in os
Main emphasis is on C,C++ and OS concepts.
Pattern for calsoft (work on memory storage, networking, cloud)
1) Aptitude paper : Having 3 sections and no negative marking (time : 90 min)
- Computer Fundamental (15 Q) having q on memory allocation, sort complexity, etc.
- C questions (15 Q) having q on pass by ref and pass by value, string operation, result after execution of loop, etc.
- General aptitude (40 Q) having missing letter in sequence, if dies are rotated then they will be same or different, ship the given word, form word by prefixing or suffixing given word, form two meaning full word starting from c and o(like Come On), predict the next diagram in sequence(easiest q), odd man out(which is not a bird), syllogisms, etc
2) Coding round : Having 3 coding problems in c (time : 90 min). This is online test .Some sample q as
- Find next prime no.(if we input 35 then output is 37)
- Find the no such that(if input is 2,1,10) then 2 means no of inputs and output is(1,190) it is multiple of that no and addition is also that no.(Input and outputs are in char string)
- Program on Permutation and Combination.
According to these two rounds elimination is carried out. It is mostly based on C, C++, OS, Data structure.
3) Interview(1 level)
- In C, Macro concepts, pointer to an array, pointers in deep, pointer to pointers, storage allocation to pointers and variables, dynamic memory allocation of 2d array, difference between structure and union , why to use unions, malloc and calloc , structure padding, finding no of 1 from given integer bits(program), Linked list inserting node(program)
4) Interview(2 level)
- What is STL, Paging and segmentation, scheduling, memory fragmentation, Kernel and user space, threads, etc.
- Finding duplicate element from linked list, about global static variable, compiler phases, size of long and double , calloc use ,linked list, etc.