Goseeko covers the entire spectrum of student’s journey from Academics to Career. From helping them to ace their academics with our personalized study material to providing them with career development resources, our students meet their academic and professional goals.

Company

Testimonials

About Us Certifications Blog Rewards Points Media Release Site Map

Courses

B.E.

B.Com

B.A.

BBA

BMS

BSC

Resources

Notes

MCQ

Question bank

Audio bites

Express Class

Reference Videos

Solved Question Papers

Support

support@goseeko.com

Terms & Conditions | Cancellation & Refund policy |

Biju Patnaik University of Technology, Odisha, Computer Engineering Semester 2, Programming for Problem Solving using C Syllabus

Programming for Problem Solving using C Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus

Unit - 1 Introduction to Programming

1.1 Introduction to components of a computer system

1.2 Idea of Algorithm steps to solve logical and numerical problems

1.3 Representation of Algorithm FlowchartPseudocode with examples From algorithms to programs source code

1.4 variables with data types variables and memory locations

1.5 Syntax and logical errors in compilation

1.6 object and executable code

Unit - 2 Arithmetic expressions, operators and precedence

2.1 Arithmetic expressions operators and precedence

2.2 Conditional Branching and LoopsWriting and evaluation of conditionals and consequent branching

2.3 Iteration and loops

2.4 Arrays 1D 2D

2.5 Character arrays and Strings

Unit - 3 Function and Recursion

3.1 Functions including using built in libraries

3.2 Parameter passing in functions call by value

3.3 Passing arrays to functions idea of call by reference

3.4 Recursion as a different way of solving problems

3.5 Example programs such as Finding Factorial Fibonacci series Ackerman function etc

3.6 Quick sort or Merge sort

Unit - 4 Pointers and Structure

4.1 Idea of pointers

4.2 Defining pointers

4.3 Use of Pointers in selfreferential structures

4.4 notion of linked list no implementation

4.5 Dynamic memory allocation

4.6 Defining structures and Array of Structures

4.7 Structure vs Union

4.8 ASCII and binary Files

Unit - 5 Basic Algorithms

5.1 Searching Linear and Binary

5.2 Basic Sorting AlgorithmsBubble Insertion and Selection

5.3 Concepts of time and space complexity