# Syllabus for Computer Science

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Syllabus for Computer Science PAPER I UNIT 1 :Mathematics and Graph Theory Set theory Notations, set operations, power set, set identities, Relations and ordering Relations, Properties of Binary relation, Matrix representation of relations, Closures of relations, Equivalence relations, Partial order relation. Functions Introduction, Composition of Functions, Inverse Functions Mathematical Logics Connectives, Negation, Conjunction, Disjunction, Statement Formulas and Truth Tables, Conditional and Bi conditional. Tautologies Equivalence of Formulas, Tautological Implications, Theory of Inference and deduction, Predicate Calculus, Mathematical Induction. Graph Theory Paths and Cycles, Hamiltonian Cycles and the Traveling Salesperson problem, a shortest path algorithm, representations of graphs, isomorphism of graphs, planar graphs. Semi Groups and Groups Semi groups products and quotients of semi groups, groups, products and quotients of groups, Groups and coding. UNIT 2: Digital Electronics and Computer Design Number System Different types of number systems, Conversion from one system to another, signed numbers representation, complements, BCD codes,alphanumeric codes, Logic gates Boolean algebra laws, Demorgan s theorem, SOP and POS, K map. Combinational and sequential logic circuits Adders, Subtractors, parallel adders, Multiplexer and De multiplexers, Encoder&Decoder, Latches,Different typesof FLIP FLOPs with their design, Synchronous and Asynchronous counters, Up and down synchronous counters, cascaded counters, Shift registers. Computer architecture concepts operand addressing, addressing modes, instruction set architectures, data transfer instructions, data manipulation instructions, floating point computations, program control instructions, program interrupts. Central Processing Unit designs The complex instruction set computer, the reduced instruction set computer, Input Output and Communication, memory systems hierarchy. UNIT 3: Algorithms and C Programming The problem solving aspect top down design, characteristics of algorithms, implementation of algorithms, program verification, efficiency of algorithms, analysis of algorithms. C Language Features, Data types, Operators in C, Expressions, Input/output in C, Decision making and looping statements, functions, Arrays, Structure and union, string handling functions.

3 Linkage. Macroprocessor Macro instruction, macro with arguments, conditional macro expansion, and macro calls within macro, Specification of databases and formats, algorithm for macro definition processing. Compiler Compiler Phases, code optimization techniques Machine independent and dependent code optimization techniques, Parsing Techniques Top down parse LL, Recursive descent, Operator precedence, LR parsers. Operating system Functions and Services, Types of Operating system batch, multiprogramming, time sharing, Process Process state, Scheduling criteria, Scheduling policies, Threading concepts and Multithreading. Memory management Non virtual memory management techniques Contiguous, partitioned, paging techniques, virtual memory management techniques, page replacement algorithms FIF, LRU, tuple coupling, overlays. Process Synchronization Critical section problem,bakery Algorithm, Semaphores, Synchronization problems Bounded Buffer Problem, Readers Writers problem and Dining Philosophers problem. Deadlocks Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Avoidance and recovery, Banker algorithms, Disk scheduling disk scheduling algorithms, file management file concept, file allocation and access, directory structures. UNIX Features of UNIX, Architecture, Different types of shell, File and directory related command, file system, filters in UNIX, UNIX editor, shell programming, administrative commands. PAPER II UNIT 7: Design and Analysis of Algorithms Performance analysis, asymptotic notation, analysis of recursive and iterative algorithm. Divide and Conquer Binary search, Quick sort, merge sort, Finding maximum and minimum. Greedy method Knapsack Problem,Prim's algorithm, Dijkstra'a algorithm, Huffman trees. Dynamic programming and traversal techniques 0/1 Knapsack, travelling salesman, all pair shortest path, Breadth first search and Depth first search techniques. Branch and bound and backtracking 0/1 knapsack, travelling salesman, 8 queens problem, graph coloring, Decision trees, P, NP, and NP complete problems.

4 UNIT 8: Relational Data Base Management and Data Mining Database Architecture, Data Models, Abstractions, ER Model, Relational DataModel Relational algebra and Relational calculus, Relational model Constraints, Primary key, secondary key, Candidate key, Foreign key. SQL data types, DDL, DML and TCL and DCL commands, Set Operations, Aggregate functions, Views, Joins, index, sequences, synonyms, data dictionary, Normalization 1NF, 2NF, Functional Dependencies, Transitive and Multivalued dependency 3NF, BCNF, Advantages of RDBMS Codd srules. Transaction processing desirable properties of transaction, schedules and recoverability, serializability of schedules concurrency control, locking techniques, time stamp ordering multi version concurrency control, granularity of data items. Database recovery techniques based on deferred up data and immediate updating, shadowpages, ARIES recovery algorithm, database security and authorization, security issue access control based on granting/revoking of privileges, introduction of statistical database security. Data mining concepts related to data mining and data warehousing, data mining stages, preprocessing, Association and Correlation, Classification and Clustering. UNIT 9: Computer Networks and Mobile Communication Data communication Components of communication systems, Topologies, Transmission modes. Signal transmission Analog and Digital transmission, Encoding techniques, Guided and unguided communication media. OSI model Services of various layers, Internetworking devices, Protocols TCP, UDP, IP, IPV4, IPV6, TCP/IP Suite, SMTP, Datagram and virtual circuits. Switching networks Circuit, Packet and message switching, ALOHA, Routing algorithm Shortest path, congestion control, 802 LAN standards, Multiplexing and Demultiplexing, RPC, TCP, UDP. Mobile Communication wireless communication, a simplified reference model, frequencies for radio transmission, spread spectrum, cellular systems. Medium access control SDMA, FDMA, TDMA, CDMA Telecommunications and satellite systems: GSM, DELT, TETRA, UMTS, and IMT 2000, basics of satellite systems, routing, localization, handover. Wireless LAN infrared vs radio transmission, infrastructure and adhoc network, IEEE HIPER LAN, BlueTooth. Mobile Network Layer and Transport Layer Mobile IP, dynamic host configuration protocol, mobile adhoc networks, TCP over 2.5/3G wireless networks, WAP 2.0.

5 Unit 10: Software Engineering Different software development process model with their merits and demerits, Characteristics of software process, Software Metrics, Software planning :Estimation of efforts, cost estimation model, project scheduling and staffing, risk assessment and management, project monitoring and planning. Problem analysis SRS, Components and characteristics, Specification language, validation, design principles and methodology Modular, Top down and bottom up, Object oriented, DFD. Coding and Testing Programming guidelines and characteristics, Structured programming, information hiding, Testing Levels of testing, Block box and white box testing, verification and validation. Software quality assurance, Software Maintenance Need for maintenance, maintenance activities, Different types of maintenance Overview of object oriented systems Object oriented analysis and design concepts, modelling concepts. Introduction to UML Basic expression of classes, attributes and operations, Class diagrams, generalization and association constructs composition and aggregation, Use case diagrams, Object interaction diagrams, collaboration diagrams, sequence diagrams, asynchronous messages and concurrent execution, State diagrams. Activity diagrams, Architecture diagrams, Encapsulation structure,inheritance, polymorphism. UNIT 11: Computer Graphics and Digital Image Processing Computer Graphics Applications, Graphical input and output devices, Scan conversions method, Line and Circle drawing algorithm DDA, Brenham s and Mid point method. 2D and 3D geometrical transformations Basic and Composite 2D transformation, transformations in homogeneous notation, Basic 3D transformation, Projection parallel projection, orthographic projection, oblique projection, perspective projection, clipping algorithms. Digital Image Processing Fundamentals Steps in Image Processing, Image Sampling and Quantization, Image Enhancement in the Spatial Domain, Image Enhancement in the Frequency Domain, Image Restoration. Image Segmentation Detection of Discontinuities, Edge linking and boundary detection, Thresholding, Region Oriented Segmentation, Motion based segmentation, Representation and Description. Introduction to Morphology Morphological Algorithms, Object Recognition Patterns and Pattern Classes, Decision Theoretic Methods, Structural Methods.

6 UNIT 12: Internet Programming and E Commerce World Wide Web Concepts, Web pages Static, Dynamic, Active, Scripting languages Server side, Client Side, Web site development phases, Web Designing, Development and Publishing, HTTP, URL registration, Web server, Proxy servers. HTML & XHTML Basic layout of HTML, Head Section: title, base, link, meta. Body Section: Text formatting and alignment, fonts, colors, ordered and unordered lists, links, images, sounds, video, background, tables, forms, frames. Introduction to XHTML and DHTML, Issues in Web site creations & Maintenance, Web Hosting and publishing Concepts. ASP.NET Controls, Applications, Buttons, Text Box, Labels, Checkbox, Radio Buttons, List Box. Adding controls at runtime. Running a web Application, creating a multiform web project. Form Validation Client side validation, server Side validation, Validation Controls, Internet Explorer Control. Overview of ADO.NET architecture, Accessing Data using Data Adapters and Datasets, using Command & Data Reader, binding data to data bind Controls, displaying data in data grid, VB and.net, VB.NET features. E Commerce Shopping cart technology, E commerce solutions using IIS architecture Domain model Site server application Intelligent agents Internet marketing. Electronic Payment System: Real World Payment System, Electronic funds transfer, Digital payment, Electronic data interchange(edi). Security Threats to Network security, Public key cryptography, Secured sockets layer, Secure electronic transactions, Network security solutions, Firewalls.

### Programme Outcome COURSE OUTCOMES MCA

Programme Outcome PO1: To provide trained human resource for the IT industry. COURSE OUTCOMES MCA MCA 101 : Object Oriented Programming CO1 The students develops a sound approach to problem solving using

### Adikavi Nannaya University, Rajahmundry MCA III Semester 3.1 Computer Networks (Model Question Paper) Time : 3 Hours Max.

3.1 Computer Networks (Model Question Paper) 1. a)with a neat block diagram explain the TCP/IP reference model. List out the limitations of the model. [15] (b) What are the functions of the physical layer?

### GANPAT UNIVERSITY FACULTY OF COMPUTER APPLICATIONS

GANPAT UNIVERSITY FACULTY OF COMPUTER APPLICATIONS SYLLABUS FOR ENTRANCE EXAMINATION Ph. D. PROGRAM Note: The Question Paper for Entrance Examination for Ph.D. Program in Computer Science and Applications

### CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 25: Review and Open Problems Course Overview Programming Concepts Object-Oriented Programming Interfaces

### B.Sc II Year Computer Science (Optional)

Swami Ramanand Teerth Marathwad University, Nanded B.Sc II Year Computer Science (Optional) (Semester Pattern) ( W.E.F. June 2010) Paper No VI VII Paper Title Digital Electronics & 8085 Microprocessor

### CHEME OF EXAMINATION FOR B.Sc. (COMPUTER SCIENCE) SEMESTER SYSTEM (Regular Course) w.e.f Scheme for B.Sc.-III.

CHEME OF EXAMINATION FOR B.Sc. (COMPUTER SCIENCE) SEMESTER SYSTEM (Regular Course) w.e.f. 2015-16 Scheme for B.Sc.-III Semester-V Sr. No. Paper Internal Assessment External Marks Exam Duration 1 Paper-I

### WITH C+ + William Ford University of the Pacific. William Topp University of the Pacific. Prentice Hall, Englewood Cliffs, New Jersey 07632

DATA STRUCTURES WITH C+ + William Ford University of the Pacific William Topp University of the Pacific Prentice Hall, Englewood Cliffs, New Jersey 07632 CONTENTS Preface xvii CHAPTER 1 INTRODUCTION 1

### Textbook Charles Petzold, Programming Windows, 5th edition, Microsoft Press. References - other textbooks or materials none

CS351 Systems Programming Last Updated - 03/01/02 Course Manager Dr. Phil Dickens, Assistant Professor 3 credit hours; required for CS & CPE; 100 min. lecture & 100 min. lab each week Current Catalog Description

### 1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?

(DMCA 101) ASSIGNMENT - 1, DEC - 2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with

### Computer Science and Engineering Technology Course Descriptions

Computer Science and Engineering Technology Course Descriptions CSET 121 Introduction Computer Programming (2-3-3) Problem solving. Introduction to a typical programming language. Basic data types. Selection

### DEPARTMENT OF COMPUTER SCIENCE

Department of Computer Science 1 DEPARTMENT OF COMPUTER SCIENCE Office in Computer Science Building, Room 279 (970) 491-5792 cs.colostate.edu (http://www.cs.colostate.edu) Professor L. Darrell Whitley,

### Syllabus & Curriculum for Certificate Course in Java. CALL: , for Queries

1 CONTENTS 1. Introduction to Java 2. Holding Data 3. Controllin g the f l o w 4. Object Oriented Programming Concepts 5. Inheritance & Packaging 6. Handling Error/Exceptions 7. Handling Strings 8. Threads

### MaanavaN.Com DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING QUESTION BANK

CS1301 DATABASE MANAGEMENT SYSTEM DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING QUESTION BANK Sub code / Subject: CS1301 / DBMS Year/Sem : III / V UNIT I INTRODUCTION AND CONCEPTUAL MODELLING 1. Define

### Computer Engineering Syllabus 2017

INTRODUCTION The Canadian Engineering Qualifications Board of Engineers Canada issues the Examination Syllabus that includes a continually increasing number of engineering disciplines. Each discipline

### Telecommunications Engineering Course Descriptions

Telecommunications Engineering Course Descriptions Electrical Engineering Courses EE 5305 Radio Frequency Engineering (3 semester hours) Introduction to generation, transmission, and radiation of electromagnetic

### (DMCS21) User Interface Design. ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, DEC (Second Year) COMPUTER SCIENCE. MAXIMUM MARKS:30 Answer ALL Questions

ASSIGNMENT-1 User Interface Design MAXIMUM MARKS:30 (DMCS21) Q1) Discuss the characteristics of Graphics interface in detail. Q2) Discuss with suitable examples the human characteristics in design. Q3)

### Data Communications and Networks Spring Syllabus and Reading Assignments

Data Communications and Networks Spring 2018 Syllabus and Assignments Revision Date: January 24, 2018 Course : This course teaches the design and implementation techniques essential for engineering robust

### DIABLO VALLEY COLLEGE CATALOG

COMPUTER SCIENCE COMSC Despina Prapavessi, Dean Math and Computer Science Division Math Building, Room 267 The computer science department offers courses in three general areas, each targeted to serve

### Computer Networks. Andrew S. Tanenbaum

Computer Networks Third Edition Andrew S. Tanenbaum 1 ; l Vrije Universiteit Amsterdam, The Netherlands For book and bookstore information Prentice Hall PTR Upper Saddle River, New Jersey 07458 CONTENTS

### CIS 21 Final Study Guide. Final covers ch. 1-20, except for 17. Need to know:

CIS 21 Final Study Guide Final covers ch. 1-20, except for 17. Need to know: I. Amdahl's Law II. Moore s Law III. Processes and Threading A. What is a process? B. What is a thread? C. Modes (kernel mode,

### SECOND SEMESTER JAVA PROGRAMMING

PGDCA-210 SECOND SEMESTER JAVA PROGRAMMING (A) Instructions for the Paper setter: The question paper will consist of five sections: A, B, C, D a E. Sections A, B, C a D will have two questions from the

### Course Description. Learn To: : Intro to JAVA SE7 and Programming using JAVA SE7. Course Outline ::

Module Title Duration : Intro to JAVA SE7 and Programming using JAVA SE7 : 9 days Course Description The Java SE 7 Fundamentals course was designed to enable students with little or no programming experience

### SERVICE-ORIENTED COMPUTING

THIRD EDITION (REVISED PRINTING) SERVICE-ORIENTED COMPUTING AND WEB SOFTWARE INTEGRATION FROM PRINCIPLES TO DEVELOPMENT YINONG CHEN AND WEI-TEK TSAI ii Table of Contents Preface (This Edition)...xii Preface

### AQA GCSE Computer Science PLC

1 - Fundamentals of Algorithms Useful Websites BBC Bite Size Cambridge GCSE Exam Dates https://www.bbc.co.uk/education/subjects/z34k7ty Paper 1 14/05/2018 am https://www.cambridgegcsecomputing.org/ Paper

### Preface... 1 The Boost C++ Libraries Overview... 5 Math Toolkit: Special Functions Math Toolkit: Orthogonal Functions... 29

Preface... 1 Goals of this Book... 1 Structure of the Book... 1 For whom is this Book?... 1 Using the Boost Libraries... 2 Practical Hints and Guidelines... 2 What s Next?... 2 1 The Boost C++ Libraries

Identify and overcome the difficulties encountered by students when learning how to program List and explain the software development roles played by students List and explain the phases of the tight spiral

### CS301 - Data Structures Glossary By

CS301 - Data Structures Glossary By Abstract Data Type : A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT Algorithm

### Computer Science (CS)

The University of Alabama in Huntsville 1 Computer Science (CS) CS 100 - INTRO COMPUTERS & PROGRAM Introduction to program design and implementation in the Visual Basic programming language, using hands-on

### CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS UNIT I OPERATING SYSTEMS OVERVIEW

CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS SYLLABUS UNIT I OPERATING SYSTEMS OVERVIEW Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory

### Curriculum 2013 Knowledge Units Pertaining to PDC

Curriculum 2013 Knowledge Units Pertaining to C KA KU Tier Level NumC Learning Outcome Assembly level machine Describe how an instruction is executed in a classical von Neumann machine, with organization

### VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK Degree & Branch : B.E E.C.E. Year & Semester : II / IV Section : ECE 1, 2 &

### Department of Computer Science and Technology

UNIT : Stack & Queue Short Questions 1 1 1 1 1 1 1 1 20) 2 What is the difference between Data and Information? Define Data, Information, and Data Structure. List the primitive data structure. List the

### CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE PART A UNIT I 1. Differentiate object oriented programming from procedure oriented programming. 2. Define abstraction and encapsulation. 3. Differentiate

### CLASS XII ( ) (Theory)

CLASS XII (2014-15) (Theory) Duration: 3 Hours Total Marks: 70 Unit No. Unit Name PERIODS MARKS (Theory + Practical) Th Pr Tot 1. Programming with Python 50 40 90 41 2. Object Oriented Programming with

### Unit 2. Unit 3. Unit 4

Course Objectives At the end of the course the student will be able to: 1. Differentiate database systems from traditional file systems by enumerating the features provided by database systems.. 2. Design

### Multiple Choice Questions. Chapter 5

Multiple Choice Questions Chapter 5 Each question has four choices. Choose most appropriate choice of the answer. 1. Developing program in high level language (i) facilitates portability of nonprocessor

### List of courses for Integrated M.S. Software Systems programme (Eight semesters)

List of courses for Integrated M.S. Software Systems programme (Eight semesters) Course descriptions AAOC ZC111 Probability and Statistics 3 Probability spaces; conditional probability and independence;

### SNS COLLEGE OF ENGINEERING

SNS COLLEGE OF ENGINEERING Coimbatore. Department of Computer Science and Engineering Question Bank- Even Semester 2015-2016 CS6401 OPERATING SYSTEMS Unit-I OPERATING SYSTEMS OVERVIEW 1. Differentiate

### ADVANCED DATABASES ; Spring 2015 Prof. Sang-goo Lee (11:00pm: Mon & Wed: Room ) Advanced DB Copyright by S.-g.

4541.564; Spring 2015 Prof. Sang-goo Lee (11:00pm: Mon & Wed: Room 301-203) ADVANCED DATABASES Copyright by S.-g. Lee Review - 1 General Info. Text Book Database System Concepts, 6 th Ed., Silberschatz,

### Data Networks. Lecture 1: Introduction. September 4, 2008

Data Networks Lecture 1: Introduction September 4, 2008 Slide 1 Learning Objectives Fundamental aspects of network Design and Analysis: Architecture: layering, topology design, switching mechanisms Protocols:

### Data about data is database Select correct option: True False Partially True None of the Above

Within a table, each primary key value. is a minimal super key is always the first field in each table must be numeric must be unique Foreign Key is A field in a table that matches a key field in another

### Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:

Tribhuvan University 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSC. 154) Pass Marks: 24 (Data Structure and Algorithm) Time:

### MaanavaN.Com CS1203 OBJECT ORIENTED PROGRAMMING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING SUB CODE / SUBJECT: CS1203 / Object oriented programming YEAR / SEM: II / III QUESTION BANK UNIT I FUNDAMENTALS PART-A (2 MARKS) 1. What is Object Oriented

### Microsoft. Microsoft Visual C# Step by Step. John Sharp

Microsoft Microsoft Visual C#- 2010 Step by Step John Sharp Table of Contents Acknowledgments Introduction xvii xix Part I Introducing Microsoft Visual C# and Microsoft Visual Studio 2010 1 Welcome to

### Database Concepts and Applications

,'.'. Page No... 1 MCA401 USN Fourth Semester M.C.ADegree Examination, July IAugust 2004 Master of Computer Applications (Old Scheme) Database Concepts and Applications Time: 3 hrs.] [Max.Marks : 100 Note:

### Jiwaji University, Gwalior -- B.A. Session

BA FIRST YEAR Jiwaji University, Gwalior -- B.A. Session 2014-17 Course Name Introduction to Information Technology Operating Systems - Windows 98 Theory Marks Practical Marks Total Marks 50-50 50 50 100

### Foundations of Python

Foundations of Python Network Programming The comprehensive guide to building network applications with Python Second Edition Brandon Rhodes John Goerzen Apress Contents Contents at a Glance About the

### Supporting Materials

Preface p. xxiii Introduction p. xxiii Key Features p. xxiii Chapter Outlines p. xxiv Supporting Materials p. xxvi Acknowledgments p. xxvii Java Fundamentals p. 1 Bits, Bytes, and Java p. 2 The Challenge

### Data Structures and Algorithm Analysis in C++

INTERNATIONAL EDITION Data Structures and Algorithm Analysis in C++ FOURTH EDITION Mark A. Weiss Data Structures and Algorithm Analysis in C++, International Edition Table of Contents Cover Title Contents

### DATA ABSTRACTION AND PROBLEM SOLVING WITH JAVA

DATA ABSTRACTION AND PROBLEM SOLVING WITH JAVA WALLS AND MIRRORS First Edition Frank M. Carrano University of Rhode Island Janet J. Prichard Bryant College Boston San Francisco New York London Toronto

### ENGINEERING PROBLEM SOLVING WITH C++

ENGINEERING PROBLEM SOLVING WITH C++ Second Edition Delores M. Etter Electrical Engineering Department United States Naval Academy Jeanine A. Ingber Training Consultant Sandia National Laboratories Upper

### What s different about Factor?

Harshal Lehri What s different about Factor? Factor is a concatenative programming language - A program can be viewed as a series of functions applied on data Factor is a stack oriented program - Data

### Object Oriented Programming with c++ Question Bank

Object Oriented Programming with c++ Question Bank UNIT-1: Introduction to C++ 1. Describe the following characteristics of OOP. i Encapsulation ii Polymorphism, iii Inheritance 2. Discuss function prototyping,

### Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions

### Big Data Management and NoSQL Databases

NDBI040 Big Data Management and NoSQL Databases Lecture 10. Graph databases Doc. RNDr. Irena Holubova, Ph.D. holubova@ksi.mff.cuni.cz http://www.ksi.mff.cuni.cz/~holubova/ndbi040/ Graph Databases Basic

### Computer Science (330)

Lesson 1 Anatomy of a Digital Computer Sr. Secondary Course (Syllabus) Computer Science (330) 1.3 Functions and Components of a Computer 1.3.1 How the CPU and Memory work 1.4 Input devices 1.4.1 Keyboard

### INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES DEVI AHILYA UNIVERSITY, INDORE. M. Tech. (IT) 5½ Years III SEMESTER JULY-DECEMBER 2013

INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES DEVI AHILYA UNIVERSITY, INDORE M. Tech. (IT) 5½ Years III SEMESTER JULY-DECEMBER 2013 Sub. Code Subject Name Credit IT-301 Mathematics-III 4 IT-302 Internet

### Course list for the Bachelor of Computer Science in INFORMATION SYSTEM

Course list for the Bachelor of Computer Science in INFORMATION SYSTEM Course Objectives: Preparing graduates with knowledge, skills and competencies in the field of information systems, especially in

### 4.1.2 Merge Sort Sorting Lower Bound Counting Sort Sorting in Practice Solving Problems by Sorting...

Contents 1 Introduction... 1 1.1 What is Competitive Programming?... 1 1.1.1 Programming Contests.... 2 1.1.2 Tips for Practicing.... 3 1.2 About This Book... 3 1.3 CSES Problem Set... 5 1.4 Other Resources...

### Solved MCQ on fundamental of DBMS. Set-1

Solved MCQ on fundamental of DBMS Set-1 1) Which of the following is not a characteristic of a relational database model? A. Table B. Tree like structure C. Complex logical relationship D. Records 2) Field

### Python Scripting for Computational Science

Hans Petter Langtangen Python Scripting for Computational Science Third Edition With 62 Figures 43 Springer Table of Contents 1 Introduction... 1 1.1 Scripting versus Traditional Programming... 1 1.1.1

### Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6

### MTA Database Administrator Fundamentals Course

MTA Database Administrator Fundamentals Course Session 1 Section A: Database Tables Tables Representing Data with Tables SQL Server Management Studio Section B: Database Relationships Flat File Databases

### COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.)

Computer Science, Bachelor of Science (B.S.) 1 COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.) The Bachelor of Science in Computer Science is built on a rigorous, highly concentrated, accredited curriculum

### Computer Science (COMP)

2017-2018 Prairie View A & M University 1 Computer Science (COMP) Courses COMP 1003 Digital Communication: 3 semester hours. Efficient communication in the digital world, including multi-media editing,

### MIDTERM EXAM (Solutions)

MIDTERM EXAM (Solutions) Total Score: 100, Max. Score: 83, Min. Score: 26, Avg. Score: 57.3 1. (10 pts.) List all major categories of programming languages, outline their definitive characteristics and

### Contents. Preface xvii Acknowledgments. CHAPTER 1 Introduction to Parallel Computing 1. CHAPTER 2 Parallel Programming Platforms 11

Preface xvii Acknowledgments xix CHAPTER 1 Introduction to Parallel Computing 1 1.1 Motivating Parallelism 2 1.1.1 The Computational Power Argument from Transistors to FLOPS 2 1.1.2 The Memory/Disk Speed

### SYLLABUS JAVA COURSE DETAILS. DURATION: 60 Hours. With Live Hands-on Sessions J P I N F O T E C H

JAVA COURSE DETAILS DURATION: 60 Hours With Live Hands-on Sessions J P I N F O T E C H P U D U C H E R R Y O F F I C E : # 4 5, K a m a r a j S a l a i, T h a t t a n c h a v a d y, P u d u c h e r r y

### CMSC132, Practice Questions

CMSC132, Practice Questions Notice the final exam can include material not covered by the practice questions. You should practice beyond what is covered in this document. Although solutions will not be

### COURSE SYLLABUS. .NET-Technologies. Industrial Training (4 MONTHS) PH: , Vazhoor Road Changanacherry-01.

COURSE SYLLABUS.NET-Technologies Industrial Training (4 MONTHS) PH: 0481 2411122, 09495112288 E-Mail: info@faithinfosys.com www.faithinfosys.com Marette Tower Near No. 1 Pvt. Bus Stand Vazhoor Road Changanacherry-01

### Comp 204: Computer Systems and Their Implementation. Lecture 25a: Revision Lectures (separate questions and answers)

Comp 204: Computer Systems and Their Implementation Lecture 25a: Revision Lectures (separate questions and answers) 1 Today Here are a sample of questions that could appear in the exam Please LET ME KNOW

### Introductory logic and sets for Computer scientists

Introductory logic and sets for Computer scientists Nimal Nissanke University of Reading ADDISON WESLEY LONGMAN Harlow, England II Reading, Massachusetts Menlo Park, California New York Don Mills, Ontario

### Visit ::: Original Website For Placement Papers. ::: Data Structure

Data Structure 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship

### Please 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

### DS ata Structures Aptitude

DS ata Structures Aptitude 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge

### Introduction to computer networking

edge core Introduction to computer networking Comp Sci 3600 Security Outline edge core 1 2 edge 3 core 4 5 6 The edge core Outline edge core 1 2 edge 3 core 4 5 6 edge core Billions of connected computing

### Short Term Courses (Including Project Work)

Short Term Courses (Including Project Work) Courses: 1.) Microcontrollers and Embedded C Programming (8051, PIC & ARM, includes a project on Robotics) 2.) DSP (Code Composer Studio & MATLAB, includes Embedded

### ECE4110 Internetwork Programming. Introduction and Overview

ECE4110 Internetwork Programming Introduction and Overview 1 EXAMPLE GENERAL NETWORK ALGORITHM Listen to wire Are signals detected Detect a preamble Yes Read Destination Address No data carrying or noise?

### Querying Data with Transact-SQL

Querying Data with Transact-SQL 20761B; 5 Days; Instructor-led Course Description This course is designed to introduce students to Transact-SQL. It is designed in such a way that the first three days can

### Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet

Chapter 2 - Part 1 The TCP/IP Protocol: The Language of the Internet Protocols A protocol is a language or set of rules that two or more computers use to communicate 2 Protocol Analogy: Phone Call Parties

### CS 4390 Computer Networks. Transport Services and Protocols

CS 4390 Computer Networks UT D data Session 07 Transport Layer Overview and UDP Adapted from Computer Networking a Top-Down Approach 1996-2012 by J.F Kurose and K.W. Ross, All Rights Reserved Transport

### Internetwork Protocols

Internetwork Protocols Background to IP IP, and related protocols Internetworking Terms (1) Communications Network Facility that provides data transfer service An internet Collection of communications

### Web Foundations Series Internet Business Associate

Web Foundations Series Internet Business Associate Internet Business Associate prepares students to work effectively in today's business environment. In this course, you will learn about the tasks involved

### Querying Data with Transact-SQL

Querying Data with Transact-SQL General Description This course is designed to introduce students to Transact-SQL. It is designed in such a way that the first three days can be taught as a course to students

### Mind Q Systems Private Limited

Software Testing Tools Course Content for Online Training Manual Testing Introduction Introduction to software Testing Software Development Process Project Vs Product Objectives of Testing Testing Principals

### Asynchronous and Synchronous Messaging with Web Services and XML Ronald Schmelzer Senior Analyst ZapThink, LLC

Asynchronous and Synchronous Messaging with Web Services and XML Ronald Schmelzer Senior Analyst ZapThink, LLC The Business Objective Automated Business Collaboration Facilitating exchange of information

### Chapter 11: Wide-Area Networks and the Internet

Chapter 11: Wide-Area Networks and the Internet MULTIPLE CHOICE 1. MAN stands for: a. Manchester Access Network c. Metropolitan-Area Network b. Multiple-Area Network d. Multiple Access Network 2. Packet

### Course Details Duration: 3 days Starting time: 9.00 am Finishing time: 4.30 pm Lunch and refreshments are provided.

Database Administration with PostgreSQL Introduction This is a 3 day intensive course in skills and methods for PostgreSQL. Course Details Duration: 3 days Starting time: 9.00 am Finishing time: 4.30 pm

### DOT NET TRAINING PROGRAM

DOT NET TRAINING PROGRAM Course Duration: 2 Months Pre-Requisite: Basic Knowledge of Internet Course Fee: 10,500 ( Online Examination Fee, Books, Certification, Tools & Software's Included ) ASP.NET 3.5

Chapter 14 Graphs 2011 Pearson Addison-Wesley. All rights reserved 14 A-1 Terminology G = {V, E} A graph G consists of two sets A set V of vertices, or nodes A set E of edges A subgraph Consists of a subset

### An Introduction to Software Architecture

An Introduction to Software Architecture Software Requirements and Design CITS 4401 Lecture 11 Motivation for studying SW architecture As the size of SW systems increase, the algorithms and data structures

### OCR GCSE Computing Learning Grids H/W

COMPUTING GCSE OCR J275 OCR GCSE Computing Learning Grids H/W Unit A451: Computer Systems and Programming This learning grid H/W belongs to: Name: Form: Mr. Ahmed A451 - ATTENTION! Please read! These learning

### "Charting the Course... Interconnecting Cisco Networking Devices Accelerated 3.0 (CCNAX) Course Summary

Description Course Summary The Cisco CCNA curriculum includes a third course, Interconnecting Cisco Networking Devices: Accelerated (CCNAX), consisting of Interconnecting Cisco Networking Devices, Part

### Inheritance, Polymorphism and the Object Memory Model

Inheritance, Polymorphism and the Object Memory Model 1 how objects are stored in memory at runtime? compiler - operations such as access to a member of an object are compiled runtime - implementation

### MSBI (SSIS, SSRS, SSAS) Course Content

SQL / TSQL Development 1. Basic database and design 2. What is DDL, DML 3. Data Types 4. What are Constraints & types 1. Unique 2. Check 3. NULL 4. Primary Key 5. Foreign Key 5. Default 1. Joins 2. Where

### INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad COMPUTER SCIENCE AND ENGINEERING QUESTION BANK OPERATING SYSTEMS

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING QUESTION BANK Title Code Regulation Structure Coordinator Team of Instructors OPERATING SYSTEMS A50510

### Petri Nets. Robert A. McGuigan, Department of Mathematics, Westfield State

24 Petri Nets Author: College. Robert A. McGuigan, Department of Mathematics, Westfield State Prerequisites: The prerequisites for this chapter are graphs and digraphs. See Sections 9.1, 9.2, and 10.1

### Introduction to Microsoft.NET Programming Using Microsoft Visual Studio 2008 (C#) Course Overview. Prerequisites. Audience.

Introduction to Microsoft.NET Programming Using Microsoft Visual Studio 2008 (C#) Course Number: 6368A Course Length: 1 Day Course Overview This instructor-led course provides an introduction to developing