Microsoft2013校园招聘笔试题及解答
继续求拍砖!!!!
1. You are managing the database of a book publichser, you currently store the book orders your company receives in the following BookOrders table. You manager has asked you to generate a report to list all the orders where the quantity ordered was greater than the average quantity per order for that book. Which of the following queries will satisfy the business requirements? (3Points)
A. select BookID from BookOrders A where QuantityOrdered > (select avg(QuantityOrdered) from BookOrders B where B.BookID = B.BookID)
B. select OrderID from BookOrders A where QuantityOrdered > (select avg(QuantityOrdered) from BookOrders B where B.BookID = A.BookID)
C. select BookID from BookOrders A where QuantityOrdered > (select avg(QuantityOrdered) from BookOrders B where B.BookID = A.BookID)
D. select OrderID from BookOrders A where QuantityOrdered>(select avg(QuantityOrdered) from BookOrders B where A.BookID=A.BookID)
2.Which one CANNOT be used to communicate between 2 processes on Windows?
A. Named event B. Named Pipe C. Critical Section D. Shared Memory
3. Which of the following operation is NOT basic operation of stack?
A. Push an element to the stack B. Pop an element from the stack
C. Check if the stack is empty D. Sort the stack
4.Which of the following design patterns is(are) "creational" pattern(s)?
A. Facade B.Singleton C. Composite D.None of the above
5. Which of the following TCP packets sequence is(are) correct for TCP handshake when setting up a connection?
A. SYN, SYN+ACK, SYN+ACK B. SYN+ACK, SYC + ACK, SYN
C. SYN, SYN+ACK, RST D. SYN, SYN, ACK
E. None of the above
6. The characteristics of functional programming are
A. Avoidance of changing state and mutable data
B. Referential transparency
C. Lambda calculus
D. Thread-safe
E. All of above
7. The Hypertext Transfer Prorocol (HTTP) is an application protocol for distributed collaborative, hypermedia information systems. It is the foundation of data communication for the World Wide Web. Which of the following statment(s) is(are) correct:
A. It functions as a request-response protocol in the client-server computing model
B. It is a stateless protocol is that treats each request as an independent transaction
C. It is the protocol that major Internet applications such as the World Wide Web and email rely on
D. The HTTP response includes a numeric status code, and the status code "404" often stands for "Page Not Found"
E. None of the above
8. Which is correct about shallow copy in C++?
A. Shallow copy only copy reference
B. Shallow copy will cause possible physical pointer duplication
C. Shallow copy may caue problems in case of assignment or parameter passing in function
D. Copy constructor may mitigate the risk of shallow copy
9. There are 15 balls that are put into 4 bags. It is required that every bag has at least 1 ball but the number of balls in every bag should be different. How many different ways totally,can be used to put the balls into the 4 bags?
A. 4 B. 5 C. 6 D. 7 E. None of the above
10. What will be the output of this program?
class Base
{
public:
char Value(){ return 'A'; }
virtual char VirtualValue() { return 'V'; }
}; class Derived : public Base
{
public:
virtual char Value() { return 'D'; }
}; class VirtualDerived:virtual public Base
{
public:
char Value() { return 'Z'; }
char VirtualValue() { return 'X'; }
}; int main()
{
Base* b1 = new Derived();
Base* b2 = new VirtualDerived(); cout<<b1->Value() <<''<<
b1->VirtualValue()<<''<<
b2->Value() <<''<<
b2->VirtualValue()<<endl;
}
A. A V A X B. D V A X C. A V Z X D. A V Z V E. D V Z X
11. Tow 32 bit integer values A and B, are processed to give the 32 bit integers C and D as per the following rules. Which of the rule(s) is(are) reversible? i.e. is it possible to obtain A and B given c and D in all condition?
A. C = (int32)(A+B), D = (int32)(A-B)
B. C = (int32)(A+B), D= (int32)((A-B)>>1)
C. C = (int32)(A+B), D = B
D. C = (int32)(A+B), D = (int32)(A+2*B)
E. C = (int32)(A*B), D = (int32)(A/B)
12. If a pre-order traversal sequence of a binary tree is abcdefg, which of the following(s) is(are) possible in-order traversal sequence?
A. abcdefg B. gfedcba C. bcdefga D. bceadfg E. bcdaefg
13. T(x) = 1(x<=1), T(n) = 25*T(n/5)+n^2 What is T(n)?
A. O(nlogn) B. O(n^2logn) C. O(n^2) D. O(n^3) E. O(n^3logn)
14. There are two threads running on a dual-core machine. Their main body are listed as following c code snippet thread1: x=1; r1=y; thread2: y=1; r2 = x; x, y are two global variables initialized as zero. Which is(are)the possible value(s) of r1 and r2?
A. r1=1, r2 =1 B. r1=1,r2=0 C. r1=0, r2 =1 D r1=0, r2=0
15. The depth of a complete binary tree with n elements is
A. D(n) = log2(n) B. D(n) = 1+log2(n) C. D(n) = n * log2(n) D. D(n) = 1 + n*log2(n)
16. How many 0 appears in 1,2,3,...,999,1000?
A. 189 B. 191 C. 193 D. 195
注:算出来结果是192
17. What is the probability for born on 2/28 vs born on 2/29? and what for born on 2012/2/28 vs born on 2012/2/29?
A: 1:1 and 1:1 B. 4:1 and 1:1 C. 1:1 and 4:1 D. 4:1 and 4:1
18. Which of the following use(s) greedy strategy?
A. Dijkstra algorithm in single-source shortest path
B. Prim's algorithm in minimum spanning tree
C. Kruskal's algorithm in minimum spanning tree
D. Floyd-Warshall algorithm in all-pairs shortest paths
E. KMP algorithm in string match
19. Given the following code:
class A
{
public:
int k1; int k2;
}; int cmp(A x, A y) { return x.k1 - y.k1;}
void exchange(A a[], int i, int j) { A t = a[i]; a[i] = a[j]; a[j] = t;}
void f1(A a[], int l, int(*c)(A x, A y))
{
for(int i = 0; i < l; ++i)
{
int min = i;
for(int j = i+1; j < l; ++j)
{
if(c(a[j], a[min])<0) min = j;
}
exchange(a, i, min);
}
} void f2(A a[], int l, int(*c)(A x, A y))
{
for(int i = 1; i < l; ++i)
{
A t = a[i]; int j = i-1;
while(c(t, a[j])<0 && j >=0)
{
a[j+1] = a[j];
j = j-1;
}
a[j+1] = t;
}
} void f3(A a[], int l, int(*c)(A x, A y))
{
for(int i = 0; i < l; ++i)
{
for(int j = l-1; j > i; --j)
{
if(c(a[j], a[j-1])< 0) exchange(a, j-1, j);
}
}
} int _f41(A a[], int low, int high, int(*c)(A x, A y))
{
int i = low; A t = a[low];
for(int j = low+1; j < high; ++j)
{
if(c(a[j], t)<= 0)
{
i++;
if(i!=j) exchange(a, i, j);
}
}
exchange(a, low, i);
return i;
} void _f42(A a[], int low, int high, int(*c)(A x, A y))
{
if(low < high)
{
int p = _f41(a, low, high, c);
_f42(a, low, p, c);
_f42(a, p+1, high, c);
}
} void f4(A a[], int l, int(*c)(A x, A y))
{
_f42(a, 0, l, c);
}
An array is declared as below:
A a[5] = {{3,4},{6,5},{2,7},{3,1},{1,2}};
Which of the function calls can transform it into:
{{1,2},{2,7},{3,1},{3,4},{6,5}}
A. f1(a,5,cmp) B. f2(a,5,cmp) C. f3(a,5,cmp) D. f4(a,5,cmp) E. None of the above
注:排序的稳定性问题 选择排序、插入排序、冒泡排序、快速排序
20. A particular BNF definition for a "word" is given by the following rules:
Which of the following lexical entieies can be derived from <word>? I. abcd II. bcdef III.d22
A. None B. I and II only C. I and III only D. II and III only E. I,II and III
Microsoft2013校园招聘笔试题及解答的更多相关文章
- Microsoft 2013校园招聘笔试题及解答
Microsoft 2013校园招聘笔试题及解答 题目是自己做的,求讨论.吐槽.拍砖 1. Which of the following callingconvension(s) suppo ...
- Microsoft2013校园招聘笔试题
Microsoft2013校园招聘笔试题 继续求拍砖!!!! 1. You are managing the database of a book publichser, you currently ...
- google2013校园招聘笔试题(全国)
google2013校园招聘笔试题 1. 单项选择题1.1如果把传输速率定义为单位时间内传送的信息量(以字节计算)多少.关于一下几种典型的数据传输速率:1.使用USB2.0闪存盘,往USB闪存盘上拷贝 ...
- 2014 WAP校园招聘笔试题
2014 WAP校园招聘笔试题 Problem's Link: http://www.doc88.com/p-6751117015483.html WAP公司笔试题 We are planning ...
- C# - 2017微软校园招聘笔试题 之 MS Recognition[待解决]
MS Recognition 在线提交: hihoCoder 1402 http://hihocoder.com/problemset/problem/1402 类似: OpenJudge - I:P ...
- 京东2017校园招聘笔试题 【第K个幸运数】
题目描述 4和7是两个幸运数字,我们定义,十进制表示中,每一位只有4和7两个数的正整数都是幸运数字. 前几个幸运数字为:4,7,44,47,74,77,444,447... 现在输入一个数字K,输出第 ...
- 九度OJ 1531 货币面值(网易游戏2013年校园招聘笔试题) -- 动态规划
题目地址:http://ac.jobdu.com/problem.php?pid=1531 题目描述: 小虎是游戏中的一个国王,在他管理的国家中发行了很多不同面额的纸币,用这些纸币进行任意的组合可以在 ...
- PPS2013校园招聘笔试题
转载请标明出处,原文地址:http://blog.csdn.net/hackbuteer1/article/details/11473405 一.简答题 (1)一位老师有2个推理能力很强的学生,他告诉 ...
- 2012Google校园招聘笔试题
1.已知两个数字为1~30之间的数字,甲知道两数之和,乙知道两数之积,甲问乙:“你知道是哪两个数吗?”乙说:“不知道”.乙问甲:“你知道是哪两个数吗?”甲说:“也不知道”.于是,乙说:“那我知道了”, ...
随机推荐
- [leetcode] Reverse Linked List 分类: leetcode 算法 2015-07-09 18:44 2人阅读 评论(0) 收藏
反转链表:比较简单的问题,可以遍历也可以递归. # Definition for singly-linked list. class ListNode: def __init__(self, x): ...
- Ibatis调用存储过程实现增删改以及分页查询
1.Ibatis实现增删改操作很简单了,通常我是将某一模块的增删改功能写在一个存储过程里,通过一个标识符去区分执行增加还是修改抑或删除操作. statement: <!-- 存储过程:实现学生的 ...
- Connection reset by peer问题分析
extremetable导出excel,弹出一个下载窗口,这时不点下载而点取消,则报下面的异常: ClientAbortException Caused by: java.net.SocketExce ...
- C#基础 大盘点
类型转换 tryParse 字符和整形转换 转译符: /' 单引号 /" 双引号 // 反斜杠 /0 空字符 /a 感叹号( ...
- c语言,动态数组
试着直接malloc一个2*3*4的空间来模拟数组: #include <stdio.h> #include <malloc.h> int main(void) { int** ...
- Java中的字符串驻留
转自:http://www.cdtarena.com/javapx/201307/9088.html 最近在工作的时候,一句再正常不过的代码String a = “hello” + “world”;被 ...
- itextSharp 对pdf的每个页面添加footer/header
static void SetAllHeaderFooter(string inputPath) { PdfReader reader=new PdfReader(inputPath); PdfSta ...
- wireshark删除filters记录
- HDU1686——Oulipo
Problem Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, w ...
- 中国还是和AMD走到一起了 但美国会高兴吗(网易科技 卢鑫)
文/ 网易科技 卢鑫 去年的这个时候,小编写下了一篇<易评:还给AMD一个公正!>——此文由AMD惨不忍睹的第一季度财报展开,谈到了该公司将全部资源押宝2016的现实.如今,2016第一季 ...