﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-逆水行舟-随笔分类-笔试总结</title><link>http://www.cppblog.com/yearner/category/4822.html</link><description>智慧需要点滴的积累</description><language>zh-cn</language><lastBuildDate>Fri, 30 May 2008 02:52:09 GMT</lastBuildDate><pubDate>Fri, 30 May 2008 02:52:09 GMT</pubDate><ttl>60</ttl><item><title>微软面试经历</title><link>http://www.cppblog.com/yearner/archive/2008/05/29/51515.html</link><dc:creator>(Leyn)顽主</dc:creator><author>(Leyn)顽主</author><pubDate>Thu, 29 May 2008 12:36:00 GMT</pubDate><guid>http://www.cppblog.com/yearner/archive/2008/05/29/51515.html</guid><wfw:comment>http://www.cppblog.com/yearner/comments/51515.html</wfw:comment><comments>http://www.cppblog.com/yearner/archive/2008/05/29/51515.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/yearner/comments/commentRss/51515.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yearner/services/trackbacks/51515.html</trackback:ping><description><![CDATA[大概12点多到了西格玛，提前十分钟到了4楼前台，纳闷前台怎么都是男保安呢，可能看惯了前台美女的原因吧。之后一个面试官领着去了个休息间，还很客气的让我随便享用柜台上的水果，感觉比较舒服。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 接着面试官给我发了一沓纸，其中一张是试题，三张钉在一起的是参考资料，主要是范式的说明，其他都是草纸。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 题目不多，总共五道，但都比较典型。前三题是c++基础，4题要求写范式，5题数据库。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 第一题：<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 编写字符串转换int型的函数，int atoi(char* str) ，例如输入字符"123"输出int 型数据。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;1.&nbsp;要求不能使用库函数2.尽可能多地考虑特殊情况<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 这道题主要考察了对各种情况考虑是否全面，考虑正负号，非法字符，空格的处理，小数点的处理。尽量一次循环搞定。其中小数点后的非法字符按直接略掉处理。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 第二题：<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;编写函数完成字符串的反转 node * reverse(node * head)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;这个比较简单，但注意头指针不在反转范围内，这个是在技术面的时侯，面试官手把手的告诉我的:)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 第三题<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;完成函数 char * strtok(char *s ,char delim) 把字符串从delim处split.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;也比较简单<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;第四题<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; write Regulation expression according to the reference.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;1, get all the url from the "<a href="http://www.adomid.com/">www.adomid.com</a>"<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;2. write regulation expression for the following url:&nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<a href="http://www.microsoft.com/production/id=123&amp;reviewOid=1985&amp;custom=257">http://www.microsoft.com/production/id=123&amp;reviewOid=1985&amp;custom=257</a><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <a href="http://www.microsoft.com/production/id=5343&amp;reviewOid=1431&amp;custom=222"><u><font color="#0000ff">http://www.microsoft.com/production/id=5343&amp;reviewOid=1431</font></u></a><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<a href="http://www.microsoft.com/production/id=6576&amp;reviewOid=31614&amp;custom=412">http://www.microsoft.com/production/id=6576&amp;reviewOid=31614&amp;custom=412</a>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <a href="http://www.microsoft.com/production/id=234&amp;reviewOid=43134&amp;custom=22"><u><font color="#0000ff">http://www.microsoft.com/production/id=234&amp;reviewOid=43134&amp;custom=22</font></u></a><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;2write regulation expression&nbsp;for the email address.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;这道题有参考，所有的范式表达式都有reference,只需读懂了材料比较简单。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;第五题<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 数据库题<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; design a database for user to borrow or return books from the library.the database should function as follow:<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;1)the user can borrow several copies of the same&nbsp;book<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;2)when the book&nbsp;borrowed&nbsp;, the time should be recorded.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 3)the user should register in the system to get the authority for the logining in.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; write sql sentence for the follow question:<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1) insert a new record when a book borrowed/returned.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;2) get all the&nbsp;users ,which&nbsp;does not return book.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;3) get all the books ,which are never borrowed.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;3) get the books which have been borrowed for more than 10 times.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;题目就是这样。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;大概作了一个小时，来了个男面试官，收走试卷，让我等。旁边有俩哥们是同来面试的，聊了两句，他俩竟是微软别的部门推来面试的，属于赋闲等待再就业的。正暗自比较与这俩哥们的差距，面试官来了，让我留下，竟把那俩哥们直接拒了，有些庆幸，调整心态。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 这个面试官主要针对所答的试题面试，不断指正我试卷上的错误和遗漏点，并且给我时间改正。讨论了一会，其间也问我问题。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 然后他走后，接待我的那个女面试官抱着笔记本过来。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 我俩先聊了一下，我借机问了几个问题。然后我就给她讲我的一些经历。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 她给我一份资料，是关于人工对网页进行分类的说明，告诉我看过后可以问问题，然后打开笔记本让我对指定的网页分类。大概是按照网页的功能分成了五类，<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 最后的面试官比较年轻，问了个关于Hash 表的问题，然后看了我的简历，问了个ajax的问题。<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 那个hash table&nbsp;问题不是直接问的：<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 文件里存在字典列表，找出字母正好相反的单词，比如 dog ,god&nbsp;;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <br><br><br><br><br><br><br><br><br><br><img src ="http://www.cppblog.com/yearner/aggbug/51515.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yearner/" target="_blank">(Leyn)顽主</a> 2008-05-29 20:36 <a href="http://www.cppblog.com/yearner/archive/2008/05/29/51515.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>