各大公司电子类招聘题目精选!!!各大公司电子类招聘题目精选
标签: 电子类
上传时间: 2016-04-07
上传用户:dreamboy36
JAVA 笔试题目及答案集锦 还有一些的答案没做出来,望有人能补全
上传时间: 2013-12-19
上传用户:love_stanford
软件设计师认证考试的历年题目,包括答案,一个.CHM文件
标签: 软件设计
上传时间: 2016-04-13
上传用户:ynzfm
一共有8道面试中最有可能问到的编程题目,包括数组、指针、串方面的灵活运用的知识。
标签: 编程
上传时间: 2014-01-25
上传用户:bcjtao
嵌入式或LINUX相关研发面试题目,也是学习嵌入式系统的精典资料
上传时间: 2016-04-18
上传用户:gyq
北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime numbers. 20 = 3 + 17 = 7 + 13. 42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23. Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.) Anyway, your task is now to verify Goldbach s conjecture for all even numbers less than a million.
标签: mathematician Christian Goldbach Leonhard
上传时间: 2016-04-22
上传用户:wangchong
北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as "What are the minimum and maximum numbers in the subtree whose root node is X?" Please try to find answers for there queries.
标签: the Consider infinite numbers
上传时间: 2013-12-16
上传用户:日光微澜
北京大学ACM比赛题目 Write a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter (but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown.
标签: CAPITAL LETTERS program Write
上传时间: 2014-01-17
上传用户:410805624
北大ACM在线做题网站的部分题目答案。代码为c++原码。
上传时间: 2013-12-27
上传用户:z1191176801
爱因斯坦在20世纪初出的IQ测试题 题目 在一条街上,有5座房子,喷了五种颜色,每个房子里住着不同国籍的人,每个人喝不同的饮料,抽不同品牌 的香烟,养不同的宠物。 提示 1、英国人住红色房子 2、瑞典人养狗 3、丹麦人喝茶 4、绿色房子在白色房子左面 5、绿色房子主人喝咖啡 6、抽Pall Mall香烟的人养鸟 7、黄色房子主人抽Dunhill香烟 8、住在中间房子的人喝牛奶 9、挪威人住第一间房 10、抽Blends香烟的人住在养猫的人隔壁 11、养马的人住抽Dunhill香烟的人隔壁 12、抽Blue Master的人喝啤酒 13、德国人抽Prince香烟 14、挪威人住蓝色房子隔壁 15、抽Blends香烟的人有一个喝水的邻居 问题是:谁养鱼?问题补充:他说世界上有98%的人答不出来,你是那2%里面的吗? 的程序实现方法
上传时间: 2014-01-09
上传用户:王庆才