Computer Science Syllabus For 4th Semester
Computer Science Syllabus For 4th Semester
Computer Science Syllabus For 4th Semester
Syllabus
of
Computer Science & Engineering
2nd Year (IV Sem.)
Industrial Sociology
EHU-402
LTP
200
Unit-I
Industrial Sociology : Nature and Scope of Industrial Sociology-Development of
Industrial Sociology.
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.
Unit-III
Industrialization in India. Industrial Poling Resolutions – 1956.
Unit-IV
Contemporary Issues : Grievances and Grievance handling Procedure.
Industrial Disputes : courses, strikes & lockouts, Industrial Relations Machinery Bi-
partite& Tri-partite Agreement, Labour courts & Industrial Tribunals, Code of
Discipline,Standing order.
References :
1. GISBERT PASCAL, Fundamentals of Industrial sociology, Tata McGraw Hill
Publishing Co., New Delhi, 1972.
2. SCHNEIDER ENGNO V., Industrial Sociology 2nd Edition, McGraw Hill
Publishing Co.,New Delhi, 1979.
3. MAMORIA C.B. And MAMORIA S., Dynamics of Industrial Relations in India.
4. SINHA G.P. and P.R.N. SINHA, Industrial Relations and Labour Legislations, New
Delhi, Oxford and IBH Publishing Co., 1977.
LTP
310
Unit-I
Neural Networks-1
(Introduction & Architecture)
Neuron, Nerve structure and synapse, Artificial Neuron and its model, activation
functions,
Neural network architecture: single layer and multilayer feed forward networks,
recurrent
networks.Various learning techniques; perception and convergence rule,
Auto-associative and hetro-associative memory.
8
Unit-II
Neural Networks-II
(Back propogation networks)
Architecture: perceptron model, solution, single layer artificial neural network,
multilayer
perception model; back propogation learning methods, effect of learning rule co-
efficient ;back
propagation algorithm, factors affecting backpropagation training, applications.
8
Unit-III
Fuzzy Logic-I
(Introduction)
Basic concepts of fuzzy logic, Fuzzy sets and Crisp sets, Fuzzy set theory and
operations,
Properties of fuzzy sets, Fuzzy and Crisp relations, Fuzzy to Crisp conversion.
8
Unit-IV
Fuzzy Logic –II
(Fuzzy Membership, Rules)
Membership functions, interference in fuzzy logic, fuzzy if-then rules, Fuzzy
Unit-V
Genetic Algorithm(GA)
Basic concepts, working principle, procedures of GA, flow chart of GA, Genetic
representations, (encoding) Initialization and selection, Genetic operators, Mutation,
Generational Cycle, applications.
8
Text Books:
1.S. Rajsekaran & G.A. Vijayalakshmi Pai, “Neural Networks,Fuzzy Logic and
Genetic Algorithm:Synthesis and Applications” Prentice Hall of India.
2.N.P.Padhy,”Artificial Intelligence and Intelligent Systems” Oxford University
Press.
Reference Books:
INTRODUCTION TO MICROPROCESSOR
EEC-406
LT P
310
Unit-I Introduction:
Microprocessor evolution and types, microprocessor architecture and operation of its
components, addressing modes, interrupts, data transfer schemes, instruction and data
flow, timer and timing diagram. Interfacing devices. Architectural advancement of
microprocessor. Typical microprocessor development schemes.
(10)
Unit-II *-bit Microprocessors:
Pin diagram and internal architecture of 8085 microprocessor, registers, ALU, Control
& statu, interrupt and machine cycle.Instruction sets. Addressing modes. Instruction
formats,Instruction Classification: data transfer, arithmetic operations, logical
operations,branching operations, machine control and assembler directives.
Unit-IV Programming:
Assembly language programming based on intel 8085/8086. Instructions, data transfer,
arithmetic, logic, branch operations, looping, counting, indexing, programming
techniques, counters and time delays, stacks and subroutines, conditional call and
return instructions
Books
COMPUTER ORGANIZATION
ECS-401
LTP
310
Unit-I Introduction:
Number representation; fixed and floating point number representation, IEEE standard
for floating point representation. Error detection and correction codes: Hamming code.
Digital computer generation, computer types and classifications, functional units and
their interconnections, buses, bus architecture, types of buses and bus arbitration.
Register, bus and memory transfer.
Unit-IV Memory:
Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 1/2D memory
organization. ROM memories. Cache memories: concept and design issues 9
performance, address mapping and replacement) Auxiliary memories: magnetic disk,
magnetic tape and optical disks Virtual memory: concept implementation.
communication interfaces.
Books
LTP
310
Unit-I
Introduction: An overview of database management system, database system Vs file
system, Database system concept and architecture, data model schema and instances,
data independence and database language and interfaces, data definitions language,
DML, Overall Database Structure. Data Modeling using the Entity Relationship Model:
ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of
Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER
diagrams to tables, extended ER model, relationship of higher degree.
Unit-II
Relational data Model and Language: Relational data model concepts, integrity
constraints, entity integrity, referential integrity, Keys constraints, Domain constraints,
relational algebra, relational calculus, tuple and domain calculus.
Introduction on SQL: Characteristics of SQL, advantage of SQL. SQl data type and
literals. Types of SQL commands. SQL operators and their procedure. Tables, views
and indexes. Queries and sub queries. Aggregate functions. Insert, update and delete
operations, Joins, Unions, Intersection, Minus, Cursors, Triggers, Procedures in
SQL/PL SQL.
Unit-III
Data Base Design & Normalization: Functional dependencies, normal forms, first,
second, third normal forms, BCNF, inclusion dependence, loss less join
decompositions, normalization using FD, MVD, and JDs, alternative approaches to
database design.
Unit-IV
Transaction Processing Concept: Transaction system, Testing of serializability,
serializability of schedules, conflict & view serializable schedule, recoverability,
Recovery from transaction failures, log based recovery, checkpoints, deadlock
handling. Distributed Database: distributed data storage, concurrency control, directory
system.
Unit-V
Concurrency Control Techniques: Concurrency control, Locking Techniques for
concurrency control, Time stamping protocols for concurrency control, validation
based protocol, multiple granularity, Multi version schemes, Recovery with concurrent
transaction, case study of Oracle.
Books
Unit – I
Introduction; Alphabets, Strings and Languages; Automata and Grammars,
Deterministic finite Automata (DFA)-Formal Definition, Simplified notation: State
transition graph, Transition table, Language of DFA, Nondeterministic finite Automata
(NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA,
Minimization of Finite Automata, Distinguishing one string from other, Myhill-Nerode
Theorem.
Unit – II
Regular expression (RE) , Definition, Operators of regular expression and there
precedence, Algebraic laws for Regular expressions, Kleen’s Theorem, Regular
expression to FA, DFA to Regular expression, Arden Theorem, Non RegularLanguages,
Pumping Lemma for regular Languages. Application of Pumping Lemma, Closure
properties of Regular Languages, Decision properties of Regular Languages, FA with
output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine,
Applications and Limitation of FA.
Unit – III
Context free grammar (CFG) and Context Freee Languages (CFL): Definition,
Examples, Derivation , Derivation trees, Ambiguity in Grammer, Inherent ambiguity,
Ambiguous to Unambiguous CFG, Useless symbols, Simplification of CFGs, Normal
forms for CFGs: CNF and GNF, Closure properties of CFLs, Decision Properties of
CFLs: Emptiness, Finiteness and Memership, Pumping lemma for CFLs.
Unit – IV
Push Down Automata (PDA): Description and definition, Instantaneous Description,
Language of PDA, Acceptance by Final state, Acceptance by empty stack,
Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG,
Two stack PDA.
Unit – V
Turing machines (TM): Basic model, definition and representation, Instantaneous
MICROPROCESSOR LAB
EEC-456
LTP
002
DBMS LAB
ECS-452
LTP
002
1. Write the queries for Data Definition and Data Manipulation Language.
2. Write SQL queries using logical operations (=,<,>,etc)
3. Write SQL queries using SQL operators
4. Write SQL query using character, number, date and group functions
5. Write SQL queries for relational algebra
6. Write SQL queries for extracting data from more than one table
7. Write SQL queries for sub queries, nested queries
8. Write programme by the use of PL/SQL
9. Concepts for ROLL BACK, COMMIT & CHECK POINTS
10. Create VIEWS, CURSORS and TRGGERS & write ASSERTIONS.
11. Create FORMS and REPORTS.
Note:
1. The queries to be implemented on DBMS using SQL.
2. Students are advised to use Developer 2000/Oracle9i or other latest version for
above experiments.. However student may use Power Builder/SQL SERVER .
Mini Projects may also be planned & carried out through out the semester to
understand important concepts of database.
LTP
002
Note: Institute may also develop the experiment based on the infrastructure available
with them.
Bibliography
1. http://uptu.ac.in/academics/syllabus/uptu_study_scheme_1cs.pdf
2. http://uptu.ac.in/academics/syllabus/compulsory_subject_for_all_btech_courses.p
df
http://ankurgoel.tk/