Project 1 - V&V SW Analysis - I

  a)       Max. heat generation of the battery pack is  Heat generation (Wh) = *R*t.I = 0.896 AmpsR = 2m Ωt = 120 secs = 0.03333 hoursHeat generation (W sec) = *0.002*120                                                =…

1.     Design a battery pack for a car roughly 150 Kw with 120 V. Use 3500 mAh 3.6V nominal NMC chemistry cell.a.     Design the battery pack configuration. b.     Draw the BMS topology for this battery pack.a)      Given, we have…

Live Batch (Preeti Mallikarjun):  

Live Batch ( Preeti Mallikarjun ):  

Master Aduino Code: #include <Wire.h>#include <LiquidCrystal_I2C.h> LiquidCrystal_I2C lcd(0x3F, 16, 2); // set the LCD address to 0x3F for a 16 chars and 2 line display void setup() { Wire.begin(); // join i2c bus (address optional for master) lcd.init(); // initialize the LCD lcd.backlight(); // turn on the…

CODE: CODE: const int samples = 5; // Number of measurements to take and averageint data[samples]; // Array to store the measurementsint index = 0; // Index to keep track of the current measurementint total = 0; // Running total of all measurementsint average = 0; // Calculated average distanceint duration = 0; // Duration…

Live Batch (Preeti Mallikarjun):  I) 1. Connect to the Ethernet Server to any User from no.1 to no.47 2. Open Remote Desktop Connection with the same user name. 3. Open LDRA tool of version either 10.0.3 or 9.8.3 . 4. Click 'source' file then click on 'single file' and follow the path given below. Documents-> LDRAEE…

Live Batch (Preeti Mallikarjun):  

Live Batch (Preeti Mallikarjun):  

#include #include #include // Link list node struct Node {     int data;     struct Node* next; }; //function declaration void push(struct Node** head_ref, int new_data); int isPresent(struct Node* head, int data); // Function to get union of two linked lists head1 and head2 struct Node* getUnion(struct Node* head1, struct…

1. AIM:       To control the retraction and extension of Airplane’s landing gear can be implemented using Finite State Machine (FSM). FSM is the most efficient algorithm which is mathematical model of computation. CODE: #include <stdio.h> // Functions Declarationvoid Start_State_Machine();void…

#include <stdbool.h> #include <stdio.h> #include <stdlib.h> // Link list node struct Node {     int data;     struct Node* next; }; //function declaration void push(struct Node** head_ref, int new_data); int isPresent(struct Node* head, int data); // Function to get union of two linked…