Scribd
Upload
76 views

EST 102 Programming in C - 230823 - 204510

This document outlines the course content for the programming course EST 102 in C. It is divided into 5 modules that cover fundamental C programming concepts like data types, operators, control structures, functions, arrays, structures, pointers, files and recursion. It provides learning objectives like differentiating between various concepts, writing programs to demonstrate specific tasks, and explaining core programming elements, their usage and applications. The document aims to guide students through the key topics that will be covered during the course.

Uploaded by

heytherenewworld
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views

EST 102 Programming in C - 230823 - 204510

This document outlines the course content for the programming course EST 102 in C. It is divided into 5 modules that cover fundamental C programming concepts like data types, operators, control structures, functions, arrays, structures, pointers, files and recursion. It provides learning objectives like differentiating between various concepts, writing programs to demonstrate specific tasks, and explaining core programming elements, their usage and applications. The document aims to guide students through the key topics that will be covered during the course.

Uploaded by

heytherenewworld
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

EST 102 :Programming in C

Part A:3 marks


1.Differentiate system software and application software.
2. Differentiate comiler and interpreter
3 Differentiate highlevel and lowlevel languages
4 . Differentiate volatile and non volatile memory.
5. Explain precedence and associativity of operators
6. Write an algorithm for largest of three numbers
7. Differentiate break and control statements
8 Explain string handling functions with example
9. Differentiate actual and formal parameter with example
10. Explain file handling functions with example.
11. Differentiate structure and union
12. Write a program to find no of occurrence of an element in an array
13 Explain Recursion with example.

Module 1
TRACE KTU
PART B( 7 marks)

1 Write an algorithm, pseudocode and program and for bubble sort


2. Write an algorithm ,pseudocode and program for linearsearch
3 Explain Functional units of a computer
4. Explain memory of a computer and registers in a computer
5. Explain operators in C
Module 2
6 Write a program for sort the numbers in ascending order
7 Write a c program to perform linear search.
8. Write a program for sum of digits, reverse and check the given number is palindrome or
not.
9 Explain formatted and unformatted input/ouput statements.
10.Write a program to check whether the given no is palindrome or not
Module3
11.Explain the String Handling functions with Example
12.Write a c program to count the no of vowels in a string with out using string handling
functions
13 .Write a program to perform string palindrome
14 Write a c program to perform matrix addition
15 Write a c program to perform matrix multiplication
16 Write a c program to perform transpose of a matrix
Module 4
17 Explain different storage classes in C with example.
18 Explain recursion .Write a c program to perform factorial of a program using recursion
19 Write a C Program fibonacci series using recursion
20 Explain different parameter passing methods with example.
21 Write a C program to read and display student details and calculate grade using Structure
22 Write a C program to read and display employee details and salary using Structure
Module 5
23 Explain pointers and swap two numbers using pointers

TRACE KTU
24 Explain the file handling functions and file reading modes
25 Write a program to read from a file and write to another file
26Write a program to read from a file and count the number of lines
27 Explain array access using pointers
TRACE KTU

You might also like