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
Jawaharlal Nehru Technological University, Telangana
Electronics and Communication engineering
Programming for Problem Solving
Jawaharlal Nehru Technological University, Telangana, Electronics and Communication engineering Semester 1, 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
1.2 Disks primary and secondary memory
1.3 Processor operating system compilers creating compiling and executing a Program etc
1.4 Number systems
1.5 Introduction to Algorithms
1.6 Steps to solve logical and numerical problems.
1.7 Representation of Algorithm
1.8 FlowchartPseudo code with examples
1.9 Program design and structured programming
1.10 Introduction to C Programming Language
1.11 Variables with data types and space requirements
1.12 Syntax and Logical Errors in compilation
1.13 Object and executable code
1.14 Operators expressions and precedence
1.15 Expression evaluation
1.1 Get the next token.
1.2 If the token is
1.16 Storage classes auto extern static and register
1.17 Type conversion
1.18 The main method and command line arguments
1.19 Bitwise operations Bitwise AND OR XOR and NOT operators
1.20 Conditional Branching and Loops
1.21 Writing and evaluation of conditionals and consequent branching with if ifelse Switchcase ternary operator goto Iteration with for while dowhile loops
1.22 IO Simple input and output with scanf and printf formatted IO
1.23 Introduction to stdin stdout and stderr
1.24 Command line arguments
Unit - 2 Arrays, Strings, Structures and Pointers
Unit 2
Arrays Strings Structures and Pointers
2.1 One and two dimensional arrays creating accessing and manipulating elements of arrays
2.2 Introduction to strings
2.3 Handling strings as array of characters
2.4 Basic string functions available in C strlen strcat strcpy strstr etc.
2.5 Arrays of strings
2.6 Defining structures
2.7 Initializing structures
2.8 Unions
2.9 Array of structures
2.10 Idea of pointers
2.11 Defining pointers
2.12 Pointers to Arrays and Structures
2.13 Use of Pointers in selfreferential structures
2.14 Usage of selfreferential structures in linked list no implementation
2.15 Enumeration data type
Unit - 3 Preprocessor and File handling in C
Unit 3
Preprocessor and File handling in C
3.1 Commonly used Preprocessor commands like include define undef if ifdef ifndef
3.2 Text and Binary files
3.3 Creating and Reading and writing text and binary files
3.4 Appending data to existing files
3.5 Writing and reading structures using binary files
3.6 Random access using fseek ftell and rewind functions
Unit - 4 Function and Dynamic Memory Allocation
Unit 4
Function and Dynamic Memory Allocation
4.1 Designing structured programs
4.2 Declaring a function
4.3 Signature of a function
4.4 Parameters and return type of a function
4.5 Passing parameters to functions
4.6 Call by value
4.7 Passing arrays to functions
4.8 Passing pointers to functions
4.9 Idea of call by reference
4.10 Some C standard functions and libraries
4.11 Simple programssuch as Finding Factorial Fibonacci series etc.
4.12 Limitations of Recursive functions
4.13 Dynamic memory allocation
4.14 Allocating and freeing memory
4.15 Allocating memory for arrays of different data types
Unit - 5 Introduction to Algorithms
Unit 5
Introduction to Algorithms
5.1 Algorithms for finding roots of a quadratic equations
5.2 Finding minimum and maximum numbers of a given set
5.3 Finding if a number is prime number etc.
5.4 Basic searching in an array of elements linear and binary search techniques
5.5 Basic algorithms to sort array of elements Bubble Insertion and Selection sort algorithms
5.6 Basic concept of order of complexity through the example programs
Download ECE Sem 1 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-1
Applied physics
Mathematics - i
Engineering graphics
Popular posts
Top 5 websites all engineers should use
Top 5 websites for academic reasearch
Top 5 interview advice for engineers
What is race around condition
What is convolution theorem
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