Exp 3-2 d422
•Download as DOCX, PDF•
0 likes•15 views
The document contains a student's experiment details including their name, roll number, batch, experiment number, title, algorithm, and Python program to calculate the factorial of a non-negative number entered by the user. The program defines a recursive fact function that returns 1 if the number is 1, or returns the number multiplied by the factorial of the number minus 1 otherwise. It takes user input, calls the fact function, and prints the output.
Report
Share
Report
Share
Recommended
functions
This document discusses functions in C programming, including defining functions, function prototypes, header files, calling functions by value and reference, recursion, and examples using recursion to calculate factorials and the Fibonacci series. Functions allow dividing programs into smaller, more manageable pieces. They are defined with a return type, name, and parameters. Function prototypes declare the function without defining the body. Header files contain function prototypes for libraries. Functions can be called by value, where copies of arguments are passed, or by reference, where the original arguments are passed. Recursion involves a function calling itself, terminating on a base case, to recursively solve problems like calculating factorials and the Fibonacci series.
Programming fundamentals
This document contains an assignment submission for a programming fundamentals course. It includes 8 sections with 2 code examples each demonstrating different programming concepts like printing text, if/else statements, loops, functions, and arrays in C programming language. The codes show basics like finding the sum of two numbers, checking even/odd, generating patterns, finding repeated elements in an array. The assignment was submitted by Zohaib Zeeshan to their professor for the first semester course.
Ankita sharma focp
This document summarizes an experiment on using pointers in C programming. The aim was to use pointers to print an array in reverse order along with the addresses of each element. The student defined two programs - Program A prints the reverse of an integer array using pointers, while Program B defines a function to return the pointer to the maximum of two integers. The student encountered no errors, explained the programs, and listed the learning outcomes regarding C language fundamentals and using pointers to manipulate memory.
java program assigment -1
The document contains 7 Java programs written by Ankit Gupta. The programs include:
1) A program to print two strings on separate lines
2) A program to find the multiplication and geometric mean of 4 input numbers
3) A program to calculate the volume of a cylinder given its height and radius
4) A program to convert centimeters to feet and inches
5) A program to convert seconds to hours, minutes and seconds
6) A program to determine if the roots of a quadratic equation are real, complex, equal or distinct
7) The author's name and information is included before each program
PF LAB ASSIGNMENT
This document is a programming assignment submission containing solutions to two programming problems. It was submitted by Mohammad Minqad Tahir, roll number 08, for their 1st semester programming fundamentals lab course to their instructor Mam Hira Nazir at the Computer Science department of Islamia University Bhawalpur. The first problem calculates the factorial of a user-input number using a while loop. The second problem displays the Fibonacci series for a number of terms input by the user using a for loop.
Function
1. Functions allow programmers to break programs into smaller, self-contained subprograms, making code more modular and reusable.
2. There are four types of functions: those with no arguments and no return value, no arguments but a return value, arguments but no return value, and arguments with a return value.
3. Functions can be user-defined or library functions provided in standard libraries that perform common tasks like input/output and mathematics. Functions must be declared, defined, and called properly in a program.
Function Pointer in C
This document discusses function pointers, call by value, and call by reference. It defines a function pointer as storing the address of a function. It explains the steps to declare a function pointer and provides an example. It then describes call by value as copying the value of actual parameters into formal parameters, so changes within the function are not reflected in the original variables. Finally, it defines call by reference as passing the reference/address of the original variable, allowing the function to directly modify the original data.
Introduction to Computer and Programing - Lecture 04
Here are the errors in the given C statements:
(a) int = 314.562 * 150 ;
- Left side of = operator should be a variable name, not a data type.
(b) name = ‘Ajay’ ;
- ‘Ajay’ is a string, it needs to be enclosed in " " for a character variable or ' ' for a string variable.
(c) varchar = ‘3’ ;
- varchar is not a valid data type in C.
(d) 3.14 * r * r * h = vol_of_cyl ;
- Left side of = operator should be a variable name.
(e) k = ( a
Recommended
functions
This document discusses functions in C programming, including defining functions, function prototypes, header files, calling functions by value and reference, recursion, and examples using recursion to calculate factorials and the Fibonacci series. Functions allow dividing programs into smaller, more manageable pieces. They are defined with a return type, name, and parameters. Function prototypes declare the function without defining the body. Header files contain function prototypes for libraries. Functions can be called by value, where copies of arguments are passed, or by reference, where the original arguments are passed. Recursion involves a function calling itself, terminating on a base case, to recursively solve problems like calculating factorials and the Fibonacci series.
Programming fundamentals
This document contains an assignment submission for a programming fundamentals course. It includes 8 sections with 2 code examples each demonstrating different programming concepts like printing text, if/else statements, loops, functions, and arrays in C programming language. The codes show basics like finding the sum of two numbers, checking even/odd, generating patterns, finding repeated elements in an array. The assignment was submitted by Zohaib Zeeshan to their professor for the first semester course.
Ankita sharma focp
This document summarizes an experiment on using pointers in C programming. The aim was to use pointers to print an array in reverse order along with the addresses of each element. The student defined two programs - Program A prints the reverse of an integer array using pointers, while Program B defines a function to return the pointer to the maximum of two integers. The student encountered no errors, explained the programs, and listed the learning outcomes regarding C language fundamentals and using pointers to manipulate memory.
java program assigment -1
The document contains 7 Java programs written by Ankit Gupta. The programs include:
1) A program to print two strings on separate lines
2) A program to find the multiplication and geometric mean of 4 input numbers
3) A program to calculate the volume of a cylinder given its height and radius
4) A program to convert centimeters to feet and inches
5) A program to convert seconds to hours, minutes and seconds
6) A program to determine if the roots of a quadratic equation are real, complex, equal or distinct
7) The author's name and information is included before each program
PF LAB ASSIGNMENT
This document is a programming assignment submission containing solutions to two programming problems. It was submitted by Mohammad Minqad Tahir, roll number 08, for their 1st semester programming fundamentals lab course to their instructor Mam Hira Nazir at the Computer Science department of Islamia University Bhawalpur. The first problem calculates the factorial of a user-input number using a while loop. The second problem displays the Fibonacci series for a number of terms input by the user using a for loop.
Function
1. Functions allow programmers to break programs into smaller, self-contained subprograms, making code more modular and reusable.
2. There are four types of functions: those with no arguments and no return value, no arguments but a return value, arguments but no return value, and arguments with a return value.
3. Functions can be user-defined or library functions provided in standard libraries that perform common tasks like input/output and mathematics. Functions must be declared, defined, and called properly in a program.
Function Pointer in C
This document discusses function pointers, call by value, and call by reference. It defines a function pointer as storing the address of a function. It explains the steps to declare a function pointer and provides an example. It then describes call by value as copying the value of actual parameters into formal parameters, so changes within the function are not reflected in the original variables. Finally, it defines call by reference as passing the reference/address of the original variable, allowing the function to directly modify the original data.
Introduction to Computer and Programing - Lecture 04
Here are the errors in the given C statements:
(a) int = 314.562 * 150 ;
- Left side of = operator should be a variable name, not a data type.
(b) name = ‘Ajay’ ;
- ‘Ajay’ is a string, it needs to be enclosed in " " for a character variable or ' ' for a string variable.
(c) varchar = ‘3’ ;
- varchar is not a valid data type in C.
(d) 3.14 * r * r * h = vol_of_cyl ;
- Left side of = operator should be a variable name.
(e) k = ( a
Anjalisoorej imca133 assignment
The document contains 10 Java programs that demonstrate various programming concepts:
1. A program to check if a number is a power of 2.
2. A program to sort an integer array using bubble sort without built-in methods.
3. A program to check if a number is an Armstrong number.
4. A program to reverse a string without using StringBuffer.
5. Programs to print the Fibonacci series using iterative and recursive approaches.
6. Programs to calculate the factorial of a number using iterative and recursive solutions.
7. A program to print a triangle pattern of stars.
8. A program to find the factorial of numbers passed as command line arguments.
9
Functions
A function is a block of code that performs a specific task and can be called from other parts of a program. Functions receive arguments, perform calculations, and return results. Functions are defined with a return type, name, and parameter list. For example, an "int sum(int a)" function takes an integer as a parameter, performs addition, and returns an integer. The main function calls other functions to perform tasks and receive returned values. Recursive functions call themselves to repeat a task.
Types of function call
This document discusses function call by value and reference in C programming. It provides examples of swapping integer values using each method. Call by value passes the actual value of an argument, so changes made to parameters inside the function do not affect the argument. Call by reference passes the address of an argument, allowing the function to access and modify the original argument value. The key differences are that call by value uses general variables as arguments while call by reference uses pointer variables, and only call by reference reflects changes to formal parameters in the actual parameters.
Infix to Postfix Conversion Using Stack
Infix to Postfix Conversion Using Stack is one of the most significant example of application of Stack which is an ADT (Abstract Data Type) based on LIFO concept.
Conversion of Infix To Postfix Expressions
Stacks have several application areas including:
1) When functions are called to save return addresses and local variables.
2) To convert infix expressions to postfix form by acting as a placeholder.
3) To evaluate postfix expressions by holding operands and intermediate results.
parameter passing in c#
Parameter passing methods are ways that parameters are transferred between functions when one function calls another. There are four main types of parameter passing in Java: value, reference, out, and parameter arrays. Value passing creates a copy of the parameter and changes do not affect the original. Reference passing uses the address of the parameter and allows changes to the original. Out passing is unidirectional and returns a new value. Parameter arrays allow a variable number of arguments using the params keyword.
C programming session 03
This document outlines practice questions from chapters 1 and 2, including writing a function to display a character 40 times, writing a function to display a string a specified number of times, using nested for loops to print a triangular pattern, writing a program to calculate triangular numbers from user input, and writing a program to check if a user input number is even or odd.
P3
This document describes Programming Assignment 3 which involves implementing a bigint class that can handle integers with up to 45 decimal digits. The bigint class must overload common operators like +, -, <, >, ==, !=, <<, and >> to behave similarly to built-in int types. It also requires various constructors and storing the digit values in a private array. Students are provided guidelines for completing the assignment and submitting their code.
CHAPTER 6
This document discusses different types of functions in C programming. It provides examples of functions with no arguments and no return value, functions with arguments and no return value, functions with arguments and return value, functions with no arguments but return value, and functions that return multiple values. The examples demonstrate how to define and call each type of function.
20BCE1734.pdf
This document describes two programs that implement synchronization between two threads accessing a critical section. The first program uses Peterson's solution with a global count variable that is incremented by one thread and decremented by the other. The second program uses semaphores for synchronization, with one thread incrementing and the other decrementing a shared variable. Both aim to safely update the variable value through the critical section five times each.
Presentation on function
A function is a block of code that performs a specific task. Functions allow for modularity and code reuse in a program. There are several key aspects of functions:
1. Functions are defined with a return type, name, and parameters. The general format is return_type function_name(parameter list).
2. Parameters allow functions to accept input from the caller. There are two ways parameters can be passed: call by value or call by reference.
3. Variables declared inside a function are local, while those declared outside are global and visible to all code. Local variables exist only during the function's execution.
4. Functions can call themselves recursively to repeat a task, with a base
Tail Recursion in data structure
Tail recursion is a type of recursion where the recursive call is the last thing executed by the function. This allows the compiler to optimize recursion by reusing the stack frame rather than allocating a new one for each recursive call. The key advantage is that tail recursive functions can process recursive problems of any size without overflowing the stack. Some examples show how a factorial function can be written iteratively using tail recursion, avoiding wasting memory on multiple stack frames.
Removal Of Recursion
The document discusses recursive functions and how they can be converted to iterative functions. It provides an example of a recursive factorial function and how it can be rewritten iteratively using a for loop instead of recursion. It also describes the general process of translating a recursive function to a non-recursive one by using stacks to store state between recursive calls and restoring that state when returning from the function.
Infix to postfix
Mohammad Saeed Farooqi presented on data structures and algorithms. He discussed infix, postfix, and prefix notation, operator precedence, evaluating postfix expressions using stacks, and converting infix to postfix using stacks. He provided examples and algorithms for postfix expression evaluation and converting between infix, postfix, and prefix notation.
Programming Global variable
Programming
Global variable
Local Variables
Global Variables
Formal Parameters
Initializing Local and Global Variables
Functions in C
This document discusses functions in C programming. It defines a function as a block of code that performs a specific task when called. It provides examples of functions used in hotel management like front office, reservation, and housekeeping. It explains function definition, declaration, calling, parameters, arguments, return statements. It differentiates between actual and formal arguments and discusses call by value and call by reference methods of passing arguments to functions.
Function & Recursion in C
The document discusses functions and recursion in C programming. It provides examples of different types of functions like void, float, int functions. It demonstrates simple functions with no parameters, functions that return values, and functions with parameters. It also explains recursion with examples of calculating factorials and Fibonacci series recursively. Finally, it discusses other function related concepts like function prototypes, scope of variables, and pre-defined math functions in C.
escape sequences and substitution markers
This document discusses escape sequences, verbatim strings, and substitution markers in C#. It provides examples of using escape sequences like \n for newlines. Verbatim strings prefixed with @ disable escape sequences. Substitution markers like {0} in a format string are replaced with variable values. The document demonstrates various string formatting techniques and taking user input in C# programs.
Enabling SSL Elasticsearch on server
This document provides steps to enable SSL/HTTPS for an Elasticsearch server. It involves generating certificates, configuring Elasticsearch, and enabling TLS for both transport and HTTP layers. The process includes generating a CA certificate, creating node certificates signed by the CA, editing the Elasticsearch configuration file, and restarting Elasticsearch to enable HTTPS.
Anti lock braking (ABS) Model based Design in MATLAB-Simulink
This document describes the modeling and simulation of an anti-lock braking system (ABS) using Simulink. It includes models of vehicle dynamics, wheel dynamics, and a simplified ABS controller. The vehicle model accounts for mass, friction forces, and acceleration. The wheel model includes torque from braking and friction. Simulation results show wheel slip and stopping distance with and without the ABS controller engaged. The ABS system helps maintain optimal slip to minimize stopping distance.
Autosar fundamental
The document discusses Autosar's layered architecture and communication capabilities. It describes the layered architecture with basic software, runtime environment and application layers. The runtime environment implements a virtual function bus to allow software components to communicate within and across ECUs. Communication can be intra-ECU, inter-ECU, or inter-partition. The runtime environment uses services like AUTOSAR COM and IOC to enable different types of communication.
Stress Management
The document discusses stress, its causes and effects, and strategies for managing stress. It defines stress as the body's response to any physical or mental demand, which can be triggered by events or thoughts that make one feel frustrated, angry or nervous. Both moderate and excessive stress can impact one's physical and emotional health negatively. While stress is a normal experience, anxiety involves worrying and affects one's lifestyle longer term. The document recommends stress management techniques like relaxation exercises, physical activity, meditation and counseling to improve physical, emotional and cognitive functioning.
More Related Content
What's hot
Anjalisoorej imca133 assignment
The document contains 10 Java programs that demonstrate various programming concepts:
1. A program to check if a number is a power of 2.
2. A program to sort an integer array using bubble sort without built-in methods.
3. A program to check if a number is an Armstrong number.
4. A program to reverse a string without using StringBuffer.
5. Programs to print the Fibonacci series using iterative and recursive approaches.
6. Programs to calculate the factorial of a number using iterative and recursive solutions.
7. A program to print a triangle pattern of stars.
8. A program to find the factorial of numbers passed as command line arguments.
9
Functions
A function is a block of code that performs a specific task and can be called from other parts of a program. Functions receive arguments, perform calculations, and return results. Functions are defined with a return type, name, and parameter list. For example, an "int sum(int a)" function takes an integer as a parameter, performs addition, and returns an integer. The main function calls other functions to perform tasks and receive returned values. Recursive functions call themselves to repeat a task.
Types of function call
This document discusses function call by value and reference in C programming. It provides examples of swapping integer values using each method. Call by value passes the actual value of an argument, so changes made to parameters inside the function do not affect the argument. Call by reference passes the address of an argument, allowing the function to access and modify the original argument value. The key differences are that call by value uses general variables as arguments while call by reference uses pointer variables, and only call by reference reflects changes to formal parameters in the actual parameters.
Infix to Postfix Conversion Using Stack
Infix to Postfix Conversion Using Stack is one of the most significant example of application of Stack which is an ADT (Abstract Data Type) based on LIFO concept.
Conversion of Infix To Postfix Expressions
Stacks have several application areas including:
1) When functions are called to save return addresses and local variables.
2) To convert infix expressions to postfix form by acting as a placeholder.
3) To evaluate postfix expressions by holding operands and intermediate results.
parameter passing in c#
Parameter passing methods are ways that parameters are transferred between functions when one function calls another. There are four main types of parameter passing in Java: value, reference, out, and parameter arrays. Value passing creates a copy of the parameter and changes do not affect the original. Reference passing uses the address of the parameter and allows changes to the original. Out passing is unidirectional and returns a new value. Parameter arrays allow a variable number of arguments using the params keyword.
C programming session 03
This document outlines practice questions from chapters 1 and 2, including writing a function to display a character 40 times, writing a function to display a string a specified number of times, using nested for loops to print a triangular pattern, writing a program to calculate triangular numbers from user input, and writing a program to check if a user input number is even or odd.
P3
This document describes Programming Assignment 3 which involves implementing a bigint class that can handle integers with up to 45 decimal digits. The bigint class must overload common operators like +, -, <, >, ==, !=, <<, and >> to behave similarly to built-in int types. It also requires various constructors and storing the digit values in a private array. Students are provided guidelines for completing the assignment and submitting their code.
CHAPTER 6
This document discusses different types of functions in C programming. It provides examples of functions with no arguments and no return value, functions with arguments and no return value, functions with arguments and return value, functions with no arguments but return value, and functions that return multiple values. The examples demonstrate how to define and call each type of function.
20BCE1734.pdf
This document describes two programs that implement synchronization between two threads accessing a critical section. The first program uses Peterson's solution with a global count variable that is incremented by one thread and decremented by the other. The second program uses semaphores for synchronization, with one thread incrementing and the other decrementing a shared variable. Both aim to safely update the variable value through the critical section five times each.
Presentation on function
A function is a block of code that performs a specific task. Functions allow for modularity and code reuse in a program. There are several key aspects of functions:
1. Functions are defined with a return type, name, and parameters. The general format is return_type function_name(parameter list).
2. Parameters allow functions to accept input from the caller. There are two ways parameters can be passed: call by value or call by reference.
3. Variables declared inside a function are local, while those declared outside are global and visible to all code. Local variables exist only during the function's execution.
4. Functions can call themselves recursively to repeat a task, with a base
Tail Recursion in data structure
Tail recursion is a type of recursion where the recursive call is the last thing executed by the function. This allows the compiler to optimize recursion by reusing the stack frame rather than allocating a new one for each recursive call. The key advantage is that tail recursive functions can process recursive problems of any size without overflowing the stack. Some examples show how a factorial function can be written iteratively using tail recursion, avoiding wasting memory on multiple stack frames.
Removal Of Recursion
The document discusses recursive functions and how they can be converted to iterative functions. It provides an example of a recursive factorial function and how it can be rewritten iteratively using a for loop instead of recursion. It also describes the general process of translating a recursive function to a non-recursive one by using stacks to store state between recursive calls and restoring that state when returning from the function.
Infix to postfix
Mohammad Saeed Farooqi presented on data structures and algorithms. He discussed infix, postfix, and prefix notation, operator precedence, evaluating postfix expressions using stacks, and converting infix to postfix using stacks. He provided examples and algorithms for postfix expression evaluation and converting between infix, postfix, and prefix notation.
Programming Global variable
Programming
Global variable
Local Variables
Global Variables
Formal Parameters
Initializing Local and Global Variables
Functions in C
This document discusses functions in C programming. It defines a function as a block of code that performs a specific task when called. It provides examples of functions used in hotel management like front office, reservation, and housekeeping. It explains function definition, declaration, calling, parameters, arguments, return statements. It differentiates between actual and formal arguments and discusses call by value and call by reference methods of passing arguments to functions.
Function & Recursion in C
The document discusses functions and recursion in C programming. It provides examples of different types of functions like void, float, int functions. It demonstrates simple functions with no parameters, functions that return values, and functions with parameters. It also explains recursion with examples of calculating factorials and Fibonacci series recursively. Finally, it discusses other function related concepts like function prototypes, scope of variables, and pre-defined math functions in C.
escape sequences and substitution markers
This document discusses escape sequences, verbatim strings, and substitution markers in C#. It provides examples of using escape sequences like \n for newlines. Verbatim strings prefixed with @ disable escape sequences. Substitution markers like {0} in a format string are replaced with variable values. The document demonstrates various string formatting techniques and taking user input in C# programs.
What's hot (18)
More from Omkar Rane
Enabling SSL Elasticsearch on server
This document provides steps to enable SSL/HTTPS for an Elasticsearch server. It involves generating certificates, configuring Elasticsearch, and enabling TLS for both transport and HTTP layers. The process includes generating a CA certificate, creating node certificates signed by the CA, editing the Elasticsearch configuration file, and restarting Elasticsearch to enable HTTPS.
Anti lock braking (ABS) Model based Design in MATLAB-Simulink
This document describes the modeling and simulation of an anti-lock braking system (ABS) using Simulink. It includes models of vehicle dynamics, wheel dynamics, and a simplified ABS controller. The vehicle model accounts for mass, friction forces, and acceleration. The wheel model includes torque from braking and friction. Simulation results show wheel slip and stopping distance with and without the ABS controller engaged. The ABS system helps maintain optimal slip to minimize stopping distance.
Autosar fundamental
The document discusses Autosar's layered architecture and communication capabilities. It describes the layered architecture with basic software, runtime environment and application layers. The runtime environment implements a virtual function bus to allow software components to communicate within and across ECUs. Communication can be intra-ECU, inter-ECU, or inter-partition. The runtime environment uses services like AUTOSAR COM and IOC to enable different types of communication.
Stress Management
The document discusses stress, its causes and effects, and strategies for managing stress. It defines stress as the body's response to any physical or mental demand, which can be triggered by events or thoughts that make one feel frustrated, angry or nervous. Both moderate and excessive stress can impact one's physical and emotional health negatively. While stress is a normal experience, anxiety involves worrying and affects one's lifestyle longer term. The document recommends stress management techniques like relaxation exercises, physical activity, meditation and counseling to improve physical, emotional and cognitive functioning.
Bootloaders (U-Boot)
This document discusses bootloaders for embedded systems. It defines a bootloader as the first code executed after a system powers on or resets that is responsible for loading the operating system kernel. The document then describes the tasks of a bootloader like initializing hardware, loading binaries from storage, and providing a shell. It outlines the booting process differences between desktops and embedded systems. Finally, it focuses on the universal bootloader U-Boot, describing its directory structure, configuration, building process, and commands.
Concept of Diversity & Fading (wireless communication)
This document discusses concepts related to fading and diversity in wireless communication systems. It introduces fading as signal variations caused by multipath interference from multiple signal propagation paths. It describes two types of fading: large-scale fading due to path loss and shadowing, and small-scale fading which includes fast fading due to mobility and slow fading due to shadowing. It also discusses different diversity techniques that can be used to combat fading, including space, polarization, frequency and time diversity.
Tata Motors GDC .LTD Internship
The document describes several projects completed as part of a semester-long internship at Tata Motors. The projects include:
1. Developing a vendor chatbot using Rasa and Telegram APIs to provide invoice information to users. NLP techniques were used to extract intent and entities.
2. Creating a dashboard using HTML, CSS, and Flask for employee health monitoring.
3. Building a system to automatically add new employee data from Excel files to an AWS RDS database to then be viewed on a dashboard.
4. Deploying projects to AWS EC2 and RDS instances.
5. Working on a contract lifecycle management dashboard for Tata Motors using various technologies.
Machine Learning Model for M.S admissions
The document describes building a machine learning model to predict admissions for a Master's program. It loads student data, preprocesses it by imputing missing values, splits it into training and test sets, trains several models and evaluates their accuracy via cross-validation. Logistic regression achieved the best results with 77.5% accuracy. The trained logistic regression model is used to make predictions on new student data.
Timer 0 programming on LPC 1768
The document defines a function called DelayMs that uses Timer0 to create delays in milliseconds. It initializes Timer0 to increment every 12,000 clock cycles, which at a clock speed of 12MHz equals 1ms. The main function blinks an LED by turning it on for 500ms, then off for 500ms in a continuous loop using the DelayMs function.
ADC (Analog to Digital conversion) using LPC 1768
This document contains code for an interfacing diagram that converts analog to digital values and displays the output in hexadecimal on an LCD screen. The code configures the ADC and UART ports, performs an analog to digital conversion on an input voltage, converts the output to hexadecimal, and transmits the values over UART. It also contains calculations for the step size of the ADC based on the reference voltage and bits. An observation table shows theoretical and measured output values for different input voltages.
PWM based motor speed control using LPC 1768
This code configures the LPC1768 microcontroller's PWM peripheral to generate a pulse width modulated signal on pin PWM1.5. It initializes the PWM timer and match registers, enables the PWM output, and then uses a for loop to incrementally change the duty cycle of the PWM signal from 10% to 100% over 10 steps, pausing 1 second between each step. This allows the user to see the PWM output change frequency smoothly over time.
UART interfacing on LPC1768 (Cortex M3 micro controller)
This code configures the UART0 port on an LPC1768 microcontroller to communicate at 9600 baud. It sets the pin configuration for transmit and receive, enables the FIFO and clears flags. It then configures the baud rate divisor, character length, parity and stop bits. The code enters a loop to continuously read incoming serial data and echo it back on the transmit line.
LED Blinking logic on LPC1768
This document provides an interfacing diagram and code for an LPC1768 microcontroller to toggle a set of GPIO pins. The code uses PINSEL4 and FIO2DIR registers to configure pins P0.2 to P0.7 as GPIO outputs. It then uses a for loop to toggle all the pins high and low by setting and clearing the FIO2SET and FIO2CLR registers respectively.
CAN interfacing on LPC1768 (ARM Cortex M3 based Micro controller)
The document describes code for initializing and transmitting messages over a CAN bus on an LPC1768 microcontroller, including initializing the CAN controller, setting an acceptance filter to define which message IDs will be received, and sending a test message over CAN1 while monitoring reception on CAN2. Functions are defined for CAN initialization, setting the acceptance filter, and transmitting messages with given IDs and data over CAN1.
Vlisi Course project presentation:Keypad Scanner
This document describes a keypad scanner project implemented on an FPGA board. It includes the truth table and equations for scanning the keys of a 3x4 keypad to drive 4 LEDs. The Verilog code implements this design using logic gates and assigns statements. The code was submitted by 3 students for their VLSI design course, overseen by instructor Dr. Dipti Sakhare. References on Verilog, digital design, and the FPGA board used are also listed.
VlSI course project report : Keypad Scanner
This project report describes the design, simulation, and implementation of a keypad scanner on an FPGA board. A Verilog code was written using a dataflow modeling style to scan a 3x4 keypad and output a 5-bit binary number corresponding to the pressed key. The code was simulated using Xilinx Vivado software. Finally, the design was implemented on a Digilent Nexys ddr FPGA board and tested successfully.
LPC 1768 A study on Real Time clock features
The document discusses the real-time clock (RTC) and backup registers for the LPC176x/5x microcontroller. It describes the RTC oscillator, clock control register, time counter registers, consolidated time registers, and steps for using the RTC including initializing, setting date and time, and reading date and time. Potential applications mentioned include a digital clock, timer controller, and data logging systems.
Nexys4ddr rm FPGA board Datasheet
This document provides an overview and reference manual for the Nexys4 DDR FPGA board. It describes the board's features such as the Artix-7 FPGA, memory resources, ports, and peripherals. It also provides details on power supplies, FPGA configuration options, and migrating designs from the original Nexys4 board. The manual is intended to help users understand and utilize the capabilities of the Nexys4 DDR board.
Linear Regression (Machine Learning)
The document discusses linear regression for predicting salary based on years of experience. It introduces gradient descent for linear regression, which iteratively updates the slope and intercept parameters (θ1 and θ2) to minimize cost and improve predictions. Gradient descent takes steps in the direction of the steepest descent down the cost function landscape. The learning rate determines step sizes and must be optimized for accurate predictions within a reasonable time.
transmission gate based design for 2:1 Multiplexer in micro-wind
A 2:1 multiplexer uses a transmission gate to select between two input signals and output the selected signal. The transmission gate is controlled by a select signal, where a high select chooses input A and a low select chooses input B. The multiplexer uses the select signal to pass either input A or B to the output without affecting the logic levels of the selected signal.
More from Omkar Rane (20)
Anti lock braking (ABS) Model based Design in MATLAB-Simulink
Anti lock braking (ABS) Model based Design in MATLAB-Simulink
Concept of Diversity & Fading (wireless communication)
Concept of Diversity & Fading (wireless communication)
UART interfacing on LPC1768 (Cortex M3 micro controller)
UART interfacing on LPC1768 (Cortex M3 micro controller)
CAN interfacing on LPC1768 (ARM Cortex M3 based Micro controller)
CAN interfacing on LPC1768 (ARM Cortex M3 based Micro controller)
transmission gate based design for 2:1 Multiplexer in micro-wind
transmission gate based design for 2:1 Multiplexer in micro-wind
Recently uploaded
Constructing Your Course Container for Effective Communication
Communicating effectively and consistently with students can help them feel at ease during their learning experience and provide the instructor with a communication trail to track the course's progress. This workshop will take you through constructing an engaging course container to facilitate effective communication.
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...Nguyen Thanh Tu Collection
https://app.box.com/s/qhtvq32h4ybf9t49ku85x0n3xl4jhr15Gender and Mental Health - Counselling and Family Therapy Applications and In...
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
Main Java[All of the Base Concepts}.docx
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
Mule event processing models | MuleSoft Mysore Meetup #47
Mule event processing models | MuleSoft Mysore Meetup #47
Event Link:- https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-mule-event-processing-models/
Agenda
● What is event processing in MuleSoft?
● Types of event processing models in Mule 4
● Distinction between the reactive, parallel, blocking & non-blocking processing
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shivani Yasaswi - https://www.linkedin.com/in/shivaniyasaswi/
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Leveraging Generative AI to Drive Nonprofit Innovation
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...Nguyen Thanh Tu Collection
https://app.box.com/s/y977uz6bpd3af4qsebv7r9b7s21935vdRHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Physical pharmaceutics notes for B.pharm students
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Aberdeen
The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
Recently uploaded (20)
Constructing Your Course Container for Effective Communication
Constructing Your Course Container for Effective Communication
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Mule event processing models | MuleSoft Mysore Meetup #47
Mule event processing models | MuleSoft Mysore Meetup #47
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
Leveraging Generative AI to Drive Nonprofit Innovation
Leveraging Generative AI to Drive Nonprofit Innovation
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
B. Ed Syllabus for babasaheb ambedkar education university.pdf
B. Ed Syllabus for babasaheb ambedkar education university.pdf
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
Exp 3-2 d422
- 1. Name of Students Omkar Rane Roll No D-422 Batch D1 Experiment No EX-3.2 Title of Experiment EX-3.2:Illustratefactorial of non-negativenumbersin Python. Write An Algorithm: Step 1: start Step 2: Define the function fact(no) Step 3: if (no==1): Step 4: Else return (no) # returning function Step 5: else : Return no*fact*(no-1) Step 6: Enter Value for factorial “n” Step 7: Display fact(n) Step8: Stop Paste Your Python Program ( Python Code): def fact(no): # defining function
- 2. if (no==1): return (no) # returning value else: return no*fact(no-1) n=raw_input("Enter number") n=int(n) p=fact(n) print p Paste Your Program OUTPUT : >>> 120 >>>