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.
Jharkhand University of Technology, Jharkhand, Electrical Engineering 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
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 FlowchartPseudo code 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
Unit - 3 Arrays
UNIT 3
Arrays
3.1 Arrays
3.2 Arrays 1D 2D
3.3 Character arrays and Strings
UNIT 3
Arrays
3.1 Arrays
3.2 Arrays 1D 2D
3.3 Character arrays and Strings
Unit - 4 Basic Algorithms, Searching, Basic Sorting Algorithms
UNIT 4
Basic Algorithms Searching Basic Sorting Algorithms
4.1 Basic Algorithms
4.2 Searching
4.3 Basic Sorting Algorithms Bubble Insertion and Selection
4.4 Finding roots of equations
4.5 Notion of order of complexity through example programs no formal definition required
Unit - 5 Function And Pointers
UNIT 5
Function and Pointers
5.1 Function Functions including using built in libraries
5.2 Parameter passing in functions Call by value idea of call by reference
5.3 Passing arrays to functions
5.4Pointers Idea of pointers defining pointers
5.5Use of Pointers in selfreferential structures
5.6Notion of linked list
UNIT 5
Function and Pointers
5.1 Function Functions including using built in libraries
5.2 Parameter passing in functions Call by value idea of call by reference
5.3 Passing arrays to functions
5.4Pointers Idea of pointers defining pointers
5.5Use of Pointers in selfreferential structures
5.6Notion of linked list
Unit - 6 Recursion And Structure
UNIT 6
Recursion and Structure
6.1 Recursion
6.2 Recursion as a different way of solving problems
6.3 Example programs such as Finding Factorial Fibonacci series Ackerman function etc.
6.4 Quick sort or Merge sort
6.5Structures Defining structures
6.6Array of Structures
UNIT 6
Recursion and Structure
6.1 Recursion
6.2 Recursion as a different way of solving problems
6.3 Example programs such as Finding Factorial Fibonacci series Ackerman function etc.
6.4 Quick sort or Merge sort
6.5Structures Defining structures
6.6Array of Structures
Unit -2 Arithmetic Expressions And Precedence
UNIT 2
Arithmetic expressions and precedence
2.1 Arithmetic expressions and precedence
2.2 Conditional Branching and Loops
2.3 Writing and evaluation of conditionals and consequent branching
2.4 Iteration and loops
UNIT 2
Arithmetic expressions and precedence
2.1 Arithmetic expressions and precedence
2.2 Conditional Branching and Loops
2.3 Writing and evaluation of conditionals and consequent branching
2.4 Iteration and loops
Download EE Sem 2 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Try Now for free
Share
Link Copied
More than 1 Million students use Goseeko! Join them to feel the power of smart learning.
Spot anything incorrect? Contact us
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.
Courses
B.E.
B.Com
B.A.
BBA
BMS
BSC
Resources
Notes
MCQ
Question bank
Audio bites
Express Class
Reference Videos
Solved Question Papers
