Home » Placement Papers »Sasken »Sasken Placement Paper
Sasken Placement Paper
SASKEN COMMUNICATION
INDIA
The questions were like this.
------------------------------
The text consists of two parts
1) C test
2) CSE01 Test
Duration: 1hr
---------------------------------------------------------------
1) C test -10 questions- Some questions were as follows, remember only a
few.
a) What is the parameter passing mechanism to Macros Called?
b) void func(int x,int y)
{
x=3;
y=2;
}
main()
{
int i;
func(i,i);
print(i);
}
If the output must be 2 what is the parameter passing mechanism called?
c) which of the following code will swap the two numbers? -3 choices was
given
d) which of the following is illegal for the program?
main()
{
char const *p='p';
} 1)p++ 2) *p++ 3)(*p)++ 4) all
e) what is the output of the following program
void print(int ** arr)
{
print("0 %f, 1 %f, 2 %f ",arr[0][0],arr[0][1],arr[0][2]);
}
main()
{
int a[][]={ {1,2,3},
{4,5,6}
} int ** arr=a;
print(arr);
arr++;
print(arr);
}
f) which of the following code swaps the two numbers.
- 4 choices were given
g) if the string " this is a " is present in the code of a function such as
'void func(void)' where will the variable stored in the memory.
a) in the stack b) heap c) code or text segment as per implementation
d)
created when func is called, stored in function stack space and destroyed as
it goes out .
2) CSE01-15 questions
In this section there was question from LD-gates, JK flip flop, sampling
rate
and few other then there was a few from OS - don't remember the questions.
INTERVIEW
In the interview, they asked about Stacks, Queues, Linked lists, Binary
Trees.
Few questions I remember are:
1) If u have a linked list library, how do u design stack and queue using
it;
write pseudocode.
2) What are static variables and functions?
3) Write code in C to count the number of 1s in a character (1byte).
4) What is pre-order, post-order, in-order; write code to print post-order.
5) Can u construct a binary tree given its inorder and postorder details. Is
it neccessary or sufficient to construct tree. Asked an example to do in
both ways.
6) If recursion is not used to print post order, what other data structure u
use
(ans: Stack).
7)Can u use stack always in place of recursion?
(ans: Yes)
8) What are meta characters?
9) Write a piece of code to insert a node in a linked list.
10) About malloc.
11) About Operating System - Semaphores
12) About Computability (eg:- finding infinite loop), Complexity of
algorithms
13) What does compiler and assembler do?
They asked grep command in Linux. How do u search '\n', using grep, in a
file.
They may ask some other commands if u say u r familiar and recently been
using linux.
About Networks? OSI reference model.
what does transport layer do?
TCP belongs to which layer?
IP belongs to which layer?
Where is error correction done?
What is a connection oriented/ connection less transmission?
What is meant by reliable transmission protocol? why is it called so?
What is flow control and where it is done?
About ur project?
Asked me expalin about the project in brief.
If u don't know anything, say it sincerely. U cannot bluff them. I too spoke
to them sincerely.
They were cool. U need not get tensed. They won't attack you. Just they want
to know ur hold about the subject.
| 
