IT-302 Object Oriented Analysis and Design using UML L T P 3 1 -
|
|
|
- Prosper Hawkins
- 9 years ago
- Views:
Transcription
1 IT-302 Object Oriented Analysis and Design using UML Review of Object Oriented Systems Design Objects, Class hierarchy, inheritance, polymorphism, object relationships and associations, aggregations and object containment, object persistence, meta-classes, Objectoriented systems development life cycle, Software development process Object Oriented systems development: a use-case driven approach.[1,2] 2. Methodology for Object Oriented Design Object modeling technique as software engineering methodology, Rumbaugh methodology, Jacobson Methodology, Booch Methodology, Patterns, Frameworks, the unified approach, unified modeling language (UML). [1] 3. Unified Modeling language Introduction, UML diagrams, UML class diagrams, Use Case diagrams, UML dynamic modeling, Packages and model organization, UML extensibility, UML meta model. [1] 4. Object Oriented Analysis Analysis Process, Use-Case Driven Object Oriented Analysis, Use-Case Model, Object Classification, Theory, Different Approaches for identifying classes, Classes, Responsibilities and Collaborators, Identifying Object Relationships, Attributes and Methods, Super-sub Class Relationships, A-Part of Relationships-Aggregation, Class Responsibilities, Object Responsibilities. [1,2] 5. Object Oriented Design Object oriented design process, corollaries, design axioms, design patterns, object oriented design philosophy, UML Object Constraint Language, Designing Classes: The Process, Class Visibility, Refining Attributes, Designing Methods and Protocols, Packages and Managing classes, Designing Interface Objects, View layer interface design, Macro and Micro level interface design process. [1,2] 1. Ali Bahrami, Object Oriented Systems Development, McGraw Hill, Rumbaugh et. al, Object Oriented Modeling and Design, PHI, Wendy Boggs, Michael Boggs, Mastering UML with Rational Rose, Sybex BPB Publications, Alan Dennis, B H Wixom, D Tegarden, Systems Analysis & Design with UML version 2.0 An Object Oriented Approach, 2 nd Edition, Wiley India, 2007.
2 IT-304 Software Quality Assurance Product Quality & Process Quality: Introduction, software system evolution, product quality, models for software product quality, process quality. [1] 2. Functional Testing: Boundary Value Testing: Analysis, robust testing, worst case testing, special & random testing, examples ; Equivalence Class Testing- equivalence classes, examples; Decision Table Based Testing: decision tables with examples. [2] 3. Structural-Testing: Path testing: DD-Paths, Metrics, basic path testing; Data Flow Testing, DU testing, slice based testing; Mutation testing. [2] 4. Integration & System Testing: levels of testing; integration testing: decomposition based, call graph based & path based integration; System testing: threads based structural & functional testing. [2] 5. Object Oriented Testing: Some issues in Object Oriented Testing, Units for object-oriented testing, implications of composition and encapsulation, implication of inheritance, implication of polymorphism, and levels of object-oriented testing [2] 1. N.S. Godbole, Software Quality Assurance Principles & Practice, Narosa Publications, Paul C Jorgensen, Software Testing A Craftsman s Approach, 2 nd Ed., CRC Press, Boris Beizer, Software Testing Techniques, Second Edition, Wiley India, William Perry, Effective Methods for Software Testing, 3 rd Edition, Wiley India, Cern Kaner, Jack Falk, Nguyen Quoc, Testing Computer Software, Second Edition, Van Nostrand Reinhold, New York, Louise Tamres, Software Testing, Pearson Education Asia, 2002
3 IT-306 Automata Theory Introduction Introduction to Finite State Machine, Moore and Mealy FSMs, Equivalence, Regular Languages, Regular expressions, The memory required to recognize a language, Distinguishing one string from another, unions, Intersections and Complements, Finite automata, NFA, NFA with null transitions, Equivalence, Criterion for Regularity, Minimal Finite Automata, The pumping lemma, decision problems, Finite automata, Non-determinism and Kleen s Theorem, Regular and Non-regular languages. [1] 2. Context-Free Language Context Free Grammars, Definition of CFG, example of familiar languages, unions, concatenations and closures of CFLs, Derivation Tree, Ambiguity, unambiguous CFG for algebraic expressions, Simplified forms and normal forms, Push down automata, definition, deterministic PDA, PDA to CFG and Vice Versa, Parsing. Context Free and Non Context Free Languages, Pumping lemma for CFG, Intersection and complements of CFL. [1] 3. Turing Machines Definition, Turing Machining as Language acceptors, combining TM, computing Partial Function with TM. Recursively Enumerable and Recursive Languages, Regular Grammars, context Sensitive grammars, Chomsky Hierarchy. Concept of unsolavability & reducibility, Halting Problem, Post correspondence Problem, Rice theorm[1] 4. Computability Primitive Recursive Functions, Primitive Recursive Predicates and some bounded operations, unbounded minimalization and recursive functions, Godel Numbering, Non-numericfunctions.Growth rates of functions, Time and space complexity of TM, complexity Classes. P and NP. Polynomial-Time. Reductions and NP-Completeness, Cook s Theorem. [1] 1. John C. Martin, Introduction to Languages and the Theory of Computation, MGH. 2. Lewis & Papadimitriou, Elements of the Theory of Computation, PHI. 3. Daniel I.A. Cohen, Introduction to Computer Theory: John Wiley. 4. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory Languages and Computation, Narosa.
4 IT-322 Information Security Introduction Meaning of security, attacks, Computer Criminals, Methods of defense [1] 2. Elementary Cryptography Introduction, Substitution ciphers, Transpositions, Data encryption standard, AES Encryption Algorithm, Public key Encryption, Uses of Encryption. [1] 3. Program Security Secure Program, Non Malicious Program errors, Viruses and other malicious code, Targeted Malicious Code, Control against Program. [1] 4. Protection in General Purpose Operating System Overview, File Protection Mechanisms, User Authentication, Designing Trusted Operating System, Security Policy, Models of Security, Trusted Operating System Design [1] 5. Database Security & Security in Networks Introduction to Database, Security Requirements, Reliability and Integrity, Sensitive Data,Inference,Multileveldatabase.Networksecurity:NetworkConcepts,ThreatsinNetworks Networks,Security controls, Firewalls,Intrusion Detection System, Secure [1] 6. Administering Security Risk analysis, legal, Privacy & Ethical issues, Computer Security: Protecting Programs and Data [1] 1. Charles P.Pfleeger,Share Lawrence Pfleeger, Security in Computing, Pearson Education, 2/e. 2. Charlie Kaufman, Perlman & S Peeciner, Network Security, Pearson Education, 2/e.
5 1. Parallel & Distributed Databases B. Tech 6 th Semester (Information Technology) IT-324 Advanced Database System 3 1 Architecture for parallel databases, Parallel query evaluation, parallel zing individual operations, parallel query optimization; Introduction to distributed databases, distributed DBMS architectures, storing data in a distributed DBMS, distributed catalog management, distributed query processing, updating distributed data, introduction to distributed transactions, distributed concurrency control, recovery. 2. Data Mining Introduction, counting co-occurrences, mining for rules, tree structured rules, clustering, similarity search over sequences. 3. Object Database Systems User defined ADT, structured types, objects & reference types, inheritance, design for an ORDBMS, challenges in implementing an ORDBMS, OODBMS, and comparison of RDBMS with OODBMS & ORDBMS. 4. Advanced Topics Advanced transaction processing, integrated access to multiple data source, mobile databases main memory databases, multimedia databases, GIS, temporal & sequence databases. 1. R. Ramakrishna & J. Gehrks Database Management Systems MGH, International Ed., Korth, Silberschatz, Sudershan: Data Base concepts, MGH, C. J. Date, Database Systems, 7th Ed., Addison Wesley, Pearson Education, 2000.
6 IT-326 VHDL Introduction to HDL: Design Flow, Design Methodologies, HDL History, Capabilities, Hardware Abstraction, Basic Terminology, Model Analysis, Comparison between VHDL and Verilog.[1] 2.Basic VHDL Elements: Identifiers, Data objects,data Types, Operators. [1,2] 3.Behavioral Modeling: Entity declaration, architecture body, Various Sequential Statements and Constructs, multiple processes, postponed processes. [1] 4.Dataflow modeling: Concurrent Signal Assignment Statements, delta delay model, multiple drivers, block statement, concurrent assertion statement. [1] 5.Structural modeling: Component Declaration, component Instantiation, resolving signal values. [1] 6.Supporting Constructs: Generics and Configuration, Subprograms and Overloading, Operator overloading, Package declaration, package body, design Libraries, visibility. [1, 2] 7. Advanced Features: Generate statements, qualified expressions, type conversions, guarded signals, attributes, aggregate targets. [1] 8.Programmable Logic Devices (PLD) and Field Programmable Gate Arrays (FPGA): Basic Concepts, Architecture and Usage. [1,2] 9.Combinational Logic Design: Adders/Subtractors, ALU, Multipliers, Shifters. [1,2] 10.Sequential Logic Design: Synchronous Sequential Circuits, Asynchronous Sequential Circuits. [1,2] 1. J.Bhasker, A.VHDL, Primer, 2/e,,PHI. 2. Fundamentals of Digital logic Design with VHDL, 2/e, TMH. 3. D. Perry, VHDL, 3 rd Ed,TMH. 4. Skahil, VHDL for Programmable logic,2nd Ed, Wiley.
7 B Tech 6 th Sem (Information Technology) HUT-322 Soft Skills Workshop 2 The course is framed to develop soft skills of students to a level when they can communicate effectively in professional and social situations orally as well as in writing. Keeping in mind the wide variation in the backgrounds of participating students, the contents and the approach have been kept flexible and may be modified by the teachers to suit individual needs. Introduction to the process of communication; types of communication; common barriers and their remedies. Verbal and non-verbal communication; common errors in usages and syntax; figurative use of language. Learning pronunciation, stress and intonation through language lab. Body language its importance and effective use in verbal communication. Writing technical papers and reports for publication. Preparation of reports/papers for oral presentation common errors and misconceptions, especially in power point presentation. Handling questions. Group discussion; dos and don ts for participation in a GD. Preparing a CV/Resume and writing a job application. The art of interview performance.
8 IT-312 Computer Networks Pr 3 1. Study of various topologies of Network 2 RJ-45 connector and its circuit diagram 3. BNC connector and its circuit diagram 4. Thick & Thin coaxial cable 5. CKT diagram of terminator 6. CKT diagram of T-connector 7. Study pf different type of cable in designing (10 base 7, 10 base 2, 10 base 5, UTP OFC) 8. CKT diagram of network interface card. 9. Study of bridge, router, hub, gateways. 10.Layout of Installation of LAN with S/W & H/W requirement.
9 IT-314 Advanced Pr I 3 NOTE: In Advanced Pr 1 some Practicals based on other papers offered in this semester and/or following UML based practicals will be performed using Case tool. Implement the following programs using UML Notations 1. Create an ATM system model including all object diagrams. 2. Create a use case diagram for order processing system. 3. Create a model to study message transfer between objects. 4. Create sequence & collaboration diagram to add a new order in order processing system. 5. Take the classes created in above programs and group them into packages. 6. Study the concept of addition of attributes to the classes designed above. 7. Study the concept of relationship between classes that participate in the Enter New Order use case.
10 IT-316 Visual Programming & Server Side Programming Pr 3 1 Write a Program using ASP to check whether a folder exists on a server or not 2 Write a Program using ASP Get File method is used to find out information about a given file. 3 Write a Program using ASP for HTTP screen-scraping and caching. 4 Write a Program using ASP to display the information after submission from user. 5. Write a Program in ASP to display present day, month & date. Also display digital clock. 6 Send information to the user after he submit the form using GET & POST method & Implement from validation. 7 Write a Program in ASP that has a form taking the user s name as input. Store this name in a permanent cookie & whenever the page is opened again, then value of the name field should be attached with the cookie s content. 8 Use ad-rotator to change advertisements on client side request. 9. Create a Session dictionary using object tag. In session-on start add keys for time, user agent, remote I.P. & add appropriate values. Create a simple page to display the values. 10.Implement Session tracking using user authentication. 11 Write a Program to delete all cookies of your web site that has created on the client s computer. 12 Write a Program is ASP to check the capabilities of the browser using browser capability component. 1. Jason Hunter & William Crawford, Java Servlets Programming, O Reilly,2 nd Edition, Marty Hall, Larry Brown and Yaakov Caikin,Core Servlets and JSP, 2 nd Edition. 3. Marty Hall, More Servlets and JSP 4. Keith Morneau & Jill Batistick, ASP Web Warrior Series, 1 st Edition. 5. Manuel Alberta Ricart & Stephen Asbury,ASP 3 Developer s Guide,Hungry Minds Pap/cdr Edition.
11 B Tech 6th Semester (Information Technology) IT-318 Software testing Pr 3 (A) Implement the following in C/C++ 1. Develop a formula for the number of robustness test cases for a function of n variables. 2. Develop a formula for the number of robust worst test cases for a function of n variables. 3. Find a Cyclomatic complexity of the graph. 4. Study the development of decision table for the triangle problem. 5. Study the development of decision table for the next date function. 6. Develop a program for the data flow testing. 7. Develop the program for the white box testing. 8. Develop the boundary value analysis (test case) on triangle problem. 9. Develop the boundary value analysis (test case) on next date function. (B) Developing a Small Project /Tool to Generate Test data, to Execute test data etc. (C) Exposure to Automated Case tool 1. Paul C. Jorgensen, Software testing--a Craftsman s Approach, 2 nd Edition, CROC Press 2. Pankaj Jalote, An Integrated Approach to Software Engineering, 3 rd Edtion Narosa Publications 3. Meyers, Art of Software Testing,2 nd Edition, John Wiley Publication,2004
Model 2.4 Faculty member + student
Model 2.4 Faculty member + student Course syllabus for Formal languages and Automata Theory. Faculty member information: Name of faculty member responsible for the course Office Hours Office Number Email
Philadelphia University Faculty of Information Technology Department of Computer Science First Semester, 2007/2008.
Philadelphia University Faculty of Information Technology Department of Computer Science First Semester, 2007/2008 Course Syllabus Course Title: Theory of Computation Course Level: 3 Lecture Time: Course
Computer Architecture Syllabus of Qualifying Examination
Computer Architecture Syllabus of Qualifying Examination PhD in Engineering with a focus in Computer Science Reference course: CS 5200 Computer Architecture, College of EAS, UCCS Created by Prof. Xiaobo
Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce
Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce Program Objective #1 (PO1):Students will be able to demonstrate a broad knowledge of Computer Science
SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN
Course Code : CS0355 SRM UNIVERSITY FACULTY OF ENGINEERING & TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF SOFTWARE ENGINEERING COURSE PLAN Course Title : THEORY OF COMPUTATION Semester : VI Course : June
Division of Mathematical Sciences
Division of Mathematical Sciences Chair: Mohammad Ladan, Ph.D. The Division of Mathematical Sciences at Haigazian University includes Computer Science and Mathematics. The Bachelor of Science (B.S.) degree
Course Manual Automata & Complexity 2015
Course Manual Automata & Complexity 2015 Course code: Course homepage: Coordinator: Teachers lectures: Teacher exercise classes: Credits: X_401049 http://www.cs.vu.nl/~tcs/ac prof. dr. W.J. Fokkink home:
School of Computer Science
School of Computer Science Computer Science - Honours Level - 2014/15 October 2014 General degree students wishing to enter 3000- level modules and non- graduating students wishing to enter 3000- level
B.Sc. (Computer Science) First Year
B.Sc. (Computer Science) First Year Paper No. Title of Paper External Internal Assessment Maximum Pass Exam Durations Semester I I Computer Fundamentals & Programming 40 5 45 16 3hrs in C II Logical Organization
2010-2011 Assessment for Master s Degree Program Fall 2010 - Spring 2011 Computer Science Dept. Texas A&M University - Commerce
2010-2011 Assessment for Master s Degree Program Fall 2010 - Spring 2011 Computer Science Dept. Texas A&M University - Commerce Program Objective #1 (PO1):Students will be able to demonstrate a broad knowledge
COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM
COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM Course Code 2505100 Computing Fundamentals Pass/ Fail Prerequisite None This course includes an introduction to the use of the computer
Master of Science in Computer Science Information Systems
Master of Science in Computer Science Information Systems 1. General Admission Requirements. Admission to Graduate Studies (see graduate admission requirements). 2. Program Admission. In addition to meeting
Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students
Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent
Information and Communications Technology Courses at a Glance
Information and Communications Technology Courses at a Glance Level 1 Courses ICT121 Introduction to Computer Systems Architecture This is an introductory course on the architecture of modern computer
Information Technology Career Field Pathways and Course Structure
Information Technology Career Field Pathways and Course Structure Courses in Information Support and Services (N0) Computer Hardware 2 145025 Computer Software 145030 Networking 2 145035 Network Operating
Concepts of Database Management Seventh Edition. Chapter 9 Database Management Approaches
Concepts of Database Management Seventh Edition Chapter 9 Database Management Approaches Objectives Describe distributed database management systems (DDBMSs) Discuss client/server systems Examine the ways
Course Syllabus For Operations Management. Management Information Systems
For Operations Management and Management Information Systems Department School Year First Year First Year First Year Second year Second year Second year Third year Third year Third year Third year Third
ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)
ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology) Subject Description: This subject deals with discrete structures like set theory, mathematical
Contents. Introduction and System Engineering 1. Introduction 2. Software Process and Methodology 16. System Engineering 53
Preface xvi Part I Introduction and System Engineering 1 Chapter 1 Introduction 2 1.1 What Is Software Engineering? 2 1.2 Why Software Engineering? 3 1.3 Software Life-Cycle Activities 4 1.3.1 Software
Study Plan for the Bachelor Degree in Computer Information Systems
Study Plan for the Bachelor Degree in Computer Information Systems The Bachelor Degree in Computer Information Systems/Faculty of Information Technology and Computer Sciences is granted upon the completion
Doctor of Philosophy in Computer Science
Doctor of Philosophy in Computer Science Background/Rationale The program aims to develop computer scientists who are armed with methods, tools and techniques from both theoretical and systems aspects
Core Syllabus. Version 2.6 C OPERATE KNOWLEDGE AREA: OPERATION AND SUPPORT OF INFORMATION SYSTEMS. June 2006
Core Syllabus C OPERATE KNOWLEDGE AREA: OPERATION AND SUPPORT OF INFORMATION SYSTEMS Version 2.6 June 2006 EUCIP CORE Version 2.6 Syllabus. The following is the Syllabus for EUCIP CORE Version 2.6, which
COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.)
VCU 1 COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.) The Bachelor of Science in Computer Science is built on a rigorous, highly concentrated, accredited curriculum of computer science courses. The program
Computer Science MS Course Descriptions
Computer Science MS Course Descriptions CSc I0400: Operating Systems Underlying theoretical structure of operating systems; input-output and storage systems, data management and processing; assembly and
M.S. Computer Science Program
M.S. Computer Science Program Pre-requisite Courses The following courses may be challenged by sitting for the placement examination. CSC 500: Discrete Structures (3 credits) Mathematics needed for Computer
Information Systems Analysis and Design CSC340. 2004 John Mylopoulos. Software Architectures -- 1. Information Systems Analysis and Design CSC340
XIX. Software Architectures Software Architectures UML Packages Client- vs Peer-to-Peer Horizontal Layers and Vertical Partitions 3-Tier and 4-Tier Architectures The Model-View-Controller Architecture
2110711 THEORY of COMPUTATION
2110711 THEORY of COMPUTATION ATHASIT SURARERKS ELITE Athasit Surarerks ELITE Engineering Laboratory in Theoretical Enumerable System Computer Engineering, Faculty of Engineering Chulalongkorn University
RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE. CISY 105 Foundations of Computer Science
I. Basic Course Information RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE CISY 105 Foundations of Computer Science A. Course Number and Title: CISY-105, Foundations of Computer Science B. New
Course Syllabus. Course code: 371410. Academic Staff Specifics. Office Number and Location
Philadelphia University Faculty of Administrative & Financial Sciences Department of Business Networking and Systems Management First semester, 2009/2010 Course Syllabus Course Title: Systems & Networks
Java (12 Weeks) Introduction to Java Programming Language
Java (12 Weeks) Topic Lecture No. Introduction to Java Programming Language 1 An Introduction to Java o Java as a Programming Platform, The Java "White Paper" Buzzwords, Java and the Internet, A Short
Weighted Total Mark. Weighted Exam Mark
CMP4103 Computer Systems and Network Security Period per Week Contact Hour per Semester Weighted Total Mark Weighted Exam Mark Weighted Continuous Assessment Mark Credit Units LH PH TH CH WTM WEM WCM CU
STUDY PROGRAM: INFORMATION SYSTEM
FACULTY OF COMPUTING STUDY PROGRAM: INFORMATION SYSTEM CURRICULUM INTRODUCTION Information Systems as a field of academic study encompasses the concepts, principles, and processes for two broad areas of
School of Computer Science
School of Computer Science Computer Science - Honours Level - 2015/6 - August 2015 General degree students wishing to enter 3000- level modules and non- graduating students wishing to enter 3000- level
Masters in Human Computer Interaction
Masters in Human Computer Interaction Programme Requirements Taught Element, and PG Diploma in Human Computer Interaction: 120 credits: IS5101 CS5001 CS5040 CS5041 CS5042 or CS5044 up to 30 credits from
Object Oriented Databases. OOAD Fall 2012 Arjun Gopalakrishna Bhavya Udayashankar
Object Oriented Databases OOAD Fall 2012 Arjun Gopalakrishna Bhavya Udayashankar Executive Summary The presentation on Object Oriented Databases gives a basic introduction to the concepts governing OODBs
MSc Information Technology - E521
MSc Information Technology - E521 1. Aims and Objectives This conversion programme targets non-engineering graduates with a view of preparing them for the employment market where up-to-date IT skills represent
The Designer's Guide to VHDL
The Designer's Guide to VHDL Third Edition Peter J. Ashenden EDA CONSULTANT, ASHENDEN DESIGNS PTY. LTD. ADJUNCT ASSOCIATE PROFESSOR, ADELAIDE UNIVERSITY AMSTERDAM BOSTON HEIDELBERG LONDON m^^ yj 1 ' NEW
Masters of Science in Software & Information Systems
Masters of Science in Software & Information Systems To be developed and delivered in conjunction with Regis University, School for Professional Studies Object Oriented Design Table of Contents January
ABET General Outcomes. Student Learning Outcomes for BS in Computing
ABET General a. An ability to apply knowledge of computing and mathematics appropriate to the program s student outcomes and to the discipline b. An ability to analyze a problem, and identify and define
Course Structure of Three Year Degree B.A Programme in Computer Application under Semester System of Dibrugarh University (General Programme)
Course Structure of Three Year Degree B.A Programme in Computer Application under Semester System of Dibrugarh University (General Programme) COURSE LECTURE DURATION(LD) /paper SEMESTER-I 1. Course Code:CAN101
PCCC PCCC Course Description
Course Description CIS 101 Computer Concepts and Applications 3 credits (formerly Introduction to Computers and Information Processing) Introduces a variety of topics in computers and computing including
Masters in Artificial Intelligence
Masters in Artificial Intelligence Programme Requirements Taught Element, and PG Diploma in Artificial Intelligence: 120 credits: IS5101 CS5001 CS5010 CS5011 CS4402 or CS5012 in total, up to 30 credits
List of courses MEngg (Computer Systems)
List of courses MEngg (Computer Systems) Course No. Course Title Non-Credit Courses CS-401 CS-402 CS-403 CS-404 CS-405 CS-406 Introduction to Programming Systems Design System Design using Microprocessors
Object oriented design process
Unit IV Design Object oriented design process 1.Apply design axioms to design classes 1.1 Refine and complete the static UML class diagram 1.2 Iterate and refine again 2. Design the access layer 2.1 create
Department of Computer Science
The University of Texas at San Antonio 1 Department of Computer Science The Department of Computer Science offers a Bachelor of Science degree in Computer Science and a Minor in Computer Science. Admission
OKLAHOMA SUBJECT AREA TESTS (OSAT )
CERTIFICATION EXAMINATIONS FOR OKLAHOMA EDUCATORS (CEOE ) OKLAHOMA SUBJECT AREA TESTS (OSAT ) FIELD 081: COMPUTER SCIENCE September 2008 Subarea Range of Competencies I. Computer Use in Educational Environments
Professional Organization Checklist for the Computer Science Curriculum Updates. Association of Computing Machinery Computing Curricula 2008
Professional Organization Checklist for the Computer Science Curriculum Updates Association of Computing Machinery Computing Curricula 2008 The curriculum guidelines can be found in Appendix C of the report
SOFT 437. Software Performance Analysis. Ch 5:Web Applications and Other Distributed Systems
SOFT 437 Software Performance Analysis Ch 5:Web Applications and Other Distributed Systems Outline Overview of Web applications, distributed object technologies, and the important considerations for SPE
INFORMATION TECHNOLOGY PROGRAMMER/ANALYST
JOB DESCRIPTION MICHIGAN CIVIL SERVICE COMMISSION JOB SPECIFICATION INFORMATION TECHNOLOGY PROGRAMMER/ANALYST Employees in this job function as information technology professionals, participating in or
Syllabus of. BCA III (Bachelor of Computer Application) Semester-V
Syllabus of BCA III (Bachelor of Computer Application) Semester-V Designed by Dr. S.B. Kishor GONDWANA UNIVERSITY, GADCHIROLI SESSION 2014-2015 SEM V BCA III Paper 1 Paper 2 Theory of Computational Analyzer
How To Design Software
The Software Development Life Cycle: An Overview Presented by Maxwell Drew and Dan Kaiser Southwest State University Computer Science Program Last Time The design process and design methods Design strategies
School of Computer Science
Computer Science Honours Level 2013/14 August 2013 School of Computer Science Computer Science (CS) Modules CS3051 Software Engineering SCOTCAT Credits: 15 SCQF Level 9 Semester: 1 This module gives a
Masters in Advanced Computer Science
Masters in Advanced Computer Science Programme Requirements Taught Element, and PG Diploma in Advanced Computer Science: 120 credits: IS5101 CS5001 up to 30 credits from CS4100 - CS4450, subject to appropriate
MEng, BSc Computer Science with Artificial Intelligence
School of Computing FACULTY OF ENGINEERING MEng, BSc Computer Science with Artificial Intelligence Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give
Masters in Networks and Distributed Systems
Masters in Networks and Distributed Systems Programme Requirements Taught Element, and PG Diploma in Networks and Distributed Systems: 120 credits: IS5101 CS5001 CS5021 CS4103 or CS5023 in total, up to
Computer Science 1010 Introduction to Computers and the Internet (3) 1015 Web Structures I (1) 1016 Web Structures II (1)
Computer Science 1010 Introduction to Computers and the Internet (3) Prerequisites: Same as for Math 1020 and Math 1030. Covers basic concepts and components of a PC, including microprocessor, disk, display,
DEGREE PLAN INSTRUCTIONS FOR COMPUTER ENGINEERING
DEGREE PLAN INSTRUCTIONS FOR COMPUTER ENGINEERING Fall 2000 The instructions contained in this packet are to be used as a guide in preparing the Departmental Computer Science Degree Plan Form for the Bachelor's
INFORMATION TECHNOLOGY PROGRAM
INFORMATION TECHNOLOGY PROGRAM The School of Information Technology offers a two-year bachelor degree program in Information Technology for students having acquired an advanced vocational certificate.
Announcements. SE 1: Software Requirements Specification and Analysis. Review: Use Case Descriptions
Announcements SE 1: Software Requirements Specification and Analysis Lecture 4: Basic Notations Nancy Day, Davor Svetinović http://www.student.cs.uwaterloo.ca/ cs445/winter2006 uw.cs.cs445 Send your group
Students who successfully complete the Health Science Informatics major will be able to:
Health Science Informatics Program Requirements Hours: 72 hours Informatics Core Requirements - 31 hours INF 101 Seminar Introductory Informatics (1) INF 110 Foundations in Technology (3) INF 120 Principles
Designing Real-Time and Embedded Systems with the COMET/UML method
By Hassan Gomaa, Department of Information and Software Engineering, George Mason University. Designing Real-Time and Embedded Systems with the COMET/UML method Most object-oriented analysis and design
COMPUTER SCIENCE TRIPOS
CST.98.5.1 COMPUTER SCIENCE TRIPOS Part IB Wednesday 3 June 1998 1.30 to 4.30 Paper 5 Answer five questions. No more than two questions from any one section are to be answered. Submit the answers in five
Java Application Developer Certificate Program Competencies
Java Application Developer Certificate Program Competencies After completing the following units, you will be able to: Basic Programming Logic Explain the steps involved in the program development cycle
Computer Science/Software Engineering
292 School of Science and Engineering Computer Science/Software Engineering Everald E. Mills, PhD, Chair Objectives The computer science program seeks to prepare students for careers that require sophisticated
One LAR Course Credits: 3. Page 4
Course Descriptions Year 1 30 credits Course Title: Calculus I Course Code: COS 101 This course introduces higher mathematics by examining the fundamental principles of calculus-- functions, graphs, limits,
Computer Science. General Education Students must complete the requirements shown in the General Education Requirements section of this catalog.
Computer Science Dr. Ilhyun Lee Professor Dr. Ilhyun Lee is a Professor of Computer Science. He received his Ph.D. degree from Illinois Institute of Technology, Chicago, Illinois (1996). He was selected
BCA 421- Java. Tilak Maharashtra University. Bachelor of Computer Applications (BCA) 1. The Genesis of Java
Tilak Maharashtra University Bachelor of Computer Applications (BCA) BCA 421- Java 1. The Genesis of Java Creation of Java, Why it is important to Internet, characteristics of Java 2. Basics of Programming
REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc])
305 REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc]) (See also General Regulations) Any publication based on work approved for a higher degree should contain a reference
Master of Science in Computer Science
Master of Science in Computer Science Background/Rationale The MSCS program aims to provide both breadth and depth of knowledge in the concepts and techniques related to the theory, design, implementation,
Department of Computer Science
Department of Computer Science Ali Sekmen, PhD 2, Chair 005, McCord Hall 615-963-5712 Faculty: K. Al Nasr, W. Chen, E. Erdemir, M. Hayes, H. Miao, T. Rogers, G. Shao, F. Yao General Statement: The Department
Masters in Computing and Information Technology
Masters in Computing and Information Technology Programme Requirements Taught Element, and PG Diploma in Computing and Information Technology: 120 credits: IS5101 CS5001 or CS5002 CS5003 up to 30 credits
AP Computer Science A - Syllabus Overview of AP Computer Science A Computer Facilities
AP Computer Science A - Syllabus Overview of AP Computer Science A Computer Facilities The classroom is set up like a traditional classroom on the left side of the room. This is where I will conduct my
1) Explain the following evolutionary process models: a) The spiral model. b) The concurrent development model.
(DMSIT 21) ASSIGNMENT - 1, MAY-2014. PAPER- I : SOFTWARE ENGINEERING 1) Explain the following evolutionary process models: a) The spiral model. b) The concurrent development model. 2) What are requirements
Introduction to Automata Theory. Reading: Chapter 1
Introduction to Automata Theory Reading: Chapter 1 1 What is Automata Theory? Study of abstract computing devices, or machines Automaton = an abstract computing device Note: A device need not even be a
MEng, BSc Applied Computer Science
School of Computing FACULTY OF ENGINEERING MEng, BSc Applied Computer Science Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give a machine instructions
Automata and Computability. Solutions to Exercises
Automata and Computability Solutions to Exercises Fall 25 Alexis Maciel Department of Computer Science Clarkson University Copyright c 25 Alexis Maciel ii Contents Preface vii Introduction 2 Finite Automata
In this Lecture you will Learn: Systems Development Methodologies. Why Methodology? Why Methodology?
In this Lecture you will Learn: Systems Development Methodologies What a systems development methodology is Why methodologies are used The need for different methodologies The main features of one methodology
Axiomatic design of software systems
Axiomatic design of software systems N.P. Suh (1), S.H. Do Abstract Software is playing an increasingly important role in manufacturing. Many manufacturing firms have problems with software development.
Formal Engineering for Industrial Software Development
Shaoying Liu Formal Engineering for Industrial Software Development Using the SOFL Method With 90 Figures and 30 Tables Springer Contents Introduction 1 1.1 Software Life Cycle... 2 1.2 The Problem 4 1.3
Domains and Competencies
Domains and Competencies DOMAIN I TECHNOLOGY APPLICATIONS CORE Standards Assessed: Computer Science 8 12 I VII Competency 001: The computer science teacher knows technology terminology and concepts; the
COURSE TITLE COURSE DESCRIPTION
COURSE TITLE COURSE DESCRIPTION CS-00X COMPUTING EXIT INTERVIEW All graduating students are required to meet with their department chairperson/program director to finalize requirements for degree completion.
How To Understand Software Engineering
PESIT Bangalore South Campus Department of MCA SOFTWARE ENGINEERING 1. GENERAL INFORMATION Academic Year: JULY-NOV 2015 Semester(s):III Title Code Duration (hrs) SOFTWARE ENGINEERING 13MCA33 Lectures 52Hrs
EE360: Digital Design I Course Syllabus
: Course Syllabus Dr. Mohammad H. Awedh Fall 2008 Course Description This course introduces students to the basic concepts of digital systems, including analysis and design. Both combinational and sequential
Object-Oriented Systems Analysis and Design
Object-Oriented Systems Analysis and Design Noushin Ashrafi Professor of Information System University of Massachusetts-Boston Hessam Ashrafi Software Architect Pearson Education International CONTENTS
Chapter 6: Programming Languages
Chapter 6: Programming Languages Computer Science: An Overview Eleventh Edition by J. Glenn Brookshear Copyright 2012 Pearson Education, Inc. Chapter 6: Programming Languages 6.1 Historical Perspective
Bachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries
First Semester Development 1A On completion of this subject students will be able to apply basic programming and problem solving skills in a 3 rd generation object-oriented programming language (such as
SOFTWARE ENGINEERING PROGRAM
SOFTWARE ENGINEERING PROGRAM PROGRAM TITLE DEGREE TITLE Master of Science Program in Software Engineering Master of Science (Software Engineering) M.Sc. (Software Engineering) PROGRAM STRUCTURE Total program
How To Get A Computer Science Degree
MAJOR: DEGREE: COMPUTER SCIENCE MASTER OF SCIENCE (M.S.) CONCENTRATIONS: HIGH-PERFORMANCE COMPUTING & BIOINFORMATICS CYBER-SECURITY & NETWORKING The Department of Computer Science offers a Master of Science
MICHIGAN TEST FOR TEACHER CERTIFICATION (MTTC) TEST OBJECTIVES FIELD 050: COMPUTER SCIENCE
MICHIGAN TEST FOR TEACHER CERTIFICATION (MTTC) TEST OBJECTIVES Subarea Educational Computing and Technology Literacy Computer Systems, Data, and Algorithms Program Design and Verification Programming Language
REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc])
299 REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc]) (See also General Regulations) Any publication based on work approved for a higher degree should contain a reference
FLORIDA STATE COLLEGE AT JACKSONVILLE COLLEGE CREDIT COURSE OUTLINE
Form 2A, Page 1 FLORIDA STATE COLLEGE AT JACKSONVILLE COLLEGE CREDIT COURSE OUTLINE COURSE NUMBER: CET 2600 COURSE TITLE: Network Fundamentals PREREQUISITE(S): CTS 1131 and CTS 1133 COREQUISITE(S): STUDENT
CS5310 Algorithms 3 credit hours 2 hours lecture and 2 hours recitation every week
CS5310 Algorithms 3 credit hours 2 hours lecture and 2 hours recitation every week This course is a continuation of the study of data structures and algorithms, emphasizing methods useful in practice.
Course Number: IAC-SOFT-WDAD Web Design and Application Development
Course Number: IAC-SOFT-WDAD Web Design and Application Development Session 1 (10 Hours) Client Side Scripting Session 2 (10 Hours) Server Side Scripting - I Session 3 (10 hours) Database Session 4 (10
Department of Computer Science
82 Advanced Biochemistry Lab II. (2-8) The second of two laboratory courses providing instruction in the modern techniques of biochemistry. Experiments are performed on the isolation, manipulation and
How To Get A Computer Science Degree At Appalachian State
118 Master of Science in Computer Science Department of Computer Science College of Arts and Sciences James T. Wilkes, Chair and Professor Ph.D., Duke University [email protected] http://www.cs.appstate.edu/
Formal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
Karunya University Dept. of Information Technology
PART A Questions 1. Mention any two software process models. 2. Define risk management. 3. What is a module? 4. What do you mean by requirement process? 5. Define integration testing. 6. State the main
