Upload
vudung
View
216
Download
3
Embed Size (px)
Citation preview
POST GRADUATE DIPLOMA IN COMPUTER APPLICATIONS (PGDCA) SYLLABUS
( CBCS Scheme)
(With effect from the academic year 2017-18 and onwards)
GULBARGA UNIVERSITY, KALABURAGI
DEPARTMENT OF COMPUTER SCIENCE
SYLLABUS FOR POST GRADUATE DIPLOMA IN COMPUTER APPLICATION(PGDCA)
IN
COMPUTER SCIENCE
(CBCS SCHEME)
(REVISED SYLLABUS WITH EFFECT FROM ACADEMIC YEAR 2017-18 AND ONWARDS)
Approved by the BOS vide Resolution No. 4 dated 05-03-2017.
Approved by the BOS vide Resolution No. 4 dated 05-03-2017.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 2
SCHEME OF STUDY AND EXAMINATION FOR POST GRADUATE DIPLOMA IN
COMPUTER APPLICATIONS (PGDCA) IN COMPUTER SCIENCE UNDER
CBCS SCHEME W.E.F. ACADEMIC YEAR 2017-2018 AND ONWARDS.
Paper Code
Title of the Course Semester IA Total
Duration of
Theory / Practical Exam. Hrs.
L T P Credits
First Semester HARD CORE
Marks
HCT 1.1 Computer Fundamentals and Digital Logic 80 20 100 03 4 0 0 4
HCT 1.2 Programming Using C 80 20 100 03 4 0 0 4
HCT 1.3 Libre Office 80 20 100 03 4 0 0 4
SOFT CORE [ANY ONE]
SCT 1.1 Database Management Systems 80 20 100 03 4 0 0 4
SCT 1.2 Data Communications & Networks 80 20 100 03 4 0 0 4
PRACTICALS
HCP 1.1 Practical –I : PC-Hardware and Digital Logic Lab. 40 10 50 1.1/2 0 0 4 2
HCP 1.2 Practical – II : C Lab 40 10 50 1.1/2 0 0 4 2
HCP 1.3 Practical –III : Libre Office Lab 40 10 50 1.1/2 0 0 4 2
SOFT CORE [ANY ONE]
SCP 1.1 Practical – IV (a) : DBMS Lab. 40 10 50 1.1/2 0 0 4 2
SCP 1.2 Practical –IV (b) : Networks Lab. 40 10 50 1.1/2 0 0 4 2
TOTAL FOR FIRST SEMESTER 480 120 600 24
Second Semester
HARD CORE
HCT 2.1 Software Engineering 80 20 100 03 4 0 0 4
HCT 2.2 Web Technologies. 80 20 100 03 4 0 0 4
SOFT CORE [ANY ONE]
SCT 2.1 Programming in VB..Net 80 20 100 03 4 0 0 4
SCT 2.2 Object Oriented Programming in C++ 80 20 100 03 4 0 0 4
OPEN ELECTIVE [ANY ONE]
OET 2.1 Internet & its Applications 80 20 100 03 5 1 0 6
OET 2.2 Cloud Computing 80 20 100 03 5 1 0 6
PRACTICALS
SOFT CORE [ANY ONE]
SCP 2.1 Practical – I(a) : VB.Net Lab. 40 10 50 1.1/2 0 0 4 2
SCP 2.2 Practical – I (b) : C++ Prog. Lab. 40 10 50 1.1/2 0 0 4 2
HCMP 2.3
Minor Project Work Minor Project ( 80 for Project Evaluation ( 10 for Presentation + 10 for attending Conference/Seminar/Workshop +40 for Project Report, 20 for Viva-voce), Total 80+IA 20 =100 )
80 20 100 3 0 0 8 4
TOTAL FOR SECOND SEMESTER 480 120 600 24
L – Lecture, T – Tutorials, P – Practical’s, 4 Credits of Theory = 4 Hours of Teaching Per Week, 2 Credits of Practical = 4ours Per Week
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 3
PGDCA I SEMESTER
HARD CORE
HCT 1.1: COMPUTER FUNDAMENATALS AND DIGITAL LOGIC
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble :
To study the basics of computer, components of computer, different types of computer.
To learn the Computer Organization and Architecture.
Realization of NOT, OR, AND, XOR, XNOR gates using universal gates.
UNIT I 16Hrs
Introduction: Introduction to Computer System, Uses, Types. Human Computer Interface: Types of
software, Operating system as user interface, utility programs. Devices: Input and output devices,
keyboard, mouse, joystick, scanner, OCR, OMR, bar code reader, web camera, monitor, printer, plotter.
UNIT II 16Hrs
Logic gates and circuit Gates : OR, AND, NOR, NAND, XOR & XNOR, Demogran’s laws, Boolean
laws, Circuit designing techniques (SOP, POS, K-Map).
UNIT-III 16Hrs
Combinational Building Blocks: Multiplexers, Decoder, Encoder, Adder and Subtractor. Sequential
Building Blocks Flip-Flop: (RS, D, JK, Master-slave and T flip-flops); Registers and Shift registers;
Counters; Synchronous and Asynchronous Designing method.
UNIT IV 16Hrs
Computer Organization and Architecture: CPU, registers, system bus, main memory unit, cache
memory, Inside a computer, SMPS, Motherboard, Ports and Interfaces, Expansion cards, Ribbon cables,
Memory chips, Processors.
References:
1. Digital Logic and Computer design (PHI) 1998 : M.M. Mano
2. Computer Architecture (PHI) 1998 : M.M. Mano
3. Digital Electronics (TMH) 1998 : Malvino and Leach
4. Computer Organization and Architecture : William Stallings
5. Digital fundamentals (Universal Book Stall) 1998 : Floyd, L.Thomas
6. Computer Organization (MC Graw-Hill, Signapore) : Hamcher, Vranesic and Zaky
7. A. Goel, Computer Fundamentals, Pearson Education, 2010.
8. P. Aksoy, L. DeNardis, Introduction to Information Technology, Cengage Learning, 2006
9. P. K.Sinha, P. Sinha, Fundamentals of Computers, BPB Publishers, 2007
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 4
HCT 1.2: PROGRAMMING USING C
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64 Preamble:
To learn steps involved in problem Solving Using Computers.
To learn and implement C programming language.
To design and develop programming skills.
UNIT I 16Hrs
Steps Involved in problem Solving Using Computers, Algorithms, Characteristics of algorithms,
Example Algorithms , Advantages and Disadvantages of Algorithms, Flowcharts, Symbols used
in flowcharts, Example Flowcharts, Advantages and Disadvantages of Flowcharts, Pseudocodes,
Sequence, Selection, Iteration, Example Pseudocodes, Advantages and Disadvantages of
Pseudocode Classification of Programming Languages, Machine level languages, Assembly Level
Languages, Higher level Languages, Fourth Generation Languages, Language Translators,
Characteristics of C Language, Input and output in C, Execution of a C program, Under DOS
environment, Under Unix Environment, Errors, Compile-Time Errors, Linker Errors, Runtime
Errors, Logical Errors, C Language primitives, Keywords and Identifier, Constants, Variables,
Data types, The getchar( ) and putchar( ) functions, The scanf( ) and printf( ) functions,
Formatting of Outputs.
Unit II 16 Hrs
Operators and Expressions: Assignment Operator, Arithmetic operators, Relational operators,
Logical operators, Shorthand arithmetic assignment operators, Increment/decrement operators,
Conditional operator, Nesting of Conditional Operators, The sizeof Operator, The Comma
Operator, Type Conversion, Precedence and associativity Control Structures: The Simple-If
Statement, The If-Else Statement, The Nested-If-Else Statement, The Else-If ladder, The Switch
Statement, Nested Switch Statement, The while loop, The for loop, Variations of for loop, The do-
while loop, Which loop to use when, Jumps in loops, The break statement, The Continue
statement, Nesting of loops, Functions: Advantages of Functions, Classification of functions ,
Built-in functions, User-defined functions, Functions with No Arguments and no return value,
Functions with arguments and no return value, Functions with arguments and return value,
Functions with no arguments but return value.Functions returning non-integer value, Recursive
Functions, Recursion versus Iteration, Storage Classes - Automatic, Static, Register, Extern.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University,
Kalaburagi
Page | 5
Unit III 16Hrs
Arrays: One-dimensional arrays, Multidimensional arrays, Arrays and Functions . Strings: String
I/O Functions, Initialization of strings, Arithmetic and Relational operations on characters, String
manipulations, Two dimensional array of char type, Strings and Function Structures and Unions:
Definition of Structure Template, Declaration of Structure Variables, Initialization of Structure
Variables, Operations on Structures, Structures and Arrays, Arrays within Structures, Array of
Structures, Structure within Structure, Structures and Functions, Passing Structures to Functions
as Arguments, Returning Structures from Functions, Unions, Unions within Structures,
Structures within Unions, Arrays within Unions, Enumerated data type, typedef.
Unit IV 16 Hrs
Pointers: operators- & and *, Pointer arithmetic, Pointers and arrays, Pointers and Strings, Array
of Pointers to Strings, Pointers to Structures, Structures containing Pointers, Pointers to Unions,
Passing pointers as arguments to functions - Call by value and call by reference, Returning a
Pointer from a function, Pointers to Functions, Passing one function as an argument to another
function, Pointers to pointers, Dynamic Memory Allocation, malloc(), calloc(), realloc() and
free() . Files: Opening and Closing of Files, File I/O Functions, fputc() - fgetc(), fputs() - fgets(),
fprintf() - fscanf(), fwrite() - fread(), Random Accessing of Files – fseek(), ftell(), rewind(), Error
Handling During File I/O Operations- feof(), ferror(), Command Line Argument. Preprocessor
Directives: Files Inclusion, Macros Definition, Macros with Arguments, Nesting of Macros,
Macros VS Functions, Advantages of Macros, Conditional Compilation Directives, Stringizing
Operator #, Token Pasting Operator ##, The #error Directive , The #pragma Directive.
References:
1. M.T. Somahsekara, Problem Solving with C, PHI Learning, New Delhi, 2009
2. E. Balagurusamy, Programming in C, McGrawHill Publications.
3. Brian W Kernighan, Dennis M Rtchie, The C Programming Language, PHI, 2nd
Edition
4. Byron Gottfried, Programming with C, Tata McGraw-Hill edition.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University,
Kalaburagi
Page | 6
HCT 1.3: LIBRE OFFICE
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble :
To understand the principles of Office Automation Techniques.
To explore the concept of Open Source Software’s.
Unit I 16Hrs
Introducing Writer, Setting up Writer, Working with Text, Formatting Pages, Digital signing of
documents. Introducing to Styles, Working with Styles, Working with Graphics, Working with
Tables, Working with Templates, Using mail Merge, Tables of Contents Indexes, Working with
Master Documents, Working with Fields.
Unit II 16Hrs
Introducing to Calc, Entering Editing & Formatting Data, Creating Charts and Graphs, Using Styles
and Templates in Calc, Using Graphics in Calc, Using Formulas and functions.Using Pivot Tables,
Data Analysis,linking calc data, Sharing and reviewing documents.
Unit III 16Hrs
Introducing to Impress, Using Slide Masters, Styles and Templates, Adding and Formatting Text,
Adding and Formatting Pictures, Managing Graphic Object.
Unit IV 16Hrs
Formatting Graphic Objects, Including Spreadsheets Charts & Other Objects, Adding and Formatting
Slides Notes and Handouts, Slide Shows, Printing E-mailing Exporting and Saving Slide Shows,
Setting Up and Customizing Impress.
References:
1. “ Writer Guide “, IIT Bombay Spoken Tutorial, Shroff Publishers,2014
2. “ Calc Guide “, IIT Bombay Spoken Tutorial, Shroff Publishers,2014
3. “ Impress Guide “, IIT Bombay Spoken Tutorial, Shroff Publishers,2014
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 7
SOFT CORE (ANY ONE)
SCT 1.1: DATABASE MANAGEMENT SYSTEM
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble:
To study DBMS both in terms of use and implementation/design, experience with SQL.
To Learn Evolution of Database management systems, Entity Relationship Modeling
and Design.
To Learn Relational Data Model and Relational Algebra, Structured Query Language,
Transaction Processing. UNIT I 16Hrs
Introduction to Databases: Introduction, An Example, Characteristics of Database approach,
Advantages of using DBMS approach, When not to use a DBMS. Database System Concepts and
Architecture: Data models, Schemas and instances, Three schema architecture and data
independence, Database languages and interfaces, The database system environment. Relational
Data Model and Relational Database Constraints: Relational Model Concepts, Relational Model
Constraints and Relational Database Schemas, Update Operations, Transactions and Dealing with
Constraint Violations.
UNIT II 16Hrs
Modeling using the Entity-Relationship(ER) model: Using High-Level conceptual Data Models for
Database Design, A sample Database Application, Entity types, Entity Sets, Attributes and Keys,
Relationship Types, Relationship Sets, Roles and Structural Constraints, Weak Entity types,
Refining the ER Design, ER Diagrams, Naming Conventions and Design Issues, Relationship
Types of Degree Higher than Two, Database Design using ER-to Relational Mapping. UNIT III 16Hrs
SQL: SQL Data Definition and Data Types specifying basic constraints in SQL, Basic retrieval
queries in SQL, Insert, Delete and Update statements in SQL, Additional features of SQL, More
complex SQL Queries, Specifying Constraints as Assertion and Trigger, Views (Virtual Tables) in
SQL, Schema Change Statement in SQL. Relational Algebra: Unary Relational Operations,
SELECT and PROJECT, Relational Algebra Operations from Set Theory, Binary Relational
Operations: JOIN and DIVISION, Additional Relational Operations, Examples of Queries in
Relational Algebra.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 8
UNIT IV 16Hrs
Database Design Theory and Normalization: Informal Design Guidelines for Relation Schemas,
Functional Dependencies, Normal Forms Based on Primary Keys, General Definitions of Second
and Third Normal Forms, Boyce-Codd Normal Form, Multi-valued Dependencies and Fourth
Normal Form, Join Dependencies and Fifth Normal Form. Transaction Processing: Introduction to
Transaction Processing, Transaction and System Concepts, Desirable Properties of Transaction. References :
1. Fundamental Of Database Systems By Ramezelmasri And Shamkant B Navathe, Sixth Edition, Addison
Wesley, 2011.
2. Database System Concepts, Sixth Edition,Abrahamsilberschatz, Henry F. Korth, S.Sudarshan : Tata
Mcgraw-Hill,2010
3. An Introduction to Database Systems by C.J. Date, A.Kannan, S.Swamynathan, 8th Edition, Pearson
Education, 2006.
4. Database Systems: The Complete Book, Second Edition, Hector Garcia-Molina,Jeffrey D.Ullman, Jennifer
Widom , Pearson Education, 2001.
SCT 1.2: DATA COMMUNICATIONS AND NETWORKS
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble:
To study the basics of Computer Networks.
To study and Compare various Network architectures and fundamental protocols.
To learn about Networking protocol and OSI model.
UNIT I 16Hrs
Introduction: Data Communications & Networking , fundamental concepts ,data Communication
Protocols &Standards Organization, Analog & Digital signals, bandwidth of a signal and medium,
Concept of band width of signal, Data transmission rate and band width. Analog & Digital
Transmission methods: Analog Signal & Analog Transmission, Digital Signal & Digital
Transmission, Digital Signal & analog , Analog Signal & Digital Transmission.
UNIT II 16Hrs
Modes of data Transmission and Multiplexing: Parallel and Serial communication , Asynchronous
synchronous, ioschronous communication, Simplex, Half duplex and full duplex
Communication.Transmission Error Detection & Correction: Error classification ,Delay distortion,
Attenuation and Noise.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 9
UNIT III 16Hrs
Network Topologies, switching and routing algorithms: Mesh,Star,tree,Ring,Bus,Hybrid topology,
Switching Basics, Circuit Switching, Packet Switching, Message Switching ,router and Routing,
Factors affecting the routing algorithms,approches of routing.
UNIT IV 16Hrs
Networking Protocols & OSI Model, Local Area Network, Metro Politian Area Network, Wide Area
Network. Introduction to TCP/IP,IP,ARP,RARP,ICMP,TCP-UDP.
References:
1. Behrouz A Forouzan, Data Communications and Networking, Tata McGraw Hill.
2. William A Shay, Understanding Communications and Networks, Thomson Learning.
3. William Stallings, Data and Computer Communications,7/e, Pearson Education.
4. Stevens et Al, Unix Network Programming-The sockets and networking API,Vol.1/3/e, PHI.
5. Stevens et Al, Unix Network Programming-Interprocess Communication,Vol.2,2/e, PHI.
6. Ames Chellis Charles Perkins, Matthew Strebe, Networking Essentials: Study Guide MCSE,
Second Edition.
PRACTICALS
HCP 1.1 PRACTICAL-I : PC- HARDWARE AND DIGITAL LOGIC LAB
Practical: 4 Hrs./ Week Credits: 02
Max Marks: 40, Cont. Assessments:10
Lab assignment shall be carried out studied in paper HCT 1.1.
HCP 1.2 PRACTICAL-II : C LAB
Practical: 4 Hrs./ Week Credits: 02
Max Marks: 40, Cont. Assessments:10
Lab assignment shall be carried out studied in paper HCT 1.2.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 10
HCP 1.3 PRACTICAL-III : LIBRE OFFICE LAB
Practical: 4 Hrs./ Week Credits: 02
Max Marks: 40, Cont. Assessments:10
Lab assignment shall be carried out studied in paper HCT 1.3.
SCP 1.1 PRACTICAL-IV (a) : DBMS LAB
Practical: 4 Hrs./ Week Credits: 02
Max Marks: 40, Cont. Assessments:10
Lab assignment shall be carried out studied in paper SCT 1.1.
SCP 1.2 PRACTICAL-IV (b) : NETWORKS LAB
Practical: 4 Hrs./ Week Credits: 02
Max Marks: 40, Cont. Assessments:10
Lab assignment shall be carried out studied in paper SCT 1.2
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 11
PGDCA II SEMESTER
HARD CORE
HCT 2.1: SOFTWARE ENGINEERING
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble:
To understand the concept of software process models.
To learn about software requirements and SRS document.
To study the objectives of software design, project planning process.
To understand different software testing approaches.
Unit I 16 Hrs
Introduction: Software and Software Engineering, The Software Process, Software Engineering
Practice. Software Process Models- The Waterfall Model, Incremental Process Model, Evolutionary
Process Model , Concurrent Model. Requirements Engineering, Establishing the Groundwork,
Eliciting Requirements, Developing Use Cases, Building the Requirements Model, Negotiating
Requirements, Validating Requirements. Requirements Modeling- Scenario-Based Modeling, UML
Models that supplement the Use Case.
Unit II 16Hrs
Software Design: Introduction, Objectives of Design, Modularity-Module Coupling, Module
Cohesion, Relationship between Cohesion and Coupling, Strategy of Design, Functional oriented
design, IEEE recommended practice for software design descriptions. Introduction to Object
Oriented Design, Case study of library management system. Software testing strategies: Concepts,
Verification and Validation, Unit Testing, Integration Testing, Top down and bottom up Integration,
Regression Testing, Smoke Testing, Alpha and Beta Testing. System testing: Recovery Testing,
Security Testing, Stress Testing, Performance Testing, Deployment Testing.
Unit III 16Hrs
Testing Conventional Applications: Testability, Test characteristics, White Box Testing, Basis path
Testing, Flow graph notation, Independent program paths, cyclomatic complexity, deriving test
cases, Graph matrices, control structure testing. Black box testing: Equivalence Partitioning,
Boundary Value Analysis, Orthogonal array testing. Testing web applications: Testing concepts for
web applications, Content testing, User interface testing, Configuration testing, Security testing,
Performance testing, Load and Stress testing.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 12
Unit IV 16Hrs
Estimation For Software Projects: Observation on Estimation, The Project Planning Process,
Software Scope and Feasibility, Resources, Software Project Estimation, Decomposition Techniques,
The COCOMO II Model, Specialized Estimation Techniques. Software Process Improvement:
Capability Maturity Model Integration (CMMI), other Software Improvement Frameworks.
References:
1. Roger S.Pressman, Software engineering- A practitioner’s Approach, McGraw-Hill /7e
2. K.K. Aggarwal , Yogesh Singh, Software Engineering –New Age International Publishers/3rd
Edition
3. K.V.K.K. Prasad, “Software Testing Tools”, Dreamtech Press.
4. Ian Sommerville, Software engineering, Pearson education Asia, 9th edition.
5. Pankaj Jalote- An Integrated Approach to Software Engineering, Springer Verlag, 1997.
HCT 2.2 : WEB TECHNOLOGIES
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble:
To study the use of HTML in web design environment.
To learn the basics of sites creation using language HTML
To study the use of Cascading Style Sheets
UNIT I 16Hrs
Variables in the Web Design Environment: HTML and XML Languages, web browsers, coding for
multiple screen resolutions, bandwidth concerns. Web Site Design Principles: Design for the
medium, design the whole website, design for the user, design for the screen, Planning the Site,
planning site navigation, creating page templates, web typography, type design principles,
controlling typography with the <FONT> element and Cascading Style Sheets, styling with CSS,
graphics and Color, HTML frames, publishing and maintaining websites.
UNIT II 16Hrs
Client-Server interaction, web document transport and HTTP, browser architecture, CGI technology
for dynamic web documents, Java technology for active web documents.
UNIT III 16Hrs
JAVA Script: The Java Script programming language, creating JavaScript source file, hiding Java
Script from incompatible browsers, variables, functions, objects and events, data types and operators,
decision making with control structures and statements, windows and frames, working with forms in
JavaScript, using JavaScript with CSS styles, cookies and security. Introduction to document object
model, debugging JavaScript, server side JavaScript. Database connectivity, working with Java
Applets and embedded data.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 13
UNIT IV 16Hrs
Introduction to XML:Introduction, Syntax, Document structure, Document type definitions,
Namespaces, XML schemas, displaying raw XML documents, Displaying XML documents with
CSS, XSLT style sheets, XML processors, Web services.
References:
1. Douglas E Comer, Computer Networks and Internet, Pearson Education.
2. Joel Sklar,. Principles of Web Design, Web Warrior series, Thomson Learning.
3. Deitel, Deitel, and Nieto, Internet & World Wide Web-How to Program, PHI.
4. Don Gosselin, JavaScript, Web Warrior Series,3/e, Thomson Learning.
5. Douglas E. Comer, Internetworking With TCP/IP, Vol. II: Design, Implementation, And Internals, 3/E,
PHI.
6. Kate Kalata, Internet Programming with VBScript and JavaScript, Thomson Learning.
SOFT CORE(ANY ONE)
SCT 2.1 : PROGRAMMING IN VB.NET
Teaching: 4 hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble :
To study basics of .NET programming Language.
To learn and implement programming with windows form
To implement object oriented concepts using .NET programming Language.
UNIT I 16Hrs
Introduction to .NET, .NET Framework features and architecture, CLR, Common Type System,
MSIL, Assemblies and class libraries. Introduction to visual studio, Project basics, types of project
in .Net, IDE of VB.NET, Menu bar, Toolbar, Solution Explorer, Toolbox, Properties Window Form
Designer, Output Window, Object Browser. The environment: Editor tab, format tab, general tab,
docking tab. visual development and event driven Programming – Methods and events.
UNIT II 16Hrs
The VB.NET Language- Variables -Declaring variables, Data Type of variables, Forcing variables
declarations, Scope and lifetime of a variable, Constants, Arrays, types of array, control array,
Collections, Subroutines, Functions, Passing variable Number of Argument Optional Argument,
Returning value from function. Control flow statements: conditional statement, loop statement.
Msgbox and Inputbox.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 14
UNIT III 16Hrs
Working with Forms: Loading, showing and hiding forms, controlling One form within another. GUI
Programming with Windows Form: Textbox, Label, Button, Listbox, Combobox, Checkbox,
PictureBox, RadioButton, Panel, scroll bar, Timer, ListView, TreeView, toolbar, StatusBar, Their
Properties, Methods and events. OpenFileDilog, SaveFileDialog, FontDialog, ColorDialog,
PrintDialog. Link Label. Designing menus : ContextMenu,access and shorcut keys.
UNIT IV 16Hrs
Object oriented Programming: Classes and objects, fields Properties, Methods and Events,
constructor, inheritance. Access Specifiers: Public, Private, Protected. Overloading, My Base and My
class keywords. Overview of OLE, Accessing the WIN32 API from VB.NET and Interfacing with
office97, COM technology, advantages of COM+, COM & .NET, Create User control, register User
Control, access COM components in .net application.
References:
1. Steven Holzner VB.NET Programming, Dreamtech Publications.
2. Evangelos Petroutsos, Mastering VB.NET, BPB Publications
3. Introduction to .NET framework, Wrox Publications.
4. David I. Scheinder, An Introduction to Programming Using Visual Basic .Net®, 5/e, PHI.
5. Shirish Chavan, Visual Basic.NET, Pearson education .
6. Schneider, An Introduction to Programming Using Visual Basic .NET, 5/e, PHI.
SCT 2.2 : OBJECT ORIENTED PROGRAMMING IN C++
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble :
To study the features, fundamentals, principles of Object Oriented Programming.
To learn the concepts of Classes and Objects, Inheritance, File Handling and String
Handling.
Unit I 16Hrs
Object Oriented Programming Paradigm, OOP Principles, Advantages of OOP, Salient features of
C++ Language, The Structure of a C++ Program, Sample C++ Programs, Execution of a C++
program, Errors, Tokens, Keywords and Identifiers, Constants, Variables, Data types, Operators and
Expressions, Selection statements, Iterative Statements, Functions, Arrays, Structures and Unions,
Pointers
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 15
Unit II 16Hrs
Classes and Objects: Class Definition and Access Specifiers Private, Public, Passing Objects as
Arguments, Returning Objects from Functions, Arrays of Objects , Arrays as Member Data,
Static Member Data, Static Member Functions, Friend Functions, Friend Class, Const Member
Functions, Const Objects, this pointer, Nesting of Member Functions, Constructors and
Destructors: Constructors and their Characteristics, Types of Constructors, Default
Constructor, Parameterized Constructors, Copy Constructor, Dynamic Constructor, Destructor and
its Characteristics, Operator Overloading: Syntax of Operator Overloading Function,
Overloading Unary operators, Overloading Binary operators, Overloading Array subscript operator
[], Overloading Function call Operator () , Overloading new and delete Operators, Overloading
operators using Friend Functions, Overloading >> and << operators, Type Casting, Conversion from
Basic type to Derived type and Vice-versa Conversion from one Derived type to another Derived
type and Vice-versa.
Unit III 16 Hrs
Inheritance: Single Level Inheritance, Multiple Inheritance, Multilevel Inheritance, Hierarchical
Inheritance, Hybrid Inheritance, Virtual Base Class, Pointer to Objects, Pointers to Derived
Classes and Virtual Functions, Pure Virtual Functions and Abstract Class, Constructors and
Destructors in Derived Classes, Constructors and Destructors in Multiple Inheritance, Virtual
Destructor, Private Inheritance, Protected Inheritance, Containership. I/O Streams: Built-in
Classes Supporting I/O, Unformatted I/O Operations, Formatting of Outputs, IOS Class Functions
and Flags, Manipulators, Built-in Manipulators, User-Defined Manipulators. File Handling: Built-in
Classes for File I/O Operations, Types of Data Files (Text Files and Binary Files), Opening and
Closing a File, Detecting End of File, Text Files, Character I/O - put(), get() Member Functions,
String I/O – The << operator and the getline() Member Function, Mixed Data I/O – The << and >>
Operators , Binary Files, Objects I/O – write() and read() Member Functions, Random accessing of
a Binary File (seekg(), seekp(), tellg(), tellp() Member Functions), Error Handling During File I/O
Operations- fail(), bad(), good(), Command Line Arguments.
Unit IV 16Hrs
String Handling : String class and its Constructors, The Assignment Operator, The Extraction
Operator >> and the Insertion Operator << , The Relational Operators, Concatenation , Member
Functions of String Class. Exception Handling: Exception Handling Mechanism, Throwing in one
function and catching in the other, Single Try Block , Multiple Catch Blocks, Catching all exceptions
in a single catch block, Rethrowing an Exception, Specification of Exceptions. Templates: Class
Templates, Class Templates with Multiple Parameters, Function Templates, Function Templates
with Multiple Parameters, Member Function Templates, Overloading Template functions, Non-type
Template Arguments.
References:
1. M.T. Somashekara, Object Oriented Programming with C++ (2nd Edition), PHI Learning, 2012
2. E. Balagurusamy, Object Oriented Programming with C++, McGrawHill Publications,
3. Herbert Schildt, C++ The Complete Reference,Tata McGraw Hill Publication.
4. Al Stevens,C++ Programming, Wiely Publications.
5. S. B. Lippman& J. Lajoie, C++ Primer, 3rd Edition, Addison Wesley.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 16
OPEN ELECTIVE(ANY ONE)
OET 2.1: INTERNET & ITS APPLICATIONS
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble:
To understand the concepts of Internet and its application
To learn about Web Browsers, CRM and smart cards.
UNIT I 16Hrs
Introduction to Computers Programming Language, Types, History of Internet Personal Computers
History of World Wide Web, Micro software .NET Java-Web resources.
UNIT II 16Hrs
Web Browsers, Internet Explorer, connecting to Internet Features of Internet explorer6, Searching the
Internet, online help and tutorials, File Transmission Protocol (FTP) Browser settings.
UNIT III 16Hrs
Attaching a file, Electronic Mail Creating, an E-mail id Sending and Receiving, mails-attaching a file-
Instance messaging, other web browsers.
UNIT IV 16Hrs
Introduction to HTML headers, Linking, Images, special characters and line breaks, unordered lists,
simple HTML programs. E-marketing, consumer tracking, Electronic advertising search engine, CRM,
credit card Payments, Digital cash, e wallets, smart card.
References:
1. Internet and World Wide Web Third edition H.M.Deital, P.J. Deital and A.B.Goldberg-PHI
2. The Internet- Complete Reference Harley hahn, Tata McGraw hill.
3. Encyclopedia of Internet Technologies and Applications by Mario Freire, Manuela Pereira , 1st Edition.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 17
OET 2.2: CLOUD COMPUTING
Teaching: 4 Hrs./ Week Credits: 04
Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64
Preamble:
To learn the basics of cloud computing, its models and Services.
To compare and contrast programming for cloud and their applications
To explain Cloud Resource Virtualization and Task Scheduling algorithms.
Unit I 16Hrs
Introduction, Cloud Infrastructure: Cloud computing, Cloud computing delivery models and services,
Ethical issues, Cloud vulnerabilities, Cloud computing at Amazon, Cloud computing the Google
perspective, Microsoft Windows Azure and online services, Open-source software platforms for
private clouds, Cloud storage diversity and vendor lock-in, Energy use and ecological impact, Service
level agreements, User experience and software licensing.
Unit II 16Hrs
Cloud Computing: Application Paradigms.: Challenges of cloud computing, Architectural styles of
cloud computing, Workflows: Coordination of multiple activities, Coordination based on a state
machine model: The Zookeeper, The Map Reduce programming model, A case study: The Grep, The
Web application, Cloud for science and engineering, High-performance computing on a cloud, Cloud
computing for Biology research, Social computing, digital content and cloud computing.
Unit III 16Hrs
Cloud Resource Virtualization: Virtualization, Layering and virtualization, Virtual machine monitors,
Virtual Machines, Performance and Security Isolation, Full virtualization and paravirtualization,
Hardware support for virtualization, Case Study: Xen a VMM based paravirtualization, Optimization
of network virtualization, vBlades, Performance comparison of virtual machines, The dark side of
virtualization.
Unit IV 16Hrs
Cloud Resource Management and Scheduling: Policies and mechanisms for resource management,
Application of control theory to task scheduling on a cloud, Stability of a two-level resource allocation
architecture, Feedback control based on dynamic thresholds, Coordination of specialized autonomic
performance managers, A utility based model for cloud-based Web services, Resourcing bundling:
Combinatorial auctions for cloud resources, Scheduling algorithms for computing clouds, Fair
queuing, Start-time fair queuing, Borrowed virtual time, Cloud scheduling subject to deadlines,
Scheduling MapReduce applications subject to deadlines, Resource management and dynamic scaling.
References:
1. Dan C Marinescu: Cloud Computing Theory and Practice. Elsevier(MK) 2013.
2. Rajkumar Buyya , James Broberg, Andrzej Goscinski: Cloud Computing Principles and Paradigms,
Willey 2014.
3. John W Rittinghouse, James F Ransome:Cloud Computing Implementation, Management and
Security, CRC Press 2013.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 18
PRACTICALS
SCP2.1 PRACTICAL – I (a) : VB.NET LAB
Practical: 4 hrs./ Week Credits: 02
Max Marks: 40, Cont. Assessments: 10
Lab Assignments shall be carried out studied in SCT 2.1
SCP 2.2 PRACTICAL – I (b) : C++ PROG LAB
Practical: 4 hrs./ Week Credits: 02
Max Marks: 40, Cont. Assessments: 10
Lab Assignments shall be carried out studied in SCT 2.2
HCMP2.3: MINOR PROJECT
Practical: 8 Hrs./Week Credits: 04
Max Marks: 100
HCMP2.3: Minor Project ( 80 for Project Evaluation( 10 for Presentation + 10 for attending
Conferences/Workshop/seminar + 40 for Project Report, 20 for Viva-Voce) ,
Total 80 + IA20 = 100 )
Each student shall carry out an individual project in the Lab.
The Guide shall be concerned teacher in the department.
The Project topic should be chosen in consultation with the guide.
Student shall carry out the analysis and design work for the chosen problem statement and develop
the s/w in the Lab.
The student shall submit two copies of the dissertation documenting the project work carried out
by him/her to the Chairman/Head of the Department at the end of the semester term.
Refer Annexure-I for Project documentation details.
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 19
ANNEXURE-I
FORMAT OF THE PROJECT REPORT
1. Cover page as per format
2. Certificate of the project
3. Conference/Seminar/Workshop Attended Certificate
4. Acknowledgement
5. Index
6. Abstract of the project
7. Main Report
7.1 Introduction
7.2 Problem statement
7.3 Literature survey
7.4 System analysis & design
7.5 Hardware & software Requirements
7.6 ERD, DFD
7.7 System Planning(Charts)
7.8 Implementation
7.9 Integration
7.10 Testing
7.10.1 Unit Testing
7.10.2 Integration Testing
7.10.3 Functional Testing
7.11 Results & Discussion
7.12 Advantages & Disadvantages
7.13 Applications
7.14 Future Scope
7.15 Conclusion
7.16 References
7.17 Soft copy of the project on CD/Floppy
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 20
GUIDE CERTIFICATE
Guide Name:
Full Address:
CERTIFICATE
This is to certify that this project entitled “ ________________________________”
submitted in partial fulfillment of the Degree of PGDCA to the Department of Computer Science,
____________________ (University/College Name), carried out by
Mr./Ms._______________________, Reg. No. ________________ is a bonafide work carried out by
him/her under my supervision. The matter embodied in this project work has not been submitted
earlier for award of any degree or diploma to this or any other University/Institution to the best of my
knowledge and belief.
Signature of the Guide
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 21
COVER PAGE
Title of the thesis/report
(Times New Roman, Italic, Font size = 24 )
Submitted in partial fulfillment of the requirements
for the award of the Degree of PGDCA
(Bookman Old Style, 16 point, centre)
Submitted by:
(Student name)
Reg. No.:
Submitted to
GULBARGA UNIVERSITY, KALABURAGI
College/Department
College Name and City
PGDCA Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi
Page | 22
DECLARATION
This is to certify that the dissertation/project report entitled
“___________________________________________________” is carried out by me
under the supervision of _____________________________, for the partial fulfillment
of the requirements for the award of the Degree of PGDCA. The contents embodied in
this project work, in part or whole, has not been submitted earlier for award of any
degree or diploma to this or any other University/Institution.
Signature of the student
( Name of the Student )
Reg. No.