Skip to main content

INTRODUCTION TO PROGMMING R23

UNIT-I :
Introduction to Programming and Problem Solving :
History of Computers, Basic organization of a computer: ALU, input-output units, memory, program counter, Introduction to Programming Languages, Basics of a Computer Program- Algorithms, flowcharts (Using Dia Tool), pseudo code. Introduction to Compilation and Execution, Primitive Data Types, Variables, and Constants, Basic Input and Output, Operations, Type Conversion, and Casting. Problem-solving techniques: Algorithmic approach, characteristics of algorithm, Problem solving strategies: Top-down approach, Bottom-up approach, Time and space complexities of algorithms.

Unit-1 material

UNIT-II :
Control Structures :
Simple sequential programs Conditional Statements (if, if-else, switch), Loops (for, while, do- while) Break and Continue.

Unit-2 material

UNIT-III :
Arrays and Strings :
Arrays indexing, memory model, programs with array of integers, two dimensional arrays, Introduction to Strings.

Unit-3 material

UNIT-IV :
Pointers & User Defined Data types :
Pointers, dereferencing and address operators, pointer and address arithmetic, array manipulation using pointers, User-defined data types-Structures and Unions.

Unit-4 material

UNIT-V :
Functions & File Handling :
Introduction to Functions, Function Declaration and Definition, Function call Return Types and Arguments, modifying parameters inside functions using pointers, arrays as parameters. Scope and Lifetime of Variables, Basics of File Handling

Unit-5 material

Comments

Popular posts from this blog

DWDM (Basic statistical description of data)

Data structures: Introduction to Trees

Tree: The data in a tree are not stored in a sequential manner i.e., they are not stored linearly. Instead, they are arranged on multiple levels or we can say it is a hierarchical structure. For this reason, the tree is considered to be a non-linear data structure. KeyConcepts : Nodes : Individual units within the tree, each storing data and potentially linking to other nodes. Edges : Connections between nodes, representing relationships (parent-child, sibling, etc.). Root : The topmost node in the tree, from which all other nodes originate. Parent : A node that has one or more child nodes. Child : A node connected to a parent node. Leaf : A node with no children. Subtree : A portion of a tree that is itself a tree. Representation of tree: Binary search tree :

Hashing and hash functions

Types of hash functions