Skip to main content

Posts

Placement Procedure at Sopra Steria

About Sopra         Sopra was founded in 1968. It is one of Europe's longest established IT services company Sopra is a leader in European consulting market. Sopra provides IT services & software solutions  for various domains such as Banking, Insurance, Telecom & Media, Airlines,  Real Estate, Manufacturing, Human Resources & Public Sector. Sopra has made its presence in 12 countries all over the world with a total global employee strength of 14000+. Sopra has a very strong employee strength in India and its is continuously growing Placement Procedure The placement procedure consists of 3-4 rounds and it is conducted online at Sopra premises Round 1:  Time = 90 mins      Number of Questions = around 30   This is a elimination round. The first round consists of Technical written test. This test checks your knowledge at Data Structures, C. and DBMS Most of the Questions are based on the basics of pointers, stacks, array, queue, linked list, trees. If y
Recent posts

Sopra Steria Aptitude Questions - Type 2 - Quetions 2

Q3.If the output of the following program executes the instructions written in box A. Then which of the boxes  (1), (2), (3) may contain the smallest and the largest number? Q4. If the output of the following program executes the instructions written in box C & box F. Then which of the boxes (1), (2), (3) may contain the smallest and the largest number? Q5. If the output of the following program executes the instructions written in box D & box C. Then which of the boxes (1), (2), (3) may contain the smallest and the largest number?

Sopra Steria Aptitude Questions - Type 2 - Question 1

(n)= no. in box 1 Following two Questions are based on the same data: Q1= If the output of the following algo is box C. Then whichof the boxes (1),(2),(3) can have the greatest and the smallest number? Q2. If the output of the following algo is box C & boxB. Then which of the boxes (1),(2),(3)can have the greatest and the smallest number?

Sopra Steria Aptitude Questions - Type 1 - Question 1

Q1. The following algorithm adds the numbers in box no. 1,2,3,4,5 and puts the sum in box number 8. For this to happen what should be the minimum value in box number 11. where (n) means box number n. Step1: Initialization : Put 0 in box number (8). Step2 : Put 0 in box number (11). Step3. Add: Add number in box (8) and no. in box (1) and put the result in box (8). Step4: Add : no. in box (11) +2 and put the sum in box number (11). Step 5 : Check if no. in box (11) > 0 & it is divisible by 5 Step6:Change instruction 3 : Increase the second box number in step 2 by 1.       1           2          3           4           5            6           7           8             9          10         11         12 2 4 3 7 9 0 1 2 4 1 1 Solution : These types of problems can be easily solved by following the algorithm steps . The initial values in the boxes are :              1  

Sopra Steria Aptitude Questions - Type 1 - Question 2

Q2. The following algorithm doubles the numbers in 2,4,6,8. For this what should be the minimum value in box number 12. (n) means box number n.       1          2           3           4           5            6           7           8          9           10         11          12 2 4 11 7 9 0 5 2 4 1 2 1 Step1: Initialization : Put the no in box (7) into box number 12. Step2 :  Add:  no in box (2) + no in box (2). Put the result in box (2). Step3. Check:  number in box number (12) leaves a remainder 1 when divided by 5. Step4: Change :  Increase box number in step 2 by 2. Step 5: Multiply:  Multiply no. in box(12) by 2. Step6: Subtract:  Decrease no. in box(12) by the no whose box no. is in box (3) Solution These types of problems can be easily solved by following the algorithm steps . The initial values in the boxes are :              1        2        3         4             5          6          7