🔥Accenture Coding Questions and Answers 2024 | Actual Coding Questions, Pseudo Code | Live Class-1

Поділитися
Вставка
  • Опубліковано 24 лис 2024

КОМЕНТАРІ • 29

  • @_JanhviArmarkar
    @_JanhviArmarkar 3 місяці тому

    please take more questions like this for practice it will be really helpful for us!!

  • @adityabose432
    @adityabose432 3 місяці тому +2

    Questions will be different for every exam(August 2025) so how to prepare for the coding round in just 1 week?

  • @khushirajput7974
    @khushirajput7974 3 місяці тому +1

    Initialization:
    pp = 6
    qq = 7
    rr = 6
    First if condition:
    Evaluate (rr & qq):
    rr = 6 in binary: 0110
    qq = 7 in binary: 0111
    0110 & 0111 = 0110 (which is 6 in decimal)
    Evaluate 6 < 7 (True)
    Since the condition (rr & qq) < qq is true, the body of the if statement is executed:
    rr = 8 + pp:
    8 + 6 = 14
    So, rr = 14
    Nested if condition:
    Evaluate (qq + 8) & (8 ^ 7):
    qq = 7
    qq + 8 = 15
    8 ^ 7:
    8 in binary: 1000
    7 in binary: 0111
    1000 ^ 0111 = 1111 (which is 15 in decimal)
    So, (8 ^ 7) = 15
    15 & 15 = 15
    Evaluate (qq & pp + rr):
    qq = 7
    pp = 6
    rr = 14
    7 & (6 + 14):
    6 + 14 = 20
    20 in binary: 10100
    7 in binary: 00111
    00111 & 10100 = 00100 (which is 4 in decimal)
    So, the condition (15 > 4) is true.
    qq = (qq + rr) + pp:
    qq + rr = 7 + 14 = 21
    21 + 6 = 27
    So, qq = 27
    After if statements:
    Update qq:
    qq = (3 + 5) + qq
    3 + 5 = 8
    8 + 27 = 35
    So, qq = 35
    Print statement:
    pp = 6
    qq = 35
    rr = 14
    Compute pp + qq + rr:
    6 + 35 + 14 = 55
    So, the output of the pseudo code is 55.

  • @helloomkar
    @helloomkar 3 місяці тому

    Program 1: (Solving before watching the solution part)
    public static char mostFreqVowel(String s) {
    //abaa
    /*
    * step 1 hashmap
    * step 2 insert only vowels
    * step 3 retrive only vowel with the highest freq
    * */
    HashMap map = new HashMap(5);
    for (int i = 0; i < s.length(); i++) {
    if (s.charAt(i) == 'a' || s.charAt(i) == 'e' || s.charAt(i) == 'i' || s.charAt(i) == 'o' || s.charAt(i) == 'u') {
    map.put(s.charAt(i), map.getOrDefault(s.charAt(i), 0) + 1);
    }
    }
    //map contains a3
    char ans = ' ';
    int ansint = 0;
    for (Map.Entry entry : map.entrySet()) {
    if (entry.getValue() > ansint) {
    ansint = entry.getValue();
    ans = entry.getKey();
    }
    }
    return ans;
    }

  • @kalisettijagadeesh5914
    @kalisettijagadeesh5914 3 місяці тому

    Sir for Accenture we have to write code in functions then how to write for TCS with or without function

  • @bhuvanapriyaadapala4522
    @bhuvanapriyaadapala4522 3 місяці тому +2

    import java.util.HashMap;
    class H {
    public static void main(String[] args) {
    String str="abacaieghg";
    char c1;
    HashMap map=new HashMap();
    for(int i=0;i

  • @mahaboob0007
    @mahaboob0007 3 місяці тому +1

    sir in pseudocode one answer is 55 explanation : pp=6 rr=14 qq=35 ; pp+rr+qq= 55

    • @abhinav7622
      @abhinav7622 3 місяці тому

      explain toh kr
      mera 35 hi aya hai ans

  • @rks-jk6tr
    @rks-jk6tr 3 місяці тому +1

    LinkedList
    #include
    using namespace std;
    class Node {
    public:
    int data;
    Node* next;
    Node(int val) {
    data = val;
    next = NULL;
    }
    };
    Node* AddAlternateNodes(Node* head) {
    if(head == NULL || head->next == NULL || head->next->next == NULL){
    return NULL;
    }
    Node* curr = head->next->next;
    Node* prev = head;
    while(curr){
    curr->data += prev->data;
    curr = curr->next;
    prev = prev->next;
    }
    return head;
    }
    void printList(Node* head) {
    Node* temp = head;
    while(temp != NULL) {
    cout data next;
    }
    cout next != NULL) {
    temp = temp->next;
    }
    temp->next = newNode;
    return head;
    }
    int main() {

    Node* head = NULL;
    head = insertAtEnd(head, 1);
    head = insertAtEnd(head, 2);
    head = insertAtEnd(head, 3);
    head = insertAtEnd(head, 4);
    head = insertAtEnd(head, 5);
    head = insertAtEnd(head, 6);
    head = insertAtEnd(head, 7);
    cout

  • @chitranshverma1822
    @chitranshverma1822 3 місяці тому +1

    bhaii question mei next to next node likha hai toh prev to prev ko kyunn add kar rahe ho??
    2nd question of linked lists..

  • @PoornikaSharma
    @PoornikaSharma 3 місяці тому +2

    PLEASE PROVIDE THE JAVA PDF ,
    THE LINK IS NOT AVAILABLE.

  • @AkhilPanduri
    @AkhilPanduri 3 місяці тому

    Pls send these solutions in C and python

  • @AnandKumar-qj5mb
    @AnandKumar-qj5mb 3 місяці тому

    Question 1:
    package Coding;
    import java.util.HashMap;
    public class mostFrequentVowel {
    public static void main(String[] args) {
    String str = "amsfiuhjxcnoihawedonvoiljwnwqaaaaaaaaaaaaaaaaaaa";
    HashMap map = new HashMap();
    for (int i = 0; i

  • @mohitkarwade7543
    @mohitkarwade7543 2 місяці тому

    Why didn't you give a practical approach in the python language

  • @Srinu.G__1729
    @Srinu.G__1729 3 місяці тому +1

    Pseudo code
    I got ans
    55,37 and 0

  • @shaikabuahmed546
    @shaikabuahmed546 3 місяці тому +1

    where can i get the python code

  • @digital_vinay_1894
    @digital_vinay_1894 3 місяці тому

    sir how to join the live sessions

  • @AkhilPanduri
    @AkhilPanduri 3 місяці тому

    How i download a programs

  • @AkhilPanduri
    @AkhilPanduri 3 місяці тому

    Pls send the code in c also

  • @v24467
    @v24467 3 місяці тому +1

    Python pdf

  • @PoornikaSharma
    @PoornikaSharma 3 місяці тому

    I have a doubt in question no. 5 at 1:17:52 can anyone explain the line for( each r from 3 to 5)

    • @rks-jk6tr
      @rks-jk6tr 3 місяці тому +1

      #include
      using namespace std;
      int main() {
      int p, q, r;
      p = 4;
      q = 6;
      r = 8;
      r = (10 + 3) + p; // r = 13 + 4 = 17
      for (int i = 3; i

  • @devakiec-0505
    @devakiec-0505 3 місяці тому +2

    Plse upload python pdf

  • @Unknown_artist08
    @Unknown_artist08 3 місяці тому

    Bhai code likh aur execute kar k dikhana ase kuch bhi ni