programming 1
programming 1
00 Code: F C Assig
T 109 n.
T 108 10
25
07.
Professor: Brizuela, Rafael
Buenos Aires Rosary
Head in charge: Brizuela, Rafael Associate in charge: Hernandez, Alejandro
Attachments: Attachments:
Martinez Jorge Bracamonte, Lucas
Wheel Jorge
Gaston Weingand Assistant:
Battle Nicholas Figueroa, Telma
Martinez Pedro
Cardacci Dario
Mauricio Prince
Rationale
In this subject, you will learn how to store data in dynamic structures and, through the
management of structures learned in structured programming, you will be able to
consolidate the knowledge prior to studying databases in Object-Oriented Programming.
Likewise, in this subject they will have a global vision of the different programming
paradigms.
1
08 Profile items to be developed:
To train for the implementation of these solutions within the problems of man and
society, understanding technological advances.
09. Correlatives
Infinitesimal Calculus I will provide you with the programming foundations to develop the
computerized representation of limits, derivatives and functions using the object-oriented
paradigm.
Computer Systems II will provide you with knowledge of dynamic structures, the basis for
programming in Assembler.
It is linked to the History of Science and Technology for the development of the Initial
Section of Vocational Guidance for first-year students.
From Structured Programming, Computer Systems I, Calculation Laboratory, you will
receive the basic guidelines for its delivery from the point of view of programming, use of
computing resources and mathematical calculations.
Object Oriented Programming, the next-generation language, provides the foundations of
the paradigm.
11. Objectives:
2
Develop the fundamental idea of the object, the properties that define it and the
events that control it.
Understand file access techniques, their management, and the advantages and
disadvantages that each represents.
a) Diagnostic Evaluation.
b) Review:
Vectors and matrices.
Functions and procedures.
c) Required knowledge:
Control structures.
Repetition structures.
Decision structures.
Logical diagram.
Time: 6 Hs.
Unit 1:
CTS Common Type Systems. Value and reference types, Boxing and Unboxing.
The String type. The Date type. Numeric Types. Type conversion. Random number
generation.
Introduction to Forms. MDI Forms. Menus.
Windows Forms Controls. Textbox. Label. Linklabel. Checkbox. Radiobutton. Listbox.
Checkedlistbox. Combobox. DateTimePicker. ListView. Monthcalendar. NotifyIcon.
NumericUpDown. PictureBox. ProgressBar. RadioButton. RichtextBox. ToolTip.
TreeView. WebBrowser. GroupBox. MenuStrip. DataGridView. ColorDialog. FontDialog.
FolderBrowseDialog. OpenFileDialog. SaveFileDialog. PrintDialog. Impression.
Time: 18 hrs
3
Unit 2:
Dynamic structures I
Recursion.
Lists. Fundamentals and classification,
Singly linked lists. Doubly linked lists.
Circular singly linked lists. Circular doubly linked lists.
Operations with lists.
Batteries. Concepts. Battery operations.
Tails. Concepts. Operations with queues.
Time: 18 hrs
Unit 3
Dynamic structures II
Trees, representation, binary trees, their structure, operations with binary trees, traversal of
a binary search tree, operations on binary search trees, balancing a tree.
AVL trees, handling an AVL, representation of a TDA in an AVL tree.
B trees. Operations. Advantages and disadvantages.
Time: 18 Hs.
Unit 4:
Archives
Introduction to file management. Opening files. Reading files. File Writing. Closing files.
Using StreamReader and StreamWriter.
Introduction to the file object system. FSO model. Creating and managing the FSO object.
Working with drives, files, and folders.
Create, read, write, insert, delete and search with binary, random and sequential files.
Index concept.
Time: 6 hrs
Unit 5:
4
Control cut and file matching
Control cut. 1 level control cut. 'n' level control cut. Diagram of the different techniques
and methods of cutting control to a file.
File Pairing. Diagram of the different techniques and methods for matching and managing
files.
Diagram of combined mating and control cutting exercises.
Time: 24 hours
Unit 6:
Programming Styles
Time: 6 Hs.
Classes will be divided into theory and practice. The exercises will reflect the concepts
taught in the theoretical class, plus the knowledge from previous classes, and will be
applied in the resolution of real problematic situations according to the level reached at the
time by the group of students, which will allow the articulation of theoretical and practical
knowledge.
In order to verify the construction and acquisition of knowledge, the active participation of
students will be promoted, hoping that they can formulate solutions to the proposed
problems.
Special attention will be paid to the active participation of students, in order to be able to
rescue the conceptual elaboration they build on the topics covered.
Theory: 50% of class time. Teaching exhibition. Dialogue with students. Sharing. Group
conclusions. Interconsultations. Review of topics. Relation of new topics with knowledge
acquired from the subject and from other related subjects.
Practice: 50% of class time. The exercises should reflect the concepts taught in the
theoretical class, plus the knowledge from previous classes. Exercises will be proposed,
5
which will be solved by groups in some cases and individually in others. Students will
prepare research papers that will include oral presentations.
Student participation will be encouraged in formulating solutions to the proposed problems.
Exercises will be developed that denote a high degree of group relationship to take
advantage of the synergy of interpersonal relationships.
15. Bibliography:
Mandatory:
Harvey Deitel-Paul Deitel, “C# as a program”, Mexico, Pearson Prentice Hall, 2007
Brizuela, Rafael, “Programming Notes I”, Buenos Aires, UAI, 2016.
Ceballos, Fco Javier, “Microsoft C# language and applications”, Mexico, Alfaomega
RA-MA 2008
Nilsson, Nils J. Artificial Intelligence: A New Synthesis.--Madrid: McGraw-Hill, c2001
Additional:
López, Gustavo; Jeder, Ishmael; Vega, Augusto. Analysis and design of algorithms:
implementations in PC and Pascal.-- Mexico City: Alfaomega, 2009
I want Catalinas, Enrique. Programming in structured languages.-- Madrid: Thomson
Editores, 2003. xii, 309 pages
6
Escolano, Francisco; Cazorla, Miguel Angel; Galipienso, Maria Isabel; and others.
Artificial intelligence: models, techniques and areas of application -- Madrid: Thomson
Editores, c2003. Martin, James; Odell, James J. Object-oriented analysis and design --
Mexico City: Prentice Hall Hispanoamericana, c1994. Martin, James; Odell, James J.
Object-oriented methods: fundamental concepts -- Mexico City: Prentice Hall
Hispanoamericana, 1997
Lopez Herranz, Jose; Quero Catalinas, Enrique. Programming fundamentals. 2a. ed.--
Madrid: Paraninfo, c2000.
Lopez Roman, Leobardo. Structured programming: an algorithmic approach. 2a. ed.--
Mexico City: Alfaomega, c2003
Cairó Battistutti, Osvaldo. Programming methodology: algorithms, flowcharts and
programs. 2a. ed.-- Mexico City: Alfaomega, c2003
Partials.
There will be at least two partial exams, each with theory and practice. Both are mandatory,
individual and written. The first of these will take place in the eighth week of the quarter
and the second between the twelfth and fourteenth week. The midterm exams must have
50% correct content to be passed. In this last case the grade must be set between 4 (four)
and 10 (ten) points. If the student does not show up for a partial exam, he/she will be
graded with a failing grade.
Rehabilitative exams.
The make-up exams will be held at a rate of one for each partial exam with theory and
practice. A comprehensive make-up exam may be chosen in justified cases and must be
equivalent to the scope of the individual make-up exams. Those students who obtained a
grade lower than 4 (four) points in any of their partial exams will recover the corresponding
partial exams. The make-up tests are individual and written. The teacher will set the date
for this activity, which may be after each of the midterm exams or on a common date for
everyone. The grades from the make-up exams do not replace the insufficient grades
obtained in the regular exams that are being made up; they will be taken as part of the
grades that are included in the average.
Practical work.
7
The practical work stated in point 14 (practical work) will be carried out. The practical
work in Vb.Net must be defended by the student. The work and defense will be individual
and the evaluation will consist of an average of grades that involve production and
performance. For both practical works, the aspects to be taken into account in said
evaluation are: quality of work, preparation and classification of material, production of
material, quality of defense, use of resources and time management.
Concept note.
The conceptual grade will be based on the student's participation in class, the interest
shown in the subject and the effort shown in the study activities.
8
CONCEPTUAL MAP PROGRAMMING I