faculty of it & computer science - parul...

Type of Course: MCA

Prerequisite: Knowledge of programming language (C/C++).

Rationale: To provide understanding of basics of data structures and their operation for efficient storage and retrieval of data.

Teaching and Examination Scheme:

Examination Scheme

External Internal

Theory Practical Theory *C.E. PracticalPTL

4 0

Teaching Scheme (Hrs./Week)

Credit Total

2 5 60 30 20 20 20 150

L-Lectures; T-Tutorial; P-Practical; C.E.-Continuous Evaluation

Contents:

Sr. Topic Weightage Teaching Hrs.

1

Introduction:

Primitive and non-primitive data structures, String manipulation and pattern matching, Storage representation of strings, Text handling, Key Word In Context (KWIC) indexing, Arrays, Storage structure for arrays, Special types of arrays – triangular and sparse.

10% 7

2

Stack and Queue:

Stack, Stack operations, Applications of stack - recursion, polish notations - prefix, infix, postfix, Algorithms of stack applications, Introduction to queue, Algorithms and implementation of simple queue, Circular queue, Double ended queue, Priority queue.

20% 12

3

Linked List:

Linked list, Algorithms and implementation of singly linked list, Doubly linked list, Circular linked list, Operations on linked list, Applications – polynomial representation, addition of two polynomials.

20% 8

4

Trees:

Concept and terminologies of tree, General tree, Binary tree and its storage representation, Binary search tree and its operations – create, insert, delete, Traversal of tree - inorder, preorder, postorder, Threaded tree, B tree and B+ tree, Height balanced tree - AVL tree, Rotations in AVL tree, Applications – heap tree, expression tree.

20% 12

5

Graph:

Concept and terminologies of graph, Representation of graph -adjacency matrix, adjacency lists, Introduction to graph traversal - Depth First Search (DFS), Breadth First Search (BFS), Introduction to spanning tree.

10% 5

Department of Computer Application

PARUL UNIVERSITY - FACULTY OF IT & COMPUTER SCIENCE

SYLLABUS FOR 2nd Sem MCA PROGRAMME

Data Structures (05201151)

6

Searching, Sorting and Hashing:

Linear search, Binary search, Bubble sort, Selection sort, Insertion sort, Shell sort, Quick sort, Heap sort, Merge sort, Radix sort, Hashing, Hashing functions, Collision resolution techniques.

20% 13

*Continuous Evaluation:

It consists of Assignments/Seminars/Presentations/Quizzes/Surprise Tests (Summative/MCQ) etc.

Reference Books:

1. An Introduction to Data Structures with Applications (TextBook)Jean-Paul Tremblay, Paul G. Sorenson; Tata McGraw-Hill; 2nd Edition, (2007)

2. Introduction to AlgorithmCormen, Leiserson, Rivest, Stein; PHI (2003); 2nd Edition

3. Data Structures using C and C++Tanenbaum; PHI

4. Expert Data Structures with CR. B. Patel

5. Theory and Problems of Data StructuresSeymour Lipschutz; Schaum’s Outline Series

6. Data Structures Through C++Yashavant Kanetkar; BPB

List of Practical:

1. Write a program to perform various stack operations using array

2. Write a program to convert infix expression to prefix and postfix expression using stack

3. Write a program to perform insert and remove operations on following

a. Simple Queueb. Circular Queuec. Priority Queue

4. Write a program to perform Double Ended Queue [Input Restricted / Output Restricted]

5. Write a program to create a singly link list in FIFO & LIFO form

6. Write a program to perform following singly link list operations

a. insert b. delete

c. search d. reverse

7. Write a program to create a doubly link list in FIFO & LIFO form

8. Write a program to perform following doubly link list operations

a. insert b. delete

c. search d. reverse

9. Write a program to add two polynomials

10. Write a program to perform following circular link list operations

a. insert b. delete

11. Write a program to create a binary search tree and print its element in

a. Inorder b. Preorder c. Postorder

12. Write a program for insertion of a node in B tree / B+ tree

13. Write a program to create a graph in a adjacency list structure traverse it in

a. DFS b. BFS

14. Write a program to perform following sort

a. Bubble Sort b. Selection Sort

c. Insertion Sort d. Shell Sort

e. Quick Sort f. Heap Sort

g. Merge Sort h. Radix Sort

15. Write a program to search an element using

a. Linear Search b. Binary Search

Type of Course: MCA

Prerequisite: Knowledge of any procedural programming language (preferably C language).

Rationale: To familiarize with the object oriented concepts of computer programming, to present the syntax and semantics of C++ language as well as basic data types offered by the language, to discuss the principles of object oriented model and its implementation in C++ language.


Examination Scheme

External Internal


3 0


Credit Total

4 5 60 30 20 20 20 150


Contents:


1

Object Oriented Principles and Basics of C++:

Introduction to object oriented approach, principles and programming, Comparison between procedural and object oriented programming, Introduction to class and object, Object oriented principles - data abstraction, encapsulation, inheritance, polymorphism, Identifiers and constants, Keywords, Data types, Operators, Casting operators, Conditional structures and looping constructs, Difference between structure and class, Union and class, Static data members, Pointers to objects and pointers to members of a class, Assigning objects.

10% 6

2

Functions, Constructors and Destructors, Operator Overloading:

Introduction to functions, Inline functions, Default arguments, Call by value and call by reference, Function prototypes and function overloading, Friend functions, Const and volatile functions, Static functions, Function pointers, Introduction to constructors, Explicit constructors, Parameterized constructors, Constructor overloading, Dynamic initialization, Dynamic allocation in constructors, Copy constructors, Destructors, Introduction to operator overloading, Overloading unary and binary operators, Operator overloading using friend function, Overloading other operators.

25% 11

3

Inheritance:

Introduction to inheritance, Base class and derived class, Types of inheritance, Constructors and destructors in inheritance hierarchy, Impact of public, private and protected access modifiers on derivation, Access control, Access declaration, Multiple inheritance, Virtual base class, Composite objects.

15% 6




Object Oriented Concepts And Programming (05201152)

4

Runtime Polymorphism and Runtime Type Identification:

Compile time and runtime polymorphism, Pointers to object, this pointer, Compatibility of derived and base class pointers, Subobject concept, Virtual functions, Default arguments to virtual functions, Virtual destructors, Pure virtual functions, Abstract class, Runtime type identification, Casting operators.

15% 9

5

Exception Handling, Templates and Namespaces:

Need for exception handling, Components of exception handling mechanism, Re-throwing an exception, Terminate an unexpected functions, Drawbacks of exception handling approach, Exception class, Function templates, Non generic (non-type) parameters in template functions, Template function and specialization, Using default arguments, Class templates, Classes with multiple generic data types, Static data members, Primary and partial specialization, Export keyword, Introduction and need of namespace, Using the namespace, Defining namespaces, Extending the namespace, Unnamed namespaces, Nested namespaces, Namespace aliases, Std namespace.

20% 9

6

IO Operations:

Introduction to stream concept, Predefined streams in C++, Formatted IO, Formatting using ios members, Manipulators, Creating custom manipulator, Text and binary streams, Opening and closing files, Dealing with text files, Dealing with binary files, Providing random access using seek, IO modes, Handling errors.

15% 8



Reference Books:

1. C++: The Complete Reference (TextBook)Herbert Schildt; McGraw Hill; 5th Edition

2. Programming with ANSI C++Bhushan Trivedi; Oxford University Press

3. C++ PrimerStanley Lippmann, Josee Lajoie and Barbara Moo; Addison-Wesley; 5th Edition

Useful Links:

https://sites.google.com/a/paruluniversity.ac.in/pu_mca-ii_oocp/

List of Practical:

1. Basic Programs [cout & cin]

1. Write a program to display "Hello World".

2. Write a program to taking input from the user and display those data.

2. Conditional & Looping Programs

1. Write a program to perform arithmetic operations with user input.

2. Write a program to check the number is even or odd.

3. Write a program to find factorial of a number (Note: Factorial of positive integer n = 1*2*3*...*n).

4. Write a program to add numbers entered by user until user enters 0.

3. Class & Objects

1. Write a program to take inputs from user and display it.

2. Write a program to enter the principal, rate & time and print the simple interest.

3. Write a program to enter an integer and print if it is prime or composite.

4. Write a program to convert Celsius to Fahrenheit.

4. Constructor, Destructor

Define a class to represent a bank account. Include the following members :

DATA MEMBERS MEMBER FUNCTIONS - Name of depositor

a) To assign initial values Account Number

b) To Deposit the amount Type of Account

c) To withdraw an amount after checking the Balance\ amount in account

d) To display name and balance

Write C++ program to handle 10 customers. Situation when withdrawal is not possible must be handled through exceptions handling feature of C++.

5. Function Overloading

Write a program that calculates the value of m raised to power n for both int and double data types.

6. Inheritance

1. Define a class Employees. Also define classes of MaleEmp and FemaleEmpinheriting from that. Define classes Officers, Clerks and peons again inheriting from Employee class. Define an array which contains 10 different types of employees. Define a function ReadDetails() in all above classes. All array elements should be able to be accessed in the same routine irrespective of their type.

2. ABC publishing company markets both book and audio cassette versions of its work. Create a class called publication that stores the title(a string) and price( type float) of a publication. From this class derive two classes : book , which adds a page count (type int); and tape, which adds playingtime in minutes (type float). Write a main program that reads both book and tape information in one array. When the user has finished entering data for all books and tapes, displays the resulting data for all the books and tapes entered. Also count no of book and cassette entries in the array usingruntime identification feature of C++.

7. Virtual Function

Create a base class called shape. Use this class to store two double type values that could be used to compute the area of figures. Derive three specific classes calledtriangle, rectangle and circle from the base shape. Add to the base class, a member function get_data( ) to initialize baseclass data members and another member function display_area( ) to compute and display the area of figures. Make display_area( ) as a virtual function and redefine this function in derived classes to suit their requirements. Using these three classes design a program that will accept dimensions of a triangle or rectangle interactively and store it in one array. After having read all the input display the area of all the figures whose area has been read in the program. Remember the two values given as input will be treated as lengths of two sides in the case of rectangle and as base andheight in case of triangle. In case of circle only one value should be accepted which will be taken as the radius and the default value of the next parameter should be 0.

8. Exception Handling

Define a class Car. Add data members as Make, Color, Size, and Cost. Write member functions for reading values and printing values of car. Define one more class as CarCollection. CarCollection contains array of cars. CarCollection class should contain member functions as Add, delete, modifyand replace. Collection is to be defined as friend of Car class. Use Exception Handling techniques to handle errors.

9. Template

Write a template function called find(). This function searches an array for an object. It returns either the index of the matching object (if one is found) or -1 if no match is found.

10. File Handling

1. Use an Employee Class to write records of employee to a file. Include a menu that will allow the user to select any of the following features a. Add a new record. b. Modify an existing record. c. Retrieve and display an entire record for a given name. d. Generate a complete list of all names, addresses and telephone numbers. e. End of the computation.

2. Write a program that reads a text file and creates another file that is identical except that sequence of consecutive blank spaces is replaced by single space.

Type of Course: MCA

Prerequisite: Introduction to computer organization and programming skills.

Rationale: To provide a comprehensive knowledge of operating system and its functions.


Examination Scheme

External Internal


3 0


Credit Total

2 4 60 30 20 20 20 150


Contents:


1

Introduction:

Operating system, Role, Purpose, Evolution of operating system, Types of operating system, Different views of operating system - system programmer’s and user’s view, Development leading to modern operating system.

Case study: Introduction to Linux / Windows system.

10% 4

2

Process Management and Threads:

Process concept, Process states, Process life cycle, Process Control Block (PCB), Process control, Operations on processes, Process scheduling and scheduling algorithms, Performance evaluation of scheduling algorithms.

Threads: Basic concepts, Types and elements, Thread models.

Case Study: Linux process and thread management.

20% 10

3

Memory Management:

Introduction, Logical address space, Physical address space, Partitioning, Fixed and variable size partitioning, Swapping, Contiguous memory allocation, Compaction, Fragmentation Methods-internal and external, Paging- multi level paging, hierarchical paging, Structure of page table- hashed page table, inverted page table, Segmentation, Example on pentium segmentation.

Virtual Memory: Introduction, Demand Paging, Page replacement, Page replacement algorithms, Belady’s anomaly, Transaction lookside buffer, Thrashing.

Case Study: Linux memory management.

20% 10




Operating Systems (05201153)

4

Inter-Process Communication and Synchronization:

Need for inter-process communication and synchronization, Principle of concurrency, Mutual exclusion - race condition, critical section, critical region, critical resource, starvation, Hardware support for mutual exclusion, Semaphore, Monitor, Message passing system, Producer/consumer problem, Reader/writers problem, Barbership problem.

Principles of Deadlock: Deadlock detection, Deadlock prevention, Deadlock avoidance, Recovery from deadlock, Banker’s algorithm, Dining philosopher’s problem, Live lock.

Case Study: Linux kernel concurrency.

25% 12

5

Principles of I/O and File System:

Principles of I/O Hardware: I/O devices, Device controllers, Direct memory access, Device drivers and device independent I/O software, User space I/O software.

File systems: Files and file system, File organization and access, Directory implementation, Record blocking, File system security.

Case Study: Linux I/O and virtual file system.

15% 8

6

Disk Scheduling:

Disk hardware, Disk scheduling algorithms, Disk cache, Error handling, Track-at-a-time caching, RAM disks, Clock hardware, Memory-mapped terminals, I/O software, RAID.

10% 4



Reference Books:

1. Operating Systems Internals and Design Principles (TextBook)William Stallings; PHI; 5th Edition

2. Operating System ConceptsAbraham Siberschatz; Wiley; Fifth

3. Operating Systems, Concepts and DesignMilan Milankovic; McGraw-Hill

4. Operating SystemsHarvey M Deital; Addison Wesley

List of Practical:

1. GENERAL-PURPOSE UTILITIES & THE FILE SYSTEM

GENERAL-PURPOSE UTILITIES

1. cal 8. who2. date 9. uname3. echo 10. tty 4. banner 11. stty 5. bc 12. exit 6. script 13. clear7. passwd

THE FILE SYSTEM

1. pwd2. cd3. mkdir4. rmdir5. ls

2. HANDLING ORDINARY FILES & PROCESS

HANDLING ORDINARY FILES

1. cat 7. file2. cp 8. wc3. rm 9. od4. mv 10. cmp5. more 11. comm6. lp 12. diff

THE PROCESS

1. Ps2. kill3. at4. batch5. time

3. SIMPLE FILTERS

SIMPLE FILTERS

1. pr2. head3. tail4. cut5. paste6. sort7. uniq8. tr

4. FILTERS USING REGULAR EXPRESSION

FILTERS USING REGULAR EXPRESSION- GREP AND SED

1. grep2. sed3. egrep4. fgrep

BASIC FILE ATTRIBUTES

1. chmod2. chown3. chgrp

5. Programs using shell script

1. Write a script to read four integer numbers from the user and find sum, product and average of these four numbers.

2. Write a script to implement simple calculator, which can perform basic mathematical operations to implement using menu driven:

a. Addition

b. Subtraction

c. Multiplication

1.i. Division

2. Write a script to calculate gross salary.3. Write a script to find factorial of given number.4. Write a script to find max and min number from the data passed through command line.

6. Shell script using loops

1. Write a script to calculate sum of series.

1+x+x^2+x^3+…+x^4

1. Write a script to find sum of any no. from command line argument.2. Write a script to print reverse string.3. Write a script to sum of digits of an entered number.4. Write a script to perform following string operation :

i. Find length of stringii. Extract substringiii. Find location of any character

7. More on loops

SET-7

1. Write a script to check given string is palindrome or not.2. Write a script to check whether a number is prime or not.3. Write a script to read a character from user. Determine whether it is uppercase letter, lower

case letter or digit.4. Write a script to sort the given numbers in ascending order.5. Write a script to check whether the file is ordinary or not.

8. Shell script using file or database

Write shell script to manage(add/update/view/delete) Judge database with Fields: JudgeName, CourtName, City,Cases_ judged,TotalCasses :

1. Display No of records2. Find Judge with highest cases judged3. Calculate total Cases of Court “Ahmedabad”4. List All Judge Names5. Exit


Write a Script for Simple LIBRARY Management System Operation. Database File Contains Following Fields. AccNo, Title, Author, Edition, Publisher

a. VIEW RECORD BASED ON QUERY

b. ADD RECORD

c. DELETE RECORD

d. COUNT TOTAL NUMBER OF RECORDS

e. EXIT


Write a script for Simple Database Management System Operation. Database File Contains Following Fields. EnrollNo, name, marks1, marks2, marks3 Marks are out of 100 and passing marks are 50 Provide Menu Driven Facility For

1. Display List of failed students2. Display Student wise percentages3. Add record4. Modify record5. Exit

Type of Course: MCA

Prerequisite: Basic understanding of real world systems, computerized system and business system.

Rationale: This subject aims at different system development methodologies and basic concepts of system analysis and design.


Examination Scheme

External Internal


3 0


Credit Total

0 3 60 0 20 20 0 100


Contents:


1

Introduction:

Concept of system, Basic components of system, Information systems categories, Data pyramid, System analyst role and need, Need of information system development.

10% 4

2

Information Requirements Analysis:

Classical Systems Development Life Cycle (SDLC) method, Requirement determination, System Requirement Specification (SRS), Fact finding techniques, Modern methods for determining systems requirements-Joint Application Development Program (JAD), Rapid Application Development (RAD) Quality Function Development (QFD).

20% 8

3

System Analysis:

Introduction to Structured System Analysis Development Methodology (SSADM) - system survey, structured analysis, structured design, hardware study, system implementation and maintenance, Tools for Analysis - decision trees, decision tables, structured english, Data flow diagram, Entity Relationship (ER) diagram, Data dictionary.

20% 12

4

System Design:

System design process and components, Designing effective output, Designing effective input, Software design alternatives and monitoring.

15% 9

5

Prototype Development Methodology and Tools:

Systems prototype method, Use of prototypes, Strategies for prototype development, Tools for prototype development

Introduction to project management tools, High-end tools, Back-end tools, CASE (Computer Aided Software Engineering) tools.

20% 10




Structured Systems Analysis and Design (05201154)

6

System Implementation and Maintenance:

System implementation methods (Parallel, direct cut-over, Pilot approach), Objectives for training, Training users, Maintenance-types of maintenance, maintenance cost, Reverse Engineering.

15% 7



Reference Books:

1. Analysis and Design of Information system (TextBook)James Senn; Mc Graw Hill

2. System Analysis & DesignS. Parthasarthy & B. W. Khalkar; Master Ed. Cons., Nashik; 1st Edition

3. Structured Analysis and DesignYourdon E. and Constantine L. L: Yourdon; Press, New York

4. Systems analysis and DesignKendall and Kendall; Prentice-Hall of India Private Limited; 5th Edition

5. System Analysis and DesignKenneth E. Kendall & Julie E. Kendall; PHI

Course Outcome:

After successful completion of this course, student will be able to:

• Understand basics of traditional structured system approach.• Analyse feasibility of various problems pertaining to information systems development.• Identify and analyse the system requirements using various system analysis techniques.• Design information system using structured technique.• Apply key modeling concepts that apply the traditional structured approach.

After Learning the course the students shall be able to:

Type of Course: MCA

Prerequisite: NIL

Rationale:


Examination Scheme

External Internal


0 0


Credit Total

2 1 0 60 0 20 20 100


Contents:


1

Application Lab:

Student will develop an application based on programming languages, tools and technologies covered in the curriculum.

100%



List of Practical:

1. Mini Project




Application Lab (05201155)

Type of Course: MCA

Prerequisite: Knowledge of Mathematics up to graduate level.

Rationale: The course provides introductory Numerical and statistical techniques, which will be useful for forecasting about software and hardware in computer field.


Examination Scheme

External Internal


4 0


Credit Total

0 4 60 0 20 20 0 100


Contents:


1

Error, Solution of Algebraic & Transcendental Equations:

Error, Type of errors, Significant digits, Round-off, error in the approximation of function Descartes’ rule of sign, Intermediate theorem, Bisection, False Position, Secant Method, Newton Raphson Method. Rate of convergence of methods without proof.

12% 6

2

Matrix and Solution of System Linear Equations:

Direct Methods: Gauss Elimination with Pivoting, LU decomposition Method, Iterative method: Gauss Seidel method.

10% 5

3

Interpolation:

Newton’s Forward Difference Interpolation, Newton’s Backward Difference Interpolation, Lagrange’s Interpolation and its inverse interpolation, Newton’s Divided Difference Interpolation.

12% 6

4

Numerical Integration:

Newton Cote’s formula, Trapezoidal rule, Simpson’s 1/3 and 3/8 rule. 4% 2

5

Solution of First Order Ordinary Differential Equations:

Euler’s method, Modified Euler’s method and Runge – Kutta method 6% 3

6

Curve Fitting:

Least Squares Approximation, Linear Least Square Approximation, Nonlinear least square approximation of higher order polynomial.

8% 4




Computer Oriented Numericals And Statistical Methods (05291151)

7

Descriptive Statistics:

Introduction to Statistics, Frequency distribution, Charts, Mean, Median, Mode, Percentiles, Variance, Standard Deviation, Coefficient of Variation, correlation coefficient.

8% 4

8

Probability & Probability Distribution:

Introduction to Probability, Experiments, Counting, Rules and Assigning Probabilities, Events and their Probabilities, Some basic Relationships of Probability, Conditional, probability, Baye’s theorem.

Random Variables: Discrete, Continuous, Discrete Probability Distributions, Expected Value & Variance, Uniform probability distribution, Binomial Probability Distribution, Poisson Probability distribution, Normal Probability Distribution, Exponential Probability distribution, Normal Approximation of Binomial Probabilities.

18% 9

9

Statistical Inference-Testing of Hypothesisχ^2 Test:

Introduction, Test of significance for Large Samples: Difference between Small & Large Samples, Hypothesis testing for Single Population- mean, Proportion, Variance, Two-tailed test for Difference between the Means of Two Samples, Standard Error of the Difference between two Standard Deviations. Tests of significance for Small Samples: The Assumption of Normality, Students’ t-Distribution, Properties & Applications of t-Distribution, Testing Difference between Means of Two Samples (Independent Samples, Dependent Samples), Definition of chi-square, Degrees of freedom, chi-square Distribution, Conditions for Applying chi square Test, Uses of chi-square Test, Misuse of chi-square Test.

22% 11



Reference Books:

1. Numerical Methods for Engineers (TextBook)Steven C Chapra, Raymond P Canale; Tata McGraw Hill Publication; 5th Edition

2. Mathematical MethodsS.R.K. Iyenger, R.K. Jain; Narosa Publication

3. Statistics for business and economicsAnderson, Sweeney, Williams; Thompson Publication; 9th edition

4. Statistical MethodsS P Gupta; S Chand & Sons; 30th edition

Course Outcome:

1.Solve linear and non-linear algebraic equations2.Apply statistical techniques in decision making in solving real-world problems3.Use computers to analyze the data

After Learning the course the students shall be able to:

List of Tutorial:

1. Roots of Algebraic and Transcendental Equations

2. Solution of System of Linear Equations

3. Interpolation

4. Numerical Differentiation and Numerical Integration

5. Solution of First Order Ordinary Differential Equation

6. Curve Fitting

7. Descriptive Statistics

8. Probability and Probability Distribution

9. Statistical Inference-Testing of Hypothesisχ^2 Test

Type of Course: MCA

Prerequisite: Basic knowledge of communication skills (LSRW).

Rationale: Basic communication and Reasoning Skills are essential for students.


Examination Scheme

External Internal


2 0


Credit Total

0 2 60 0 20 20 0 100


Contents:


1

Verbal and Non - Verbal Reasoning:

• Logical arrangement of words

• Verbal classification

• Seating arrangement

• Blood relations

• Paper Folding

• Completion of figures

• Non – Verbal Analogy

• Non – Verbal Classification

• Mirror image

• Water image

25% 10

2

Grammar and Vocabulary:

• Direct/Indirect Speech

• Degree of Comparison

• Basic Vocabulary (Global problems, phobia, health & medicine, Profession, fields of study etc.)

20% 6

3

Speaking Skills ( given more Weightage in Practical Exam):

• Group Discussion

• Meeting

• Movie Review Session

10% 3

Department of CDC



Communication And Reasoning Skills (05293151)

4

Reading Skills:

• General Awareness and Current Affairs for Competitive Exams

• Journals and Magazines

10% 1

5

Writing Skills (including writing skills of tutorial):

• Business letters

• Job application

35% 4



Reference Books:

1. Technical Communication : Principles And Practice 2008 (TextBook)Sangeetha Sharma, Meenakshi Raman; Oxford University Press, New Delhi (Green Cover Page)

2. Communication Skills 2011Kumar S and Lata P; Oxford University Press

3. Communicative Grammar of EnglishLeech, Geoffrey and Jan Svartvik; New Delhi: Pearson, 2009

4. Verbal Reasoning and Non Verbal ReasoningB. S. Sijwali and Indu Sijwali; Arihant

5. Technical CommunicationRao, P Subba, B Anita Kumar and C Hima Bindu; New Cengage Learning

6. Interview Skills and Group DiscussionPraveen Joe; Laxmi Publication

7. English Vocabulary in UseMichael McCarthy and Felicity O’Dell; 2006, Cambridge University Press

8. Basic Vocabulary for Competitive ExaminationEdgar Thorpe and Showick Thorpe; Dorling Kindersley (india)

List of Tutorial:

1. Vocabulary Drill

2. Speaking Skills

• Presentation Task• Group Discussion• Role Play• ITEP and IELTS general speaking task 2

i. Comparison and contrastii. Problem and solution.

3. Writing Skills

• Letter Writing• Report Writing (for newspaper)

Cultural event,

Tech fest,

Industrial visit,

Placement news,

Alumni meet,

• Job Application - Resume Building• Minutes of meeting • Dialogue Writing

4. Developing reading Skill

• Book Review• List of Books Suggested for the Book Review• The Secret by Rhonda Byrne• Who Moved My Cheese by Dr Spancer Johnson • You Can Win by Shiv Khera• I am Ok You are Ok by Thomas Harris• The Seven Habits of Highly Effective People by Stephen Covey• The Eighth Habit by Stephen Covey• Bhagvat Gita on Effective Leadership by Poojan Roka• The Kalam Effect by Nair• Tough Times Never Last But Tough People Do by Dr. Robert Schuller• What Employers Want But Business Schools Don't Teach by Yasmin D'sousa and Amitabh

Singh• Freedom is not Free by Shiv Khera• Be an Extraordinary Person in an Extraordinary World by Robert Schuller • Making Miracles by Arnold Fox and Barry Fox• The Road Less Travelled by M. Scott Peck to Name a few.• The saint, the surfer and the CEO by Robin Sharma• Attitude is Everything by Jeff Keller

NOTE: These are few references of books. Students can prepare book review on a book of their choice after consulting tutorial faculty

5. Listening

• Motivational speech

faculty of it & computer science - parul...

Documents