標(biāo)題: Titlebook: C++; Object-Oriented Data Saumyendra Sengupta,Carl Phillip Korobkin Textbook 1994 Springer Science+Business Media New York 1994 C programmi [打印本頁] 作者: foresight 時間: 2025-3-21 19:46
書目名稱C++影響因子(影響力)
書目名稱C++影響因子(影響力)學(xué)科排名
書目名稱C++網(wǎng)絡(luò)公開度
書目名稱C++網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱C++被引頻次
書目名稱C++被引頻次學(xué)科排名
書目名稱C++年度引用
書目名稱C++年度引用學(xué)科排名
書目名稱C++讀者反饋
書目名稱C++讀者反饋學(xué)科排名
作者: 知識分子 時間: 2025-3-21 21:11
https://doi.org/10.1007/978-981-16-5505-0s, and overloaded operators. While it is assumed that the reader has a working knowledge of the C and C++ programming languages, a discussion of some of the key concepts used extensively throughout this text is presented here as a review. The reader is referred to AT&T manuals [ATT89] and [ATT91], Weiskamp [WF90].作者: grovel 時間: 2025-3-22 04:27 作者: 中國紀(jì)念碑 時間: 2025-3-22 07:52
Micro-Newton Thruster Test Facility, access to the data. However, for applications in need of a higher degree of . access to the data, the list object can prove to be ineffective. In this chapter, the . object is introduced to fulfill such requirements.作者: BRACE 時間: 2025-3-22 11:06
Micro-Newton Thruster Test Facility,pon which all insert, delete, and general query operations are based. All attributes of a record, aside from the designated key, are processed as .. In the present chapter, these concepts are extended to a treatment of search tree and search trie structures that provide for ..作者: 喃喃訴苦 時間: 2025-3-22 15:39 作者: 喃喃訴苦 時間: 2025-3-22 18:18
Recursion,ations for which solutions can be devised as a process of dividing the given problem into a series of smaller and similar subproblems, each requiring the same procedural steps and stopping criterion. Recursive techniques are not always applicable or may be too costly to consider — in such situations, . (nonrecursive) solutions are best.作者: multiply 時間: 2025-3-23 00:56 作者: MUMP 時間: 2025-3-23 04:03
Multidimensional Search Trees and Search Tries,pon which all insert, delete, and general query operations are based. All attributes of a record, aside from the designated key, are processed as .. In the present chapter, these concepts are extended to a treatment of search tree and search trie structures that provide for ..作者: Infraction 時間: 2025-3-23 08:36 作者: 圓錐體 時間: 2025-3-23 10:06 作者: 肌肉 時間: 2025-3-23 15:08
https://doi.org/10.1007/978-3-642-45678-7se is used to convey the basic ideas such that it can be adapted to any modification to suit an application. This application forms a B-tree object from an array of keys, and demonstrates the message-passing technique between a people_ld database object pdb_obj and a B-tree object btree_obj.作者: Bone-Scan 時間: 2025-3-23 18:41
The Strange Case of the Green Children,ure. For the purpose of sorting and searching, each data object contains an uniform key (often called a .), which is used to perform these operations. The searching based on multiple (primary and secondary) keys will be discussed in Chapter 9.作者: 寄生蟲 時間: 2025-3-23 23:46
Sorting and Searching,ure. For the purpose of sorting and searching, each data object contains an uniform key (often called a .), which is used to perform these operations. The searching based on multiple (primary and secondary) keys will be discussed in Chapter 9.作者: microscopic 時間: 2025-3-24 02:30 作者: 明智的人 時間: 2025-3-24 08:10
Recursion,y to elegant, compact, and readily maintainable programs. A characteristic situation where recursive programming techniques are useful involves applications for which solutions can be devised as a process of dividing the given problem into a series of smaller and similar subproblems, each requiring 作者: ostrish 時間: 2025-3-24 12:40
Stacks and Queues,ist structure. That is, a general list object provides for random access of its data elements. This flexibility, however, is realized at the expense of having to either explicitly rearrange the data elements or maintain a potentially complicated data linking structure.作者: collagen 時間: 2025-3-24 15:21
Sorting and Searching, (to be discussed later). Such basic operations as insertion, deletion, and even searching for these objects were discussed and implemented. A wise selection of one or more such objects for an application is influenced by the efficiency of sorting or searching or both operations. In this chapter, we作者: 不能逃避 時間: 2025-3-24 23:00
Trees and Tries,location provide a considerable amount of flexibility over their static counterparts. Linear linked lists are useful for applications requiring fast . access to the data. However, for applications in need of a higher degree of . access to the data, the list object can prove to be ineffective. In thi作者: ambivalence 時間: 2025-3-25 00:54 作者: sclera 時間: 2025-3-25 03:35
An Object-Oriented Database with B-Trees,cture for external searching, and sorting, and database programming. The efficiency and usefulness of the B-tree lie in its important features — balanced, ordered multiple keys in a single node, grouping of keys, and its controlled growth. In this chapter, the simple object-oriented people_ld databa作者: Type-1-Diabetes 時間: 2025-3-25 11:30
Applications in Image Processing, Computer Graphics, and Computer-Aided Design,CAD), and computer graphics. Four applications are presented, two employing comparative-based multidimensional search trees and two employing digital-based multidimensional search tries. All four are applications of spatial data structures.作者: 秘方藥 時間: 2025-3-25 13:27
Textbook 1994oriented programming (OOP) methodologies are employed to im- plement these ADT concepts. In OOP, data and operations for an ADT are combined into a single entity (object). ADTs are used to specifiy the objects-arrays, stacks, queues, trees, and graphs. OOP allows the pro- grammer to more closely mim作者: 欺騙世家 時間: 2025-3-25 19:24 作者: ATRIA 時間: 2025-3-25 22:40 作者: Coronary 時間: 2025-3-26 01:58
978-1-4612-7618-0Springer Science+Business Media New York 1994作者: modifier 時間: 2025-3-26 06:34 作者: STALE 時間: 2025-3-26 12:18 作者: albuminuria 時間: 2025-3-26 14:48
Lecture Notes in Production EngineeringAn ordered or . is a collection of data elements organized and accessed in an . sequential fashion. It is a fundamental structure upon which a wide variety of more complex data structures are built.作者: 鴕鳥 時間: 2025-3-26 17:56
Guozheng Ma,Shuying Chen,Haidou WangFor the list object, introduced in Chapter 5, it was shown that each data element contains at most one predecessor element and one successor element. Therefore, for any given data element or node in the list structure, we can talk in terms of a . element and a . element.作者: 繁重 時間: 2025-3-26 23:49 作者: 出汗 時間: 2025-3-27 03:09 作者: orthopedist 時間: 2025-3-27 07:14
Lists,An ordered or . is a collection of data elements organized and accessed in an . sequential fashion. It is a fundamental structure upon which a wide variety of more complex data structures are built.作者: CRAMP 時間: 2025-3-27 13:06 作者: surmount 時間: 2025-3-27 15:00 作者: NORM 時間: 2025-3-27 20:51
https://doi.org/10.1007/978-3-642-30916-8y to elegant, compact, and readily maintainable programs. A characteristic situation where recursive programming techniques are useful involves applications for which solutions can be devised as a process of dividing the given problem into a series of smaller and similar subproblems, each requiring 作者: Cardioplegia 時間: 2025-3-27 23:26 作者: 天氣 時間: 2025-3-28 05:58 作者: stress-response 時間: 2025-3-28 07:26
Micro-Newton Thruster Test Facility,location provide a considerable amount of flexibility over their static counterparts. Linear linked lists are useful for applications requiring fast . access to the data. However, for applications in need of a higher degree of . access to the data, the list object can prove to be ineffective. In thi作者: 猜忌 時間: 2025-3-28 10:55
Micro-Newton Thruster Test Facility,is of a single or . key. That is, for a given set of data objects or records, each record contains a single element or attribute designated as . key upon which all insert, delete, and general query operations are based. All attributes of a record, aside from the designated key, are processed as .. I作者: Calibrate 時間: 2025-3-28 17:40
https://doi.org/10.1007/978-3-642-45678-7cture for external searching, and sorting, and database programming. The efficiency and usefulness of the B-tree lie in its important features — balanced, ordered multiple keys in a single node, grouping of keys, and its controlled growth. In this chapter, the simple object-oriented people_ld databa作者: choleretic 時間: 2025-3-28 21:39
https://doi.org/10.1007/978-3-642-45678-7CAD), and computer graphics. Four applications are presented, two employing comparative-based multidimensional search trees and two employing digital-based multidimensional search tries. All four are applications of spatial data structures.作者: Geyser 時間: 2025-3-29 00:29 作者: 清唱劇 時間: 2025-3-29 05:43 作者: 蜿蜒而流 時間: 2025-3-29 09:26
http://image.papertrans.cn/c/image/220042.jpg作者: Notorious 時間: 2025-3-29 14:15
Stacks and Queues,ist structure. That is, a general list object provides for random access of its data elements. This flexibility, however, is realized at the expense of having to either explicitly rearrange the data elements or maintain a potentially complicated data linking structure.作者: 串通 時間: 2025-3-29 17:39 作者: 慌張 時間: 2025-3-29 21:42
9樓作者: OATH 時間: 2025-3-30 03:16
9樓作者: meditation 時間: 2025-3-30 06:50
10樓作者: synovitis 時間: 2025-3-30 10:29
10樓作者: 學(xué)術(shù)討論會 時間: 2025-3-30 14:05
10樓作者: 極力證明 時間: 2025-3-30 18:40
10樓
