Summary of Courses DETAILED SYLLABUS
|
|
- Marian Chandler
- 5 years ago
- Views:
Transcription
1 23 Department of Computer Science & Engineering Dhaka University of Engineering & Technology, Gazipur Gazipur-1700 Summary of Courses 3 rd year 1 st semester Sl. Course Course Title Theory Sessional Credits No. No. hrs/week hrs/week 1. CSE-3122 Software & Hardware Project 0 3/ CSE-3511 Algorithm Design & Analysis CSE-3512 Algorithm Design & Analysis Sessional CSE-3311 Database Systems CSE-3312 Database Systems Sessional 0 3/ Math-3411 Mathematics-V CSE-3211 Theory of Computation CSE-3811 Microprocessor and Assembly Language CSE-3812 Microprocessors and Assembly Language Sessional 0 3/ CSE-3110 Internet Programming Sessional Total Contact Hours: 16T +10.5S = 26.5 hrs/week No. of Theory Courses: 5 Total credits: No. of Lab / Sessional courses: 5 DETAILED SYLLABUS CSE-3122 Software & Hardware Project 3 Hours/week 0.75 Credits Student will perform a project on basis of previous software and hardware related courses. CSE-3511 Algorithm Design and Analysis Techniques for analysis of algorithms, methods of designing efficient algorithms: divide and conquer, greedy method, dynamics programming, backtracking, branch and bound, basic search and traversal techniques, graph algorithms, algebraic simplification and transformations, lower bound theory, NPhard and NP-complete problems. CSE-3512 Algorithm Design and Analysis Sessional 3 Hours/week 1.5 Credits Sessional based on Algorithm Design and Analysis (CSE-3511).
2 24 CSE-3311 Database Systems Database concepts: files & database management System, entity-relationship model, relational algebra, SQL, integrity constraints, functional dependency, normalization, 1NF, 2NF, 3NF, BCNF, 4 th normal form. Indexing & hashing, transaction processing & concurrency control, recovery system, distributed database & client server model, security & authorization. CSE-3312 Database Systems Sessional Sessional based on Database Systems (CSE 3311). Math-3411 Mathematics V 4 Hours/week 4 Credits Complex variables: Partial differential equation, boundary value problem, infinite series, special functions, complex number system, general functions of a complex variable, limits and continuity of a function of complex variable and related theorems, complex differentiation and the Cauchy-Riemann equations. Line integral of a complex function, Cauchy integral formula, Liouville s theorem, Taylor s and Laurent s theorem. Contour integration; Singular points. Residue, Cauchy s residue theorem. Infinite series: Sequences and series, convergence of series, uniform convergence. Absolute convergence and divergence. Partial differential equation: Elimination of arbitrary constant and arbitrary function. Solution of differential equation by the method based on the factorization of the operator. Solution of the linear and non-linear partial differential equations by various methods. Homogeneous P.D.E. of higher order with constant co-efficient. Non-homogeneous linear equations with constant co-efficient. Nonhomogeneous linear P.D.E. with variable co-efficient. Wave equations, particular solutions with boundary and initial conditions. CSE-3211 Theory of Computation Concepts of strings, languages, prefix, suffix, concatenation, recognition and generation of languages. Expressing languages, recursive definition of languages. Regular languages, regular expressions, finite automata (FA). Distinguishability of strings, unions, intersection and compliments of languages and their FAs. Non determinism in FA without Lamda transition. Non determinism in FA with Lamda transition, closure. Kleene s theorem, combining FAs. Regular languages Vs nonregular languages. Pumping lemma for regular language and its applications. Decision problems for regular languages. Context-free grammar (CFG)s and language (CFL)s. Context-free grammar (CFG)s and language (CFL)s. Unions, concatenations and kleene s stars of CFL s. Unions, concatenations and kleene stars of CFLs Derivation trees. Ambiguity and unambiguity in derivation trees, and their causes. Normal form, Backus-Naur form, chomsky normal form. Push-Down Automata (PDA), deterministic PDA. PDA and CFG. Parsing :Top-down/Bottom-up. CFL and non-cfl languages; Pumping lemma for CFL. Intersection and complements of CFLs, decision problems.turning Machine (TM)s. Combining TMs. Computing partial functions with TMs. Halting problem, undecidability and computability, recursion function theory, Chomsky hierarchy, deterministic context free languages, closure properties of families of languages, computational complexity theory, intractable problems, applications in parsing, pattern matching and the design of efficient algorithms.
3 25 CSE-3811 Microprocessor and Assembly Language Microprocessor and microcomputers, Intel 8086 microprocessor: Internal architecture, register structure, addressing modes, interrupts, instruction set, assembly language programming. Evaluation of microprocessors applications, coprocessor. An overview of Intel 80186, 80286,80386, and Pentium microprocessors, RISC and SISC processors. CSE-3812 Microprocessor and Assembly Languages Sessional Sessional based on Microprocessor and Assembly Language (CSE 3811). CSE-3110 Internet Programming Sessional 3 Hours/week 1.5 Credits Internet and World Wide Web application HTML, SGML, XML, CGI programming, E-commerce, internet DBASE, Java script, VB script.
4 26 Department of Computer Science & Engineering Dhaka University of Engineering & Technology, Gazipur Gazipur-1700 Summary of Courses 3 rd year 2 nd semester Sl. Course No. Course Title Theory Sessional Credits No. hrs/week hrs/week 1. CSE-3122 Mobile Application Development Project CSE-3221 Operating System CSE-3222 Operating System Sessional 0 3/ CSE-3223 Compiler Design CSE-3224 Compiler Design Sessional 0 3/ Hum-3423 Industrial Management & Accounting CSE-3421 Data Communication CSE-3422 Data Communication Sessional 0 3/ CSE-3621 Information System Analysis & Design CSE-3622 Information System Analysis & Design Sessional 0 3/ Total Contact Hours: 16T + 9S = 25 hrs/week No. of Theory Courses: 5 Total credits: 20.5 No. of Lab / Sessional courses: 5 Course No.: CSE Hours/week 1.5 Credits DETAILED SYLLABUS Title: Mobile Application Development Project Content: This course will introduce students to any one of the platforms in use on small and mobile devices. Platforms include Apple iphone, Google Android and Microsoft Windows Phone. Introduction to mobile application development, Compare and contrast among various platforms namely iphone, Android and Windows Phone. Setting up Development Environment: Installing Development Tools and SDKs, Language Basics and Syntax Revision (C and Objective-C for iphone, Java for Android and C# for Windows Phone). Designing and Building Applications, XML Parsing, HTTP POST/GET Data Programming, App to App Communication, Tiles and Notifications, Maps and Location Based Application, Working with Multimedia(Camera, Images and Audio), Files and Storage, Network Programming, Game Development Concepts, Debugging, Testing & Deploying Applications to the market place. CSE-3221 Operating System Introduction operating system, goals and components of operating system. Process management, process states and states transition, process control blocks, job and process scheduling, scheduling levels, objective and criteria. CPU scheduling algorithm, process co-ordinations critical section problems, semaphores. Deadlock: prevention, avoidance, detection and recovery. Memory management, virtual memory, file system, file organization, space allocation, file access control mechanisms, Disk scheduling algorithm, parallel processing. Operating systems security. Function of UNIX. CSE-3222 Operating System Sessional Sessional based on Operating Systems (CSE 3221)
5 27 CSE-3223 Compiler Design Introduction to compiler: Compiling techniques including parsing, semantic processing, and optimization, compiler and translator writing systems. Lexical analyzer, regular expression, nondeterministic finite automata (NFA) and deterministic finite automata (DFA), contexts free grammar, ambiguous grammar, and basic parsing techniques. Scope rules, intermediate code, block structure, data structure for symbol table and symbol tables, run-time stack management and run time support, parameter passing mechanisms; stack storage organization and templates, heap storage management. Code generation macros: code optimization, error management, error detection and recovery. A small project. CSE-3224 Compiler Design Sessional Sessional based on Compiler Design (CSE ) Hum-3413 Industrial Management and Accounting 4 Hours/ week 4 Credits Industrial management: Administration, Management and organization, Authority and responsibility, Scientific management, Organization structure, organization chart, Span of control, Selection and recruitment of employees; training and its types, promotion, wave system and incentive; job-evaluation and merit rating, Plant layout, layout of physical facilities, Transportation and storage, Material handling, Maintenance, Maintenance policy, Production control in intermittent and continuous manufacturing industry, functions of production control, Purchasing procedures: Inventory-need and methods of control, Factors affecting inventory building-up, Economic lot size reorder point. Accountancy: Basic accounting principles, Cash book, Trial Balance, Balance Sheet, Bank Reconciliation statement, Cost Account and objectives; Elements of a costs; Direct cost, Overhead allocation. Preparation of a cost sheet, Computation of break even point. Standard costing job order costing, Process costing, Cost Variance. CSE-3421 Data Communications 3 Hours/ week 3 Credits Introduction to Data Communication and Networks (OSI Model and TCP/IP Protocol Suite); Signal and Frequency, Analog Data Transmission, Digital Data Transmission: Line Coding, Sampling Theorem, Analog to Digital Conversion (PCM, DM etc.); Modulation Techniques: Analog to Analog Conversion (AM, FM, PM etc.) and Digital to Analog Conversion (ASK, FSK, PSK, BPSK, QPSK, OQPSK, QAM etc.); Bit Error Rate (BER), Transmission Impairments: Attenuation, Distortion, Noise, Interference; Performance Metrics: Bandwidth, Throughput, Latency (Delay), Bandwidth-Delay Product, Jitter. Multiplexing: FDM, WDM, TDM; Spread Spectrum: FHSS, DSSS, OFDM; Transmission Medium: Guided (i.e., Copper, Coaxial, Fiber Optic etc.) and Unguided (i.e., Wireless); Switching: Circuit Switched Networks and Packet Switched Networks (Datagram Networks and Virtual-circuit Networks); Error Detection and Correction; Data Link Control (i.e., Framing, Error Control, Flow Control etc.), Congestion Control in Data Networks. Recommended Texts: 1. Data Communication and Networking, Author: Behrouz A. Forouzan 2. Data and Computer Communication, Author: William Stallings 3. Computer Networks, Author: Andrew S. Tanenbaum CSE-3422 Data Communications Sessional Sessional based on Data Communications (CSE 3421)
6 28 CSE-3621 Information System Analysis & Design Introduction to Information system and environment: Introduction to system, characteristics, organization & elements of system. Types of system. System Development life cycle: Introduction to SDLC, Feasibility study, Analysis, Design, Implementation, Post Implementation & maintenance, Consideration for candidate system. Role of the System Analyst. System planning & Initial Investigation, Information process & stages of System Design, Input/Output & Form Design, File Structure & organization. Database Design: Objective, Key terms, physical & logical views of Data, Data structure, Normalization System. Implementation: System Testing & Quality Assurance. Implementation & Software Maintenance, Hardware/ Software selection, Project scheduling & software Security, Disaster Recovery & Ethics in system development, Case study. Object Oriented Modeling & Design: Introduction to object modeling & Functional Modeling. Object Oriented Analysis. Computer based information system. CSE-3622 Information System Analysis & Design Sessional Sessional based on Information System Analysis & Design (CSE 3621)
TIME SCHEDULE. 2 Physical Layer 15. Course General Outcomes: Sl. G.O On completion of this course the student will be able :
COURSE TITLE : DATA COMMUNICATION COURSE CODE : 3151 COURSE CATEGORY : B PERIODS/WEEK : 4 PERIODS/SEMESTER : 60 CREDITS : 4 TIME SCHEDULE MODULE TOPICS PERIODS 1 Concepts of Data Communication 15 2 Physical
More informationCIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
More informationFinal Course Review. Reading: Chapters 1-9
Final Course Review Reading: Chapters 1-9 1 Objectives Introduce concepts in automata theory and theory of computation Identify different formal language classes and their relationships Design grammars
More informationTECNIA INSTITUTE OF ADVANCED STUDIES
Assignment1(UNIT1) Paper Code:MCA201 Paper: Theory of Computation (a) Positive closure. (b) Automata. Lexical analyzer. (d) Transition table. (e) Final state. Chomsky Classification. (ii) Regular Expressions.
More informationADMINISTRATIVE MANAGEMENT COLLEGE
First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2016
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2016 Lecture 15 Ana Bove May 23rd 2016 More on Turing machines; Summary of the course. Overview of today s lecture: Recap: PDA, TM Push-down
More informationTotal No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.
(DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)
More information(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:
(DMTCS 01) M.Tech. DEGREE EXAMINATION, DECEMBER - 2015 (Examination at the end of First Year) COMPUTER SCIENCE Paper - I : Data structures Time : 03 Hours Maximum Marks : 75 Answer Question No.1 is compulsory
More informationSCHEME OF INSTRUCTION & EXAMINATION B.E. III YEAR (COMPUTER SCIENCE & ENGINEERING) With effect from the Academic year
SCHEME OF INSTRUCTION & EXAMINATION B.E. III YEAR (COMPUTER SCIENCE & ENGINEERING) With effect from the Academic year 2013-2014 SEMESTER - I S. No. Syllabus Ref. No. SUBJECT Scheme of Scheme of Examination
More informationCOURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05
COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 Unit 1 : LINEAR DATA STRUCTURES Introduction - Abstract Data Types (ADT), Arrays and its representation Structures, Stack, Queue, Circular
More informationCOMPUTER SCIENCE (ELECTIVE) Paper-A (100 Marks) Section-I: INTRODUCTION TO INFORMATION TECHNOLOGY Computer and its characteristics, Computer Organization & operation, Components of Computer, Input/Output
More informationSyllabi of the Comprehensive Examination in Computer Science
Syllabi of the Comprehensive Examination in Computer Science The material of the comprehensive examination is drawn mostly from the undergraduate curriculum at Kuwait University and is updated to reflect
More informationDCN Questions CHAPTER 1:- NETWORKING FUNDAMENTALS
DCN Questions CHAPTER 1:- NETWORKING FUNDAMENTALS Q1. What are the four fundamental Characteristics of Data Communication? On which effectiveness of data communication is depended? Q2. Define data communication?
More informationii) Do the following conversions: output is. (a) (101.10) 10 = (?) 2 i) Define X-NOR gate. (b) (10101) 2 = (?) Gray (2) /030832/31034
No. of Printed Pages : 4 Roll No.... rd 3 Sem. / ECE Subject : Digital Electronics - I SECTION-A Note: Very Short Answer type questions. Attempt any 15 parts. (15x2=30) Q.1 a) Define analog signal. b)
More informationB.Tech in COMPUTER SCIENCE & ENGINEERING
B.Tech in COMPUTER SCIENCE & ENGINEERING Paper - 1 S.No. Unit/Topic NPTEL Link 1. DIGITAL SYSTEM DESIGN Binary Systems: Introduction to Number Systems and conversions. Arithmetic with number systems, Signed
More informationSIR C R REDDY COLLEGE OF ENGINEERING
SIR C R REDDY COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY Course Outcomes II YEAR 1 st SEMESTER Subject: Data Structures (CSE 2.1.1) 1. Describe how arrays, records, linked structures,
More informationTheory of Computation
Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s
More information1. a) Discuss primitive recursive functions with an example? 15M Or b) Statements and applications of Euler s and Fermat s Theorems?
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1. a) Discuss primitive recursive functions with an example? 15M b) Statements and applications of Euler s and Fermat s Theorems? 15M 2. a) Define DFA and NFA
More information(DCS/DIT311) Answer question no.1 compulsory (15 1 = 15) Answer ONE question for each unit (4 15 = 60) 1) Write short notes on :
(DCS/DIT311) B.Tech. DEGREE EXAMINATION, DEC. - 2013 (Examination at the end of Third Year Third Semester) Computer Science & IT Paper - I : OPERATING SYSTEMS Time : 3 Hours Maximum Marks : 75 Answer question
More informationBooks : 4 th SEMESTER MCA F.M -70. Programming With Java(3-1-0)Cr.-4. Module-1
MCA 206 Module-1 Programming With Java(3-1-0)Cr.-4 F.M -70 Introduction to Java Programming Language, Java Evolution, Naming Conventions and Datatypes, Operators in Java, Control Statements in Java, Decision
More information(a) R=01[((10)*+111)*+0]*1 (b) ((01+10)*00)*. [8+8] 4. (a) Find the left most and right most derivations for the word abba in the grammar
Code No: R05310501 Set No. 1 III B.Tech I Semester Regular Examinations, November 2008 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE
More informationUnit-V System Concepts Unit-VI System Development Life Cycle (SDLC) Books
Sardar Patel University S.Y.B.Sc (Information Science) IS-201 : Introduction to Information Systems Effective from June 2003 Number of Credits/Lect. per week: 03 External marks: 80 University Examination
More informationII/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION
14 MA 401 II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION Common for all branches Engineering Mathematics -IV Maximum : 60 Marks 1 Answer all questions (1X12=12 Marks) a) Find the imaginary part
More informationList of Figures. About the Authors. Acknowledgments
List of Figures Preface About the Authors Acknowledgments xiii xvii xxiii xxv 1 Compilation 1 1.1 Compilers..................................... 1 1.1.1 Programming Languages......................... 1
More informationCourse Weekly Outline
Department: CS and IS Departments Stage: 3 rd Instructor name: Sumaya A. Hamad Academic status: Asst. Teacher Qualification: Msc. Place of work: College of CS & IT Course Name: Compiler Course Instructor
More informationVALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : III Year, V Semester Section : CSE - 1 & 2 Subject Code : CS6503 Subject
More informationModule 1. Introduction. Version 2, CSE IIT, Kharagpur
Module 1 Introduction Version 2, CSE IIT, Kharagpur Introduction In this module we shall highlight some of the basic aspects of computer networks in two lessons. In lesson 1.1 we shall start with the historical
More informationAbout the Authors... iii Introduction... xvii. Chapter 1: System Software... 1
Table of Contents About the Authors... iii Introduction... xvii Chapter 1: System Software... 1 1.1 Concept of System Software... 2 Types of Software Programs... 2 Software Programs and the Computing Machine...
More informationMultiple Choice Questions
Techno India Batanagar Computer Science and Engineering Model Questions Subject Name: Formal Language and Automata Theory Subject Code: CS 402 Multiple Choice Questions 1. The basic limitation of an FSM
More informationGUJARAT TECHNOLOGICAL UNIVERSITY B.E Semester: 4 Information Technology
Information Technology Subject Code 140702 Subject Name OPERATING SYSTEM Sr.No Course content 1. Introduction: What is an OS?, Evolution Of OS, OS Services, Types Of OS, Concepts of OS, Different Views
More informationSyllabus for Computer Science General Part I
Distribution of Questions: Part I Q1. (Compulsory: 20 marks). Any ten questions to be answered out of fifteen questions, each carrying two marks (Group A 3 questions, Group B, Group C and Group D 4 questions
More informationCOMPUTER SCIENCE/INFORMATION SYSTEMS DEGREE PLAN
COMPUTER SCIENCE/INFORMATION SYSTEMS DEGREE PLAN YEAR 1, SEMESTER 1 YEAR 1, SEMESTER 2 Composition I 3 Composition II 3 Calculus I 5 Calculus II 5 Humanistic (Religion) 3 Physics I 5 Total Wellness 2 Statistics
More informationUNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.0) Sessional Unit Code. Theory Unit Course
COURSE STRUCTURE (W.E.F. 2011 Batch Students) (Total Unit 7.0) Course Theory Unit Course Sessional Unit Code Code DCP 5001 Data Communication and 1.0 DCP 5002 Networking Lab. 0.5 Networking DCP 5003 Introduction
More information1. [5 points each] True or False. If the question is currently open, write O or Open.
University of Nevada, Las Vegas Computer Science 456/656 Spring 2018 Practice for the Final on May 9, 2018 The entire examination is 775 points. The real final will be much shorter. Name: No books, notes,
More informationTheory and Compiling COMP360
Theory and Compiling COMP360 It has been said that man is a rational animal. All my life I have been searching for evidence which could support this. Bertrand Russell Reading Read sections 2.1 3.2 in the
More informationSYED AMMAL ENGINEERING COLLEGE (An ISO 9001:2008 Certified Institution) Dr. E.M. Abdullah Campus, Ramanathapuram
CS6660 COMPILER DESIGN Question Bank UNIT I-INTRODUCTION TO COMPILERS 1. Define compiler. 2. Differentiate compiler and interpreter. 3. What is a language processing system? 4. List four software tools
More informationT.E. (Computer Engineering) (Semester I) Examination, 2013 THEORY OF COMPUTATION (2008 Course)
*4459255* [4459] 255 Seat No. T.E. (Computer Engineering) (Semester I) Examination, 2013 THEY OF COMPUTATION (2008 Course) Time : 3 Hours Max. Marks : 100 Instructions : 1) Answers to the two Sections
More informationMSc(IT) Program. MSc(IT) Program Educational Objectives (PEO):
MSc(IT) Program Master of Science (Information Technology) is an intensive program designed for students who wish to pursue a professional career in Information Technology. The courses have been carefully
More informationDecidable Problems. We examine the problems for which there is an algorithm.
Decidable Problems We examine the problems for which there is an algorithm. Decidable Problems A problem asks a yes/no question about some input. The problem is decidable if there is a program that always
More informationSYSTEMS PROGRAMMING. Srimanta Pal. Associate Professor Indian Statistical Institute Kolkata OXFORD UNIVERSITY PRESS
SYSTEMS PROGRAMMING Srimanta Pal Associate Professor Indian Statistical Institute Kolkata OXFORD UNIVERSITY PRESS Contents Preface v 1. Scope of Systems Programming 1 1.1 Introduction 7 1.2 Computers and
More informationUNIT I PART A PART B
OXFORD ENGINEERING COLLEGE (NAAC ACCREDITED WITH B GRADE) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS YEAR/SEM: III/V STAFF NAME: Dr. Sangeetha Senthilkumar SUB.CODE: CS6503 SUB.NAME:
More informationElectrical and Computer Engineering Technology
ECET 3400 Spring 2012 Data Communications Southern Polytechnic State University Electrical and Computer Engineering Technology Instructor Information Instructor: Dr. Craig A. Chin, Assistant Professor
More informationCompiler Construction Using
Compiler Construction Using Java, JavaCC, and Yacc ANTHONY J. DOS REIS Stale University ofnew York at New Pallz IEEE computer society WILEY A JOHN WILEY & SONS, INC., PUBLICATION Preface xv Chapter 1 Strings,
More informationTheory: 4 Hrs/Week Max. University Theory Examination: 60 Marks Max. Time for Theory Exam.: 3 Hrs. Continuous Internal Assessment: 40 Marks
School: Computer Science & Application Year : Second Year Course: Compiler Design Programme: M.C.A. Semester - IV Course Code: CSA0100P402 Theory: 4 Hrs/Week Max. University Theory Examination: 60 Marks
More informationName of the Assistant/ Associate Professor:Annu Saini Class and Section:BCA 1 st sem Subject:Computer and Programming Fundamentals July 2018
Class and Section:BCA 1 st sem Subject:Computer and Programming Fundamentals July 2018 Ist week Day 1 IInd week Day 1 3rd week Day 1 Introduction to computers Definition and characteristics of computer
More informationComputation Engineering Applied Automata Theory and Logic. Ganesh Gopalakrishnan University of Utah. ^J Springer
Computation Engineering Applied Automata Theory and Logic Ganesh Gopalakrishnan University of Utah ^J Springer Foreword Preface XXV XXVII 1 Introduction 1 Computation Science and Computation Engineering
More informationComputer Sciences Department
1 Reference Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER 3 D E C I D A B I L I T Y 4 Objectives 5 Objectives investigate the power of algorithms to solve problems.
More informationLanguages and Automata
Languages and Automata What are the Big Ideas? Tuesday, August 30, 2011 Reading: Sipser 0.1 CS235 Languages and Automata Department of Computer Science Wellesley College Why Take CS235? 1. It s required
More informationTelecommunications II TEL 202 Spring, 2004
Telecommunications II TEL 202 Spring, 2004 Time: Lecture: Thursday 12:20 3:30 Lynn Campus, Room LW207 Laboratory: Thursday 4:00 5:00 Lynn Campus, Room LE201 Instructor: Scott Stimpson Office: Lynn, W228
More informationCS415 Compilers Overview of the Course. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University
CS415 Compilers Overview of the Course These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University Critical Facts Welcome to CS415 Compilers Topics in the
More informationINFORMATION TECHNOLOGY COURSE OBJECTIVE AND OUTCOME
INFORMATION TECHNOLOGY COURSE OBJECTIVE AND OUTCOME CO-1 Programming fundamental using C The purpose of this course is to introduce to students to the field of programming using C language. The students
More informationLanguages and Compilers
Principles of Software Engineering and Operational Systems Languages and Compilers SDAGE: Level I 2012-13 3. Formal Languages, Grammars and Automata Dr Valery Adzhiev vadzhiev@bournemouth.ac.uk Office:
More informationDesign and Analysis of Algorithms COT-301
Design and Analysis of Algorithms COT-301 L T P Theory: 100 4 1 - Sessional: 25 1. Introduction Review of elementary data structures, analyzing algorithms, asymptotic notation, recurrence relations, Hash
More informationFINAL EXAM REVIEW PLEASE NOTE THE MATERIAL FROM LECTURE #16 at the end. Exam 1 Review Material
FINAL EXAM REVIEW PLEASE NOTE THE MATERIAL FROM LECTURE #16 at the end Chapters in the book 1, 2, 3, 5, 6 Exam 1 Review Material Topics You are also responsible for the reading in the chapters understanding
More informationDepartment of Computer Science & Engineering School of Engineering & Technology HNB Garhwal University Srinagar Garhwal
Department of Computer Science & Engineering School of Engineering & Technology HNB Garhwal University Srinagar Garhwal Admission Notification for M. Tech. (Computer Science & Engineering) First Semester
More informationJNTUWORLD. Code No: R
Code No: R09220504 R09 SET-1 B.Tech II Year - II Semester Examinations, April-May, 2012 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering) Time: 3 hours Max. Marks: 75 Answer any five
More informationPSD3A Principles of Compiler Design Unit : I-V. PSD3A- Principles of Compiler Design
PSD3A Principles of Compiler Design Unit : I-V 1 UNIT I - SYLLABUS Compiler Assembler Language Processing System Phases of Compiler Lexical Analyser Finite Automata NFA DFA Compiler Tools 2 Compiler -
More informationUniversity of Nevada, Las Vegas Computer Science 456/656 Fall 2016
University of Nevada, Las Vegas Computer Science 456/656 Fall 2016 The entire examination is 925 points. The real final will be much shorter. Name: No books, notes, scratch paper, or calculators. Use pen
More informationObjectives. Learn how computers are connected. Become familiar with different types of transmission media
Objectives Learn how computers are connected Become familiar with different types of transmission media Learn the differences between guided and unguided media Learn how protocols enable networking 2 Objectives
More informationTopic wise Tests. Number Systems,Boolean Expression, Boolean Laws & K-maps
Test No Topic code Topic CSIT-01 CSIT-02 CSIT-03 CSIT-04 GDL 1 (Digital Logic) GDL 2 (Digital Logic) GCO 1 (Computer Organization) GCO 2 (Computer Organization) Number Systems,Boolean Expression, Boolean
More informationIT4405 Computer Networks (Compulsory)
IT4405 Computer Networks (Compulsory) INTRODUCTION This course provides a comprehensive insight into the fundamental concepts in data communications, computer network systems and protocols both fixed and
More informationTheory of Programming Languages COMP360
Theory of Programming Languages COMP360 Sometimes it is the people no one imagines anything of, who do the things that no one can imagine Alan Turing What can be computed? Before people even built computers,
More informationTheory of Computation, Homework 3 Sample Solution
Theory of Computation, Homework 3 Sample Solution 3.8 b.) The following machine M will do: M = "On input string : 1. Scan the tape and mark the first 1 which has not been marked. If no unmarked 1 is found,
More informationSkyup's Media. PART-B 2) Construct a Mealy machine which is equivalent to the Moore machine given in table.
Code No: XXXXX JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD B.Tech II Year I Semester Examinations (Common to CSE and IT) Note: This question paper contains two parts A and B. Part A is compulsory
More informationPunjab Technical University Bachelor in Mobile Computing & Internet Batch 2014 onwards THIRD SEMESTER
THIRD SEMESTER Review of DBMS: Punjab Technical University RELATIONAL DATABASE MANAGEMENT SYSTEM BMCI301 Section A Basic DBMS terminology; Architecture of a DBMS: Data Independence - Physical and Logical
More informationMadhya Pradesh Bhoj (Open) University, Bhopal
Subject- Computer Organisation & System Software Maximum Marks: 20 Q.1 What is Number System? Explain Its Types? Q.2 What is Program Interrupt? Explain it. Q.3 Explain the Floating Point Representation?
More informationComputer 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
More informationCS/B.Tech/CSE/IT/EVEN/SEM-4/CS-402/ ItIauIafIaAblll~AladUnrtel1ity
CS/B.Tech/CSE/IT/EVEN/SEM-4/CS-402/2015-16 ItIauIafIaAblll~AladUnrtel1ity ~ t; ~~ ) MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL Paper Code: CS-402 FORMAL LANGUAGE AND AUTOMATA THEORY
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Compiler Design
i About the Tutorial A compiler translates the codes written in one language to some other language without changing the meaning of the program. It is also expected that a compiler should make the target
More informationM.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES
(DMCS 01) M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2014 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer
More informationEvaluation Scheme L T P Total Credit Theory Mid Sem Exam
DESIGN OF LANGUAGE PROCESSORS Semester II (Computer Engineering) SUB CODE: MECE201 Teaching Scheme (Credits and Hours): Teaching scheme Total Evaluation Scheme L T P Total Credit Theory Mid Sem Exam CIA
More informationM.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I
Paper I DATA STRUCTURES (DMCS 01) 1. Explain in detail about the overview of Data structures. 2. Explain circular linked list and double-linked list. 3. Explain CPU scheduling in Multiprogramming Environment.
More informationCT32 COMPUTER NETWORKS DEC 2015
Q.2 a. Using the principle of mathematical induction, prove that (10 (2n-1) +1) is divisible by 11 for all n N (8) Let P(n): (10 (2n-1) +1) is divisible by 11 For n = 1, the given expression becomes (10
More informationR10 SET a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design?
Code No: R22054 COMPUTER ORGANIZATION (Com. to CSE, ECC) 1. a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design? 2. Explain Memory Subsystem Organization
More informationQuestion Bank. 10CS63:Compiler Design
Question Bank 10CS63:Compiler Design 1.Determine whether the following regular expressions define the same language? (ab)* and a*b* 2.List the properties of an operator grammar 3. Is macro processing a
More informationM.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.
Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors
More informationAnswer any Five Questions. All questions carry equal marks.
PART I, PAPER I (Problem Solving and Programming) 1. What do you understand by function prototype? Differentiate between call by value and call by reference methods of parameters passing to a function
More informationDBMS Lesson Plan. Name of the faculty: Ms. Kavita. Discipline: CSE. Semester: IV (January-April 2018) Subject: DBMS (CSE 202-F)
DBMS Lesson Plan Name of the faculty: Ms. Kavita Discipline: CSE Semester: IV (January-April 2018) Subject: DBMS (CSE 202-F) Week No Lecture Day Topic (including assignment/test) 1 1 Introduction to Database
More informationDepartment of Computer Science SEMESTER-III CC-5 (Theory): Data Structures
Department of Computer Science SEMESTER-III CC-5 (Theory): Data Structures Theory: 60 Lectures Credit: 4 1. 2. 3. 4. 5. 6. 7. 8. Arrays (5 L) Single and Multi-dimensional Arrays, Sparse Matrices (Array
More informationR10 SET a) Construct a DFA that accepts an identifier of a C programming language. b) Differentiate between NFA and DFA?
R1 SET - 1 1. a) Construct a DFA that accepts an identifier of a C programming language. b) Differentiate between NFA and DFA? 2. a) Design a DFA that accepts the language over = {, 1} of all strings that
More informationQUESTION BANK. Formal Languages and Automata Theory(10CS56)
QUESTION BANK Formal Languages and Automata Theory(10CS56) Chapter 1 1. Define the following terms & explain with examples. i) Grammar ii) Language 2. Mention the difference between DFA, NFA and εnfa.
More informationData Communications & Computer Networks
Data Communications & Computer Networks ACOE312 Course Overview Fall 2008 1 Agenda Instructor & class details General comments Course objectives Students assessment Course outline Textbook(s) 1 Instructor
More informationCompiling Techniques
Lecture 1: Introduction 20 September 2016 Table of contents 1 2 3 Essential Facts Lecturer: (christophe.dubach@ed.ac.uk) Office hours: Thursdays 11am-12pm Textbook (not strictly required): Keith Cooper
More informationDerivations of a CFG. MACM 300 Formal Languages and Automata. Context-free Grammars. Derivations and parse trees
Derivations of a CFG MACM 300 Formal Languages and Automata Anoop Sarkar http://www.cs.sfu.ca/~anoop strings grow on trees strings grow on Noun strings grow Object strings Verb Object Noun Verb Object
More informationCOURSE OUTLINE. School of Engineering Technology and Applied Science. Computer Systems & Network Technology / Technician
COURSE OUTLINE SCHOOL: School of Engineering Technology and Applied Science DEPARTMENT: Information and Communication Engineering Technology (ICET) PROGRAM: Computer Systems & Network Technology / Technician
More informationNetwoking Essentials
Mark Sportack Walter J. Glenn Sams' Teach Yourself MCSE Netwoking Essentials SAMS PUBLISHING IN 14 DAYS Sams Publishing is an independant entity from Microsoft Corporation, and not affiliated with Microsoft
More informationIII) EXAMINATION, 2015 CS 331 : SYSTEM PROGRAMMING AND OPERATING SYSTEM I
Total No. of Questions 4] [Total No. of Printed Pages 4 Seat No. [4718]-31 T.Y. B.Sc. (Computer Science) (Semester III) EXAMINATION, 2015 CS 331 : SYSTEM PROGRAMMING AND OPERATING SYSTEM I Paper I (2008
More information(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY
1 (DMCA 101) PAPER - I - INFORMATION TECHNOLOGY 1. What is a computer based information system? Discuss the general technological trends for information technology. 2. (a) Describe the four main types
More informationFrequency: it refers to the number of periods in 1 s. It is formally expressed in Hertz (Hz)
Chapter2: Peak amplitude: it is the absolute value of the highest intensity. Frequency: it refers to the number of periods in 1 s. It is formally expressed in Hertz (Hz) Phase: it describes the position
More informationCS606- compiler instruction Solved MCQS From Midterm Papers
CS606- compiler instruction Solved MCQS From Midterm Papers March 06,2014 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 Final Term MCQ s and Quizzes CS606- compiler instruction If X is a
More informationBuilding Compilers with Phoenix
Building Compilers with Phoenix Syntax-Directed Translation Structure of a Compiler Character Stream Intermediate Representation Lexical Analyzer Machine-Independent Optimizer token stream Intermediate
More informationFormal languages and computation models
Formal languages and computation models Guy Perrier Bibliography John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman - Introduction to Automata Theory, Languages, and Computation - Addison Wesley, 2006.
More informationPrinciples of Programming Languages [PLP-2015] Detailed Syllabus
Principles of Programming Languages [PLP-2015] Detailed Syllabus This document lists the topics presented along the course. The PDF slides published on the course web page (http://www.di.unipi.it/~andrea/didattica/plp-15/)
More informationModule 2 Overview of Computer Networks
Module 2 Overview of Computer Networks Networks and Communication Give me names of all employees Who earn more than $00,000 ISP intranet backbone satellite link desktop computer: server: network link:
More informationModule 2 Overview of. Computer Networks
Module Overview of Networks and Communication Give me names of all employees Who earn more than $00,000 ISP intranet backbone satellite link desktop computer: server: network link: CS454/654 - Issues How
More informationDynamic Logic David Harel, The Weizmann Institute Dexter Kozen, Cornell University Jerzy Tiuryn, University of Warsaw The MIT Press, Cambridge, Massac
Dynamic Logic David Harel, The Weizmann Institute Dexter Kozen, Cornell University Jerzy Tiuryn, University of Warsaw The MIT Press, Cambridge, Massachusetts, 2000 Among the many approaches to formal reasoning
More informationQ1. Choose the correct answer:
Q1. Choose the correct answer: 1. In the Analysis phase, the development of the occurs, which is a clear statement of the goals and objectives of the project. A. Documentation B. flowchart C. program specification
More informationDEPARTMENT OF INFORMATION TECHNOLOGY AUTOMATA AND COMPILER DESIGN. B.Tech-IT, III Year -I Sem
DEPARTMENT OF INFORMATION TECHNOLOGY AUTOMATA AND COMPILER DESIGN B.Tech-IT, III Year -I Sem Dr. Smriti Agrawal Assoc. Professor J.B.Institute of Engg & Technology Yenkapally, Moinabad(Mandal) Himathnagar(post),Hydreabad
More information1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.
(DMCA 101) ASSIGNMENT - 1, MAY-2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. 3) What is software?
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2017 http://cseweb.ucsd.edu/classes/sp17/cse105-ab/ Today's learning goals Sipser Ch 1.2, 1.3 Design NFA recognizing a given language Convert an NFA (with or without
More information