Syllabus of Diploma (RGPV) II-Year, Computer Science Engineering
Table of Contents
ToggleSEMESTER III
COMPUTER PROGRAMMING
PAPER CODE : 7481 SUBJECT CODE : 301
UNIT-1:
- Introduction to Problem Solving (computational way of thinking);
- Variables and Representation
UNIT-2:
- Arithmetic, Relational, Logical and Bitwise Operators;
- Input, Output, Formatting and File I/O
UNIT-3:
- Conditional Statements, Repeat Statements,
- Loops and Nested Loops
UNIT-4:
- Arrays and Memory Organization, Strings,
- Multidimensional Arrays, Functions and Parameter Passing
UNIT-5:
- Recursion and Recursive solutions
SCRIPTING LANGUAGES
PAPER CODE : 7482 SUBJECT CODE : 302
UNIT-1: Introduction, Variables and Data Types
- History, Features, Setting up path, Installation and Working with Perl/Python, Basic Syntax
- Understanding Perl/Python variables, Numeric data types, Using string data type and string operations, Basic Operators,
- Understanding coding blocks, Defining list and list slicing,
- Other Data Types (Tuples, List, Dictionary -Python, Arrays, Associative Arrays/Hashes – Perl)
UNIT-2: Control Structures
- Conditional blocks using if, else and elif, For loops and iterations, while loops,
- Loop manipulation using continue, break and else (and pass in Python),
- Programming using conditional and loops block
UNIT-3: Functions, Modules and Packages
- Organizing Perl/Python codes using functions, Organizing Perl/Python projects into modules,
- Importing own module as well as external modules, Understanding Packages
UNIT-4: File I/O, Text Processing, Regular Expressions
- Understanding read functions,
- Understanding write functions,
- Programming using file operations,
- Powerful pattern matching and searching,
- Power of pattern searching using regex
UNIT-5: Frameworks
- Frameworks – Web2Py, Django,
- Ruby on Rails, Struts (any one of these or any other)
DATA STRUCTURES
PAPER CODE : 7483 SUBJECT CODE : 303
UNIT-1: Introduction to Data Structures
- Basic Terminology,
- Classification of Data Structures,
- Operations on Data Structures.
UNIT-2: Linear Data Structures
- Stacks: Introduction to Stacks, Array Representation of Stacks, Operations on a Stack,
- Applications of Stacks-Infix-to-Postfix Transformation, evaluating Postfix Expressions.
- Queues: Introduction to Queues, Array Representation of Queues, Operations on a Queue,
- Types of Queues-DeQueue, Circular Queue,
- Applications of Queues-Round Robin Algorithm.
UNIT-3: Linked Lists
- Singly Linked List, Representation in Memory, Operations on a Single Linked List,
- Circular Linked Lists, Doubly Linked Lists,
- Linked List Representation and Operations of Stack,
- Linked List Representation and Operations of Queue.
UNIT-4: Non Linear Data Structures
- Trees: Basic Terminologies, Definition and Concepts of Binary Trees, Representations of a Binary Tree using Arrays and Linked Lists,
- Operations on a Binary Tree-Insertion, Deletion, Traversals, Types of Binary Trees.
- GRAPHS: Graph Terminologies, Representation of Graphs- Set, Linked, Matrix, Graph Traversals
COMPUTER SYSTEM ORGANISATION
PAPER CODE : 7484 SUBJECT CODE : 304
UNIT-1: Structure of Computers
- Computer Functional units, Von-Neumann architecture, Bus structures, Basic Operational Concepts,
- Data representation (Fixed and Floating point), Error detecting codes.
- Register Transfer and Micro Operations: Register transfer, Bus and memory transfers,
- Arithmetic micro-operations, Logic micro-operations, Shift micro-operations, and Arithmetic logic shift unit.
UNIT-2: Micro Programmed Control
- Control memory, Address sequencing, and design of control unit.
- Computer Arithmetic: Addition and Subtraction, Multiplication and Division algorithms,
- Floating point arithmetic operation, Arithmetic Pipeline, Instruction Pipeline,
- RISC Pipeline Vector Processing, Array Processors.
UNIT-3: Introduction to Microprocessor
- Architecture: Instruction Set Architecture design principles from programmer’s perspective.
- One example microprocessor (Intel, ARM, etc).
UNIT-4: Assembly Language Programming
- Simple programs, Assembly language programs involving logical, branch and call instructions,
- sorting, evaluation of arithmetic expressions,
- string manipulation, assembler directives, procedures and macros.
UNIT-5: Memory and Digital Interfacing addressing
- Memory and Digital Interfacing addressing and address decoding,
- interfacing RAM, ROM, EPROM, programmable peripheral interface,
- various modes of operation and interfacing to processor, interfacing keyboard, displays, etc.
ALGORITHMS
PAPER CODE : 7485 SUBJECT CODE : 305
UNIT-1: Fundamentals
- Programming Models.
- Data Abstraction.
- Sets, Multisets, Stacks, Queues.
- Asymptotic and worst-case analysis of algorithms.
UNIT-2: Sorting
- The sorting problem.
- Bubble sort, Selection sort, Insertion sort, Mergesort, Quicksort.
UNIT-3: Searching
- Symbol Tables, Binary Search Trees, Balanced Search Trees.
- Hash Tables.
UNIT-4: Graphs
- Definition of a directed and undirected graph.
- Paths, Cycles, spanning trees.
- Directed Acyclic Graphs.
- Topological Sorting.
- Minimum Spanning Tree algorithms.
- Shortest Path algorithms: Dijkstra’s algorithm.
- Flow-based algorithms.
UNIT-5: Strings
- String Sort.
- Substring Search.
- Regular Expressions.
- Elementary Data compression.
==End of Syllabus==