0% found this document useful (0 votes)
73 views

Bosch Placement Guide

Here are the key points about operator precedence and associativity in C/C++: - Precedence determines the order of evaluation of expressions. Higher precedence operators are evaluated first. - Associativity determines the order of evaluation between operators of the same precedence. Left associative operators are evaluated left to right, right associative operators are evaluated right to left. - Relational, arithmetic, bitwise, logical AND, logical OR operators have left to right associativity and are evaluated based on their precedence. - Assignment, conditional operator ?: have right to left associativity. - Parentheses can be used to override precedence and associativity by grouping subexpressions. - In expressions connected by AND or OR

Uploaded by

Calvin Joshua
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
73 views

Bosch Placement Guide

Here are the key points about operator precedence and associativity in C/C++: - Precedence determines the order of evaluation of expressions. Higher precedence operators are evaluated first. - Associativity determines the order of evaluation between operators of the same precedence. Left associative operators are evaluated left to right, right associative operators are evaluated right to left. - Relational, arithmetic, bitwise, logical AND, logical OR operators have left to right associativity and are evaluated based on their precedence. - Assignment, conditional operator ?: have right to left associativity. - Parentheses can be used to override precedence and associativity by grouping subexpressions. - In expressions connected by AND or OR

Uploaded by

Calvin Joshua
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 38

ROBERT BOSCH

Before you go further can you take the Quiz to see how much you know about Robert Bosch. The Quiz is available as a
separate document in the same folder (Robert Bosch) that you found this document
ROBERT BOSCH – WHO ARE THEY ?

 The Bosch Group is a leading global supplier of


technology and services.
 It employs roughly 402,000 associates worldwide (as of
December 31, 2017).
 The company generated sales of 78.1 billion euros in
2017.
 Its operations are divided into four business sectors:
Mobility Solutions, Industrial Technology, Consumer
Goods, and Energy and Building Technology.
 As a leading IoT company, Bosch offers innovative
solutions for smart homes, smart cities, connected
mobility, and connected manufacturing. It uses its
expertise in sensor technology, software, and services,
as well as its own IoT cloud, to offer its customers
connected, cross-domain solutions from a single source.
ROBERT BOSCH SPEAK
ROBERT BOSCH GLOBAL – FACTS & FIGURES
ROBERT BOSCH INDIA – FACTS & FIGURES
ROBERT BOSCH – VALUES
ROBERT BOSCH INDIA – MANTRA
PRODUCT CATEGORY - MOBILITY
PRODUCT CATEGORY – MOBILITY – CAR SERVICE
PRODUCT CATEGORY – MOBILITY – AUTO SPARE PARTS
PRODUCT CATEGORY - HOME
PRODUCT CATEGORY – HOME – WATER HEATING
PRODUCT CATEGORY – HOME – APPLIANCES
PRODUCT CATEGORY - INDUSTRY
PRODUCT CATEGORY – INDUSTRY - DRIVES
PRODUCT CATEGORY – INDUSTRY - SECURITY
PRODUCT CATEGORY – INDUSTRY – POWER TOOLS
Robert Bosch – Placement Process

Online Technical HR
Written Test Interview Interview
Feedback from previous year

Selection details
Coimbatore - 54, Amritapuri -14 and Bangalore – 18.
Branch wise details are given below :

Robert Bosch - Branch wise break-up


CBE campus AMP campus B'lore campus
Total
Branch
on-line on-line on-line
on-line Final Final Final Final
Attended Attended Attended Attended
cleared select select select select
cleared cleared cleared

ECE 78 44 12 65 23 8 79 31 10 222 98 30
EEE 58 23 17 44 12 4 23 6 2 125 41 23
CSE 84 32 20 34 8 2 34 8 5 152 48 27
Mech 83 47 5 58 17 0 29 6 1 170 70 6

Total 303 146 54 201 60 14 165 51 18 669 257 86


ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
 What was the Database used in your project?
 What was your role in the project?
 What do you mean by multi threaded programming?
 What is a process?
 What is the difference between thread and a process?
 Why is copy constructor used?
 What is the specialty of eclipse?
 What is the use of trigger and procedures in plsql?
 What are the operating systems you have worked with? Which do you prefer?
Why?
 List out a few commands used in LINUX
 Write a c program to combine three text files into a single text file
 Write a query to find the second highest salary
 What are the commonly used networking protocols? Why TCP/UDP?
 Write the life cycle of a software development. Where is testing involved? Why?
What are the different types of testing?
 How does a receiver know that he has received all the data that the sender has
sent?
 Explain your c++ project. Why that topic?
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
 Realize an XOR gate using only NAND gates and also only NOR gates
 Draw a circuit diagram for a basic amplifier and explain the uses of the
components used
 Write a code for a recursive function (c++)
 Explain an android app. which works on the principle of electronics
 Draw a block diagram of your final year project
 Debugging a C code.
 Example: while(1)..what will this do?
 Difference between structure and union,compiler and interpreter, predict the
output, recursive functions, enum, malloc, calloc
 Can a string be used in a case statement inside a switch?
 What are embedded systems.
 What is hall effect sensor?
 What does ‘cc’ in automobile engines mean?
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
Precedence ( Remember the precedence of operators )
For solving such problems you need to remember the
precedence. For e.g., the relational operator > has a higher
precedence than the & operator. Therefore the expression
k = i++>j&2 will be evaluated as follows.
In this expression the precedence of the operators are ‘++’ >
‘>’ > ‘&’
Relational Operators
The other important information is when you have
expressions connected by AND, OR etc. remember the
following
When it is an AND if the first sub expression evaluates to
FALSE the rest of them will not be evaluated
When it is an Or if the first sub expression evaluated to TRUE
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
Precedence
k = i++>j&2
For e.g., with the current precedence k evaluates to 0
If the precedence of & is greater than > then k will be 1. So if you do
not know about the precedence and associativity of the operators you
can go wrong.
Relational Operators
 Suppose you had an expression in an if condition
if ( x > y && y > z )
If x > y is FALSE then there is no need to evaluate the second
expression y > z
Suppose if we had ( x > y && y++ > z ) then y will not be incremented
at all. So if y was 2 before the expression y will be 2 after the
evaluation of expression as well
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
Suppose we had an expression

If ( x > y || y > z )
If we evaluated x > y and that was TRUE then we do not evaluate the other
expression. So if the other expression was
If ( x > y || y++ > z++ )
y and z will never be incremented
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
Operator Description Associativity
Parentheses (function call) (see left-to-right
Note 1)
()
Brackets (array subscript)
[]
Member selection via object
.
name
->
Member selection via pointer
++ --
Postfix increment/decrement
(see Note 2)
Prefix increment/decrement right-to-left
Unary plus/minus
++ --
Logical negation/bitwise
+-
complement
!~
Cast (convert value to
(type)
temporary value of type)
*
Dereference
&
Address (of operand)
sizeof
Determine size in bytes on this
implementation
Multiplication/division/ left-to-right
* / %
modulus
+ - Addition/subtraction left-to-right
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
Operator Description Associativity
+ - Addition/subtraction left-to-right
<< >> Bitwise shift left, Bitwise shift right left-to-right
left-to-right
Relational less than/less than or equal to
< <=
Relational greater than/greater than or equal
> >=
to

== != Relational is equal to/is not equal to left-to-right

& Bitwise AND left-to-right


^ Bitwise exclusive OR left-to-right
| Bitwise inclusive OR left-to-right
&& Logical AND left-to-right
|| Logical OR left-to-right
?: Ternary conditional right-to-left
right-to-left
= Assignment
+= -= Addition/subtraction assignment
*= /= Multiplication/division assignment
%= &= Modulus/bitwise AND assignment
^= |= Bitwise exclusive/inclusive OR assignment
<<= >>= Bitwise shift left/right assignment

, Comma (separate expressions) left-to-right

Note 1:Parentheses are also used to group sub-expressions to force a different precedence; such parenthetical expressions can be nested and
are evaluated from inner to outer.Note 2:Postfix increment/decrement have high precedence, but the actual increment or decrement of the
operand is delayed (to be accomplished sometime before the statement completes execution). So in the statement y = x * z++; the current
value of z is used to evaluate the expression (i.e., z++ evaluates to z) and z only incremented after all else is done. See postinc.cfor another
example.
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
#include <stdio.h>
int main(){
int a = -12, b = 12;
a = a >> 3;
b = b << 3;
printf("\na = %d b = %d\n", a, b);
return 0;
}
Output
a = -2, b = 96

Negative Numbers should be represented in 2’s complement form. To represent a


number in 2’s complement form first create the binary form of the number, then
complement it and then add 1 to it
For e.g., -12 in binary is
12 => 00000000 00000000 00000000 00001100
Complement of 12 => 11111111 11111111 11111111 11110011
Add 1 00000000 00000000 00000000 00000001
------------------------------------------------------------------------------------
2’s complement 11111111 11111111 11111111 11110100
The leading 1’s tells us that it is a negative number. This is the binary representation
of -12
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
#include <stdio.h>
#define MAX(X,Y) ((X) > (Y) ? (X):(Y))
int main() {
int i = 10, j = 5, k = 0;
k = MAX(++i, j++);
printf(“%d %d %d\n”, i, j, k);
}
Output

12 6 12

This is a very good example of the another pre-processor issue. We have already
seen the macro expansion issue earlier. We know that the pre-processor blindly
substitutes the values

MAX(++i, j++) becomes ((++i) > (j++) ? (++i):(j++))

i gets incremented twice because the expression (i++) > (j++) is true
j gets incremented only once
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
#include <stdio.h> ( 3 marks )
int main() {
union values {
unsigned char a;
unsigned short int b;
unsigned int c;
};

union values val;

val.a=1;
val.b=2;
val.c=4098;
printf(“%d,%d,%d\n”,val.a,val.b,val.c);

Output

2 4098 4098
ROBERT BOSCH INTERVIEW QUESTIONS ( COMPUTER SCIENCE )
 Robert Bosch Fresher Recruitment Process
https://www.youtube.com/watch?v=jbNCyXuLkjM
 Robert Bosch campus interview Experience
https://www.youtube.com/watch?v=SYTOBianNLQ
ROBERT BOSCH INTERVIEW QUESTIONS ( ELECTRONICS )
 Electronic Engineering Job Interview Questions (Part 1)
https://www.youtube.com/watch?v=1N99I_Z1YQc
 Electronic Engineering Job Interview Questions (Part 2)
https://www.youtube.com/watch?v=PPQiJCwH-7Y
You

Wish All

Best The

You might also like