Download Batch 2013 ,2014 Only Guru Kashi University, Talwandi Sabo

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Database model wikipedia , lookup

Object-relational impedance mismatch wikipedia , lookup

Transcript
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
Fundamentals of Operating System(304101)
Credits -05
L
4
T P
1 0
Course Contents
Unit-I
History of Operating Systems : Zeroeth Generation : Mechanical Parts; First Generation (19451955): Vaccum Tubes; Second Generation (1955 – 1965): Transistors; Third Generation (1965 –
1980) : Integrated Circuits; Fourth Generation (1980 – 1990) : Large Scale Integration.
Computer Architecture : Introduction; 4GL Program; 3GL (HLL) Program; 2GL (Assembly)
Program; 1GL (Machine Language) Program; 0GL (Hardware Level); The Context of a Program;
Interrupts.
Unit-II
Operating System Functions : What is an Operating System?; Different Services of Operating
Systems; Uses of System Calls; The Issue of Portability; User’s view of Operating Systems;
Graphical User Interface (GUI); The Kernel; Booting.
Unit-III
Process Management : Introduction; What is a Process?; Evolution of Multi- Programming;
Context Switching; Process States; Process States Transitions; Process Control Block (PCB);
Suspend/Resume Operations; Process Scheduling; Multitasking.
Unit –IV
Dead-locks : Introduction; Graphical Representation of a Dead-lock; Deadlock prerequisites;
Deadlock Strategies.
Memory Management : Introduction; Single Contiguous Memory Management; Fixed Partition
Memory Management; Variable Partitions; Non-Contiguous Allocation – General Concepts;
Paging; Segmentation; Combined Systems; Virtual Memory Management Systems.
References:
1. Silberschatz Galvin
2. Milan Milenkovic
3. Deital H.M.
4. Stalling, W
: Operating system concepts
: Operating system
: An introduction to operating system (Addison Wesley)
: Operating system (PHI)
Page 1 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
Digital Electronics (301102)
Credits -05
L T P
4 1 0
Course Contents
Unit –I
Semiconductors: Junction diodes, Bipolar and FET transistors, biasing techniques, transistor as a
switch.
Information Representation: Number systems, Integer and floating point representation,
character codes (ASCII, EBCDIC), Error detecting and correcting codes.
Unit -II
Digital IC’s: Logic gates, flip-flops, clocks and timers, shift registers, counters.
Boolean Algebra & Circuit Design: Basic laws of Boolean algebra, circuit design using standard
(NAND) gates, Adder, coder / Demultiplexer, encoder / multiplexer design.
Unit -III
MOS & LSI Digital Systems: Semiconductor memory, static and dynamic devices, read only &
random access memory chips, PROMS and EPROMS. Address selection logic. Read and write
control timing diagrams for memory ICs.
Logic Design: TTL, STTL, CMOS logic families.
Unit -IV
Digital Peripherals: Keyboard, multiplexed seven segment display, CRT display schemes Printers,
Control interfaces (parallel and serial) for the peripheral units.
Data Converters: Analog to digital and Digital to analog conversion techniques, Microprocessor
compatible ADCs and basic interfacing techniques
References:








Integrated Electronics by Millman, Halkias, McGraw Hill.
Malvino: Digital Computer Electronics, McGraw Hill, 1990.
H. Taub & D. Schilling, Digital Integrated Electronics, McGraw Hill, 1977.
Richard S. Sandige, Modern Digital Design, McGraw Hill, 1990.
John F. Wakerley, Digital Principles and Practices, PHI, 1990.
Ujjenbeck, John: Digital Electronics; A Modern Approach, Prentice Hall, 1994.
Bignell J.W.: Digital Electronics, 3rd Edition, 1993.
Mano, M. Morris: Digital Logic and Computer Design, 3rd Edition, 1993.
Page 2 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
Foundations of Computer Programming(301103)
Credits -05
L T
4 1
P
0
Course Contents
Unit -I
Defining the problem, designing the program, coding the program, testing and debugging the
program, and implementing the program.
Overview of C: Brief history of C, comparison of C with other programming languages, general
structure of a C program,
Data Types, Operators & Expressions: Constants and variables, data types, declaring variables,
storage classes, different types of expressions and their evaluation, conditional expression,
assignment statement, enumerated data type, defining/creating data types, library functions, type
casting.
Unit -II
Console Input/output: Standard input/output devices, unformatted input/output functions
(character I/O functions and string I/O functions), formatted input/output functions (scanf( )
function and printf ( ) function).
Control Statements: Decision making using if, if - else, elseif and switch statements, Looping
using for, while and do - while statements, transferring program control using break and continue
statements, programming examples to illustrate the use of these control statements.
Unit -III
Functions: Defining a function, local & global variables, return statement, invoking a function,
specifying and passing arguments to a functions, function prototyping and use of header files,
recursion.
Arrays & Strings: Introduction to arrays, declaring arrays, Types of Array , initializing arrays,
processing of arrays, passing arrays as arguments to a function,.
Structure And Unions: Defining and processing a structure, user defined data types, structure and
Pointers, passing structure to function, self-referential structures, unions.
Unit -IV
Pointers: What is pointer? Why pointers? Declaring pointers
Data files: Opening, closing, creating, and processing and unformatted data field.
C-programming applications: Sorting (Bubble sort, Selection sort), Searching (Binary search,
Linear Search).



References:
R.S. Salaria: Applications Programming in C, Khanna Book Publishing Co. (P) Ltd., Delhi.
Byron Gotterfied: Programming in C, Tata McGraw Hill Publishing Company Ltd., Delhi.
Yashvant Kanetkar: Let Us C, BPB Publications, Delhi.
Page 3 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
Fundamentals of Computer & Internet Applications (301104)
Credits -05
L
4
T P
1 0
Course Contents
Unit –I
Information concepts and processing; Evolution of information processing, data, information
language and communication.
Elements of computer processing system; Hardware-CPU, storage devices and media. VDU,
input-output devices, data communication equipment. Software-system software, application
software.
Unit -II
Programming Language : classification, machine code, assembly language, higher level
languages, and fourth generation languages.
Introduction to Operating System: its need and Operating System services; Operating System
classification - single user, multi-user, simple batch processing, Multiprogramming, Multitasking,
Parallel system, Distributed system, Real time system. Typical commands of DOS, GUI Windows.
Unit -III
Computers and Communication: Single user, multi-user, work station, client server systems,
Computer networks, network protocols, LAN, MAN, WAN.
Introducing the Internet : Description of the Internet – Working , Surfing, Internet Domain
Names and Addresses
Connecting LAN to Internet : Protocols , IP Address ,Web Server.
Unit -IV
Internet Applications : Email , Working of email , Advantages of email, Understanding of
Internet Email, Net news ,Search Engines,Intoducing to Usenet ,organization of Usenet articles,
reading, saving ,mailing, writing and posting of an articles.
WWW- World Wide Web
Working of WWW, Hypertext and Hypermedia , URL , Searching the WWW ,Web access using
web browser, Locating information on the Web.





References:
V.Rajaraman : Fundamentals Of Computers :Prentice Hall
P.K.Sinha : Computer Fundamentals
Basandra : Computer Today
Ernest Ackermann, Franklin:: Learning to use the Internet
Leon & Leon : Internet For Everyone
Page 4 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
System Analysis & Design (301402)
Credits -05
L T P
4 1 0
Course Contents
Unit -I
System Concepts: Systems & Information System Environment, elements & types of system, The
System Development Life Cycle, Role of the System Analyst, Automated Tools for System
evelopment.
Unit -II
System Analysis: Requirement determination and specification, feasibility study, Information
gathering, system analysis, introduction, information collection, interviews, questionnaires,
observation, record searching and document analysis, analysis tools, data flow diagram, data
dictionary, decision tree, structured English and decision table, structuring system requirements,
process modeling, logic modeling and conceptual data modeling.
Unit -III
System Design : Designing forms and reports, interface and dialogues, databases, process,
output/input, files. Implementation: Preparing for implementation, planning, test plans, program
development, implementation management, changeover and routine operations.
Unit -IV
Maintenance and Review: Types of maintenance, Cost of maintenance, performance evaluation.
References :




Modern System Analysis & Design, Hoffer J.A., George J.F., Valacich J.S., Addison-Wesley,
Second Edition.
Systems Analysis and Design, Awad E.M., Galgotia Booksource.
Elements of System Analysis, Gore M. & Stubbe J., Galgotia Booksource, Third Edition.
Introducing System Analysis and Design, Lee, Galgotia Booksource, Combined Volume Set.
Page 5 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
S/w Lab-I(IT & Internet Lab) (301106)
Credits -02
L T P
0 0 4
Familiarizing with PC and WINDOWS commands, file creation, editing and directory creation.
Mastery of DOS commands.
Learning to use MS Office: MS WORD, MS EXCEL & MS PowerPoint.
Exposure to Internet Applications.
Note: The break up of marks for the practical will be as under




Lab Record 10 marks
Viva Voce 10 marks
Program development 20 marks
And execution
Page 6 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
S/w Lab-II(C Language) (301107)
Credits -03
L T P
0 0 6
Note: The break up of marks for the practical will be as under




Lab Record 10 marks
Viva Voce 10 marks
Program development 20 marks
And execution
Practical Exercises on Programming in C
Note: Program should be fully documented with simple I/O data. Flow charts should be developed
Wherever necessary.
Write program in ‘C’ language
1.Using input and output statements
2.Using control statements
3.Using functions
4.Using arrays
5.Using structure
6.Using files
7.To sort an array using different methods
8.To search an element from array
Page 7 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
Computer Organization and Architecture (301201)
Credits -05
L T P
4 1 0
Course Contents
Unit -I
Basic Computer Organization and Design: Register Transfer language & operations,
various,Arithmetic, Logic & Shift microoperations instructions, codes, computer registers,
instructions, Timing & control, instruction cycle, design of a complete basic computer & it’s
working.
Programming & Controlling the Basic Computer: Machine & Assembly Language, hardwired
&Microprogrammed control, Design of a control unit.
Unit -II
CPU Architecture: General register & stack organization, instruction formats and addressing
modes, ALU & Control unit architecture.
Memory Organization: Memory hierarchy, main, auxiliary, cache memory, virtual memory
paging and segmentation.
Unit -III
I/O Organization: Peripheral Devices, input-output interface, Modes of data transfer programmed
& interrupt initiated I/O, DMA, I/O Processors.
Unit -IV
Parallel & Multiprocessing Environment: Introduction to parallel processing, pipelining,
RISC/CISC Architecture, vector & array processing, Multiprocessing concepts, memory &
resource sharing, interprocessor communication & synchronization.
References:





Morris Mano: Computer System Architecture, PHI.
Hayes J.P.: Computer Architecture & Organization, McGraw Hill.
Stone: Introduction to Computer Architecture: Galgotia.
Tanenbaum: Structured Computer Organization, PHI.
Malvino, Brown: Digital Computer Electronics, TMH.
Page 8 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
Data Base Management System (304201)
Credits -05
L T P
4 1 0
COURSE CONTENTS:
Unit-I
Databases And Database Users: Introduction, Characteristics of Database Approach, Advantages And Disadvantages of Using
DBMS.
Database System Concepts And Architecture:Data Models, Schemas And Instances, DBMS Architecture And Data Independence, Database
Language And Interfaces, Classification of Database Management Systems.
Unit-II
Data Modeling Using The Entity Relationship Model:Entity Types, Entity Sets, Attributes And Keys, Relationships, Relationship Types, Roles And
Structural Constrains, Weak Entity Types, ER Diagrams, Naming Conventions And Design Issues.
Unit-III
Functional Dependencies and Normalization for Relational Databases:Informal Design Guidelines for Relation Schemas, Functional Dependencies, Normal Forms Based
on Primary Keys, General Definitions of Second and Third Normal Forms.
Unit_IV
Transaction Processing Concurrency Control:Introduction to Transaction Processing, Transaction and System Concepts, Desirable Properties of
Transactions, Schedules and Recoverability.
Concurrency Control Techniques:Locking Techniques for Concurrency Control, Concurrency Control Based on Timestamp
Ordering, Validation Concurrency Control Techniques.
References :
1. Fundamentals of Database Systems, Third Edition, by Elmasri/Navathe
2. Korth and Silberschatz Abraham, Database Concepts, McGraw Hall,1991
3. An introduction to Database Systems by C.J.Date.
4. An introduction to Database Systems by Bipin C. Desai.
Page 9 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
Data and File Structures (301203)
Credits -05
L T P
4
1 0
Course Contents
Unit -I
Preliminaries: Various data structures, common operations on data structures, algorithm
complexity, big O notation, time-space tradeoff between algorithms.
Arrays: Arrays defined, representing arrays in memory, various operations on linear arrays,
Multidimensional arrays, Records.
Linked Lists: Types of linked lists, representing linked lists in memory, advantage of using linked
lists over arrays, various operation on linked lists.
Unit -II
Stacks: Description of stack structure, implementation of stack using arrays and linked lists.
Applications of stacks - converting arithmetic expression from infix notation to polish and their
subsequent evaluation, quick sort technique to sort an array, parenthesis checker.
Queues: Description of queue structure, implementation of queue using arrays and linked lists,
description of priorities queues. Applications of queues - Operating system simulations.
Unit -III
Trees: Description of tree structure and its terminology, binary search tree, implementing binary
search tree using linked lists, various operations on binary search trees, AVL Trees, Threaded
Binary Trees, B-Trees, B+ trees, Greedy Method: Knapsack Problem, Prim's and Kuruskal's
Algorithm to find MSTs.
Heaps: Description of heap structure, implementing heaps using arrays, various operations on
heaps, Applications of heaps – heap sort technique to sort an array, implementation of priority
queues.
Graphs: Description of graph structure, implementing graphs in memory using adjacency matrix
or adjacency lists, various graphs traversing algorithms, finding shortest path between two nodes,
Dijkastra’s shortest path algorithm., finding biconnected component, strongly connected
component and finding cycles in the graphs.
Unit -IV
Searching and Sorting: Linear Search, Binary search, Bubble Sort, Selection Sort, Insertion
Sort,Merge Sort.
Hash Tables: Direct address tables, hash tables, collision resolution by chaining, hash
functions,open addressing – linear probing, quadratic probing, double hashing.
Files: Operations on files, Types of files, File Organizations: Sequential files, Indexed Sequential
file, Directed files and multi-key files, File performance criteria and terms.
References:




Seymour Lipschutz: Theory and Problems of Data Structures, Schaum Outline Series,McGrawHill Book Company.
Trembley and Sorenson: An Introduction to Data Structures with Application, Tata-McGraw
Hill Company, Delhi.
Tanenbaum: Data Structures and C.
Vishal Goyal ,Lalit Goyal and Pawan Kumar : A simplified Approach to Data Structures , 2014.
Page 10 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
Object Oriented Programming (301204)
Credits -05
L T P
4 1 0
Course Contents
Unit -I
Programming Paradigms
Introduction to the object oriented approach towards programming by discussing Traditional,
Structured Programming methodology, its shortcomings, advantages of OOPS (Object Oriented
Programming Style) , Traditional Vs OOPS Software Life Cycle.
Unit –II
Objects & Classes Object Definition, Instance, Encapsulation, Data Hiding, Abstraction,
Inheritance, Messages, Method, Polymorphism, Classes, Candidate & Abstract Classes to be
examples of the Design process.
Responsibilities & Collaborations
Definition of Responsibilities, Identifying & Assigning Responsibilities to form classes, Examine
Relationship between classes, Define Collaborations.
Hierarchies & Subsystems
Hierarchy Graphs, Building Hierarchies, Identifying Contracts, Collaboration Graphs, Subsystems,
Implementation issues.
Unit -III
Object Oriented Programming using C++
Introduction to OOPs and C++: Characteristics of OOPs, Overview of C++, I/O using cout and
cin, Objects and Classes, Member functions and data, private & public, constructor & destructor,
Constructor Overloading, Types of Constuctors. Operator Overloading: Overloading unary and
binary operators, Type Conversion using Operator Overloading
Unit –IV
Inheritance: Concept of inheritance, Base & derived classes, Access Specifiers, Class Hierarchies,
Types of Inheritance with examples.
Virtual Functions and Polymorphism Virtual functions, friend functions, static function, this
pointer, polymorphism, Types of Polymorphism with examples, templates, class templates.
File Handling using C++.
References:



Designing Object Oriented Software Rebacca Wirfs - Brock Brian Wilerson, PHI.
Object Oriented Programming in Turbo C++, Robert Lafore, Galgotia Publication.
Designing Object Oriented Applications using C++ & Booch Method, Robert C. Martin.
Page 11 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
Principles of Management Functions & Organizational Behavior(301205)
Credits -05
L T P
4 1 0
Course Contents
Unit –I
Definition of Management, its nature and purpose, Management: Science or art, Functions of
managers, Levels of management, Fayol’s general principles of management.
Management and society: social responsibility of managers.
Planning: nature and purpose of planning, Planning versus forecasting, types of plans, steps in
planning, the planning process.
Unit –II
Decision making: characteristics and importance, programmed and non-programmed decisions,
Steps in the process of decision making.
Organizing: nature and purpose of organizing, formal and informal organization.
Organizational levels and span of management, factors determining an effective span, the structure
and process of organizing.
Departmentation: need and importance of departmentation, Bases of departmentation.
Human resource management and selection: definition of staffing, the systems approach to
HRM, Recruitment and selection: sources of manpower supply, Selection process, techniques and
instruments.
Unit –III
Motivation and motivators, types of motivation. Theories of motivation: Maslow’s hierarchy of
needs theory, Herzberg’s Hygiene theory, McClelland’s needs theory, the Vroom’s Valenceexpectancy theory, the carrot and the stick approach.
Leadership: definition and characteristics, Leadership theories: trait approaches to leadership,
Behavioral approach, situational or contingency approach to leadership. Leadership styles.
Unit –IV
Communication: meaning, characteristics and importance, Elements of communication, the
communication process, Types of communication, barriers and breakdowns in communication,
making communication effective.
The system and process of controlling: characteristics and importance of control, the basic
control process, requirements for an effective control system.
References:
1. L. M. Prasad, Principles & Practice of Management. Sultan Chand & Sons.
2. Harold Koontz, Heinz Weihrich, “Essentials of Management”, Tata McGraw-Hill Publishing.
Page 12 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
S/W lab-III(Data Structure using C/C++) (301206)
Credits -03
L T P
0 0 6
Note: The break up of marks for the practical will be as under




Lab Record 10 marks
Viva Voce 10 marks
Program development 20 marks
And execution
Write program in C/C++
1. To insert and delete a node in a linked list
2. To add two polynomials using linked list
3. To insert and delete a node in a circular linked list.
4. To implement a stack using arrays and linked list.
5. To implement a queue using arrays and linked list.
6. To invert a linked list.
7. To merge two arrays.
8. To solve polish expression using stacks.
9. For tower of Hanoi problem using recursion.
10. To insert and delete node in binary search tree
11. To find traversals of expressions using binary tree
12. To search an element using binary tree.
Page 13 of 14
Batch 2013 ,2014 Only
Guru Kashi University, Talwandi Sabo
University College of Computer Applications
Post Graduate Diploma in Computer Application
S/W LAB-IV(Object Oriented Programming Using C++) (301207)
Credits -03
L T P
0 0 4
This paper will comprise of what is learnt under C++ Programming
Note: The break up of marks for the practical will be as under




Lab Record 10 marks
Viva Voce 10 marks
Program development 20 marks
And execution
Page 14 of 14