PGDCA Syllabus HP University

I want to take admission in Post Graduate Diploma in Computer Application (PGDCA) course at Himachal Pradesh University . Provide the overview of PGDCA Syllabus .

[Quick Sam]

Himachal Pradesh University offers one year Post Graduate Diploma in Computer Application (PGDCA) course .
Himachal Pradesh University PGDCA syllabus
SEMESTER –I
Course
Code
Paper Max. Marks
Theory
Internal
Assess.
Exams.
Duration (Hrs.)
DCS-101 Fundamentals of Programming
Using C
75 25 3
DCS-102 PC Software 75 25 3
DCS-103 Operating system 75 25 3
DCS-104 Computer Organization and
Architecture
75 25 3
DCS-105 Practical-I ( C Language) 50 50 3
DCS-106 Practical-I I (PC Software) 50 50 3
SEMESTER –II
DCS-201 Data and File Structure 75 25 3
DCS-202 System Analysis and Design 75 25 3
DCS-203 Object Oriented Programming & C ++ 75 25 3
DCS-204 Data base Management system 75 25 3
DCS-205 Practical-III (DFS Using C ++ 75 25 3
DCS-206 Practical-IV (Data base Management
system)
75 25 3
DCS-207 Project Work 200 - -
The project should be involve development of application software for some industry/ Institute
DCS – 101 Fundamentals of Programming Using C
PART–A
Programming Tools: Problem analysis, Program constructs (sequential, decision,
loops), Algorithm, Flowchart, Pseudo code, Decision table, Modular programming, Top
Down and Bottom up approaches, Concept of High Level Languages, Low Level
Languages, Assembly Languages, Compiler, Interpreter, Type of errors.
Overview of C: General structure of C Program.
Data types, Operators and expressions: Constants and Variables, Data types,
Declaring Variables, Storage Classes, Different types of expressions and their Evaluation,
Conditional Expression, Assignment statement, Enumerated data type, Redefining/
Creating data types, Library functions, Type casting.
Input/Output: Unformatted and formatted I/O Functions (Character and strings
I/O, Scanf ( ), Printf ( ) )
Control Statements: Decision making using if, if-else, elseif and switch
statements, Looping using for, while and do-while statements, Transferring Program
controlling break and continue statements, Programming examples to illustrate the use of
these control statements.
PART-B
Pointers: Definition, Need of pointers, declaring Pointers, Accessing Values via
Pointers, Pointer arithmetic, Types of pointers.
Array & strings: Introduction to arrays, Declaring arrays, Initializing arrays,
Processing arrays, Pointers to arrays, Passing arrays as arguments to functions,
Introduction to strings, Pointers to strings, Passing strings and Arrays of strings as
arguments to a function, Programming examples to illustrate the use of arrays and strings.
Functions: Defining a function, Local variables, return statement, invoking a
Function, specifying and passing arguments to a function, Functions returning non
Integer, External, static, and register variable, block structure, initialization and recursion.
Structures: Declaring a structure type, Declaring Variables of structure type,
Initializing Structures, Accessing Elements of structures, arrays of structures, nested
structures, Pointers to structures.
Text Books:
1. Mullis Cooper: Spirit of C: Jacob Publications
2. Yashwant Kanetkar: Let us C: BPB
Refrence Books:
1. Kerninghan B.W. & Ritchie D. M.: The C Programming Language: PHI
2. Yashwant Kanetkar: Pointers in C: BPB
3. Gotterfied B.: Programming in C: Tata McGraw Hill
Note:
1. Each theory paper shall be of 3 hours duration and shall carry 100 marks (75 marks
for written semester examination and 25 for internal assessment).
2. In all 8 question will be set three from PART -A and four from PART - B of the
syllabus. Question no. 8 will be compulsory covering the entire syllabus of at least 5
parts.
3. Examinees will attempt five questions in all. Two each from PART-A and PART-B.
Question no. 8 will be compulsory.
DCS – 102 PC SOFTWARE
PART-A
Operating system concept: Duties, Responsibilities and functions of an Operating
system, General understanding of different Operating System Environment (Single user
system, Multi user system, Graphical user interface system, character based system).
Disk Operating System: Concept of Files and Directories, Internal commands,
External commands, Batch Files, Filters, Redirection, Macros, Wild Card character
Booting Process, Configuration Files (Config.Sys)
General Understanding Of Facilities, Features Of Windows Explorer, Control
Panel Setting, Accessories, Recycle Bin.
Computer Virus: Prevention, Detection, Cure.
PART-B
Word Processing Concepts: Definition, Benefits, Facilities & Features in general.
MS- Office 97:
MS-Word 97:Word processing using MS-WORD, File handling, Editing,
Formatting, spell checking, Mail merge & Table handling & Insertion, importing,
exporting & object linking embedding, printing operation.
Spreadsheet: features, uses & benefits in general.
MS-Excel 97: Entering data & selecting cells, editing worksheet data, formatting
worksheet, creating Formulae, function & charts /graphs, multi operation, data base
management.
Presentation Tools: features, uses & benefits in general.
MS Power Point: Creating & saving presentation templates & view (slide view,
notes view, outline view, slide show) Formatting text, slides & graphs, animations, slides
transition, multi operation.
Text Books:
1. A.L.STEVENS: Teach Yourself Windows.
2. A.L.STEVENS: Teach Yourself DOS.
3. JONATHAN KAMIN: DOS-7.
4. R.K.TAXALLI: Intro to software package, Galgotia publication.
5. RAJIV MATTUS: dos quick reference , Galgotia .
6. RAJIV MATTUS: Learning Word 97 for windows step by step BPB publication.
7. RAJIV MATTUS: Learning Excel 97 for windows step by step BPB publication
8. RAJIV MATTUS: Learning window 98 step by step BPB publication
9. LONNIE .E. MOSELEY& DAVID M.BOODEY: Mastering office 97.
10. MICRO SOFT OFFICE 97: Unleashed : Techmedia.
11. JOHN WALKEN BACH: Excel 97
Note:
1. Each theory paper shall be of 3 hours duration and shall carry 100 marks (75 marks
for written semester examination and 25 for internal assessment).
2. In all 8 question will be set three from PART -A and four from PART - B of the
syllabus. Question no. 8 will be compulsory covering the entire syllabus of at least 5
parts.
3. Examinees will attempt five questions in all. Two each from PART-A and PART-B.
Question no. 8 will be compulsory.
DCS – 103 OPERATING SYSTEM
PART-A
Introduction: Definition Of The Operating System, Functions Of An Operating
System, Different Types Of Systems - Simple Batch System, Multi-Programmed Batched
System, Time Sharing System, Personal Computer Systems, Parallel Systems,
Distributed Systems, Real Time Systems.
Process Management: Process- Process Concept, Process Scheduling, Operation
On Processes, Cooperating Processes, Threads, Inter-Process Communication, CPU
Scheduling–scheduling criteria, scheduling algorithms – FCFS, SJF, priority scheduling,
round robin scheduling, multilevel queue scheduling, multilevel feedback queue
scheduling, multiple processor scheduling, real time scheduling.
Deadlocks: Deadlock Characterization, Methods For Handling Deadlocks,
Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery From
Deadlock.
PART-B
Memory Management: Logical & physical address space, Swapping, Continuous
Allocation (single partition, multiple partition), internal, external fragmentation, Paging,
Segmentation, Segmentation With Paging, Virtual Memory, Demand Paging,
Performance Of Demand Paging, Page Replacement, Page Replacement Algorithms–
FIFO, optimal, LRU, LRU approximation algorithms, counting algorithms Thrashing,
Demand Segmentation.
File System Interface: File Concept, Access Methods–sequential, direct, index,
Directory Structure–single-level, two–level, tree-structured, acyclic-graph, general graph.
File System Implementation: File System Structure, Allocation Methodscontiguous
allocation, linked allocation, indexed allocation, Secondary Storage Structure:
Disk Structure, Disk Scheduling, FCFS, SSTF, SCAN, C-SCAN, Look Scheduling,
Selection of A Scheduling Algorithm, Disk Management-disk formatting, boot block, bad
blocks.
Text Books:
1. Silberschatz, Galvin “Operating System Concepts”, Addison Wesley Publishing
Company, 1989.
Reference Books:
1. William Stallings, “Operating Systems”, Macmillan Publishing Company.
2. Deitel H.M., “An Introduction To Operating System”, Addison Wesley Publishing
Company, 1984.
3. Tanenbaum, A.S., “Modern Operating System”, Prentice Hall of India Pvt. Ltd. 1995.
Note:
1. Each theory paper shall be of 3 hours duration and shall carry 100 marks (75 marks
for written semester examination and 25 for internal assessment).
2. In all 8 question will be set three from PART -A and four from PART - B of the
syllabus. Question no. 8 will be an objective/short answer type question.
3. Examinees will attempt five questions in all. Two each from PART-A and PART-B.
Question no. 8 will be compulsory.
DCS – 104 COMPUTER ORGANISATION and ARCHITECTURE
PART-A
Basics: Organization & Architecture, Structure & Function, A brief history,
mechanical & electromechanical ancestors, First, Second, Third & later generations, Van-
Neumann Machine, Block diagrams of computer system.
Register transfers & micro-operations: Register Transfer Language, Register
transfer, Bus & memory transfers, Arithmetic loops, Logic loops, Shift loops, Arithmetic,
logic, shift unit.
Basic computer organization & design: Instruction codes, Computer registers,
Computer Instructions, Timing & Control, Instruction cycle, memory reference
instruction, I-O interrupt, Design of basic computer, Design of accumulator logic.
Micro-programmed Control: Control Memory, Address sequencing, Design of
control unit.
Central Processing Unit: General Register Organization, Stack organization,
Instruction formats (zero, one, two, three), Address Instructions, Addressing Modes
(direct, indirect, Immediate, relative, indexed), Data transfer & manipulation, Program
control, RISC.
Computer Arithmetic: Addition & Subtraction, Multiplication algorithms,
Division Algorithms, Floating point arithmetic operations,
PART -B
IO Organization: Peripheral devices, I/O interfaces, asynchronous data transfer,
Modes of Data transfer, Priority Interrupts, DMA, I-O processors, Serial Communication.
Memory Organization: Memory Hierarchy, Main Memory, Associative Memory,
Cache Memory, Virtual Memory, Memory management hardware.
Multiprocessors: Characteristics, Interconnection structures: Time shared,
Common bus, Multi-port, Crossbar switch, Multistage, Inter-processor arbitration, Interprocessor
communication & synchronization, cache coherence, multiprocessing, vector
computation, Fault tolerant systems.
RISC: Instruction execution characteristics, Use of large register files, Computer
based Register optimization, Reduced instruction set architecture, RISC pipeline.
Text Books:
1. Morris M. Mano: Computer System & Architecture: PHI.
2. Stallings & Williams: Computer Organization & Architecture: Maxwell Macmillan.
Reference Books:
1. V.Rajaraman & Radhakrishnan: Introduction to Digital Computer Design: PHI
2. P.Pal Chowdhary: Computer Organization & Design: PHI
Note:
1. Each theory paper shall be of 3 hours duration and shall carry 100 marks (75 marks
for written semester examination and 25 for internal assessment).
2. In all 8 question will be set three from PART -A and four from PART - B of the
syllabus. Question no. 8 will be compulsory covering the entire syllabus of at least 5
parts.
3. Examinees will attempt five questions in all. Two each from PART-A and PART-B.
Question no. 8 will be compulsory.
DCS – 201 DATA and FILE STRUCTURE
PART - A
Preliminaries: Concept & notation, common operation on data structures,
algorithm complexity, time-space trade off between algorithm, physical & logical
representation of different data structures.
Arrays: Arrays defined, representing arrays in memory, Various operation
(traversal, insertion, deletion), Multidimensional arrays, Sequential allocation, Address
calculation, Sparse arrays.
Linked List: Definition, type (linear, circular, doubly linked, inverted),
representing linked lists in memory, advantages of using linked list over arrays, various
operations on Linked list (traversal, insertion, deletion).
Stacks: Definition & concepts of stack structure, Implementation of stacks,
Operation on stacks (push & pop), Application of stacks (converting arithmetic
expression from infix notation to polish and their subsequent evaluation), quick sort
technique to sort an array, recursion).
PART – B
Queue: Definition & concept of queues, implementation of queue, operation on
queues (insert & delete), Type of queues (circular queue, priority queue).
Trees Structures: Tree, Binary Trees, Tree Traversal Algorithms (Pre-Order, In-Order,
Post-Order), Threaded Trees, Trees in various Sorting & Searching Algorithms & their
Complexity (Heap Sort, Binary Search Trees).
Sorting & Searching: Selection sort, Bubble sort, Merge sort, Radix sort, Quick
sort, Sequential search, Linear search and their complexity.
Text Books:
1. Jean Paul Tremblay & Paul G. Sorenson: An Introduction to Data Structures with
Applications: Tata McGraw Hill.
2. Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augenstein: Data Structures
using C: PHI
Refrence Books:
1. Robert L. Kruse: Data Structures & Program Design: PHI
2. Aho, Hopcroft & Ullman: Data Structures and Algorithms: Addison Wesley.
3. T.A. Standish: Introduction to Data Structures.
4. Nell Dale & Susan C. Lilly: Pascal Plus Data Structures, Algorithms and Advanced
Programming: Galgotia.
Note:
1. Each theory paper shall be of 3 hours duration and shall carry 100 marks (75 marks
for written semester examination and 25 for internal assessment).
2. In all 8 question will be set three from PART -A and four from PART - B of the
syllabus. Question no. 8 will be compulsory covering the entire syllabus of at least 5
parts.
3. Examinees will attempt five questions in all. Two each from PART-A and PART-B.
Question no. 8 will be compulsory.
For detailed syllabus , here is the attachment;