Abstract
This chapter focuses on data structures. QuickC is not just a powerful low-level programming tool for developing system type programs. It also provides a rich set of tools or primitives for creating both static and dynamic data structures. Static data structures are the easiest type of structures to design and program. Some common structures in this category are constant strings, arrays, tables, and lists. Once they are defined in a program, static structures never change. In QuickC, one can easily create static data structures using built-in features such as arrays and structures. Dynamic data structures, on the other hand, are more difficult to program. They are needed by programs that must manipulate data that changes in size, such as editors, compilers, and database programs. Some of the more common structures that are in this category include dynamic lists and strings, dynamic arrays, stacks, queues, graphs, and binary trees.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
