# syllabus computer science 3rd sem ptu

Computer science

THIRD SEMESTER

CS-201 COMPUTER ARCHITECTURE

External Marks: 60 L T P

Internal Marks: 40 3 1 -

Total Marks: 100

PREREQUISTES : None

OBJECTIVES : This course offers a good understanding of the various functional units

of a computer system and prepares the student to be in a position to design a basic

computer system. Finally the student will be exposed to the recent trends in parallel and

distributed computing and multithreaded application.

COURSE CONTENTS :

Principles of computer design - software / hardware interaction, cost/benefit concept of

layers in architecture design 10%]

Basic Computer Organization taking 8085 as an example binary arithmetic - add,

subtract, multiply - algorithms and implementations. carry look ahead add fast adders.

[15%]

CPU design - Choice of instruction set control structure hardwired and microprogrammed

control - RISC vs CISC, Pipelining in CPU design superscalar machines. [15%]

Memory hierarchy design caches, main memory, Interleave memory virtual memory

architectural aids in implementing these. [10%]

I/O Modes- program interrupt, DMA, Channel, I/O Processor. [15%]

I/O performance measures - Buses connecting I/O devices to CPU/memory - interaction

with operating system Serial/Parallel Interfaces taking 8251 and 8255 as examples. [15%]

Performance evaluation SPEC marks LINPACK Whetstone Dhrystone etc., Transaction

processing benchmarks. [10%]

Multiprocessors - Parallel & distributed computers - SIMD SPMD and MIMD machines.

[10%]

TEXT / REFERENCES :

Patterson and Hennessy, Computer Architectures, Morgaon Kauffman, San Mateo, CA,

USA, 1992.

P.Pal Chaudhary, Computer Organization and Design Prentice Hall of India Pvt. Ltd.,

New Delhi, 1994.

P.V.S. Rao, Perspectives in Computer Architecture, Prentice Hall of India Pvt. Ltd.,

NEW Delhi,1994.

M.R. Bhujade, Digital Computer Design Principles, Pitamber Publishing Co., 3rd

Edition, 1996.

CS - 203 DISCRETE STRUCTURES

External Marks: 60 L T P

Internal Marks: 40 3 1 -

Total Marks: 100

PREREQUISITES :

Mathematics & Data Structures

OBJECTIVES

The objective of this course is to provide the necessary back ground of discrete structures

with particular reference to the relationships between discrete structures and their data

structure counterparts including algorithm development.

COURSE CONTENTS:

Graph Theory: Graph- Directed and undirected Eulerian chains and cycles, Hamiltonian

chains and cycles Trees, Chromatic number Connectivity and other graphical parameter.

Application. [20%]

Combinatorial Mathematics: Basic counting principles Permutations and combinations

Inclusion and Exclusion Principle Recurrence relations, Generating Function,

Application. [15%]

Sets and functions: Sets and relations functions operations equivalence relations relation

of partial order partitions binary relations. [15%]

Monoids and groups: Groups Semigroups and monoids Cyclic semigraphs and

submonoids, Subgroups and Cosets. Congruence relations on semigroups. Morphisms.

Normal subgroups. Structure of Cyclic groups permutation groups, dihedral groups

Elementary applications in coding theory. [20%]

Rings and Boolean algebra : Rings Subrings morphism of rings ideals and quotient rings.

Euclidean domains Integral domains and fields Boolean Algebra direct product

morphisms Boolean sub-algebra Boolean Rings Application of Boolean algebra in logic

circuits and switching functions. [30%]

TEXT BOOKS:

1. Discrete Mathematics (Schaum series) by Lipschutz (Mc Graw Hill)

2. Applied Discrete Structures for Computer Science by Alan Doerr and Kenneth

Levarseur.

REFERENCES:

1.Discrete Mathematics by N Ch S n Lyengar, VM Chandrasekaran

CS-205 DIGITAL CIRCUITS & LOGIC DESIGN.

External Marks: 60 L T P

Internal Marks: 40 3 1 -

Total Marks: 100

PREREQUISITES: None

OBJECTIVES:

To give students basic ideas regarding digital hardware components at the level of gate

and sequential circuits. To treat logic design and making them familiar with the CAD

tools in digital system design.

COURSE CONTENTS:

Data and number representation-binary-complement representation BCD-ASCII, ISCII.

[15%]

Boolean algebra, logic gates, minimization, use of programs such as expresso in

minimization. [5%]

Digital Circuit Technologies, RTL/DTL/DCTL/TTL/MOS/CMOS/ECL, analysis of basic

circuits in these families, internal architecture of programmable logic devices. [10%]

Combinational design , design with Muxes. [5%]

Sequential circuits, flip-flops, counters, shift registers, multivibrators, state diagrams,

sequential circuit design from state diagrams computer aids in synthesis. [15%]

Memory system - RAM., ROM, EPROM, EEPROM, PAL, PLDs,PGAs. [20%]

Bus structures, transmission line effects, line termination. [10%]

A/D and D/A conversion techniques and selected case studies. [15%]

Introduction to VLSI Design , Custom and semi-custom design. [5%]

TEXT /REFERENCES:

Morris Mano, Digital Design- Prentice Hall of India Pvt. Ltd

Jesse H Jenkins,Designing with FPGAs and CPLDs , PTR Prentice Hall, Englewood

Cliffs

H.Taub & D. Schilling, Digital Integrated Electronics, McGraw Hill

Douglas L. Perry, VHDL, McGraw Hill, Inc., 2nd Edition, 1993.

Mead and L. Conway, Introduction to VLSI Systems, Addition Wesley, 1979.

R. Viswanathan , G. K. Meat and V.Rajaraman, "Electronics for Scientist and

Engineers". Prentice Hall of India Pvt. Ltd. 1978

J.Millman and Halkias, "Integrated Electronics, Analog and Digital Circuits and Systems,

Tata McGraw Hill ,1972.

CS-207 DATA STRUCTURES & PROGRAMMING METHODOLOGY

External Marks: 60 L T P

Internal Marks: 40 3 1 -

Total Marks: 100

PREREQUISITES:

The algorithms presented should be written in a pseudocode similar to the programming

language Pascal / C and therefore, the readers should preferable be familiar with Pascal /

C. The experience in structured programming and knowledge of combinatorial

mathematics would be helpful.

OBJECTIVES:

The course should provide one with a fairly good concept of the fundamentals of data

structures and also of the commonly occurring algorithms. The mathematical model of

data is an abstract concept of data such as set, list or graph. To make it useful for problem

solving the abstraction is made concrete by going into the data structure of the model- its

implementation and associated algorithms. Given a data structure, quite frequently ,

several alternative algorithms exist for the same operation. Naturally, the question

analyzing an algorithm to determine its performance in relation to the other alternatives

becomes important. The course should present the general approach towards analyzing

and evaluating algorithms and while presenting an algorithm, its analysis should also be

included as and when required.

COURSE CONTENTS:

Introduction [8%]

Linear Data Structures I: Arrays & Records [5%]

Linear Data Structures II: linked lists [10%]

Linear Data Structures III: Stacks and Queues [5%]

Linear Data Structures IV: Strings [5%]

Recursion [10%]

Non Linear Data Structures I: Trees [8%]

Non Linear Data Structures II [10%]

Hashing. [10%]

Sets [12%]

Graphs [12%]

Files [ 5%]

TEXTS / REFERENCES :

Aho A. V., J. E. Hopcroft, J.D. Ullman; Data Structures and Algorithms, Addison-

Wesley, 1983

Baase, S Computer Algorithms: Introduction to Design and Analysis, Addition - Wesley ,

1978.

Berztiss, A.T.: Data structures, Theory and Practice : 2nd ed., Academic Press, 1977.

Collins, W. J. Data Structures, An Object-Oriented Approach, Addition-Wesley, 1992.

Goodman, S.E., S.T.Hedetniemi: Introduction to the Design and Analysis of Algorithms.

McGrow- Hill, 1977

Horowitz, E., S. Sahni : Algorithms: Design and Analysis, Computer Science Press, 1977

. Horowitz E., S. Sahni: Fundamentals of Data Structures in PASCAL, Computer Science

Press, 1984.

Knuth, D.E.: The Art of Computer Programming , Vols 1-3, Addition-Wesley, 1973.

Kruse, R. L. Data Structures and Program Design , 2nd Ed., Prentice Hall, 1987.

Lorin, H.: Sorting and sort Systems, Addition-Wesley, 1975.

Standish, T.A.: Data Structure Techniques, Addition-Wesley, 1980. Tremblay, J.P., P.G.

Sorenson: An Introduction to Data Structures with Applications, McGraw - Hill , 1976.

Wirth, N.: Algorithms + Data Structures = Programs, Prentice-Hall. 1976.

CS-209 WRITTEN & ORAL TECHNICAL COMMUNICATION

(Communication skills for Scientists and Engineers)

External Marks: 60 L T P

Internal Marks: 40 2 1 -

Total Marks: 100

PREREQUISITES : NONE

OBJECTIVES:

The course is intended to develop a student's ability to communicate both in speech and

writing in the Situation that he/she is likely to come across in his/her academic and

working life.

COURSE CONTENTS:

Note taking from lectures and reference material [10%]

Essay and précis writing [30%]

Slide preparation and oral presentation principles [10%]

Written presentation of technical material [20%]

Preparation of Bibliography [10%]

Basics of Official Correspondence [15%]

Preparation of bio-data [5%]

Students should be asked to prepare and present Seminars during the practice session.

TEXTS/REFERENCES

The Chicago Manual of Style, 13th Edition, Prentice Hall of India 1989.

Gowers Ernest, "The Complete Plan in Words" Penguin, 1973.

Menzel D.H., Jones H.M, Boyd, LG., "Writing a Technical Paper". McGraw Hill, 1961.

Strunk, W., & White E.B., "The Elements of Style", 3rd Edition , McMillan, 1979.

Turbian K.L., "A Manual for Writers of Term Papers, Thesis and dissertations" Univ of

Chicago Press, 1973.

IEEE Transactions on "Written and Oral Communication" has many papers.

CS - 211 PROGRAMMING LANGUAGES

External Marks: 60 L T P

Internal Marks: 40 3 1 -

Total Marks: 100

OBJECTIVES:

At the end of this course students will be able to simulate the problems in the subjects

like O.S., C.N., System project , System simulate and modelling etc. Moreover it will be

used as a tool for doing minor and major Projects.

INTRODUCTION :

C and C++ programming, differences between C and C++ , adding an user interface to C

and C++ program, standard C and C++ data types , storage classes, operators Standard C

and C++ libraries, writing & using functions, arrays pointer , I/O in C, Structure unions,

macro's Advanced preprocessor statements, dynamic memory allocation .

OBJECT ORIENTED PROGRAMMING:

Object oriented terminology, C++ classes I/O M C++, the cost team class list combining

C & C++ code, designing Unique manipulators , Object oriented stack and linked list in

C++

WINDOWS PROGRAMMING FOUNDATIONS :

Windows concepts windows programming concept , visual C++ Windows tools,

procedure -oriented windows Application Microsoft foundation Class library concepts.

Windows Applications with MFC. WIZARDS: Application and class Wizards,

introduction to OLE, active X controls with the MFC library.

.Net Framework:-

Introduction to .Net framework, concept of CLR. Managed and un-managed code in

VC++. Concept of Assemblies.

BOOKS:-

The complete Reference Visual C++5 Chris H. Pappas & William H. Murray, III

The Visual C++ handbook Chris H. Pappas & William Murray Osborne

DATA STRUCTURES & PROGRAMMING METHODOLOGY LAB

External Marks: 20 L T P

Internal Marks: 30 - - 3

Total Marks: 50

Algorithm development in all areas of data structures covered in the course. Emphasis

should be given on the following matters. Development of recursive as well as non

recursive a algorithms involving linked list trees and graphs. Use of pointers for dynamic

allocations of storage. Development of classes for some of the data structures using the

concept of abstract data types.

CS- 217 Lab-I (Digital Circuit and Logic Design)

External Marks: 20 L T P

Internal Marks: 30 - - 2

Total Marks: 50

1. Verification of the truth tables of TTL gates, e.g., 7400, 7402,7404, 7408,

7432, 7486.

2. Design, fabrication and testing of low frequency TTL clocks using NAND

gates.

3. Verification of the truth table of the Multiplexer 74150.

4. Verification of the truth table of the De-Multiplexer 74154.

5. Design and verification of the truth tables of half adder and full adder circuits

using gates 7483.

6. (a)Design and test of an SR flip flop using Nor/Nand gates.

(b)Verify the truth table of a J-K flip flop.(7476)

(c)Verify the truth table of a D-flip flop (7474) and study its operation in the

toggle and asynchronous modes.

7. (a) To study the operation of 2 bit and 4 bit asynchronous counters.

(b) To study the operation of 2 bit and 4 bit synchronous counters.

8.To study the operation of 2 bit and 4 bit Johnson counters.

CS- 219 Lab-II (Programming Languages)

External Marks: 20 L T P

Internal Marks: 30 - - 3

Total Marks: 50

PROGRAMMING LANGUAGES LAB

Students should be asked to write programs in C & C++ using different statements ,

Libraries and Functions , Designing Unique Manipulators etc.