Professional Documents
Culture Documents
Syllabus GVCC1
Syllabus GVCC1
1
GVF 2- Foundation course in English - II (4 Credits; 60 hours)
Unit - I
• Understanding a narrative passage from George Orwell’s novel animal form.
• Distinguish between words having related meaning and using them in appropriate context.
• Subject – Verb concord with the verb be, do and have.
• Writing a short speech presenting a view different from the one given in the passage
Unit – II
• Understanding a short story
• Using some words and it’s opposite
• Distinguishing between past indefinite and past perfect tense
• Creative writing by continuing the story in 3 different ways.
Unit – III
• Reading and understanding a short story and perceiving the sequence of events in it.
• Using some of the words occurring in the story.
• Using past present tense correctly.
• Using a series of sentences to form a connected story.
Unit – IV
• Reading and understanding a short story.
• Using some words occurring in the story in sentence.
• Using simple present tense and the present continuous tense in correctly.
• Using correct verb forms to express the future.
• Noticing deviations in a foreign speaker’s use of English.
• Re-writing a story in an abridged form
Unit – V
• Reading and understanding a story.
• Using some words both as nouns and verbs.
• Forming different questions.
• Writing the story from the point of view of some of the characters.
Unit -VI
• Reading and understanding a mystery story.
• Using words in different meanings.
• Using indirect speech to report statement and questions.
• Writing a short narrative composition based on experience.
Unit – VII
• Reading and understanding an expository passage.
• Using words in passage.
• Using the passive voice correctly.
• Writing a descriptive composition based on life in the pre- scientific age.
Unit – VIII
• Reading and understanding an interesting story.
• Using model auxiliaries correctly.
• Writing short composition expressing your views on a particular topic.
2
GVF 3 - Foundation course in Humanities and social sciences - I (4 credits; 60 hours)
Unit – I:
Studying human society; Evolution of Humankind; Emergence of Modern world; Post – Industrial society.
Unit –II:
Pre-colonial and colonial India- Indian National movement – Post – Independence India: Emerging
challenges.
Unit – III:
Social structure – Social Institutions – Marginalized groups – Social Change.
Unit – I
The Indian constitution – Democratic process – Administrative structure and processes – Governance
Unit – II
Planning in India – Performance of Indian Economy – Economic Reforms in India.
Unit – III
Human Security – Education and Awareness – Information and communication Technology – Peace &
conflict.
3
GVCCA-1- Digital Computer Fundamentals (4 credits; 60 hours)
Unit – I: Probability
Introduction – Rules of Probability – Conditional Probability – Baye’s Formula - Random Variables –
Continuous Random Variable – Discrete Random Variable - Mean and Variance –Distribution Random
Variable
4
Unit – III: Correlation and Regression
Correlation Coefficient – Rank Correlation – Linear Regression – Method of Least square - Fitting the
curve of The form y=a+bX, y=a+bX+CX2
Unit – I
C Fundamentals Character Set – Tokens - Identifier and Keywords – Data Types – Constants – Variables –
Declaration – Expressions – Statements – Operators – Library Functions
Unit – II
Data Input Output Functions – Simple C Programs – Flow of Control – if, if- Else, while, Do-While, for
Loop, Nested Control Structures – Switch, break, continue, goto statements – Comma operators
Unit –III
Function – Definition – Prototypes – Passing Arguments – Recursion – Storage Classes – Multi-file
Programs
Unit – IV
Arrays – Defining and processing – Passing arrays to functions – Multi dimensional arrays – Arrays and
string – Structures – User defined data types – Passing structures to functions – Self referential structures –
Unions- Bitwise Operations
Unit – V
Pointers – Declarations – Passing pointers to functions – Operation in Pointers – Pointer and Arrays –
Arrays of Pointers – Structures and Pointers – Files: Creating, Processing, Opening and Closing a data file.
Unit-II
CPU Components – CPU Registers – Instruction Set – Addressing Modes – Introduction to Motorola
68000 Microprocessors
5
Unit-III
Introduction to Assembly Language – Assembly language fundamentals – Input/Output services –
Assembly Language Program Development Tools – A Final look at the Assembly language programs
Unit-IV
Simple Assembly Programs – Loops and Comparisons – Arithmetic and Sting Operations
Unit-V
Arrays – Modular Programming – Interfacing Assembly language Routines to high language programs -
Interrupts
Unit- I
Introduction: Views- Goals - Types of System- OS Structure - Components - Services - System Structure -
Layered Approach - Virtual Machines - System Design and Implementation. Process Management: Process
- Process Scheduling - Cooperating Process - Treads - Inter-process Communication. CPU Scheduling:
CPU Schedulers - Scheduling Criteria - Scheduling Algorithms.
Unit- II
Process Synchronization: Critical-Section Problem - Synchronization Hardware - Semaphores Classical
Problems of Synchronization - Critical Region - Monitors. Deadlock: Characterization- Methods for
Handling Deadlocks - Deadlock Prevention - Avoidance - Detection - Recovery.
Unit- III
Memory Management: Address Binding - Dynamic Loading and Linking - Overlays - Logical and Physical
Address Space - Contiguous Allocation - Internal & External Fragmentation. Non-Contiguous Allocation:
Paging and Segmentation Schemes - Implementation - Hardware-Protection - Sharing - Fragmentation.
Unit- IV
Virtual Memory: Demand Paging - Page Replacement - Page Replacement Algorithms - Thrashing. File
System: File Concepts - Access Methods - Directory Structures - Protection Consistency Semantics - File
System Structures - Allocation Methods - Free Space Management.
UNIT- V
I/O System: Overview - I/O Hardware - Application I/O Interface - Kernel I/O Subsystem - Transforming
I/O Requests to Hardware Operations - Performance. Secondary Storage Structures: Protection - Goals -
Domain - Access matrix - The Security Problem - Authentication - Threats - Threat Monitoring -
Encryption.
Source
Silberschatz P.B.Galvin, Gange. Operating System Concepts 6th Edn. Addison-Wesley Publishing Co.,
2002.
H.M. Deitel, an Introduction to Operating System, Second Edition, Addison Wesley, 19
6
Unit-III Network Layer
Internet works- Packet Switching- Datagram’s approach- IP addressing methods- Subnetting- Routing-
Distance Vector routing- Routers
Suggested Readings
William Stallings,” Data and Computer Communications”, PHI, 2001
Douglas E. comer,” Internetworking with TCP/IP-Volume-I”, PHI, 1997
Unit - I
Principles of Object Oriented Programming (OOP) - Software Evaluation - OOP Paradigm - Basic
Concepts of OOP - Benefits of OPP - Application of OOP.
Unit - II
Introduction to C++ - Tokens - Keywords - Identifiers - Variables - Operators - Manipulators - Expressions
and Control Structures - Pointers - Functions - Function Prototyping Parameters Passing in Functions -
Values Return By Functions - Inline Functions - Friend and Virtual Functions.
Unit - III
Classes and Objects - Constructors and Destructors - Operator overloading - Type Conversions - Type of
Constructors - Function Overloading.
Unit - IV
Inheritance - Types of Inheritance - Virtual Functions and Polymorphism Constructors in inheritance -
Mapping Console I/O operations.
Unit - V
Files - File Streams - File Operations - File Pointer - Error Handling during File Operations - Command
line Arguments.
Source:
E. Balagurusamy - Object Oriented Programming with C++
Unit-I
Complete development of an Algorithms- Algorithm Basic steps in the compete development of an
algorithms- Some basic tools and algorithms- Top down structured program correctness.
Unit-II
Algorithm complexity- Time and Space complexity- Divide and conquer (General method) - Greedy
method- General method and Heuristics and backtrack programming.
Unit-III
List in C- Singly linked list- Linked Stacks and Queues- Circular Queues- Addition of Polynomials-
Circular List (Invert, concatenate, length , insert – front).
7
Unit-IV
Liner search- Binary search- Sorting- Insertion sort- Quick sort using recursion-2 way merge sort- Heap
sort- Bucket sort- Bubble sort- Shell sort.
Unit-V
Graph- Representing- Graph traversal (Depth first search and Breadth first search)- Tree- Fundamentals-
Binary Tree representation- Tree Traversal- Preorder- Post Order- In Order- Threading binary trees-
Concepts- In order Traversal using Threads.
Source:
Introduction to the Design and Analysis of Algorithm, by Goodman S.E and Hedentnelemi S. T. Mc. Graw
Hill
Computer Algorithms by E.Horowitz, S.Sahni and S.Rajasekaran-Galgotia-1999
Fundamentals of Data Structures by EllisHorowitz and S.Sahni.