Join Our Forum To download Latest Question papers and Syllabus

Get Money

Earn upto Rs. 9,000 pm checking Emails. Join now!

Enter your email address:

Delivered by FeedBurner

Tuesday, October 16, 2007

PGDCA Syllabus (Punjabi university Patiala)


Introduction to information technology

Maximum Marks: 80 Lectures to be Delivered : 40 : 50
Minimum Pass Marks: 40% Time Allowed : 3 Hrs.
Instructions for paper-setters
The question paper will consist of five section A, B,C,D and E. Section A,B,C and D will have two questions from the respective sections of the syllabus and will carry 15% marks each. Section E will have 16 short answer type questions will cover the entire syllabus uniformly and will carry 40% marks in all.
Instruction for candidates
1. Candidates are required to attempt one question each from section A, B,C,D of the question paper and the entire section E.
2. Use of non-programmable scientific calculator is allowed.

Section – A
Historical Evolution of Computer: characteristics of computers, types of computers, the computer generations.
Basic Anatomy of computers: memory unit, input/output unit, arithmetic logic unit, control unit, central processing unit, RAM, ROM, PROM, EPROM.
Input-output devices: punched hole devices, magnetic media devices, printers, keyboard, scanners, other devices such as plotters, voice recognition and response devices, off-line data entry devices.
Section – B
Number system: non positional and positional number systems, base conversion, fractional numbers, various operations on numbers.
Computer code: computer words, character data, weighted and non- weighted code, BCD, EBCDIC, ASSII, grey code.
Boolean algebra and logic circuit: Boolean algebra, Boolean functions, logic gates.
Section – C
Computer software : introduction, types of software, system software, GUI, operating system, high level languages, assemblers, compilers and interpreters, system utilities, application packages, stages in the development of software, program testing and debugging, program documentation, concept if firmware.
Section – D
Networking: Basic types of networks (LAN, MAN, WAN), hardware and software for LAN and WAN, topologies.
Introduction, data processing, data base concepts, database redundancy, inconsistency, difficulty in accessing the data, concurrent access anomalies , security problem, integrity of data.

1. V.Rajaraman “Fundamentals of computers”, Prentice Hall India.
2. N. Subramaninum , “ Introduction to computer”, Volume-1.
3. Dr. Rajesh trehan , “A complete book on IT”, cyber tech.

Operating system

Section – A
Introduction to operating system, its need and operating system services, Definition, Early system , introduction to various types of operating system: Batch processing system Operating system, multiprogramming Operating system, Time sharing Operating system, Multi tasking Operating system, Distributed Operating system, Networking Operating system, Real time Operating system, Multi processor system and parallel processing.

Section –B
Disk operating system (DOS) : Booting process of DOS, purpose of autoexec.bat and config.sys , internal commands and external commands, using wild card characters, creating batch files, getting and setting date, time and prompt, disk related commands: format , fdisk, chkdsk, scandisk, defrag.

Section – C
Windows: GUI, icon, toolbar.
Working with files, closing and saving a file.
Mouse mechanics: click, double click, drag and drop method, accessories, Network neighbor hood, and system tools, recycle bin, files and directory management under windows, running programs.

Section –D
Unix: structure of UNIX, kernel and shell, commands of UNIX, UNIX file system, own file system, electronic mail.
VI editor: editing text, screen controls.
Printing and spooling.
UNIX administration: super user, booting, backup, creating and managing new accounts.


Section –A

Traditional file processing system: Characteristics, limitations, database : definition, composition.
Database management system : definition, characteristics, advantage over traditional file processing system, implication of database approach, user of database, DBA and its responsibility, database schema, instance.
DBMS architecture, data independence, mapping between different levels.
Database languages: DDL, DML, DCL.
Database utilities, data models
Keys: super, candidate, primary, unique, foreign.

Section – B
Entity relation model: concepts, mapping cardinalities. Entity relationship diagram, weak entity sets, strong entity set, aggregation, generalization, converting ER diagram to tables.
Overview of network and hierarchical model.
Relational data model: concepts, constraints, relational algebra, basic operations, additional operations.
Section- C
Database design: functional dependency, decomposition, problems arising out of bad database design, normalization, multi valued dependency, database design process, database protection , database integrity.
Database concurrency: problems arising out of concurrency, methods of handling concurrency. Data recovery.
Database security: authentication, authorization, methods of implementing security.
Section – D
MS- Access: introduction to ms-access, working with database and tables , queries in access, applying integrity constraints, introduction to forms, sorting and filtering, controls, reports and macro: creating reports , using macros.

Problem solving using C

Section – A
Programming process: problem definition, program design, coding, compilation and debugging.
Identifiers and keywords, data types, input and output, type conversion, operators and expressions. Arithmetic, unary, logical and relational operators, assignment operator, conditional operator, library functions.

Section – B
Control statements: branching, looping using for, while and do-while statements, nested control structure , switch , break and continue statement.
Functions: definition, call prototype and passing arguments to a function, recursion versus iteration.
Storage classes: automatic, external and static variables.
Section – C
Arrays: definition, accessing elements, initialization, passing to functions, multi dimensional arrays, strings.
Pointers: address and referencing operators, declaration, assignment, passing pointer to functions, pointer arrays.
Structure: variables, accessing members, nested structures, pointer to structures, self referential structures.
Section – D
Searching and sorting techniques, linear and binary search, bubble , insertion, selection and quick sorting on array and their comparisons.

Introduction to computer network, internet and e-commerce.
Section- A
Computer network : definition, need for computer networks and advantages, hardware , software, users.
Reference models : OSI reference model, TCP/IP reference model.
Types of networks : LAN, MAN, WAN and value added network, their features, network topologies.
Section – B
Transmission media: magnetic media , twisted pair, co-axial cable, radio transmission, line of sight transmission and communication satellite, wireless transmission.
Switching : virtual circuits versus circuit switching.
Section –C
Introduction to internet : relay, repeaters, bridges, routers, gateways.
Internet working : how networks differ, concatenated virtual circuits, connectionless internetworking, firewalls, internet architecture.
Applications of internet : email, WWW and multimedia, FTP, introduction data transfer and distributed computation.
WWW: the client side, the server side, web browser, net surfing.
Section – D
Electronic commerce framework, electronic commerce and media convergence, the anatomy of e-commerce applications.
Electronic data interchange, EDI applications in business
FDI : legal , security , and privacy issue.

Management information system
Section – A
Framework of management information systems : importance of MIS, concepts of management, information system, definition of MIS, information technology and MIS, nature and scope of MIS, MIS characteristics and functions.
Structure and classification of MIS: structure of mis, mis classification, brief introduction of functional information system. Financial information system, marketing information system, production manufacturing information system, human resources information system.
Section – B
Decision making and mis : decision making , simons model of decision making, types of decisions, purpose of decision making, level of programmability, knowledge of outcomes, methods of choosing among alternatives decisions making and mis.
Information and system concepts: types of information: strategic information , tactical information, operational information, information quality , dimensions of information, system : kinds of systems, system related concepts, elements of systems, human as an information processing system.
Section –C
System development stages: system investigation, system analysis, system design, construction and testing, implementation, maintenance.
System development approaches (a brief introduction ) : waterfall model , prototyping, iterative enhancement model, spiral model.
System analysis: introduction, requirement definition, strategies for requirement definition , structured analysis tools: data flow diagram, data dictionary, decision tress, structured English, decision trees.
System design: objective, conceptual design, design methods, detailed system design.
Section –D
Implementation and evaluation of mis: implementation process. Hardware and software selection, evaluation of mis, system maintenance.
Information system planning: information system planning , planning terminology , the Nolan stage model, selecting a methodology , information resources management.
Information system (IS) as an enabler : introduction, changing, concepts of IS, IS as an enabler.


Software lab – 1 (DOS, WINDOWS,UNIX)

Maximum marks: Practical units to be conducted 40-50
Minimum pass marks: 40% Time Allotted : 3 Hrs.

DOS: booting under DOS, internal and external commands of dos.
WINDOWS : windows concepts, features, windows structure, desktop, taskbar, start menu, my computer, recycle bin, windows accessories, system tools, communication, sharing information between programs.
UNIX: booting process, kernel , shell, directory structure and commands, vi editor.
Maximum marks for continuous assessment : 60
Maximum marks for university examination : 40

Software lab – II
Word processing : MS Word : - introduction to word processing, interface, toolbars, ruler, menus, keyboard shortcut, editing a document, previewing, documents, printing documents, formatting via find and replace, using the thesaurus, using auto correct, auto complete and auto text, word count, hyphenating, mail merge, mailing labels wizards and templates, handling graphics, tables and charts, converting a word document in to various formats.
Worksheet : MS Excel : - creating worksheet, entering data into worksheet, heading information, data text, dates, alphanumeric, values, saving & quitting worksheet, opening and moving around in an existing worksheet, toolbars and menus, keyboard shortcuts, working with single and multiple works book, working with formulas & cell referencing, formatting of worksheet.
Exercises related to section (D) of paper PGDCA- 3 (DBMS)
MS-Power point: creating slides , applying transitions and sound effect, setting up slide shows, animation.

Software Lab - III
(Programming To Be Implemented In C)
1. Programming to be developed based upon various constructs in the c language.
2. Searching and sorting algorithm to be developed in c language.

PGDCA – 10
Software Lab- IV
(Web designing, HTML and other scripting language )
HTML: tables, forms, frames and other text formatting tags.
DHTML: cascading style sheets and document object model.
JAVA SCRIPT: introduction to java script.

PGDCA – 11
Maximum marks: 80
Minimum pass marks: 40%

1. This paper will comprise of project work carried out by the students during the second semester simultaneously with the regular course work. The students can undertake the project based on any subject related to computer science / applications. The project should undergo all the phases of software development process, namely problem analysis, design, coding, testing and documentation. Joint projects will be allowed and joint project reports will also the students should highlight their contribution in a joint project report.
2. The student will submit three copies of the project. These copies need not be sent to the university. The examiners will evaluate these project reports at respective college and will conduct viva at college.
3. It will be conducted by two external examiners, however, the practical examination can be conducted by one external examiner, in case the second examiner fails to turn up.
4. Internal guide will be associated with external examiners. In case, due to any reason, if the internal guide is unable to be present, then the principal of the college/head of the department can appoint internal guide.
5. it is made clear, here that the internal guide will simply assist the external examiners, but the evaluation of the project will be done by the external examiners only.

M. Sc. (IT)
Semester – I
MS- III : mathematical foundation of computer science
Maximum Marks: 80 Lectures to be Delivered : 40 : 50
Minimum Pass Marks: 35% Time Allowed : 3 Hrs.
Instructions for paper-setters
The question paper will consist of five section A, B,C,D and E. Section A,B,C and D will have two questions from the respective sections of the syllabus and will carry 15% marks each. Section E will have 16 short answer type questions will cover the entire syllabus uniformly and will carry 40% marks in all.
Instruction for candidates
3. Candidates are required to attempt one question each from section A, B,C,D of the question paper and the entire section E.
4. Use of non-programmable scientific calculator is allowed.

Section – A
Fundamentals of set theory : set and subset, operations on sets, sequences, division in integers, matrices, mathematical structures.
Logic : propositions and logical operations, conditional statements, mathematical induction.
Counting : permutations, combinations, the pigeonhole principle, recurrence relations.
Section – B
Relation and digraphs : product set and partitions, relations and digraphs, paths in relations and digraphs, properties of relations, equivalence relations, computer representation of relations and digraphs.
Functions : function, functions for computer science, permutation functions, growth of functions.
Section – C
Graph theory : graphs, euler paths and circuits, Hamiltonian paths and circuits.
Order relations : partially ordered sets, lattices, finite Boolean algebras.
Functions on Boolean algebras.
Section – D
Tress : tress, labeled tress, tree searching, undirected tress, minimum spanning tress.
Groups: semi group, product and quotients of semi groups. Groups, product and quotients of groups.

MS-112 - Computer programming using C
Section –A

Problem solving with computers, c character set, identifier, constants, variables, rules for defining variables, data types, operators, arithmetic, relational, logical, comma, conditional, assignment, arithmetic expressions, input and output statements, assignment statements.
Section – B
Decision statement : if, if-else, nested if, switch statement, break statement , continue statement, go to statement.
Loops and control statements : while loop, for loop and do while loops, nested loops.
Arrays : one dimensional array, multi dimensional array, array initialization.
Section – C
Pointers : pointer data type, pointer and arrays, pointer and functions.
Functions: definition, declaration, function prototype, types of functions, call by value, call by reference, recursion, processing character strings.
Section – D
Structures : using structures, array of structures and arrays in structure, union.
Files in c : sequential files, random access files, unformatted files, text files, binary files.

MS-113 : Computer organization and architecture.
Section – A
Concepts about bits, bytes and word, number system : number conversions, arithmetic operations, integer and floating point representation.
Character codes (ASCII, EBCDIC, BCD, 8421, Excess- 3). Boolean algebra, K-maps.
Section – B
Basic gates, combinational logic design: half- adder, full adder, parallel adder.
Sequential circuits: concept, flip-flops (D,RS, JK, JK- Master-Slave , T ), counter ( Ripple, asynchronous, synchronous, decade, mod-5).
Instruction codes, instruction formats, instruction cycle, addressing modes.
Section – C
Register transfer language, arithmetic, logic and shift micro- operations, arithmetic logic shift unit control memory : design of control unit. Micro programmed and hardwired control unit (overview only ) . features of RISC and CISC.
Section – D
Memory organization : memory hierarchy, memory types: cache, associative and other types.
I/O organization : I/O interface, modes of data transfer : programmed I/O, interrupt initiated I/O, DMA.
Architecture and assembly language programming of 8085 machine.

MS-114 : Visual Basic
Section – A
Introduction to visual basic : creating user interface with windows common controls, creating menus for programs, advance design features, working with collections, creating classes in a program, working with active data objects.
Section – B
Working with forms, drawing with VB, multiple document interface, basic active X controls, advanced active X controls.
Extending the capabilities of visual basic : declaring and using external functions.
Creating Active X control with visual basic .
Communication with other programs : using active X server, creating active x client applications.
Section – C
Integrating visual basic with internet : writing internet application with visual basic, web browsing objects, using document object, active server pages, using web browser controls, using history objects.
Section – D
Creating database applications : accessing data with data control.
Using visual data manager, validating data, selected data with SQL, advanced data bound controls, active data objects, ADO data objects.

No comments:


Total Pageviews