SASKEN Labs Placement Paper
Paper Type : General - other
Sample 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.
They has conducted Two tests.One test is
C 10 Q for 10 Marks and Other one is in thier
corresponding B.Tech Subjects 15 Q for 15 Marks.For
CSE Students the subjects are Automata Theory Formal
Languages,Data stcures,Discrete Mathematics,Operating
System,Digital Logic Design,Computer Organisation,
Micro Processer and Computer Networks.
C Test------10 Q-10 M
Electives---15 Q-15 M
Duration of these two exams is 1Hr.
C Test
------
1.
What is the output of the Program?
main()
{
int a[10]={1,2,3,4,5,6,7,8,9,10};
int *p=a;
int *q=&a[9];
printf("%d",q-p+1);
}
Ans: 10
2.
main()
{
int i=6;
int *p=&i;
free(p);
printf("%d",i);
}
Options:
a. No Error.
b. Free can't be used for p,
c. Compiler Error.
d. In printf we should use *p instead of i.
Ans: A
3.
What is the output of the Program?
main()
{
int i=5;
i=!i>3;
printf("%d",i);
}
Ans: 0
4.
What is the output of the Program?
main()
{
int a[10];
3[a]=10;
printf("%d",*(a+3));
}
Ans: 10
5.
int (*p[10]) ();
In above declaration what type of variable is P?
Ans: P is array of pointers that each points to a function
that takes no arguments and returns
an int.
6.
What is the output of the Program?
struct emp
{
int a=25;
char b[20]="tgk";
};
main
{
emp e;
e.a=2;
strcpy(e.b,"tellapalli");
printf("%d %s",e.a,e.b);
}
Ans: Compile Error.
7.
What is the output of the Program?
main()
{
int a=5;
const int *p=&a;
*p=200;
printf("%d",*p);
}
Ans: Compile Error.
8.
What is the output of the Program?
#define SQ(x) x*x
main()
{
int a=SQ(2+1);
printf("%d",a);
}
Ans: 5.
9.
What is the output of the Program?
main()
{
struct t
{
int i;
} a,*p=&a;
p->i=10;
printf("%d",(*p).i);
}
Ans: 10
10.
This program will be Compiled? [Yes/No]
zzz.c file
----------
/* This is zzz.c file*/
/*printf("tellapalli");*/
abc.c file
----------
main()
{
#include"zzz.c"
printf("Tellapalli");
}
Ans: Yes
CSEA01 Test
-----------
I haven't remembered the Qs.I has forgotten Qs.
They has given 5Q in OS,3Q in DM,2Q in ATFL,1Q in DLD,
1Q in CO,1Q in MP 1Q in DS,1Q in CN.
10 ques of C
10 ques of aptitude
10 ques of comp sc.
i m sendin the ques of comp sc whch might help u
COMP SC.
1. IN BINARY TREE IF PARENT HAS INDEX i then its left and
right child
occurs at:
ans (a) 2i and 2i+1
2. 1 prog is given n scope is asked
ans (b) static scope (probably)
3. complete graph has
ans (b) n vertices and n(n-1)/2 edges
4. page fault is said 2 occur when:
4 choices r given probably (c)
5. probability that a frame is recieved with an error is P
in a system. probability that the first frame to b recieved
with an error is after the first N frame is
(a) (1-P)*(p raised to power N)
(b) [(1-P) raised to power (N-1)]
(c) p raised to power N
(d) combination of N taken P at a time
6. statistical time division multiplexing provides:
(a) statistics of tdm signal
(b) provision to multiplex analog signal
(c) improved time sharing efficiency
(d) static routing b/w nodes
ans (b) check
7. main advantage of AMI coding is
(a) easy clock recovery
(b) easy carrier recovery
(c) reduced bandwidth req
(d) reduced error rate
8. recursive-descent parser is a
(a) top-down parser
(b) bottom-up parser
(c) shift-reduce parser
(d) LR parser
9. min. no. of NAND gates reqd to implement a 2 i/p x-nor
gate
(a) 2
(b) 3
(c) 4
(d) 5
10. mandatory feature of a real time OS is:
(a) priority based preemptive scheduling
(b) high time slicing granularity
(c) run to completion
(d) none of the above
These are the Queston asked in the sasken wirtten held on
19th at 3.00 p.m batch.
The Question paper is of three sections
i ) c (most of the questions) and c++;
ii) Apptitude (R.S agarwal)
iii)basic commputer
Each section has 10 questions and the way they aorganised
was good and timely.
c and c++;
--------------------------------------
1. char buffer[]="susan";
a) individual characters can be changed.
b) buffer[7] is not accesible.
c)none of the above.
which of the above is TRUE;
ans : a)
2.#include<stdio.h>
#include<conio.h>
void main()
{
int ctr=0;
clrscr();
switch(ctr)
{
case 0:
ctr++;
case 1:
ctr++;
default :
ctr++;
};
printf("%d",ctr);
getch();
}
What is the output of the code.
i) ctr=2;
ii) ctr=3;
iii) ctr=1;
iv) compiler error;
Ans : iii)
3.#include<stdio.h>
#include<conio.h>
void main()
{
void fun(int,int);
int i ,j;
i=2,j=3;
fun(i++,j++);
printf("%d%d",i,j);
getch();
}
void fun(int i,int j)
{
i++,j++;
}
Question : what is the output ?
i)i=2,j=3;
ii)i=3,j=4;
iii)i=5,j=6;
iv) compiler error.
Ans : ii)
4)
#include<stdio.h>
#include<conio.h>
void main()
{
int a[20];
clrscr();
*a=(int*)malloc(sizeof(a));
printf("%d",sizeof(a));
getch();
}
5)
#include<stdio.h>
#include<conio.h>
void main()
{
char *s="susan";
clrscr();
printf(s);
getch();
}
i) compiler error;
ii) s;
iii) susan;
iv) 5;
Ans: iii)
6)
i) const * int p;
ii) int const *p;
iii) const int *p;
Question : which of the following is same.
a)i) and ii)
b)i),ii) and iii)
c)ii) and iii)
d)none of the above.
i) (*ptr)++;
ii) *ptr+=1;
iii) *ptr++;
Question: which of the folowing is same.
a)i) and ii)
b)i),ii) and iii)
c)ii) and iii)
d)none of the above.
8)
a)for(int i=0; i<50 ;i++)
for( int j=0; j<100; j++)
a[i][j]=100;
b)for(int i=0; i<100 ;i++)
for( int j=0; j<50; j++)
a[j][i]=100;
Question : Which of the above 2 codes executes quickly.
i) a) is faster than b)
ii) b) is fater than a)
iii) both a) and b) executes for same time.
iv) depends upon the compiler and the hardware used.
Ans: " I think iii)" (check it out)
fun( int x, int y)
{
x =3;
y =2;
}
main()
{
int i;
fun( i,i);
printf("%d",i);
}
Question :if the value is 2 then the calling mechanism is
a. Call by name
b. Call by refernce
c. Call by value
ans : call by reference
|
|
|
|
|