• CSE Faculty - Chapter 3: STACK (part b)

    CSE Faculty - Chapter 3: STACK (part b)

    Reversing data items Ex.: Reverse a list. Convert Decimal to Binary. Brackets Parse. Infix to Postfix Transformation. Evaluate a Postfix Expression. Parsing Ex.: Ex.: Postponement of processing data items Backtracking Ex.: Goal Seeking Problem. Knight’s Tour. Exiting a Maze. Eight Queens Problem. .Reverse a list PROBLEM: Read n numbers, print the list in reverse order. Algorithm ReverseList Pre User supplies numbers. Post The...

     37 p cntp 14/12/2012 180 2

  • CSE Faculty - Chapter 3: STACK (part a)

    CSE Faculty - Chapter 3: STACK (part a)

    Contiguous Stack Applications of Stack .Linear List Concepts LIFO (Stack) .Stack ADT DEFINITION: A Stack of elements of type T is a finite sequence of elements of T, in which all insertions and deletions are restricted to one end, called the top. Stack is a Last In - First Out (LIFO) data structure. Basic operations: • Construct a stack, leaving it empty. • Push an element. • Pop an element. • Top an element.

     31 p cntp 14/12/2012 205 2

  • CSE Faculty - Chapter 2 : LIST

    CSE Faculty - Chapter 2 : LIST

    Linear List Concepts List ADT Specifications for List ADT Implementations of List ADT Contiguous List Singly Linked List Other Linked Lists Comparison of Implementations of List Linear List Concepts DEFINITION: Linear List is a data structure where each element of it has a unique successor. element 1 element 2 element 3 .Linear List Concepts (cont.) .Linear List Concepts (cont.) General list: • No restrictions...

     72 p cntp 14/12/2012 231 2

  • Data Structures and Algorithms – C++ Implementation

    Data Structures and Algorithms – C++ Implementation

    BK TP.HCM Ho Chi Minh City University of Technology Faculty of Computer Science and Engineering BK TP.HCM Data Structures and Algorithms – C++ Implementation Huỳnh T n t Email: htdat@cse.hcmut.edu.vn Home Page: http://www.cse.hcmut.edu.vn/~htdat/ .Pointer in C++ Declaration Node *ptr; Create an object ptr = new Node(); A pointer usage printf(“Data in node: %d”, ptr-data); Destroy an object delete ptr; NULL pointer...

     53 p cntp 14/12/2012 231 1

  • CSE Faculty - Chapter 1: Introduction

    CSE Faculty - Chapter 1: Introduction

    What is an algorithm? The logical steps to solve a problem. What is a program? Program = Data structures + Algorithms (Niklaus Wirth) The most common tool to define algorithms. • English-like representation of the code required for an algorithm. Pseudocode = English + Code relaxed syntax being instructions using easy to read basic control structures (sequential, conditional, iterative)

     49 p cntp 14/12/2012 266 2

  • C++ GUI Programming with Qt 3

    C++ GUI Programming with Qt 3

    Why Qt? Why do programmers like us choose Qt? Sure, there are the obvious answers: Qt’s single-source compatibility, its feature richness, its C++ performance, the availability of the source code, its documentation, the high-quality technical support,and all the other items mentioned in Trolltech’s glossy marketing materials. This is all very well, but it misses the most important point: Qt is successful because programmers like it.

     464 p cntp 14/12/2012 211 1

  • Module6 – Internationalization (I18N)

    Module6 – Internationalization (I18N)

    Welcome to the module, Internationalization. This module provides a brief introduction of developing applications for the global market. The module covers the process of internationalization and localization to create applications, which are neutral in terms of countries, languages and regions. Internationalized applications require meticulous planning, failing which re-engineering of the application can be costly. In this module, you will...

     11 p cntp 14/12/2012 211 1

  • Programming Entity Framework: Code First

    Programming Entity Framework: Code First

    Microsoft’s ADO.NET Entity Framework, known widely as EF, introduced out-of-thebox Object Relational Mapping to .NET and Visual Studio. Central to Entity Framework was the Entity Data Model, a conceptual model of your application domain that maps back to the schema of your database. This conceptual model describes the core classes in your application. Entity Framework uses this conceptual model while querying from the database, creating...

     192 p cntp 14/12/2012 186 1

  • Computer Science and Artificial Intelligence

    Computer Science and Artificial Intelligence

    The Panel on Computer Science and Artificial Intelligence was established in early 1992 by the Naval Studies Board (NSB) of the National Research Council in response to a request from the Naval Research Laboratory (NRL). The NRL called on the NSB to establish a panel of experts in the fields of computer science and artificial intelligence to interact informally with the laboratory's research staff regarding plans, facilities, capabilities,...

     30 p cntp 14/12/2012 164 3

  • Computer Science Reflections on the Field, Reflections from the Field

    Computer Science Reflections on the Field, Reflections from the Field

    The blossoming of computer science (CS) research is evident in the information technology that has migrated from a specialized tool confined to the laboratory or corporate back office to a ubiquitous presence in machines and devices that now figure in the lives of virtually every individual. This widespread diffusion of information technology can obscure the nature of computer science research underlying the IT— from the perspective of many...

     209 p cntp 14/12/2012 228 1

  • CSE Faculty - Chapter 12

    CSE Faculty - Chapter 12

    Lexicographic Search Trees: Tries Multiway Trees B-Tree, B*-Tree, B+-Tree Red-Black Trees (BST and B-Tree) 2-d Tree, k-d Tree 1 .Basic Concepts 2 .Basic Concepts 3 .Trees

     44 p cntp 14/12/2012 257 2

  • CSE Faculty - Chapter 10 Sorting

    CSE Faculty -  Chapter 10 Sorting

    Sorting Divice-andConquer •Natural Merge •Balanced Merge •Polyphase Merge •Insertion •Shell •Selection •Heap •Bubble •Quick •Quick •Merge

     60 p cntp 14/12/2012 213 2

Hướng dẫn khai thác thư viện số