Search results for "Java"
Items we need to order for you
R 4,030.00
R 788.00
R 327.00
R 367.00
R 3,908.00
R 762.00
R 1,527.00
R 1,527.00
R 841.00
R 733.00
Data Structures and Algorithms in Java
Learn with confidence with this hands-on undergraduate textbook for CS2 courses. Active-learning and real-world projects underpin each chapter, briefly reviewing programming fundamentals then progressing to core data structures and algorithms topics including recursion, lists, stacks, trees, graphs, sorting, and complexity analysis. Creative projects and applications put theoretical concepts into practice, helping students master the fundamentals. Dedicated project chapters supply further programming practice using real-world, interdisciplinary problems which students can showcase in their own online portfolios. Example Interview Questions sections prepare students for job applications. The pedagogy supports self-directed and skills-based learning with over 250 'Try It Yourself' boxes, many with solutions provided, and over 500 progressively challenging end-of-chapter questions. Written in a clear and engaging style, this textbook is a complete resource for teaching the fundamental skills that today's students need. Instructor resources are available online, including a test bank, solutions manual, and sample code.
R 2,707.00
R 1,221.00
R 916.00
R 766.00
R 1,527.00
R 839.00
R 1,757.48
GI — 9. Jahrestagung
In the field of programming language description, it is widely accepted that van-Wi1ngaarden grammars (vWGs, [Ba72), [A68R) provide a powerful and yet simple formalism to describe the syntax and context conditions of programming languages. (See, for instance, the comparison of definition techniques given in [MBL76).) However, vWGs cannot be used for automatic compiler generation, since the "referencing problem" [K074) is not decidable in general. Several proposals have been made to restrict vWGs to decidable subclasses that are suited for automatic parser generation, for example [Ba72), [De7S), [KS77), and [We78). Extended Affix grammars (EAGs, defined in [Wa7S) are of particular interest, since they fill the gap between Two-Level language description in vWG-style, and more compiler-oriented description tools, such as affix grammars (AGs, [K07I), and attribute grammars (AttrGs, [Kn68): EAGs preserve most of the descriptive properties of vWGs, but allow to generate parsers that are as efficient as those generated from AGs and AttrGs. The EAGLE project is a compiler generator project aiming at using EAG language descriptions for automatic compiler generation.One of the sub tasks is to develop a notation which resembles vWGs as closely as possible [FHS78), so that it may serve as a appropriate descriptive tool for both languages and compilers. In the following, we describe a result which liberates the notation of EAGs from all explicit "data flow information".
R 1,996.97
R 696.00
R 2,116.85
R 1,774.78
