Forums.Sureshkumar.net : A Perfect Place to Share Knowledge         Blogs     Games    Magazines    

"Sharing knowledge does not lessen your store, often it gets you more. Sharing plays a key role in relationships and bonding, happens in small steps and is assisted through community membership."

Go Back   SURESHKUMAR.NET FORUMS > FRESH JOB SEEKERS > Fresher Resources > Placement Papers > BIRLA SOFT Placement Papers
Register FAQ Members List Calendar Games Blogs Search Today's Posts Mark Forums Read

BIRLA SOFT Placement Papers BIRLA SOFT profile pattern , BIRLA SOFT Latest placement papers and Updated BIRLA SOFT 2006 2007 placement papers . If you have attended recent test of BIRLA SOFT , kindly post the model paper in this forum.

   

Reply
 
LinkBack Thread Tools Rate Thread Display Modes
Old 03-02-07, 07:01 PM   #1 (permalink)
Super Moderator
 
sridhar's Avatar
 
Join Date: Feb 2006
Age: 25
Posts: 4,551
Thanks: 25
Thanked 345 Times in 218 Posts
Thanks: 25
Thanked 345 Times in 218 Posts
Rep Power: 0 sridhar has much to be proud of sridhar has much to be proud of sridhar has much to be proud of sridhar has much to be proud of sridhar has much to be proud of sridhar has much to be proud of sridhar has much to be proud of sridhar has much to be proud of sridhar has much to be proud of sridhar has much to be proud of sridhar has much to be proud of
BirlaSoft 2006 placement paper

BirlaSoft 2006 placement paper

Birla Soft 2006 placement paper

1. Select a,b,c,d from vtable where b>2 and c<4

Assuming you will execute the above query often ,changing only the values in the where clause ,what could you do to improve efficiency ?

Create a database stored procedure with parameters to execute this statement

Create an index on columns a&b

Create a temporary table that contains the data and use triggers to maintain it

Create a trigger that executes this statement and execute the trigger

2. Modern RDBMS’s perfom the following the following functionc except ______________.

Force column values in one table to match any of the values in a column of another table

Automatically replicate data on another server

Automatically create new indexes based on query history

Prevent unauthorized users from accessing data at the firls level

3. Which is not the characteristics of a view ?

Consumes Disk space for data

Multiple tables

Multiple rows

Updateable

4. RDBMS triggers are typically bound to a _____________and one or more _____________

Table, SQL statement types

SQL statement type, user

Column, rows

User, tables

5. What relationship is resolved by an “intersecting” or “associative” entity ?

Recursive

Mandatory one to one

Many to Many

One to One

6. With every use of memory allocation function should be used to release allocated memory which is no longer needed ?

dropmem()

dealloc()

release()

free()

7. Make a copy of file “upper” in the directory two levels up .

jump –2 upper

cp upper ../..

cp upper –2/

None of the above

Set2

some of the questions

1. class Word

{

public:

Word(const char*,int = 0);

};

Referring to the sample code above what is the minimum number of arguments required to call the constructor ?

a) 0

b) 1

c) 2

d) 3

2. Which one of the following represents a correct and safe declaration of NULL ?

a) typedef((void *)0) NULL;

b) typedef NULL(char *)0;

c) #define NULL((void *0)

d) #define NULL((char*)0)

3. #include

Referring to the sample code above ,which of the following could you use to make the standars

I/O Stream classes accessible without requiring the scope resolution operator ?

a) using namespace std::iostream

b) using namespace std;

c) using namespace iostream ;

d) using iostream;



4. Which one of the following statements allocates enough space to hold an array of 10 integers

that are initialized to 0 ?

a) int *ptr = (int *) calloc(10,sizeof(int));

b) int *ptr = (int *) alloc( 10*sizeof(int));

c) int *ptr = (int *) malloc( 10*sizeof(int));

d) int *ptr = (int *)calloc(10*sizeof(int));

5. What function will read a specified number of elements from a file ?

a) fread()

b) readfile()

c) fileread()

d) gets()

6. What is the largest value an integer can hold in a Standard C compiler ?

a) 32767

b) 65536

c) 2147483647

d) INT_MAX

7. With every use of memory allocation function should be used to release allocated memory

which is no longer needed ?

a) dropmem()

b) dealloc()

c) release()

d) free()

8. int a=1;
int ab=4;

int main()

{

int b=3,a=2;

printf("%i*/%i*/%*/i",a,b,ab);

}

Aptitude section

1. A Question like A is engg. B is doctor C is artist etc then few condition related to them you have give answer to 4 or 5 qs on these conditions.

2. Same as above with different data and conditions. suggest you must go for these questions coz in 3 or

4 mins you can answer 7 or 8 qs

3. About 4 to 5 questions on arranging 4 sentences to form a paragraph.

4. If father is three times as old as son. 5 years ago he was 4 times age of his son what is son age.
sridhar is offline  
Digg this Post!Add Post to del.icio.usBookmark Post in TechnoratiFurl this Post!
Reply With Quote
Reply



Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
 
Thread Tools
Display Modes Rate This Thread
Rate This Thread:

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is On
Trackbacks are On
Pingbacks are On
Refbacks are On

Similar Threads
Thread Thread Starter Forum Replies Last Post
INFOSYS 2006 PLACEMENT PAPERS sridhar Companies Info & Recruitment Process 2 14-04-07 03:22 PM
Accenture 2006 placement paper sridhar ACCENTURE Placement Papers 0 03-02-07 05:05 PM
All Big MNCs Latest 2006 Placement papers sridhar Companies Info & Recruitment Process 1 24-11-06 06:54 PM
ACCENTURE 2006 PLACEMENT PAPERS sridhar Companies Info & Recruitment Process 1 22-10-06 01:29 PM
CTS 2006 PLACEMENT PAPERS sridhar Companies Info & Recruitment Process 0 09-10-06 06:24 PM


All times are GMT +6.5. The time now is 12:28 PM.





Search Engine Optimization by vBSEO 3.1.0