CSE306:COMPUTER NETWORKS

L:3 T:0 P:0 Credits:3

Course Outcomes: Through this course students should be able to

CO1 :: define network topologies, models and functionalities of different layers

CO2 :: explain data communication, transmission media and modulation at physical layer

CO3 :: identify error handling and use of multiple access protocols in a network.

CO4 :: demonstrate the concepts of classful and classless ip addressing scheme

CO5 :: analyze various routing protocols and congestion control mechanisms

CO6 :: illustrate the services provided by transport and application layer

Unit I
INTRODUCTION : Network software architecture and its layers and protocols, Network hardware
architecture and its topologies and device like HUB, Switch and Routers, Uses of Computer Networks,
Networks and Types, Introduction to internet, browser, web server, URL, domain name, IP address,
packets
NETWORK MODELS : Protocol Layering, TCP/IP protocol suite, OSI Model

Unit II
PHYSICAL LAYER: Signal & Media : Basics for Data Communications and Analog and Digital
signals, Transmission Impairments and Performance, Data Rate, Transmission media like Guided and
Unguided media, Cabling standards
PHYSICAL LAYER: Modulation & Multiplexing : Digital to Digital Conversion, Analog to Digital
Conversion, Analog to Analog conversion, Digital to Analog conversion, Multiplexing
Unit III
DATA LINK LAYER : Data link Layer design issues, Elementary Datalink Protocols, Error Detection
and Correction- Hamming code, CRC, Parity, Checksum, Switch working
MAC SUBLAYER : Multiple Access Protocols- ALOHA, CSMA and CSMA/CD, Random Access,
Controlled access, Ethernet protocol
Unit IV
NETWORK LAYER: IP Addressing : Network layer design issue, IP Addressing Both Classfull and
Classless, Subnetting and Supernetting, Subnetting examples, Network layer services, Network layer
performance, Forwarding of IP packets, IP Header, IPv6 addressing
Unit V
NETWORK LAYER: Routing : Routing Algorithm-Shortest path algorithm, Distance vector Routing,
Link State routing, Routing algorithms, Unicast routing protocols
NETWORK LAYER: Congestion Control : Congestion Control Algorithms

Unit VI
TRANSPORT LAYER : Transport Layer Services, TCP- Header format and handshaking operation,
UDP- Header format
APPLICATION LAYER : Domain Name System, E Mail, FTP

Text Books:
1. DATA COMMUNICATIONS AND NETWORKING WITH TCPIP PROTOCOL SUITE by BEHROUZ
A. FOROUZAN, Tata McGraw Hill, India
References:
1. COMPUTER NETWORKS by ANDREW S. TANENBAUM, PEARSON

Session 2023-24 Page:1/2

Session 2023-24 Page:2/2
 CSE211:COMPUTER ORGANIZATION AND DESIGN
L:3 T:1 P:0 Credits:4

Course Outcomes: Through this course students should be able to

CO1 :: recognize the need and understanding of basic building blocks of digital circuits

CO2 :: discuss about the usability of various functional components of a digital computer

CO3 :: apply the knowledge of building blocks to get more insights about the working operations
of various functional components of digital system
CO4 :: categorize the different types of transfer schemes and analyze the process of direct
memory access

CO5 :: illustrate and getting more insights about the interconnection structure of memory

CO6 :: define pipelining and provide the technical insights about the latest trends of computer
architecture

Unit I
Basics Of Digital Electronics : registers, shift registers, Introduction to combinational circuit,
introduction to sequential circuits
Register Transfer and Micro Operations : Bus and Memory Transfer, Logic Micro Operations, Shift
Micro Operations, register transfer language, register transfer, arithmetic logic shift unit
Unit II
Computer Organization : instruction codes, computer registers, common bus system, computer
instructions, timing and control, instruction cycle, memory reference instructions, input-output and
interrupt
Unit III
Central Processing Unit : General Register Organization, Stack Organization, Addressing Modes,
Reduced instruction set computer, Complex instruction set computer, instruction formats
Unit IV
Input-Output Organization : Peripheral Devices, Input Output Interface, Data Transfer Schemes,
Program Control and Interrupts, Direct Memory Access Transfer and Input/Output Processor, Priority
interrupt, Direct memory access transfer, Input/Output processor., modes of data transfer, Processor
status word
Unit V
Memory Unit : Memory Hierarchy and Processor Vs Memory Speed, Associative Memory, Memory
Management, Memory hierarchy, Cache memory, Virtual memory, main memory, auxiliary memory
Unit VI
Computer Arithmetic : Addition and Subtraction Algorithm, Multiplication Algorithm

Introduction to Parallel Processing : Pipelining, Characteristics of multiprocessors,

Interconnection Structures, parallel processing
Latest technology and trends in computer architecture : next generation processors
architecture, microarchitecture, latest processor for smartphone or tablet and desktop

Text Books:
1. COMPUTER SYSTEM ARCHITECTURE by M. MORRIS MANO, RAJIB MALL, PEARSON

References:
1. COMPUTER ORGANIZATION AND ARCHITECTURE by WILLIAM STALLINGS, PEARSON

Session 2023-24 Page:1/2

Session 2023-24 Page:2/2
 CSE202:OBJECT ORIENTED PROGRAMMING
L:3 T:0 P:2 Credits:4

Course Outcomes: Through this course students should be able to

CO1 :: identify basic programming constructs and use the newly acquired skills to solve
extensive programming problems.

CO2 :: discuss the mechanism of code reusability by creating own libraries of functions.

CO3 :: validate the logic building and code formulation by designing code capable of passing
various test cases.
CO4 :: interpret the principles of the object-oriented model and apply it in the implementation in
C++ language.

CO5 :: develop accurate, reliable and efficient software applications.

CO6 :: apply the knowledge acquired to develop software applications.

Unit I
Concepts and Basics of C++ Programming : Reading and writing data using cin and cout,
Creating classes, Class objects, Accessing class members, Differences between Structures, Unions,
Enumerations and Classes, Inline and Non-inline member functions, Static data members and static
member functions, Differences between procedural and object oriented programming paradigms,
Features of Input/output Streams
Functions : Functions with Default parameters/arguments, Inline Functions, Manipulator Functions,
Function overloading and Scope rules, Friend of a class (friend function and friend class), Reference
variables, Differences between Call by value, Call by address and call by reference, Recursion
(Function, Member Function)
Unit II
Pointers, Reference Variables, Arrays and String Concepts : Void pointer, Pointer arithmetic,
Pointer to pointer, Possible problems with the use of pointers - Dangling pointer, Wild pointer, Null
pointer assignment, Classes containing pointers, Pointer to objects, this pointer, Array of objects, The
Standard C++ string class-defining and assigning string objects, Member functions, Modifiers of string
class, Differences between pointer and reference variables, Array declaration and processing of
multidimensional arrays(inside main and inside class), Pointer to data member
Unit III
Data File operations : Opening and closing of files, Modes of file, File stream functions,
Reading/Writing of files, Sequential access and random access file processing, Binary file operations,
Classes and file operations, Structures and file operation
Constructors, Destructors and File Handling : Manager functions (constructors and destructor),
Default constructor, Constructor with default arguments, Destructors, Parameterized constructor,
Copy constructor , Initializer lists
Unit IV
Operator Overloading and Type Conversion : Operator Overloading (unary operator, binary
operator overloading), Type conversions - basic type to class type, class type to basic type
Inheritance : Inheritance Basics – derived class and base class, Types (simple, multi-level, multiple
and hierarchical), Modes (private, protected, public inheritance), Overriding member functions, Order
of execution of constructors and destructors, Resolving ambiguities in inheritance, Virtual base class,
Aggregation and Composition.
Unit V
Dynamic Memory Management and Polymorphism : Dynamic memory allocation using new and
delete operators, Virtual destructors, Compile and run time polymorphism, Virtual functions, Dynamic
constructors, Abstract classes and concrete class, Introduction to Self-Referential class, Pure virtual
functions, Early binding and late binding, Memory leak and allocation failures
Unit VI
Exception Handling, Templates and Standard Template Library (STL) : Basics of exception
handling, Exception handling mechanism, Throwing mechanism, Catching mechanism, Rethrowing an
exception, Function template and class template, Class template with inheritance, Introduction to
STL- Containers, Algorithms and iterators, Container - Vector and List

List of Practicals / Experiments:

Session 2023-24 Page:1/2

 List of Practicals / Experiments:
• Concepts and Basics of C++ Programming: Programs to define classes and structures,Program to
demonstrate inline, non inline member functions and Static function
• Functions :Program to implement function overloading, friend function and friend class,Program to
demonstrate the difference between call by value, call by address and call by reference
• Pointers, Reference Variables, Arrays and String Concepts: Program to demonstrate the type of
pointers,Program to process multidimensional array and array of objects
• Constructors, Destructors and File Handling: Program to demonstrate constructor, destructor and
type of constructors
• Data File operations: Program to demonstrate the modes of file, Program to demonstrate type of files

• Operator Overloading and Type Conversion: Program to demonstrate the operator overloading and
type conversion
• Inheritance: Program to demonstrate the type of inheritance,Program to demonstrate the ambiguities
in inheritance
• Dynamic Memory Management and Polymorphism : Program to use new and delete for dynamic
memory management,Program to demonstrate the compile time and run time polymorphism,
Program to demonstrate abstract class and dynamic constructor
• Exception Handling, Templates and Standard Template Library (STL) :Program to demonstrate
exception handling, Program to demonstrate function template and class template,Program to
demonstrate STL- Containers, Algorithms and Iterators.

Text Books:
1. OBJECT ORIENTED PROGRAMMING IN C++ by ROBERT LAFORE, PEARSON

References:
1. PROGRAMMING WITH C++ by D RAVICHANDRAN, MCGRAW HILL EDUCATION

2. OBJECT ORIENTED PROGRAMMING IN C++ by E BALAGURUSAMY, MCGRAW HILL

EDUCATION

Session 2023-24 Page:2/2

 CSE205:DATA STRUCTURES AND ALGORITHMS
L:3 T:0 P:2 Credits:4

Course Outcomes: Through this course students should be able to

CO1 :: understand the time and space complexity of programs and data-structures.

CO2 :: illustrate the importance of Linked List in context of real world problems

CO3 :: differentiate the Stack and Queue data structures for problem solving

CO4 :: use of recursion in iteration process and tree data structure

CO5 :: analyze the effectiveness of AVL Tree and Heap Data Structures

CO6 :: use of Graph and Hashing techniques in problem solving

Unit I
Introduction : Basic Concepts and Notations, Complexity analysis: time space and trade off, Omega
Notation, Theta Notation, Big O notation, Basic Data Structures.
Arrays : Linear arrays: memory representation, Array operations: traversal, insertion, deletion,
sorting, searching and merging and their complexity analysis.
Sorting and Searching : Bubble sort, Insertion sort, Selection sort

Unit II
Linked Lists : Introduction, Memory representation, Allocation, Traversal, Insertion, Deletion, Header
linked lists: Grounded and Circular, Two-way lists: operations on two way linked lists
Unit III
Stacks : Introduction: List and Array representations, Operations on stack (traversal, push and pop),
Arithmetic expressions: polish notation, evaluation and transformation of expressions.
Queue : Array and list representation, operations (traversal, insertion and deletion), Priority Queues,
Deques
Unit IV
Trees : Binary trees: introduction (complete and extended binary trees), memory representation
(linked, sequential), Binary Search Tree: introduction, searching, insertion and deletion, In-order
traversal, Pre-order traversal, Post-order traversal using recursion
Recursion : Introduction, Recursive implementation of Towers of Hanoi, Merge sort, Quick sort

Unit V
AVL trees and Heaps : AVL trees Introduction, AVL trees Insertion, AVL trees Deletion, Heaps:
Insertion, Heaps: Deletion, HeapSort, Huffman algorithm
Unit VI
Graphs : Warshall's algorithm, Graph Traversal: BFS, DFS, Shortest path algorithm Floyd Warshall
Algorithm(modified warshall algorithm)
Hashing : Hashing introduction: hash functions, hash table, Open hashing (separate chaining),
Closed hashing (open addressing): linear probing, quadratic probing and double hashing.

List of Practicals / Experiments:

Array
• Program to implement insertion and deletion operations in arrays

Searching
• Program to implement different searching techniques - linear and binary search

Sorting
• Program to implement different sorting techniques – bubble, selection and insertion sort

Linked List
• Program to implement searching, insertion and deletion operations in linked list

Session 2023-24 Page:1/2

 Doubly Linked List
• Program to implement searching, insertion and deletion operations in doubly linked list

Stack
• Program to implement push and pop operations in stacks using both arrays and linked list

Queues
• Program to implement enqueue and dequeue operations in queues using both arrays and linked list

Recursions
• Program to demonstrate concept of recursions with problem of tower of Hanoi

Recursive Sorting
• Program to implement recursive sorting techniques - merge sort, quick sort

Tree
• Program to create and traverse a binary tree recursively

Binary Search Tree

• Program to implement insertion and deletion operations in BST

Heaps
• Program to implement insertion and deletion operations in Heaps and Heap Sort

Text Books:
1. DATA STRUCTURES by SEYMOUR LIPSCHUTZ, MCGRAW HILL EDUCATION

References:
1. DATA STRUCTURES AND ALGORITHMS by ALFRED V. AHO, JEFFREY D. ULLMAN AND JOHN
E. HOPCROFT, PEARSON

Session 2023-24 Page:2/2

 CSE307:INTERNETWORKING ESSENTIALS
L:0 T:0 P:2 Credits:1

Course Outcomes: Through this course students should be able to

CO1 :: understand the concept of internetworking devices and associated protocols

CO2 :: perform the working of various commands for internetworking

CO3 :: discuss routing protocol for static and dynamic routing using VLSM and FLSM

CO4 :: analyze the practical utilization of server configuration

CO5 :: explore the working of classfull and classless addressing scheme

CO6 :: establish end to end connectivity using network utilities in a simulation environment

List of Practicals / Experiments:

Network hardware and IP addressing concept

• Working of hub, switch and Router, Adding of interfaces in devices

• Cabling - Creation of straight and Cross cable using crimping tool

• IP addressing basics, configuration using CLI, VLSM and FLSM on single router

• Implementation of Star, Mesh, Bus and Hybrid Topology

Network Commands
• Ping, tracert, arp, netstat, ipconfig, ftp, nslookup, snmpget, snmpgetbulk and snmpset (use DOS and
scenario based configuration)
Network layer routing protocols
• Implementation of Static Routing using Classfull and classless (FLSM)

• Implementation of Static Routing using VLSM

• Routing information Protocol(RIP) using classfull and classless (FLSM)

• Routing information rotocol(RIP) using VLSM

Server Configuration and LAN Setup

• Implementation of FTP, Implementation of HTTP and Email setup on server

• Implementation of DNS, Implementation of DHCP

• Implementation of LAN with configuration of inter-networking devices and any application layer
protocol
IPv6 addressing and routing
• IPv6 Addressing & Stateless Address Auto Configuration (SLAAC)

• IPv6 Neighbor Discovery

• IPv6 Static Routing

• IPv6 Dynamic Routing

Text Books:
1. COMPUTER NETWORKS by ANDREW S. TANENBAUM, PEARSON

References:
1. DATA COMMUNICATION AND NETWORKING by BEHROUZ A. FOROUZAN, MCGRAW HILL
EDUCATION

Session 2023-24 Page:1/2

Session 2023-24 Page:2/2
 CSE325:OPERATING SYSTEMS LABORATORY
L:0 T:0 P:2 Credits:1

Course Outcomes: Through this course students should be able to

CO1 :: gain a comprehensive introduction to the Linux operating system, including basic
commands, system calls, and file management operations, enabling them to work effectively in a
Linux environment.

CO2 :: develop skills in shell programming, including handling variables, standard input/output
redirection, shell arithmetic, and flow control, enhancing their ability to write efficient shell
scripts.

CO3 :: perform file and directory management using system calls, allowing them to manipulate
files, directories, and their attributes programmatically.
CO4 :: gain hands-on experience in implementing and managing threads and concurrency
mechanisms.

CO5 :: demonstrate the ability to implement and use synchronization mechanisms such as
semaphores and mutexes.
CO6 :: use inter-process communication techniques such as pipes, popen, pclose, shared
memory and message passing to facilitate data exchange and synchronization between
processes.

List of Practicals / Experiments:

Process creation and threading

• Creating processes

• Creating Threads

• Process duplication using fork()

• Creating threads using pthread

• Environment variables

• Replacing process image using execlp

Inter-process communication
• Pipes, popen and pclose functions

• Stream pipes, passing file descriptors

• Shared memory

• Message passing

• Remote Procedure calls

Introduction to Linux
• Basic Linux Commands: ls, cat, man, cd, touch, cp, mv, rmdir, mkdir, rm, chmod, pwd

• System Calls: Read, Write, Open

• Lseek

Synchronization
• Synchronization with Mutexes

• Synchronization with semaphores

• Race Condition

shell programming
• variables

Session 2023-24 Page:1/2

 • standard input/output redirection

• shell arithmetic

• flow control and decision making

File and directory management using system calls

• File related system calls (open, read, write, lseek, close)

• Directory related system calls (opendir, readdir, closedir etc)

Text Books:
1. BEGINING LINUX PROGRAMMING by NEIL MATHEW & RICHARD STONES, WILEY

References:
1. OPERATING SYSTEM CONCEPTS by ABRAHAM SILBERSCHATZ, GALVIN, WILEY

2. UNIX CONCEPTS AND APPLICATIONS by SUMITABHA DAS, Tata McGraw Hill, India

Session 2023-24 Page:2/2

 MTH302:PROBABILITY AND STATISTICS
L:3 T:0 P:0 Credits:3

Course Outcomes: Through this course students should be able to

CO1 :: recall the concept of random variables and its distribution functions.

CO2 :: recognize relationships among the variables through correlation and regression.

CO3 :: apply probability distributions to find the solution of different engineering problems.

CO4 :: describe sample, population and statistical inference.

CO5 :: understand hypothesis testing and its applications.

Unit I
Random Variables and Probability
Distributions : discrete and continuous random variables and their distribution functions, joint
probability distributions, mean, variance and covariance of random variables, Chebyshev's theorem(
without proof)
Unit II
Correlation and Linear regression : scatter plots, correlation coefficient and its properties, Karl
Pearson’s correlation coefficient, Spearman’s rank correlation coefficient, Linear regression and its
properties
Unit III
Special Discrete Distributions : the Bernoulli process, binomial distribution and its moment
generating function (mgf), negative binomial distribution and its mgf, geometric distribution and its
mgf, Poisson distribution and its mgf
Unit IV
Special Continuous Distributions : normal distribution and its mgf, normal approximation to the
binomial, gamma distribution and its mgf, exponential distribution and its mgf
Unit V
Point Estimation and the Central Limit Theorem : unbiased estimator, consistent estimator,
efficient and sufficient estimator, likelihood function and maximum likelihood estimation, the central
limit theorem(without proof)
Unit VI
Hypothesis Testing : Types of Error, F-test, Student t-test for single mean and difference of means,
Z-test for single mean and difference of means, Chi-square test for goodness of fit

Text Books:
1. PROBABILITY AND STATISTICS FOR ENGINEERS AND SCIENTISTS by RONALD E.
WALPOLE, RAYMOND H. MYERS,SHARON L. MYERS, AND KEYING YE, PEARSON
References:
1. PROBABILITY STATISTICS AND RANDAM PROCESSES by T VEERARAJAN, MCGRAW HILL
EDUCATION
2. FUNDAMENTALS OF MATHEMATICAL STATISTICS by S.C.GUPTA AND V.K.KAPOOR, SULTAN
CHAND & SONS (P) LTD.

Session 2023-24 Page:1/2

Session 2023-24 Page:2/2
 CSE316:OPERATING SYSTEMS
L:3 T:0 P:0 Credits:3

Course Outcomes: Through this course students should be able to

CO1 :: understand the role, functionality and layering of the system software components.

CO2 :: use system calls for managing processes, memory and the file system.

CO3 :: Analyze important algorithms eg. process scheduling and memory management
algorithms
CO4 :: use and outline the various security measures that ensure threat free operation of a
system

CO5 :: apply various operations on processes, threads and analyze methods to synchronize their
execution
CO6 :: simulate inter-process communication techniques like message passing and shared
memory

Unit I
Introduction to Operating System : Operating System Meaning, Supervisor & User Mode, review
of computer organization, introduction to popular operating systems like UNIX, Windows, etc., OS
structure, system calls, functions of OS, evolution of OSs
Process Management : PCB, Operations on Processes, Co-operating and Independent Processes,
Inter-Process Communication, Process states, Operations on processes, Process management in
UNIX, Process concept, Life cycle, Process and threads
Unit II
CPU Scheduling : Types of Scheduling, Scheduling Algorithms, Scheduling criteria, CPU scheduler -
preemptive and non preemptive, Dispatcher, First come first serve, Shortest job first, Round robin,
Priority, Multi level feedback queue, multiprocessor scheduling, real time scheduling, thread
scheduling
Unit III
Process Synchronization : Critical Section Problem, Semaphores, Concurrent processes, Co-
operating processes, Precedence graph, Hierarchy of processes, Monitors, Dining Philosopher Problem,
Reader-writer Problem, Producer consumer problem, classical two process and n-process solutions,
hardware primitives for synchronization
Threads : Overview, Multithreading Models, scheduler activations, examples of threaded programs

Unit IV
Deadlock : Deadlock Characterization, Handling of deadlocks- Deadlock Prevention, Deadlock
Avoidance & Detection, Deadlock Recovery, Starvation
Protection and Security : Need for Security, Security Vulnerability like Buffer overflow, Trapdoors,
Backdoors, cache poisoning etc, Authentication-Password based Authentication, Password
Maintenance & Secure Communication, Application Security - Virus, Program Threats, Goals of
protection, Principles of protection, Domain of protection, Access matrix, Implementation of access
matrix, System and network threats, Examples of attacks
Unit V
Memory Management : Logical & Physical Address Space, Swapping, Contiguous Memory allocation,
Paging, Segmentation, Page replacement algorithms, Segmentation - simple, multi-level and with
paging, Page interrupt fault, Fragmentation - internal and external, Schemes - Paging - simple and
multi level, Overlays - swapping, Virtual memory concept, Demand paging
Unit VI
File Management : File Concepts, Access methods, Directory Structure, File System Mounting and
Sharing, Protection, Allocation methods, Free-Space Management, Directory Implementation
Device management : Dedicated, shared and virtual devices, Serial access and direct access
devices, Disk scheduling methods, Direct Access Storage Devices – Channels and Control Units
Inter process communication : Introduction to IPC (Inter process communication) Methods, Pipes
- popen and pclose functions, Co-processes, Shared memory, Stream pipes, FIFOs, Message queues,
Passing File descriptors, Semaphores

Text Books:
1. OPERATING SYSTEM CONCEPTS by ABRAHAM SILBERSCHATZ, PETER B. GALVIN, GERG
GAGNE, WILEY

Session 2023-24 Page:1/2

References:
1. DESIGN OF THE UNIX OPERATING SYSTEM by MAURICE J. BACH, Pearson Education India

2. REAL-TIME SYSTEMS by JANE W. S. LIU, Pearson Education India

Session 2023-24 Page:2/2

 PEL136: ADVANCED COMMUNICATION SKILLS-II
L-1 T-0 P-3 Credits: 3

Course Outcomes: Through this course students should be able to

● understand nuances and subtleties of English grammar ensuring effective communication

● apply active listening techniques to enhance engagement during spoken communication
● analyze the structure of the context and extract relevant information from written correspondence
● evaluate texts critically that reflect multiple perspectives
● devise & deliver coherent speeches or presentations on varied situations
● construct diverse written compositions using accurate grammar, lexical resources and a wide range of
sentence structures

Language Skills

Listening: multiple choice questions, subjective questions, taking detailed notes on given information,
giving opinion,fill in the blanks, matching the statements,correcting the order, completing the chart

Speaking: role plays, group activities, pair activities, individual presentations, storytelling,
problem-solving discussions, simulations

Reading: subjective questions, matching statements with authors, word meaning, multiple choice
questions, answering true, false and not given questions, matching paragraphs with summary, fill in the
blanks, finding title, matching the word with correct definition, fact or opinion based questions

Writing: paragraph writing, message writing, story writing, critical review writing, website post
writing,taking notes, writing biography, essay writing, personal statement writing

ASSOCIATED LANGUAGE SKILLS

Grammar: gerund phrases as subjects and objects, usage of past participles as adjectives, specified
structure of words like Need & Keep, Simple past tense, Past continuous tense & Past Perfect tense,
making requests & suggestions, past modals for degree of certainty , judgments & suggestions, Passive
form of present continuous & present perfect tenses, prepositions of cause ,infinitive clauses & phrases,
would rather, would prefer and By +gerund, referring to time in past, time clauses, predicting the future,
expressing regret & describing hypothetical situations, giving recommendations & opinion with passive
modals, tag Questions, past and future accomplishments using simple past ,present perfect and future
tense

Vocabulary: suffixes, verb-noun collocations, exceptional events, problems with electronics, global
challenges, life skills, three-word phrasal verbs, historic events, personal characteristics, reactions,
community issues, antonyms

Practical: listening to description of jobs, requests, important events, and various problems, listening to
issues, complaints and solutions, listening to experts and news stories, speaking on various topics,
narrating a story, possible careers, making requests, problems and preferences, talking about historic
events, describing milestones, giving opinions, drawing conclusions, reading about different workplaces,
reading about online content, reading about contemporary issues, reading about various study styles,
reading about future, reading about personal conflict, reading about sports, paragraph writing, writing
about internet and social sites, writing essay, review and various types of messages, story writing,
biography writing, writing about career and personal statement for an application

Text Books:

1. INTERCHANGE LEVEL 3 by JACK C. RICHARDS, with JONATHAN HULL, with SUSAN PROCTOR, CAMBRIDGE
UNIVERSITY PRESS
References:

1. ENGLISH GRAMMAR IN USE by RAYMOND MURPHY, CAMBRIDGE UNIVERSITY PRESS

 PEL132: COMMUNICATION SKILLS II

L:1 T:0 P:3 Credits: 3

Course Outcomes: Through this course students should be able to

• understand vocabulary, intonation and style of connected discourse as the basis for developing language
skill
• demonstrate the unique qualities of professional writing style
• employ correct linguistic structures when expressing ideas
• appraise the written & spoken text to understand the various components of comprehension
• develop adequate skills to communicate effectively
• produce different pieces of communication using appropriate grammar and lexical resources

Language Skills

Listening: listening to people in different roles and situations, listen to answer, fill ups, understanding
context, matching statements, true/false, paraphrasing the text, making comparisons, making inferences,
understanding details, understanding theme, recreating dialogues, understanding the analysis & reviews

Speaking/Pronunciation: giving self-introduction, giving description, discussions in small groups,

presenting information, giving opinions, making a short talk, interviewing a partner, working in groups
and enacting roles, discussing possible scenarios, describing change, comparing different times and their
consequences, describing abilities and skills, taking stance, showing agreement and disagreements,
syllable stress, stress and rhythm

Reading: understanding meaning in context, understanding themes, matching questions and answers,
inferring information, finding comparisons, writing crux, making notes and recreating text

Writing: paragraph writing, cover letter, report, review, writing articles, making notes, making lists,
blogs, messaging, story writing, making profile, explanation of points, précis

ASSOCIATED LANGUAGE SKILLS

Grammar: past tense, evaluation and comparisons with adjectives, future tense and modal verbs, two-
part verbs, infinitives and gerunds for uses and purpose, relative clauses of time, time contrasts,
conditional sentences, gerunds, short responses, past continuous vs. simple past, participles as adjectives,
unreal conditional sentences with if clauses, reported speech

Vocabulary: vocabulary for sharing memories, lifestyle vocabulary, travel vocabulary, phrases,
technology vocabulary, holidays and festival vocabulary, collocation, words describing personality
(adjectives), words describing actions(adverbs), synonyms, antonyms, verb-noun collocations

Practical: : listening to people talk about their life experiences, listening to people give suggestions on
different topics, listening to a radio program, listening to description of different events, listening to
reviews and opinions, speaking about one’s traits and qualities, speaking to share experiences, speaking
to describe personal and professional subjects, speaking to share reviews and opinions, reporting what
people said, reading about people and their achievements, reading about unusual events and experiences,
reading about places and cultures, reading formal and informal communications, writing paragraphs and
business letters, writing descriptions, writing blogs and reports

Textbooks:

1. INTERCHANGE LEVEL 2 by JACK C. RICHARDS, with JONATHAN HULL, with SUSAN PROCTOR,
CAMBRIDGE UNIVERSITY PRESS

References:

1. ENGLISH GRAMMAR IN USE by RAYMOND MURPHY, CAMBRIDGE UNIVERSITY PRESS