05_print_bits.pdf
•
0 likes•52,769 views
The document discusses a C program to print the last n bits of a given integer number. It provides the input, which is an integer num and number of bits n, and the output, which prints the last n bits of num in binary format. It includes some example inputs and outputs, such as for num=10, n=12, the output is 0000001000. It also lists prerequisites of bitwise operators and functions. The objective is to understand bitwise operations.
Report
Share
Report
Share
Download to read offline
Recommended
01_get_n_bits.pdf
This document provides an assignment to write a program to get 'n' bits from a given number. It includes examples of inputting a number and number of bits, showing the binary representation and extracting the bits. It demonstrates getting 1, 2, 3, and 4 bits from sample numbers. Pre-requisites of bitwise operators and functions are listed. The objective is to understand bitwise operations.
03_get_n_bits_from_pos.pdf
This document provides examples and instructions for a program to get a specified number (n) of bits from a given position (pos) in a number (num). It explains taking n bits from num at position pos using bitwise operators and binary representation. Examples are given for different values of num, n and pos, showing the binary format of num and the bits returned. Pre-requisites of bitwise operators and functions are listed, with the objective of understanding bitwise operations.
17_positive_fibonacci.pdf
This document provides an assignment to write a program to generate positive Fibonacci numbers using recursion. The program takes a number as input and outputs the Fibonacci sequence up to that number. It includes examples of running the program with different input values and the expected output. It also lists pre-requisites of arithmetic operators and recursion, and the objective of understanding recursive functions.
06_x_pattern.pdf
The document provides examples and instructions for writing a program to print numbers in an X pattern based on a given input number. It explains that the program should read an integer as input, then output an X pattern with that number of rows. It includes two examples - one with an input of 4 and output of 4 rows in an X pattern, and another example with an input of 5 and output of 5 rows in an X pattern. It also lists loops as a prerequisite for the task and the objective to understand nested looping.
04_toggle_n_bits_from_pos.pdf
This document provides examples and instructions for writing a program to toggle a given number of bits from a specified position in a number. It explains that the program should take in an integer, the number of bits to toggle, and the bit position. It then provides sample inputs and outputs, showing the before and after binary representations when toggling bits from different positions in numbers. It also lists bitwise operators and functions as prerequisites and the objective of understanding bitwise operations.
06_replace_n_bits_pos.pdf
The document discusses a C program to replace the least significant bits (LSBs) of an integer variable 'num' into another integer variable 'val' between bit positions 'b' and 'a'. It provides the function prototype, sample inputs and outputs, and step-by-step workings for examples. The objective is to understand bitwise operations by writing a program to extract the LSBs of 'num' and replace them into 'val' between the given bit positions. Pre-requisites mentioned are bitwise operators and functions.
10_parity.pdf
This document discusses a C program to count the number of set bits in a given number and determine its parity. It explains that the program takes an integer as input, calculates its binary representation, counts the number of 1 bits, and determines if that count is even or odd to print the parity as even or odd. Examples are provided with sample outputs. Pre-requisites of bitwise operators are listed. The objective is to understand the concept of bitwise operators.
07_circular_left_shift.pdf
The document discusses implementing a circular left bit shift on an integer number. It explains taking an integer input "num" and number of bits to shift "n" as input. It then demonstrates shifting the bits of "num" left by "n" positions, wrapping around from the left side to the right side, and outputting the result. Examples are provided shifting various integer values both positive and negative with different bit positions.
Recommended
01_get_n_bits.pdf
This document provides an assignment to write a program to get 'n' bits from a given number. It includes examples of inputting a number and number of bits, showing the binary representation and extracting the bits. It demonstrates getting 1, 2, 3, and 4 bits from sample numbers. Pre-requisites of bitwise operators and functions are listed. The objective is to understand bitwise operations.
03_get_n_bits_from_pos.pdf
This document provides examples and instructions for a program to get a specified number (n) of bits from a given position (pos) in a number (num). It explains taking n bits from num at position pos using bitwise operators and binary representation. Examples are given for different values of num, n and pos, showing the binary format of num and the bits returned. Pre-requisites of bitwise operators and functions are listed, with the objective of understanding bitwise operations.
17_positive_fibonacci.pdf
This document provides an assignment to write a program to generate positive Fibonacci numbers using recursion. The program takes a number as input and outputs the Fibonacci sequence up to that number. It includes examples of running the program with different input values and the expected output. It also lists pre-requisites of arithmetic operators and recursion, and the objective of understanding recursive functions.
06_x_pattern.pdf
The document provides examples and instructions for writing a program to print numbers in an X pattern based on a given input number. It explains that the program should read an integer as input, then output an X pattern with that number of rows. It includes two examples - one with an input of 4 and output of 4 rows in an X pattern, and another example with an input of 5 and output of 5 rows in an X pattern. It also lists loops as a prerequisite for the task and the objective to understand nested looping.
04_toggle_n_bits_from_pos.pdf
This document provides examples and instructions for writing a program to toggle a given number of bits from a specified position in a number. It explains that the program should take in an integer, the number of bits to toggle, and the bit position. It then provides sample inputs and outputs, showing the before and after binary representations when toggling bits from different positions in numbers. It also lists bitwise operators and functions as prerequisites and the objective of understanding bitwise operations.
06_replace_n_bits_pos.pdf
The document discusses a C program to replace the least significant bits (LSBs) of an integer variable 'num' into another integer variable 'val' between bit positions 'b' and 'a'. It provides the function prototype, sample inputs and outputs, and step-by-step workings for examples. The objective is to understand bitwise operations by writing a program to extract the LSBs of 'num' and replace them into 'val' between the given bit positions. Pre-requisites mentioned are bitwise operators and functions.
10_parity.pdf
This document discusses a C program to count the number of set bits in a given number and determine its parity. It explains that the program takes an integer as input, calculates its binary representation, counts the number of 1 bits, and determines if that count is even or odd to print the parity as even or odd. Examples are provided with sample outputs. Pre-requisites of bitwise operators are listed. The objective is to understand the concept of bitwise operators.
07_circular_left_shift.pdf
The document discusses implementing a circular left bit shift on an integer number. It explains taking an integer input "num" and number of bits to shift "n" as input. It then demonstrates shifting the bits of "num" left by "n" positions, wrapping around from the left side to the right side, and outputting the result. Examples are provided shifting various integer values both positive and negative with different bit positions.
16_factorial.pdf
The document discusses writing a program to calculate the factorial of a given number using recursion without additional functions. It explains that recursion involves a function calling itself and describes using the static keyword to retain the value of the variable between recursive calls. The document provides examples of calculating factorials for different input numbers and describes sample execution and prerequisites for recursion and storage classes.
07_triangle_pattern.pdf
The document describes a programming assignment to print a triangle pattern based on a user-input integer. It provides examples of input/output for different numbers, explaining that the pattern consists of consecutive integers printed in triangular rows with the appropriate number of spaces between values in each row. The number of spaces decreases by one for each subsequent row. Pre-requisites and the objective of understanding nested looping are also stated.
02_replace_n_bits.pdf
This document provides examples and instructions for a program to replace n bits of a given number. It explains that the program should take in an integer num, the number of bits n to replace, and a value val. It then describes the steps to clear n bits from num, take n bits from val, and replace those bits in num. Examples are provided with different num, n, and val inputs to demonstrate replacing bits and getting the updated num value. Pre-requisites of bitwise operators and functions are listed, with the objective of understanding bitwise operations.
02_replace_n_bits.pdf
This document provides examples and instructions for a program to replace n bits of a given number. It explains that the program should take in an integer num, the number of bits n to replace, and a value val. It then describes the steps to clear n bits from num, take n bits from val, and replace those bits in num. Examples are provided with different num, n, and val inputs to demonstrate replacing bits and getting the updated num value. Pre-requisites of bitwise operators and functions are listed, with the objective of understanding bitwise operations.
01_odd_even.pdf
The document describes an assignment to write a program that reads an integer number from the user as input, then prints whether the number is odd or even along with its sign. It provides examples of outputs for different integer inputs, such as "4 is positive even number" or "-6 is negative even number". The prerequisites mentioned are arithmetic operators and nested if-else constructs, and the objective is to understand nested if-else statements.
01 odd even
The document describes an assignment to write a program that reads an integer, checks if it is odd or even, and prints the number along with its sign. It provides examples of sample inputs and outputs, such as printing "4 is positive even number" for an input of 4. It also lists prerequisites of arithmetic operators and nested if-else statements and the objective of understanding nested if-else concepts.
18_negative_fibonacci.pdf
This document provides an assignment to write a program using recursion to generate negative Fibonacci numbers. It gives the input and output requirements, which are to read an integer and print the Fibonacci numbers up to that value. It provides examples of sample runs with different inputs and expected outputs. It also gives some pre-requisites of arithmetic operators and recursions and the objective of understanding recursive functions.
algorithm
The document contains algorithms for 12 different programming questions:
1. A program to find the maximum number in a list.
2. A program to calculate the difference between the sum of squares and square of sums of two numbers.
3. A program to calculate total profit from ticket sales based on number of attendees.
4. A program to calculate volume and surface area of a cylinder given radius and height.
5. A program to count the number of words in a string.
6. A program to convert a decimal number to binary.
7. A program to calculate factorial of a number using recursion.
8. A program to reverse elements in an integer array without
08_circular_right_shift.pdf
This document provides an example of how to implement a circular right shift of bits in C. It asks the user to input an integer and number of bits to shift. It then shows the binary representation before and after shifting bits to the right by that number of places. Examples are given for positive integers shifted 1-3 places and negative integers shifted 3 places. Pre-requisites and the objective of understanding bitwise operations and functions are also stated.
08_pyramid_pattern.pdf
The document provides instructions for writing a program to print a pyramid pattern based on a user-provided integer input. It explains that the program should take a number as input, then output a pyramid shape with that number of columns by printing numbers row by row, with each row containing the relevant numbers spaced appropriately. It provides examples for input numbers 4 and 5 to illustrate the expected output format. It also lists prerequisites of loops and notes the objective is to understand nested looping.
Insider mathematical
Here are 3 methods to check if a number is divisible by 7 without using the modulo (%) operator:
1. Subtract 7 repeatedly: Subtract 7 from the given number repeatedly. If at any point the number becomes 0, it is divisible by 7.
2. Digital root property: Keep adding the digits of the number until you are left with a single digit. If the digital root is 0 or 7, the original number is divisible by 7.
3. Alternate subtraction: Subtract the last digit from the remaining number. Then subtract twice the last digit from the remaining number alternately until a single digit number is obtained. If the final number is 0, the original number is divisible by 7.
So
4. algorithm
An algorithm is a precise set of unambiguous instructions that must be completed in a finite number of steps to solve a problem or reach a desired outcome. Key features of algorithms include being precise, unambiguous, terminating after a finite number of steps, avoiding infinite repetition of instructions, and obtaining the desired result upon termination. Examples provided calculate equality of two numbers, print the first 10 natural numbers, and find the sum of the first N natural numbers. Flow charts and pseudo code can be used to represent algorithms graphically or as informal high-level descriptions.
10_isxdigit.pdf
The document discusses implementing a function to check if a character is a hexadecimal digit. It explains that a hexadecimal digit ranges from 0-9, A-F, a-f in the ASCII table. It provides examples of inputting different characters and checking if they are hexadecimal digits or not. The sample execution section is empty. It lists functions as the prerequisite for understanding how to create a custom function to check for hexadecimal digits.
01_student_record.pdf
The document provides an example program to implement a student record system using an array of structures. It involves reading the number of students and subjects, student names and marks for each subject, calculating averages and grades. The program displays menus to view all student details or a particular student's details based on roll number or name. It demonstrates declaring a structure for student records, reading input into an array of structures, calculating averages and grades, and printing the student records with options to search by roll number or name.
02_swap.pdf
This document discusses writing a macro called swap(t,x,y) that swaps two arguments of any data type t. It asks the user to input a data type and two values of that type, then swaps the values and displays the output. It explains how to swap two integers by using a temporary variable and applying the same concept to arguments of any type t by using macros. The objective is to understand macro preprocessing in C.
01_sizeof.pdf
This document discusses defining a macro called SIZEOF to return the size of a data type without using the sizeof operator. It explains that by taking the difference of the addresses of a variable and the variable plus one, cast to char pointers, you can get the size in bytes. An example is provided using an integer variable x, showing how taking the difference of (&x+1) and &x after casting to char pointers returns the size of an int, which is 4 bytes. Background on macros and pointers is provided. The objective is stated as understanding macro usage in preprocessing.
07_product_matrix.pdf
The document describes a C program to multiply two matrices. It explains that the program takes input of rows and columns for Matrix A and B, reads in the element values, and checks that the column of the first matrix equals the row of the second before calculating the product. An example is provided where the matrices can be multiplied, producing the output matrix, and another where they cannot due to mismatched dimensions. Requirements for the program include pointers, 2D arrays, and dynamic memory allocation.
06_sort_names.pdf
The document describes an assignment to read in an unspecified number (n) of names of up to 20 characters each, sort the names alphabetically, and print the sorted list. It provides examples of reading in 3 names ("Arunachal", "Bengaluru", "Agra"), sorting them using a custom string comparison function, and printing the sorted list ("Agra", "Arunachal", "Bengaluru"). Pre-requisites for the assignment include functions, dynamic arrays, and pointers. The objective is to understand how to use functions, arrays and pointers to complete the task.
05_fragments.pdf
This document provides instructions for an assignment to implement fragments using an array of pointers. It asks the student to write a program that reads the number of rows and columns for each row, reads the elements for each row, calculates the average for each row, sorts the rows based on average, and prints the results. It includes examples that show reading input values, storing them in an array using pointers, calculating averages, sorting rows, and sample output. The prerequisites are listed as pointers, functions, and dynamic memory allocation, and the objective is stated as understanding dynamic memory allocation and arrays of pointers.
04_magic_square.pdf
The document describes an algorithm to generate a magic square of size n×n. It takes the integer n as input from the user and outputs the n×n magic square. A magic square is an arrangement of distinct numbers in a square grid where the sum of each row, column and diagonal is equal. The algorithm uses steps like starting from the middle of the grid and moving element by element in a pattern, wrapping around when reaching the boundaries.
More Related Content
Similar to 05_print_bits.pdf
16_factorial.pdf
The document discusses writing a program to calculate the factorial of a given number using recursion without additional functions. It explains that recursion involves a function calling itself and describes using the static keyword to retain the value of the variable between recursive calls. The document provides examples of calculating factorials for different input numbers and describes sample execution and prerequisites for recursion and storage classes.
07_triangle_pattern.pdf
The document describes a programming assignment to print a triangle pattern based on a user-input integer. It provides examples of input/output for different numbers, explaining that the pattern consists of consecutive integers printed in triangular rows with the appropriate number of spaces between values in each row. The number of spaces decreases by one for each subsequent row. Pre-requisites and the objective of understanding nested looping are also stated.
02_replace_n_bits.pdf
This document provides examples and instructions for a program to replace n bits of a given number. It explains that the program should take in an integer num, the number of bits n to replace, and a value val. It then describes the steps to clear n bits from num, take n bits from val, and replace those bits in num. Examples are provided with different num, n, and val inputs to demonstrate replacing bits and getting the updated num value. Pre-requisites of bitwise operators and functions are listed, with the objective of understanding bitwise operations.
02_replace_n_bits.pdf
This document provides examples and instructions for a program to replace n bits of a given number. It explains that the program should take in an integer num, the number of bits n to replace, and a value val. It then describes the steps to clear n bits from num, take n bits from val, and replace those bits in num. Examples are provided with different num, n, and val inputs to demonstrate replacing bits and getting the updated num value. Pre-requisites of bitwise operators and functions are listed, with the objective of understanding bitwise operations.
01_odd_even.pdf
The document describes an assignment to write a program that reads an integer number from the user as input, then prints whether the number is odd or even along with its sign. It provides examples of outputs for different integer inputs, such as "4 is positive even number" or "-6 is negative even number". The prerequisites mentioned are arithmetic operators and nested if-else constructs, and the objective is to understand nested if-else statements.
01 odd even
The document describes an assignment to write a program that reads an integer, checks if it is odd or even, and prints the number along with its sign. It provides examples of sample inputs and outputs, such as printing "4 is positive even number" for an input of 4. It also lists prerequisites of arithmetic operators and nested if-else statements and the objective of understanding nested if-else concepts.
18_negative_fibonacci.pdf
This document provides an assignment to write a program using recursion to generate negative Fibonacci numbers. It gives the input and output requirements, which are to read an integer and print the Fibonacci numbers up to that value. It provides examples of sample runs with different inputs and expected outputs. It also gives some pre-requisites of arithmetic operators and recursions and the objective of understanding recursive functions.
algorithm
The document contains algorithms for 12 different programming questions:
1. A program to find the maximum number in a list.
2. A program to calculate the difference between the sum of squares and square of sums of two numbers.
3. A program to calculate total profit from ticket sales based on number of attendees.
4. A program to calculate volume and surface area of a cylinder given radius and height.
5. A program to count the number of words in a string.
6. A program to convert a decimal number to binary.
7. A program to calculate factorial of a number using recursion.
8. A program to reverse elements in an integer array without
08_circular_right_shift.pdf
This document provides an example of how to implement a circular right shift of bits in C. It asks the user to input an integer and number of bits to shift. It then shows the binary representation before and after shifting bits to the right by that number of places. Examples are given for positive integers shifted 1-3 places and negative integers shifted 3 places. Pre-requisites and the objective of understanding bitwise operations and functions are also stated.
08_pyramid_pattern.pdf
The document provides instructions for writing a program to print a pyramid pattern based on a user-provided integer input. It explains that the program should take a number as input, then output a pyramid shape with that number of columns by printing numbers row by row, with each row containing the relevant numbers spaced appropriately. It provides examples for input numbers 4 and 5 to illustrate the expected output format. It also lists prerequisites of loops and notes the objective is to understand nested looping.
Insider mathematical
Here are 3 methods to check if a number is divisible by 7 without using the modulo (%) operator:
1. Subtract 7 repeatedly: Subtract 7 from the given number repeatedly. If at any point the number becomes 0, it is divisible by 7.
2. Digital root property: Keep adding the digits of the number until you are left with a single digit. If the digital root is 0 or 7, the original number is divisible by 7.
3. Alternate subtraction: Subtract the last digit from the remaining number. Then subtract twice the last digit from the remaining number alternately until a single digit number is obtained. If the final number is 0, the original number is divisible by 7.
So
4. algorithm
An algorithm is a precise set of unambiguous instructions that must be completed in a finite number of steps to solve a problem or reach a desired outcome. Key features of algorithms include being precise, unambiguous, terminating after a finite number of steps, avoiding infinite repetition of instructions, and obtaining the desired result upon termination. Examples provided calculate equality of two numbers, print the first 10 natural numbers, and find the sum of the first N natural numbers. Flow charts and pseudo code can be used to represent algorithms graphically or as informal high-level descriptions.
Similar to 05_print_bits.pdf (12)
More from Emertxe Information Technologies Pvt Ltd
10_isxdigit.pdf
The document discusses implementing a function to check if a character is a hexadecimal digit. It explains that a hexadecimal digit ranges from 0-9, A-F, a-f in the ASCII table. It provides examples of inputting different characters and checking if they are hexadecimal digits or not. The sample execution section is empty. It lists functions as the prerequisite for understanding how to create a custom function to check for hexadecimal digits.
01_student_record.pdf
The document provides an example program to implement a student record system using an array of structures. It involves reading the number of students and subjects, student names and marks for each subject, calculating averages and grades. The program displays menus to view all student details or a particular student's details based on roll number or name. It demonstrates declaring a structure for student records, reading input into an array of structures, calculating averages and grades, and printing the student records with options to search by roll number or name.
02_swap.pdf
This document discusses writing a macro called swap(t,x,y) that swaps two arguments of any data type t. It asks the user to input a data type and two values of that type, then swaps the values and displays the output. It explains how to swap two integers by using a temporary variable and applying the same concept to arguments of any type t by using macros. The objective is to understand macro preprocessing in C.
01_sizeof.pdf
This document discusses defining a macro called SIZEOF to return the size of a data type without using the sizeof operator. It explains that by taking the difference of the addresses of a variable and the variable plus one, cast to char pointers, you can get the size in bytes. An example is provided using an integer variable x, showing how taking the difference of (&x+1) and &x after casting to char pointers returns the size of an int, which is 4 bytes. Background on macros and pointers is provided. The objective is stated as understanding macro usage in preprocessing.
07_product_matrix.pdf
The document describes a C program to multiply two matrices. It explains that the program takes input of rows and columns for Matrix A and B, reads in the element values, and checks that the column of the first matrix equals the row of the second before calculating the product. An example is provided where the matrices can be multiplied, producing the output matrix, and another where they cannot due to mismatched dimensions. Requirements for the program include pointers, 2D arrays, and dynamic memory allocation.
06_sort_names.pdf
The document describes an assignment to read in an unspecified number (n) of names of up to 20 characters each, sort the names alphabetically, and print the sorted list. It provides examples of reading in 3 names ("Arunachal", "Bengaluru", "Agra"), sorting them using a custom string comparison function, and printing the sorted list ("Agra", "Arunachal", "Bengaluru"). Pre-requisites for the assignment include functions, dynamic arrays, and pointers. The objective is to understand how to use functions, arrays and pointers to complete the task.
05_fragments.pdf
This document provides instructions for an assignment to implement fragments using an array of pointers. It asks the student to write a program that reads the number of rows and columns for each row, reads the elements for each row, calculates the average for each row, sorts the rows based on average, and prints the results. It includes examples that show reading input values, storing them in an array using pointers, calculating averages, sorting rows, and sample output. The prerequisites are listed as pointers, functions, and dynamic memory allocation, and the objective is stated as understanding dynamic memory allocation and arrays of pointers.
04_magic_square.pdf
The document describes an algorithm to generate a magic square of size n×n. It takes the integer n as input from the user and outputs the n×n magic square. A magic square is an arrangement of distinct numbers in a square grid where the sum of each row, column and diagonal is equal. The algorithm uses steps like starting from the middle of the grid and moving element by element in a pattern, wrapping around when reaching the boundaries.
03_endianess.pdf
This document discusses endianness and provides an example program to convert between little endian and big endian formats. It defines endianness as the order of bytes in memory, and describes little endian as having the least significant byte at the lowest memory address and big endian as the opposite. An example shows inputting a 2-byte number in little endian format and outputting it in big endian. Pre-requisites of pointers and the objective of understanding endianness representations are also stated.
02_variance.pdf
The document provides steps to calculate variance of an array using dynamic memory allocation in C. It explains what variance is, shows an example to calculate variance of a sample array by finding the mean, deviations from mean, squaring the deviations and calculating the average of squared deviations. The key steps are: 1) Read array size and elements, 2) Calculate mean, 3) Find deviations from mean, 4) Square the deviations and store in another array, 5) Calculate average of squared deviations to get variance.
01_memory_manager.pdf
This document provides examples for an assignment to create a menu-driven program that stores and manipulates different data types (char, int, float, double) in dynamically allocated memory. It allocates 8 consecutive bytes to store the variables and uses flags to track which data types are stored. The menu allows the user to add, display, and remove elements as well as exit the program. Examples demonstrate initializing the flags, adding/removing elements, updating the flags, and displaying only elements whose flags are set. The objective is to understand dynamic memory allocation using pointers.
09_nrps.pdf
The document discusses generating non-repetitive pattern strings (NRPS) of length n using k distinct characters. It explains that an NRPS has a pattern that is not repeated consecutively. It provides steps to check if a string is an NRPS, including comparing characters and resetting a count if characters do not match. It also describes how to create an NRPS by starting with an ordered pattern and then copying subsequent characters to generate new patterns without repetition until the string reaches the desired length n. Sample inputs and outputs are provided.
11_pangram.pdf
The document discusses how to check if a string is a pangram, which is a sentence containing all 26 letters of the English alphabet. It provides an example of implementing the algorithm to check for a pangram by initializing an array to track letter occurrences, iterating through the input string to mark letters in the array, and checking if all letters are marked to determine if it is a pangram.
10_combinations.pdf
The document explains how to print all possible combinations of a given string by swapping characters. It provides an example of generating all six combinations of the string "ABC" through a step-by-step process of swapping characters. It also lists the prerequisites as strings, arrays, and pointers and the objective as understanding string manipulations.
08_squeeze.pdf
The document describes an assignment to write a program that squeezes characters from one string (s1) that match characters in a second string (s2). It provides examples of input/output and step-by-step demonstrations of the program removing matching characters from s1. It also lists prerequisites of functions, arrays, and pointers and the objective of understanding these concepts as they relate to strings.
07_strtok.pdf
The document discusses implementing the strtok() string tokenization function. It explains that strtok() breaks a string into tokens based on delimiters. The document then provides pseudocode to implement a custom strtok() function by iterating through the string, overwriting delimiter characters with null terminators to create tokens, and returning a pointer to each token. Sample input/output is provided. The objective is stated as understanding string functions, with prerequisites of strings, storage classes, and pointers.
06_reverserec.pdf
The document provides details on an assignment to write a program that recursively reverses a given string without using static variables, global variables, or loops. It includes the input, output, and examples of reversing the strings "Extreme" and "hello world". It also provides sample execution and pre-requisites of strings and recursive functions, with the objective being to understand reversing a string recursively.
05_reverseiter.pdf
The document provides code and examples for reversing a string using an iterative method in C++. It explains taking in a string as input, declaring output and input strings of the same length, and swapping the first and last characters, second and second to last, and so on through multiple iterations until the string is reversed. Examples show reversing the strings "Extreme" to "emertxE" and "hello world" to "dlrow olleh" through this iterative swap process. Pre-requisites of strings and loops are noted, with the objective stated as understanding string reversal using an iterative approach.
More from Emertxe Information Technologies Pvt Ltd (20)
Recently uploaded
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS Template 2023-2024 by: Irene S. Rueco
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
PCOS corelations and management through Ayurveda.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
Biological Screening of Herbal Drugs in detailed.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
What is the purpose of studying mathematics.pptx
Students often ask about what the purpose is for their learning. This PowerPoint highlights some really important reasons to study Mathematics.
How to Fix the Import Error in the Odoo 17
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcThesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)Academy of Science of South Africa
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
DRUGS AND ITS classification slide share
Any substance (other than food) that is used to prevent, diagnose, treat, or relieve symptoms of a
disease or abnormal condition
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...National Information Standards Organization (NISO)
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
Recently uploaded (20)
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Film vocab for eal 3 students: Australia the movie
Film vocab for eal 3 students: Australia the movie
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
05_print_bits.pdf
- 1. Team Emertxe Function and Pointer Basics
- 2. Assignment 5
- 3. Assignment 5
- 4. Assignment 5 WAP to print ‘n’ bits from LSB of a number
- 5. WAP to print ‘n’ bits from LSB of a number Input: Assignment 5
- 6. WAP to print ‘n’ bits from LSB of a number Input: Read integer ‘num’ and number of bits ‘n’ Assignment 5
- 7. WAP to print ‘n’ bits from LSB of a number Input: Read integer ‘num’ and number of bits ‘n’ Output: Assignment 5
- 8. WAP to print ‘n’ bits from LSB of a number Input: Read integer ‘num’ and number of bits ‘n’ Output: Print ‘n’ number of bits from LSB end of ‘num’. Assignment 5
- 10. Example’s: ➢ Input: num = 10 and n = 12 Assignment 5
- 11. Example’s: ➢ Input: num = 10 and n = 12 Output: Print last 12 bits in binary format of num 10: Assignment 5
- 12. Example’s: ➢ Input: num = 10 and n = 12 Output: Print last 12 bits in binary format of num 10: Assignment 5 0 0 0 1 0 1 0 0 0 0 0 0 num
- 13. Example’s: ➢ Input: num = 15 and n = 4 Assignment 5
- 14. Example’s: ➢ Input: num = 15 and n = 4 Output: Print last 4 bits in binary format of num 15: Assignment 5
- 15. Example’s: ➢ Input: num = 15 and n = 4 Output: Print last 4 bits in binary format of num 15: Assignment 5 1 1 1 1 num
- 16. Example’s: ➢ Input: num = 6 and n = 3 Assignment 5
- 17. Example’s: ➢ Input: num = 6 and n = 3 Output: Print last 3 bits in binary format of num 6: Assignment 5
- 18. Example’s: ➢ Input: num = 6 and n = 3 Output: Print last 3 bits in binary format of num 6: Assignment 5 ? ? ? num
- 19. Example’s: ➢ Input: num = 6 and n = 3 Output: Print last 3 bits in binary format of num 6: Assignment 5 0 1 1 num
- 20. Example’s: ➢ Input: num = 25 and n = 5 Assignment 5
- 21. Example’s: ➢ Input: num = 25 and n = 5 Output: Print last 5 bits in binary format of num 25: Assignment 5
- 22. Example’s: ➢ Input: num = 25 and n = 5 Output: Print last 5 bits in binary format of num 25: Assignment 5 ? ? ? num ? ?
- 23. Example’s: ➢ Input: num = 25 and n = 5 Output: Print last 5 bits in binary format of num 25: Assignment 5 0 1 1 num 0 1
- 28. Pre-requisites:- ➢ Bitwise operators ➢ Functions Assignment 5
- 29. Pre-requisites:- ➢ Bitwise operators ➢ Functions Objective:- Assignment 5
- 30. Pre-requisites:- ➢ Bitwise operators ➢ Functions Objective:- ➢ To understand the concept of Bitwise operations. Assignment 5