-
PROGRAM
本书是《程序员面试宝典》的第三版,在保留第二版的数据结构、面向对象、程序设计等主干的基础上,使用各大IT公司及相关企业最新面试题替换和补充原内容,以反映自第一版以来近几年时间所发生的变化。 欧立奇、刘洋、段韬编著的《程序员面试宝典》取材于各大公司面试真题(笔试、口试、电话面试、英语面试,以及逻辑测试和智商测试),详细分析了应聘程序员(含网络、测试等)职位的常见考点。本书不仅对传统的C系语言考点做了详尽解说,还根据外企出题最新特点,新增加了对友元、Static、图形/音频、树、栈、ERP等问题的深入讲解。最后本书着力讲述了如何进行英语面试和电话面试,并对求职中签约、毁约的注意事项及群体面试进行了解析。本书的面试题除了有详细解析和答案外,对相关知识点还有扩展说明。真正做到了由点成线,举一反三,对读者从求职就业到提升计算机专业知识都有显著帮助。 《程序员面试宝典》适合计算机相关专业应届毕业生阅读,也适合作为正在应聘软件行业的相关就业人员和计算机爱好者的参考书。(This book is the" canon" in the third edition, retained in the second version of the data structure, object-oriented program design, main basis, the use of each big IT companies and related enterprises to the latest interview questions substitution and supplement the original content, in order to reflect the since its first edition in recent years since time changes. Ou Liqi, Liu Yang, Duan Tao," canon" drawn from major companies interview questions ( written examination, interview, telephone interview, interview, and logical test and IQ test ), a detailed analysis of the application programmer (including network, testing ) positions of the common points. This book not only to the traditional C language test done a detailed explanation, according to the new characteristics of the new foreign title, added to the friend, Static, graphics/audio, tree, stack, ERP issues in depth explanation. The last book on described how the English interview and telephone interview, and the job of signin)
- 2012-03-21 11:28:19下载
- 积分:1
-
2.2
已知线性表中的元素以值递增有序排列,并以单链表作存储结构。试写一高效的算法,删除表中所有值大于mink且小于maxk的元素(若表中存在这样的元素)同时释放被删结点空间,并分析你的算法的时间复杂度(注意:mink和maxk是给定的两个参变量,它们的值可以和表中的元素相同,也可以不同)。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values and elements in the table can be the same or different).)
- 2015-04-11 23:11:41下载
- 积分:1
-
tcpip
以太网首部的一个c语言程序,代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)
- 2013-03-26 11:49:23下载
- 积分:1
-
Bigint
利用双向链表实现对两大整数的相加运算。
可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
- 2007-10-18 21:34:06下载
- 积分:1
-
5100309373_2_9
数据结构习题答案,线性链表的实现与适用,数据结构:思想与实现2-9(Data structure exercises answer, linear linked list implementations with applicable data structure: Ideas and Implementation 2-9)
- 2012-11-23 11:12:48下载
- 积分:1
-
111
八皇后问题,用C语言实现,在VC++6.0环境中可以运行!92种答案(Eight queens problem)
- 2012-06-18 21:02:54下载
- 积分:1
-
LStack
堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)
- 2012-03-26 08:35:26下载
- 积分:1
-
findpt
VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)
- 2013-05-17 15:38:23下载
- 积分:1
-
1_1
最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )
- 2009-09-13 22:45:01下载
- 积分:1
-
B_Tree
B-树的创建、插入、删除等一系列操作!(B-tree creation, insert, delete a series of manipulations!)
- 2020-10-18 18:17:26下载
- 积分:1