Software List

DR. AURELIO MENDOZA MEMORIAL COLLEGESIpil, Zamboanga Sibugay

List of Computer Software in Computer Laboratory

SoftwareDescriptionCategory

MS Office 2007Microsoft Office PackageOffice Package

(Word, Excel, Powerpoint, Access)

MS Window 7Microsoft Windows Operating SystemOperating System

MS Visual Basic 6.0Microsoft Visual Basic 6.0 IDEProgrammingIDE

MS Visual Studio 2008Microsoft Visual Studio DOTNET IDE

CodelobsterHTML, Javascript, PHP, CSS IDE

TopstylerHTML, Javascript, PHP, CSS IDE

B4ABasic Android Programming

EclipseAndroid Programming IDE

Construct 2Web-Base/2D Game Programming

XAMPP 7.4.2Server Application for Apache, MySQL, MercuryServer Application

MS SQL EXPRESS 2005Server DatabaseDatabase

MySQL 5.6MySQL Server Community EditionDatabase

SQLiteSQLite DatabaseDatabase

MySQL OBDC DriverMySQL Driver ConnectionProgramming Tools

Adobe Acrobat ReaderAdobe Acrobat PDF ReaderPDF Reader

Mozilla FirefoxMozilla Web BrowserWeb Browser

Google ChromeGoogle Web BrowserWeb Browser

Prepared by:

Lim, Christopher M.


COURSE SYLLABUSCourse No: ICT Elective 4Course Title: CompilerCourse Credit: 3Course Description:This course studies the principles of programming languages with an emphasis on programming language implementation and compiler design. This includes various techniques for describing and defining a language, as well as techniques for implementing compilers. The course is centered on a large programming project-the construction of a complete compiler for a small programming language-which will be completed over the two term sequence CS 321 and CS 322. Topics to be covered over the two terms include: lexical analysis, syntactic analysis, recursive descent parsing, LR parsing, syntax-directed translation, type checking, run-time environments, code generation, code optimization, and various language design issues.Contact Hours/Week: 3Pre-requisite: Discreet Math, Operating System, Automata Language Theory, Data Structures, Computer Organization.Learning Outcomes/Course Objective: LO1 = Understand the theory and practice of compilers, interpreters, assemblers, linkers, and loaders, and be able to work effectively with such programs. LO2 =Be able to design and implement parsers and language translators for simple languages. LO3 = Appreciate the effects of decisions in programming language and computer architecture designon the translation process and runtime system. LO4 = Have experience with the design and implementation of large and complex programs using Java. LO5 = Retain knowledge of compilation techniques in preparation for advanced courses in compilersand/or other advanced computer science studies.

Course Outline: Introduction: Compilers and Interpreters, overview of the translation process, motivation Specification of programming languagesComponents and structure of the translation process Reminder of key Java concepts Syntactic Analysis Semantic analysis Runtime organization Code generation Virtual Machines and Interpretation

Major Course Output:LORequire OutputDue Date

LO1MCO1 = Create a Contextfree grammars and parsingEnd of Prelim

LO2MCO2= Objectoriented execution: inheritance and virtual method invocationEnd of Midterm

LO3MCO3 = Procedure invocation and parameter passingEnd of Pre-Final

LO4/LO5MCO4/5 = Case StudyEnd of Final

Other Requirements and assessment:Presentation of Output and Major Exams.

Grading System:To pass this course, one must accumulate at least 60 points through the course requirements discuss above. The maximum points that a student can obtain through each requirement are shown below.Requirements/Assessment TaskMaximum Points

Major Exam20

Case Study and Report50

Class Participation, Seatwork, and Assignments30

TOTAL100

Learning PlanLOTopics and ReadingClass ScheduleLearning Activities

LO1 Compilers and Interpreters, overview of the translation process, motivation. Contextfree grammars and parsing Topdown and bottomup parsing Recursive descent parsers Lexical analysis Abstract syntax trees (AST)

Week 1-4DiscussionHands on DemonstrationExercises

LO2 Storage and execution model Data representation and access Storage allocation and management Procedure activation records and parameter passing Objectoriented execution: inheritance and virtual method invocation Week 5 - 7DiscussionHands on DemonstrationExercises

LO3 Stack and registerbased code generation Address generation Expression evaluation Procedure invocation and parameter passingWeek 8 - 9DiscussionHands on DemonstrationExercises

LO4 Virtual machine principles Interpreter organizationWeek 10 -14DiscussionHands on DemonstrationExercises

LO5Case StudyWeek 15Presentation


COURSE SYLLABUS

Course No: ICT 4Course Title: Data Structure and AlgorithmCourse Credit: 3Course Description: The course covers the standard data representation and algorithm to solve computing problems efficiently (with respect to space requirements and time complexity of algorithm). This covers the following: Stacks Queues, Trees, Graphs, Maps, and Sets. Thorough discussion of sorting and searching algorithm and hashing is covered.Contact Hours/Week: 3Pre-requisite: ICT 1 Computer Fundamentals & ICT 3 Computer Programming 2 Learning Outcomes/Course Objective: By the end of the course, students should be able to: LO1 = Design, implement, test, and debug a program based on the given specification, that uses and implements abstract data types (Stacks Queues, Trees, Graphs, Maps, and Sets). LO2 = Argue strengths and weaknesses among multiple implementations for a problems (i.e., on the aspect of iterative vs. recursive solution and on the aspects of abstraction, encapsulation, and information hiding).Each of this LOs addresses the Degree Graduate Outcome as follows: Articulate and discuss the latest developments in the specific field of practice. (Philippine Qualification Framework (PQF) level 6 descriptor). Effectively communicate orally and in writing using both English and Filipino. Act in recognition of professional, social, and ethical responsibility. Apply computing and other knowledge domain to address real-world problems. Utilize modern computing tools

Course Outline: Course administration Review: data structure concepts, arrays, simple linked lists, different implementations of lists, binarytrees Introduction to complexity:O-notation Stacks and queues Sets, including union/find algorithms Recursion and backtracking Sorting and searching Balanced trees Heaps, priority queues, heapsort Dictionaries/maps, hashing Graphs

Major Course Outputs:As evidence of attaining the above learning outcomes, students are required to do and submit the following during the indicated dates of the term. The rubrics for these outputs are provided.

Learning Outcomes

Required OutputDue Date

LO1MCO1 =

LO2MCO2 = A documented evaluation of the software project with respect to the software source code

Other Requirements and Assessment:Aside from the major course output above, this course has 4 major examination namely: prelim, mid-term, pre-final, and final. In Addition, Graded classes activities are recitation, seatwork assignments, reports and case studies.

Grading System:To pass this course, one must accumulate at least 60 points through the course requirements discussed above. The maximum points that a student can obtain through each requirement are shown below.

Requirements/Assessment TaskMaximum Points

Major Exam20

Case Study and Reports50


TOTAL100


LO1Course administrationWeek 1 - 6DiscussionHands on DemonstrationExercises

Review: data structure concepts, arrays, simple linked lists, different implementations of lists, binaryTrees

Introduction to complexity:O()-notation

Stacks and queues

Sets, including union/find algorithms

Recursion and backtracking

LO2Sorting and searchingWeek 7- 8DiscussionHands on DemonstrationExercises

Balanced treesWeek 9 - 10DiscussionHands on DemonstrationExercises

Heaps, priority queues, heapsortWeek 11 - 12DiscussionHands on DemonstrationExercises

Dictionaries/maps, hashingWeek 13DiscussionHands on DemonstrationExercises

GraphsWeek 14DiscussionHands on DemonstrationExercises


COURSE SYLLABUSCourse No: ICT Elective 3Course Title: Artificial IntelligenceCourse Credit: 3Course Description:Introduces the field of artificial intelligence (AI). Materials on AI programming, logic, search, game playing, machine learning, natural language understanding, and robotics introduce the student to AI methods, tools, and techniques, their application to computational problems, and their contribution to understanding intelligence. Because each of these topics could be a course unto itself, the material is introductory and not complete. Each unit presents the problem a topic addresses, current progress, and approaches to the problem. The readings include and cite more materials that are referenced in this course, and students are encouraged to use these resources to pursue topics of interest after this course.Contact Hours/Week: 3Pre-requisite: Must be 4th Year StandingLearning Outcomes/Course Objective: LO1 = Describe the major applications, topics, and research areas of artificial intelligence (AI), including search, machine learning, knowledge representation and inference, natural language processing, vision, and robotics. LO2 = Apply basic techniques of AI in computational solutions to problems. LO3 = Discuss the role of AI research areas in growing the understanding of human intelligence. LO4 = Identify the boundaries of the capabilities of current AI systems.

Course Outline: Introduction to Artificial Intelligence (AI) and AI Programming Logic Programming Trees and Nodes Graphs Directed / Undirected States, Actions, and Goals


LO1MCO1 = Describe the contributions and application of AI. Characterize the goals of AI, approaches to and progress toward those goals. Explain the role of programming in artificial intelligence (AI). Describe logic programming and basic constructs used in AI programming.End of Prelim

LO2MCO2= Describe the role of search in AI. Give examples of the basic types of search algorithms. Explain the basic types of search algorithms. Discuss the computational complexity of search algorithms.End of Midterm

LO3MCO3 = Apply constraint satisfaction to techniques in solving problems, in particular using searching. Describe several heuristics used in constraint satisfaction.End of Pre-Final

LO4MCO4/5 = Delineate game playing in the history of AI. Design algorithms for playing simple games.End of Final

Other Requirements and assessment:Passing grade on quizzes and the final exam, achieve the objectives of each unit and the goals of the course, ability to apply the concepts taught in the course.


Major Exam20



TOTAL100


LO1 Introduction to AI and Agents Blind Search Week 1-4DiscussionHands on DemonstrationExercises

LO2 Solving problems by searching Informed Search Game PlayingWeek 5 - 7DiscussionHands on DemonstrationExercises

LO3 Constraint Satisfaction Logical Agents and Propositional Logic First-Order Logic and Prolog Week 8 - 9DiscussionHands on DemonstrationExercises

LO4 Logical Inference Natural Language Processing UncertaintyWeek 10 -14DiscussionHands on DemonstrationExercises


COURSE SYLLABUSCourse No: ICT 8Course Title: DBMSCourse Credit: 3Course Description:Introduction to DBMS concepts. Data models and languages. Relational database theory. Database security/integrity and concurrency.Contact Hours/Week: 3Pre-requisite: Data StructuresLearning Outcomes/Course Objective: LO1 = Describe the major applications, topics, and research areas of artificial intelligence (AI), including search, machine learning, knowledge representation and inference, natural language processing, vision, and robotics. LO2 = Apply basic techniques of AI in computational solutions to problems. LO3 = Discuss the role of AI research areas in growing the understanding of human intelligence. LO4 = Identify the boundaries of the capabilities of current AI systems.

Course Outline: Introduction Database Entity-Relationship Model Relational Model ER-to-Relational Mapping Relational Algebra Query Processing and Optimization Microsoft Access Relational Database Design Relational Calculus SQL Security and Authorization Transactions, Recovery and Concurrency


LO1MCO1 Evaluate business information problem and find the requirements of a problem in terms of data. Understand the uses the database schema and need for normalization. End of Prelim

LO2MCO2 Design the database schema with the use of appropriate data types for storage of data in database. Use different types of physical implementation of databaseEnd of Midterm

LO3MCO3 Use database for concurrent use. End of Pre-Final

LO4MCO4 Backup data from database. End of Final



Major Exam20



TOTAL100


LO1 Introduction Database Entity-Relationship Model Relational Model Week 1-4DiscussionHands on DemonstrationExercises

LO2 ER-to-Relational Mapping Relational Algebra Query Processing and Optimization Week 5 - 7DiscussionHands on DemonstrationExercises

LO3 Microsoft Access Relational Database Design Relational Calculus Week 8 - 9DiscussionHands on DemonstrationExercises

LO4 SQL Security and Authorization Transactions, Recovery and ConcurrencyWeek 10 -14DiscussionHands on DemonstrationExercises


COURSE SYLLABUSCourse No: ICT 16/ IT 216Course Title: Operating SystemCourse Credit: 3Course Description:This course is an introduction to operating system design and implementation. We study operating systems because they are examples of mature and elegant solutions to a difficult design problem: how to safely and efficiently share system resources and provide abstractions useful to applications. For the processor, memory, and disks, we discuss how the operating system allocates each resource and explore the design and implementation of related abstractions. We also establish techniques for testing and improving system performance and introduce the idea of hardware virtualization. Programming assignments provide hands-on experience with implementing core operating system components in a realistic development environment.Contact Hours/Week: 3Pre-requisite: Data StructuresLearning Outcomes/Course Objective:Learning outcomes for this course are divided into two categories: conceptual, and programming. Our goal is to provide you with an introduction to operating systems and make you a stronger programmer, debugger, and teammate. LO1 Understand the abstractions supported by modern operating systems. Describe how operating systems safely and efficiently multiplex hardware resources through effective policies and mechanisms Analyze the designs and features of historical, current, and emerging operating systems

LO2 Design and implement working systems software Identify and correct bugs in complex, multithreaded systems Formulate and test performance hypotheses

Course Outline: Processes and the system call interface. Abstracting and multiplexing the CPU. Abstracting and multiplexing memory. Abstracting and multiplexing disks. Operating system structure: micro, macro, exo and multikernels. Performance improvement. Hardware virtualization.


LO1MCO1 Demonstrate a knowledge and understanding of processes, threads, CPU scheduling, process synchronization, deadlocks, memory management and storage management .

Design, execute, and report on the results of experiments to monitor the performance of an operating system as a whole or one of its parts design, code , and test programs that use thread libraries to support concurrency (using for example java.util.concurrent or POSIX Threads also known as Pthreads) and design, code and test models of concurrency (using, for example, Petri Nets) .End of Midterm

LO2MCO2 Demonstrate a knowledge and understanding of user-space programs (such as shell scripts and the shells themselves) . Compare and contrast the historical development and structure of several operating systems. Demonstrate a knowledge and understanding of virtualization and emulation .End of Final



Major Exam20



TOTAL100


LO1 Role and purpose of operating systems. History of operating systems. Processes and process management, including a discussion of concurrency and related issues. Memory management.Week 1-7DiscussionHands on DemonstrationExercises

LO2 Input/output and device management. File systems. Operating system security.Week 8 - 14DiscussionHands on DemonstrationExercises


COURSE SYLLABUSCourse No: ICT Elec 2Course Title: RDBMSCourse Credit: 3Course Description:Introduction toR DBMS concepts. Data models and languages. Relational database theory. Database security/integrity and concurrency.Contact Hours/Week: 3Pre-requisite: Data StructuresLearning Outcomes/Course Objective: LO1 = Describe the major applications, topics, and research areas of artificial intelligence (AI), including search, machine learning, knowledge representation and inference, natural language processing, vision, and robotics. LO2 = Apply basic techniques of AI in computational solutions to problems. LO3 = Discuss the role of AI research areas in growing the understanding of human intelligence. LO4 = Identify the boundaries of the capabilities of current AI systems.

Course Outline: Introduction Database Entity-Relationship Model Relational Model ER-to-Relational Mapping Relational Algebra Query Processing and Optimization Microsoft Access Relational Database Design Relational Calculus SQL Security and Authorization Transactions, Recovery and Concurrency


LO1MCO1 Evaluate business information problem and find the requirements of a problem in terms of data. Understand the uses the database schema and need for normalization. End of Prelim

LO2MCO2 Design the database schema with the use of appropriate data types for storage of data in database. Use different types of physical implementation of databaseEnd of Midterm

LO3MCO3 Use database for concurrent use. End of Pre-Final

LO4MCO4 Backup data from database. End of Final



Major Exam20



TOTAL100


LO1 Introduction Database Entity-Relationship Model Relational Model Week 1-4DiscussionHands on DemonstrationExercises

LO2 ER-to-Relational Mapping Relational Algebra Query Processing and Optimization Week 5 - 7DiscussionHands on DemonstrationExercises

LO3 Microsoft Access Relational Database Design Relational Calculus Week 8 - 9DiscussionHands on DemonstrationExercises

LO4 SQL Security and Authorization Transactions, Recovery and ConcurrencyWeek 10 -14DiscussionHands on DemonstrationExercises

Documents

Software List