Domande poste durante i colloqui per Production Engineer

↳

A - array of versions, |A| = n check(A[0]) = true - first version is fine check(A[n-1]) = false - last version has the fault binary search: int start = 0; int end = n-1; while(end-start>1){ int middle = (end+start)/2; if (check(A[middle])) start = middle; else end = middle; } A[end] is the version with the fault Meno

↳

first, design a test case to detect the failure. next, determine the last known "good" state of the software, i.e. the revision number of the last known "good" state. now, write a script that will check out each subsequent revision starting from the known good revision, build, run the test case and examine the output. When output fails, you can determine the revision at which the bug was introduced. Meno

↳

I would write an integration test, for that scenario which started to fail. Then I'd write a shell script which would run that test over some amount of last revisions. Once test is failed, you've found a revision where mistake was made. Meno

Domande per la posizione di Production Engineer...11 gennaio 2019

What does "$?" mean in bash?

↳

returns the status code of the last executed command

↳

The exit code of the last executed command.

↳

The exit code of the last executed command.

Domande per la posizione di Production Engineer...28 maggio 2015

Take a paragraph as Input and output the top three most repeated words

↳

from collections import Counter def get_most_3_repeated_words(paragraph): counter = Counter(paragraph.split()) return sorted(counter.items(), key=lambda x: x[1])[-3:] Meno

↳

#/usr/bin/env python from collections import defaultdict wordlst = [] wordcnt = defaultdict(lambda : 0) paragraph = open('/home/nacho/python_test.txt','r') for line in paragraph.readlines(): for word in line.split( ): wordcnt[word] += 1 del wordlst paragraph.close() mostCommon3 = wordcnt.items() del wordcnt mostCommon3 = sorted(mostCommon3, key=lambda value: value[1], reverse=True) for indx in xrange(3): print "%s: %i" % (mostCommon3[indx][0], mostCommon3[indx][1]) Meno

↳

A more correct shell answer, which returns the top word first: for word in `cat input.txt`; do echo $word; done | sort | uniq -c | sort -nr | head -3 | awk '{print $2}' Meno

Domande per la posizione di Production Engineer...18 marzo 2014

What options do you have, nefarious or otherwise, to stop people on a wireless network you are also on (but have no admin rights to) from hogging bandwidth by streaming videos?

↳

This question is basically a way of ascertaining how much knowledge you have of the effect of distorting networking protocols in nonstandard ways. Everything from "ask them politely to stop" to "hijack their connection". Meno

↳

set a dns server with the same MAC of real DNS server, forward all the "healthy" traffic back to real DNS, hijack the Domain related to video streaming. Meno

↳

Anonymous on Apr 4, 2016: (but have no admin rights to)?

Domande per la posizione di Production Engineer...26 novembre 2012

Why wouldn't you want a root DNS server to answer queries for you, instead of delegating you to an authoritative server?

↳

Because root DNS server can't handle zillions of requests at once, that's why you need a load balancer to split tasks on multiple DNS servers. every server has it's own limits, and load balancing helps to "scale" the limits. Meno

↳

because it would be faster due also to caching mechanism.

↳

DNS servers basically are text file doing Name to IP mapping(A type). So if a root server had to answer all the queries ,it would essentially be a million line text file, mapping each and every website.This would result in large CPU processing and time. Essentially, Root servers redirect the query to top level DNS servers and so on Meno

Domande per la posizione di Production Engineer...13 aprile 2017

Name three states a process can be in.

↳

Running, Stopped, IOwait

↳

D = uninterruptible sleep (waiting for io) R= running S = interruptible sleep T= stopped by job control signal t= stopped by debugger with tracing x = dead z= zombie (dead) waiting for its return value to be recovered by parent process Source: ps man page Meno

↳

NEW- The process is being created. READY- The process is waiting to be assigned to a processor. RUNNING- Instructions are being executed. WAITING- The process is waiting for some event to occur(such as an I/O completion or reception of a signal). TERMINATED- The process has finished execution. Meno

Domande per la posizione di Production Support Engineer...20 agosto 2014

You have two water buckets: the first can hold 3 gallons of water and the second can hold 5 gallons of water, how do you fill the 5 gallon bucket with exactly 4 gallons of water using these two buckets (the 3 gallon and 5 gallon bucket)?

↳

Easiest way: * Fill the 5 gallon bucket with water. * Pour out 3 gallons into the 3 gallon bucket, now there are 2 gallons of water in the 5 gallon bucket. * Empty the 3 gallon bucket. * Pour the remaining 2 gallons of water in the 5 gallon bucket into the 3 gallon bucket. * Refill the 5 gallon bucket with water again. * Fill the 3 gallon bucket with the 5 gallon bucket until full, 1 gallon will be removed from the 5 gallon bucket and thus you have 4 gallons of water in the 5 gallon bucket. Meno

↳

There is another way of doing it. Take a full 3 gallon bucket and pour into the empty 5 gallon bucket. Take another full 3 gallon and pour it into the 5 gallon bucket until it gets full. Now there will be one gallon in the 3 gallon bucket. Now empty the 5 gallon bucket and pour the remaining one gallon from the 3 gallon bucket into the empty 5 gallon bucket. Now pour full 3 gallon bucket into the 5 gallon bucket.You will get 4 gallons in the 5 gallon bucket. Meno

↳

Fill both buckets half way

Domande per la posizione di Production/Manufacturing Engineer...19 luglio 2019

Why you chose this company

↳

I would like to gain more knowledge in the manufacturing field

↳

Experiance job pvc production. Pvc fabrication pvc welder pvc bend making pvc coupler Meno

↳

I would like to gain more knowledge in the manufacturing field