AGARWAL COLLEGE & WEB SERVICES TRUST. In Collaboration with KARANATAKA STATE OPEN UNIVERSITY
|
|
- Derick Bradford
- 8 years ago
- Views:
Transcription
1 AGARWAL COLLEGE & WEB SERVICES TRUST In Collaboration with KARANATAKA STATE OPEN UNIVERSITY Syllabus of Post Graduate Diploma in Computer Application (PGDCA)
2 Post Graduate Diploma in Computer Applications: Program Structure 1 st Semester Code Course Title Credits PGDCA 101 Mathematics 4 PGDCA 102 Data Structure 4 PGDCA 103 Programming in c 4 PGDCA 104 Financial Accounting 4 PGDCA 105 C Programming Lab and Windows based Application lab 2 PGDCA 106 Data Structure Lab 2 Total Credit : 20 2nd Semester Code Course Title Credits PGDCA 201 Discrete Mathematics 4 PGDCA 202 DBMS 4 PGDCA 203 OOPS with C++ 4
3 PGDCA 204 Computer Organization and Architecture 4 PGDCA 205 DBMS Lab 2 PGDCA 206 OOPS(C++) Lab 2 Total Credit 20 PGDCA101 Mathematics DETAILED SYLLABUS Section- 1 Unit- 1 Unit- 2 Set Theory Sets, Relations and Functions The Concept of a Set Notations and Representation of a Set Types of Sets Theorem on Subsets, Unit- 3 Venn Diagram Set Operations De-Morgan s Laws Applications of Venn Diagrams Ordered Pairs, Relations & Functions Section- 2 Unit- 4 Graph Theory Graphs, Application of Graph Theory. Unit- 5 Trees, Application of Trees. Section- 3 Unit- 6 Introduction To Recurrence Relations A sequence, Recurrence relation.
4 Unit- 7 Section- 4 Unit- 8 Solving a recurrence relation, Characteristics equations. Introduction To Propositional Calculus Logic, Conditional Propositions. Unit- 9 Quantifiers, Applications of Logic. Section- 5 Unit- 10 Unit- 11 Boolean Algebra & Its Applications Introduction Boolean Expressions and Boolean Functions. Identities of Boolean Algebra Duality, Algebra of Switching Circuits 1. Schaum's Outlines of Discrete Mathematics By Seymour Lipschutz, Marc Lipson 2. Mathematics for Computer Science. Eric Lehman and Tom Leighton PGDCA102 : Section- 1 Data Structures INTRODUCTION TO DATA STRUCTURES Unit- 1 Basic Concepts, Algorithms, Notations, Data Structure operations. Unit- 2 Implementations of Data Structures, Pseudo-code for Algorithms. Unit- 3 Mathematical Notations, Functions and Procedure Section- 2 Unit- 4 Unit- 5 ARRAYS Definitions, Array, Index or Subscript, Dimensions of an Array. Memory Allocation to Arrays, Memory Allocation to Onedimensional Array. Unit- 6 Memory Representation of Two Dimensional Arrays.
5 Unit- 7 Memory Allocation to Three Dimensional Array, Memory Allocation to Multidimensional Array. Unit- 8 Static and Dynamic Variables, Pointer Type Variables, Pointers in Pascal. Unit- 9 Pointers in C, Static and Dynamic Memory Allocation. Section- 3 LINKED LISTS Unit- 10 Dynamic Allocation of Memory, Representation of Linked List, Implementation of Linked List. Unit- 11 Insertion of a Node at the Beginning, Insertion of a Node at the End, Insertion of a Node after a Specified Node. Unit- 12 Traversing the Entire Linked List, Deletion of a Node from Linked List, Concatenation of Linked Lists. Unit- 13 Merging Linked Lists, Reversing of Linked List. Unit- 14 Applications of Linked List, Doubly Linked Lists, Circular Linked List, Generalized List. Section- 4 Unit- 15 Unit- 16 Unit- 17 STACK And Queue Implementation of Stack, Array-based Implementation, Pointer-based Implementation, Applications of Stacks, Maze Problem. Evaluation of Expressions, Evaluating Postfix Expression. Simulating Recursive Function using Stack, Passing Arguments. Unit- 18 Return from a Function, Simulation of Factorial, Proving Correctness of Parenthesis in an Expression. Unit- 19 Queue Implementation, Array-based Implementation, Pointerbased Implementation, Applications of Queues, Priority Queues. Section- 5 Trees and Graphs
6 Unit- 20 Section- 6 Trees, N-ary Tree, Linked Tree Representation, Binary Tree Traversal, Searching a Binary Tree, Heap Tree, AVL Trees, Threaded Trees, Splay Trees, B-Trees. Searching and Sorting Unit- 21 Linear or Sequential Search, Binary Search, Tree Searching, Breadth First Search (BFS), Depth First Search (DFS), General Search Trees, Hashing. Section- 7 GARBAGE COLLECTION AND COMPACTION, DYNAMIC MEMORY ALLOCATION Unit- 22 Reference Counting Garbage Collection,, When Objects Refer to Other Objects, Why Reference Counting Does Not Work, Mark-and-Sweep Garbage Collection. Unit- 23 The Fragmentation Problem, Stop-and-Copy Garbage Collection, The Copy Algorithm, Markand-Compact Garbage Collection. Unit- 24 The Heap, Singly Linked Free storage, Doubly Linked Free storage, Buddy System for Storage Management. 1. Purely functional data structures By Chris Okasaki 2. Algorithms and Data Structures :the science of computing by Chris Okasaki 3. Data Structures and Algorithms Bu Alfred V.Aho and Jeffrey D.Ullman PGDCA103 : Programming in C Section- 1 Units- 1 Section- 2 Unit- 2 Origin and Introduction Programming languages About C, Evolution of C, Structure of a C Program, Compilers & Interpreters Compiling a C Program, Pseudo Codes, A Simple C Program. Data Types, Variables and Constants Data Types Variables, Constants Operators, Type Modifiers and Expressions Operators Type Modifiers Expressions Type Definitions Using typedef. Introduction to Input / Output Console I/O Functions Unformatted Console I/O Functions.
7 Section- 3 Control Constructs Unit- 3 Control Statements, Conditional Statements, Loops in C The break Statement, The Continue Statement. Section- 4 Unit- 4 Section- 5 Arrays Introduction to Arrays One Dimensional Array Strings Two Dimensional, Array Multi- dimensional Array. Functions Unit- 5 Introduction to Functions, Function Declaration and Prototypes, Storage Classes Recursion in Function.Section- 6 Pointers Unit-6 Introduction to Pointers, Pointer Notation, Pointer Declaration and Initialization, Accessing Variable through Pointer, Pointer Expressions. Unit-7 Pointers and Section- 7 Unit- 8 Pointers and One Dimensional Arrays, Arrays of Pointers, Pointer to Pointers, Functions. Structures and Unions Structure Definition, Structure Initialization, Arrays of Structures, Arrays within Structures, Structures within Structures, Passing Structures to Functions. Unit- 9 Structure Pointers, Union Definition and Declaration, Accessing a Union Member, Initialization of a Union Variable, Use of User Defined Type Declarations. Section- 8 Unit- 10 Section- 9 Unit- 11 Files. Linked List Dynamic Memory Allocation, Linked List, Basic List Operations. File Handling in C What is a File, Defining and Opening a File, Functions for Random Access to 1. Programming in C By Stephen G. Kochan
8 2. Programming in C By M.T.Somashekara 3. Let Us C By Yashwant Kanitkar PGDCA104 : Financial Accounting UNIT 65: Financial Accounting an Introduction, Basic Accounting Concepts, Double Entry Accounting, The Accounting Trail UNIT 66: Financial Statements and Their Nature, the Accounting Equation UNIT 67: Recording in the Primary Books Introduction, Ground Rules of Journalisation, Journalisation, Types of Journals UNIT 68: Posting in Secondary Books Introduction, Types of Secondary Books, Posting Techniques in the Ledger UNIT 69: Bank Reconciliation Statement Introduction, Purpose of Bank Reconciliation Statements, Causes of Difference UNIT 70: Trial Balance and Final Accounts Introduction, Preparation of the Trial Balance, Errors and Their Rectification, Final Accounts UNIT 71: Accounting Standards in India Introduction, Indian Accounting Standards UNIT 72: Corporate Financial Statements Part-I Introduction, Statutory Books, Financial Statements, Comprehensive Illustration, UNIT 73: Directors Report, Significant Accounting Policies, Inventory Valuation UNIT 74: Corporate Financial Statements Part-II Introduction, Managerial Remuneration, Depreciation Accounting, UNIT 75: Provision for Taxation Case Study: Horizon Ltd. UNIT 76: Divisible Profits, Accounting Treatment of MODVAT, Prior period Adjustments UNIT 77: Understanding Published Financial Statements Introduction, Published Financial Statements A Case Study: JCT Electronics Ltd., Understanding Financial Statements.
9 UNIT 78: Interpretation of Financial Statements, Quantitative Disclosures UNIT 79: Consolidated Financial Statements Introduction, Legal Framework, Consolidated Financial Statements, Chain Holding UNIT 80: Accounting for Amalgamations Legal Framework, Definitions, Purchase Consideration, Determination of Swap Ratio, Methods of Accounting for Amalgamations, Asset Buyouts (ABOs) - 1. Financial Accounting 6e with Annual Report by Robert Libby, Patricia Libby, and Daniel G. Short (Hardcover - Jul 17, 2008) 2. Financial Accounting: Tools for Business Decision Making by Paul D. Kimmel, Jerry J. Weygandt, and Donald E. Kieso (Hardcover - Oct 24, 2008) 3. Financial Accounting: An Introduction to Concepts, Methods and Uses by Clyde P. Stickney, Roman L. Weil, Katherine Schipper, and Jennifer Francis (Hardcover - Feb 25, 2009) Semester II PGDCA 201 : Discrete Mathematics Section 1 Set Theory Unit-1 Relations and functions: Set notations and description. Unit-2 Subsets, basic set operations. Venn diagrams, laws of set theory. Unit-3 Partition of sets, min sets, duality principle. Section 2 Relations Unit-4 Basic definitions of relations and functions. Unit-5 Graphics of relations, properties of relations. Unit-6 Injective, surjective and bijective functions, composition. Section3 Unit-7 Combinations Rule of products, permutations, combinations.
10 Section 4 Unit-8 set. Unit-9 Unit-10 faces of Algebra Of Logic Propositions and logic operations, truth tables and propositions generated by equivalence and implication laws of logic, mathematical system, and propositions over a universe. Mathematical induction, quantifiers. Recursion and recurrence: The many recursion, recurrence, relations, and some common recurrence relations, generating functions. Section 5 Graph Theory Unit-11 Various types of graphics, simple and multigraphs. Unit-12 Directed and undirected graphs, Eulerian and Hamiltonian graph. Unit-13 Graph connectivity, traversals, graph optimizations. Unit-14 Graph coloring, trees, spanning trees, rooted trees, binary trees. 1. Discrete Mathematics and Its Applications by Kenneth H. Rosen 2. Discrete Mathematics with Applications by Susanna S. Epp PGDCA202 : DBMS Section 1 Unit-1 Section 2 Introduction to Databases Database and its Hierarchies, History of Databases, Types of DBMS. Database Environment Unit-2 Database and DBMS Software, Database Architectural. Unit-3 Three Layered Architectural/O Functions. Unit-4 Characteristics of Database Approach. Section 3 Unit-5 Unit-6 Relational Model Logical Data Models, Relational Data Model. Querying Relational Data, Relational Algebra, Relational Calculus. Section 4 Unit-7 Unit-8 Updating SQL: Data Manipulation, Data Definition SQL Language, SQL Database Objects. SQL Data Types, DDL, DML and TCL Commands, Retrieving Data, Inserting Data, Data, Deleting Data.
11 Unit-9 Section 5 Unit-10 Database Unit- 11 Unit-12 Section 6 Creating and Altering Tables, Views, Sequence, Index. Database Planning, Design And Administration Database Application Life-cycle, Alternate System Development Methodologies, Planning, System Definition. Requirements Collections and Analysis, Database Design. DBMS Selection, Application Design, Database Administration Entity Relationship Modeling, Normalization Unit-13 Database Design, Entity, Attributes and Entity Sets. Unit-14 Relationships and Relationship Sets, ER Diagrams. Unit-15 Additional Features of ER Model, Conceptual Database Design with the ER Model, Anomalies in Databases, Redundancy. Unit-16 Inconsistency, Update Anomalies, Good Database Designing. Unit-17 First Normal Form (1NF),Second Normal Form (2NF), Third Normal Form (3NF), Boyce- Codd Normal Form, Fourth Normal Form (4NF). Section 7 Unit-18 Unit-19 Database Security Access Control, Discretionary Access Control. Mandatory Access Control, Additional Issues to Security. 1. Database design for mere mortals. Hernandez 2. Database management by Watson PGDCA203 : OOPS with C++ Section 1 Classes And Objects Unit-1 Introduction, Class, Object. Unit-2 Nature of Class, Types of Relationships, "Kind of" Relationship, "Is a" Relationship, "Has a" Relationship/Part of Relationship, Classification of Classes, Abstraction. Section 2 Unit-3 Unit-4 Constructors And Destructors And Operators Overloading Introduction, Constructors, Destructors. Introduction-Operators Overloading, Example, Type Conversion.
12 Section 3 Unit-5 Unit-6 Unit-7 Section 4 Inheritance, Polymorphism And Virtual Functions Introduction- Inheritance. Type of Inheritance, Introduction- Polymorphism. Virtual Functions, Need for Virtual Functions, Rules for Virtual Functions. File Handling Unit-8 Introduction, files, Stream Input/Output, Buffering and Flush. Unit-9 Exception Handling, String Handling, Sequential Fixed Length Structure. Unit-10 Linked List Fixed Size Nodes, Strings Manipulations. Unit-11 Character String Output Functions,String Handling Functions Postfix Expression, Simulating. Section 5 Unit-12 Unit-13 Arrays Introduction, Arrays, Array Declaration. Important Points about Arrays, Multidimensional Arrays. 1. Object Oriented Programming With C++ - E Balagurusamy 2. Object Oriented Programming Using C++, Sanjeev Sofat, Cyber Tech. Publication PGDCA204 : Computer Organization and Architecture Section 1 Unit-1 Unit-2 Introduction Computer System, Components of a Computer System. Computer Organization, Data Representation, Performance Factors. Section 2 Central Processing Unit Unit-3 Introduction, General Register Organization. Unit-4 Stack Organization, Instruction Formats. Unit-5 Addressing Modes, Program Control, Program Interrupt. Section 3 Unit-6 Unit-7 Control Unit Introduction, Control Memory, Microprogramming. Computer Configuration, Design of Control Unit, Overview of RISC/CISC. Section 4 Memory Organization Unit-8 Memory Hierarchy, Main Memory or Primary Memory. Unit-9 Design of Main Memory,Auxiliary Memory. Unit-10 Virtual Memory, Memory Management,Associative Memory.
13 Section 5 Input-Output Devices Unit-11 Introduction, Peripheral, Asynchronous Communication. Unit-12 Asynchronous Serial Transfer, Asynchronous Communication Interface. Unit-13 Synchronous Communication, Character-Oriented Protocol. Unit-14 Input-Output Interface, Modes of Data Transfer. Unit-15 Interrupt, Multiple Interrupts,Direct Memory Access (DMA). Section 6 Hardware Interfacing Issues Unit-16 Introduction, I/O Processing. Unit-17 Bus Interface, I/O versus Memory Bus. Unit-18 Data Transfer Techniques, Mode of Transfer, Software Routines. Unit-19 Direct Memory Access (DMA), Input-output Processor (IOP), CPU-IOP Communication, Channel. 1. Computer organization and architecture by William Stallings 2. Essentials of Computer Organization and Architecture, Second Edition by Linda Null and Julia Lobur
KITES TECHNOLOGY COURSE MODULE (C, C++, DS)
KITES TECHNOLOGY 360 Degree Solution www.kitestechnology.com/academy.php info@kitestechnology.com technologykites@gmail.com Contact: - 8961334776 9433759247 9830639522.NET JAVA WEB DESIGN PHP SQL, PL/SQL
More informationALLIED 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
More informationDATA STRUCTURES USING C
DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give
More informationBCS2B02: OOP Concepts and Data Structures Using C++
SECOND SEMESTER BCS2B02: OOP Concepts and Data Structures Using C++ Course Number: 10 Contact Hours per Week: 4 (2T + 2P) Number of Credits: 2 Number of Contact Hours: 30 Hrs. Course Evaluation: Internal
More information2) What is the structure of an organization? Explain how IT support at different organizational levels.
(PGDIT 01) Paper - I : BASICS OF INFORMATION TECHNOLOGY 1) What is an information technology? Why you need to know about IT. 2) What is the structure of an organization? Explain how IT support at different
More informationKrishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C
Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate
More informationADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science
ADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science Program Schedule CTech Computer Science Credits CS101 Computer Science I 3 MATH100 Foundations of Mathematics and
More informationBachelor 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
More informationJava EE Web Development Course Program
Java EE Web Development Course Program Part I Introduction to Programming 1. Introduction to programming. Compilers, interpreters, virtual machines. Primitive types, variables, basic operators, expressions,
More informationEastern 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
More informationData Structure [Question Bank]
Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:
More informationCOMPUTER SCIENCE. 1. Computer Fundamentals and Applications
COMPUTER SCIENCE 1. Computer Fundamentals and Applications (i)generation of Computers, PC Family of Computers, Different I/O devices;introduction to Operating System, Overview of different Operating Systems,
More informationThomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation
Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science updated 03/08/2012 Unit 1: JKarel 8 weeks http://www.fcps.edu/is/pos/documents/hs/compsci.htm
More informationCourse Name: ADVANCE COURSE IN SOFTWARE DEVELOPMENT (Specialization:.Net Technologies)
Course Name: ADVANCE COURSE IN SOFTWARE DEVELOPMENT (Specialization:.Net Technologies) Duration of Course: 6 Months Fees: Rs. 25,000/- (including Service Tax) Eligibility: B.E./B.Tech., M.Sc.(IT/ computer
More informationCurriculum Map. Discipline: Computer Science Course: C++
Curriculum Map Discipline: Computer Science Course: C++ August/September: How can computer programs make problem solving easier and more efficient? In what order does a computer execute the lines of code
More informationWORKSPACE WEB DEVELOPMENT & OUTSOURCING TRAINING CENTER
WORKSPACE WEB DEVELOPMENT & OUTSOURCING TRAINING CENTER Course Outline (2015) Basic Programming With Procedural & Object Oriented Concepts (C, C++) Training Office# Road: 11, House: 1 A, Nikunja 2, Khilkhet,
More informationClass XII (Theory) C++
Class XII (Theory) C++ Duration: 3 hours Total Marks: 70 Unit No. Unit Name Marks 1. OBJECT ORIENTED PROGRAMMING IN C++ 30 2. DATA STRUCTURE 14 3. DATABASE MANAGEMENT SYSTEM AND SQL 8 4. BOOLEAN ALGEBRA
More information10CS35: Data Structures Using C
CS35: Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C OBJECTIVE: Learn : Usage of structures, unions - a conventional tool for handling a
More informationJava 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
More informationCompuScholar, Inc. Alignment to Utah's Computer Programming II Standards
CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards Course Title: TeenCoder: Java Programming Course ISBN: 978 0 9887070 2 3 Course Year: 2015 Note: Citation(s) listed may represent
More informationB.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
More informationFundamentals of Java Programming
Fundamentals of Java Programming This document is exclusive property of Cisco Systems, Inc. Permission is granted to print and copy this document for non-commercial distribution and exclusive use by instructors
More informationJava Software Structures
INTERNATIONAL EDITION Java Software Structures Designing and Using Data Structures FOURTH EDITION John Lewis Joseph Chase This page is intentionally left blank. Java Software Structures,International Edition
More informationAssessment 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
More informationDivision 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
More informationBachelor of Computer Application (BCA)
Karnataka State Open University Mysore, Karnataka 570006 Syllabus Bachelor of Computer Application (BCA) Page 0 of 29 Bachelor of Computer Application (BCA) Semester I CODE SUBJECT CREDITS Computer Fundamentals
More informationBangalore University B.Sc Computer Science Syllabus ( Semester System)
Bangalore University B.Sc Computer Science Syllabus ( Semester System) First Semester CSIT1: Computer Fundamentals and C Programming CSIP1: C Programming Lab Second Semester CSIIT1: Data Structures and
More information2010-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
More information5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.
1. The advantage of.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. [A] Lists [B] Linked Lists [A] Trees [A] Queues 2. The
More information2. Advance Certificate Course in Information Technology
Introduction: 2. Advance Certificate Course in Information Technology In the modern world, information is power. Acquiring information, storing, updating, processing, sharing, distributing etc. are essentials
More informationUniversity of Dayton Department of Computer Science Undergraduate Programs Assessment Plan DRAFT September 14, 2011
University of Dayton Department of Computer Science Undergraduate Programs Assessment Plan DRAFT September 14, 2011 Department Mission The Department of Computer Science in the College of Arts and Sciences
More informationAP Computer Science AB Syllabus 1
AP Computer Science AB Syllabus 1 Course Resources Java Software Solutions for AP Computer Science, J. Lewis, W. Loftus, and C. Cocking, First Edition, 2004, Prentice Hall. Video: Sorting Out Sorting,
More informationDomains 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
More informationGlossary of Object Oriented Terms
Appendix E Glossary of Object Oriented Terms abstract class: A class primarily intended to define an instance, but can not be instantiated without additional methods. abstract data type: An abstraction
More informationJava (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
More informationwww.gr8ambitionz.com
Data Base Management Systems (DBMS) Study Material (Objective Type questions with Answers) Shared by Akhil Arora Powered by www. your A to Z competitive exam guide Database Objective type questions Q.1
More informationEastern 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
More informationEl Dorado Union High School District Educational Services
El Dorado Union High School District Course of Study Information Page Course Title: ACE Computer Programming II (#495) Rationale: A continuum of courses, including advanced classes in technology is needed.
More informationOperating Systems CSE 410, Spring 2004. File Management. Stephen Wagner Michigan State University
Operating Systems CSE 410, Spring 2004 File Management Stephen Wagner Michigan State University File Management File management system has traditionally been considered part of the operating system. Applications
More informationAbstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types
EECS 281: Data Structures and Algorithms The Foundation: Data Structures and Abstract Data Types Computer science is the science of abstraction. Abstract Data Type Abstraction of a data structure on that
More informationTHREE YEAR DEGREE (HONS.) COURSE BACHELOR OF COMPUTER APPLICATION (BCA) First Year Paper I Computer Fundamentals
THREE YEAR DEGREE (HONS.) COURSE BACHELOR OF COMPUTER APPLICATION (BCA) First Year Paper I Computer Fundamentals Full Marks 100 (Theory 75, Practical 25) Introduction to Computers :- What is Computer?
More informationCourse MS10975A Introduction to Programming. Length: 5 Days
3 Riverchase Office Plaza Hoover, Alabama 35244 Phone: 205.989.4944 Fax: 855.317.2187 E-Mail: rwhitney@discoveritt.com Web: www.discoveritt.com Course MS10975A Introduction to Programming Length: 5 Days
More informationJava the UML Way: Integrating Object-Oriented Design and Programming
Java the UML Way: Integrating Object-Oriented Design and Programming by Else Lervik and Vegard B. Havdal ISBN 0-470-84386-1 John Wiley & Sons, Ltd. Table of Contents Preface xi 1 Introduction 1 1.1 Preliminaries
More informationPES Institute of Technology-BSC QUESTION BANK
PES Institute of Technology-BSC Faculty: Mrs. R.Bharathi CS35: Data Structures Using C QUESTION BANK UNIT I -BASIC CONCEPTS 1. What is an ADT? Briefly explain the categories that classify the functions
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK A REVIEW ON THE USAGE OF OLD AND NEW DATA STRUCTURE ARRAYS, LINKED LIST, STACK,
More informationOKLAHOMA 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
More informationInformation 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
More informationWESTMORELAND COUNTY PUBLIC SCHOOLS 2011 2012 Integrated Instructional Pacing Guide and Checklist Computer Math
Textbook Correlation WESTMORELAND COUNTY PUBLIC SCHOOLS 2011 2012 Integrated Instructional Pacing Guide and Checklist Computer Math Following Directions Unit FIRST QUARTER AND SECOND QUARTER Logic Unit
More informationPART-A Questions. 2. How does an enumerated statement differ from a typedef statement?
1. Distinguish & and && operators. PART-A Questions 2. How does an enumerated statement differ from a typedef statement? 3. What are the various members of a class? 4. Who can access the protected members
More informationUniversity of Pune Revised Structure for the B. Sc. (Computer Science) Course (Second Year to be implemented from Academic Year 2014-2015)
University of Pune Revised Structure for the B. Sc. (Computer Science) Course (Second Year to be implemented from Academic Year 2014-2015) S. Y. B. Sc. (Computer Science) No Paper Title: Semester I Title:
More informationAn Introduction to Programming and Computer Science
An Introduction to Programming and Computer Science Maria Litvin Phillips Academy, Andover, Massachusetts Gary Litvin Skylight Software, Inc. Skylight Publishing Andover, Massachusetts Copyright 1998 by
More informationDepartment 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
More informationCOURSE 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
More information1. INTRODUCTION TO RDBMS
Oracle For Beginners Page: 1 1. INTRODUCTION TO RDBMS What is DBMS? Data Models Relational database management system (RDBMS) Relational Algebra Structured query language (SQL) What Is DBMS? Data is one
More informationC++ Programming Language
C++ Programming Language Lecturer: Yuri Nefedov 7th and 8th semesters Lectures: 34 hours (7th semester); 32 hours (8th semester). Seminars: 34 hours (7th semester); 32 hours (8th semester). Course abstract
More informationChapter 11 I/O Management and Disk Scheduling
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 11 I/O Management and Disk Scheduling Dave Bremer Otago Polytechnic, NZ 2008, Prentice Hall I/O Devices Roadmap Organization
More informationComputer Science. 232 Computer Science. Degrees and Certificates Awarded. A.S. Degree Requirements. Program Student Outcomes. Department Offices
232 Computer Science Computer Science (See Computer Information Systems section for additional computer courses.) We are in the Computer Age. Virtually every occupation in the world today has an interface
More informationIT2304: Database Systems 1 (DBS 1)
: Database Systems 1 (DBS 1) (Compulsory) 1. OUTLINE OF SYLLABUS Topic Minimum number of hours Introduction to DBMS 07 Relational Data Model 03 Data manipulation using Relational Algebra 06 Data manipulation
More informationSummit Public Schools Summit, New Jersey Grade Level / Content Area: Mathematics Length of Course: 1 Academic Year Curriculum: AP Computer Science A
Summit Public Schools Summit, New Jersey Grade Level / Content Area: Mathematics Length of Course: 1 Academic Year Curriculum: AP Computer Science A Developed By Brian Weinfeld Course Description: AP Computer
More informationHome Page. Data Structures. Title Page. Page 1 of 24. Go Back. Full Screen. Close. Quit
Data Structures Page 1 of 24 A.1. Arrays (Vectors) n-element vector start address + ielementsize 0 +1 +2 +3 +4... +n-1 start address continuous memory block static, if size is known at compile time dynamic,
More informationINFORMATION 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.
More informationCopyright 2007 Ramez Elmasri and Shamkant B. Navathe. Slide 13-1
Slide 13-1 Chapter 13 Disk Storage, Basic File Structures, and Hashing Chapter Outline Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files Hashed Files Dynamic and Extendible
More informationComputing Concepts with Java Essentials
2008 AGI-Information Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. Computing Concepts with Java Essentials 3rd Edition Cay Horstmann
More informationJava 6 'th. Concepts INTERNATIONAL STUDENT VERSION. edition
Java 6 'th edition Concepts INTERNATIONAL STUDENT VERSION CONTENTS PREFACE vii SPECIAL FEATURES xxviii chapter i INTRODUCTION 1 1.1 What Is Programming? 2 J.2 The Anatomy of a Computer 3 1.3 Translating
More informationEastern 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
More informationAndroid Application Development Course Program
Android Application Development Course Program Part I Introduction to Programming 1. Introduction to programming. Compilers, interpreters, virtual machines. Primitive data types, variables, basic operators,
More informationRARITAN 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
More informationMSc 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
More informationChapter 13 Disk Storage, Basic File Structures, and Hashing.
Chapter 13 Disk Storage, Basic File Structures, and Hashing. Copyright 2004 Pearson Education, Inc. Chapter Outline Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files
More informationComputer 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
More informationChapter 13. Disk Storage, Basic File Structures, and Hashing
Chapter 13 Disk Storage, Basic File Structures, and Hashing Chapter Outline Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files Hashed Files Dynamic and Extendible Hashing
More informationCOMPUTER 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
More informationML for the Working Programmer
ML for the Working Programmer 2nd edition Lawrence C. Paulson University of Cambridge CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface to the Second Edition Preface xiii xv 1 Standard ML 1 Functional Programming
More informationDE 6211 DISTANCE EDUCATION. M.Sc. (IT) DEGREE EXAMINATION, MAY 2013. PRINCIPLES OF INFORMATION TECHNOLOGY. (2002 onwards) PART A (10 3 = 30 marks)
Ws 20 DE 6211 11 DISTANCE EDUCATION M.Sc. (IT) DEGREE EXAMINATION, MAY 2013. PRINCIPLES OF INFORMATION TECHNOLOGY (2002 onwards) Time : Three hours Maximum : 100 marks PART A (10 3 = 30 marks) Answer ALL
More informationChapter 126. Texas Essential Knowledge and Skills for Technology Applications. Subchapter C. High School
High School 126.C. Chapter 126. Texas Essential Knowledge and Skills for Technology Applications Subchapter C. High School Statutory Authority: The provisions of this Subchapter C issued under the Texas
More informationProgramming and Software Development CTAG Alignments
Programming and Software Development CTAG Alignments This document contains information about four Career-Technical Articulation Numbers (CTANs) for Programming and Software Development Career-Technical
More informationCourse 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
More informationMathematics for Algorithm and System Analysis
Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface
More informationPaper-I (MCA-101) : Introduction to Information Technology
Paper-I (MCA-101) : Introduction to Information Technology (Note : Only introductory concepts to be taught in the course.) Information Concepts and Processing: Definition, Need, Qualities, value of information.
More informationTECHNOLOGY Computer Programming II Grade: 9-12 Standard 2: Technology and Society Interaction
Standard 2: Technology and Society Interaction Technology and Ethics Analyze legal technology issues and formulate solutions and strategies that foster responsible technology usage. 1. Practice responsible
More informationSample Questions Csci 1112 A. Bellaachia
Sample Questions Csci 1112 A. Bellaachia Important Series : o S( N) 1 2 N N i N(1 N) / 2 i 1 o Sum of squares: N 2 N( N 1)(2N 1) N i for large N i 1 6 o Sum of exponents: N k 1 k N i for large N and k
More informationPlease consult the Department of Engineering about the Computer Engineering Emphasis.
COMPUTER SCIENCE Computer science is a dynamically growing discipline. ABOUT THE PROGRAM The Department of Computer Science is committed to providing students with a program that includes the basic fundamentals
More informationIT2305 Database Systems I (Compulsory)
Database Systems I (Compulsory) INTRODUCTION This is one of the 4 modules designed for Semester 2 of Bachelor of Information Technology Degree program. CREDITS: 04 LEARNING OUTCOMES On completion of this
More informationComputer Science. Computer Science 207. Degrees and Certificates Awarded. A.S. Computer Science Degree Requirements. Program Student Outcomes
Computer Science 207 Computer Science (See Computer Information Systems section for additional computer courses.) We are in the Computer Age. Virtually every occupation in the world today has an interface
More information1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++
Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The
More informationCurriculum for the Bachelor Degree in Computer Science (CS)
The curriculum for the B.Sc. degree in consists of (2) credit hours distributed as follows:- Course 2 4 Requirements University Requirements Compulsory Elective Faculty Requirements Specialization Requirements
More informationPROBLEM SOLVING SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON
PROBLEM SOLVING WITH SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON Addison Wesley Boston San Francisco New York London
More information1. Relational database accesses data in a sequential form. (Figures 7.1, 7.2)
Chapter 7 Data Structures for Computer Graphics (This chapter was written for programmers - option in lecture course) Any computer model of an Object must comprise three different types of entities: 1.
More informationObjected oriented Programming: C++ Unit 1 1. Introduction 1.1. Introduction to Object Oriented Programming. 1.2. C++ fundamentals.
Gujarat University Choice Based Credit System (CBCS) Syllabus for B. Sc. Semester III (Computer Science) COM 201: DATA STRUCTURE USING C++ (Theory) Hours: 4 /week Credits: 4 Objected oriented Programming:
More information1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D.
1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D. base address 2. The memory address of fifth element of an array can be calculated
More informationSyllabus for Computer Science. Proposed scheme for B.Sc Programme under Choice Based Credit System
Syllabus for Computer Science Proposed scheme for B.Sc Programme under Choice Based Credit System SEMESTER - I Code Course Title Course Type HPW Credits BS106 SEMESTER -I I BS 206 SEMESTER -III BS 301
More informationFacebook Twitter YouTube Google Plus Website Email
PHP MySQL COURSE WITH OOP COURSE COVERS: PHP MySQL OBJECT ORIENTED PROGRAMMING WITH PHP SYLLABUS PHP 1. Writing PHP scripts- Writing PHP scripts, learn about PHP code structure, how to write and execute
More informationSpecialized Programme on Web Application Development using Open Source Tools
Specialized Programme on Web Application Development using Open Source Tools A. NAME OF INSTITUTE Centre For Development of Advanced Computing B. NAME/TITLE OF THE COURSE C. COURSE DATES WITH DURATION
More informationBCA. Database Management System
BCA IV Sem Database Management System Multiple choice questions 1. A Database Management System (DBMS) is A. Collection of interrelated data B. Collection of programs to access data C. Collection of data
More informationEmbedded Programming in C/C++: Lesson-1: Programming Elements and Programming in C
Embedded Programming in C/C++: Lesson-1: Programming Elements and Programming in C 1 An essential part of any embedded system design Programming 2 Programming in Assembly or HLL Processor and memory-sensitive
More informationCSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.
Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure
More informationDepartment of Computer Science
University of Denver 1 Department of Computer Science Office: Aspen Hall North, Suite 100 Mail Code: 2280 S. Vine St. Denver, CO 80208 Phone: 303-871-3010 Email: info@cs.du.edu Web Site: http://www.du.edu/rsecs/departments/cs
More informationComputer Science 1-3 (AP) Syllabus/Online Course Plan
Computer Science 1-3 (AP) Syllabus/Online Course Plan Certificated Teacher: Date: 2015-2016 Stage One Desired Results Course Title/Grade Level: Computer Science (AP) Credit: one semester (.5) _X_ two semesters
More information