Recruiter Screening Questions<\/p>\n
Question #1: How would you join Tables A and B together in order to retrieve names with no matches in the opposing tables?<\/p>\n
Table A<\/p>\n
Name<\/p>\n
ID<\/p>\n
Jon<\/p>\n
1<\/p>\n
Jacob<\/p>\n
2<\/p>\n
Jingleheimerscmidt<\/p>\n
3<\/p>\n
Table B<\/p>\n
Name<\/p>\n
ID<\/p>\n
Paul<\/p>\n
1<\/p>\n
Jacob<\/p>\n
2<\/p>\n
Jingleheimerscmidt<\/p>\n
3<\/p>\n
Question #2: From this table we need to keep the newest version of each record using date_added, but would like to keep the oldest this_flag value. All fields, minus date_added and this_flag, are used to determine the uniqueness of a record. How would you go about doing this and what would the end result look like?<\/p>\n
Date_Added<\/p>\n
this_flag<\/p>\n
Name<\/p>\n
DOB<\/p>\n
ID<\/p>\n
May 1st , 2015<\/p>\n
Y<\/p>\n
Jingleheimerscmidt<\/p>\n
19901002<\/p>\n
3<\/p>\n
May 1st , 2015<\/p>\n
N<\/p>\n
Jingleheimerscmidt<\/p>\n
19901002<\/p>\n
3<\/p>\n
May 5th, 2015<\/p>\n
Y<\/p>\n
Jon<\/p>\n
19901001<\/p>\n
1<\/p>\n
May 1st , 2015<\/p>\n
N<\/p>\n
Jon<\/p>\n
19901002<\/p>\n
1<\/p>\n
May 1st, 2015<\/p>\n
Y<\/p>\n
Jacob<\/p>\n
19901001<\/p>\n
2<\/p>\n
May 5th, 2015<\/p>\n
N<\/p>\n
Jingleheimerscmidt<\/p>\n
19901001<\/p>\n
3<\/p>\n
May 1st, 2015<\/p>\n
Y<\/p>\n
Jingleheimerscmidt<\/p>\n
19901001<\/p>\n
3<\/p>\n
Question #3: For the table given in Question #2, can you give an example fixed width file layout for this table? Also, do the same for XML and CSV.<\/p>\n
Question #4: There are 2 fields coming in on a file and we need to verify that the values populated are valid, without explicit direction from business. The two fields are DOB (YYYYMMDD) and SSN (000000000). <\/p>\n
Step 1: List the rules you would create to ensure those fields are properly validated. <\/p>\n
Step 2: Provide code to create those rules in whatever language you are most comfortable with (though SQL preferred for verification reasons).<\/p>\n
Question #5: What is the difference between rebasing and merge in Git?<\/p>\n
Question #6: You have just made a commit and found critical issues with the new version, how do you restore back to the previous version?<\/p>\n
Question #7: Your team has been working on a new release, you are being tasked with combining and merging all the changes for the next release. Based on the following graph, what series of steps would you take to get to Master 2.0 while including all branches.<\/p>\n
Question #8: We would like to migrate our sales report to run on the Azure Computing network, the effort to run these reports is as follows:<\/p>\n
Schedule<\/p>\n
Regions<\/p>\n
Expected Volume<\/p>\n
Expected Load<\/p>\n
Daily<\/p>\n
All<\/p>\n
At least 15,000 Transactions<\/p>\n
Low<\/p>\n
Weekly (Friday 11PM)<\/p>\n
North America, Asia<\/p>\n
60,000 to 150,000 Transactions<\/p>\n
Low but varies heavily<\/p>\n
Monthly (Last Day of Month)<\/p>\n
All<\/p>\n
400,000 to 800,000 Transactions<\/p>\n
High with high variation<\/p>\n
Bi-Weekly (Wednesday Update to Management)<\/p>\n
North America<\/p>\n
At least 250,000 Transactions<\/p>\n
Low<\/p>\n
Quarterly (1st Day of Quarter)<\/p>\n
All<\/p>\n
Millions or more<\/p>\n
Very High<\/p>\n
What kind of Computing Solution would you recommend to use to allow for these report to run with an acceptable level of cost and performance, explain your reasoning<\/p>\n","protected":false},"excerpt":{"rendered":"
Recruiter Screening Questions Question #1: How would you join Tables A and B together in order to retrieve names with no matches in the opposing tables? Table A Name ID Jon 1 Jacob 2 Jingleheimerscmidt 3 Table B Name ID Paul 1 Jacob 2 Jingleheimerscmidt 3 Question #2: From this table we need to keep […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[10],"class_list":["post-79126","post","type-post","status-publish","format-standard","hentry","category-research-paper-writing","tag-writing"],"_links":{"self":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/79126","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/comments?post=79126"}],"version-history":[{"count":0,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/79126\/revisions"}],"wp:attachment":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/media?parent=79126"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/categories?post=79126"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/tags?post=79126"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}