THE UNIVERSITY OF NEW SOUTH WALES
THE UNIVERSITY OF NEW SOUTH WALES
复制标题
DOI：
10.5694/j.1326-5377.1962.tb20121.x
复制
发表时间：
1962-01
影响因子：
11.4
通讯作者：
H. Baz;M. Noureldin;Yildiray Cinar;Guy Allinson
中科院分区：
文献类型：
--
作者：
H. Baz;M. Noureldin;Yildiray Cinar;Guy Allinson
数据类型列表，stacl<s，队列，树。在程序语言（Modula-2或C）中使用链接结构实现。搜索和分类。函数式编程入门。计算机、指令集、执行周期、数据存储、汇编语言程序设计的分层模型。实验：编程作业。COMP 2011数据组织工作人员联系人：Dr G Whale CP 15 S1或S2 L3 T2前提条件：C 0 MP 1021或C 0 MP 1821注：排除6.641。数据类型和数据结构：抽象和表示;字典，优先级队列和图; AVL树，splay树，B树，堆。文件结构：存储设备特征，键，索引，哈希。内存管理。实验：编程作业包括小组项目。COMP 2021数字系统结构工作人员联系人：Dr G Heiser CP 15 S1或S2 L3 T2先决条件：C 0 MP 1021或C 0 MP 1821注：排除ELEC 2012。数字系统：开关和门，布尔代数，最小化技术，组合和顺序设计，时序分析，有限状态机;分析，设计和实现适度的数字子系统，理解模型计算机中的主要子系统。汇编语言编程：使用汇编程序作为目标，将更高级的编程抽象和数据结构转换为真实的计算机;研究编程模型和计算机硬件模型之间的关系;理解指令执行。实验：带回家的工具包;编程作业。COIMP 2031并发计算工作人员联系人：A Sowmya博士CP 15 S1或S2 L3 T2先决条件：C 0 MP 1021或C 0 MP 1821进程模型：顺序与并行计算。进程间和同步机制：协同程序，消息传递，缓冲区，管道，远程过程调用，信号量，监视器。资源共享、互斥、死锁、活锁、调度。分布式算法：死锁检测，终止检测。数据传输协议。实验：编程作业。计算机科学与工程
data types. Lists, stacl<s, queues, trees. Implementation In a procedural language (Modula-2 or C) using linked structures. Searching and sorting. Introduction to functional programming. The layered model of a computer, instruction set, execution cycle, data storage, assembly language programming. Lab: programming assignments. COMP2011 Data Organisation Staff Contact: Dr G Whale CP15S1 orS2L3T2 Prerequisite: C0MP1021 or C0MP1821 Note/s: Excluded 6.641. Data types and data structures: abstractions and representations; dictionaries, priority queues and graphs; AVL trees, splay trees, B-trees, Heaps. File Structures: storage device characteristics, keys, indexes, hashing. Memory management. Lab: programming assignments Including group project. COMP2021 Digital System Structures Staff Contact: Dr G Heiser CP15S1 orS2L3T2 Prerequisite: C0MP1021 or C0MP1821 Note/s: Excluded ELEC2012. Digital systems: switches and gates, boolean algebra, minimisation techniques, combinational and sequential design, timing analysis, finite state machines; analysis, design and realisation of modest digital subsystems, understanding major subsystems in a model computer. Assembly language programming: translation of higher level programming abstractions and data structures to a real computer using an assembler as a target; study of the relationships between the programming model and the hardware model of a computer; understanding of instruction execution. Lab: take-home kits; programming assignments. COIMP2031 Concurrent Computing Staff Contact: Dr A Sowmya CP15S1 orS2L3T2 Prerequisite: C0MP1021 or C0MP1821 The process model: sequential versus parallel computation. Interprocess and synchronisation mechanisms: coroutines, message passing, buffers, pipes, remote procedure calls, semaphores, monitors. Resource sharing, exclusion, deadlock, livelock, scheduling. Distributed algorithms: detection of deadlock, detection of termination. Protocols for data transfer. Lab: programming assignments. Computer Science and Engineering Level lil