C Programming Array Manipulation Assignment

[Pankaj-Str]

Objective

Develop a comprehensive set of programs to demonstrate advanced array manipulation techniques, focusing on problem-solving and algorithmic thinking.

Assignment Tasks

Task 1: Dynamic Array Management (25 points)

Create a program that:

• Implements a dynamic array management system with the following functions:
  1. Create an array with user-defined size
  2. Insert element at a specific position
  3. Delete element from a specific position
  4. Search for an element and return its index
  5. Display current array contents
  6. Calculate and display array statistics (mean, median, mode)

Requirements:

• Use dynamic memory allocation
• Handle memory errors gracefully
• Implement input validation
• Support integer arrays

Task 2: Matrix Operations (30 points)

Develop a comprehensive matrix manipulation program:

• Support operations on two 2D arrays (matrices)
• Implement functions to:
  1. Input matrix elements
  2. Display matrix
  3. Matrix addition
  4. Matrix multiplication
  5. Find transpose of a matrix
  6. Calculate matrix determinant (for 3x3 matrices)
  7. Check if matrix is symmetric

Constraints:

• Support matrices up to 10x10
• Handle different matrix sizes
• Implement error checking for matrix compatibility

Task 3: Advanced Sorting and Searching (25 points)

Create a comprehensive sorting and searching application:

• Implement multiple sorting algorithms:

  1. Bubble Sort
  2. Selection Sort
  3. Insertion Sort
  4. Merge Sort

• Searching techniques:

  1. Linear Search
  2. Binary Search (for sorted arrays)
  3. Search and count occurrences of an element

Requirements:

• Compare and display time complexity for each algorithm
• Allow user to choose sorting method
• Generate random array for testing
• Implement performance tracking

Task 4: Advanced Array Manipulation (20 points)

Develop a program to perform complex array operations:

• Find and remove duplicates from an array
• Rotate array left or right by specified positions
• Merge two sorted arrays
• Split array into even and odd number arrays
• Find missing numbers in a sequence
• Implement circular array operations

Challenges:

• Minimize time and space complexity
• Handle edge cases
• Provide detailed statistical analysis

Task 5: String Array Processing (25 points)

Create a string array management system:

• Input multiple strings (up to 50 characters each)
• Implement functions to:
  1. Sort strings alphabetically
  2. Remove duplicate strings
  3. Search string by partial match
  4. Count vowels and consonants in each string
  5. Encrypt/decrypt strings using simple algorithms
  6. Reverse each string
  7. Compare strings lexicographically

Additional Requirements:

• Support case-insensitive operations
• Handle memory efficiently
• Implement robust input validation

Bonus Challenge (20 points)

Implement an advanced array challenge:

• Create a program that:
  1. Generates Pascal's triangle
  2. Calculates prime numbers in a given range
  3. Implements matrix spiral traversal
  4. Finds longest increasing subsequence
  5. Performs complex mathematical operations on arrays

Evaluation Criteria

1. Correctness of implementation (40 points)
2. Code efficiency and optimization (20 points)
3. Error handling and input validation (15 points)
4. Code readability and commenting (15 points)
5. Creative problem-solving approach (10 points)

Submission Guidelines

• Submit individual .c files for each task
• Include a README explaining implementation details
• Provide sample input/output
• Comment your code thoroughly
• Demonstrate understanding of array concepts

Learning Objectives

• Master array manipulation techniques
• Understand dynamic memory allocation
• Develop algorithmic thinking
• Improve problem-solving skills
• Learn efficient coding practices

Recommended Approach

1. Break down complex problems into smaller functions
2. Use modular programming
3. Implement error checking
4. Test each function individually
5. Optimize for time and space complexity

Additional Resources

• Recommended reading on array algorithms
• Online algorithm visualization tools
• Time complexity analysis resources

Hints and Tips

• Use pointers effectively
• Manage memory carefully
• Implement robust input validation
• Consider edge cases
• Use standard library functions judiciously
• Focus on code readability

Skills Developed

• Dynamic memory management
• Algorithm implementation
• Performance optimization
• Error handling
• Advanced C programming concepts