Page 104 - REC :: All Dept Open Electives

OGE1705 PROGRAMMING LOGIC L T P C
2 0 2 3

UNIT -1: INTRODUCTION TO C

Overview of C - Constants, Variables, and Data Types - Operators and Expressions - Managing Input
and Output Operations

UNIT -2: CONTROL STRUCTURES

Branching – Looping – Arrays - Character Arrays and Strings

UNIT -3: FUNCTIONS

User-Defined Functions – Recursion - Structures and Unions – Pointers - File Management in C - The
Preprocessor

UNIT -4: DATA STRUCTURES

Linked List – Stack – Queue – Trees – Binary Search Trees – Binary Heaps – Graphs – Asymptotic
Notation - Time and Space Complexity - Divide and Conquer – Greedy Method.

UNIT -5: SORTING AND SEARCHING

Selection Sort – Bubble Sort – Quick Sort – Merge Sort – Heap Sort – Linear Search – Binary Search.

At the end of the course, the student will be able to:
 Translate the algorithms to C Programs
 Implement conditional branching and iteration
 Decompose a problem into functions and synthesize a complete program using divide and
conquer approach
 Understand and design how information is organized in storage of computer system.
 Provide Optimal Solutions for the given problem.

REFERENCES:

1. Brian W. Kernighan and Dennis M. Ritchie, “The C Programming Language”, Second Edition,
PHI.
2. Byron Gottfried, “Programming in C”, Second Edition, Schaum Outline Series.
3. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2ndEdition, Pearson
Education, 1997.

LABORATORY * 100 Problems to be solved

1. Simple computational problems using arithmetic expressions
2. Problems involving if-then-else structures
3. Iterative problems e.g., sum of series
4. Matrix problems, String operations
5. Programming for solving Numerical methods problems
6. Recursive functions
7. Pointers and structures
8. File operations
9. Stacks and Queues

Curriculum and Syllabus | Open Electives | R 2017 | REC Page 104