fbpx

Blog

HomeWisdom Sprouts IT Training Hub  > Blog
Author Sushank Dahiwadkar Categories Interview Preparation, Resume, Soft Skills

Resume Template For Freshers Looking For IT Job

As a graduate, you’re about to start your professional journey. One of the first steps is creating a strong resume that highlights your skills and experiences. Your resume is like your ticket to job interviews, so let’s break down how to make it great, using a sample resume as a guide.

The Basics

Contact Information

Your resume should begin with your contact information, including your full name, phone number, email address, and links to your LinkedIn and GitHub profiles (if applicable). Make sure this information is current and professional.

Sample

Objective Statement

Follow your contact information with a concise objective statement that summarizes your goals and aspirations. This is an opportunity to show your passion and motivation.

Sample

Showcase Your Skills

List your technical skills, emphasizing those relevant to the job you’re applying for. Be honest about your proficiency level, and include programming languages, frameworks, and tools.

Sample

Experience Matters

Internships

Highlight your internship experiences. Mention your contributions, responsibilities, and the technologies you used. Focus on tangible results and achievements.

Sample

Academic Projects

Include significant academic projects that demonstrate your technical skills and problem-solving abilities.

Sample

Beyond The Technical

Don’t forget to mention non-technical experiences and responsibilities that demonstrate your leadership, teamwork, and organizational skills.

Sample

Achievements and Education

Showcase your achievements, awards, and your educational background.

Sample

Conclusion

Full resume template.

Remember that your resume should be concise, well-organized, and tailored to the job you’re applying for. Be honest about your skills and experiences, and use action verbs to describe your contributions. Proofread your resume meticulously to ensure there are no typos or grammatical errors.

With a well-crafted resume like this, you’ll be well on your way to impressing potential employers and landing that coveted job. Best of luck in your job search!

delete consecutive words sequence using stack in C++
Author Tejal Tarde Categories Data Structures, Interview Preparation, Stack

Delete Consecutive Same Words In A Sequence Of Words Using Stack In C++

In this article, we will address the problem of identifying and removing consecutive similar words from a sequence of strings using C++. We will walk you through the algorithm and provide a sample C++ code to implement this solution.

Problem Statement

Given a sequence of n strings, the task is to check if any two similar words come together and then destroy each other then print the number of words left in the sequence after this pairwise destruction.

Algorithm Overview

In this solution we are using Stack data structure.

  • Create an empty stack to store words.
  • Initialize a variable ‘count’ to 0 to keep track of the number of words left.
  • Iterate through each word in the input sequence:
    • If the stack is not empty and the current word is equal to the word at the top of the stack, it indicates a pair of similar words. Pop the word from the stack (destroy it) and continue to the next word.
    • If the stack is empty or the current word is different from the word at the top of the stack, push the current word onto the stack to preserve it.
  • After processing all the words in the sequence, the stack will contain the remaining words that survived destruction.
  • The size of the stack at this point represents the number of words left.
  • Return the value of ‘count’ as the result.

Implementation in C++

C++
#include<bits/stdc++.h>
using namespace std;

int removeConsecutiveSame(vector<string> inputSequence) {
    int sequenceSize = inputSequence.size();
    for (int i = 0; i < sequenceSize - 1;) {
        if (inputSequence[i] == inputSequence[i + 1]) {
            inputSequence.erase(inputSequence.begin() + i);
            inputSequence.erase(inputSequence.begin() + i);
            if (i > 0) {
                i--;
            }
            sequenceSize -= 2;
        } else {
            i++;
        }
    }
    return inputSequence.size();
}

int main() {
    vector<string> inputSequence = { "ab", "aa", "aa", "bcd", "ab" };
    cout << "Number of words left: " << removeConsecutiveSame(inputSequence) << endl;
    return 0;
}

Conclusion

In solving this problem, we have utilized a stack data structure to efficiently identify and remove consecutive similar words from a sequence of strings. The algorithm preserves non-consecutive words while eliminating consecutive duplicates, ultimately yielding the count of words remaining in the sequence as the result.

Kth largest element in an array
Author ws_admin Categories Data Structures, Interview Preparation

Kth Largest Element In An Array

When working with arrays, it’s often necessary to find the Kth largest element, where K is a positive integer. While there are efficient algorithms like the QuickSelect algorithm for this task, let’s start by understanding the brute force method – a straightforward approach to solving this problem. In this blog, we’ll walk you through the process step by step and provide you with a code snippet to help you grasp the concept.

Algorithm Overview

The brute force method to find the Kth largest element involves iterating through the array, comparing each element with the rest, and keeping track of the Kth largest element encountered so far. Let’s break down the approach:

  1. Initialize a variable to keep track of the Kth largest element.
  2. Loop through the array.
  3. For each element, compare it with the current Kth largest element.
  4. If the element is greater than the current Kth largest element, update the Kth largest element.
  5. Continue this process until you have iterated through the entire array.
  6. The final value of the Kth largest element will be the desired result.

Implementation in C++

C++
#include <iostream>
#include <vector>

using namespace std;

int findKthLargest(vector<int>& nums, int k) {
    // Ensure that k is a valid index within the array
    if (k < 1 || k > nums.size()) {
        cout << "Invalid value of k. Exiting..." << endl;
        exit(EXIT_FAILURE);
    }

    // Basic selection sort to find the kth largest element
    for (int i = 0; i < k; ++i) {
        int max_idx = i;
        for (int j = i + 1; j < nums.size(); ++j) {
            if (nums[j] > nums[max_idx]) {
                max_idx = j;
            }
        }
        // Swap the elements
        int temp = nums[i];
        nums[i] = nums[max_idx];
        nums[max_idx] = temp;
    }

    return nums[k - 1];
}

int main() {
    vector<int> arr = {3, 1, 7, 5, 8, 2, 4, 6};
    int k = 4;

    int kth_largest = findKthLargest(arr, k);
    cout << "The " << k << "th largest element is: " << kth_largest << endl;

    return 0;
}

Conclusion

While the brute force method is straightforward and easy to understand, it may not be the most efficient solution for large arrays. In such cases, algorithms like QuickSelect offer better time complexity. However, understanding the brute force method lays the foundation for grasping more complex algorithms. We hope this blog has provided you with a clear understanding of how to find the Kth largest element using brute force. Feel free to explore more advanced algorithms for optimizing this task further.

Top 100 HTML Interview Questions For Beginners
Author Sushank Dahiwadkar Categories Interview Preparation

Top 100 HTML Interview Questions for Beginners

Having a strong foundation in HTML (Hypertext Markup Language) is crucial. HTML forms the backbone of every webpage, providing the structure and content that users interact with. To help you ace your interview, we’ve compiled a comprehensive list of 100 HTML questions designed specifically for fresher candidates. Whether you’re a recent graduate or just starting your career journey, these questions cover a range of topics to ensure you’re well-prepared for any HTML-focused interview.

1. What does HTML stand for?

HTML stands for “Hypertext Markup Language.” It is a standard markup language used to create webpages and define their structure and content.

2. What is the basic structure of an HTML document?

An HTML document starts with a declaration to specify the HTML version. It includes the element as the root, containing and sections for metadata and content, respectively.

3. How do you create a heading in HTML?

Headings are created using the <h1> to <h6> tags, where <h1> represents the highest level heading and <h6> represents the lowest level.

4. What’s the correct tag to create a paragraph in HTML?

The <p> tag is used to create paragraphs in HTML. Text within this tag is treated as a separate paragraph.

5. How do you create a line break in HTML?

The <br> tag is used to create a line break in HTML, allowing content to appear on a new line without creating a new paragraph.

Top 100 SQL Interview Questions For Beginners
Author Sushank Dahiwadkar Categories Interview Preparation

Top 100 SQL Interview Questions for Beginners

SQL (Structured Query Language) is the backbone of managing and manipulating data in relational databases. Whether you’re just starting your career in tech or looking to brush up on your skills, mastering SQL is crucial. To help you on your journey, we’ve compiled a comprehensive list of 100 beginner-level SQL interview questions. Whether you’re preparing for an interview or simply want to reinforce your SQL knowledge, these questions will guide you through the fundamental concepts and techniques.

1. What is SQL and what does it stand for?

SQL stands for “Structured Query Language.” It is a domain-specific language used to manage, manipulate, and query relational databases.

2. Define a database and its purpose

A database is a structured collection of data that is organized and stored for easy retrieval and management. Its purpose is to store, manage, and retrieve information efficiently.

3. Explain the role of a table in a database

A table is a fundamental component of a database where data is stored in rows and columns. It represents a specific entity or concept, and each row in a table corresponds to a record, while each column represents a data attribute.

4. What is a column in a table?

A column, also known as a field, is a vertical arrangement in a table that represents a specific data attribute. It holds values of the same data type for each row.

5. Define a row in a table.

A row, also known as a record or tuple, is a horizontal arrangement in a table that contains a set of related data values. Each row corresponds to a single instance or entry.