Sasken

OFF Campus Written Test conducted at Bangalore

The test comprises of 2 sections:
1. Technical ( C ) & Technical Subject- 60 mins, 60 questions
2. Logical Reasoning.. - 30 mins,17 questions....

==> Questions in C were mostly from "pointers in c" and "test ur C skills" by Yeshwant Kanetkar... C questions based on command line arguments, data structure ( BST, tree traversals). All the questions were like " what is the output of the following program segment" and in many questions 3rd and 4th choices were (c) compilation error and (d) compilation, warning, runtime error.... Heard they are asking abt- ptr, string, arr, preprocessor, data structures etc.. C test was pretty ok pass by value, pass by reference etc. questions were asked The general test was pretty tough, they ask u fourier transforms,harmonics,Barkhuasen criterion,virtual memory,Whether FIFO is better than LRU etc. 4 questions were from fourier transforms the duration was 60 mins and no negative marking

C basics 10 questions ,very easy.Given a program and asked the output-type questons.from pointers 3-4 questions are there. 2)reg subject:very very easy:some from digital(on nand gates. Jk flip flop),from Information theory and coding,some from Micro processors.

In Logical Reasoning all the 17 questions were paragraphs (argument) of 5 to 6 sentences...five sentences (choices) will be given below and questions were asked like " which of the five if true will weaken or supports the argument above .." :- R. S. Agrawal LR is sufficient

SASKEN PAPER HELD ON 9th AUG at 2:30pm
--------------------------------------------------------------

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.

Next Paper
NOTE : Answer May Not be Accurate So Get An Idea of Questions.

What is the value of X after this execution
x = 0;
begin
parbegin
y = x;
x = x+1;
parend
parbegin
z =x;
x = z+1;
parend
end

a:1
b:0
c:2
d:1 or 2

2. Comparision of LRU and FIFO
a. FIFO IS always better
b. FIFO is always worst
c. FIFO is sometimes better
d. NOthing can be said.
ANS :D

3. How many minimum no of NAND GATES ARE required for construction of X-OR gate
6 7 5 8
ANS : 5 (but the correct answer is 4 ) if 4 is present that is correct answer otherwise 5

4. If each counter has time delay of 15 n sec. Then what is the max time to change the state of 4 bit
synchronus counter
a. 60
b.15
c. 120
d. none
ans : 15

5. There is ADC of freequency 1 MHz. How much time it will take to convert a message stream of 6 bit
ans : 6 Micro Sec

6. What is Baukshna's criteria for sustaining freequency.
some fk is given that( Iam not clear)
fk > 1
fk <1 fk ="0">
none

7. which of the following is wrong:
ans : WCW is a context free language.where w is word formed by sequence of alphabets.

8. find odd man out
LISP -Functional language
PROLOG - logic programming
C - imperative
ans : c- imperative. Iam not sure ask ur brother.
Fourier analysis 4 questions.

C

===============================

How macros are called
a. Call by name
b. Call by refernce
c. Call by value
ans : call by name.

2. fun( int x, int y){
x =3;
y =2;
}
main(){
int i;
fun( i,i);
printf("%d",i);
}

if the value is 2 then the calling mechanism
a. Call by name
b. Call by refernce
c. Call by value
ans : call by reference

3. fun(int i){
static int j =0;
x = x+j; j++
return ;
}
main(){
int x = 2;
I had not remembered the question exactly. but the essence is J will retain the value between successive function calls.

4.
cout <<>
Syntax error.

5.
main(){
int z=10,x=6,y=7;
( z ? x:y) =8;
}
ans : the statement does nothing. all values are same.

6. "This is a sting.."
It is string in a function. Where it will be stored.
a. stack
b.global heap
c. Data ro text segment.
d. none
c. Data or Text segment

7. One question i doent remember that Double pointer is given
for that my answer is : Segmentation error

8.fun( int x, int y){
int temp;
temp =x;
x =y;
y = temp;
}

main(){
int i =3,j =4;
fun(i,j);
printf("%d,%d",i,j);
}
ans : 3 4 (that means the values doesnot change)

}
}

) C test -10 questions- Some questions were as follows

I 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 swapps 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 .


SASKEN PAPER HELD ON 16th JULY at 2:30pm

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.

While(Fresher)
printf("ALL THE BEST");



SASKEN paper on 20th september(shreds,kochi)

C questions

1.Consider the following declaration:-
char const *p = 'd';
Which of the following is not a permissible operation
(a) *p++
(b) ++p
(c) (*p)++
(d) All
2.What is the output of the following code:-
void print_arr(float **p)
{
printf(" 0 %f 1 %f 2 %f\n",p[0][0],p[0][1],p[0][2]);
}
void main()
{
float arr[2][3] = {{0,1,2},{3,4,5}};
float **fl_arr;
fl_arr = (float *)arr;
print_arr(fl_arr);
fl_arr++;
print_arr(fl_arr);
}
(a)
(d)segmentation fault
3.What is the output of the following code:-
#define putchar (c) printf("%c",c)
void main()
{
char s='c';
putchar (s);
}
(a) c
(b) 99
(c) Compilation error
(d) Execution error
4.What is the output of the following code:-
void main()
{
printf("%d",printf("ABC\\"));
}
(a) ABC\\
(b) 1
(c) ABC\4
(d) ABC\3
5.What is the output of the following code:-
int compute(int n)
{
if(n>0)
{
n=compute(n-3)+compute(n-1);
return(n);
}
return(1);
}
void main()
{
printf("%d",compute(5));
}
(a) 6
(b) 9
(c) 12
(d) 13
6.What is the output of the following code:-
void main()
{
int i;
for(i=0;i<3;i++)>
{
int i=100;
i--;
printf("%d..",i);
}
}
(a0..1..2..
(b)99..98..97..
(c)100..100..100..
(d)99..99..99..
7.What is the output of the following code:-
void main()
{
int a[]={9,4,1,7,5};
int *p;
p=&a[3];
printf("%d",p[-1]);
}
(a)6
(b)1
(c)7
(d)Error

8.What is the output of the following code:-
void main()
{
int a[]={10,20,30,40,50};
int *p;
p= (int*)((char *)a + sizeof(int));
printf("%d",*p);
}
(a)10
(b)20
(c)30
(d)40
9.Which code will run faster
for(i=0;i<100;i++)>
for(j=0;j<10;j++)>
a[i][j]=0;
OR
for(j=0;j<10;j++)>
for(i=0;i<100;i++)>
a[i][j]=0;
(a)First code
(b)Second code
(c)Same
(d)Compiler and hardware dependent
Answers(Only those which are sure)
1.(c)
3.(c)
4.(c)
5.(b)
6.(d)
7.(b)
8.(b)
Aptitude
1.How many 2 digit numbers are there which have 8 as
the unit number in it's square.
(a)3
(b)None
(c)2
(d)1
2. B is 8km East of A. C is 6km North of B. D is 12km
East of C. E is 16km North of D.
What is the distance b/w A and E.
(a)20km
(b)22km
(c)18km
(d)30km
3. x+y = z
Then
(a)...
(b)y(c)...
4. 2Then which is the greatest
(a) (x^2)y
(b) 5xy
(c) x(y^2)
(d) 5(x^2)y/12
5. A is taller than B, D is taller than D, D is
shorter than E.Then which of the following is correct.
(a) C is taller than E
(b) A is taller than C
(c) D is shorter than A
(d) B is shorter than C
6.A small passage was given and 4 options which
summarizes it was given.The best was to be chosen.
7.Another passage was given and 4 inference was given
and correct was to be chosen.This one is very easy.
8.Which of the following is a parellogram:-
(a)130,50,130,50(angle in deg)
(b)120,30,130,20
(c)90,90,90,90
(d)a & c
9. In the following series (an - 1)^2, 1 is the first
term.Which are the next three
(a)1,3,4
(b)0,3,6
(c)0,1,2
(d)0,1,0
Answers

1.(b)
2.(d)
3.(b)
4.(c)
5.(c)
8.(d)
9.(d)
Computer science

1.Deadlock occur when
(a)Some resources are held up by some process.
(b)...
(c)...
(d)None of these
2. A prefix __expression can be equal to a postfix
__expression reversed only if
(a)It is left associative
(b)It is commutative
(c)It is right associative
3.How many lines will be printed in the following
Pascal pgm
[I don't remember the Pascal version,so I am giving C
version]
void print(int n)
{
if(n>0)
{
print(n-1);
printf("%d",n);//println(n) in Pascal version.
print(n-1);
}
}
(a)3
(b)7
(c)15
(d)31
4.Maximum number of nodes in a tree with n levels.
(a)2^(n-1)
(b)(2^n)-1
(c)2^(n-1) - 1
5.Complete graphwith n nodes have
(a)n-1 edges
(b)n(n-1)/2

6.If d is the degree of a node in a graph and n is
number of vertices then number of edges in that graph
is
(a)Edi^n
(b)0.25Edi
(c)0.5Edi
7.A grammar was given and 4 strings was given and the
one which was not possible was to be chosen.
8.A problem related to ethernet in which a station
sending a frame is of p probablity.There are m
stations to send pckts.4 option was given.It was a
mathematical kind of question related to probablity.
9.Which of the following layer in the OSI model does
error handling
(a)Data link
(b)Network
(c)Transport
(d) a & c
10.A network problem in which Data rate,Propagation
delay,and distance was given and it was to find how
many packets will be in the line.
Choices where
(a)5000
(b)Not possible to find with given data
(c)1000
Answers(Not very sure about all the answers)

1.(d)
2.(b)
3.(c)
4.(b)
6.(c)
9.(d)
10.(a)
Interview [For CS students]

There is Tech as well as HR interview. Tech interview
is the important one.
Tech interview questions

They will ask about the project.They will ask general
questions about it and most probably will not go into
the implementation part of it.So one must have a
general idea about the project done.
Interview is mainly based on Data Structures.Some
questions are as follows:-
- What is a tree,its application,order for
insertion,deletion and traversal with worst case
analysis.
- What is a graph,its application.
- Height of a tree
- Balanced tree and how to balance a tree
- Minimum Spanning Tree
- Dijikstra's, Prim algorithms
- Define a structure for a linked list.
- Binary search and its analysis
- Heap sort and its analysis
- What is a heap and its application
- Cache and its working
- Memory(IO mapped)
- Recursive fns and types, its adv and disadv.
- Compiler(grammar)
*****C debugging questions like
(1)What is the problem with the following code
int * f(int a)
{
int i;
i=a;
return(&i);
}
Ans-> We can't return address of auto variable as it
is allocation is made in stack which is deallocated
when the function returns.
(2)
a.h b.c c.c d.c
int i=0 #include"a.h" #include"a.h" extern int
i;void main{.....}
| | |
b.o c.o d.o
Compilation Phase
Linked to get exe.
Will there be any problem in any phase.If yes then
where and what?
In linking phase as there will be multiple declaration
of i.
*****You will be told to write some code like
(1)To find string length by using recursive function.
(2)To find fibonaci series by using recursive
function.
(3)To write code for malloc so that allocation may be
made fastly.
(4)Write a fn prototype which return a pointer which
points to an array of 10 ints.
HR Interview
------------
- Introduce yourself
- Why should we take you
- What you know about Sasken and etc.