4th Sem Syllabus Diploma Cs
4th Sem Syllabus Diploma Cs
Prerequisites:
Knowledge of C programming.
Course Objectives
To study the concepts of derived data types and data structures such as linked list, stack,
queue, sorting and searching techniques.
Course Outcome
On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked Teaching
Course outcome
PO Hours
V Trees 08 - 07 15 22 15.39
VI Sorting, Searching and 10 - 08 20 28 19.23
Application of Data
Structures
Total 52 05 44 96 145 100
Pointers - Concept of pointers, Declaring and initializing pointers, Accessing variables using
pointers, Pointer arithmetic, Pointers and arrays, Pointers and character strings, Pointers and
functions, Pointer as a function argument, Pointers to function, Pointers and structures.
Introduction, Defining and opening a file, closing a file, Input / Output operations on files,
Error handling during I/O operations, Random Access to files, Command line arguments
Introduction, Basic concept, Binary tree, Binary tree representation, Binary tree traversal.
Sorting – Introduction, sorting techniques – selection sort, insertion sort, bubble sort, quick
sort (no implementation), merge sort (no implementation).
®Text books
1. Programming with ANSI-C, E. Balaguruswamy, Sixth Edition, Tata Mcgraw Hill for
Unit I and II
2. Data Structures using C, E. Balagurusamy, Tata Mcgraw Hill for Unit III,IV,V,VI
References
1. Programming with ANSI & Turbo C, Ashok Kamthane, Second Edition, Pearson
Education.
2. Let us C, Yashavant P Kanetkar, 14th Edition, BPB publication, ISBN
9788183331630
3. Data structures A Programming Approach with C Second Edition , PHI publication,
Dharmender Singh Kushwaha, Arun Kumar Misra.
4. Programming in C and Data Structure, P.B.Kotur, Sapna Book house
5. http://spoken-tutorial.org/tutorial-
search/?search_foss=C+and+Cpp&search_language=English
6. http://www.tutorialspoint.com/cprogramming/
7. http://www.indiabix.com/online-test/c-programming-test/
Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
Course Delivery
The course will be delivered through lectures and Power point presentations/ Video
20 Blue books
three tests will
be computed)
Students
Student 1 to 6
05 Report
activities
Total 25
SE End End of the Answer scripts 1 to 6
100
E Exam course at BTE
Middle of the 1, 2, 3 Delivery
Indirect Assessment
Feedback forms
course of course
End of End of the 1 to 6
Students
Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 50
3 Application 40
Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal choice may be given in each CO at the same cognitive level (CL).
Questio C
Question CL PO
n no O
PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. a)Define Pointer. Write its advantages and disadvantages.
b)Explain pointer to structure with example.
2. List and explain Dynamic Memory allocation functions in C.
3. Write a program to copy contents of one file to another. Use command line arguments
to specify the file names.
4. Write the c functions to perform insert at front and delete operations on Singly Linked
List.
5. Define Circular Linked List. Give its c representation.
6. Write C program to implement push and pop operation of stack.
7. Define Priority queue. Write the C implementation Priority Queue.
8. Construct a binary tree for the following values and traverse the tree in preorder,
inorder and postorder:
46, 76, 36, 26, 16, 56, 96
9. Write a c program to implement Binary Search.
10. List the application of stack. Write an algorithm to convert infix to postfix expression.
CO Question CL Marks
Define Pointer. Write its advantages and disadvantages. A
Explain the declaration and initialization of pointer variable with an U
example.
Discuss the use of address operator and indirection operator with U
pointers.
Explain the array of pointers with an example. U
Give the difference between call-by-value and call-by-reference U
methods.
Differentiate between pointers as function arguments and pointers to A
function.
How is a pointer to an array different from an array of pointers? Explain U
with an example 05
Explain pointers and array using example. U
Explain how an array can be passed to a function? A
Explain in brief the different parameter passing mechanisms. A
Explain pointer to structure with example. A
Write C program to swap two numbers using pointers. A
Define Dynamic Programming in C and its advantages. A
Give the difference between malloc() and calloc() functions. U
I
Explain free(). What are its advantages? U
Explain character pointer as an argument to a function with an example. U
Discuss pointer as a function argument. With an example explain call- A
by-reference method.
With an illustration program explain pointers to structures. A
With an illustration program explain pointers to arrays. A
Write a program to illustrate pointer arithmetic’s. A
Write C program to compare 2 strings to check whether they are equal A
or not using pointer. 10
What are the advantages of pointer? Write a program using pointers to A
compute the sum of all elements stored in an array.
Explain Dynamic Memory allocation in C using memory map. A
List and explain Dynamic Memory allocation functions in C. A
Writ a program to illustrate memory allocation using malloc() function. A
Writ a program to illustrate memory allocation using calloc() function. A
Writ a program to illustrate reallocation of memory using realloc() A
function.
How are static and dynamic memory allocations different? Write a A
program to sort 10 numbers using malloc().
What is a file? Explain how to open and close a file. U
Distinguish between the following functions: R
i. getc and getchar
8
10
Prerequisites
Knowledge of programming concepts.
Course Objectives
Course Outcome
On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked Teaching
Course outcome
PO Hours
CO1
Discuss the OOP’s concept and Apply the concepts 8
U,
to design, implement, compile, test and execute 2,3,4,8,10
A
simple Java programs.
Explain the concepts related to classes and Use 14
CO2 U,
built-in methods of String and String Buffer 2,3,4,8,10
A
classes.
CO3 Define Inheritance and Discover Interface with U, 6
2,3,4,8,10
programs A
CO4 Illustrate Packages and articulate with simple U, 8
2,3,4,8,10
programs A
CO5 Illustrate multithreading concepts by U, 8
2,3,4,8,10
experimenting with programs A
CO6 Interpret different types of Exceptions by solving U, 8
2,3,4,8,10
programs. A
Total sessions 52
R U A A
I Introduction of Java 8 5 10 7 22 15.38
II Classes, Objects and 14 - 18 10 38 27.00
Methods; Strings and
String Buffer Classes
III Interface: Multiple 6 - 6 10 16 11.53
Inheritance
IV Packages: Putting 8 - 13 10 23 15.38
Classes Together
V Multithreaded 8 - 13 10 23 15.38
Programming
VI Managing Errors and 8 - 13 10 23 15.38
Exceptions
Total 52 5 73 57 145 100
Java Evolution - Java history, Java Features, How Java Differs from C and C++, Java and
World Wide Web, Java Environment, Simple Java Program, An Application with Two
Classes, Java Program Structure, Java Tokens, Java Statements, Implementing a Java
Program, Java Virtual Machine, Command Line Arguments, Programming Style, Constants,
Variables, Data Types, Scope of Variables, Symbolic Constants, Type Casting, Standard
Default Values, Special Operators, Mathematical Functions, Labelled Loops (break &
Continue) Operators and Expressions, Decision Making, Branching & Looping.
Classes, Objects and Methods - Introduction, Defining a Class, Fields Declaration, Methods
Declaration, Creating Objects, Accessing Class Members, Constructors, Methods
Overloading, Static Members, Nesting of Methods, Inheritance: Extending a Class,
Overriding Methods, Final Variables and Methods, Final Classes, Finalize Methods, Abstract
Methods and Classes, Methods with Variable arguments (Varargs),Visibility Control.
Strings and String Buffer Classes - Strings, Vectors, Wrapper classes, Enumerated Types,
Annotations.
UNIT III: Interface: Multiple Inheritance 10Hrs
Introduction, Defining Interfaces, Extending Interfaces, Implementing Interfaces, Accessing
Interface Variables.
Introduction, Java API Packages, Using System Packages, Naming Conventions, Creating
Packages, Accessing a Package, Using a Package, Adding a Class to a Package, Hiding
Classes, Static Import.
UNIT V: Multithreaded Programming 06 Hrs
Introduction, Creating Threads, Extending the Thread Class, Stopping and Blocking a
Thread, Life Cycle of a Thread, Using Thread Methods, Thread Exceptions, Thread Priority,
Synchronization, Implementing the ‘Runnable’ Interface, Inter-thread Communication.
®Text books
Programming with Java, 6th edition, Balagurusamy, Mc Graw Hill, ISBN 13- 9789351343202
ISB 10- 9351343200
References
1. Complete Reference Java J2se, Herbert Schildt, Tata McGraw Hill, ISBN
9780070598782
2. Java 6 Programming – Black Book Wiley India Pvt ltd
3. Programming in JAVA2 – Dr. K. Somasundaram Jaico Publish
4. Programming in JAVA – S.S. Khandare – S. Chand Publish
E-learning resources
http://www.Javatpoint.com/Java-tutorial
http://www.tutorialspoint.com/Java/
http://www.indiabix.com/technical/core-Java/
Note: The following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)
3
Course Delivery
The course will be delivered through lectures and Power point presentations/ Video
computed)
Students
course
Students
Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 30
3 Application 60
Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
4
Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal choice may be given in each CO at the same cognitive level (CL).
Test/Date and
Semester/year Course/Course Code Max Marks
Time
Questio C
Question CL PO
n no O
PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. Explain the features of Java.
2. Explain class definition with fields and method declaration.
3. Define static member. Write a program to illustrate static members.
4. Define inheritance. Explain different forms of inheritance.
5. Write a program to implement interfaces
6. Explain Java API packages
7. Write a Package program to demonstrate basic arithmetic operators
CO Question CL Marks
Give the definition of object oriented programming and how it is U
different from procedure-oriented programming
Explain the organization of data and methods in an object U
oriented programming.
List the unique advantages of an object oriented programming U
Give the definition of object and classes. Explain representation U
of an object with an example.
Define the following U
(i) Data abstraction (ii) Data encapsulation
Define the following OOPS concepts U
b. Inheritance
c. Polymorphism
Distinguish between objects and classes U
Distinguish between Data abstraction & Data encapsulation U
Distinguish between Inheritance &Polymorphism U
Distinguish between Dynamic binding & message passing. U
I Explain Dynamic binding & message passing U 05
List any five advantages of OOP A
List any five areas of application of OOPS technology A
Java is platform independent language. Justify U
Discuss how Java is more secured than other language U
List any features of Java. A
List any five major differences between C and Java. U
List any five major differences between C++ and Java U
Discuss the contributions of Java to the world wide web. A
Illustrate Java communication with a web page A
Explain the process of building and running Java application A
programs
Explain Java run time environment U
Write a simple Java program and explain A
Write a simple Java program to illustrate the use of A
mathematical functions
List the different sections of Java program structure U
List the advantages of OOPS. U
Discuss OOPs areas of application. A
Define the following. R
I a. Data abstraction.
b. Data encapsulation.
c. Inheritance.
Define the following. R
11
Prerequisites
Course Objectives
1. Understand the services of an operating system provides to its users and system itself.
2. Apply various CPU scheduling algorithms and recognize the classic synchronization
problems.
3. Compare methods for handling deadlocks and apply various memory management
techniques.
4. Describe file systems.
Course Outcome
On successful completion of the course, the students will be able to attain below Course
Outcome (CO):
CL Linked Teaching
Course outcome
PO Hours
CO1 Describe operating system operations and 08
U 1,2,9,10
operating system structures.
CO2 Understand process management and apply U, 2,3,9,10 12
process scheduling algorithms A
CO3 Recognize Synchronization and discover the U, 2,3,9,10 08
methods for handling deadlocks. A
CO4 U, 2,3,9,10 08
Explain the memory management techniques.
A
CO5 Discover the concepts related to virtual memory U, 2,3,9,10 08
management A
CO6 U, 2,3,9,10 08
Identify file systems concepts.
A
Total sessions 52
What operating systems do? Computer System architecture, Operating System structure,
Operating System operations, Process management, Memory management, Storage
management, Protection and security, Distributed system, Special-purpose systems,
Computing environments, Open-source Operating Systems..
File concept, Access methods, Directory and disk structure, File system mounting, File
Sharing , Protection.
®Text books
1. Operating System Principles – Abraham Silberschatz, Peter Baer Galvin, Greg
Gagne, 8th edition, Wiley-India. (Chapters-1, 3, 5, 6, 7, 8, 9, 10 and 11)
ISBN- 9788126520510
References
1. Operating Systems, I. Chandra Mohan, PHI, 2013, ISBN – 9788120347267
2. http://www.tutorialspoint.com/operating_system/
3. http://courses.cs.vt.edu/~csonline/OS/Lessons/index.html
4. http://www.nptel.ac.in
Suggested list of student activities
Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned course
coordinator and programme coordinator.
2. Each group should conduct different activity and no repeating should occur
1 How to install and Uninstall an Operating System on a New Computer
2 How to Remove a Second Operating System from a PC
3 A Survey of recent Operating System
4 Case study on real time deadlock situation
5 A case study on real time process synchronization
6 Comparison of OS working in single core and multi core environment
7 Comparison of 32 bits and 64 bits OS
8 Operating system is responsible for following activities in connection
with management of memory:
∑ Allocation and de allocation of memory as and when needed
∑ Keeping track of used and unused memory space.
∑ Deciding what process to be loaded into memory in case space becomes
available.
9 For secondary space management:
∑ Swap space and free space management
∑ Disk scheduling
3
Course Delivery
The course will be delivered through lectures and Power point presentations/ Video
be computed)
Students
Student 1,2,3,4
05 Report
activities
Total 25
SE End End of the Answer scripts 1,2,3,4
100
E Exam course at BTE
Student Middle of the
1 & 2 Delivery
Feedback course Feedback forms
of course
Indirect Assessment
on course
Students
Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 20
2 Understanding 50
3 Application 30
Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue books (20 marks)
2. Student suggested activities report for 5 marks
3. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.
4
Question
Question MARKS CL CO PO
no
1
2
3
4
Note: Internal choice may be given in each CO at the same cognitive level (CL).
Test/Date and
Semester/year Course/Course Code Max Marks
Time
Questio C
Question CL PO
n no O
3 Consider the following set of process with the length of the CPU burst A 2 1,2
time given in milliseconds
Process Burst time Priority
P1 9 3
P2 11 1
P3 3 3
The processes are assumed to have arrived in the order P1, P2, P3 all at
time 0. What is the waiting time and turnaround time of each process
for FCFS & PRIORITY scheduling algorithms? (5)
4 What is a process? Draw and explain the state transition diagram of a U 2 1,2
process.
PART-B
Answer any SEVEN full questions each carries 10 marks. 10X7=70 Marks
1. What are the different operating system operations.
3. Consider the following set of process with the length of the CPU burst time given in
milliseconds
The processes are assumed to have arrived in the order P1, P2, P3 & P4 all at time 0.
a. Draw the Gantt chart for FCFS and PRIORITY scheduling algorithms.
b. What is the waiting time and turnaround time of each process for FCFS & PRIORITY
scheduling algorithms.
c. Calculate the average waiting time and average turnaround time for FCFS & PRIORITY
scheduling algorithms.
7
6. List and explain different structure of the page table with a neat diagram
9. List out common file types with their extension and functions
10. Explain Tree-structured directory and Acyclic-graph directory with a neat diagrams
CO Question CL Marks
Write a note on protection and security. U
Write a note on client/server computing. U
Discuss time sharing system. U
Explain distributed system. U 05
Explain the peer-to-peer computing. U
Explain OS in user’s view and system’s view. U
List the advantages and disadvantages of multiprogramming system U
I
What is an operating system? Explain the computer system architecture. U
What are the different operating system operations? U
Compare process management and memory management. U
Explain the special-purpose systems. U 10
Explain clustered system. U
Different activities in connection with process management, memory U
management and storage management.
What is a process? Draw and explain the state transition diagram of a U
process.
Explain the contents of PCB with neat diagram. U
05
Compare long-term, short-term and medium-term scheduler. U
Explain the different scheduling criteria. U
10
Course Objectives:
Course Outcomes:
On successful completion of the course, the students will be able to attain CO:
Course Outcome CL Linked PO Teaching Hrs
R U A
1
HUMAN VALUES 10 15 15 - 30 21
ENGINEERING 10 15 - 25 17
2
09
ETHICS
SAFETY, 05 - 10 15 11
3
RESPONSIBILITIES 05
OF ENGINEERS
ETHICAL ISSUES IN 05 05 5 15 11
4
ENGINEERING 06
PRACTICE
8 15 5 20 13
5 HUMAN RIGHTS
INDIAN 25 15 40 27
6
14
CONSTITUTION
Safety and risk-definition- - assessment of safety and risk - risk benefit analysis and reducing risk
–Personal risk-Public risk-Reducing risk-Voluntary Risk-Collegiality and loyalty–Authority-
Types- collective bargaining -occupational crime –Responsibility of engineers–Types-Social
responsibility-Professional responsibility-confidentiality-conflicts of interest-liability
10. Illustrate the ethical aspect principle of caring or sharing, with an example?
11. Explain various actions of an engineer leading to dishonesty?
12. List the situations when moral dilemmas arise?
CO3: KNOW THE DEFINITIONS OF RISK AND SAFETY ALSO DISCOVER DIFFERENT
FACTORS THAT AFFECT THE PERCEPTION OF RISK
Level-1: Remember
1. Name the factors that influence the perception of risk?
2. List the factors that affect the risk acceptability?
3. Name a few techniques (steps) to reduce risks?
4. List various aspects of collegiality?
5. List factors/principles to justify ‘confidentiality’?
Level-2: Understand
6. Describe ‘institutional authority’ with an example?
7. What is meant by Professional Responsibility?
Level-3: Application
8. Explain ‘collective bargaining with example?
9. Explain briefly ‘‘institutional authority?
10. Explain Occupational crime?
Level-2: Understand
5. Describe briefly on code of ethics?
6. What are the duties of an engineer as an experimenter, in environmental ethics?
7. How the plastic waste disposals create havocs?
8. Discuss on Industrial waste disposal creating disasters on environment?
Level-3: Application
9. Explain ‘environmental ethics’?
10. Explain human centred environmental ethics?
11. Explain the role of computers as instruments?
12. Explain the role of computers as object of Unethical Acts?
13. Explain the role of engineers as managers?
14. Explain code of Ethics followed in Institution of Engineers?
15. Explain code of Indian Institute of Materials Management?
Prerequisites
Course Objectives
Design and Develop programs on derived data types and data structures such as stack, queue,
linked list, sorting and searching.
Course Outcome
On successful completion of the course, the students will be able to attain CO:
CO4
Demonstrate the concept of 16
binary tree traversal and its U/A 2,3,4,8,10 06
operations.
Design programs based on the 17 to 20
CO5 concept of sorting and searching 24
U/A 2,3,4,8,10
techniques.
Total sessions 78
Sl. No PART – A
1 Write a C program to illustrate the use of pointers in arithmetic operations.
2 Write a C program to swap two numbers using Call by value and Call by reference
parameter passing techniques.
3 Write a C program to find the smallest element in an array of 10 elements using
pointers.
4 Write a C program to create a dynamic array of integers using pointers.
5 Write a C program to illustrate the use of function pointer.
6 Write a C program to count the number of characters in a given file.
7 Write a C program to create a file that contains at least 5 records which consists of
Book No., Book Name, Author, Publisher, and price.
8 Write a C program to display the contents of the file created in program No. 5 in
the following format
Book No. Book Name Author Publisher Price
9 Write a C program to copy one file to another file using command line arguments.
Sl. No PART – B
10 Write a C program to implement singly linked list: insert, delete, search and
display.
11 Write a C program to illustrate Stack operations using arrays.
12 Write a C program to find the GCD of two numbers using recursion
13 Write a C program to evaluate a POSTFIX expression using stack operations.
14 Write a C program to implement queue using arrays.
15 Write a C program to implement queue using linked list.
16 Write a C program to implement binary tree traversal operations.
17 Write a C program to sort an array using bubble sort
18 Write a C program to sort an array using selection sort.
19 Write a C program to search a given number using linear search.
20 Write a C program to search a given number using binary search.
Reference
1. Data Structures using C by E. Balaguruswamy - Tata McGraw-Hill Education
2. Data Structures using C by Aaron M Tenenbaum - Pearson Education India
When/Where
To (Frequency Max Evidence Course
Method What
whom in the Marks collected outcomes
course)
IA Students Twice tests 10 Blue books 1 to 5
(average of
two tests)
CIE Record and 10 Record 1 to 5
Direct Assessment
(Continuous
Internal Student 05
Evaluation) activity Report.
Total 25
Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 30
3 Application 60
Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue Book(10 marks)
2. Record (10 marks)
3. Student suggested activities report for 5 marks
4. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.
3 Viva 10
Total 50
**Evaluation should be based on the screen output only. No hard copy required.
**Change of question is allowed only once. Marks of 05 should be deducted in the given
question.
Sl. No PART – A
1 Write a C program to illustrate the use of pointers in arithmetic operations.
2 Write a C program to swap two numbers using Call by value and Call by reference
parameter passing techniques.
3 Write a C program to find the smallest element in an array of 10 elements using
pointers.
4 Write a C program to create a dynamic array of integers using pointers.
5 Write a C program to illustrate the use of function pointer.
6 Write a C program to count the number of characters in a given file.
7 Write a C program to create a file that contains at least 5 records which consists of
Book No., Book Name, Author, Publisher, and price.
8 Write a C program to display the contents of the file created in program No. 5 in
the following format
Book No. Book Name Author Publisher Price
9 Write a C program to copy one file to another file using command line arguments.
Sl. No PART – B
10 Write a C program to implement singly linked list: insert, delete, search and
display.
11 Write a C program to illustrate Stack operations using arrays.
12 Write a C program to find the GCD of two numbers using recursion
13 Write a C program to evaluate a POSTFIX expression using stack operations.
14 Write a C program to implement queue using arrays.
15 Write a C program to implement queue using linked list.
16 Write a C program to implement binary tree traversal operations.
17 Write a C program to sort an array using bubble sort
18 Write a C program to sort an array using selection sort.
19 Write a C program to search a given number using linear search.
20 Write a C program to search a given number using binary search.
Sl.No Practical/Exercise
1 Write a Java Program to sort a list of names selection sort technique.
Write a Java Program to define a class, describe its constructor, overload the
2
Constructors and instantiate its object.
Write a Java Program to define a class, define instance methods for setting and
3
Retrieving values of instance variables and instantiate its object.
Write a Java Program to define a class, define instance methods and overload them
4
and use them for dynamic method invocation.
5 Write a Java Program to demonstrate use of sub class.
6 Write a Java Program to demonstrate use of nested class.
7 Write a Java Program to implement array of objects.
Write a Java program to practice
8 - using String class and its methods.
- using String Buffer class and its methods.
9 Write a Java Program to implement Vector class and its methods.
10 Write a Java Program to implement Wrapper classes and their methods.
Write a Java Program to implement inheritance and demonstrate use of method
11
overriding.
Write a Java Program to implement multilevel inheritance by applying various
12
access controls to its data members and methods.
Write a program to demonstrate
13 - use of implementing interfaces.
- use of extending interfaces.
Write a Java program to implement the concept of importing classes from user
14
defined package and creating packages.
Write a program to implement the concept of threading.
15 -by extending Thread Class
-by implementing Runnable Interface
Write a program to implement the concept of Exception Handling
16 - using predefined exception.
- by creating user defined exceptions.
Reference
Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 2-3
students.
Course Delivery
When/Where
To (Frequency Max Evidence Course
Method What
whom in the Marks collected outcomes
course)
Two tests
(average of 10 Blue books 1 to 6
two tests)
CIE 10
Record Record
Direct Assessment
(Continuous IA
Internal Student
Evaluation) 05 Report 1 to 6
Students activity
Total 25
SEE
(Semester End End of the Answer scripts
50 1 to 6
End Exam course at BTE
Examination)
1,2,3
Student Feedback on Middle of Feedback
Delivery of
course the course forms
course
Indirect Assessment
1 to 6
Effectiveness
Students of Delivery
End of Course End of the of
Questionnaires
Survey course instructions
&
Assessment
Methods
*CIE – Continuous Internal Evaluation *SEE – Semester End Examination
Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 30
3 Application 60
Note to IA verifier: The following documents to be verified by CIE verifier at the end of
semester
1. Blue Book(10 marks)
2. Record (10 marks)
3. Student suggested activities report for 5 marks
4. Student feedback on course regarding Effectiveness of Delivery of instructions &
Assessment Methods.
3 Viva Voice 10
Total 50
**Evaluation should be based on the screen output only. No hard copy required.
**Change of question is allowed only once. Marks of 05 should be deducted in the given
question.
Prerequisites
Course Objectives
1. Describe the basic file system in Linux and its file attributes.
2. Appraise different filters, process handling, regular expressions and network
handling features using suitable commands.
3. Summarize different Linux commands to write Shell Programs.
On successful completion of the course, the students will be able to attain CO:
Experiment CL Linked Teaching
Course Outcome PO Hrs
linked
Demonstrate installation of 1
CO1 Linux operating system and 06
U 2,3,4,8,10
understand the importance of
Linux.
CO2 Appraise various command 2 to 4 12
U, A 2,3,4,8,10
usage of files and directories.
CO3
Show the working of vi editor 5 to 8
in all its modes using various U, A 2,3,4,8,10 12
commands.
CO4 Manage shell and processes 9 to 12 12
U, A 2,3,4,8,10
using various commands.
CO5 Write Shell scripts and C 13 to 21 30
A 2,3,4,8,10
programs using vi editor.
Demonstrate Linux 22
CO6 administration and its 06
A 2,3,4,8,10
environment
Total sessions 78
PART-A
6. Simple Filters – head, tail, cut, paste, sort, uniq, tr, pr.
7. Expressions & search patterns .(dot operator), *, ^, +, ?, grep, egrep, fgrep
8. Process Management commands.
∑ Process creation, status, Identifying process, ps -f & its options,
∑ Running process in background, Job control, and Process termination.
Directorate Of Technical Education Karnataka State CS&E 15CS47P Page 2
∑ Changing process priority, scheduling process (Usage of sleep and wait
commands)
PART – B
13. Write a shell script to display current date, time, username and directory.
14. Write script to determine whether given file exist or not, file name is supplied as
command line argument, also check for sufficient number of command line argument
15. Write shell script to show various system configuration like:
a) Currently logged user name and his long name
b) Current shell
c) Your home directory
16. Write shell script to show various system configuration like:
a) Your operating system type
b) Your current path setting
c) Your current working directory
d) Show all available shells
17. Write a Shell script to accept any two file names and check their file permissions.
18. Write a Shell script to read a file name and change the existing file permissions.
19. Write a shell script to print current month calendar and to replace the current day number
by ‘*’or ‘**’ respectively.
20. Write a C-program to fork a child process and execute the given Linux commands.
21. Write a C-program to fork a child process, print owner process ID and its parent process
ID.
References
1. “UNIX - Concepts and Applications”, Sumitabha Das 4th Edition, Tata McGraw Hill,
2006.
2. http://www.freeos.com/guides/lsst/
3. http://heather.cs.ucdavis.edu/~matloff/Linux/LinuxInstall.pdf (Chapter 1, Linux
installation).
4. http://docs.fedoraproject.org/en-US/Fedora/20/pdf/Installation_Guide/Fedora-20-
Installation_Guide-en-US.pdf.
Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any
one)
Student activity like mini-project, surveys, quizzes, etc. should be done in group of 3-5
students.
1. Each group should do any one of the following type activity or any other similar
activity related to the course and before conduction, get it approved from concerned course
coordinator and programme coordinator.
2. Each group should conduct different activity and no repeating should occur
Course Delivery
The course will be delivered through tutorials of two hours and four hours of hands on practice
per week.
When/Where
To Max Evidence Course
Method What (Frequency in
whom Marks collected outcomes
the course)
Two IA Tests
(Average of
10 Blue books 1 to 6
two tests will
be computed)
Record Record Book
CIE
IA Writing
Direct assessment
(Continuous
Tests (Average
Internal 10 1 to 6
marks of each
Evaluation)
Students exercise to be
computed)
Student Activities
05 1 to 6
Activities Report
TOTAL 25
SEE
(Semester End End of the Answer scripts
50 1 to 6
End Exam course at BTE
Examination)
1 to 3
Student Feedback on Middle of the Feedback
Delivery of
course course forms
course
Indirect assessment
1 to 6
Effectiveness
Students of Delivery
End of Course End of the of
Questionnaires
Survey course instructions
&
Assessment
Methods
*CIE – Continuous Internal Evaluation *SEE – Semester End Examination
Note:
1. I.A. test shall be conducted as per SEE scheme of valuation. However obtained marks
shall be reduced to 10 marks. Average marks of two tests shall be rounded off to the next
higher digit.
2. Rubrics to be devised appropriately by the concerned faculty to assess Student activities.
Questions for CIE and SEE will be designed to evaluate the various educational
components (Bloom’s taxonomy) such as:
Sl. No Bloom’s Category %
1 Remembrance 10
2 Understanding 30
3 Application 60
PART -A
1. Write a shell script to display current date, time, username and directory.
2. Write script to determine whether given file exists or not, file name is supplied as
command line argument, also check for sufficient number of command line argument
3. Write shell script to show various system configuration like:
a) Currently logged user name and his long name
b) Current shell
c) Your home directory
d) Your operating system type
4. Write shell script to show various system configuration like:
a) Your current path setting
b) Your current working directory
c) Show all available shells
5. Write a Shell script to accept any two file names and check their file permissions.
6. Write a C-program to fork a child process and execute the given Linux commands.
7. Write a shell script to print current month calendar and to replace the current day
number by ‘*’or ‘**’ respectively.
8. Write a C-program to fork a child process and execute the given Linux commands.
9. Write a C-program to fork a child process, print owner process ID and its parent
process ID.
10. Write a C-program to prompt the user for the name of the environment variable,
check its validity and print an appropriate message.