6th Sem

  • November 2019
  • PDF

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA


Overview

Download & View 6th Sem as PDF for free.

More details

  • Words: 1,827
  • Pages: 7
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING GOVERNMENT ENGINEERING COLLEGE, RAIPUR (C.G.)-492010

SOFTWARE ENGINEERING Course Title

Course Code

SOFTWARE ENGINEERING CS601

Credits-3C L 2

T 1

Theory Paper (ES) P -

Max. Marks- 50 Min. Marks- 18 Duration-3hrs.

Faculty Member : CS\IT OBJECTIVE : To impart Knowledge in various phases of software life cycle and develop application. 1. Introductory concepts : Introduction, definition, objectives, Life cycle - system engineering : Hardware, software and Database considerations, system analysis. Software Project planning : scope of the software, resources, cost estimation, productivity, project scheduling. 2. Analysis : Principles, specification, analysis methods, overview of analysis tools - Data flow oriented Design : Transform centered design, Transaction centered design. Analysis of specific systems like Inventory control, Reservation system etc. 3. Software Design : Structured Design - top down and bottomup design - software design fundamentals : Modular design, qualitative tools: coupling, cohesion etc. - Data structure oriented Design :JSD, LCP comparative study of various design methods. 4. Implementing and Testing : Programming language characteristics, fundamentals, languages, classes, coding style efficiency. Testing : Objectives, black box and white box testing, various testing strategies, Art of debugging. 5. Maintanance, Reliability and Availability : Maintenance : Characteristics, controlling factors, maintenance tasks, side effects, preventive maintenance - Re Engineering - Reverse Engineering configuration management - Maintenance tools and techniques. Reliability : Concepts, Errors, Faults, Repair and availability, reliability and availability models, Recent trends and developments. TEXT 1.

R.S.PRESSMAN, Software Engineering - A practitioners approach, Third edition, McGraw Hill International editions, 1992.

REFERENCES 1. 2. 3. 4.

E. YOURDON and L. L.CONSTANTINE, Structured Design, PHI, 1979. R. FAIRLAY, Software Engineering Concepts, McGraw Hill, 1985. P. JALOTE, Integrated approach to software Engineering, Narosa, 1990. STEPHEN R. SCHACH, "Software Engineering with Java", McGraw Hill, 1997.

RELATED LINKS: • • •

IEEE transactions on software engineering WEBLIOGRAPHY software engineering The Apache software foundation

1

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING GOVERNMENT ENGINEERING COLLEGE, RAIPUR (C.G.)-492010

AUTOMATA AND FORMAL LANGUAGES Course Title AUTOMATA AND FORMAL LANGUAGES

Course Code CS602

Credits-3C L 2

T 1

Theory Paper (ES) P -

Max. Marks- 50 Min. Marks- 18 Duration-3hrs.

Faculty Member : OBJECTIVE : To provide a basic introduction to automata theory and to introduce the concepts involved in formal languages. 1. Finite Automata : Basic concepts of strings, alphabets, languages, Principles of Mathematical Induction. Finite automaton, Deterministic, Non-Deterministic and equivalence. Transition diagrams, epsilon transitions, Equivalence of regular expressions and FA. Moore and Mealy machines. 2. Regular languages : Pumping Lemma of regular sets, Myhill Nerode theorem Minimization of finite automata. Chomsky Hierarchy of languages. 3. Context Free Language : Relations between classes of languages, Context Free Grammar, Derivation trees, ambiguity simplification, Normal forms, UVWXY theorem, applications. 4. Pushdown Automata : Pushdown automata, definitions, context free languages, construction of PDA for simple CFLs, Linear bounded automata. 5. Turing machines :Turing machines , Introduction to computability , Universal Turing Machines , Types of Turing Machines , Techniques for construction of Turing machines , Halting problem , Stack automata , Definitions. TEXT : 1.

J.E.HOPCROFT and J.D.ULLMAN , Introduction to Automata Theory, Languages and Computation , Narosa Publishers,1990.

REFERENCES : 1. 2. 3.

R. SIRONMONEY, Formal Languages and Automata, The Christian Literature Society, 1984. Z. KOHAVI, Switching and Finite Automata Theory, TataMcGraw Hill, 1984. E.V.KRISHNAMOORTHY , Introductory Theory of Computer Science, Affiliated East West Press, 1986.

2

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING GOVERNMENT ENGINEERING COLLEGE, RAIPUR (C.G.)-492010

OPERATING SYSTEMS Course Title

Course Code

OPERATING SYSTEMS CS603

Credits-3C L 3

T 1

Theory Paper (ES) P -

Max. Marks- 100 Min. Marks- 35 Duration-3hrs.

Faculty Member : CS\IT OBJECTIVE : To expose the principles and practice of operating system design and to illustrate the current design practices using DOS and UNIX operating systems. 1. Evolution of operating systems : Evolution of operating systems - Types of operating systems -Different views of the operating systems - Principles of Design and Implementation. The process concept - system programmer's view of processes - operating system's views of processes - operating system services for process management. Process scheduling - Schedulers - Scheduling Algorithms 2. Concurrent processes : Concurrent Processes - Interprocess synchronization - Mutual Exclusion : Algorithms, Hardware support - semaphores - concurrent programming using semaphores. 3. Critical regions : Critical regions - Conditional critical regions - Monitors - Interprocess communication : Messages, Pipes. Deadlocks : Characterization, Prevention, Avoidance, Detection and Recovery, Combined approach to Deadlock Handling. 4. Memory management : Memory Management : Contiguous allocation - static, dynamic partitioned memory allocation - segmentation. Non-contiguous allocation - paging - Hardware support - Virtual Memory. 5. File systems : A Simple file system - General model of a file system - Symbolic file system - Access control verification - Logical file system - Physical file system - Allocation strategy module - Device strategy module, I/O initiators, Device handlers - Disk scheduling. TEXT : M.MILENKOVIC, Operating Systems, Concepts and Design, McGraw Hill Inc.,1992. REFERENCE : 1. 2. 3.

C.CROWLEY, Operating Systems- A Design Oriented Approach, Irwin, 1997. J.L.PETERSON and A.SILBERCHATZ, Operating System Concepts, Addison Welsey, 1985. W.STALLINGS, Operating systems, Second Edition, Prentice Hall, 1995.

3

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING GOVERNMENT ENGINEERING COLLEGE, RAIPUR (C.G.)-492010

DATABASE MANAGEMENT SYSTEMS Course Title DATABASE MANAGEMENT SYSTEMS

Course Code CS604

Credits-3C L 3

T 1

Theory Paper (ES) P -

Max. Marks- 100 Min. Marks- 35 Duration-3hrs.

Faculty Member :CS/IT OBJECTIVE : To provide a comprehensive introduction to database systems concepts with special reference to the relational model. 1. Introduction and ER modelling : Databases - Need - Concepts - Architecture - Data independence. Data modeling: Entity-Relationship Model: ER diagram - Aggregation - Weak entity sets. Mapping ER model to other data models. 2. Relational Model : DBTG proposal - logical record types - representing DBTG Networks - example Data manipulation in DBTG Networks - representative DBTG-like commands with examples. Hierarchical Model - Basic schema - virtual records - example - hints for implementation. 3. SQL : Relational Model - concepts - Integrity constraints. Relational Algebra. SQL: queries - data definition & update statements. 4. Realtional Database Design : Views, Embedded SQL. Relational Calculus : Tuple relational calculus, Domain relational calculus, Overview of QUEL and QBE language. Brief overview of system - R. 5. Object Database Design : Database design: Functional dependency - Armstrong's axioms Normalization in detail - Examples. Database security and authorization. TEXT :

1. A.SILBERSCHATZ, H.F.KORTH & S.SUDHARSHAN, Database System Concepts, 3rd edition, McGraw Hill, 1997.

2. R. ELMASRI and S.B. NAVATHE, Fundamentals of Database Systems, Second Edition, the Benjamin / Cummings Publishing Co., 1994. REFERENCES :

1. R.RAMAKRISHNAN,J.GEHRKE, Database Management Systems, 2nd edition, McGraw Hill Intl 2. 3. 4. 5.

edn,2000. J.D.ULLMAN , Principles of Database systems, Galgotia,1985. C.M. RICARDO, Database Systems: Principles, Design and Implementation, Macmillan Publishing Co., Newyork, 1990. E.OZHARAHAN, Database Management Concepts, Design and Practice, Prentice Hall, 1990. C.J. DATE, An Introduction to Database Systems, 3rd Edition, Narosa, 1985.

4

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING GOVERNMENT ENGINEERING COLLEGE, RAIPUR (C.G.)-492010

MICROPROCESSOR ARCHITECTURE Course Title MICROPROCESSOR ARCHITECTURE

Course Code CS605

Credits-3C L 3

T 1

Theory Paper (ES) P -

Max. Marks- 100 Min. Marks- 35 Duration-3hrs.

Pre-Req. : BCS504 MICROPROCESSOR AND INTERFACING TECHNIQUES Faculty Member : CSE Faculty OBJECTIVE :To impart knowledge in architecture memory systems and I/O systems of various microprocessors and study of IBM PC family. 1. Introduction to Microprocessors : 8086/8088 - Internal Architecture, Instruction set, 8086 Assembly language programming techniques - Segmented memory concepts - Memory interfacing [ROM/DRAM], Bus concepts - Bus timings - Memory Read/Write - I/O Read/Write. 2. Microprocessor System Design : System Design using Interrupt Controller, Keyboard, Display interface Controller, Floppy Disk Controller and CRT Controller. 3. Intel 80286 and 80386 processor architecture : 80286 - Internal Architecture - Instruction set Addressing modes - Real mode - Protected mode, Bus Interface - Bus timings - Memory Read/Write - I/O Read/Write, Extended memory concepts. 4. Intel 80486 and Pentium processor architecture : 80386 - Internal Architecture - General purpose registers - Real mode and protected mode operation - Address segmentation segment length, paging, segment registers, flags - Addressing Techniques, Instruction set. Overview of 80486. 5. Internals of PC/XT/AT : Introduction to IBM PC / XT, Introduction to IBM AT - System board layout, expansion slot. Study of PC System layout - System interface to video, floppy, harddisk, Tape drive, Optical disk drives - CD ROM, WORM -ISA - PCI - Micro channel - VME Bus Architecture. TEXT :D.V.HALL , Microprocessor and Interfacing Programming and Hardware, Mc Graw Hill, 1986. 1.

B.B.BREY, The INTEL MICROPROCESSORS, 8086/8088, 80186, 80286, 80386, 80486: Architecture Programming and Interfacing, Third Edition, Prentice Hall of India.

REFERENCE : 1. 2.

C.H. PAPPAS and W.H. MURRAY, 80386 Microprocessor handbook, Mc Graw Hill, 1988. B.GOVINDRAJULU, IBM PC and Clones Hardware, Trouble shooting and Maintenance, TataMcGraw Hill, 1991

5

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING GOVERNMENT ENGINEERING COLLEGE, RAIPUR (C.G.)-492010

COMPUTER NETWORKS Course Title

Course Code

COMPUTER NETWORKS CS606

Credits-3C L 3

T 1

Theory Paper (ES) P -

Max. Marks- 50 Min. Marks- 18 Duration-3hrs.

Pre-Req. : DATA COMMUNICATION Faculty Member : OBJECTIVE : To impart the fundamental principles involved in designing computer networks and to familiarize with recent trends in networks. 1. Introductory Concepts : Goals and Applications of Networks, Network structure and architecture, The OSI reference model, services. Network Topology Design - Delay Analysis, Back Bone Design, Local Access Network Design. Physical Layer - Transmission Media, Switching methods, ISDN, Terminal Handling. 2. Medium access sublayer : Medium Access sublayer - Channel Allocations, LAN protocols - ALOHA protocols - Overview of IEEE standards - FDDI. Data Link Layer - Elementary Data Link Protocols, Sliding Window protocols, Error Handling. 3. Network Layer : Network Layer - Point-to-Point Networks, routing, congestion control Internetworking. 4. Transport Layer : Transport Layer - Design issues, connection management, session Layer - Design issues, remote procedure call. Presentation Layer - Design issues, Data compression techniques, cryptography. 5. Application Layer : Application Layer - File Transfer, Access and Management, Electronic mail, Virtual Terminals, Other applications. Example Networks - Internet and Public Networks. TEXT :

1. A. S. TANENBAUM, Computer Networks, 3rd Edition, Prentice Hall India, 1997. 2.

S.KESHAV , An Engineering Approach on Computer Networking, Addison Welsey, 1997

REFERENCES : 1. 2.

W. STALLINGS, Data and Computer Communication, Macmillan Press, 1989. D. BERTSEKAS and R. GALL, Data Networks, Prentice Hall International, 1989.

6

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING GOVERNMENT ENGINEERING COLLEGE, RAIPUR (C.G.)-492010

OPERATING SYSTEMS LABORATORY Faculty Member : • • •

Exercises involving DOS interrupts, DOS function calls, video interrupts and TSR. Performance measurements of various processor scheduling methods. Process creation, process synchronization, and interprocess communication using Semaphores, pipes and messages in UNIX environment.

DATABASE MANAGEMENT SYSTEMS LABORATORY Faculty Member : • • • • •

Exercises to be based on Sybase/Oracle/Postgres/VB/Power Builder/D2K. Applications involving vendor development systems, stores management system, finance management etc. Creation and querying of database tables. Design of tables by Normalization and Dependency analysis. Writing application softwares with host language interface

7

Related Documents

6th Sem
November 2019 36
Project 6th Sem .docx
November 2019 34
Final 6th Sem
November 2019 27
6th Sem Project Report
June 2020 10
6th Sem Marksheet.pdf
November 2019 27