Computer Science Syllabus For 4th semester | Sql | Relational Model

Computer Science Syllabus (4th Semester

)

1 of 17

G.B. TECHNICAL UNIVERSITY LUCKNOW

Syllabus of Computer Science & Engineering 2nd Year (IV Sem.)

[Effective from Session 2009-10] B.Tech.
Ankur Goel ankurgoel@swiftmail.tk

Computer Science Syllabus (4th Semester) 2 of 17 Ankur Goel ankurgoel@swiftmail.tk .

GISBERT PASCAL.. 2. McGraw Hill Publishing Co. Unit-IV Contemporary Issues : Grievances and Grievance handling Procedure. Tata McGraw Hill Publishing Co.. New Delhi. Ankur Goel ankurgoel@swiftmail.R. SINHA G.P. References : 1.N..B. Dynamics of Industrial Relations in India. MAMORIA C..Computer Science Syllabus (4th Semester) 3 of 17 Industrial Sociology EHU-402 LTP 200 Unit-I Industrial Sociology : Nature and Scope of Industrial Sociology-Development of Industrial Sociology. Unit-III Industrialization in India. Code of Discipline. Unit-II Rise and Development of Industry : Early Industrialism – Types of Productive Systems– The Manorial or Feudal system – The guild system – The domestic or putting-out system – and the factory system – Characteristics of the factory system – causes andConsequences of industrialization. Industrial Disputes : courses. 1977.tk . 3. 1979. And MAMORIA S. Oxford and IBH Publishing Co. and P. 1972. New Delhi. Industrial Sociology 2nd Edition. Industrial Relations and Labour Legislations.New Delhi. SINHA. Labour courts & Industrial Tribunals. strikes & lockouts. Industrial Relations Machinery Bipartite& Tri-partite Agreement. Fundamentals of Industrial sociology.. 4. Industrial Poling Resolutions – 1956. SCHNEIDER ENGNO V.Standing order.

fuzzy if-then rules. Fuzzy set theory and operations. Auto-associative and hetro-associative memory. Neural network architecture: single layer and multilayer feed forward networks. factors affecting backpropagation training. Nerve structure and synapse.Various learning techniques. back propogation learning methods.Computer Science Syllabus (4th Semester) 4 of 17 INTRODUCTION TO SOFT COMPUTING (Neural Networks. Properties of fuzzy sets. solution. applications.back propagation algorithm. recurrent networks. multilayer perception model. 8 Unit-II Neural Networks-II (Back propogation networks) Architecture: perceptron model. single layer artificial neural network. interference in fuzzy logic. Fuzzy and Crisp relations. Fuzzy sets and Crisp sets. 8 Unit-III Fuzzy Logic-I (Introduction) Basic concepts of fuzzy logic. perception and convergence rule. Fuzzy Logic and Genetic Algorithm) EOE-041 LTP 310 Unit-I Neural Networks-1 (Introduction & Architecture) Neuron. Rules) Membership functions. Fuzzy to Crisp conversion. 8 Unit-IV Fuzzy Logic –II (Fuzzy Membership. effect of learning rule coefficient . activation functions. Fuzzy Ankur Goel ankurgoel@swiftmail. Artificial Neuron and its model.tk .

working principle. Rajsekaran & G. Fuzzyfications & Defuzzificataions. Fuzzy Controller. “Fuzzy Logic with Engineering Applications” Wiley India. 2.S.Siman Haykin. flow chart of GA.tk .Computer Science Syllabus (4th Semester) 5 of 17 implications and Fuzzy algorithms. “Neural Networks” Tata Mc Graw Hill.Timothy J.A.P. 2.”Artificial Intelligence and Intelligent Systems” Oxford University Press. 3. 8 Text Books: 1. Industrial applications. Generational Cycle. procedures of GA. Genetic operators. Mutation.Fuzzy Logic and Genetic Algorithm:Synthesis and Applications” Prentice Hall of India.Padhy.”Neural Netowrks”Prentice Hall of India. Vijayalakshmi Pai. Kumar Satish. (encoding) Initialization and selection. Reference Books: 1. Ankur Goel ankurgoel@swiftmail.N. “Neural Networks. Unit-V Genetic Algorithm(GA) Basic concepts. Ross. applications. Genetic representations.

Operating modes. Instruction formats. Unit-III 16-bit Microprocessor: Architecture of 8086 microprocessor: register organization. Interfacing devices.Computer Science Syllabus (4th Semester) 6 of 17 INTRODUCTION TO MICROPROCESSOR EEC-406 LT P 310 Unit-I Introduction: Microprocessor evolution and types. programming techniques. conditional call and return instructions Unit-V Peripheral Interfacing: Peripheral Devices: 8237 DMA Controller. data transfer. memory addressing. Types of instructions.Instruction sets. stacks and subroutines. looping. Architectural advancement of microprocessor. arithmetic operations. Instructions. logical operations. Control & statu. (10) Unit-II *-bit Microprocessors: Pin diagram and internal architecture of 8085 microprocessor. bus interface unit. machine control and assembler directives. instruction format. branch operations. interrupts. Ankur Goel ankurgoel@swiftmail. logic. interrupt and machine cycle. 8255 programmable peripheral interface. memory segmentation. Instruction sets. Interrupts: hardware and software interrupts. timer and timing diagram.tk . microprocessor architecture and operation of its components. Typical microprocessor development schemes. addressing modes. execution unit. ALU. data transfer schemes. instruction and data flow. 8253/8254programmable timer/counter. counting. registers. indexing. 8251 USART and RS232C. arithmetic.Instruction Classification: data transfer.branching operations. Unit-IV Programming: Assembly language programming based on intel 8085/8086. counters and time delays. 8259 programmable interrupt controller. Addressing modes.

tk . “Microprocessors.PHI 5. Ray A K . Bhurchandi K M . Hall D V . TMH 6. “ Microcomputer System: The 8086/8088 family’’ . Brey.”Microprocessor Interfacing’. Programming and Applications with 8085”. “Microprocessor Architecture. Interfacing and Applications 8. TMH 3. “Microprocessor.Sigh.P. PHI 7. M Rafiqzzaman. Ankur Goel ankurgoel@swiftmail. “ Introduction to Microprocessor”. Penram International Publishing. 2. Ramesh S . Theory and Applications”. Barry B. Gaonkar .Computer Science Syllabus (4th Semester) 7 of 17 Books 1. Aditya P Mathur. “INTEL Microprocessors”. Renu Sigh & B. Liu and Gibson G A . TMH 4. “Advanced Microprocessors and Peripherals”.

general register organization. types of interrupts and exceptions. formats. concept of horizontal and vertical microprogramming. instruction cycles and subcycles ( fetch and execute etc) . ROM memories.Computer Science Syllabus (4th Semester) 8 of 17 COMPUTER ORGANIZATION ECS-401 LTP 310 Unit-I Introduction: Number representation. Multiplication: Signed operand multiplication. functional units and their interconnections. magnetic tape and optical disks Virtual memory: concept implementation. computer types and classifications. I/O interface.. Booths algorithm and array multiplier. address mapping and replacement) Auxiliary memories: magnetic disk. Register. Cache memories: concept and design issues 9 performance. interrupt initiated I/O and Direct Memory Access. bus and memory transfer. Error detection and correction codes: Hamming code. stack organization and addressing modes. look ahead carry adders. Unit-II Central Processing Unit: Addition and subtraction of signed numbers.tk . microinstruction with next address field. Floating point arithmetic operation Processor organization. buses. standard Ankur Goel ankurgoel@swiftmail. I/O ports. IEEE standard for floating point representation. micro-operations. types of buses and bus arbitration. Unit-IV Memory: Basic concept and hierarchy. Interrupts: interrupt hardware. Modes of Data Transfer: Programmed I/O. Unit-III Control Unit: Instruction types. wide branchaddressing. Serial Communication: Synchronous & asynchronous communication. execution of a complete instruction. Division and logic operations. I/O channels and processors. 2D & 2 1/2D memory organization. semiconductor RAM memories. Hardwire and microprogrammed control: microprogramme sequencing. Unit-V Input / Output: Peripheral devices. fixed and floating point number representation. Digital computer generation. pre-fetching microinstructions. bus architecture.

Mano. McGraw Hill 6.tk . Books 1. PHI Ankur Goel ankurgoel@swiftmail. PHI 7. Elsevier Pub. Tannenbaum. PHI 5. William Stalling. “ Computer Organization”. 2009 2.” Computer System Architecture”.Computer Science Syllabus (4th Semester) 9 of 17 communication interfaces. ‘ Computer Organization & Design’. TMH 4. Computer Organisation and Design. Vravice. John P Hays. Patterson. PHI 3.Hamacher & Zaky. “ Computer Organization”. “Computer Organization”. P Pal chaudhry.” Structured Computer Organization’.

Generalization. directory system. primary key. Unions. extended ER model. checkpoints. candidate key. SQL operators and their procedure. Domain constraints. Cursors. recoverability. mapping constraints. Insert. update and delete operations. Triggers. data definitions language. Minus. Tables. normalization using FD. Overall Database Structure. Database system concept and architecture. integrity constraints. Joins. referential integrity. Ankur Goel ankurgoel@swiftmail. deadlock handling. serializability of schedules. Unit-II Relational data Model and Language: Relational data model concepts. Procedures in SQL/PL SQL. alternative approaches to database design. aggregation. Introduction on SQL: Characteristics of SQL. relational calculus. views and indexes.Computer Science Syllabus (4th Semester) 10 of 17 DATA BASE MANAGEMENT SYSTEM ECS-402 LTP 310 Unit-I Introduction: An overview of database management system. Queries and sub queries. normal forms. reduction of an ER diagrams to tables. notation for ER diagram. Distributed Database: distributed data storage. tuple and domain calculus. advantage of SQL. data model schema and instances. relationship of higher degree. first. Unit-IV Transaction Processing Concept: Transaction system. Concepts of Super Key. loss less join decompositions. relational algebra. log based recovery. second. Types of SQL commands. Recovery from transaction failures. Intersection.tk . Data Modeling using the Entity Relationship Model: ER model concepts. Aggregate functions. data independence and database language and interfaces. database system Vs file system. concurrency control. BCNF. keys. Testing of serializability. entity integrity. Keys constraints. conflict & view serializable schedule. DML. and JDs. third normal forms. Unit-III Data Base Design & Normalization: Functional dependencies. inclusion dependence. SQl data type and literals. MVD.

Navathe.tk .Ulman.Computer Science Syllabus (4th Semester) 11 of 17 Unit-V Concurrency Control Techniques: Concurrency control. Korth. New Delhi Ankur Goel ankurgoel@swiftmail. Multi version schemes. D. Sudarshan. “ Fudamentals of Database Systems”. Design and Implementation” Pearson Education. Elmasri. Ramkrishnan. Books 1. Databases. multiple granularity. “ An Introduction to Database Systems”. Majumdar & Bhattacharya.” Database Concepts”. McGraw Hill 9. validation based protocol.’DBMS: Complete Practical Approach”. Elsevier Pub. “ Principles of Database and Knowledge base System”. Kroenke. TMH 8. Silbertz. 11. 5. “ An Introduction to Database Systems”. McGraw Hill 3. Locking Techniques for concurrency control. Addision Wesley 2. Leon & Leon. Gehrke. Addision Wesley 4. Desai. Vikas Publishing House 6. Gagotia Publications 7. Recovery with concurrent transaction. “ Database Management System”.”Database Management Systems”. O’Neil. 10. Date C J. Maheshwari Jain. “Database Management System”. Time stamping protocols for concurrency control. Firewall Media. “ Database Processing Fundamentals . Computer Science Press. Bipin C. case study of Oracle.

Deterministic finite Automata (DFA)-Formal Definition. Applications and Limitation of FA. Instantaneous Description. Language of DFA. Equivalence of Moore and Mealy Machine. Closure properties of CFLs. Kleen’s Theorem. Instantaneous Ankur Goel ankurgoel@swiftmail. Unit – V Turing machines (TM): Basic model. Language of PDA. Finiteness and Memership. Simplification of CFGs. CFG to PDA and PDA to CFG. Normal forms for CFGs: CNF and GNF. FA with output: Moore and Mealy machine. definition and representation. Two stack PDA. Simplified notation: State transition graph. Closure properties of Regular Languages. Inherent ambiguity. Distinguishing one string from other. Deterministic PDA. Derivation . Application of Pumping Lemma. Ambiguity in Grammer. Unit – IV Push Down Automata (PDA): Description and definition. Strings and Languages. Decision Properties of CFLs: Emptiness. Examples. Alphabets. Pumping Lemma for regular Languages. Acceptance by Final state. Unit – II Regular expression (RE) . Non RegularLanguages. Ambiguous to Unambiguous CFG. Language of NFA. Minimization of Finite Automata. Decision properties of Regular Languages. Derivation trees. Acceptance by empty stack. Useless symbols. Automata and Grammars. Operators of regular expression and there precedence. Arden Theorem. Unit – III Context free grammar (CFG) and Context Freee Languages (CFL): Definition. Equivalence of NFA and DFA.Computer Science Syllabus (4th Semester) 12 of 17 THEORY OF AUTOMATA AND FORMAL LANGUAGES ECS-403 LTP 310 Unit – I Introduction.tk . Regular expression to FA. Transition table. Nondeterministic finite Automata (NFA). Myhill-Nerode Theorem. Algebraic laws for Regular expressions. Equivalence of PDA and CFG. Pumping lemma for CFLs. DFA to Regular expression. NFA with epsilon transition. Definition.

“Elements of the Theory of Computation”. TMH 4. “Introduction to Languages and Theory of Computations”. Text Books and References: 1. and Languages ”. C. Language acceptance by TM.. Undecidable problems about TMs. Universal TM. Halting problem.L. 2. “Theory of Computer Science : Automata. and Lewis. C. Martin J. Ullman. Pearson Education. 3. PHI. Modified PCP. Papadimitrou. C..P. Introduction to Undecidability. Variants of Turing Machine. Recursive and recursively enumerable languages. Languages and Computation”. Church’s Thesis.Chandrasekaran. PHI Ankur Goel ankurgoel@swiftmail.tk . TM as Computer of Integer functions. Introduction to recursive function theory. Post correspondence problem (PCP).L. Hopcroft. “Introduction Computation to Automata Theory. Mishra and N. K.Computer Science Syllabus (4th Semester) 13 of 17 Description.

To develop and run a programme to compute square root of a given number.tk . To perform interfacing of UART/USART. 4. 8. To develop and run a programme for computing ascending/descending order of a number. 10. 5. To develop and run a programme to find out largest and smallest number. 2. To perform interfacing of DMA controller. To develop and run a programme for converting temperature from F to C degree. 9. 6. 7. 3. Ankur Goel ankurgoel@swiftmail. To study 8086 microprocessor System.Computer Science Syllabus (4th Semester) 14 of 17 MICROPROCESSOR LAB EEC-456 LTP 002 1.To study 8085 microprocessor System. To perform interfacing of keyboard controller. To perform interfacing of RAM chip to 8085/8086.

11. date and group functions 5. nested queries 8. 2. Write SQL queries for relational algebra 6. Mini Projects may also be planned & carried out through out the semester to understand important concepts of database.<. Ankur Goel ankurgoel@swiftmail.etc) 3. Create VIEWS. Write SQL queries using logical operations (=. Write SQL queries for sub queries. CURSORS and TRGGERS & write ASSERTIONS. Write programme by the use of PL/SQL 9. However student may use Power Builder/SQL SERVER . Create FORMS and REPORTS.tk . number. Write SQL queries using SQL operators 4. Write the queries for Data Definition and Data Manipulation Language.>. Concepts for ROLL BACK. Students are advised to use Developer 2000/Oracle9i or other latest version for above experiments. 2. Write SQL query using character.Computer Science Syllabus (4th Semester) 15 of 17 DBMS LAB ECS-452 LTP 002 1. The queries to be implemented on DBMS using SQL. COMMIT & CHECK POINTS 10. Write SQL queries for extracting data from more than one table 7.. Note: 1.

5. Bread Board implementation of counters & shift registers. Bread Board implementation of Adder/Subtractor (Half. Bread Board implementation of Seven Segment Display.Bread Board Implementation of Flip-Flops. Full) 7.tk . Note: Institute may also develop the experiment based on the infrastructure available with them. Ankur Goel ankurgoel@swiftmail. Design of Counters. 4. Experiments with clocked Flip-Flop. 2.Computer Science Syllabus (4th Semester) 16 of 17 COMPUTER ORGANIZATION LAB ECS-453 LTP 002 1. 8. 6. 3. Bread Board implementation of Binary Adder. Implementation of Arithmetic algorithms.

in/academics/syllabus/compulsory_subject_for_all_btech_courses.Computer Science Syllabus (4th Semester) 17 of 17 Bibliography 1.in/academics/syllabus/uptu_study_scheme_1cs.p df For any other acknowledgment you can contact me at my email.ac.pdf 2.tk . ankurgoel@swiftmail.tk/ Ankur Goel ankurgoel@swiftmail.ac. http://uptu. http://uptu.tk http://ankurgoel.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.