Algoritmo Y Estructura De Datos
TEMARIO CURSO IBM
IBM ACE DESARROLLO DE APLICACIONES E-BUSINESS
INDICE
Programa IBM ACE Desarrollo de Aplicaciones e-business 3
DEPENDENCIAS ENTRE MODULOS 5
DATA STRUCTURES AND ALGORITHMS 6
RDBMS Concepts and SQL 14
Networking Essentials 22
JAVA CORE 30
DB2 UDBProgramming and Stored Procedures 45
SOFTWARE ENGINEERING 57
OOAD (Object-Oriented Analysis and Design) usando UML 63
WEB PROGRAMMING I 72
e-business Technology Fundamentals 75
Enterprise Application Development Using XML 80
Enterprise Java I 88
e-business Security 101
Programa IBM ACE Desarrollo de Aplicaciones e-business
1. Módulo 1: Fundamentos de IT
a. Introducción al Programa deDesarrolladores de aplicaciones e-business
2. Módulo 2: Fundamentos de Programación
a. Estructura de Datos y Algoritmos
b. Fundamentos de RDBMS y SQL
c. Fundamentos de Redes
3. Módulo 3: Programación Orientada a Objetos, Java y Base de Datos
a. Java Básico
b. Programación DB2 UDB y Procedimientos Almacenados
c. Ingeniería de Software
d.Análisis y Diseño Orientado a Objetos usando UML
e. Programación Web I
f. Proyecto # 1 (Caso Práctico incluye temas aprendidos en el módulo)
4. Módulo 4: Desarrollo de Aplicaciones Empresariales
a. Fundamentos de tecnología e-business
b. Java Empresarial I (Servlets y JSP)
c. Desarrollo de Aplicaciones Empresariales usando XML
d. Seguridade-business
e. Proyecto # 2 (Caso Práctico incluye temas aprendidos en el módulo)
Requerimientos de laboratorio
Hardware:
Greater or equal to the following:
• Intel Pentium IV 1600 MHZ or higher recommended.
• SVGA 1024 x 768 recommended minimum.
• 3 GB RAM minimum
• Disk space requirements: 10 GB minimums.
Software:
Greater or equal to the following:• Windows XP
• IBM DB2 9.7 UDB Enterprise Edition
• Firefox 2 or higher or Internet Explorer 6 or higher
• Java SDK 6
• Rational Application Developer 7.5
• Acrobat Reader
DEPENDENCIAS ENTRE MODULOS
[pic]
DATA STRUCTURES AND ALGORITHMS
Duration 14 hours
Purpose
The aim of the course is tointroduce the student to data structures and algorithms used in computing systems. The first part of the course provides an overview of data types and data structures, linked lists, stacks, and queues.
Students will get familiarized with the role of data structures in solving problems and applications using list data structure. Students will learn about the need for linked lists andimplementation of lists as arrays. They will also learn about abstract data type stack and the application of stacks. This course also deals with the implementation of queues as arrays and applications of queues.
The second part of the course deals with graphs as data structures, set representation of graphs and applications of graphs. Students will learn about trees as a data structure andtraversal methods for a binary tree. Students will also get familiarized with sorting techniques and searching techniques.
The course includes several practical sessions to help students get acclimatized to the topics learned in the course.
Objectives
After completing this course, you should be able to:
• Define data types and data structures• Discuss the need for linked lists
• Understand the difference between array and linked implementation of a list
• Explain the stack data structure
• State the applications of stacks
• State the definition of abstract data types queue and implement a queue using an array
• Define graphs and their applications...
Regístrate para leer el documento completo.