JAWAHARLAL NEHRU TECHNOLOGICAL
UNIVERSITY: KAKINADA
COMPUTER SCIENCE AND ENGINEERING
COURSE
STRUCTURE
III YEAR I SEMISTER
S. No.
|
Subject
|
T
|
P
|
CREDITS
|
1
|
Compiler Design
|
4
|
-
|
4
|
2
|
Computer Networks
|
4
|
-
|
4
|
3
|
Micro Processors
and Multicore Systems
|
4
|
-
|
4
|
4
|
Operating Systems
|
4
|
-
|
4
|
5
|
Computer Graphics
|
4
|
-
|
4
|
6
|
Advanced Data
Structures
|
4
|
-
|
4
|
7
|
Operating System
& Compiler Design Lab
|
-
|
3
|
2
|
8
|
Advanced Data
Structures Lab
|
-
|
3
|
2
|
9
|
IPR and Patents- 1
|
2
|
-
|
-
|
TOTAL
|
28
|
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B.
Tech. Computer Science and Engineering – I Sem.
COMPILER
DESIGN
Linkers&
loaders -s Structure of a compiler –
phases of a compiler.
Unit – II:Lexical
Analysis – Role of Lexical Analysis – Lexical Analysis Vs. Parsing – Token,
patterns and
Lexemes –
Lexical Errors – Regular Expressions – Regular definitions for the language
Constructs
– Strings, Sequences, Comments – Transition diagram for recognition of tokens,
Reserved
words and identifiers, Examples.
Unit
– III:Syntax Analysis – Role of a parser –
classification of parsing techniques – Top, down parsing
– First and Follow- LL (1) Grammars,
Non-Recursive predictive parsing – Error recovery in Predictive
Parsing.
Unit
– IV:Introduction to simple LR – Why LR Parsers –
Model of an LR Parsers – Operator
Precedence-
Shift Reduce Parsing – Difference between LR and LL Parsers, Construction of SLR
Tables.
Unit
– V:More powerful LR parses, construction of CLR
(1), LALR Parsing tables, Dangling ELSE Ambiguity, Error
Recovery
in LR Parsing.
Unit
– VI:Semantic analysis, SDT, evaluation of semantic
rules, symbol tables, use of symbol tables. Runtime
Environment:
storage organization, stack allocation, access to non-local data, heap
management,
Parameter
passing mechanisms.
Unit
– VII: Intermediate code,
three address code, quadruples, triples, abstract syntax trees, basic blocks,
CFG.
Machine
independent code optimization - Common sub expression lamination, constant
folding, copy
Propagation,
dead code elimination, strength reduction, loop optimization, procedure in
lining.
Unit
– VIII:Machine dependent code optimization: Peephole
optimization, register allocation, instruction
scheduling,
inter procedural optimization, garbage collection via reference counting.
Text books:
1.
Compilers, Principles Techniques and Tools- Alfred V Aho, Monical S Lam, Ravi
Sethi, Jeffrey
D.
Ullman,2nded, Pearson,2007.
2.
Principles of compiler design, V. Raghavan, 2nd ed, TMH, 2011.
3.
Principles of compiler design, 2nd ed, Nandini Prasad, Elsevier
Reference books:
1.
http://www.nptel.iitm.ac.in/downloads/106108052/
2. Compiler construction,
Principles and Practice, Kenneth C Louden, CENGAGE
3. Implementations of
Compiler, A new approach to Compilers including the algebraic methods,
Yunlinsu,
SPRINGER
JAWAHARLAL
NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III
Year B. Tech. Computer Science and Engineering – I Sem.
COMPUTER
NETWORKS
Unit
- I: Introduction: Data Communication, components, data
representation, data flow;
Networks: distributed
processing, network criteria, physical structures, network models, categories
of network,
Inter
connection of networks;
The
Internet: brief
history, internet today,
Protocols
&standard layers: protocols, standards, standard organization,
internet stand
Layered
Tasks: sender,
receiver, carrier, hierarchy.
The OSI models: layered
architecture, peer to peer process, encapsulation
Layers
in OSI model: physical layer, data link layer, Network
layer, transport layer, session layer,presentationlayer , application layer
TCP/IP
protocol suite:
physical and data link layers, network layer, transport layer, application
layer
Addressing: physical
address, logical address, port address, specific address
Unit-II:Physical layer
and overview of PL Switching: Multiplexing: frequency division
multiplexing, wave
length division multiplexing,
synchronous time division multiplexing, statistical time division, multiplexing
Introduction to
switching:
Circuit Switched Networks, Datagram Networks, Virtual Circuit Networks.
Unit
-III:Framing: fixed size
framing, variable size framing, , Flow control, Error control
Error
detections Error correction: block coding, linear block codes,
Cyclic
codes:
cyclic redundancy check, hard ware implementation, polynomials, cyclic code
analysis, advantages
Checksum: idea, one’s
complement internet check sum, services provided to Network Layer
Elementary Data link Layer
protocols:
Unrestricted Simplex protocol, Simplex Stop-and-Wait
Protocol,
Simplex protocol for Noisy Channel.
Unit-IV:Sliding Window
Protocol:One bit, Go back N, Selective Repeat-Stop and
wait protocol , data link layer
HDLC: configuration
and transfer modes, frames, control field
Point
to point protocol( PPP): framing, transition phase, multi plexing, multilink
PPP.
Unit
-V:
Random Access:
ALOHA, career sense multiple access (CSMA), career sense multiple access with
collision
detection,
career sense multiple access with collision avoidance
Controlled Access: Reservation,
Polling, Token Passing
Channelization: frequency
division multiple access (FDMA), time division multiple access (TDMA), code division
Multipleaccess(CDMA)
Unit-VI: IEEE
Standards: data link layer, physical layer, Manchester encoding,
StandardEthernet: MA C Sub Layer, physical
layer,
Fast Ethernet: MAC Sub Layer, physical layer,
IEE-802.11: Architecture, MAC sub layer, addressing mechanism,
frame structure.
Unit -VII: Blue tooth : Architecture, blue tooth
layers, Protocol stack, Frame structure ,
CellarTelephony-frequency
reuse Transmitting, receiving, roaming,
Satellite Networks –GEO,LEO,MEO satellite.
Unit-VIII: Data Link Layer Switching-Bridges,
Local internet working Spanning tree bridges,remote bridges,
switch
virtual LANs.
Text Books:
1) Data communications and networking 4th edtionBehrouz A Fourzan,
TMH
2) Computer networks 4th editon Andrew S Tanenbaum, Pearson
3) Computer networks, Mayank Dave, CENGAGE
Reference Books:
1) http://nptel.iitm.ac.in/courses/Webcoursecontents/IIT%20Kharagpur/Computer%20networks/New_index1.html
2) Computer networks, A system Approach, 5th ed, Larry L Peterson
and Bruce S Davie, Elsevier
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Computer Science and Engineering –
I Sem.
MICROPROCESSORS AND MULTICORE SYSTEMS
UNIT I: overview of microcomputer structure and operation., execution of a
three instruction
program, microprocessor
evolution and types, the 8086 microprocessor family , 8086 internal
architecture ,
introduction to programming the 8086.
8086 family assembly language programming:
Program development steps , constructing
Themachine
codes for 8086instructions, writing programs for use with an assembler,
assembly
language programdevelopment tools
.
UNIT II: Implementing standard program structures in 8086 assembly
language: Simple
Sequence programs, jumps, flags
and conditional jumps, if-then, if-then-else and multiple if-
Then-else programs,
while-do programs, repeat-until programs, instruction timing and delay
Loops.
UNIT III: Strings, procedures and macros: The 8086
string instructions, writing and using
procedures,writing and
using assemblermacros.
UNIT IV: 8086 instruction descriptions and assembler directives:
Instruction descriptions assembler
directives , DB, DD, DQ,
DT, DW, end-program, endp, ends, equ ,even-align on even memory
address,extrn , global,
public / extrn, group, include,label, length- not implemented IBM ASM,
name – offset,ORG, proc,
ptr, segment, short,type.
UNIT V: 8086: 8086 interrupts and interrupt applications:8086
interrupts and interrupt responses,
hardware interrupt
applications, Software Interrupts,
priority of interrupts, software interrupt
applications, programming.
UNIT VI: 8086 ASSEMBLY LANGUAGE PROGRAMMES - Bit &
Logic operations, strings,procedures,
Macros, Number Format,
Conversions, ASCII operations, signed NumbersArithmetic,
Programming using High level
language constructs.
UNIT VII: CPU: architecture of Intel 80286 CPU, Intel
80386, and 32-bit CPU- 80486-Microprocessor(
No instruction set).
UNIT VIII: Introduction
to Pentium Processor architecture, dual Core and Core Duo –Basic
Text Books:
1. Microprocessors and Interfacing,
Douglas V Hall, Revised 2nd ed, TMH
2. The X86 Microprocessors,
architecture, Programming and Interfacing(8086 to Pentium), Lyla
BDas, PEA
3. The 8086 Microprocessor:
Programming & Interfacing the PC, Ayala: Cengage
Reference Books:
1.
Microcomputer Systems: The 8086.8088 Family, Architecture, Programming
and Design, Yu-Cheng Liu, Glenn A Gibson, 2nd ed,
2. The 8086 Microprocessor: Programming
& Interfacing the PC, Kenneth J Ayala, CENGAGE
3. Microprocessors, The
8086/8088, 80186/80286, 80386/80486 and the Pentium Family, Nilesh
B Bahadure, PHI
4.
Microprocessors and Microcontrollers, Senthil Kumar, Saravanan,
Jeevanathan, OXFORD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Computer Science and Engineering –
I Sem.
UNIT I: Computer
System and Operating System Overview: Overview of computer operating
Systems,operating systems
functions, protection and security, distributed systems,
Special purpose systems,
operating systems structures and systems calls, operating systems
Generation.
UNIT II: Process
Management – Process concept- process scheduling, operations, Interprocess
Communication. Multi Thread
programming models. Process scheduling criteria and
Algorithms and their
evaluation.
UNIT III:Concurrency:Process
synchronization, the critical- section problem, Peterson’sSolution,
Synchronization Hardware,
semaphores, classic problems of synchronization,
Monitors, Synchronization
examples
UNIT IV: Memory Management:Swapping,
contiguous memory allocation, paging, structureof the
Pagetable, segmentation
UNIT V: Virtual Memory
Management: virtualmemory,demand paging, page-Replacement, algorithms,
Allocation of Frames,
Thrashing
UNIT VI: Principles of
deadlock – system model, deadlock characterization, deadlockprevention,
Detection and avoidance,
recovery form deadlock.
UNIT VII: File system
Interface- the concept of a file, Access Methods, Directory structure, File
system
Mounting, file sharing,
protection.
File
System implementation- File system structure, file system
implementation, directory
Implementation,
allocation methods, free-space management
UNIT VIII:
Mass-storage structure overview of Mass-storage structure, Disk
structure, disk Attachment,
disk scheduling,
swap-space management
TEXT BOOKS:
1. Operating System Concepts-
Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th
Edition, John Wiley.
2. Operating Systems’ – Internal
and Design Principles Stallings, Sixth Edition–2005,
Pearsoneducation
REFERENCES:
1. Operating systems- A Concept
based Approach-D.M.Dhamdhere, 2nd Edition, TMH
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Computer Science and Engineering –
I Sem.
COMPUTER GRAPHICS
UNIT I: Introduction: Application
of Computer Graphics, raster scan systems, random scan systems,
Raster scan display processors.
Output
primitives: Points and lines, line drawing algorithms( Bresenham’s and DDA
Line
Derivations and algorithms),
mid-point circle and ellipse algorithms.
UNIT II: Filled area
primitives: Scan line polygon fill algorithm, boundary-fill and flood-fill
algorithms. Inside and outside
tests.
UNIT III: 2-D geometrical transforms:Translation,scaling,
rotation, reflection and shear transformations, matrix representations and homogeneous
coordinates, composite transforms ,transformations Between coordinate systems.
(p.nos 204-227 of text book-1).
UNIT IV : 2-D viewing : The
viewing pipeline, viewing coordinate reference frame, window toview-port
coordinate transformation,
viewing functions, Cohen-Sutherland and Cyrus-beck line
Clipping algorithms,
Sutherland –Hodgeman polygon clipping algorithm.
UNIT V : 3-D object representation : Polygon
surfaces, quadric surfaces, splinerepresentation,Hermite
curve, Bezier curve and B-Spline curves, Bezier and B-Splinesurfaces.
UNIT VI : 3-D Geometric
transformations : Translation, rotation, scaling, reflection and shear
Transformations, composite
transformations. 3D Viewing pipeline, clipping, projections( Parallel and Perspective).
UNIT VII : Visible
surface detection methods: Classification, back-face detection, depth
buffer,
scan-line, depth sorting,
BSPtree methods, area sub-division and octree methods.
UNIT VIII : Computer
animation:Design of animation sequence, general computeranimation functions,
raster animation, computer
animation languages, key frame systems,motion specifications.
TEXT BOOKS:
1. Computer Graphics C version, Donald Hearn, M.Pauline Baker, Pearson
2. Computer Graphics with
Virtual Reality Systems, Rajesh K Maurya, Wiley
3. Introduction to Computer
Graphics, Using Java 2D and 3D, Frank Klawonn, Springer
4. Computer Graphics,
Steven Harrington, TMH
5. Computer Graphics,
Amarendra N Sinha, Arun Udai, TMH
REFERENCE BOOKS:
1. Computer Graphics
Principles & practice, 2/e, Foley, VanDam, Feiner, Hughes, Pearson
2. Computer Graphics, Peter,
Shirley, CENGAGE
3. Principles of Interactive
Computer Graphics, Neuman , Sproul, TMH.
4. The Computer Graphics
manual, Vol 2, David, Soloman, Springer
III Year B. Tech. Computer Science and Engineering –
I Sem.
ADVANCED DATA STRUCTURES
(Note: C++ and Java implementation is not included in the
syllabus)
Unit I:Dictionaries:Sets, Dictionaries, Hash Tables,
Open Hashing, Closed Hashing(Rehashing
Methods), Hashing
Functions( Division Method, Multiplication Method, Universal Hashing),
Analysis of Closed Hashing
Result (Unsuccessful Search, Insertion, SuccessfulSearch,
Deletion),
Hash Table Restructuring, Skip Lists, Analysis of Skip Lists. (Reference 1)
Unit II: Balanced Trees :AVL Trees: Maximum Height of an
AVL Tree, Insertions andDeletions.
2-3Trees: Insertion,
Deletion.
Unit III: Priority Queues:Binary Heaps : Implementation of
Insert and Delete min, Creating Heap.
Binomial Queues:
Binomial Queue Operations, Binomial Amortized Analysis, Lazy Binomial
Queues
Unit IV:Graphs:Operations on Graphs: Vertex
insertion, vertex deletion, find vertex, edgeaddition,
Edge deletion, Graph
Traversals- Depth First Search and Breadth First Search(Nonrecursive)
Graph storage
Representation- Adjacency matrix, adjacency lists.
Unit V: Graph algorithms :Minimum-Cost Spanning Trees-
Prim's Algorithm, Kruskal'sAlgorithm
Shortest Path Algorithms:
Dijkstra's Algorithm, All Pairs Shortest Paths Problem:Floyd's
Algorithm,
Warshall's Algorithm,
Unit VI: Sorting Methods:Order Statistics: Lower Bound on
Complexity for SortingMethods: Lower
Bound on
Worst Case Complexity, Lower Bound on Average Case Complexity, Heap Sort,
Quick
Sort, Radix Sorting, Merge Sort.
Unit VII: Pattern matching and Tries :Pattern
matching algorithms- the Boyer –Moorealgorithm,
the Knuth-Morris-Pratt
algorithm
Tries: Definitions and concepts of digital search tree, Binary trie,
Patricia , Multi-way trie
Unit VIII : File Structures: Fundamental File
Processing Operations-opening files, closingfiles,
Reading
and Writing file contents, Special characters in files.
Fundamental File Structure
Concepts- Field and record organization, Managing fixed-length,
fixed-field buffers.
Text Books :
1. Data Structures, A
Pseudocode Approach,RichardFGilberg,BehrouzAForouzan,Cengage.
2. Fundamentals of DATA
STRUCTURES in C: 2nd ed, , Horowitz , Sahani,
Anderson-freed,
Universities Press
3. Data structures and
Algorithm Analysis in C, 2nd edition, Mark Allen Weiss, Pearson
Reference Books:
1. File Structures :An
Object oriented approach with C++, 3rd ed, Michel J Folk,
GregRiccardi,Bill Zoellick
2. C and Data Structures:
A Snap Shot oriented Treatise with Live examples
from Science and
Engineering, NB Venkateswarlu & EV Prasad, S Chand, 2010.
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B. Tech. Computer Science and Engineering –
I Sem.
OPERATING SYSTEM & COMPILER DESIGN LAB
PART – A:
1. Design a Lexical
analyzer for the given language. The lexical analyzer should ignore
redundant spaces, tabs and newlines. It should also ignore
comments. Although the
syntax specification states that identifiers can be arbitrarily
long, you may restrict the
length to some reasonable value.
2. Implement the lexical
analyzer using JLex, flex or lex or other lexical analyzer
generating tools.
3. Design Predictive
parser for the given language
4. Design LALR bottom up
parser for the given language.
5. Convert the BNF rules into
Yacc form and write code to generate abstract syntax tree.
PART- B:
1. Simulate the following
CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
2. Simulate all file
allocation strategies
a) Sequential b) Indexed c)
Linked
3. Simulate MVT and MFT
4. Simulate all File
Organization Techniques
a) Single level directory b) Two
level c)
Hierarchical d) DAG
5. Simulate Bankers
Algorithm for Dead Lock Avoidance
6. Simulate Bankers
Algorithm for Dead Lock Prevention
7. Simulate all page
replacement algorithms
8. Simulate Paging
Technique of memory management.
JAWAHARLAL
NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III
Year B. Tech. Computer Science and Engineering – I Sem.
ADVANCED
DATA STRUCTURES Lab
1. To implement functions of
Dictionary using Hashing (division method, Multiplication
method, Universal hashing)
2. To perform various operations i.e,
insertions and deletions on AVL trees
3. To perform various operations i.e.,
insertions and deletions on 2-3 trees.
4. To implement operations on binary
heap.
5. To implement operations on graphs
i) vertex insertionii) Vertex
deletioniii) finding vertexiv)Edge addition and deletion
6. . To implement Depth First Search
for a graph nonrecursively
.
7. To implement Breadth First Search
for a graph nonrecursively.
8. To implement Prim’s algorithm to
generate a min-cost spanning tree.
9. To implement Kruskal’s algorithm to
generate a min-cost spanning tree.
11. To implement pattern matching
using Boyer-Moore algorithm.
12. To implement Knuth-Morris-Pratt algorithm for pattern
matching
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
III Year B.Tech - I-Sem.
INTELLECTUAL PROPERTY RIGHTS AND PATENTS – I
UNIT
I
Introduction to Intellectual
Property Law – The Evolutionary Past - The IPR Tool Kit- Para -Legal Tasks in
Intellectual Property Law – Ethical
obligations in Para Legal Tasks in Intellectual Property Law - Introduction to
Cyber Law – Innovations and Inventions Trade related Intellectual Property
Right
UNIT
II
Introduction to Trade mark –
Trade mark Registration Process – Post registration
Procedures – Trade mark maintenance - Transfer of Rights - Inter partes
Proceeding – Infringement - Dilution Ownership of Trade mark – Likelihood of
confusion - Trademarks claims – Trademarks Litigations – International Trade
mark Law
UNIT III
Introduction to Copyrights –
– Principles of Copyright Principles -The subjects Matter of Copy right – The
Rights Afforded by Copyright Law – Copy
right Ownership, Transfer and duration – Right to prepare Derivative works –
Rights of Distribution – Rights of Perform the work Publicity Copyright
Formalities and Registrations - Limitions - Copyright disputes and
International Copyright Law – Semiconductor Chip Protection Act
UNIT IV
Introduction to Trade Secret
– Maintaining Trade Secret – Physical Secrurity – Employee Limitation -
Employee confidentiality agreement - Trade Secret Law - Unfair Competation –
Trade Secret Letigation – Breach of
Contract – Applying State Law
BOOKS:
1.
Debirag
E.Bouchoux: “Intellectual Property”.
Cengage learning , New Delhi
2.
M.Ashok Kumar
and Mohd.Iqbal Ali: “Intellectual Property Right” Serials Pub.
3.
Cyber Law. Texts
& Cases, South-Western’s Special Topics Collections
4.
Prabhuddha
Ganguli: ‘ Intellectual Property Rights” Tata Mc-Graw –Hill, New Delhi
***
its my syllabus
ReplyDelete