Index of Question Papers

  [Paper1][Paper2][]   

 

SASKEN June 2003

Off Campus Written Test conducted in 3 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
--------------------------------------------------------------     
Freshers world.com

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;
}                                                                                                    
Freshersworld.com
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';
}                                                                                                     
Freshersworld.com
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}
}                                                                                                    
Freshersworld.com
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.

     Freshersworld.com

| INTERVIEW TIPS | RESUME TIPS | GROUP DISCUSSION | COOL TESTS | HOT JOBS |                  

Home | Our Services | Careers | About Us  | Sign Up | President's Note 

 Copyright © 2003 Freshersworld.com, All rights reserved.