SWAMI RAMA HIMALAYAN UNIVERSITY

BOARD OF STUDIES
POLYTECHNIC- DIPLOMA IN COMPUTER SCIENCE
& ENGINEERING

Faculty of Engineering & Technology

SWAMI RAMA HIMALAYAN UNIVERSITY
Swami Ram Nagar, Jolly Grant,
Dehradun-248016
Page | 1
Page | 2
 Polytechnic Diploma in Computer Science & Engineering

No. Contents: Page

1. Notification of Constituting Board of Studies 1
2. Notice of Meeting with Agenda 2
3. Attendance of Meeting 3
4. Minutes of Meeting 4
Approved Copy of Curriculum for Second Year and Third Year

i. Goals & Objectives 5

ii. Syllabus Semester Wise-Theory & Practical 6-37
5.
iii. Study & Evaluation Scheme 38-41
iv. Assessment: Internal 42
v. Question Paper Pattern 43
6. Final Letter signed by all experts 49
 Board of Studies
Polytechnic- Diploma in Computer Science & Engineering
August, 2016
S.No. Name Signature
Dr. Praveena Chaturvedi
External Expert, Computer Science &
1.
Engineering

Ms. Geeta Joshi

2. External Expert, Computer Science &
Engineering

3. Dr. Girish Kumar Anand-Member

4. Dr. H. S. Payal-Member

5. Dr. R. C. Ramola-Chairman

Page | 3
 BOARD OF STUDIES AUGUST, 2016

Minutes of the Meeting

In the pursuance to the notification no. SRHU/Reg/OO/2016-56(iv) dated 15th July 2016 the meeting of the
Board of Studies (BOS) for polytechnic diploma program in Computer Science & Engineering under
Faculty of Engineering & Technology was held on 01st August 2016 at 10:00 am in the Himalayan School
of Engineering and Technology.

The following Members were present in the meeting:

1. Dr. Praveena Chaturvedi

2. Ms. Geeta Joshi
3. Dr. H.S Payal
4. Dr. G. K Anand
5. Dr. R.C Ramola
The members went through the curriculum in detail. The syllabus, course structure along with evaluation
scheme and question paper pattern was discussed.

The experts suggested following points:

1. Software Engineering from fourth semester may be shifted to fifth semester in place of the course
Data Communication & Computer Networks.
2. Two courses namely Computer Organization and Computer Hardware may be merged.
3. Some minor changes were suggested and have been implemented.
4. Few reference books were suggested in various courses.
5. For some laboratories, modifications have been suggested.

------------------------------ ------------------------------
Dr. Praveena Chaturvedi Ms. Geeta Joshi
External Expert External Expert
Computer Science & Engineering Computer Science & Engineering

---------------------------- --------------------------- ------------------------------

Dr. Girish Kumar Anand Dr. H.S. Payal Dr. R.C. Ramola
Member Member Chairman

Page | 4
 Goals and Objectives

Goals:-
 The goal of Polytechnic Programs is to build the theoretical foundation with broad emphasis on
practical aspects and exposing students to current requirements of the Industry.

 Through its state of the art laboratories, supervised by experienced faculty and trained laboratory
technicians, the department will strive to inculcate practical awareness among the students.

Objectives:-
 To make valuable contributions to design, development and implementation in the practice of
computer science and engineering in related information technology areas, and at the interface of
computers and software's.
 To demonstrate strong communication skills, technical skills and the ability to function
effectively as part of a team.
 To demonstrate a sense of societal and ethical responsibility in all professional endeavors.
 To engage in professional development to pursue flexible career paths amid future technological
changes.

*****

Page | 5
 Syllabus
Polytechnic-Diploma in Computer
Science & Engineering

Faculty of Engineering & Technology

SWAMI RAMA HIMALAYAN UNIVERSITY
Swami Ram Nagar, Jolly Grant,
Dehradun-248016
III-SEMESTER
THEORY
 Course Code: Course Title L T P C
DMAT201 Applied Mathematics 3 1 0 4

UNIT-I 10-LECTURES
Successive Differentiation & Multiple integral: Successive Differentiation, Leibnitz theorem, double
integration, change of order of integration, triple integration.

UNIT-II 10-LECTURES
Matrices: Elementary Row operations (ERO), Rank and inverse of a matrix by ERO, solution of system
of equations by ERO, Cayley-Hamilton Theorem, Eigen values and Eigen vectors.

UNIT-III 10-LECTURES
Differential Equation: Second and higher order differential equations, linear differential equations with
constant coefficients (complementary function and particular integral), method of variation of parameters.

UNIT-IV 10-LECTURES
Laplace Transform: Definition, basic properties, unit step and unit impulse function, Inverse Laplace
Transform and its properties.

UNIT-V 5-LECTURES
Fourier series: Introduction to Fourier series, evaluation of Fourier coefficients, even and odd series, half
range series.

TEXT BOOKS:

1. Advanced Engineering Mathematics: H. K. Dass, S. Chand & Publication, 12th edition, 2012.

REFERENCE BOOKS:

1. Engineering Mathematics: Dr. B. S. Grewal, Khanna Publication, 14th edition, 2012.

2. Higher Engineering Mathematics: H. K Das and Rajneesh Verma, S. Chand & Publication, 3rd
edition, 2014.

Page | 6
 Course Code: Course Title: L T P C
DCST202 Object Oriented Programming using C++ 3 1 0 4

UNIT-I 10- LECTURES

Fundamentals of object oriented programming: Introduction to C++, program structure of C++ program,
procedure oriented programming vs. object oriented programming (OOP).
Object oriented programming concepts: Classes, reusability, encapsulation, inheritance, polymorphism,
abstraction, benefits of OOPs, and applications of OOP.

UNIT-II 08- LECTURES

Language Constructs: Variables, Data types, Operators. Input and Output statements. Type Conversions.
Decision making and branching: if ---else, conditional operator (? :), loops, switch Statement.
Jumps in loop: break, continue. Arrays, Pointers, new and delete operators.

UNIT-III 10- LECTURES

Classes and Objects: Class creation, scope resolution operator, Object accessing class members: definition
inside class, definition outside class.
Access Modifiers: private, public, & protected. inline function, friend functions, function overloading,
constructors, constructor overloading, destructors, static members.

UNIT-IV 12- LECTURES

Polymorphism: Types of Polymorphism: compile-time, run-time, function overloading, operator
overloading, virtual functions, pure-virtual functions.
Inheritance: Definition of inheritance, base class, derived class, types of inheritance, derivation types,
virtual base class and abstract class.

UNIT-V 05- LECTURES

Managing Console I/O Operations: C++ streams, C++ stream classes, Formatted and Unformatted I/O
Operations.

TEXT BOOKS:

1. Object Oriented Programming with C++, E. Balaguruswamy, TMH Publishing Co. Ltd, New
Delhi, 2013, 6th edition.
2. Mastering C++, KR Venugopal and Rajkumar, T Ravishankar, Tata McGraw hill Publishing
Co. Ltd., New Delhi, 2013, 2nd edition.

REFERENCE BOOKS:

1. The C++ Programming Language, Bjarne Stroustrup, Pearson Education, 2002, 3rd edition.
2. Object - Oriented Programming with C++, A.K. Sharma, Pearson Education, 1st edition.
3. C++: The Complete Reference, Herbert Schildt, McGraw Hill Education, 2003, 4th edition.

Page | 7
 Course Code: Course Title: L T P C
DCST203 Data Structures Using C
3 1 0 4

UNIT-I 08-LECTURES
Introduction: Basic Terminology, Data Organization, Data Structure Operations, Algorithm Complexity and
Time-Space trade-off. Arrays: Array Definition, Representation and Analysis, single and Multidimensional
Arrays, address calculation, application of arrays.

UNIT-II 12-LECTURES
Stacks: Array Representation and Implementation of stack, Operation Associated with Stacks, Application of
stack, Conversion of Infix to prefix and postfix Expressions, Evaluation of postfix expression using stack.
Queues: Array representation and implementation of queues, operations on queue: Create, Add, Delete; Full
and Empty Queue, Circular Queues, De-queues.

UNIT-III 12-LECTURES
Linked List: Introduction to linked list and doubly linked list, Representation of linked lists in Memory,
Traversing a linked list, Searching linked list, Insertion and deletion into linked list, Introduction to Circular
link list, Doubly link lists.

UNIT-IV 07-LECTURES
Trees: Basic terminology, Binary Tree, Binary tree representation of algebraic Expressions, Complete Binary
Tree, Array Representation of Binary tree, Traversing Binary trees.

UNIT-V
06-LECTURES
Sorting and Searching: Introduction, Search algorithm (Linear and Binary), Sorting algorithms (Bubble Sort,
Insertion Sort, Selection Sort, Merge Sort), Introduction to Hashing.

TEXT BOOKS:

1. Data structures using C, Seymour Lipschutz, Schoum Series, TMH, 4th Edition.
2. Data Structure through C, G.S.Baluja, Dhanpat Rai Publications, 4th Edition.

REFERENCE BOOKS:

1. Data Structures using C & C++, A M Tanenbaum, PHI, 2nd Edition

2. Data Structures and Program Design in C, Robert L. Kruse, Bruce P. L. Clovis L, PEA, 2nd Edition.

Page | 8
Course Code: Course Title: L T P C
DCST204 Digital Electronics 3 1 0 4

UNIT-I 13-LECTURES
Basics of Digital Electronics: Binary, octal, hexadecimal number systems, conversion from one system to
another number system, binary codes, excess-3 and gray codes, logic gates- AND, OR, NOT, NAND, NOR,
Exclusive-OR, logic symbols, Boolean algebra, Boolean expressions, Demorgan’s Theorem, implementation
of logic expressions, SOP and POS forms, Karnaugh map application, logic families, IC Packaging and its
types.

UNIT-II 06-LECTURES
Combinational Logic Circuits: Implementation of arithmetic circuits, half adder, full adder, serial and
parallel binary adder, parallel adder / subtractor.

UNIT-III 08-LECTURES
Sequential Circuits-I: Principle of flip-flops operation, Concept of edge triggering, level triggering, Set-
Reset flip-flop, Delay flip-flop, JK flip-flop, Trigger flip-flop, JK Master Slave flip-flops, synchronous and
asynchronous inputs and their use, Applications of flip flops.

UNIT-IV 08-LECTURES
Sequential Circuits-II: Shift Registers- Types, shift left ,shift right, bidirectional, Parallel in parallel
out,counters, ring counter, Binary counter- ripple counter, synchronous counter, up-down counter.

UNIT-V 10-LECTURES
Memories: Terminology related to memories, RAM, ROM, EEPROM, UVEPROM, static RAM, dynamic
RAM, Flash ROM, NVRAM, memory modules used in computers, Necessity of A/D and D/A converters,
Weighted resistors and R- 2R ladder method of D/A converters, Counter and SAR method of A/D converters.

TEXT BOOKS:

1. Modern Digital Electronics: R. P. Jain, TMH, 4th Edition.

REFERENCE BOOKS:

1. Digital Design: Morris Mano, PHI, 3rd Edition, 2006.

2. Fundamentals of Logic Design: Charles H. Roth, Thomson Publications, 5th Edition, 2004.
3. Digital Logic Applications and Design: John M. Yarbrough, Thomson Publications, 2nd
Edition, 2006.

Page | 9
 Course Code: Course Title: L T P C
DCST205 Computer Hardware 3 1 0 4

UNIT–I 08-LECTURES
Generations of computer, A to D and D to A Converters, Introduction and working of Input devices: Key
Board, Mic, Cam, etc. Introduction and working of Output devices: Monitor: CRT, LCD, LED, LFD,
Speaker and its types, Printer and its types. Introduction and working of Secondary storage devices: Hard
Disk, CD, DVD, Sectors and Tracks. Introduction and working of internal components: CPU, Motherboard,
RAM etc.

UNIT–II 09-LECTURES
Communication mediums in networks, Network Interface Cards, Parallel and Serial ports, Relationship
between Hardware and Software, Program and Processes, Application Programs, Operating Systems and
Types, System Utilities, Device Drivers

UNIT–III 08-LECTURES
Types of computer architecture, Von Neumann architecture, Power supply, Arithmetic and Logic Unit,
Auxiliary Storage, Computer Bus and Types, Expansion cards and bus, Computer Modem, Graphics Cards
and Drivers, Processors and Types, Touch Panel and Its Working

UNIT–IV 07-LECTURES
Computer Network: LAN, WAN, MAN, Network Addressing: IP and MAC address, Switch and its types,
Access Points, Routers and Gateway, Routing Tables.

UNIT–V 13-LECTURES
Supercomputer, Mainframe, Minicomputer, Microcomputer and scope, Thin Client and Working,
Introduction of Distributed Computing, Introduction of Parallel Computing, Introduction of Cloud
Computing

TEXT BOOKS:

1. Computer Organization and Design: The Hardware/Software Interface, D. A. Patterson and J. L.

Hennessy, Morgan Kaufmann, Fourth edition, 2009.
2. PC Architecture, Michael Karbo, Know Ware - Competence Micro, 2005

REFERENCE BOOKS:

1. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, J. L. Hennessy and D. A.

Patterson. San Francisco, CA, fifth edition, 2012.
2. Open SPARC T1/T2 CMT Throughput Computing. D. L. Weaver. OpenSPARC Internals: Sun
Microsystems, Inc., Santa Clara, CA, 2008.

Page | 10
 Course Code: Course Title: L T P C
DCST206 Computer Organization 3 1 0 4

UNIT-I 10-LECTURES
Introduction: Computer system organization and architecture, Register Transfer and Micro Operations,
Register transfer language, bus and memory transfer, arithmetic logic micro operations. Basic computer
organization and design, instructions and instructions codes, computer instruction.

UNIT-II 9-LECTURES
Timing and control, instruction cycles, memory reference instruction, input and output and interrupts,
complete computer description, Programming the basic Computer Machine language, assembly language,
assembler, program loops, programming arithmetic, and logic operations, sub routines, input- output
programming.

UNIT-III 10-LECTURES
Micro Programmed Control, Control memory, address sequencing, Central Processing Unit, General
register organization, instruction formats, stacks organizations, addressing modes, data transfer and
manipulation, programmed control, reduced instructions set computers, pipeline and vector processing,
parallel processing, pipelining, arithmetic pipelines, RISC pipelines, Vector processing, array processors.

UNIT-IV 07-LECTURES
Computer Arithmetic Algorithm Addition and Subtraction algorithm, multiplication algorithms, division
algorithms, floating point arithmetic operations.

UNIT-V 9-LECTURES
Input- Output Organization, Peripheral devices, Input Output interface, asynchronous data transfer, modes
of transfer, priority interrupt, Direct Memory Access (DMA), Input Output processor.

TEXT BOOKS:

1. Computer Organization and Architecture: Designing for Performance, William Stallings, Pearson
Publication, 8th Edition.
2. Computer Organization and Architecture, Madhulika Jain, Satish Jain, Veneeta Pillai, BPB
Publications, 2003.

REFERENCE BOOKS:

1. Computer system architecture, Morris mano Prentice Hall of India, New Delhi, 4th Edition.
2. Digital Electronics by RP Jain, TMH, 4th Edition.

Page | 11
III-SEMESTER
PRACTICALS
Course Code: Course Title: L T P C
DCSP202 Object-Oriented Programming using C++ 0 0 2 1

List of Practical

1. Write a program to swap two values using function where parameters are passed as an arguments
using:
a) Call_by_value
b) Call_by_reference
2. Write a program to pass array as a parameter in a function and find the largest number in an array.
3. Write a program to print “ Hello, SRHU”, when function definition of a class is given:
a) Inside class definition
b) Outside class definition
4. Write a program to implement the concept of function overloading.
5. Write a program to access private data members outside the class using friend function.
6. Write a program to implement constructor overloading.
7. Write a program to overload the following operator:
a) ++
b) %
c) [ ]
d) ->
8. Write a program to implement virtual function.
9. Write a program to implement abstract Class.
10. Write a program to implement various types of Inheritances.

Page | 12
Course Code: Course Title: L T P C
DCSP203 Data Structures Using C 0 0 2 1

List of Practical

1. Write a program to illustrate reading and writing of the array.

2. Write a program to insert and delete an element in one dimensional array.
3. Write a program to traverse an array.
4. Write a program to demonstrate push, pop, traverse operations performed on stack.
5. Write a program to implement linear queue using array.
6. Write a program to implement circular queue using array.
7. Write a program to perform following operations using single linked.
i) Inserting an element

a) At beginning
b) At a particular location
c) In the last
ii) Deletion of an element
a) At beginning
b) At a particular location
c) In the last
iii) Displaying the element
iv) Exit
8. Write a program to perform following operations using double linked list
i) Inserting an element
a) At beginning
b) At a particular location
c) In the last
ii) Deletion of an item
a) At beginning
b) At a particular location
c) In the last
iii) Displaying the element
iv) Exit
9. Write a program to perform following operations on a binary search tree.
i) Inserting the element
ii) Deletion of an item
iii) Exit

10. Write a program to sort an array of N elements using Selection sort, Insertion sort, Bubble sort and
Merge sort.

Page | 13
Course Code: Course Title: L T P C
DCSP204 Digital Electronics 0 0 2 1

List of Practical

1. Verify the truth tables of AND, OR, NOT, NAND, NOR and Exclusive OR (using IC’s).
2. Develop NOT, OR & AND operations using universal gates
3. Construct Half-adder and verify its truth table.
4. Construct Full-adder and verify its truth table
5. Construct and verify the truth tables of NAND & NOR latches
6. Verify the truth tables for RS, D, T, and JK and Master - Slave JK flip-flops.
7. Verify the function of counter (ICs like 7490, 7493, 74160).
8. Verify the function of shift register (ICs like 7495, 74194 etc.)
9. Construct and verify the working of R-2R D/A converter.
10. Verify the working of Multiplexer (Using IC 74153)

Page | 14
Course Code: Course Title: L T P C
DCSP205 Computer Hardware 0 0 2 1

List of Practical

1. Assembling Central Processing Unit.

2. Making Serial and Parallel Patch Cords.
3. Configuring Static IP Address.
4. Installing Operating Systems. (Window and Linux).
5. Configuring Window Firewall for –IP, Ports, and Programs etc.
6. Installing and Updating Drivers for Hardware’s.
7. Configuring DHCP using Packet Tracer.
8. Configuring Router using Packet Tracer.
9. Configuring VLAN Using Packet Tracer.
10. Installing Server Machine with active directory.

Page | 15
IV-SEMESTER
THEORY
Course Code: Course Title L T P C

DTCT207 Technical Communication 2 0 0 2

UNIT-I: Technical Communication 05 LECTURES

Introduction to Technical Communication, Importance and characteristics, Origin and Development, Forms of
Technical Communication, Role of Technical Communication in an Organization, Commonly used technical terms,
Remedial English Grammar

UNIT-II: Developing Listening Skills 05 LECTURES

Listening to talks and speeches of experts, Identification of general and specific information, Oral and written
Presentation of topics studied with the aid of Audio-visual prompts

UNIT-III: Developing Reading Skills 05 LECTURES

Reading and understanding of news and other articles, Reading for comprehension of literary and scientific data,
Data Interpretation

UNIT-IV: Developing Speaking Skills 04 LECTURES

Internal monologue to global communication - Quantity versus quality speech, Informal Meetings and the
Professional Prattle, Power-point presentations, Telephone talk: words, jargon, tone and voice quality, Techniques
for conducting Meetings and Interviews

UNIT-V: Developing Writing Skills 11 LECTURES

Writing Notices, Emails, Invitations: Invite, Accept and Decline, Development of Technical Writing Skills -
Principles of clear and effective technical writing, Writing of Summaries & Precis, Technical Reports and
Proposals, Scripting the Resume and Job Application

TEXT BOOKS:

1. Technical Communication–Principles and Practice, Meenakshi Raman & Sangeeta Sharma, Oxford
University Press, 2nd Edition.

REFERENCE BOOKS:

1. Basic Communication Skills for Technology, Andrea J.Rutherfoord, Pearson, 2nd Edition
2. Technical Communication- A Practical Approach, William Sanborn Pfeiffer & T.V.S.
th
3. Padmaja,Pearson, 6 Edition
3. Effective Technical Communication, M Ashraf Rizvi, TMH, 1st Edition.
4. Professional Communication, ArunaKoneru, TMH, 1st Edition.
5. Oxford Guide to writing and Speaking, John Seely, Oxford University Press, 2nd Edition.
6. High School English Grammar and Composition, Wren & Martin, S. Chand, 1st Edition.
7. The Collins English Dictionary, Collins, HarperCollins Publisher, 11th Edition.

Page | 16
 Course Code Course Title: L T P C
DCST208 VB .Net 3 1 0 4

UNIT-I 10-LECTURES
Introduction Microsoft .Net Framework , benefits of .Net Framework, .Net Framework Architecture,
Components of .NET Framework architecture: common language Runtime(CLR), Common types
system(CTS), Common language specification, Base class library , Microsoft Intermediate
Language(MSIL), Just-in-time (JIT) compilation, garbage collection, application installation & assemblies,
web services, unified classes.

UNIT-II 09-LECTURES
Introducing VB , VB design goals, features of VB , application of VB , why learn VB , comparing VB
with C++ and Java , VB and .NET, Data types, Identifiers, variable & constant, VB statement, Operators
and expressions, Decision making and branching, Decision making and looping, program structure,
program coding style.

UNIT-III 11-LECTURES
VB class libraries : Namespaces, adding comments, main returning a value, using aliases for Namespace
classes, Passing String objects to write Line method, Command Line arguments, Main with a class,
providing interactive input, Multiple main methods. Introduction, declaring methods, the main method,
invoking methods, nesting of methods, methods parameter, pass by value, pass by reference, variable
argument lists, method overloading. Handling array, manipulating strings, structures and enumerations.

UNIT-IV 07-LECTURES
Multi-threading, Networking and sockets, Data handling, Windows forms, VB in web application, error
Handling.

UNIT-V 08-LECTURES
Advanced features Using VB : Web services, messaging, Reflection, COM and VB, Localization,
distributed application in VB, XML and VB, Unsafe Mode, Graphical Device Interface with VB.

TEXT BOOKS:

1. Mastering Visual Basic .Net Paperback, by Evangelos Petroustsos, BPB, 2002

REFERENCE BOOKS:

1. VB: The complete Reference, Shildt, TMH, 4th Edition.

2. Programming with VB, Balagurusamy, TMH, 1st Edition.

Page | 17
 Course Code: Course Title: L T P C
DCST209 Web Technology 3 1 0 4

UNIT-I 07-LECTURES
Internet Basics: Concept, Establishing Connectivity on Internet, Email: POP, SMTP, www, File Transfer,
Telnet, web page, web server, HTTP protocol, Uniform Resource Locator (URL), search engines, proxy
servers, IP Address, Brief overview of TCP/IP.

UNIT-II 11-LECTURES
HTML: Introduction, HTML Tags, Structure of HTML Programs, Heading, Titles and Footers, Text
Formatting, Text Styles, Text Effects, Color and Backgrounds, Lists, Adding Graphics, Tables, Linking
Documents, Frames, Adding graphics and images, image maps, image files
DHTML: Introduction to DHTML, Cascading Style sheets (CSS)- Font Attributes, Color, Background, Text
and Border, List Attributes, Java Script Style Sheet.

UNIT-III 09-LECTURES
Java Script: Java script in web pages, Advantages of JavaScript, Writing JavaScript into HTML,
Programming- Data types and Literals, Type casting, Variables, Arrays, Operators and Expressions,
Conditional and Iterative Loops, Functions, Dialog Boxes, Cookies, , Object in Java Script.

UNIT-IV 08-LECTURES
CGI: Use of CGI, Working of CGI, Methods of Data Submission (GET and POST), Environment Variables,
Process Form Information in CGI Program

UNIT-V 10-LECTURES
Using Front Page:-Front page editor, Front page explorer Client-side Scripting: - Using Java Script, Server
side Scripting: - Java Server Pages (JSP), Web Page designing using database as a Back end and JSP as front
end.

TEXT BOOKS:

1. Internet Technology And Web Design, ISRD Group,Tata McGraw-Hill Education, 2011
2. Web Programing Building Internet Applications, Chris Bates, WILEY, Dreamtech, 2nd Edition.

REFERENCE BOOKS:

1. Beginning Web Programming with HTML, XHTML, and CSS, Jon Duckett, Wiley India Pvt Ltd,
2nd Edition.
2. Instant Java Server Pages by Paul Tremblett, (Osborne McGraw-Hill, 2000)

Page | 18
Course Code: Course Title: L T P C
DCST210 Microprocessors & Peripheral Devices 3 1 0 4

UNIT-I 09-LECTURES
8085 Microprocessor: Architecture and pin description of 8085 microprocessor, addressing modes,
instruction set of 8085 microprocessor, features of 8085, flag register, basic 8085 system timing diagrams,
interrupts, example programs of 8085 microprocessor.

UNIT-II 09-LECTURES
Architecture of 8086: Concepts of parallel processing, memory segmentation, features of 8086, internal
architecture of 8086, pin diagram of 8086, calculation of physical address, flag register, basic 8086 system
timing diagrams, interrupts.

UNIT-III 09-LECTURES
Instruction Set of 8086 and Programming: Instruction format, addressing modes, instruction set,
arithmetic and logical data transfer, branching, loop control, processor control instructions, assembler
directives, assembler instruction format, program development tools, procedure for executing assembly
program, sample programs.

UNIT-IV 09-LECTURES
Interfacing: Programmable parallel ports, handshake I/O, interface microprocessor to keyboards, DAC
principle of operation, specifications and different types of DACs and interfacing, A/D converter
specifications, types, interfacing to different types of A/D converters

UNIT-V 09-LECTURES
Programmable Peripheral Devices: Introduction to programmable peripheral devices 8254, 8259, 8251,
DMA data transfer, RS232 communication standard and maximum mode of 8086 operation.

TEXT BOOKS:

1. X86 Microprocessor Programming: Venugopal and Rajkumar, BPB Publications, 1st Edition.
2. Microprocessors and interfacing programming and Hardware: Douglas V. Hall, TMH, 2nd Edition.

REFERENCE BOOKS:

1. Microcomputer systems: The 8086 Family, Yu-Cheng Liu & Glenn A Gibson, PHI, 2nd Edition.
2. Microprocessors Theory and applications Intel and Motorola: Rafiquzzaman, PHI, 3rd Edition.

Page | 19
Course Code: Course Title: L T P C
DCST211 Database Management Systems 3 1 0 4

UNIT-I 10-LECTURES
Introduction to DBMS: Database and its purpose, Characteristics of the database approach, Advantages
and disadvantages of database systems. Classification of DBMS, Database Administrators. Traditional file
systems vs. database management systems, Architecture for DBMS: External level, conceptual level,
internal level, Mappings. Data Independence; Logical data Independence, Physical data Independence.

UNIT-II 6-LECTURES
Data Modeling and Entity Relationship Model: Data Models Classification: File based or primitive
models, traditional data models, semantic data models. Entities and Attributes, Entity types and Entity sets,
Key attribute and domain of attributes, Relationship among entities

UNIT-III 12-LECTURES
Relational Model: Relational Model Concepts: Domain, Attributes, Tuples and Relations. Relational
constraints and relational database schemes; Domain constraints, Key constraints and constraints on Null.
Relational databases and relational database schemes, Entity integrity, referential integrity and foreign key
Introduction to Relational Algebra, Introduction to SQL queries, Creating, Inserting, Updating and deleting
tables and using constraints, Set operations & operators, Aggregate functions, string functions and date,
time functions, Null values, Nested sub queries, Complex queries, Join concepts.

UNIT-IV 08-LECTURES
Normalization: Functional dependencies, Normal forms: first, second, third normal forms, BCNF,
inclusion dependencies, loss-less join decompositions, normalization using FD, Introduction of MVD and
JDs

UNIT-V 09-LECTURES
Transaction Processing: Transaction concepts, simple transaction model, serializability, Transaction
isolation and atomicity, Concurrency control mechanism, locking techniques for concurrency control.

TEXT BOOKS:

1. Fundamentals Of Database Systems, Elmasri, Navathe, Addision Wesley,5th Edition

2. Database Concepts, Korth, Silbertz, Sudarshan, McGraw Hill, 5th Edition

REFERENCE BOOKS:

1. An Introduction to Database System, Date C J, Pearson, 8th Edition.

2. Principles of Database Systems, J. D. Ullman, 2nd Edition., Galgotia Publications, 1999
3. Oracle 8 Architecture, Steve Bobrowski, TMH, 2000.

Page | 20
 Course Code: Course Title: L T P C
DCST212 Software Engineering 3 1 0 4

UNIT-I 10-LECTURES
Introduction to software engineering, Importance of software, The evolving role of software, Software
Characteristics, Software Components, Software Applications, Software Crisis, Software engineering
problems, Software Development Life Cycle, Software Process Models.

UNIT-II 9-LECTURES
Requirement Elicitation, Analysis, and Specification: Functional and Non-functional requirements,
Requirement Sources and Elicitation Techniques.
Design principles, problem partitioning, abstraction, and top down and bottom up-design, structured
approach, functional versus object oriented approach, Cohesion, Coupling.

UNIT-III 8-LECTURES
Programming approaches, structured programming, programming style and internal documentation,
Testing, Types of testing, Levels of testing, test plan, Verification & validation, debugging.

UNIT-IV 9-LECTURES
The Management spectrum- The people, the product, the process, and the project, cost estimation, project
scheduling, staffing, software configuration management, Maintenance and its types, quality assurance
plan, project monitoring, risk management.

UNIT-V 9-LECTURES
Reliability, Reliability metrics, Reliability growth modeling, Software quality, ISO 9000 certification for
software industry, SEI capability maturity model, comparison between ISO & SEI CMM. CASE and its
Scope, CASE support in software life cycle, documentation, project management, Reverse Software
Engineering, Architecture of CASE environment.

TEXT BOOKS:

1. Software Engineering: A Practitioner’s Approach, Pressman, Roger S, McGraw Hill, Delhi, 8th
Edition.
2. Fundamentals of Software Engineering, Rajib Mall, PHI Learning, 3rd Edition.

REFERENCE BOOKS:

1. Software Engineering, Jalote, Pankaj, Narosa, Delhi, 3rd edition.

2. Software Engineering for students, Bell, Pearson Education, Delhi, 4th Edition.
3. Software Engineering, Schaum’s Series, TMH, Delhi, 2003.

Page | 21
IV-SEMESTER
PRACTICALS
Course Code: Course Title: L T P C
DTCP207 Technical Communication 0 0 2 1

The objective of these sessions is to develop the reading, listening, speaking and comprehension skills of
the students with the help of various activities and exercises on software designed for this purpose.

List of Practical

1. Extempore
2. Group Discussions
3. Debates
4. Vocabulary building Games and Exercises
5. Newspaper Reading and discussion of interesting Information
6. Role Play
7. Learning correct Pronunciation
8. Developing Listening and speaking skills
9. Power Point Presentations
10. Software based exercises to improve Grammar

Page | 22
Course Code: Course Title: L T P C
DCSP208 VB .Net 0 0 2 1

List of Practical

1. Write a Visual Basic application for calculator that will perform simple as well as complex
calculations.
2. Write a Visual Basic application for inserting and deleting strings from the list box.
3. Write a visual basic application for displaying the contents of the selected file using the file list
box, directory list box and drive list box.
4. Write a Visual Basic application to make a label to scroll from left to right and vice versa and
change the mouse icon at each of the 8 * 8 cells.
5. Write a Visual Basic application to create a menu editor with cut, copy and paste operations and
search the word in the text.
6. Write a Visual Basic application for a basic designer for drawing Line, Circle, Rectangle, Ellipse
and Triangle.
7. Write a Visual basic application for inserting data into MS Access Database.
8. Write a Visual basic application for fetching data from MS Access Database.
9. Write a Visual basic application for inserting and fetching data from MS Access Database.
10. Write a Visual basic application for communication between two computers on the same network.
(Like Chat servers)

Page | 23
 Course Code: Course Title: L T P C
DCSP209 Web Technology 0 0 2 1

List of Practical

1. Write an HTML program to display your CV on a web page.

2. Write an HTML program to create a Home page having three links: About Us, Our Services and Contact
Us. Create separate web pages for the three links.
3. Write an HTML program to create a login form. On submitting the form, the user should get navigated
to a profile page.
4. Write an HTML program to create a Registration Form. On submitting the form, the user should be asked
to login with this new credentials.
5. Write an HTML program to create your Institute website, Department Website and Tutorial website for
specific subject.
6. Write an HTML program to illustrate the usage of the following:
 Ordered List
 Unordered List
 Definition List
7. Write an HTML program to demonstrate the usage of inline/internal/external CSS.
8. Write a Java script to prompt for users name and display it on the screen.
9. Design HTML form for keeping student record and validate it using Java script.
10. Write an HTML program to design an entry form of student details and send it to store at database
server like SQL, Oracle or MS Access.

Page | 24
Course Code: Course Title: L T P C
DCSP210 Microprocessors and Peripheral Devices 0 0 2 1

List of Practical

1. Familiarization of Assembler (TASM /MASM)

2. Write a program to perform 16-bit addition.
3. Write a program to perform 16-bit subtraction.
4. Write a program to perform 16-bit multiplication.
5. Write a program to perform 16-bit division.
6. Write a program to find the largest number in the given array.
7. Write a program to arrange data in ascending order.
8. Write a program to find the LCM for the given data.
9. Write a program to convert binary code to gray code.
10. Write a program to find the factorial of 8-bit data.

Page | 25
Course Code: Course Title: L T P C
DCSP211 Database Management Systems 0 0 2 1

List of Practical

1. Create database and relations using SQL.

2. Create a relation using primary & foreign keys.
3. Implementation of DDL commands.
4. Implementation of DML commands.
5. Updating the tables and its records.
6. Implement join (left, right, equivalent) operations.
7. Implement Aggregate functions.
8. Implement Scalar functions.
9. Implement Ordering and Grouping functions.
10. Generating nested query.

Page | 26
V-SEMESTER
THEORY
 Course Code: Course Title: L T P C
DCST301 Programming in JAVA 3 1 0 4

UNIT-I 10- LECTURES

Basic concepts of OOP: Objects and Classes, Data abstraction and Encapsulation, Inheritance, Dynamic
binding, Message Passing. Java features, Comparison with C and C++, Java support systems, Java
environment: JDK and API. Java program structure, Java Virtual Machine. Java tokens: Java character set,
Keywords, Identifiers, Literals, Operator, Separators. Constants, Variables, Data types, Scope of variables,
Type casting, Operator precedence and associativity.

UNIT-II 10- LECTURES

Decision making and Branching: if-else statements, switch statement, Conditional operator (? :).
Looping: while, do-while, and for statement. Jumps in loops: break, continue. Classes and Objects: Defining
a class, variables and methods; Creating objects, Access class members. Constructors, Constructor
overloading, Static members, Array, Strings, Vectors, Wrapper classes, Scanner classes, Method
overloading.

UNIT-III 10- LECTURES

Inheritance: singly, multilevel, hierarchical, and hybrid inheritance. Method overriding, final variable and
methods, final classes, finalizer methods, Abstract methods and classes. Interfaces: Defining, extending and
implementing interfaces, accessing interface variables. Packages: Java API packages, System packages,
Naming packages, creating and accessing a package.

UNIT-IV 07- LECTURES

Multithreading: creating threads, stopping and blocking a thread, thread exceptions. Exception handling:
Types of errors, exceptions, Syntax of exception handling, try block, catch block, finally statement, throws,
and throws our own exception.

UNIT-V 08- LECTURES

Applet Programming: Local and remote applets, building applet code, Applet life cycle, creating and
executing applet, designing Web Page, Applet tag, Adding applet to HTML file, Running the applet.
Graphics Programming: Graphics class, Lines, Rectangles, Circles, ellipses, Drawing- arcs, polygons,
graphs. Managing I/O Files in Java: Streams, Stream chasses: byte and character, I/O exceptions.

TEXT BOOKS:

1. Programming with Java: A Primer, E. Balaguruswamy, TMH, 2014, 5th edition.

REFERENCE BOOKS:

1. Java-2 the Complete Reference, Patrick Naughton and HerbertzSchildt, TMH, 9th Edition.
2. Core Java Volume I--Fundamentals, Cay S. Horstmann, Prentice Hall, 9th Edition.
3. Programming with Java, Mahesh Bhave, Pearson Education, 2008, 1st Edition.

Page | 27
 Course Code: Course Title: L T P C
DCST302 Computer Graphics 3 1 0 4

UNIT-I 07-LECTURES
Basics of Computer Graphics Objectives: Demonstrate text mode and graphics mode. Raster scan display,
Random Scan display, Primitive operations: - move to, line to Graphics file formats: Basics, advantages,
disadvantages – BMP – GIF – JPEG – TIFF – PCX, Graphics Mode Functions- Text mode, Graphic mode
Shapes, colors.

UNIT-II 12-LECTURES
Line, circle. Objectives: Draw Lines using various algorithms. Generate circle with various algorithms.
Basic concepts in line drawing, Line drawing algorithms: DDA algorithms, Bresenham’s algorithm,
Generalized Bresenham’s algorithm, Circle generating algorithms: Symmetry of circle, DDA circle
drawing algorithm, Bresenham’s circle drawing algorithm.

UNIT-III 06-LECTURES
Polygons: Display file structure, Draw polygons, Types of polygons, inside –outside test, Polygon filling:
Flood fill, Scanline algorithm.

UNIT-IV 12-LECTURES
Transformations Objectives: Demonstrate 2D transformation techniques Demonstrate 3D transformation
techniques. 2D Transformation: Scaling, Reflection, Shearing, Rotation, Translation, Rotation about an
arbitrary point, 3D Transformation: Scaling, Rotation, Translation, Rotation about arbitrary axis

UNIT-V 08-LECTURES
Windowing & clipping Objectives: Operate on various clipping algorithms. Line clipping: Cohen-
Sutherland Line clipping algorithm, Midpoint subdivision algorithm, Polygon clipping: Sutherland –
Hodgeman Polygon clipping algorithm.

TEXT BOOKS:

1. Theory and problems of Computer Graphics, Roy A Plastock and Gordon Kalley,
Schaum’s Outline series, McGraw Hill Publishers, 2nd Edition.
2. Computer Graphics Programming Approach, Steven Harrington, McGraw-Hill
Education, 2nd Edition.

REFERENCE BOOKS:

1. Computer Graphics for Engineers, A Rajaraman, Narosa Publishing House Pvt Ltd.
Daryaganj, 2012.

Page | 28
 Course Title: L T P C
Course Code:
Data Communication & Computer 3 1 0 4
DCST303
Networks

UNIT-I 10-LECTURES
Introduction to Computer networks: Introduction; Data communications: components, Network
Topology, Type of Communication mediums, data representation, direction of data flow, categories of
network, Internet: brief history, internet today; Protocols and standards; OSI reference model.

UNIT-II 10-LECTURES
Physical layer: Overview of data, signal, transmission & transmission media; TDM, FDM, WDM;
Switching, IEEE standards.

UNIT-III 11-LECTURES
Network Layer: Repeaters, Hubs, Bridges, Switches, Router, Gateway; Addressing: Internet address,
classful address, sub-netting Routing: techniques, static vs. dynamic routing, routing table for classful
address, Congestion control algorithm: Leaky bucket algorithm.

UNIT-IV 7-LECTURES
Data Link Layer: Types of errors, framing, error detection & correction methods; Flow control, error
control.

UNIT-V 7-LECTURES
Application Layer: Data compression, Domain Name System, Simple Network Management Protocol,
Electronic mail, File Transfer Protocol, Hyper Text Transfer Protocol &WWW.

TEXT BOOKS:

1. Data Communication and Networking, Forouzan, TMH, 2011.

REFERENCE BOOKS:

1. Computer Networks, S Tanenbaum, PHI, 5th Edition.

2. Data and Computer Communication, W. Stallings, Macmillan Press, 10th Edition.

Page | 29
 Course Code: Course Title: L T P C
DCST304 Operating Systems 3 1 0 4

UNIT-I 8-LECTURES
Introduction: Operating System and Function, Evolution of Operating System, Batch,
Multiprogramming, Time Sharing and Real Time System, Distributed Operating system, System
Protection, System calls & Interrupt Operating System Structure, System Components, Operating
System Services.

UNIT-II 11-LECTURES
Concurrent Processes: Process Concept, Process states, PCB, Principle of Concurrency, Producer /
Consumer Problem, Critical Section, Problem, Semaphores, Classical Problems in Concurrency, Inter
Processes Communication, Process Scheduling.

UNIT-III 11-LECTURES
CPU Scheduling: Scheduling Concept, Performance Criteria Scheduling Algorithm, Preemptive &
Non-preemptive scheduling algorithms, Multiprocessor Scheduling. Deadlock: System Model,
Deadlock Characterization, Prevention, Avoidance and Detection, Recovery from Deadlock.

UNIT-IV 9-LECTURES
Memory Management: Basic Machine, Resident Monitor, Multiprogramming: Fixed Partition,
Variable Partition, Multiple Base Register, Paging, Segmentation, Paged Segmentation, Virtual'
Memory Concept, Demand Paging, Performance, Paged Replaced Algorithms, Thrashing.

UNIT-V 6-LECTURES
I/O Management & Disk Scheduling: I/O Devices and The Organization of I/O Function, I/O
Buffering, Disk I/O, Operating System Design Issues. File System: File Concept, File Organization
and Access Mechanism, File Directories, File Sharing.

TEXT BOOKS:

1. Operating System Concepts, Abraham Silierschatz, Peter Baer Galvin, Greg Gagne,
Wiley Publication, 9th Edition.

REFERENCES BOOKS:

1. Operating System, Willium Stalling, Pearson, 7th Edition.

2. Linux: The Complete Reference, Richard Peterson, Osborne McGraw-Hill, 6th Edition.

Page | 30
V-SEMESTER
PRACTICALS
Course Code: Course Title: L T P C
DCSP301 Programming in JAVA 0 0 2 1

List of Practical

1. Write a program to print Fibonacci Series:

1, 1, 2, 3, 5, 8, 13 …
2. Write a program to implement ‘Constructor overloading’.
3. Write a program to create object using constructor and also initiate their fields using constructor
of a class.
4. Write a program to pass parameter(s) at Command-Line and also display on screen.
5. Write a program to implement multiple inheritance using interface.
6. Write a program to create your own package named MyPack.
7. Write a program to take input through a keyboard and also display on screen.
8. Write a program to take input as string using Scanner class and display on screen.
9. Write a program to implement multithreading.
10. Write a program to display an arc using applet programming.

Page | 31
Course Code: Course Title: L T P C
DCSP302 Computer Graphics 0 0 2 1

List of Practical

1. Implementation of DDA algorithm for line drawing.

2. Implementation of Bresennham’s algorithm for line drawing.
3. Implementation of Generalized Bresennham’s algorithm for line drawing.
4. Implementation of Bresennham’s algorithm of circle drawing.
5. Write a program to translate triangle, line & a rectangle.
6. Write a program to shearing triangle, line & a rectangle.
7. Write a program to rotate a triangle, line & a rectangle.
8. Write and Implementation of program for rotation about an arbitrary point.
9. Implementation of Cohen- Sutherland algorithm for line clipping.
10. Implementation of midpoint subdivision algorithm for line clipping.

Page | 32
 Course Title: L T P C
Course Code :
Data Communication & Computer 0 0 2 1
DCSP303
Networks

List of Practical

1. Implementation of the Data Link Layer framing method such as character stuffing and bit stuffing.
2. Implementation of CRC algorithm.
3. Implementation of a Hamming (7, 4) code to limit the noise. Perform the code for 4 bit data in to 7 bit
data by adding 3 parity bits.
4. Making Serial and Parallel Patch Cord.
5. Write a socket program to implement a listener and a talker.
6. Simulation of a network of three nodes and measure the performance on the same network.
7. Implement DHCP server using Cisco Packet tracer.
8. Configure RIP (Routing Information Protocol) and OSPF (Open Shortest Path first) in routers using packet
tracer.
9. Implement HTTP and DNS servers using packet tracer.
10. Configure Desktop Firewall for ports, programs and internet protocol addresses.

Course Code: Course Title: L T P C

DCSP304 Operating Systems 0 0 2 1

Page | 33
 List of Practical

1. Practice on DOS commands.

i) General purpose commands.
ii) Directory Related Commands.
iii) File related commands.
2. Practice UNIX, Linux commands. (Execution of various file/directory handling commands:
cat, cp, rm, mv, wc, cmp, pwd, cd, mkdir, rmdir, ls.)
3. Write a Simple shell script for basic arithmetic and logical calculations.
4. Write and execute Even/odd numbers in Linux using shell.
5. Write a script to calculate Simple Interest.
6. Write and execute Prime numbers in Linux using shell.
7. Write and execute Armstrong numbers in Linux using shell.
8. Write and Print a table of any numbers in Linux using shell.
9. Write a script to calculate Average of the five number.
10. Implementation of First come first serve and Shortest Job First scheduling algorithm in C.

Page | 34
VI-SEMESTER
THEORY
 Course Code: Course Title: L T P C
DIMT307 Industrial Management & Entrepreneurship 3 1 0 4

UNIT-I 08-LECTURES
Introduction:
Definition and functions of management. Different Functions: Planning, Organizing, Leading,
Controlling. Organizational Structure, Types, Functions of different departments. Motivation: Factors,
characteristics, methods of improving motivation, incentives, pay, promotion, rewards.

UNIT-II 06-LECTURES
Materials Management:
Introduction, function, purchase systems, stock turn-over, ordered quantity. Inventory, need of inventory
control. Different techniques of inventory control, ABC analysis (simple treatment only). Stores
management - storing procedure and store records.

UNIT-III 06-LECTURES
Production Planning and Control:
Production systems, characteristics of each type, production and consumption rate. PPC functions, Gantt
chart, advantages and preparation of Gantt chart (simple cases only), product design & development,
product life cycle.

UNIT-IV 04-LECTURES
Supervision and Leadership:
Meaning and role of Supervisor in an industry. Older workers and their supervision. Concept of
Leadership, qualities of good leader, leadership styles. Manager VS leader.

UNIT-V 08-LECTURES
Entrepreneurship
Entrepreneurship: definition, Concept of entrepreneur and need of entrepreneurship in the context of
prevailing employment conditions, characteristics and skills. Generating and screening of business ideas.
Project identification and selection. Govt. support to entrepreneurs, Schemes of assistance by
entrepreneurial support agencies at National, State, District level: NSIC, NRDC, DC: MSME, SIDBI,
NABARD, Commercial Banks, SFC’s TCO, KVIB, DIC, Technology Business Incubator (TBI) and
Science and Technology Entrepreneur Parks (STEP). Opportunities and problems of small business in
India. Reasons for the failure of entrepreneurs.

TEXT BOOKS:

1. Industrial Engineering and Management by O.P.Khanna; Dhanpat Rai and Sons, Delhi, 17th
Edition.
2. Entrepreneurship Development in India by CB Gupta and P Srinivasan; Sultan Chand and
Sons, New Delhi, 5th Edition.

REFERENCE BOOKS:

1. Industrial Organization and Management by Tara Chand; Nem Chand and Brothers;
Roorkee, 6th Edition.
2. A Handbook of Entrepreneurship, Edited by BS Rathore and Dr JS Saini; Aapga
Publications, Panchkula (Haryana), 3rd Edition.

Page | 35
 Course Code: Course Title: L T P C
DCST305 Internet & Multimedia 3 1 0 4

UNIT-I 6-LECTURES
Introduction to multimedia, Evolution of Multimedia, Types of Multimedia, Components of Multimedia,
hypertext, hyper graphics, animation, Scope of Multimedia in Business, Multimedia H/W & S/W,
Multimedia storage devices.

UNIT-II 12-LECTURES
Multimedia file format: TXT, PNG, GIF, JPEG, MPEG etc. Compression: Huffman Coding, Shannon-
Fano Algorithm, Adaptive Coding, Arithmetic Coding, Higher Order Modeling, Finite Context Modeling,
Dictionary based Compression, Sliding Window Compression, LZ77, LZW compression, Compression
ratio, loss-less & lossy compression.

UNIT-III 9-LECTURES
Digital Audio concepts, Sampling Variables, Loss less compression of sound, loss compression &
silence compression. Multiple monitors, bitmaps, Vector drawing, lossy graphic compression, image
file formatic animations, Images standards, JPEG Compression, Zig Zag Coding.

UNIT-IV 11-LECTURES
Introduction To Internet: Introduction, History, ARPANET, Intranet & Extranet, Network, How to
Connect to Internet (Dial Up, Broadband, and Leased Line) Devices: Modems, Repeater, and Network
Connecting Devices: Bridges, Routers, Gateways, Client Server model. TCP/IP protocol suite, IP
Addressing.

UNIT-V 7-LECTURES
Internet Services: World Wide Web, EMAIL, Email architecture, Concept of Security: Introduction to
Firewalls, Cyber Laws, Cookies, Hackers and Crackers, Terms of security (Secrecy, Privacy,
Authentication, Authorization, Password protection, File Permissions) only Introduction.

TEXT BOOKS:

1. Fundamentals of Multimedia, Li and Drew, PHI Publications, 2nd Edition.

2. Multimedia Systems, John F. Koegel Buford, Pearson Publication, 2003.

REFERENCE BOOKS:

1. Multimedia an Introduction, William Casanova and Molina, Prentice Hall of India, New
Delhi, 2001.

Page | 36
 Course Code: Course Title: L T P C
DCST306 Network Security 3 1 0 4

UNIT-I 10-LECTURES
Introduction to security attacks, services and mechanism, Classical encryption techniques: substitution
ciphers and transposition ciphers, cryptanalysis, steganography, Stream and block ciphers. Modern Block
Ciphers: Block ciphers principles, Data encryption standard (DES), Strength of DES, Triple DES, block
cipher modes of operations.

UNIT-II 9-LECTURES
Introduction to group, field, finite field of the form GF(p), modular arithmetic, prime and relative prime
numbers, Extended Euclidean Algorithm, Fermat’s and Euler’s theorem, Primality testing, Chinese
Remainder theorem, Discrete Logarithmic Problem, Principals of public key crypto systems, RSA
algorithm, security of RSA

UNIT-III 10-LECTURES
Message Authentication Codes: Authentication requirements, authentication functions, message
authentication code, hash functions, birthday attacks, security of hash functions, Secure hash algorithm
(SHA), Digital Signatures, Digital signature standards (DSS)

UNIT-IV 9-LECTURES
Key Management and distribution: Symmetric key distribution, Diffie-Hellman Key Exchange, Public key
distribution, Electronic mail security: pretty good privacy (PGP), S/MIME.

UNIT-V 7-LECTURES
IP Security: Architecture, Authentication header, Encapsulating security payloads, combining security
associations, key management. Introduction to Secure Socket Layer, Secure electronic transaction (SET).
System Security: Introductory idea of Intrusion, Intrusion detection, Viruses and related threats, firewalls

TEXT BOOKS:

1. Cryptography and Network Security: Principals and Practice, William Stallings, Pearson
Education, 2nd Edition.

REFERENCE BOOKS:

1. Network Security and Cryptography, Bernard Menezes, Cengage Learning, 2011.

2. Cryptography and Network Security, Atul Kahate, McGraw Hill Education, 3rd Edition

Page | 37
STUDY & EVALUATION SCHEME
 SWAMI RAMA HIMALAYAN UNIVERSITY
Faculty of Engineering & Technology
Study and Evaluation Scheme: Polytechnic Diploma Programme-Computer Science & Engineering
1 YEAR SEM-I
EVALUATION SCHEME
PERIODS
COURSE CODE THEORY CONTACT CREDITS
CATEGOR Lab/Seminar/ Project
S.No. COURSE TITLE GRAND HOURS (L+
Y
CIE- CIE- TOTAL T+P)
Lab/Seminar/ L T P TA ESE TOTAL Lab/Seminar/
Theory I II INTERNAL ESE TOTAL Theory Total
Project Project
1 DPHT101 DPHP101 AS Physics-I 3 0 2 20 20 10 100 150 20 30 50 200 5 3 1 4
2 DCHT102 DCHP102 AS Chemistry-I 3 0 2 20 20 10 100 150 20 30 50 200 5 3 1 4
3 DMAT103 AS Mathematics-I 3 1 0 20 20 10 100 150 0 0 0 150 4 4 0 4
DEET104/DM DEEP104/DMCP10 Basic Electrical & Electronics Engineering/
4 BE 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
CT105 5 Basic Mechanical & Civil Engineering
Fundamentals of Information Technology
5 DCST106 DCSP106 BE 3 0 2 20 20 10 100 150 20 30 50 200 5 3 1 4

English Language & Communication

6 DELT107 DELP107 HS 2 0 2 20 20 10 50 100 20 30 50 150 4 0 0 0
Skills**
DWPP108/DEDP1
7 TA Workshop Practice/Engineering Drawing 1 0 4 0 0 0 0 0 50 50 100 100 5 1 2 3
09
8
DJLP110/DYHP11 Science of Joyful Living/Yoga & Health
GS 0 0 2 0 0 0 0 0 25 25 50 50 2 0 0 0
0/DSAP110 /Sports Activities*

TOTAL 18 2 16 120 120 60 550 850 175 225 400 1250 36 18 6 24

1 YEAR SEM-II
EVALUATION SCHEME
PERIODS
COURSE CODE THEORY CONTACT CREDITS
CATEGOR Lab/Seminar/ Project
S.No. COURSE TITLE GRAND HOURS (L+
Y
CIE- CIE- TOTAL T+P)
Lab/Seminar/ L T P TA ESE TOTAL Lab/Seminar/
Theory I II INTERNAL ESE TOTAL Theory Total
Project Project
1 DPHT111 DPHP111 AS Physics-II 3 0 2 20 20 10 100 150 20 30 50 200 5 3 1 4
2 DCHT112 DCHP112 AS Chemistry-II 3 0 2 20 20 10 100 150 20 30 50 200 5 3 1 4
3 DMAT113 AS Mathematics-II 3 1 0 20 20 10 100 150 0 0 0 150 4 4 0 4
DMCT105/D DMCP105/DEEP10 Basic Mechanical & Civil
4 BE 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
EET104 4 Engineering/Basic Electrical & Electronics
5 DCST114 DCSP114 BE Engineering
Programming using 'C' language 3 0 2 20 20 10 100 150 20 30 50 200 5 3 1 4
DEDP109/DWPP1
6 TA Engineering Drawing/Workshop Practice 1 0 4 0 0 0 0 0 50 50 100 100 5 1 2 3
08
7 DJLP110/DYHP11 Science of Joyful Living/ Yoga &
GS 0 0 2 0 0 0 0 0 25 25 50 50 2 0 0 0
0/DSAP110 Health/Sports Activities*
TOTAL 16 2 14 100 100 50 500 750 155 195 350 1100 32 18 6 24
L:Lecture, T:Tutorial, P:Practical, CIE: Continuous Internal Evalutaion, TA:Teacher's Assessment(A/S/P/Q: Assignment/Seminar/Presentation/Quiz) ESE:End Semester Examination
* AUDIT COURSE (The purpose of AC is to supplement the knowledge/skills only.Grade indicated in the grade sheet shall be pass/fail. )
**COMPULSORY AUDIT COURSE is a compulsory non-credit course and students shall be required to obtain the pass grade within their programme of study for award of degree.

Page | 38
 2 YEAR SEM-III
EVALUATION SCHEME
PERIODS
COURSE CODE THEORY CONTACT CREDITS
CATEGOR Lab/Seminar/ Project
S.No. COURSE TITLE GRAND HOURS (L+
Y CIE- CIE-
Lab/Seminar/ L T P TA ESE TOTAL TOTAL T+P) Lab/Seminar/
Theory I II INTERNAL ESE TOTAL Theory Total
Project Project
1 DMAT201 AS Applied Mathematics 3 1 0 20 20 10 100 150 0 0 0 150 4 4 0 4
2 DCST202 DCSP202 CS Object Oriented Programming Using C++ 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
3 DCST203 DCSP203 CS Data Structures Using C 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
4 DCST204 DCSP204 CS Digital Electronics 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
5 DCST205 DCSP205 CS Computer Hardware 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
6 DCST206 CS Computer Organization 3 1 0 20 20 10 100 150 0 0 0 150 4 4 0 4
TOTAL 18 6 8 120 120 60 600 900 80 120 200 1100 32 24 4 28

2 YEAR SEM-IV
EVALUATION SCHEME
PERIODS
COURSE CODE THEORY CONTACT CREDITS
CATEGOR Lab/Seminar/ Project
S.No. COURSE TITLE GRAND HOURS (L+
Y CIE- CIE-
Lab/Seminar/ L T P TA ESE TOTAL TOTAL T+P) Lab/Seminar/
Theory I II INTERNAL ESE TOTAL Theory Total
Project Project
1 DTCT207 DTCP207 HS Technical Communication 2 0 2 20 20 10 50 100 20 30 50 150 4 2 1 3
2 DCST208 DCSP208 CS VB . Net 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
3 DCST209 DCSP209 CS Web Technology 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
4 DCST210 DCSP210 CS Microprocessors & Peripheral Devices 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
5 DCST211 DCSP211 CS Database Management Systems 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
6 DCST212 CS Software Engineering 3 1 0 20 20 10 100 150 0 0 0 150 4 4 0 4
TOTAL 17 5 10 120 120 60 550 850 100 150 250 1100 32 22 5 27

Page | 39
 3 YEAR SEM-V
EVALUATION SCHEME
PERIODS
COURSE CODE THEORY CONTACT CREDITS
CATEGOR Lab/Seminar/ Project
S.No. COURSE TITLE GRAND HOURS (L+
Y CIE- CIE-
Lab/Seminar/ L T P TA ESE TOTAL Lab/Seminar/
Theory I II INTERNAL ESE TOTAL TOTAL T+P) Theory Total
Project Project
1 DCST301 DCSP301 CS Programming in JAVA 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
2 DCST302 DCSP302 CS Computer Graphics 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
Data Communication & Computer
3 DCST303 DCSP303 CS 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5
Networks
4 DCST304 DCSP304 CS Operating Systems 3 1 2 20 20 10 100 150 20 30 50 200 6 4 1 5

Synopsis, Literature
DPWP301 or Project Work Phase-I or Induction
5 PS Survey & 50 External Assessment 100 150 0 6 6
DPIL301 program for Industry-Based Learning
Presentation

6 DPDP301 PS Personality Development Programme-I 0 0 2 0 0 0 0 0 0 0 0 0 2 0 0 0

7 5-6 Week Industrial Traininig/Certification Report and Seminar
DITP301 PS 100 0 5 5
TOTAL 12 4 10 80 80 40 400 650 80 120 300 1050 26 16 15 31

3 YEAR SEM-VI
EVALUATION SCHEME
PERIODS
COURSE CODE THEORY CONTACT CREDITS
CATEGOR Lab/Seminar/ Project
S.No. COURSE TITLE GRAND HOURS (L+
Y CIE- CIE-
Lab/Seminar/ L T P TA ESE TOTAL TOTAL T+P) Lab/Seminar/
Theory I II INTERNAL ESE TOTAL Theory Total
Project Project
Report analysis,
1 DPWP302 PS Project Work Phase-II Implementation & 100 External Assessment 200 300 0 12 12
Presentation

2 DIMT307 MS Industrial Management & Entrepreneurship 3 1 0 20 20 10 100 150 0 0 0 150 4 4 0 4

3 DCST305 CS Internet & Multimedia 3 1 0 20 20 10 100 150 20 30 50 200 4 4 0 4

4 DCST306 CS Network Security 3 1 0 20 20 10 100 150 20 30 50 200 4 4 0 4
5 DPDP302 PS Personality Development Programme-II 0 0 2 0 0 0 0 0 0 0 0 0 2 0 0 0
TOTAL 9 3 2 60 60 30 300 550 40 60 300 850 14 12 12 24
Report analysis,
1 DPIL302 Industry-Based Learning Program Implementation & 100 External Assessment 200 300 0 24 24
Presentation

Page | 40
 COURSE CATEGORY

AS Applied Sciences GS General Sciences

BE Basic Engineering HS Humanities & Social Studies Semester I II III IV V VI Total
Credits
CE Civil Engineering IT Information Technology
Credits 24 24 28 27 31 24 158
Computer
CS ME Mechanical Engineering
Science
Electronics &
EC PS Professional Studies
Communication

Electrical
EE TA Technical Art
Engineering
MS Management Studies

Page | 41
 Assessment: Internal

Grading of the students shall be carried-out course-wise for theory and practical
courses, separately. Marks obtained by the students in each evaluation component
of CCEA shall be normalized on the scale of 100 (hundred) marks. The final
composite score in a course shall be calculated by adding the normalized marks in
the following proportion of weightages so that the total percentage of the
components taken together is 100 (hundred):

Theory Components

Name of the Evaluation Component Weightages(in %age)

CIE-I 15%
CIE-II 15%
Teacher’s Assessment 20%
End Semester Examination 50 %

Practical Components

Name of the Evaluation Component Weightages(in %age)

Internal Evaluation 50%
End Semester Examination 50%

Subsequently, the combination of absolute and relative method, based on percentage

(as defined in course-wise grading) and values of statistical parameters (mean and
standard deviation), shall be used on normalized marks obtained by all the registered
students in a course and accordingly grades shall be awarded.
A student who fails in any course in the first attempt but clears the course at later
date shall not be awarded the grade over and above ‘C’ grade.

Page | 42
 Swami Rama Himalayan University
Himalayan School of Engineering & Technology
Continious Internal Evaluation-I

Even/Odd Semester, Session………….

ENROLL. NO. REG.NO.

Name of the Programme: Semester:

COURSE CODE: COURSE TITLE:

MAXIMUM TIME:90 MIN MAXIMUM MARKS: 20 DATE OF EXAM: DD-MM-YY

Note: All Questions are compulsory (Each question carries 5 marks)

Q 1.

Q 2.

Q 3.

Q 4.

Page | 43
 Internal laboratory

Practical Components: There are two components to evaluate the laboratory performance for a
student.

Name of the Evaluation Component Weightages(in %age)

Internal Evaluation 50%
End Semester Examination 50%

Internal Examination:

The internal assessment for a course with laboratory session, shall be done on regular basis as per
the course plan.

Day to Day Performance:

Internal Practical Examination shall be based on day to day performance, experiments conducted
in a semester as per the course plan -10 MARKS

A Record File shall be maintained based on the experiments conducted in a semester as per the
course plan. -05 MARKS

Day to Day performance includes viva-voce based on the experiments conducted in a semester as
per the course plan. -05 MARKS

Page | 44
 Swami Rama Himalayan University
Himalayan School of Engineering & Technology

Suggested Guidelines for setting of End Semester Examination

MAXIMUM TIME: 3 HRS MAXIMUM MARKS: 100

Sections Description Marks

Section A  Will comprise of 10 Brief Answer Questions. 20 marks

 Student has to attempt all 10 questions.
 To be answered in not more than 1 or 2 sentences. [10 x 2]
 Can be Objective type like: Fill in the blank/multiple choice/True-False
etc.
 Intended to judge their elementary awareness about the topic

Section B  Will comprise of 7 Medium Answer Questions. 35 marks

 Student has to attempt any 5 questions
 To be answered in not more than one page each [5 x 7]
 Intended to judge their analytical approach towards the topic.

Section C  Will comprise of 5 Long Answer Questions 45 marks

 Student has to attempt any 3 questions
 There can be a further breakdown of each long answer in this section. If [3 x 15]
required, these 15 marks can be divided further as:
10+5 OR 7+8
 Intended to judge the in-depth knowledge of the student.

Page | 45
 Swami Rama Himalayan University
Himalayan School of Engineering & Technology
End Semester Examination
Even/Odd Semester, Session…………….

ENROLL. NO. REG.NO.

Name of the programme: Semester:

COURSE CODE: COURSE TITLE:
MAXIMUM TIME: 3 HRS MAXIMUM MARKS: 100 DATE OF EXAM:

Instructios to the candidates:

1. This question paper contains total three sections.
2. All the three sections are compulsory.
3. Each question of every section carries equal marks.

Section (A) (20 Marks)

Q 1. Attempt all questions. Each question carries 2 marks.
a.
b.
c.
d.
e.
f.
g.
h.
i.
j.
Section (B) (35 Marks)
Q 2. Attempt any 5 questions. Each question carries 7 marks.
a.
b.
c.
d.
e.
f.
g.

Section (C) (45 Marks)

Attempt any 3 questions. Each question carries 15 marks.
Q 3. (a)
(b)
Q 4. (a)
(b)
Q 5. (a)
(b)
Q 6. (a)
(b)
Q 7. (a)
(b)

Page | 46
 Swami Rama Himalayan University
Himalayan School of Engineering & Technology
End Semester Examination
Even/Odd Semester, Session…………..

ENROLL. NO. REG.NO.

Name of the programme: Semester:

COURSE CODE: COURSE TITLE:
MAXIMUM TIME: 2 HRS MAXIMUM MARKS: 50 DATE OF EXAM:

Instructios to the candidates:

1. This question paper contains total three sections.
2. All the three sections are compulsory.
3. Each question of every section carries equal marks.

Section (A) (10 Marks)

Q 1. Attempt all questions. Each question carry 1 marks.

a.
b.
c.
d.
e.
f.
g.
h.
i.
j.

Section (B) (20 Marks)

Q 2. Attempt any 4 questions. Each question carries 5 marks.

a.
b.
c.
d.
e.
f.

Section (C) (20 Marks)

Attempt any 2 questions. Each question carries 10 marks.

Q 3. (a)
(b)

Q 4. (a)
(b)

Q 5. (a)
(b)

Page | 47
 External laboratory

Practical Components: There are two components to evaluate the laboratory performance for a
student.

Name of the Evaluation Component Weightages(in %age)

Internal Evaluation 50%
End Semester Examination 50%

External Examination:
For a course with laboratory session, the End Semester Practical Examination shall be based on
day to day performance, experiments conducted in a semester as per the course plan and viva voce.

Write-Up & Execution:

End Semester Practical Examination shall be based on day to day performance, experiments
conducted in a semester as per the course plan. -10 MARKS

Record:
A Record File shall be maintained based on the experiments conducted in a semester as per the
course plan. -10 MARKS

Viva-voce:
End Semester Practical Examination shall be based on viva-voce. -10 MARKS

Page | 48
 Final Letter signed by all experts for
Polytechnic- Diploma in Computer Science & Engineering

………................................... ………...................................
(Dr. Praveena Chaturvedi- ( Ms. Geeta Joshi-External
External Expert, Computer Expert, Computer Science &
Science & Engineering) Engineering)

………...................................... ………...................................
(Dr. Girish Kumar Anand- Member) (Dr. H.S. Payal-Member)

………......................................
(Dr. R. C. Ramola-Chairman)

Page | 49