COVANSYS

Written Test Pattern

General Information:
There are 5 parts.
Each part consists of 20 qns.
I think, u have to score atleast 15 from each part.
There is no negative marking. Tick all.
Total time : 1 hour 15 mins.
Try to attend tech part first.
5 parts:

Aptitude [ 15 problem and one reasoning consists of 5 qns]
C/C++ [qns from ptr,str,basics,virtual fn,inheritance, friend fn and all defn]
JAVA or VB [syntax, super , inheritance, thread and concepts]
Unix or Windows 2000 Server.[Unix commands and some OS qns : All r basics]
Oracle/SQL Server [ Some SQL and DBMS concepts]
Atlast u have to write Essay about General think.[Eye wash- No imp. just rule]

Thats it about written test.

Tech. Round

About project [ atleast 10 mins explanation]
c and c++ concepts and examples.
some std qns from OS,Network,DBMS,Data structure.
Apart from all what u put on ur resume.

HR Round

Std hr qns
All the Best.

Wipro Infotech Ltd

Wipinfo has 2 rounds of interviews.

The first round is fully technical. The second round, depending on the members of the board, may be Technical, semi-technical or personal. most of the time in the second round dealing with personal questions.

Technical questions asked in the first round

[1] Tell us about your work in brief.

Ans. Mention first the title, followed by a brief overview of the work, what we plan to achieve, what has been achieved so far, finally the relevance/scope of the work to the related area (i.e. how is it going to be useful).[5-10 mins. depending on interest of the listener.]

[2] Questions related to the work. Ans. Area dependent. [ 10 mins ]

[3] Tell us what you know about DMA and why that is needed?

Ans. As usual, mentioned the wastage of CPU computation power spent in busy-waiting. Told how DMA works.

[4] What are the various types of scheduling algo, what is used by UNIX? Ans. Mentioned Round Robin, First-come-first-served, Shortest-job-first, Earliest-deadline-first, Least-laxity-first, and Priority-based-event-driven. UNIX uses RR with multi-level feedback.

[5] How can you implement SJF in UNIX? My Ans. Usually, SJF means that we know the job-duration in advance. In UNIX where we cannot know that, we have to make assumptions about that based on which we should initially schedule. Periodically however, we have to fine-tune our initial assumptions based on the times taken by various ready jobs, and recompute estimates and change the schedule accordingly.

[6] Different types of subroutine calling conventions? Ans. Call by value, reference, value-result.

[7] Parameter passing sequence used by C? Ans. Rightmost parameter pushed first on stack. Personal questions in the first round 1. What was your overall position in the Univ. in B.E. 4. Anything you want to know about us.

Technical Questions in the second round

[1] What are the current trends and areas of focus in IT. Ans. Talk about emerging trends of S/W Engg and ISO 9000 stuff, mention the proliferation of O-O methodologies and their usefulness in speeding up development process,code re-usability, ease of maintenance, ease of bug-fixing. Thirdly, mentioned the work going on in High-Speed N/w - FDDI, ATM, Fast-Ethernet(100Mbps)

[2] What is a Micro-Kernel architecture. Ans. This is a developing area in OSs where instead of building the kernel as a single monolithic structure starting from scratch, it is built as a set of layers. The micro-kernel provides only the bare-bones like Device-drivers, rudimentary filesystem support etc. on which, depending on the intended area of application of the OS, it can be customized to provide various higher level OS features like Multiprocessing, IPC, etc. Personal Questions in the second round

1. Tell us about yourself, your background.

2. What does your father do currently

.3. Your performance in schooling, B.E. 4. Your +/- points.

5. Why do you think Wipro should take you.

6. What qualities do you have that make you a person suitable for going into the IT industry (a corollary to the previous question).

7. What do your friends opinion about you.

8. When do you think you will complete and be able to join.

9. How can you assure that you will join by that time.

10. Anything you want to know about us. Company:

HCL-HP

Written test:

One GRE type anals. section, and two comp Sc. sections. One Comp Sc.section was problem solving type. Quite easy.

Only question worth mentioning in it was: You are given a stack on which you can do the following: Push X ----push the contents of memory location X on the stack Pop X ----pop the contents of top of stack into mem. loc X AND ----pop top two elements of stack, AND them and push the result onto stack. NOR ----pop top two elements, NOR them and push the result onto stack. Given two data elements at memory locations A and B, obtain A XOR B using the above.

First Interview:-

mostly technical.
a) Asked about my B.E.
b) My preference of posting Remainder of the interview was mostly on OS and C. Nothing on networks. Thus I have this inkling that they frame their questions on the basis of what you specify as your preference of posting and depending on what projects are available there.
c) What architectures, apart from 8085, do you know? --- Nothing very deep and I told them as much.
d) Give the contents of process stack for the execution of a particular C-program they give. The C-program as such is not important. You just have to remember the order in which the return address of any function/procedure call, the parameters, and the local variables are stored on the stack.
e) What events happen when the following command is given? cat /etc/passwd | more ---- Describe how the shell forks the two processes and how the pipe gets created between them. Cross question: How does 'cat' know that its output has to be written into the pipe and not into standard o/p?
f) What are TSR? Terminate but stay resident programs. Then does it mean DOS is a multitasking system? No, TSRs are interrupt driven

h) How are Windows programs different from normal C-programs? Windows programs are event driven. What can be the various types of events? --- See Primer/API bible.

i) Difference between swapping and paging. ---- Swapping is moving entire processes between main memory and hard disk. Paging is moving individual pages of a process.

j) Write a program to list all palindromes in a string. use a stack and some extra storage for remembering previous palindromes.

k) What's the outout? char *cp; int *ip; cp=(char *)0x100; ip=(int *)cp; ip++; cp++; printf("cp = %x ip = %x", cp, ip);
Ans:cp = 0x101 ip = 0x102 ...(why?)

l) What are static variables and functions? There are two files,say, file1 and file2. file1 has a global declaration static int x;file2 has a global declaration int y; What is the difference between the two types of declarations when you link file1 and file2? --- x is local to functions in file1 and cannot be seen by functions in file2. y can be seen by functions in both file1 and file2.

m) How does a debugger set breakpoints in a code you are debugging?

some funda regarding insertion if an interrupt instruction in the code....don't know for sure. This was followed by a shady psychological test. You are given a set of six pictures. Look at each picture and write a story on each. Second interview: a) What did you feel about the ppt? --- wasn't very impressive so gave some shady answer. b) Have you heard of creativity? -- Ya. Have you heard of Bernard Shaw? -- Ya. (Then he rattled off some quote of BS regarding creativity) What do you say? --- I put some shadiest fundaes regarding visionaries and Leonardo da Vinci conceptualising Helicopters in his time!

Cadence design systems(I)Pvt Ltd, Noida.

Area of work :
They develop CAD tools for VLSI design etc. They call it EDA ( Electronic design automation) They expect people with good C knowledge, data structures,compiler knowledge Selection procedure:

1. Written test

a. Logic and aptitude test - 20mts.
b. software and hardware part -30 mts.
Software part - questions on datastres e.g. given inorder exp.and preorder exp. findout the postorder exp., binary tree insertion, stacks - set of operations are given , predict the output..,static variables.. Hardware part - basic questions on digital systems such as K-maps, DMA , floating pt. representation, signed integer representation,cache location etc.

2. Interview Technical Questions asked: For me almost Nil. a)question: what 'lex' does ? Personal Questions asked:

1. Tell me about urself, family background ..
2. Significant achievements in life. ( may be paper publications etc. )
3. Why did u leave ur previous company ( If u were working)
4. What do u expect from a company ?

Siemens Technical Questions asked:

1. Draw the Architecture of Unix? I asked please elaborate He then told Draw the Unix Architecture!

2. Suppose there are two processes communicating via TCP ports One of them on one machine dies. What will happen to the port? If another process is allocated that port will it receive garbage

.
3. What are the various IPC mechanisms? Why is message passing costlier than semaphore?

4. Name a simple scheme to communicate among two processes on a same machine without the pipes, semaphores, shared memory message passing, sockets etc? Hint : Think Simple

5. What are the tables and their relations when two processes access some files ?

Motorola

Technical Questions asked: 1. Give a general algo for converting a m-ary tree to a 2-ary tree.
2. How many links are there in a binary tree of N nodes? Give a proof?
3. What are skew trees? For a tree with 4 nodes draw all possible binary ? Generalise for n nodes how many binary trees can be drawn?
4. Have u used threaded trees anytime in your life time?

NetQuest

1. Assume a long linked list. Some nodes instead of pointing to their next node, point backwards. This is called a corrupted node. Give an algo in C to test whether a list is corrupted or not. No extra space in nodes, in efficient time. less memory. marks a function of time and storage used.
2. A macro to test whether a number is a power of 2.
3. There is a two-dimensional linked list. Each node has a, North, South, West, East pointers. Write fragment of C Code to do some interchanging stuffs. North points to West, West point to South etc, ( A glorified version of reverse of linked list) 4-7.

Questions like these, basically pointer stuffs 8 Assume there are two cubes. U can write one digit (0-9) on each of these sides, Write in such a way that when u keep two cubes side by side, u should be able to show all days in a month. (1-31)

INFOSYS

Technical Questions asked:

1. Explain your project

2. What are your areas of interest in Appli Prog Personal Questions asked:

1. Introduce yourself

2. Why do you want to join INFOSYS 3. Do you have a passport

4. Have you taken GRE/TOEFL
5. Will you go abroad

Oracle

Technical Questions:

Explain your research work. Given a C program, tell me how it would go into the address space of the computer?

Which would go where?

There were uninitialized and initialized global variables and local variables and two functions? (I don't know) Distributed memory - cache consistency problem, issues and solutions. (Tanenbaum - os) Write a CPU Scheduler implemeting priority scheduling in C language - 20 lines of code, 10 minutes time.

Also give the data structure to use. Use a doubly linked list. Quite simple if you don't get tensed up.