Study material
Engineering
Computer Engineering
Information Technology
Electrical Engineering
Civil Engineering
Mechanical Engineering
Electronics and Communications
Electronics and Telecommunication
Electrical and Electronics
B.Com
B.A
BBA
BAF
BMS
New Test BE-Btech
Demo BE-Btech
Prod BE-BTech
Blog
Log in
Become a data analyst in the next 4 months and kickstart your career.
100% placement assistance.
Start your Analytics journey with our free
Python course.
Explore Now
Home
Universities
Bhagat Phool Singh Mahila Vishwavidyalaya, Haryana
Information Technology
Programming for Problem Solving
Bhagat Phool Singh Mahila Vishwavidyalaya, Haryana, Information Technology Semester 2, Programming for Problem Solving Syllabus
Programming for Problem Solving Lecture notes
|
Videos
|
Free pdf Download
|
Previous years solved question papers
|
MCQs
|
Question Banks
|
Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Unit - 1 Introduction to Programming
UNIT 1
Introduction to Programming
1.1 Introduction to components of a computer system disks memory processor where a program is stored and executed operating system compilers etc.
1.2 Idea of Algorithm steps to solve logical and numerical problems
1.3 Representation of Algorithm FlowchartPseudocode with examples
1.4 From algorithms to programs
1.5 Source code
1.6 Variables with data types variables and memory locations
1.7 Syntax and Logical Errors in compilation
1.8 Object and executable code
1.9 Arithmetic expressions and precedence
Unit - 2 Conditional Branching and Loops
UNIT 2
Conditional Branching and Loops
2.1 Conditional Branching and Loops
2.2 Writing and evaluation of conditionals and consequent branching
2.3 Iteration and loops
2.4 Introduction to Arrays 1D 2D
2.5 Character arrays and Strings
2.6 Basic Algorithms Searching Basic Sorting Algorithms Bubble Insertion and Selection
2.7 Finding roots of equations
2.8 Notion of order of complexity through example programs no formal definition required
Unit - 3 Function
UNIT 3
Function
3.1 Function Functions including using built in libraries
3.2 Parameter passing in functions Call by value idea of call by reference
3.3 Passing arrays to functions
3.4 Recursion Example programs such as Finding Factorial Fibonacci series Ackerman function etc
3.6 Quick sort or Merge sort
Unit - 4 Structures
UNIT 4
Structures
4.1 Structures Defining structures
4.2 Array of Structures
4.3 Pointers Idea of pointers defining pointers
4.4 Use of Pointers in selfreferential structures
4.5 Notion of linked list
4.6 File handling
Download IT Sem 2 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of Semester-2
English
Chemistry i
Mathematics 2
Popular posts
Top 10 free online resources to learn coding
What is machine learning
Top 10 jobs in information technology
An overview of object oriented programming
What is sorting algorithm
Share
Link Copied
More than
1 Million
students use Goseeko! Join them to feel the power of smart learning.
Try For Free
Spot anything incorrect?
Contact us