# University of Mumbai Syllabus Structure(R-2007) At S.E. (Computer Engineering)

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 University of Mumbai Syllabus Structure(R-20) At S.E. (Computer Engineering) Semester-IV Sr. Subject Scheme of Instructions Scheme of Evaluation No. Periods per Week Each Period of 60 Min. Theory Practical Paper TW Practical Total Hours Marks &Oral 1. Applied * Mathematics-IV 2. Analog & Digital Communication 3. Database Manag ement System 4. Computer Graphics 5. Analysis of Algorithm & Design 6. Operating System *After four conjugative periods test should be conducted at fifth period and the assessed papers should be considered as a part of term work..

2 University of Mumbai Class: S.E. Branch: Computer Semester: IV Engineering Subject: Applied Mathematics IV(Abbreviated as AM-IV) Periods per Week (each 60 min) Lecture Practical --- Tutorial --- Hours Marks Evaluation System Theory Practical / Oral Oral Term Work Total Module Contents Hours 1 Matrices: 1.1 Brief revision of vectors over a real field, inner product, norm, 03 Linear independence and orthogonality of vectors. 1.2 Characteristic polynomial, characteristic equation, characteristic roots and characteristic vectors of a square matrix, properties of characteristic roots and vectors of different types of matrices such as orthogonal matrix, Hermitian matrix, 10 Skew-Hermitian matrix, Diagonable matrix, Cayley Hamilton s theorem ( without proof) Functions of a square matrix, Minimal polynomial and Derogatory matrix. 2 Complex variables: 2.1 Functions of complex variables, Analytic function, necessary and sufficient conditions for f ( z) to be analytic (without proof) 2.2 Milne- Thomson method to determine analytic function f ( z) when it s real or imaginary or its combination is given Harmonic function, orthogonal trajectories. 2.3 Mapping: Conformal mapping, linear, bilinear mapping, cross ratio, fixed points and standard transformations such as Rotation and magnification, invertion and reflection, translation. 2.4 line integral of a function of a complex variable, Cauchy s theorem for analytic function, Cauchy s Goursat theorem (without proof), properties of line integral, Cauchy s integral formula and deductions. 2.5 Singularities and poles: 04 Idea of Taylor s and Laurent s series development (without proof)for Residue 2.6 Residue s theorem, application to evaluate real integrals of type 2π 0 f ( cosθ,sin θ ) dθ, & f ( x) dx

3 3 FMathematical programming: 3.1 Linear optimization problem, standard and canonical form of LPP, basic and feasible solutions, primal simplex method (more than two variables). 3.2 Artificial variables, Big-M method (method of penalty) 3.3 Dual problem, duality principle Dual simplex method, degeneracy andalternative optima, unbounded solution. 3.4 Nonlinear Programming, unconstrained optimization, problem with equality constraints Lagranges Multiplier Method, Problem with inequality constraints Kuhn-Tucker conditions TERM WORK: 1. Based on above syllabus at least 10 tests assessed papers (10 marks) 2. One term test of 100 marks like university pattern must be conducted and scaled to 10 marks. 3. Attendance marks. Reference Books: 1. Complex Variables: Churchill, Mc-Graw Hill 2. Elements of Applied mathematics, P N & J N Wartikar, Pune Vidarthi Gruha Prakashan 3. Higher Engineering Mathematics, Dr B. S. Grewal, Khanna Publication 4. Advanced Engineering Mathematics, E Kreyszing, Wiley Eastern Limited 5. Operations Research, Kantiswearup, Manmohan, P K Gupta, S. Chand & Co. 6. Operations Research, S D Sharma, S. Chand & Co. 7. Matrices, A. R. Vasishtha, Krishna Prakashan.

4 University of Mumbai Class: S.E. Branch: Computer Semester: IV Engineering Subject: Analog and Digital Communication(Abbreviated as ADC) Periods per Week (each 60 min) Lecture 04 Practical 02 Tutorial -- Hours Marks Evaluation System Theory Practical and Oral Oral Term Work Total 150 Module Detailed Syllabus Topics 1 Introduction Basics of communication systems, modulation and demodulation, analog and digital modulation, noise in communication system, various noise parameters 2 Analog Modulation and Demodulation Different types of analog modulation, amplitude modulators and demodulators, frequency modulators and demodulators, phase modulation and demodulation, amplitude modulation and frequency modulation receivers 3 Pulse Analog Modulation Sampling theorem for low-pass and band-pass filters, sampling technique principle, generation, demodulation, and spectrum, types of pulse analog modulation, generation and detection of pulse amplitude modulation (PAM), pulse width modulation (PWM) and pulse position modulation ( PPM), principles of time division multiplexing (TDM) and frequency division multiplexing (FDM) 4 Digital Modulation Techniques Discrete messages, concept of information, average information, information rate, Shannon's theorem, channel capacity, capacity of Gaussian channel, pulse code modulation (PCM), delta modulation (DM), adaptive delta modulation (ADM) - transmission systems Hrs Base Band Modulation

5 PCM waveform types, M-array pulse modulation, base band signal receiver, detection of binary signals in Gaussian noise, inter symbol interference (ISI) and equalization 6 Bandpass Modulation and Demodulation Types of bandpass modulation, phase shift keying BPSK, DPSK, DEPSK, QPSK, M - array PSK, amplitude shifting BASK, QAM, frequency shift keying - BFSK, M array, FSK Channel Coding Types of error control, linear block codes, errors detection and correction capacity, cyclic codes, convolution codes Topics of Experiments 1. Amplitude modulation generation and detection 2. Amplitude modulation receiver 3. Frequency modulation generation and detection 4. Frequency modulation receiver 5. Pulse width WM generation and detection 6. PPM generation and detection 7. Delta Modulation and demodulation 8. TDM 9. BPSK 10. BFSK 11. BASK 12. QPSK 13. Error detection and correction 14. Eye pattern TERM WORK 1. Term work should consist of at least 10 experiments and 5 assignments covering all the topics (15 Marks). 2. A term work test of 100 marks like University pattern must be conducted and scaled to 10 marks. Practical Examination Practical Examination based on the above list should be conducted

6 Text Books : 1. Wayne Tomasi Electronic Communication Systems (fundamentals through advanced), Pearson Education, fourth Edition, K.Shamugam, Anlog abd Digital Communciation,Wiley India. 3. Kennedy and Davis Electronic Communication Systems, Tata McGraw Hill, third edition, Taub Herbert and Schilling Donald L Principles of Communication Systems, Tata McGraw Hill, third edition, Sklar Bernard Digital Communications (fundamentals and applications), Pearson Education, second edition, Reference Books : 1. Couch Leon W -II, Modern Communication Systems, Prentice Hall of India, first edition, Prokies, John G, Salehi Masoud, Communication Systems Engineering, Pearson Education, second edition, Haykin Simon, Digital Communications, John Weily and Sons, first edition, Simon Haykin Introduction to Analog and Digital Communication,Wiley India.

7 University of Mumbai Class: S.E. Branch: Computer Semester: IV Engineering Subject: Database Management System (Abbreviated as DBMS) Periods per Week (each 60 min) Lecture 04 Practical 02 Tutorial -- Hours Marks Evaluation System Theory Practical and Oral Oral Term Work Total 150 Module Contents Hours 1 1. Introduction Database Concepts : 04 Introduction to data processing. Overview of file systems. Drawbacks of file system, Concept of a database. Comparison of Database systems and File system. Data abstraction, 3- Layered Architecture and data independence. Data models, Database languages. Database users and administrators. Database system structure 2 Entity Relationship Model : Basic concepts Constrains Design issues, Entity Relationship diagram Strong - Weak entity sets Extended ER features Mapping an ER schema to tables. 3 Relation Model : Concept of a relation Notion of primary and secondary keys Structure relation database The relation algebra and extended algebra operations Formation of queries, Modification of database, Views. 4 SQL : Background, Basic structure

8 Set operations, Aggregate function, Null values. Nested queries, Views, Complex queries, Database modification DDL, embedded SQL, Stored procedures and functions 5 Integrity and Security : Domain Constraints, Referential integrity Assertions, Triggers Security and Authorization, Authorization in SQL 6 Relational Database Design : First Normal form, Pitfalls in relational database design Function dependencies, Armstrong Axioms 2 nd, 3 rd, BCNF, and 4 th normal form Decomposition, Desirable properties of decomposition Overall database design process. 7 File structure, Indexing and Hashing: File organization, Organization of records in files. Data Dictionary storage. Basic Indexing concepts, Ordered Indices, B+ Tree and B Tree Index Files Static Hashing, Dynamic hashing Index Definition in SQL, Multiple Key access. 8 Transactions: Transaction concept, Transaction states Implementation of atomicity and durability Concurrent Executions, Serializability, Recoverability Implementation of isolation, Transaction definition in SQL. 9 Concurrency Control : Lock-based protocols Timestamp-based protocols Validation-based protocols Deadlock handling 10 Recovery System : Failure Classification, Storage structure Recovery & atomicity Log based recovery, Shadow paging Recovering with concurrent transactions Buffer Management. 04

9 TERM WORK: 1. At least 12 experiments in SQL and PL/SQL with a weightage of 10 marks 2. A term work test must be conducted with a weightage of 10 marks. 3. Attendance marks Text Books: 1. Korth, Slberchatz,Sudarshan, : Database System Concepts, 5th Edition, McGraw Hill 2. Peter Rob and Carlos Coronel, Database Systems Design, Implementation and Management, Thomson Learning, 5th Edition. Reference Books : 1. Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition, PEARSON Education. 2. C.J. Date, A. Kannan Introduction to Database Systems, Eighth Edition, Addison Wesley. 3. Mark L. Gillenson, Paulraj Ponniah, Introduction to Database Management,WILEY 4. Raghu Ramkrishnan and Johannes Gehrke, Database Management Systems,TMH 5. Dr. P.S. Deshpande, SQL and PL/SQL for Oracle 10g,Black Book, Dreamtech Press

10 Class: S.E. Subject: Computer Graphics Periods per Week (each 60 min) Evaluation System University of Mumbai Branch: Computer Semester: IV Engineering (Abbreviated as C.G.) Lecture 04 Practical 02 Tutorial -- Hours Marks Theory Practical and Oral Oral Term Work Total 150 Module Contents Hours 1 Basic concepts Introduction to computer graphics 2. lines, line segments, vectors, pixels and frame buffers, vector generation 3. DDA and Bresenham line drawing algorithms. 4. Mid point and Bresenham s circle drawing algorithms 5. mid point ellipse drawing algorithm, 6. various styles of lines like thick lines, 7. character generation methods Stroke Principle, Bit map method 8. Display file structuredisplay file interpreter, 2 Polygons Introduction, 2. representation of polygon 3. entering Polygons in display file, 4. inside-outside test 5. Polygon filling methods Boundary fill, Flood fill scan line Polygon Fill Patterns filling. Transformations 1. homogeneous coordinates 2. Translation 3. Scaling 4. Rotation 5. Rotation about an arbitrary point 6. inverse transforms 7. shear transforms 8. Reflections. 3 Segments 08

11 1. Introduction 2. segment table 3. Operations segment Creation Closing Deletion renaming, Visibility 4. other display-file structures 5. Image transformations 6. raster techniques. Windowing and clipping 1. Introduction 2. viewing transforms 3. 2D line clipping Cohen-Sutherland line clipping Midpoint subdivision algorithm Liang-Barsky Line Clipping algorithm, Cyrus-Beck algorithm 4. Text Clipping 5. Polygon Clipping Sutherland-Hodgman polygon clipping algorithm Weiler-Arthorton polygon clipping Liang barsky polygon clipping 6. Generalized clipping. 4 3-D Transformations 1. Introduction 2. 3-D geometry 3. 3-D display methods 4. 3-D object representation methods 5. 3-D transformations 6. Rotation about an arbitrary axis 7. Concept of parallel and perspective projections 8. 3-D clipping 9. 3-D viewing transformations 5 Hidden Surfaces and Lines 1. Introduction 2. Back-face removal algorithm 3. Z buffers 4. scan-line 5. Painter s algorithm 6. Warnock s algorithm 7. hidden line methods. Light, Color and Shading 1. Introduction 2. Diffuse illumination 3. Point-source illumination 4. Specular reflection 5. shading algorithms 6. transparency 7. reflections 8. shadows 9. ray tracing 10. Colour models 11. rendering pipeline

12 6 Curves and fractals 1. Introduction 2. Curve generation B-Splines Bezier curves 3. Surfaces Bezier Surfaces B spline Surfaces 4. Fractals, fractal lines and surfaces. Animation 1. Devices for producing animation 2. Computer assisted animation 3. real time animation 4. frame-by-frame animation 5. method for controlling animation (fully explicit control, procedural) 08 Term Work 1. Journal should consist of at least 10 Experiments based on above syllabus. 2. One written test should be conducted in the semester for the weight age of 10 Marks. 3. Suggested list of Experiments based on which practical examination should be Conducted: 1.DDA / Bresenham s line algorithm with various styles like thick, dotted etc. ( Make use of Display File concept.) 2.Circle drawing using Bresenham s or Midpoint Algorithm. 3.Various 2D transformations ( Scaling, Rotation,Translation etc. ) implementation. Use matrices multiplications for implementation. 4.Various Polygon Filling Methods like Pattern fill, Flood fill, Boundary fill. 5.2D Curves and surfaces drawing like Bezier, B Spline. 6.Line clipping - Liang Barsky, cohen Sutherland 7.Polygon clipping -Sutherland Hodgman. 8.3D transformations 9.Fractals 10.Character Generation. Implementation of these experiments can be done in c/c++/java. Practical exam of 25 marks should be based on this list of experiments. 4. Mini. Projects: journal should include 2 Mini projects as a part of term work (Mini project is not part of practical exam ). (Concerned staff should form group of at most 3 students.) Suggested mini project topics are

13 a. Graphics editor. b. displaying given 3D object using perspective projection c. 3D modeling of objects using OpenGL. d. Implementing any shading algorithms using OpenGL. e. Surface rendering using OpenGL. 5. Journal should also have at least 3 assignments based on above syllabus Text Books 1. S. Harrington, Computer Graphics, 2nd Edition, McGraw-Hill Publications, 1987 ISBN J. Foley, Van Dam, S. Feiner, J. Hughes, Computer Graphics Principles and Practice, 2nd Edition, Pearson Education, 2003, ISBN Leen Ammeraal,KangZRang Computer Graphics for Java Programming 2nd ed Wiley India Reference Books 1. D. Rogers, Procedural Elements for Computer Graphics, 2nd Edition, TATA Mc- Graw-Hill Publication, 2001, ISBN D. Hearn, M. Baker, Computer Graphics C Version, 2nd Edition, Pearson Education, 2002, ISBN F. Hill, Computer Graphics: Using OpenGL, 2nd Edition, Pearson Education, 2003 ISBN Xiang, Plastock, Computer Graphics, 2nd Edition, TATA Mc-Graw-Hill Publication, 2002, ISBN

14 University of Mumbai Class: S.E. Branch: Computer Semester: IV Engineering Subject: Analysis Of Algorithm & Design (Abbreviated as AOAD) Periods per Week (each 60 min) Lecture 04 Practical 02 Tutorial -- Hours Marks Evaluation System Theory Practical and Oral Oral Term Work Total 150 Pre-requisites: Students should familiar with data structure concept, discrete structure and Programming Language such as C++ or JAVA. Module Contents Hours 1 Introduction to analysis of algorithm Design and analysis fundamentals. Performance analysis,space and time complexity. Growth of function Big-Oh, Omega, theta notation. Mathematical background for algorithm analysis. Randomized and recursive algorithm. 2 Divide and Conquer.Genaral method, Binary search, finding the min and max..merge sort analysis..quick sort, performance measurement..randomized version of quick sort and analysis..partitioned algorithm selection sort, radix sort, efficiency considerations..strassen s matrix multiplication. 3 Greedy Method.General mehod..knapsack problem..minimum cost spanning tree- kruskal and primal algo, performanance analysis..single source shorted path..job sequencing with deadlines..optimal storage on tapes. 4 Dynamic Programming. The general method. Multistage graphs, all pair shortest paths, single source shortest paths 08 08

15 .Optimal BST,0/1 knapsack.tsp, flow shop scheduling 5 Backtracking.The general method..8 queen problem,sum of subsets..graph coloring,hamltonian cycles.. Knapsack problem. 6 Branch and Bound.The method, LC search..15 puzzle:an example.. Bounding and FIFO branch and bound.. LC branch and bound.. 0/1 knapsack problem..tp efficiency considerations. 7 Internet algorithm.strings and patterns matching algorithm..tries..text compression..text similarity testing. 06 TERM WORK Term work should consist of graded answer papers of the test and 12 implementations using c++/java. Students are expected to calculate complexities for all methods. Each student is to appear for at least one written test during the Term. Each implementation must consist of Problem Statement, Brief Theory, complexity calculation and Conclusion. Topics for Implementation: 1. Implementation based on divide and conquer method. 2. Implementation on greedy approach. 3. Implementation on dynamic programming. 4. Implementation of backtracking methods 5. Implementation of Branch and Bound concept 6. Implementation of internet algorithm.

16 Text Books: 1. Ellis horowitz,sarataj Sahni, S. Rajsekaran. Fundamentals of computer Algorithms University press. 2. Anany V. Levitin Introduction to the Design and Analysis of Algorithms Pearson Education publication, Second Edition. 3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms", 2nd Edition, MIT Press/McGraw Hill, Michael Goodrich & Roberto Tamassia, Algorithm design foundation,analysis and internet examples, Second Edition, Wiley student Edition. Reference Books: 1.S. Baase, S and A. Van Gelder, "Computer Algorithms: Introduction to Design and Analysis",3rd edition. Addison Wesley, Kenneth berman,jerome Paul Algorithm:sequential,parallel and Cengage Learning distributed 3.Mark Allen Weiss, Data Structure & Algorithm Analysis in C++, Third Edition, Pearson Education.

17 University of Mumbai Class: S.E. Branch: Computer Semester: IV Engineering Subject: Operating System (Abbreviated as O.S.) Periods per Week (each 60 min) Lecture 04 Practical 02 Tutorial -- Hours Marks Evaluation System Theory Practical and Oral Oral Term Work Total 150 Objective: This course is designed to introduce the most fundamental system program which control all the resources of computer and provide base upon which application programs can be written. Student will learn important resources and their management policies, algorithms used by operating systems. This fundamental will help them to study modern operating systems in subsequent semester and help them to design operating system. Prerequisite: Computer Organization & Architecture, Programming Language (C / C++/Java ) Detailed Syllabus Topics Module 1 Operating System Overview : Operating System Objectives and Functions. Evolution of Operating Systems, Characteristics of Modern Operating Systems, Basic Concepts : Processes, Files, System calls, Shell, Layered structure v/s Monolithic Structure of Operating System. Introduction to Distributed OS, RTOS, Mobile OS. 2 Process and process scheduling : Process description, PCB, Threads, Thread management; process and thread, Process Scheduling : Types, comparative assessment of different scheduling algorithms. 3 Process Concurrency: Principles of Concurrency; Mutual Exclusion- Hardware approaches; Mutual Exclusion- Software Support; Semaphores; Monitors, Message Passing; Readers/Writers Problem. Deadlock and Starvation: Principles of Deadlock, Deadlock Prevention; Deadlock Avoidance, Deadlock Detection, An Integrated Deadlock Strategy; Dining Philosophers Problem; Hrs

18 4 Memory Management Memory management Requirements. Memory Partitioning; Virtual memory; Paging; Segmentation; Design and implementation issues in paging and segmentation; page replacement algorithms; page fault handling; working set model 5 I/O Management and Disk Scheduling. I/O Devices. Organization of the I/O Function; Operating System Design Issues; I/O Buffering, Disk Scheduling and disk scheduling algorithms; RAID; Disk cache 6 File Management. Overview; File Organization; File Directories; File Sharing; Record Blocking; Secondary Storage Management; UNIX File system 7 Case Studies: Overview of Linux operating system, Process and thread management, Scheduling, concurrency control mechanisms, Memory management and I/O management in Linux. 04 Overview of Windows operating system: Process and thread management, Scheduling, concurrency control mechanisms, Memory management and I/O management in windows. Term Work 1. Term work shall consist of at least 9 programs based on the above topics. 2. It should also include Small routines, involving implementation of small utilities in shell programming for Unix / Linux system administration. 3. Programs that would give good exposure to Unix/Linux system calls for process control,memory management and file management. 4. Test must be conducted with a weightage of 10 marks. Text Books: 1.William Stallings, Operating Systems, 4 th Edn, Pearson Education 2. Silberschatz A.,Galvin P., Gagne G. Operating Systems Principles, Willey 3.Flynn Ida M., McHoes A.M., Understanding Operating Systems, 4 th Edn, Thomson Reference Books : 1. Tannenbaum, Modern Operating Systems, PHI 2. Milan Milenkovic, Operating System, Tata McGraw Hill 3.Maurice J Bach, The Design of the Unix Operating system, Prentice Hall. Internet references: Respective Linux Flavours Sites

19

### 2 nd Semester M. Sc. (IT)/MCA Syllabus

2 nd Semester M. Sc. (IT)/MCA Syllabus =============================================== T201 Data Structure Using C++ T202 Database Management System T203 Theory of Probability T204 Software Engineering

### LABORATORY MANUAL. CS-4508 Computer Graphics & Multimedia. July 2012 Onwards. Devi Ahilya Vishwavidyalaya. School of Computer Science & IT

LABORATORY MANUAL CS-4508 Computer Graphics & Multimedia July 2012 Onwards Devi Ahilya Vishwavidyalaya School of Computer Science & IT We make things happen... Producing world class IT Professionals Since

### VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203.

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : II / III Section : CSE - 1 & 2 Subject Code : CS 6302 Subject Name : Database

### Books. CS155b Computer Graphics. Homework. Additional References. Syllabus. Goals

CS155b Computer Graphics Instructor: Giovanni Motta (gim@ieee.org) Volen, Room #255. Phone: x62718 Class: Mon. and Wed. from 5 to 6:30pm Abelson #131 Teaching Assistants: Anthony Bucci (abucci@cs) John

### VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203.

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : III Year, V Semester Section : CSE - 1 & 2 Subject Code : CS6504 Subject

### Introduction to Computer Graphics

Introduction to Computer Graphics Torsten Möller TASC 8021 778-782-2215 torsten@sfu.ca www.cs.sfu.ca/~torsten Today What is computer graphics? Contents of this course Syllabus Overview of course topics

### 52. Explain interrupt scheme for retrieving input data. Also explain any one algorithm for input device handling. 53. Explain the process of 3-D

Computer Graphics 1. Derive the equation for the intercept form of the line. 2. Explain the frame buffer, point and pixels. 3. Describe the Digital Differential Analyzer (DDA) for line drawing. 4. Explain

### B2.53-R3: COMPUTER GRAPHICS. NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions.

B2.53-R3: COMPUTER GRAPHICS NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF ANSWER

### Essential Mathematics for Computer Graphics fast

John Vince Essential Mathematics for Computer Graphics fast Springer Contents 1. MATHEMATICS 1 Is mathematics difficult? 3 Who should read this book? 4 Aims and objectives of this book 4 Assumptions made

### CS 525 Advanced Database Organization - Spring 2013 Mon + Wed 3:15-4:30 PM, Room: Wishnick Hall 113

CS 525 Advanced Database Organization - Spring 2013 Mon + Wed 3:15-4:30 PM, Room: Wishnick Hall 113 Instructor: Boris Glavic, Stuart Building 226 C, Phone: 312 567 5205, Email: bglavic@iit.edu Office Hours:

### CPIT-285 Computer Graphics

Department of Information Technology B.S.Information Technology ABET Course Binder CPIT-85 Computer Graphics Prepared by Prof. Alhasanain Muhammad Albarhamtoushi Page of Sunday December 4 0 : PM Cover

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

### Mean value theorem, Taylors Theorem, Maxima and Minima.

MA 001 Preparatory Mathematics I. Complex numbers as ordered pairs. Argand s diagram. Triangle inequality. De Moivre s Theorem. Algebra: Quadratic equations and express-ions. Permutations and Combinations.

### Q4. What are data model? Explain the different data model with examples. Q8. Differentiate physical and logical data independence data models.

FAQs Introduction to Database Systems and Design Module 1: Introduction Data, Database, DBMS, DBA Q2. What is a catalogue? Explain the use of it in DBMS. Q3. Differentiate File System approach and Database

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

### Computer Graphics. Course Goal. Objectives. Overview. Textbook. These lectures cover Chapters 1-6in detail and survey Chapters 7-1

Computer Graphics Course Goal Paul Farrell Professor of Computer Science, Kent State University Office 270 MSB. Tel 672-9060 farrell@cs.kent.edu. Office hours: 6:00-7:30 TH and by appointment. The goal

### COMP-557: Fundamentals of Computer Graphics McGill University, Fall 2010

COMP-557: Fundamentals of Computer Graphics McGill University, Fall 2010 Class times 2:25 PM - 3:55 PM Mondays and Wednesdays Lecture room Trottier Building 2120 Instructor Paul Kry, kry@cs.mcgill.ca Course

### IT2304: 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

### Content. Chapter 4 Functions 61 4.1 Basic concepts on real functions 62. Credits 11

Content Credits 11 Chapter 1 Arithmetic Refresher 13 1.1 Algebra 14 Real Numbers 14 Real Polynomials 19 1.2 Equations in one variable 21 Linear Equations 21 Quadratic Equations 22 1.3 Exercises 28 Chapter

### Gildart Haase School of Computer Sciences and Engineering

Gildart Haase School of Computer Sciences and Engineering Metropolitan Campus I. Course: CSCI 6638 Operating Systems Semester: Fall 2014 Contact Hours: 3 Credits: 3 Class Hours: W 10:00AM 12:30 PM DH1153

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

### Contents RELATIONAL DATABASES

Preface xvii Chapter 1 Introduction 1.1 Database-System Applications 1 1.2 Purpose of Database Systems 3 1.3 View of Data 5 1.4 Database Languages 9 1.5 Relational Databases 11 1.6 Database Design 14 1.7

### Course Overview. CSCI 480 Computer Graphics Lecture 1. Administrative Issues Modeling Animation Rendering OpenGL Programming [Angel Ch.

CSCI 480 Computer Graphics Lecture 1 Course Overview January 14, 2013 Jernej Barbic University of Southern California http://www-bcf.usc.edu/~jbarbic/cs480-s13/ Administrative Issues Modeling Animation

### 1. COURSE TITLE Fundamentals of Computer Systems Course number Course area Course type Course level Year. 1.6.

1. COURSE TITLE Fundamentals of Computer Systems 1.1. Course number 18473 1.2. Course area Computer Science 1.3. Course type Core course 1.4. Course level Undergraduate 1.5. Year 2º 1.6. Semester 2º 1.7.

### IT6405 Database Systems II. (Compulsory)

Database Systems II (Compulsory) INTRODUCTION Database System II is one of the compulsory courses in Semester 6. This course is built on the knowledge gained through the Database System I. Aim of this

### MCA OBJECT ORIENTED ANALYSIS AND DESIGN USING UML Maximum marks: 100 (External: 80, Internal: 20) Note: Examiner will be required to set NINE

MCA-14-31 OBJECT ORIENTED ANALYSIS AND DESIGN USING UML UML: Principles of modeling, UML Things Structural, Behavioral, Grouping, Annotational. Relationships in UML Dependency, Association, Generalization,

### Databases. DSIC. Academic Year 2010-2011

Databases DSIC. Academic Year 2010-2011 1 Lecturer José Hernández-Orallo Office 236, 2nd floor DSIC. Email: jorallo@dsic.upv.es http://www.dsic.upv.es/~jorallo/docent/bda/bdaeng.html Attention hours On

### Introduction Week 1, Lecture 1

CS 430/536 Computer Graphics I Introduction Week 1, Lecture 1 David Breen, William Regli and Maxim Peysakhov Geometric and Intelligent Computing Laboratory Department of Computer Science Drexel University

### Far-western University Central Office, Mahendranagar Operating System

Far-western University Central Office, Mahendranagar Operating System Course Title: Operating Systems Credit: 3+1 Course No: B.Sc. CS OS 231 hour 45+15 Nature of the Course: Theory + Lab Year: 2 nd, Semester:

### 2) 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

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

### www.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

### INTRODUCTION TO RENDERING TECHNIQUES

INTRODUCTION TO RENDERING TECHNIQUES 22 Mar. 212 Yanir Kleiman What is 3D Graphics? Why 3D? Draw one frame at a time Model only once X 24 frames per second Color / texture only once 15, frames for a feature

### COMPUTER GRAPHICS Computer Graphics

COMPUTER GRAPHICS Computer Graphics involves display, manipulation and storage of pictures and experimental data for proper visualization using a computer. Typical graphics system comprises of a host computer

### L T P C Course Name: Linux Lab 0 0 4 2. Course Code: PBC - 602

Course Code: PBC - 602 Course Name: Linux Lab 0 0 4 2 1) Write a shell script to input two numbers and perform all mathematical operations on them 2) Write a shell script to print the information about

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

### City University of Hong Kong. Information on a Course offered by Department of Computer Science with effect from Semester A in 2014 / 2015

City University of Hong Kong Information on a Course offered by Department of Computer Science with effect from Semester A in 2014 / 2015 Part I Course Title: Database Systems Course Code: CS3402 Course

### William Paterson University of New Jersey Department of Computer Science College of Science and Health Course Outline

William Paterson University of New Jersey Department of Computer Science College of Science and Health Course Outline 1. TITLE OF COURSE AND COURSE NUMBER: Computer Graphics, CS 461, Credits: 3, (Major

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

### OPERATING SYSTEMS Internais and Design Principles

OPERATING SYSTEMS Internais and Design Principles FOURTH EDITION William Stallings, Ph.D. Prentice Hall Upper Saddle River, New Jersey 07458 CONTENTS Web Site for Operating Systems: Internais and Design

### MODULATION Systems (part 1)

Technologies and Services on Digital Broadcasting (8) MODULATION Systems (part ) "Technologies and Services of Digital Broadcasting" (in Japanese, ISBN4-339-62-2) is published by CORONA publishing co.,

### James B. Fenwick, Jr., Program Director and Associate Professor Ph.D., The University of Delaware FenwickJB@appstate.edu

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 WilkesJT@appstate.edu http://www.cs.appstate.edu/

### COMP175: Computer Graphics. Lecture 1 Introduction and Display Technologies

COMP175: Computer Graphics Lecture 1 Introduction and Display Technologies Course mechanics Number: COMP 175-01, Fall 2009 Meetings: TR 1:30-2:45pm Instructor: Sara Su (sarasu@cs.tufts.edu) TA: Matt Menke

### CSCD18: Computer Graphics

CSCD18: Computer Graphics Professor: Office: Office hours: Teaching Assistant: Office hours: Lectures: Tutorials: Website: Leonid Sigal lsigal@utsc.utoronto.ca ls@cs.toronto.edu Room SW626 Monday 12:00-1:00pm

### Dhiren Bhatia Carnegie Mellon University

Dhiren Bhatia Carnegie Mellon University University Course Evaluations available online Please Fill! December 4 : In-class final exam Held during class time All students expected to give final this date

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

### Sampling Theorem Notes. Recall: That a time sampled signal is like taking a snap shot or picture of signal periodically.

Sampling Theorem We will show that a band limited signal can be reconstructed exactly from its discrete time samples. Recall: That a time sampled signal is like taking a snap shot or picture of signal

### CPSC 3375 Database Concepts I

CPSC 3375 Database Concepts I Spring 2014 Department of Computer Science University of Arkansas at Little Rock 2801 South University Avenue Little Rock, Arkansas 72204-1099 Class Hours: Tuesday and Thursday,

### G.H. Raisoni College of Engineering & Management, Amravati. Question Bank (DBMS) Third Year CSE

G.H. Raisoni College of Engineering & Management, Amravati. Question Bank (DBMS) Third Year CSE UNIT 1 Q.1. Explain the three levels of data abstraction. Q.2. What are the advantages and disadvantages

### DBMS Questions. 3.) For which two constraints are indexes created when the constraint is added?

DBMS Questions 1.) Which type of file is part of the Oracle database? A.) B.) C.) D.) Control file Password file Parameter files Archived log files 2.) Which statements are use to UNLOCK the user? A.)

### B.E. COMPUTER ENGINEERING THIRD YEAR SEMESTER VI SUBJECT: ADVANCED DATABASES

B.E. COMPUTER ENGINEERING SUBJECT: ADVANCED DATABASES Lectures: 3 Hrs per week Practical: 2 Hrs per week Oral Exam.: 25 Marks Objectives of the course: To study the further database techniques beyond which

### Computer/Information Science Course Descriptions

Computer/Information Science Course Descriptions COMS 1003: Introduction to Computer Based Systems Provides students with both computer concepts and hands-on applications. Although little or no prior computer

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

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

### AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS

AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,

### Operating Systems OBJECTIVES 7.1 DEFINITION. Chapter 7. Note:

Chapter 7 OBJECTIVES Operating Systems Define the purpose and functions of an operating system. Understand the components of an operating system. Understand the concept of virtual memory. Understand the

College of Software Engineering Undergraduate Course Syllabus Course ID 311006040 Course Name Operating System Course Attribute Compulsory Selective Course Language English Chinese Credit Hour 4 Period

### 2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]

Code No: R05220502 Set No. 1 1. (a) Describe the performance analysis in detail. (b) Show that f 1 (n)+f 2 (n) = 0(max(g 1 (n), g 2 (n)) where f 1 (n) = 0(g 1 (n)) and f 2 (n) = 0(g 2 (n)). [8+8] 2. (a)

### Weighted Total Mark. Weighted Exam Mark

CMP2204 Operating System Technologies Period per Week Contact Hour per Semester Total Mark Exam Mark Continuous Assessment Mark Credit Units LH PH TH CH WTM WEM WCM CU 45 30 00 60 100 40 100 4 Rationale

### DBMS / Business Intelligence, SQL Server

DBMS / Business Intelligence, SQL Server Orsys, with 30 years of experience, is providing high quality, independant State of the Art seminars and hands-on courses corresponding to the needs of IT professionals.

### Digital Modulation. David Tipper. Department of Information Science and Telecommunications University of Pittsburgh. Typical Communication System

Digital Modulation David Tipper Associate Professor Department of Information Science and Telecommunications University of Pittsburgh http://www.tele.pitt.edu/tipper.html Typical Communication System Source

### C4 Computer Vision. 4 Lectures Michaelmas Term Tutorial Sheet Prof A. Zisserman. fundamental matrix, recovering ego-motion, applications.

C4 Computer Vision 4 Lectures Michaelmas Term 2004 1 Tutorial Sheet Prof A. Zisserman Overview Lecture 1: Stereo Reconstruction I: epipolar geometry, fundamental matrix. Lecture 2: Stereo Reconstruction

### Department of Industrial Engineering

Department of Industrial Engineering Master of Engineering Program in Industrial Engineering (International Program) M.Eng. (Industrial Engineering) Plan A Option 2: Total credits required: minimum 39

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

### THE OPEN UNIVERSITY OF TANZANIA FACULTY OF SCIENCE TECHNOLOGY AND ENVIRONMENTAL STUDIES BACHELOR OF SIENCE IN DATA MANAGEMENT

THE OPEN UNIVERSITY OF TANZANIA FACULTY OF SCIENCE TECHNOLOGY AND ENVIRONMENTAL STUDIES BACHELOR OF SIENCE IN DATA MANAGEMENT ODM 106.DATABASE CONCEPTS COURSE OUTLINE 1.0 Introduction This introductory

### Monash University Clayton s School of Information Technology CSE3313 Computer Graphics Sample Exam Questions 2007

Monash University Clayton s School of Information Technology CSE3313 Computer Graphics Questions 2007 INSTRUCTIONS: Answer all questions. Spend approximately 1 minute per mark. Question 1 30 Marks Total

### 2D Geometric Transformations. COMP 770 Fall 2011

2D Geometric Transformations COMP 770 Fall 2011 1 A little quick math background Notation for sets, functions, mappings Linear transformations Matrices Matrix-vector multiplication Matrix-matrix multiplication

### PARALLEL PROGRAMMING

PARALLEL PROGRAMMING TECHNIQUES AND APPLICATIONS USING NETWORKED WORKSTATIONS AND PARALLEL COMPUTERS 2nd Edition BARRY WILKINSON University of North Carolina at Charlotte Western Carolina University MICHAEL

### Lezione 6 Communications Blockset

Corso di Tecniche CAD per le Telecomunicazioni A.A. 2007-2008 Lezione 6 Communications Blockset Ing. Marco GALEAZZI 1 What Is Communications Blockset? Communications Blockset extends Simulink with a comprehensive

### ADVANCED LINEAR ALGEBRA FOR ENGINEERS WITH MATLAB. Sohail A. Dianat. Rochester Institute of Technology, New York, U.S.A. Eli S.

ADVANCED LINEAR ALGEBRA FOR ENGINEERS WITH MATLAB Sohail A. Dianat Rochester Institute of Technology, New York, U.S.A. Eli S. Saber Rochester Institute of Technology, New York, U.S.A. (g) CRC Press Taylor

### Wireless Communication Technologies

1 Wireless Communication Technologies Lin DAI Requirement 2 Prerequisite: Principles of Communications A certain math background Probability, Linear Algebra, Matrix Be interactive in class! Think independently!

### Instructor: Michael J. May Semester 1 of 5775. The course meets 9:00am 11:00am on Sundays. The Targil for the course is 12:00pm 2:00pm on Sundays.

Syllabus for ISM 14-324: Database Systems Department of Software and Information Systems Achi Racov School of Engineering Kinneret College on the Sea of Galilee Instructor: Michael J. May Semester 1 of

### Dr. Rafiq Zakaria Campus. Maulana Azad College of Arts, Science & commerce, Aurangabad. Department of Computer Science. Academic Year

Dr. Rafiq Zakaria Campus Maulana Azad College of Arts, Science & commerce, Aurangabad Department of Computer Science Academic Year 2015-16 MCQs on Database Management System Using SQL Sem. :- IV Q.1 DBMS

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

### Lecture Notes, CEng 477

Computer Graphics Hardware and Software Lecture Notes, CEng 477 What is Computer Graphics? Different things in different contexts: pictures, scenes that are generated by a computer. tools used to make

### Sequence of Mathematics Courses

Sequence of ematics Courses Where do I begin? Associates Degree and Non-transferable Courses (For math course below pre-algebra, see the Learning Skills section of the catalog) MATH M09 PRE-ALGEBRA 3 UNITS

### 4. Factor polynomials over complex numbers, describe geometrically, and apply to real-world situations. 5. Determine and apply relationships among syn

I The Real and Complex Number Systems 1. Identify subsets of complex numbers, and compare their structural characteristics. 2. Compare and contrast the properties of real numbers with the properties of

### Scan-Line Fill. Scan-Line Algorithm. Sort by scan line Fill each span vertex order generated by vertex list

Scan-Line Fill Can also fill by maintaining a data structure of all intersections of polygons with scan lines Sort by scan line Fill each span vertex order generated by vertex list desired order Scan-Line

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

### Curriculum Reform. Department of Computer Sciences University of Texas at Austin 7/10/08 UTCS

Curriculum Reform Department of Computer Sciences University of Texas at Austin 7/10/08 1 CS Degrees BA with a major in CS BS, Option I: Computer Sciences BS, Option II: Turing Scholars Honors BS, Option

### UNIVERSITY OF PUNE, PUNE 411007. BOARD OF STUDIES IN MATHEMATICS SYLLABUS

UNIVERSITY OF PUNE, PUNE 411007. BOARD OF STUDIES IN MATHEMATICS SYLLABUS F.Y.B.Sc (MATHEMATICS) PAPER 1 ALGEBRA AND GEOMETRY FIRST TERM 1) Sets (4 Lectures) 1.1 Power set of a set, Product of two sets.

### (Refer Slide Time: 1:21)

Introduction to Computer Graphics Dr. Prem Kalra Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture - 5 Polygon Clipping and Polygon Scan Conversion We have been

### D.Hemavathi,R.Venkatalakshmi Assistant Professor, SRM University, Kattankulathur

DATABASE SYSTEMS IT 0303 5 TH Semester D.Hemavathi,R.Venkatalakshmi Assistant Professor, SRM University, Kattankulathur School of Computing, Department of IT Unit 2:Entity Relationship Model Disclaimer

### Artificial Intelligence. Class: 3 rd

Artificial Intelligence Class: 3 rd Teaching scheme: 4 hours lecture credits: Course description: This subject covers the fundamentals of Artificial Intelligence including programming in logic, knowledge

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

### Database Systems Introduction Dr P Sreenivasa Kumar

Database Systems Introduction Dr P Sreenivasa Kumar Professor CS&E Department I I T Madras 1 Introduction What is a Database? A collection of related pieces of data: Representing/capturing the information

### Polygon Clipping and Filling Week 3, Lecture 5

CS 430/536 Computer Graphics I Polygon Clipping and Filling Week 3, Lecture 5 David Breen, William Regli and Maxim Peysakhov Geometric and Intelligent Computing Laboratory Department of Computer Science

### CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing

CS Master Level Courses and Areas The graduate courses offered may change over time, in response to new developments in computer science and the interests of faculty and students; the list of graduate

### æ A collection of interrelated and persistent data èusually referred to as the database èdbèè.

CMPT-354-Han-95.3 Lecture Notes September 10, 1995 Chapter 1 Introduction 1.0 Database Management Systems 1. A database management system èdbmsè, or simply a database system èdbsè, consists of æ A collection

### CSE 562 Database Systems

UB CSE Database Courses CSE 562 Database Systems CSE 462 Database Concepts Introduction CSE 562 Database Systems Some slides are based or modified from originals by Database Systems: The Complete Book,

### ADVANCED APPLICATIONS OF ELECTRICAL ENGINEERING

Development of a Software Tool for Performance Evaluation of MIMO OFDM Alamouti using a didactical Approach as a Educational and Research support in Wireless Communications JOSE CORDOVA, REBECA ESTRADA

### Michigan State University Department of Electrical and Computer Engineering. ECE 280: ELECTRICAL ENGINEERING ANALYSIS (Spring 2008) Overview

Michigan State University Department of Electrical and Computer Engineering ECE 280: ELECTRICAL ENGINEERING ANALYSIS (Spring 2008) Overview Staff Lectures Instructor (First Half of Course: 01/07/08 02/22/08)

### DBMS Interview Questions

DBMS Interview Questions 1. What is database? A database is a collection of information that is organized. So that it can easily be accessed, managed, and updated. 2. What is DBMS? DBMS stands for Database

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

### Advisor Counsel. Computer basics and Programming. Introduction to Engineering Design. C Programming Project. Digital Engineering

Course Description ( 전체개설교과목개요 ) Advisor Counsel Yr. : Sem. : Course Code: CD0001 Advisor in the department which programs engineering education guides certificate program educational objectives, learning

### Vector storage and access; algorithms in GIS. This is lecture 6

Vector storage and access; algorithms in GIS This is lecture 6 Vector data storage and access Vectors are built from points, line and areas. (x,y) Surface: (x,y,z) Vector data access Access to vector

### Linear Programming. March 14, 2014

Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1