Go Back   2023-2024 StudyChaCha > StudyChaCha Discussion Forum > General Topics

Old May 30th, 2014, 02:48 PM
Super Moderator
Join Date: May 2011
Default Re: Flextronics placement previous years question papers

As you want to get the Flextronics placement previous years question papers so here is the information of the same for you:

Some content of the file has been given here:

1.The number of times the two hands a clock make a right angle between midday and midnight is
(1) 24 (2) 23 (3) 22 (4) 12
2.A train running at a speed of 45 km/hour takes. 10 seconds to pass a certain point. Then the length of
the train is
(1) 120 m (2) 125 m (3) 128 m (4) 450 m
3. If x= (7+4√3), then the value of x2 + 1/x2 is
(1) 193 (2) 194 (3) 195 (4) 196
4. Three bells rings at the intervals of 36 seconds, 40 seconds and 48 seconds respectively. They start
ringing together at a particular time. When they will start ringing together again?
(1) After 6 minutes (2) After 12 minutes (3)After 18 minutes (4) After 24 minutes
5. The sum of one-half, one-third and one-fourth of a number exceeds the number by 12. The number is
(1) 144 (2) 154 (3) 90 (4) 174
6. A farmer divides his herd of x cows among his 4 sons so that one son gets one half of the herd, the
second gets one-fourth, the third gets one-fifth and the fourth gets 7 cows. Then x is equal to
(1) 100 (2) 140 (2) 180 (4) 160
7. If the list price of a book is reduced by Rs. 5, then a person can buy 5 more books for Rs. 300. The
original cost of the book is
(1) Rs. 15 (2) Rs. 20 (3) Rs. 25 (4) Rs. 30
8. A man has only 20-paise and 25-paise coins in a bag. If the has 50 coins in all totaling to Rs.11.25,
then the number of 20-paise coins is
(1) 28 (2) 27 (3) 26 (4) 25
9. Jayant gets 3 marks for each right sum and loses 2 marks for each wrong sum. He attempts 30 sums
and obtains 40 marks. The number of sums attempted correctly is
(1) 25 (2) 20 (3) 26 (4) 27
Complete the following number series:
10. 1, 1, 3, 9, 5, 25, 7, 49 _, 81
(1) 7 (2) 9 (3) 8 (4) 10
11. 5, 11, 23, 41, 64, _
(1) 89 (2) 95 (3) 101 (4) 105
12. If a4 + b4 = a2 b2, then a6 + b6 equals
(1) 0 (2) a3 b 3 (3) abc (4) 1
1.(3)2.(2)3.(2)4.(2)5.(1)6.(2)7.(2)8.(4)9.(2)10.(2 )11.(2)12.(1)

Test Consist of 7 Sections. For every section they Will give you some amount of time.After that time
slot, they will collect the Question Papers From you. No Negative Marks.......
SECTION 1 : Verbal Ability
No Of Qns : 15
No Of Mins : 15
Qns From (1-10) : Combination of Fill up the blanks & Synonyms
Qns From (11-15): Passage reading ( Qns from that Given Passage)
SECTION II : Analytical Ability
No of Qns : 15
No of Mins : 20
Qns From (16-30) : Combinations of Set theory,Percentage,Cubes,Probability Better Be Familiar with
R.S.Agarwal matterials for Clearing this section.
SECTION III : Mental Ability (Very Easy)
No Of Qns : 15
No of Mins : 15
Qns From (31-35) : Pattern Matching E.g AsHraf aSHraf Ashhraaf We have to check and tick the
correct answers whether all three datas are same or different.
Qns From (36-40) : Simple Maths like if * stands for +,- stands for/ then what is 2/5*8-8= ?
Qns From (41-45) : Passage and some condtions will be there,We have to tick The Answers depends
upon the conditions
SECTION IV : Operating Systems,Data Structures and Algorithims
No Of Qns : 15
No Of Mins : 20
Qns From (46-52) : Data Structures (Mainly Linked List,Tree,Queue.
Qns From (53-60) : Operating System Concepts
SECTION V : C or C++ Programming (Its Our Choice)
No of Qns : 20
No of Mins : 20
I have selected C ,Most of the Questions are from Pointers. so Please Be thorough With Pointer
SECTION VI : Learning Ability
No of Qns : 10
No of Mins : 15
In this Section,First they will give you one Passage, You have to Read and memorize the Important
Poits in 10 mins,
B"coz After 10 Mins they Will Collect that paper from you. Then only They will give you 10
Questions.In this Section they are checking Candidates Grasping Power & Memory Capacity.
SECTION VII : Essay Writing

For more detailed information I am uploading PDF files which are free to download:

Contact Details:
Sandiyappan St,
Kodandarama Nagar,
Tamil Nadu 600078 ‎

Map Location:
Attached Files Available for Download
File Type: pdf Flextronics placement previous years question papers-.pdf (123.3 KB, 33 views)
File Type: pdf Flextronics placement previous years question papers.pdf (52.9 KB, 58 views)
Answered By StudyChaCha Member

Last edited by Educhamp; May 30th, 2014 at 02:58 PM.
Reply With Quote
Old September 21st, 2015, 03:48 PM
Default Re: Flextronics placement previous years question papers

Hello sir I am B.Tech final year student and Flexatronics is visiting my campus for recruitment so please give me precious year question papers.
Reply With Quote
Old September 21st, 2015, 04:24 PM
Super Moderator
Join Date: Dec 2011
Default Re: Flextronics placement previous years question papers

Flextronics takes written as well as interview which recruiting fresh graduates. There is a written test, two rounds of technical interview moves in the last HR interview.
The written test has question based on grammar, analytical reasoning, general aptitude, data structure and algorithms, C or C ++.

Subjects covered in written test


Grammar section-In this section there are general grammar related questions and a passage reading. It contains 15 questions.

Analytical reasoning part

There are 20 questions for 20 marks. Each question is followed by two statements. You can answer it by using either of the two statements.

General Aptitude

This section again has 20 questions.

The C or C++ papers are relatively easy with lower cutoffs for candidates of other branches.

After the successful clearance of the written test, the student will be called for a technical interview. This will take two rounds. Following that you have an HR interview.

Flextronics previous years question papers
1. What is max. no. of hops in hypercube n/w with n (=2 ^ p) to go from one node to another ?
a. p
b. log p
c. n ^ 2
2. What is Kerberos ? ans. Authentication Protocol.
3. In completely connected multiprocessor system with n processors , links will be of the order of
a. O(n ^ 2)
b. O(2 ^ n)
c. O(n/2)
4. When quick sort gives worst performance ? ans. When elements are in order
5. o/p of each sorting step of 8 elements was given and had to recognise which sorting algo.?
Ans. Bubble sort (Not Sure , Check it out )
6. In worst case ,which sort is best out of following sorts?
a. heap
b. selection
c. quick (ans.)
d. insertion
7. hree very simple gate circuits each having inputs A,B,C,D were given and had to tell ,which two
give same result ? (DeMorgan's Law was used in solving ) Ans was (a) &(c) (o/p of a & c was
coming to be AB +CD)
8. K-map given,had to tell simplified function Ans was perhaps AB+AD +AC+BCD
K-Map was CD`
AB 0 0 0 0
0 0 1 0
1 1 1 1
0 1 1 1
9. What is Function Point ? Ans. S/W estimation technique
10.p points to an integer. We don't want p to change value. In C, what declarations will we use?
A const int *p
b. int *p
c. int const *p
e. int* const p (perhaps ans.)
11.Diff between 2NF &3NF ? Ans. D (last option)
12.Which does not use client server model ?
a. Email
b. Web access
c. C. Telephone call
d. N/w file system
13.In a pipeline having 3 stages, each having reliability of 0.9 ,what is overall reliability of
a. 0.9
b. 0.729
c. 0.81
14.2level cacheis there first level cache's access time is 100ns,second level cache's access time is
33ns & memory access time is 1000 ns . What is total memory access time ? ans. 140 ns
15.In public key cryptography,Awillsend message to B ans. Using B's public key
16.What does projection of a relation give? Ans.gives vertical partition of relation corresponding
to specified columns.
17.For disk or direct access storage, which is best ?
a. AVL
b. B-tree
c. Red tape .
18.There is a tree with inorder threading Node B is inserted as left child of nade A. Node A
already has right child . Where will the null ptr of B point ? ans. Parent of A (perhaps)
19.There is a diskless workstation. Which will be the first protocol it will use ?
b. ARP
20.Compiler keeps which of following ? ans. Symbol table
21.ping' command uses which protocol ? ans. ICMP
22.Merge sort uses which technique? Ans. Divide and Conquer
23.Program counter is incremented in
a. fetch (ans)
b. decode
c. execute
24.what does the following program do ?
f(int n)
int c;
print c;
ans. Program prints the no. of set bits in no.
25.-What is this called (char *) (*(*(*A[X]) ( ) )) ( )
ans. Array of X pointers to a function returning pointer to functions that are returning pointer to
char (not sure )
26.For synchronisation in distributed computing, what should not be there ?
a. all machines are synchronised by a global clock
b. all systems should have their own clock (perhaps ans)
27.Java applet of a moving /waving file is running on one machine then it means
a. Java's executable code is downloaded and running on the m/c
b. A virtual X server is running on that m/c while the actual program is running on the web
28.What is in RSA algo. ?
a. First the session key is encrypted & then whole message is encrypted using RSA Algo.
b. Message is encrypted using RsA algo.
c. First Rsa algo is used &then encrypted with the session key.
29.-What is dirty read?
a. Transaction reexecutes and gives diff. Results from the original execution
b. Read is done when the transaction is not yet committed
30.-What is coupling ?
a. It tells the strength of interconnection between two program units.
b. It tells the strength of interconnection between twtrength of interconnection between two
program units.
31.Any n/w on the computer can have only
a. one domain &one IP
b. more than one domain & more than one Ip
c. one domain and more than one IP
d. more than one domain & one IP
32.Which one does not have file descriptor ?
a. process
b. keyboard
c. pipe
d. socket
33.What does CONNECT BY means
a. connect to a different databaser for retreival
b. arrange in tree ordered structure
34.n two phase commit protocol, why log is used during transmission &reception ?
a. To retrieve the status in case of crash
35.n which algo. Waiting time is minimun?
Ans, SJF
36.How many address bits are there in Ipv6
ans. 128 bits
37.During run time heap is managed by
a. a user process in kernel mode
b. A system process manages heap for all the processes
c. A system process for each process
d. A user process in user mode
38.In which of following search is efficient?
a. height balanced tree
b. Weight balanced tree
c. Binary tree
39.A ques. on resource relocation, sharing ( I don't remember more than this regarding this ques.)
40.some ques. options were sth like
a. transparency control
b. Migration control
c. Concurrency control
41.X:In DFD, input is converted into output by passing through various functional units YFD
cannot be used in object oriented design
a. both X& y are correct
b. both X & Y are incorrect
c. X correct, Y incorrect
d. Xincorrect, Y correct
42.Where regression testing is used ?
a. Dynamic analysers
b. Loaders
43.For Java interfaces , what is true ?
a. Functions declarations are not given'
b. Variables are not declared
c. Instance variables are not used
44.n a linked list, we can delete a node in order of
a. 1
b. n
c. n ^ 2
45.f there are N people and we have to do symmetric & asymmetric cryptography, how many keys
be used in these cases respectively?
a. N & N ^ 2 (probably ans)
b. N ^ 2 & N
c. N & N
d. N ^ 2 & N ^2
46.The protected element of a class can't be accessed by
a. member functions of the same class
b. member functions of the derived class
c. member functions of any other class in the same program (Ans.)
47.NFS uses same file structure as unix
48.To solve an expression which of following trees will you use ?
a. postfix
b. infix
1. void x(char* a)
return 1;
Input string 'a' is assigned as AaBbCc , what is the output?
2. A question on digital gates ANS is OR gate.
3. What is the binary representation of 41.6785
4. If the precondition for a subroutine does not hold then
1. postcondition does not hold
2. postcondition may or may not hold
3 . ?
4. ?
5. In java
1. java strings are mutable. And some other options on java strings
6. Void f(char *p)
p = (char*)malloc(6);
void main( )
char *p = "BYE";
7. A question on write through and write back algo.
8. What is concerned with transport layer. Ans PORT.
9. A server can work with ip and ipx protocol.how the server will determine to which protocol the
incoming packet coresponds .
10.For which purpose dhcp is used ANS ip address
11. global vaariable defined as ststic will serve the purpose of ---
12. Question on NFS ANS It uses the same semantics as unix for file system
13.Program counter is incremented typically in which uses ANS fetch
14.NO of NULL pointers in a tree with n leaf nodes ANS N+1
15.thread take less time than process context Why? Ans. Address space is same.
16.Which algo is best for sorting 10 elements? Ans. 1> binary tree 2> selection 3> bubble 4> none
17. question on ICV(networking)
a) When A sends an ICV and message, B computes ICV , checks It with given ICV,and
decodes Message
b) Similar other
18.8 When server A sends a time request to server B, (time synchronization), and response
becomes past, What does A do?
a) resets its own clock
b) resends time request again
19.9 in public key encryption what does A do such that It is not visible to others?
a) A uses public key part of A
b) A uses private key part of A
c) A uses public key part of B
d) A uses private key part of B
20. function dependency can be described as:
21.on findind cyclometric complexity of the given program 1> 7 2>5 3> 4 4> 0
22.Codd's rule related to database
23.path testing comes under
A) white box
B) black box
24.when an ip address is not in the computer adresss resolution file what does It do with that
a) Ignores It
c) sends It to default gateway
d) sends It to ethernet server
25.Execution divided in different stages then this is called ANS. Pipelining
26.In C the macros are ANS. converted in to inline code during preprocessing
27. X: verification means doing the right things
Y: validation means doing things right
a. both true
b. both false
c. one true one correct
28.void insert (key, r) Keytype key, data
if (n>=max)
Which is best? 1. sequential search
29.which is best for associative list searching?
1) single linked list
2) doubly linked list
3) hash table
30.A question based on SQL ?
31. which is not necessary condition for deadlock?
1. mutual exclusion
2. no preemption
3. is ANS.
4. Circular wait

more papers detail attached two pdf files;
Attached Files Available for Download
File Type: pdf Flextronics placement previous years question papers1.pdf (77.1 KB, 13 views)
File Type: pdf Flextronics placement previous years question papers2.pdf (71.9 KB, 20 views)
Answered By StudyChaCha Member
Reply With Quote

Job Placement

Reply to this Question / Ask Another Question
Your Username: Click here to log in


All times are GMT +6. The time now is 12:52 PM.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, vBulletin Solutions Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2 3 4 5 6 7 8