I want to get the syllabus of CS third year of the UPTU and also its contact details?

Hello friend as you want the Uttar Pradesh Technical University (UPTU) 3rd Year Syllabus of Computer Science so here I am providing you the same…….

COMPUTER GRAPHICS (TCS-501)
Unit-I
Line generation: Points lines, Planes, Pixels and Frame buffers, vector and character generation.
Graphics Primitives: Display devices, Primitive devices, Display File Structure, Display control
text.

Unit-II
Polygon: Polygon Representation, Entering polygons, Filling polygons. Segments: Segments
table, creating deleting and renaming segments, visibility, image transformations.

Unit-III
Transformations: Matrices transformation, transformation routines, displays procedure.
Windowing and Clipping: Viewing transformation and clipping, generalize clipping, multiple
windowing.

Unit-IV
Three Dimension: 3-D geometry primitives, transformations, projection clipping. Interaction:
Hardware input devices handling algorithms, Event handling echoing, Interactive techniques.

Unit-V
Hidden Line and Surface: Back face removal algorithms, hidden line methods. Rendering and
Illumination: Introduction to curve generation, Bezier, Hermite and B-spline algorithms and their
comparisons.

References :
1. Rogers, "Procedural Elements of Computer Graphics", McGraw Hill
2. Asthana, Sinha, "Computer Graphics", Addison Wesley Newman and Sproul, "Principle
of Interactive Computer Graphics", McGraw Hill
3. Steven Harrington, "Computer Graphics", A Programming Approach, 2nd Edition
4. Rogar and Adams, "Mathematical Elements of Computer Graphics", McGraw Hill.

COMPILER DESIGN (TCS-502)
Unit-I
Introduction to Compiler, Phases and passes, Bootstrapping, Finite state machines and regular
expressions and their applications to lexical analysis, Implementation of lexical analyzers,
lexical-analyzer generator, LEX-compiler, Formal grammars and their application to syntax
analysis, BNF notation, ambiguity, YACC. The syntactic specification of programming
languages: Context free grammars, derivation and parse trees, capabilities of CFG.

Unit-II
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top down
parsing, predictive parsers Automatic Construction of efficient Parsers: LR parsers, the canonical
Collection of LR(0) items, constructing SLR parsing tables, constructing Canonical LR parsing
tables, Constructing LALR parsing tables, using ambiguous grammars, an automatic parser
generator, implementation of LR parsing tables, constructing LALR sets of items.

Unit-III
Syntax-directed Translation: Syntax-directed Translation schemes, Implementation of Syntaxdirected
Translators, Intermediate code, postfix notation, Parse trees & syntax trees, three address
code, quadruple & triples, translation of assignment statements, Boolean expressions, statements
that alter the flow of control, postfix translation, translation with a top down parser. More about
translation: Array references in arithmetic expressions, procedures call, declarations, case
statements.

Unit-IV
Symbol Tables: Data structure for symbols tables, representing scope information. Run-Time
Administration: Implementation of simple stack allocation scheme, storage allocation in block
structured language. Error Detection & Recovery: Lexical Phase errors, syntactic phase errors
semantic errors.

Unit-V
Introduction to code optimization: Loop optimization, the DAG representation of basic blocks,
value numbers and algebraic laws, Global Data-Flow analysis.

References:
Aho, Sethi & Ullman, "Compiler Design", Addision Wesley.

DESIGN & ANALYSIS OF ALGORITHMS (TCS-503)
Unit -I
Introduction: Algorithms, analysis of algorithms, Growth of Functions, Master's Theorem,
Designing of Algorithms. Sorting and order Statistics: Heap sort, Quick sort, Sorting in Linear
time, Medians and Order Statistics.
Unit -II
Advanced Data Structure: Red-Black Trees, Augmenting Data Structure. B-Trees, Binomial
Heaps, Fibonacci Heaps, Data Stricture for Disjoint Sets.

Unit -III
Advanced Design and Analysis Techniques: Dynamic Programming, Greedy Algorithms,
Amortized Analysis, Back Tracking.

Unit -IV
Graph Algorithms: Elementary Graphs Algorithms, Minimum Spanning Trees, Single-source
Shortest Paths, All-Pairs Shortest Paths, Maximum Flow, Traveling Salesman Problem.

Unit -V
Selected Topics: Randomized Algorithms, String Matching, NP Completeness, Approximation
Algorithms.

References:
1. Coreman, Rivest, Lisserson, : “Algorithm", PHI.
3
2. Basse, "Computer Algorithms: Introduction to Design & Analysis", Addision Wesley.
3. Horowitz & Sahani, "Fundamental of Computer Algorithm", Galgotia.

PRINCIPLES OF PROGRAMMING LANGUAGES (TCS-504)
Unit -I
Introduction: Characteristics of programming Languages, Factors influencing the evolution of
programming language, developments in programming methodologies, desirable features and
design issues. Programming language processors: Structure and operations of translators,
software simulated computer, syntax, semantics, structure, virtual computers, binding and binding
time.

Unit -II
Elementary and Structured Data Types: Data object variables, constants, data types, elementary
data types, declaration, assignment and initialization, enumeration, characters, strings. Structured
data type and objects: Specification of data structured types, vectors and arrays, records, variable
size data structure, pointers and programmer constructed data structure, Sets files. Sub Program
and programmer defined data types: Evolution of data types, abstractions, encapsulations,
information hiding, sub programmes, abstract data types.

Unit -III
Sequence Control; Implicit and Explicit sequence control, sequence control with within
expression and statements, recursive sub programmes, exception handling, co routines, Scheduled
sub programmes, concurrent execution. Data control referencing environments, static and
dynamic scope, local data local data referencing environment, shared data: Explicit common
environment dynamic scope parameter passing mechanism.

Unit -IV
Storage Management: Major run time requirements, storage management phases, static storage
management, stack based, heap based storage management. Syntax and translation: General
syntactic criteria, syntactic element of a language, stages in translation, formal syntax and
semantics.

Unit -V
Operating and Programming Environment: Batch Processing Environments, Embedded system
requirements, Theoretical models, Introduction to Functional Programming, Lambda calculus,
Data flow language and Object Oriented language, Comparison in various general and special
purpose programming languages e.g. Fortran, C, Pascal, Lisp, etc.

References:
1. Terrance W Pratt, "Programming Languages: Design and Implementation" PHI
2. Sebesta, "Concept of Programming Language", Addison Wesley
3. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley
4. "Fundamentals of Programming Languages", Galgotia.

INDUSTRIAL ECONOMICS AND
PRINCIPLES OF MANAGEMENT (THU 501)
Industrial Economics:
Unit –1.Introduction: Nature and significance of Economics. Meaning of Science, Engineering
and Technology and their relationship with economic development.

Unit –2. Basic Concept: The concept of demand and supply. Elasticity of Demand and Supply.
Indifference Curve Analysis, Price Effect, Income Effect and Substitution Effect.

Unit –3. Money and Banking: Functions of Money, Value of Money, Inflation and measures to
control it. Brief idea of functions of banking system, viz., Commercial and central
banking, Business fluctuations.

Management:
Unit –4. Introduction: Definition, Nature and Significance of Management,. Evaluation of
Management thought, Contributions of Max Weber, Taylor and Fayol.

Unit –5. Human Behaviour: Factors of Individual Behaviour, Perception, Learning and
Personality Development, Interpersonal Relationship and Group Behaviour.

References:
1. Dewett, K.K. / Modern Economic Theory/S.Chand & Co.
2. Luthers Fred/ Organizational Behaviour.
3. Prasad L.M./ Principles of Management.
4. A.W. Stonier & D.C. Horgne / A TextBook of Economic Theory/ Oxford Publishing House
Pvt. Ltd.

OPERATING SYSTEMS (TCS-601)
Unit -I
Introduction: [02] Operating System and Function, Evolution of Operating System, Batch,
Interactive, Time Sharing and Real Time System, System Protection. Operating System Structure:
[04] , ' System Components, System Structure, Operating System Services.

Unit - II
Concurrent Processes: [06] Process Concept, Principle of Concurrency, Producer / Consumer
Problem, Critical Section, Problem, Semaphores, Classical Problems in Concurrency, Inter
Processes Communication, Process Generation, Process Scheduling.

Unit - III
CPU Scheduling: [05] Scheduling Concept, Performance Criteria Scheduling Algorithm,
Evolution, Multiprocessor Scheduling. Deadlock: [05] System Model, Deadlock Characterization,
Prevention, Avoidance and Detection, Recovery From Deadlock Combined Approach.

Unit - IV
Memory Management: [06] Basic Machine, Resident Monitor, Multiprogramming with Fixed
Partition, Multiprogramming With Variable Partition, Multiple Base Register, Paging,
Segmentation, Paged Segmentation, Virtual' Memory Concept, Demand Paging, Performance,
Paged Replaced Algorithm, Allocation of Frames, Thrashing, Cache Memory Organization,
Impact on Performance.

Unit - V
I/O Management & Disk Scheduling: [04] I/O Devices and The Organization of I/O Function, I/O
Buffering, Disk I/O, Operating System Design Issues. File System: [04] File Concept, File
Organization and Access Mechanism, File Directories, File Sharing, Implementation Issues.

Suggested Books and References:
1. Milenekovie, "Operating System Concept", McGraw Hill.
2. Petersons, "Operating Systems", Addision Wesley.
3. Dietal, "An Introduction to Operating System", Addision Wesley.
4. Tannenbaum, "Operating System Design and Implementation", PHI.
5. Gary Nutt, "Operating System, A Modern Perspective", Addision Wesley.
6. Stalling, Willium, "Operating System", Maxwell Macmillan
7. Silveschatza, Peterson J, "Operating System Concepts", Willey.
8. Crowley, "Operating System", TMH.

COMPUTER NETWORKS (TCS-602)
Unit -I
Introduction 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.

Unit-II
Medium Access sub layer: Medium Access sub layer - Channel Allocations, LAN protocols -
ALOHA protocols - Overview of IEEE standards - FDDI. Data Link Layer - Elementary Data
Link Protocols, Sliding Window protocols, Error Handling.

Unit - III
Network Layer: Network Layer - Point - to Pont Networks, routing, Congestion control
Internetworking -TCP / IP - IP packet, IP address, IPv6. '

Unit - IV
Transport Layer: Transport Layer - Design issues, connection management, session Layer-Design
issues, remote procedure call. Presentation Layer-Design issues, Data compression techniques,
cryptography - TCP - Window Management.

Unit-V
Application Layer: Application Layer: File Transfer, Access and Management, Electronic mail,
Virtual Terminals, Other application, Example Networks - Internet and Public Networks.

References:
1. Forouzen, "Data Communication and Networking", TMH
2. A.S. Tanenbaum, “Computer Networks”, 3rd Edition, Prentice Hall India, 1997.
3. S. Keshav, “An Engineering Approach on Computer Networking”, Addison Wesley, 1997
4. W. Stallings, “Data and Computer Communication”, Macmillan Press, 1989.

Rest of the syllabus here I am attaching pdf file please download it….

Attached Files

UPTU-3rd-Year-Syllabus-of-CS.pdf (73.4 KB, 212 views)