-
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
-
optional-project-blackjact
经典数据结构作业,黑杰克游戏。要求程序可以连续打10次,每场比赛的赢家,赢得一个点(两点一倍)。在结束的10场比赛为你和电脑打印出的总奖金。(Write a program that simulates a simplified version of the game "BlackJack". A deck of cards numbered 2 to 10, jacks, queens, kings, and aces is used, where jacks, queens and kings are counted as 10s, and aces are either 1 or 11 at your choice. )
- 2012-12-08 11:46:33下载
- 积分:1
-
B_Tree
B-树的创建、插入、删除等一系列操作!(B-tree creation, insert, delete a series of manipulations!)
- 2020-10-18 18:17:26下载
- 积分:1
-
SeqQueue
数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
- 2013-06-15 16:27:32下载
- 积分:1
-
Prim
编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。
(其中随机生成点和边,形成连通图)
根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
)
- 2011-06-11 16:28:53下载
- 积分:1
-
Is_BST
This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.
- 2012-02-02 05:45:59下载
- 积分:1
-
hash
使用全排列实现hash,看看吧相信对大家会有些帮助的(Full array hash)
- 2011-08-19 21:25:34下载
- 积分:1
-
kruscal_Primspanningtree
最小生成树两种经典算法,kruscal和Prim算法(spanning tree)
- 2010-07-14 10:10:54下载
- 积分:1
-
chazhao
数据结构课程作业,查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)
- 2009-07-08 02:41:51下载
- 积分:1
-
the-shortest-path-of-chart
求有向图的最短路劲,根据所给图的边长和顶点,建立有向图,以邻接表的方式存储,并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart
)
- 2020-07-16 11:28:50下载
- 积分:1