Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
21 views

Fundamental Primer Program Java

Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views

Fundamental Primer Program Java

Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Updated Old

Module Duration(Days) Duration(Days)


PCAT 1 3
Language (JAVA) 7 6
Logic Building(Min 10 Programs) 1 0
Assessment 1 1
Total 10 10

# Internal - General Use


Sl. No.
1.0

1.1

1.2

1.3

1.4

1.5

2.0

2.1

2.2

2.6

Sl. No.
1.0

1.1

1.2

2.0
2.1

#
2.2- General Use
Internal
2.2

2.3
2.4
3.0
3.1
4.0

4.1

4.2

5.0

5.1

6.0

6.1

6.2

6.3

6.4

# Internal - General Use


Topics
Programming Constructs
Introduction to Programming Constructs
Overview of Programming Constructs
Variables, Expressions, and Statements
Introduction to Pseudocode
Pseudocode for Common Algorithms
Sorting algorithms: Bubble, Selection, Insertion Sort
Searching algorithms: Linear Search, Binary Search
Control Flow Constructs and Flowcharts
Conditional Constructs: If, Else, Switch
Looping Constructs: For, While, Do-While
Creating and Interpreting Flowcharts
Efficient Flowcharting Techniques
Using Subroutines in Flowcharts for Repeated Actions
Flowchart Symbols for Concurrency and Synchronization
Logical Thinking with Operators and Decision Trees
Logical Operators: AND, OR, NOT
Decision Trees for Problem Solving
Flowchart Design for Decision Making Processes
Functions and Modular Design
Fundamentals of Function Design
Modular Programming Concepts
Writing Pseudocode for Modular Functions
Algorithms and Problem-Solving ---> Need to start after completing String Handling
Basic Algorithms with Pseudocode and Flowcharts using "http://www.flowgorithm.org/"
Algorithmic Thinking and Pseudocode
Introduction to Sorting Algorithms: Bubble Sort and Insertion Sort
Designing Flowcharts for Sorting Algorithms
Algorithmic Problem Solving
Problem Analysis for Algorithmic Solutions
Implementing Search Algorithms: Linear Search and Binary Search
Writing and Visualizing Search Algorithms
Practical Application of Algorithms
Application of Sorting and Searching Algorithms in Real-world Scenarios
Dry Run: Step-by-Step Algorithm Testing
Group Problem Solving and Algorithm Implementation

Topics
Java Fundamentals
Java Environment Setup
Installing JDK
Configuring IDEs (Eclipse, IntelliJ IDEA)
Java Syntax and Basic Constructs
Primitive Data Types and Variables
Operators and their Precedence
Control Flow Statements (if, switch, loops - for, while, do-while)
Arrays in Java
Definition and characteristics
Implement Basic operations

# Internal - General Use


Access
Insert
Delete
Update
Reverse
Slice
Sorting an Array - Brute Force Method
Searching an Array - Linear Search Method
String Handling
String Manipulation: Methods in the String Class
StringBuilder and StringBuffer: Mutability and Performance
Java Object-Oriented Programming (OOP) Basics
Object-Oriented Programming (OOP)
Classes and Objects: Definitions and Differences
Constructors: Purpose and Types
Encapsulation: Access Modifiers and Getters/Setters
Inheritance: Superclass and Subclass Relationships
Polymorphism: Method Overloading and Overriding
Organizing Code
Packages: Creating and Using Packages
Classpath: Understanding and Setting the Classpath
Java Modules: Modular Programming in Java
Exception Handling
Exception Handling
try-catch Blocks: Basic Exception Handling
Creating Custom Exceptions: When and How to Create
Java Collections Framework and Generics
Arrays: Declaration, Initialization, and Usage
Introduction to List interface.
Exploring ArrayList and LinkedList.
Understanding the Set interface.
Working with HashSet, LinkedHashSet, and TreeSet.
Differentiating between various Set implementations.
Introduction to Map interface.
Exploring HashMap, LinkedHashMap, and TreeMap.
Key-value pair management and use cases.
Iterators and Comparators

Logic building program practice

# Internal - General Use


Day End Assignment Options Remarks Duration (Days)
Assignment 1: Pseudocode programming. They
Development - Task: Write a will be introduced
detailed pseudocode for a simple to conditional and
program that takes a number as looping constructs,
input, calculates the square if it's critical for directing
even or the cube if it's odd, and program flow.
then outputs the result. Incorporate Flowcharts will help
conditional and looping constructs. visualize and design
logical sequences,
an essential skill for
Assignment 2: Flowchart Creation effective
- Design a flowchart that outlines programming.
the logic for a user login process. It
should include conditional paths for They will explore
successful and unsuccessful login logical operators
attempts, and a loop that allows a and decision trees, 1
user three attempts before locking crucial for making
the account. decisions in
programming.
Assignment 3: Function Design Understanding
and Modularization - Create a these concepts is
document that describes the design key to developing
of two modular functions: one that efficient and
returns the factorial of a number, effective problem-
and another that calculates the nth solving strategies in
Fibonacci number. Include software
pseudocode and a brief explanation development. They
of how modularity in programming will learn to use
helps with code reuse and functions,
organization. promoting
Assignment 1: Pseudocode and Learn basic sorting
Flowchart for Sorting Algorithm - algorithms and the
Write pseudocode and create a use of pseudocode
flowchart for a bubble sort and flowcharts for
algorithm. Provide a brief algorithm design
explanation of how the algorithm essential for
works and a simple array of integers understanding
to demonstrate a dry run of your algorithmic Need to start after
algorithm. thinking and completing String
developing Handling
effective problem-
solving strategies in
computing.
Understand
problem analysis
and implementing
search algorithms

Remarks Duration (Days)


Learner will understand the
essentials of setting up a Java
development environment and the
syntax required to write Java
programs. They'll learn to configure
tools like JDK and IDEs, which are
vital for code development and
1.5
execution.

Building on their understanding


of functions in Java, learners will
apply this foundational

# Internal - General Use


apply this foundational
knowledge to arrays,
understanding their structure
and manipulation. They will work
with array operations—
accessing, inserting, deleting,
updating, and reversing elements 2.5
—to grasp basic data handling.
Learners will also explore sorting
algorithms, starting with brute
force methods,skills
Additionally, and in
searching
string
manipulation through various
String class methods and the
performance benefits of
The engineer will also delve into the
core principles of object-oriented
programming, understanding
classes, objects, and inheritance,
which are fundamental in crafting
structured and maintainable code.
Additionally, they will acquire skills
in managing code execution flow
and error handling through control
statements and exception handling,
crucial for building robust 2
applications.

Learner will learn to efficiently


manage data in Java using the
Collections Framework,
mastering arrays, lists, sets,
maps, and their respective
interfaces and implementations.
They will also understand 2
generics for type-safe
operations. Proficiency in
iterators and comparators for
collection traversal and sorting is
covered.

Minimum 10 Logic Building program


should have been completed by Day
9
(Medium and complex problem 1
statement similar to the platforms
like leetcode/Codility/Mettl/
hackerrank/Edabit/Exercism/….)
https://leetcode.com/problemset/
https://www.hackerrank.com/
domains/python?filters
%5Bdifficulty%5D%5B%5D=medium

# Internal - General Use

You might also like