微软2014校园招聘笔试试题

微软2014校园招聘笔试试题

大家好,又见面了,我是全栈君,祝每个程序员都可以多学几门语言。

转载请标明出处,原文地址:
http://blog.csdn.net/hackbuteer1/article/details/12190807


1、Which statement(s) is(are) correct about thread and process?Select all that apply.(5 Points)
A、Threads share the same address space of the parent process;Processes share the same address space of the parent process.
B、Changes to the main thread(cancellation,priority change,etc.) may affect the behavior of the other threads of the process; Changes to the parent process does not affect child processes.
C、Multiple threads mar cause deadlock,while multiple processes won’t cause deadlock.
D、Threads can directly communicate with other threads of its process; Processes must use inter-process communication to communicate with sibling processes.
E、None of the above.

2、Which statement(s) below regarding TCP(Transmission Control Protocol) is(are) correct? Select all that apply.(5 Points)
A、TCP provides a way for applications to send encapsulated IP datagrams and send them without having to establish a connection.
B、TCP supports multicasting.
C、Port numbers below 1024 are called well-known ports and are reserved for standard services. For example,port 21 is reserved for FTP protocol, and port 25 is for SMTP protocol.
D、TCP handles package loss reliably.

E、None of the above.

3、Initialize integer i as 0, what’s the value of i after the following operation?(5 Points)

i += i > 0 ? i++ : i --;

A、-2


B、-1


C、0


D、1


E、2

4、Which of the follwing sequence(s) could not be a postorder tree walk result of a binary search tree?(5 Points)


A、1,2,3,4,5


B、3,5,1,4,2


C、1,2,5,4,3


D、5,4,3,2,1

5、When a dll is loaded into memory, which part(s) can be shared between processes?(5 Points)


A、code segment


B、static variable


C、global variable
D、external difinitions and references for linking



E、BSS segment

6、How many times is f() called when calculating f(10)?(5 Points)


int f(int x)
{
	if(x <= 2)
		return 1;
	return f(x - 2) + f(x - 4) + 1;
}

A、14

B、18

C、20

D、24


E、None of the above.

7、Asume you have an object to describe customer data:(5 Points)
{
  ID(7 digit numeric)
  Family Name(string)
  Account Balance(currency)
}
If you have 500,000 Chinese customers records represented by instances of this object type , what set of data structures is best to get fast retrieval of customers (1) get IDs from Name and (2) get Name from ID?
A、(1) Tree with Hash(100 bucket) at leaves(2) Tree with linked list at leaves.
B、(1) Tree with linked list at leaves(2) Array.
C、(1) Tree with linked list at leaves(2) Hash(10,000 buckets)
D、(1) Sort linked list(2) Array.

8、Let’s assume one type of cancer may be mis-diagnosed in the examination. 5 out of 100 people with this cancer will be diagnosed as not having it , and 1 out of 100 people without this cancer will be diagnosed as having it. We know the chance of getting this cancer is around 0.1%. One person was examined and diagnosed of having this cancer, which of the following value if the closest to the chance of is really having it?(5 Points)
A、90%
B、50%
C、30%
D、10%

9、In which case(s) would you use an outer join?(5 Points)
A、The table being joined have NOT NULL columns.

B、The table being joined have only matched data.
C、The columns being joined have NULL values.
D、The table being joined have only unmatched data.
E、The table being joined have both matched and unmatched data.

10、As shown in the graph , start from node B , traverse the nodes on a Depth-First Search(DFS) algorithm , which is(are) the possible traversa sequence(s)? Select all that apply.(5 Points)


微软2014校园招聘笔试试题


A、BADECF
B、BADEFC
C、BCAFDE
D、BCFDEA
E、BFDECA

11、The best time complexity of quick sort algorithm is:(5 Points)
A、O(lgn)
B、O(n)
C、O(nlgn)
D、O(n*n)

12、Which of the following method(s) CANNOT be used for Text-encryption:(5 Points)
A、MD5
B、RSA
C、RC4
D、DES

MD5是不可逆加密,不能够用来加密文本,DES和RC4是对称加密,RSA是不正确称加密,都能够用于文本加密。
13、To speed up data access , we build cache system. In one system , The L1 cache access time is 5 ns , the L2 cache access time is 50 ns and the memory access time is 400 ns. The L1 cache miss rate is 50% , the L2 cache miss rate is 10%. The average data access time of this system is:(5 Points)
A、5
B、30
C、45
D、50
E、55

14、Which is(are) valid function pointer declaration(s) below ? Select all that apply.(5 Points)
A、void* f(int);
B、int (*f)();
C、void (*f(int , void(*)(int)))(int);
D、void (*(*f)(int))();

15、Which of the following method(s) could be used to optimize the speed of a program ? (5 Points)
A、Improve memory access pattern to decrease cache misses.
B、Use special instructions(e.g. vector instructions) to replace compiler generated assembly code.
C、Change an algorithm from recursive implementation to iterative implementation.

D、Loop unwinding.

16、Which regular expression(s) matches the sentence “www.microsoft.com” ? (5 Points)
A、^\w+\.\w+\.\w+$
B、[w]{0,3}.[a-z]*.[a-z]+
C、.[c-w.]{3,10}[.][c-w.][.][a]|.+

D、[w][w][w][microsoft]+[com]+
E、\w*

17、In the image below , if the function is designed to multiply two positive numbers which line number in the image contains the biggest functional bug(assume no overflow)? (5 Points)


微软2014校园招聘笔试试题


A、Line 1
B、Line 2
C、Line 3
D、Line 4
E、Line 5

18、Which of the following can be referred to as attack method(s)? Select all that apply.(5 Points)
A、Vulnerability scan
B、SQL Injection
C、Drive-by downloading

D、Brute force

19、A table CANNOT have one or more of the following index configurations.(5 Points)
A、No indexes
B、A clustered index
C、clustered index and many non-clustered indexes
D、Many clustered index

20、Which of the following is(are) true about providing security to database servers ? Select all that apply.(5 Points)
A、Do not host a database server on the same server as your web server
B、Do not host a database server on a server based system
C、Do not use blank password for SA account

D、Employ a centralized administration model



第二部分測试时间为60分钟,满分50分。请务必在回答问题前细致阅读变成题目。您能够选用C、C++、C#或者Java 当中不论什么一种编程语言,而且保证您的代码能够正确编译和有正确的结果。另外,请一定要注意您的代码的质量。
21、Given a singly linked list L: (L0 , L1 , L2…Ln-1 , Ln). Write a program to reorder it so that it becomes(L0 , Ln , L1 , Ln-1 , L2 , Ln-2…).

struct Node
{
	int val_;
	Node* next;
};

Notes:
1、Space Complexity should be O(1) 
2、Only the “.next” field of a node is modifiable.
代码:

//转载请标明出处,原文地址:http://blog.csdn.net/hackbuteer1/article/details/12190807
struct Node
{  
    int val_;  
    Node* next;  
};
Node* reverse_list(Node* phead)   //链表反转
{
	Node *temp ,*curr , *pre , *reverse_head;
	pre = NULL;
	curr = phead;
	while(curr->next)
	{
		temp = curr->next;
		curr->next = pre;
		pre = curr;
		curr = temp;
	}
	curr->next = pre;
	reverse_head = curr;
	return reverse_head;
}

Node* Merge(Node* slow , Node* fast)
{
	if(fast == NULL)
		return slow;
	if(slow == NULL)
		return fast;
	Node *head , *result;
	result = NULL;
	int i = 0;
	while(slow && fast)
	{
		if(0 == i)
		{
			if(NULL == result)
			{
				head = result = slow;
				slow = slow->next;
			}
			else
			{
				result->next = slow;
				slow = slow->next;
				result = result->next;
			}
		}
		else
		{
			if(NULL == result)
			{
				head = result = fast;
				fast = fast->next;
			}
			else
			{
				result->next = fast;
				fast = fast->next;
				result = result->next;
			}
		}
		i ^= 1;
	}//while
	if(slow)
	{
		result->next = slow;
	}
	if(fast)
	{
		result->next = fast;
	}
	return head;
}

Node* reorder_list(Node* phead)
{
	Node *r_head , *slow , *fast;
	r_head = slow = fast = phead;
	while(fast->next != NULL && fast->next->next != NULL)
	{
		slow = slow->next;
		fast = fast->next->next;
	}
	if(slow->next == NULL)
		return r_head;
	fast = slow->next;
	slow->next = NULL;
	slow = phead;
	fast = reverse_list(fast);      //链表的后半部分反转
	r_head = Merge(slow , fast);    //链表归并
	return r_head;
}


转载请标明出处,原文地址:http://blog.csdn.net/hackbuteer1/article/details/12190807

微软2014校园招聘笔试试题


微软2014校园招聘笔试试题


微软2014校园招聘笔试试题


微软2014校园招聘笔试试题


微软2014校园招聘笔试试题


微软2014校园招聘笔试试题


微软2014校园招聘笔试试题


微软2014校园招聘笔试试题


微软2014校园招聘笔试试题

转载请标明出处处,原文地址:
http://blog.csdn.net/hackbuteer1/article/details/12190807

版权声明:本文内容由互联网用户自发贡献,该文观点仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 举报,一经查实,本站将立刻删除。

发布者:全栈程序员-用户IM,转载请注明出处:https://javaforall.cn/118942.html原文链接:https://javaforall.cn

【正版授权,激活自己账号】: Jetbrains全家桶Ide使用,1年售后保障,每天仅需1毛

【官方授权 正版激活】: 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...

(0)
blank

相关推荐

  • 详解Element.scrollIntoView()

    详解Element.scrollIntoView()Element.scrollIntoView()方法让当前的元素滚动到浏览器窗口的可视区域内。语法element.scrollIntoView();//等同于element.scrollIntoView(true)element.scrollIntoView(alignToTop);//Boolean型参数element.scrollIntoView(scrollIntoViewOptions);//Object型参数参数alignToTop可选一个Boolean值

  • hackbar常用误区

    hackbar常用误区在web题目中,hackbar使用可以说是非常频繁,但不同hackbar使用上有略微区别.推荐使用googlechrome下的hackbar如果是firefox的话,hackbar有略微缺陷post的数据必须是键值对,不可以直接post数据比如说我想要利用inlcude($_GET)洞利用php://input的时候想要postphpinfo();结果点execute没有反应而googlechrome下的没有问题下面是安装这种非键值对也可以成功…

  • IPV6 阿里DDNS

    IPV6 阿里DDNSIPV6阿里DDAS因为需要在家搭建一套环境,并且需要公网能访问。国内的ipv4的地址,各大运营商基本都不会分配ipv4地址(电信宽带好像有地方可以,但是听说很贵),而且是动态的,每过段时间就会改变。发现移动宽带的公网ipv6地址是可以获取到的,但是也会动态刷新。想稳定访问就加上阿里的ddns的域名访问。###1.准备工作因为宽带接入家里基本是都是需要通过光猫拨号后,再接入路由器。这样就拿不到真实的公网ipv6地址,需要先将光猫中的设置改为桥接模式,再让路由器输入宽带账户和密码拨号。这个过程我调

  • 解析类型后加问号和双问号

    变量定义中类型后带一个问号,意思是这个数据类型是NullAble类型的。用于给变量设初值的时候,给变量(int类型)赋值为null,而不是0!例子: int?i=3等同于Nullab

    2021年12月27日
  • SQL语句多表连接查询语法

    SQL语句多表连接查询语法总结:内连接就是两个表的交集,左外连接就是左边表加两表交集,右外连接就是右边表加两表交集一、外连接1.左连接leftjoin或leftouterjoinSQL语句:select*fromstudentleftjoinscoreonstudent.Num=score.Stu_id;2.右连接rightjoin或r…

  • creo每次都要配置config_电脑config设置

    creo每次都要配置config_电脑config设置前言每个测试用例都应该有config部分,可以配置用例级别。比如name、base_url、variables、verify、export等等案例演示fromhttprunnerimport

发表回复

您的电子邮箱地址不会被公开。

关注全栈程序员社区公众号