10_isxdigit.pdf
•
1 like•39,622 views
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.
Report
Share
Report
Share
Download to read offline
Recommended
10_isblank.pdf
The document discusses writing a function called isblank() that takes in an ASCII character as input and returns 0 or a non-zero value to indicate whether the character is a blank character or not. It defines blank characters as space or tab and provides examples of testing different characters like letters, punctuation, and space. It also lists functions and understanding the concept of functions as prerequisites.
12_ispunct.pdf
The document discusses writing a function to implement your own ispunct() function. It provides the input, output, and examples of the function. The input is a character ch, the output is 0 or non-zero depending on if ch is a punctuation character or not. Examples test characters like 'b', '$', and '4'. It also lists prerequisites of functions and the objective of understanding function concepts.
11_islower.pdf
The document discusses writing a function to implement an islower() function that checks if a character is a lowercase letter. It provides the input, output, and examples of the islower() function. The ASCII range for lowercase letters is given as 'a' to 'z'. Sample executions and prerequisites of functions are also mentioned.
PVS-Studio Meets Octave
In this article, I'm going to tell you about my experience of analyzing the Octave project. It is quite a popular one, especially among students who need to scan their math task solutions yet don't feel like buying a Matlab license.
This is a question from Assembly Language for x86 7th Edition by Kip I.docx
This is a question from Assembly Language for x86 7th Edition by Kip Irvine, but the solution is not there. Programming exercise 12.7 #2. The code must be in assembly language for Intel using Kip Irvine library. An example of the source code would be: INCLUDE Irvine32.inc .code main PROC mov ax,4000h mov bx,1000h mov cx,1500h sub ax,bx sub ax,cx call DumpRegs exit main ENDP END main Question: Write a procedure that receives a single-precision floating-point binary value and displays it in the following format: sign: display or ; significand: binary floating-point, prefixed by “1.†exponent: display in decimal, unbiased, preceded by the letter E and the exponent’s sign. Sample: .data sample REAL4 -1.75 Displayed output: -1.11000000000000000000000 E+0
Solution
.686
.model flat, stdcall
.stack 4096
INCLUDE Irvine32.inc
INCLUDE macros.inc
INCLUDE floatio.inc
.data
fVal REAL8 -1.75
Res DWORD 0
ten DWORD 10
dot db \'.\', 0
.code
main PROC
fld fVal
fst st(1)
fisttp Res
mov eax, Res
sub ax
mov bx Res
sub ax
mov cx Res
call DumpRegs
mov al, \'.\'
call DumpsRegs
@@:
fisub Res
ftst
fstsw ax
sahf
jbe @F ;forward
fimul ten
fst st(1)
fisttp Res
mov eax, Res
call WriteDec
jmp @B ;backword
exit
main ENDP
END main
.
Lesson 24. Phantom errors
Potential errors in 64-bit code may occur depending on compiler optimizations and input data sizes. Slight code changes can expose or hide errors, making them difficult to find. Optimizations may use 64-bit registers to avoid overflows, but minor code alterations could cause 32-bit registers and overflows. Therefore, code with potential errors is unstable and hard to test thoroughly.
Kotlin: maybe it's the right time
After 20 years, Java seems to feel the weight of the years and his syntax it isn't evolved as we live. But the JVM it is always a stable environment and it is often in production everywhere. In the past years, there were many languages based on the JVM, but they don't have a lot of success. Kotlin conquered Android and, now, thanks to an easy syntax many and big companies behind it, may be used also in web development, also as full stack language. During this talk, we will give a look the language and how to use it to develop a production ready web application.
All code showed during presentation is here: https://github.com/jesty/kotlin-fossavotabona
How do you create a programming language for the JVM?
The final dream of every developer is creating his own programming language. Today it is possible to realize that dream with a reasonable effort. In addition to that is also possible to leverage the JVM to make a language that can reuse a huge amount of libraries. In this presentation we are going to see what elements do we need to build our own language, with a compiler for the JVM. This is not only a lot of fun but it can be also useful in practice, to build Domain Specific Languages that compiles to bytecode and can be used together with mainstream languages in larger applications.
Recommended
10_isblank.pdf
The document discusses writing a function called isblank() that takes in an ASCII character as input and returns 0 or a non-zero value to indicate whether the character is a blank character or not. It defines blank characters as space or tab and provides examples of testing different characters like letters, punctuation, and space. It also lists functions and understanding the concept of functions as prerequisites.
12_ispunct.pdf
The document discusses writing a function to implement your own ispunct() function. It provides the input, output, and examples of the function. The input is a character ch, the output is 0 or non-zero depending on if ch is a punctuation character or not. Examples test characters like 'b', '$', and '4'. It also lists prerequisites of functions and the objective of understanding function concepts.
11_islower.pdf
The document discusses writing a function to implement an islower() function that checks if a character is a lowercase letter. It provides the input, output, and examples of the islower() function. The ASCII range for lowercase letters is given as 'a' to 'z'. Sample executions and prerequisites of functions are also mentioned.
PVS-Studio Meets Octave
In this article, I'm going to tell you about my experience of analyzing the Octave project. It is quite a popular one, especially among students who need to scan their math task solutions yet don't feel like buying a Matlab license.
This is a question from Assembly Language for x86 7th Edition by Kip I.docx
This is a question from Assembly Language for x86 7th Edition by Kip Irvine, but the solution is not there. Programming exercise 12.7 #2. The code must be in assembly language for Intel using Kip Irvine library. An example of the source code would be: INCLUDE Irvine32.inc .code main PROC mov ax,4000h mov bx,1000h mov cx,1500h sub ax,bx sub ax,cx call DumpRegs exit main ENDP END main Question: Write a procedure that receives a single-precision floating-point binary value and displays it in the following format: sign: display or ; significand: binary floating-point, prefixed by “1.†exponent: display in decimal, unbiased, preceded by the letter E and the exponent’s sign. Sample: .data sample REAL4 -1.75 Displayed output: -1.11000000000000000000000 E+0
Solution
.686
.model flat, stdcall
.stack 4096
INCLUDE Irvine32.inc
INCLUDE macros.inc
INCLUDE floatio.inc
.data
fVal REAL8 -1.75
Res DWORD 0
ten DWORD 10
dot db \'.\', 0
.code
main PROC
fld fVal
fst st(1)
fisttp Res
mov eax, Res
sub ax
mov bx Res
sub ax
mov cx Res
call DumpRegs
mov al, \'.\'
call DumpsRegs
@@:
fisub Res
ftst
fstsw ax
sahf
jbe @F ;forward
fimul ten
fst st(1)
fisttp Res
mov eax, Res
call WriteDec
jmp @B ;backword
exit
main ENDP
END main
.
Lesson 24. Phantom errors
Potential errors in 64-bit code may occur depending on compiler optimizations and input data sizes. Slight code changes can expose or hide errors, making them difficult to find. Optimizations may use 64-bit registers to avoid overflows, but minor code alterations could cause 32-bit registers and overflows. Therefore, code with potential errors is unstable and hard to test thoroughly.
Kotlin: maybe it's the right time
After 20 years, Java seems to feel the weight of the years and his syntax it isn't evolved as we live. But the JVM it is always a stable environment and it is often in production everywhere. In the past years, there were many languages based on the JVM, but they don't have a lot of success. Kotlin conquered Android and, now, thanks to an easy syntax many and big companies behind it, may be used also in web development, also as full stack language. During this talk, we will give a look the language and how to use it to develop a production ready web application.
All code showed during presentation is here: https://github.com/jesty/kotlin-fossavotabona
How do you create a programming language for the JVM?
The final dream of every developer is creating his own programming language. Today it is possible to realize that dream with a reasonable effort. In addition to that is also possible to leverage the JVM to make a language that can reuse a huge amount of libraries. In this presentation we are going to see what elements do we need to build our own language, with a compiler for the JVM. This is not only a lot of fun but it can be also useful in practice, to build Domain Specific Languages that compiles to bytecode and can be used together with mainstream languages in larger applications.
Python programming workshop session 2
This document summarizes the contents of the second day of a hands-on workshop on the Python programming language. It discusses indentation, the range function, for and while loops, conditional statements like if/elif, and modules for math, time, and random variables. Example code is provided to demonstrate various Python concepts like loops, logical operators, and comparisons between Python and C/C++ programming.
Errors detected in the Visual C++ 2012 libraries
Static code analysis is one of the error detection methodologies. We are glad that this methodology is becoming more and more popular nowadays. Visual Studio which includes static analysis as one of its many features contributes to this process to a large extent. This feature is easy to try and start using regularly. When one understands one likes static code analysis, we are glad to offer a professional analyzer PVS-Studio for the languages C/C++/C++11.
Java 5 6 Generics, Concurrency, Garbage Collection, Tuning
This document summarizes key features introduced in Java SE 5.0 (Tiger) including generics, autoboxing/unboxing, enhanced for loops, type-safe enums, varargs, static imports, and annotations. It also discusses performance enhancements in the virtual machine as well as new concurrency utilities like Executors and ScheduledExecutorService that make multi-threaded programming easier and more robust.
Handling inline assembly in Clang and LLVM
The document discusses how inline assembly is processed in Clang and LLVM. It outlines the target-specific logic involved at each stage, including operand constraint validation in Clang, lowering operands to LLVM IR, and printing different operand types in the assembler. Target-specific callbacks for inline assembly handling are scattered throughout Clang and LLVM. The goals are to learn the inline assembly workflow and provide documentation for backend developers to add support.
PVS-Studio for Linux Went on a Tour Around Disney
Recently we released a Linux version of PVS-Studio analyzer, which we had used before to check a number of open-source projects such as Chromium, GCC, LLVM (Clang), and others. Now this list includes several projects developed by Walt Disney Animation Studios for the community of virtual-reality developers. Let's see what bugs and defects the analyzer found in these projects.
From front-end to the hardware
This document discusses using JavaScript and Node.js for hardware control and robotics. It introduces Johnny-Five, an open-source framework for robotics programming in JavaScript. It also discusses Firmata, a protocol for communicating with microcontrollers from software. Examples are provided of using Johnny-Five to control an LED on an Arduino and comparing capabilities of single boards like Raspberry Pi, Intel Galileo, and ESP8266. NodeBots are defined as robots controlled via Node.js.
Davide Cerbo - Kotlin: forse è la volta buona - Codemotion Milan 2017
Dopo 20 anni Java inizia a sentire il peso degli anni e la sua sintassi non evolve come vorremmo, ma la JVM resta sempre un ambiente affidabile ed è già in produzione presso moltissime aziende. Negli ultimi anni sono usciti molti linguaggi basati sulla JVM, ma non tutti hanno avuto il successo sperato. Kotlin ha conquistato Android e, ora, grazie a una sintassi intuitiva e grandi aziende che lo supportano potrebbe essere molto utilizzato anche nelle applicazioni web. Durante il talk vedremo le basi del linguaggio e come sviluppare una applicazione web pronta ad andare in produzione.
Comparing the general static analysis in Visual Studio 2010 and PVS-Studio by...
The article demonstrates errors detected with the static code analyzer integrated into Visual Studio 2010. The research was performed on five open source projects. The same projects were also checked with PVS-Studio. Results of comparing these two tools are presented at the end of the article.
Swift Ready for Production?
Swift.berlin, this time kindly hosted by Wooga, invited Crispy's own Christian Weyer to speak about whether Apple's new programming language Swift is ready for primetime use in corporate, production environments. In order to answer that question, Christian ported an existing OS X application to Swift and created a new iOS application from scratch. Watch the video to see his results and the conclusions he drew from these experiences.
Video available at https://vimeo.com/113089291
FSOFT - Test Java Exam
This document contains 30 multiple choice questions about Java programming concepts. The questions cover topics like Java keywords, data types, arrays, methods, classes, inheritance, exceptions, and more. For each question, there are 4 possible answer choices listed from A to D.
Improving Java performance at JBCNConf 2015
The document discusses ways to improve Java performance. It begins by explaining how the Java compiler (javac) does not optimize code and leaves all optimizations to the Java Virtual Machine (JVM). It then provides examples of how the C compiler can optimize simple code better than javac. The document also discusses language features like autoboxing that add overhead and provides recommendations to improve loops, string concatenation, and method calls. Finally, it discusses tools for disassembling and profiling Java bytecode.
Serial Communication in LabVIEW FPGA on Xilinx Spartan 3E Starter board
This document provides instructions for implementing serial communication between a LabVIEW FPGA project on a Xilinx Spartan-3E board and a host PC. It describes converting a "Hello World!" message to ASCII codes, building an array with the message values, sending the message over serial when a button is pressed using a sequence structure with wait VIs, and viewing the received message in HyperTerminal. The goal is to demonstrate basic serial communication using LabVIEW FPGA and a Xilinx board.
Improving Android Performance at Mobiconf 2014
The document provides an overview of improving Android performance by discussing Java virtual machines, examples of code optimizations and anti-patterns, and tools for measuring and optimizing performance. It covers topics like avoiding autoboxing when possible, using arrays over lists for loops, caching array lengths, and using StringBuilder instead of string concatenation. Tooling discussed includes using a disassembler to view bytecode, code obfuscation with Proguard, and best practices for performance measurement.
Basic iOS Training with SWIFT - Part 2
The document discusses various looping constructs in Swift including for-in loops, while loops, and repeat-while loops. It provides syntax examples and sample outputs for each type of loop. It also covers strings, arrays, and dictionaries in Swift, describing how to create, access, modify and iterate over each.
Sockets in nach0s
There are three main types of sockets: stream, which uses TCP and is reliable; raw, which provides raw data transfer over IP; and datagram, which is message-oriented. Sockets can be used for unicast, multicast, and broadcast communication as well as loopback. To open a socket in Java for a client, create a Socket object; for a server, create a ServerSocket object and then accept incoming connections. Input and output streams are created using classes like DataInputStream and PrintStream, and sockets should be closed along with their streams to free resources.
Checking Clang 11 with PVS-Studio
Every now and then, we have to write articles about how we've checked another fresh version of some compiler. That's not really much fun. However, as practice shows, if we stop doing that for a while, folks start doubting whether PVS-Studio is worth its title of a good catcher of bugs and vulnerabilities. What if the new compiler can do that too? Sure, compilers evolve, but so does PVS-Studio – and it proves, again and again, its ability to catch bugs even in high-quality projects such as compilers.
Tesseract. Recognizing Errors in Recognition Software
Tesseract is a free software program for text recognition developed by Google. According to the project description, "Tesseract is probably the most accurate open source OCR engine available". And what if we try to catch some bugs there with the help of the CppCat analyzer?
Ports and Adapters Architecture - solid
Most of us using one of the agile methodologies for managing our project, but as we grow we find our code to be less maintainable, scalable and flexible for changes which cause loss of agile capabilities. We’ll address the issue that slow us down and discuss how we can design our code to retain the agility. We'll see how the architecture help us write better TDD and what similar methods are out there.
Hidden Gems in Swift
In this talk, Adrian Kashivskyy, Netguru iOS Developer, digs into rarely discussed Swift features, such as literal convertibles, interpolation convertibles, pattern matching, reflection and advanced Objective-C bridging.
More Related Content
Similar to 10_isxdigit.pdf
Python programming workshop session 2
This document summarizes the contents of the second day of a hands-on workshop on the Python programming language. It discusses indentation, the range function, for and while loops, conditional statements like if/elif, and modules for math, time, and random variables. Example code is provided to demonstrate various Python concepts like loops, logical operators, and comparisons between Python and C/C++ programming.
Errors detected in the Visual C++ 2012 libraries
Static code analysis is one of the error detection methodologies. We are glad that this methodology is becoming more and more popular nowadays. Visual Studio which includes static analysis as one of its many features contributes to this process to a large extent. This feature is easy to try and start using regularly. When one understands one likes static code analysis, we are glad to offer a professional analyzer PVS-Studio for the languages C/C++/C++11.
Java 5 6 Generics, Concurrency, Garbage Collection, Tuning
This document summarizes key features introduced in Java SE 5.0 (Tiger) including generics, autoboxing/unboxing, enhanced for loops, type-safe enums, varargs, static imports, and annotations. It also discusses performance enhancements in the virtual machine as well as new concurrency utilities like Executors and ScheduledExecutorService that make multi-threaded programming easier and more robust.
Handling inline assembly in Clang and LLVM
The document discusses how inline assembly is processed in Clang and LLVM. It outlines the target-specific logic involved at each stage, including operand constraint validation in Clang, lowering operands to LLVM IR, and printing different operand types in the assembler. Target-specific callbacks for inline assembly handling are scattered throughout Clang and LLVM. The goals are to learn the inline assembly workflow and provide documentation for backend developers to add support.
PVS-Studio for Linux Went on a Tour Around Disney
Recently we released a Linux version of PVS-Studio analyzer, which we had used before to check a number of open-source projects such as Chromium, GCC, LLVM (Clang), and others. Now this list includes several projects developed by Walt Disney Animation Studios for the community of virtual-reality developers. Let's see what bugs and defects the analyzer found in these projects.
From front-end to the hardware
This document discusses using JavaScript and Node.js for hardware control and robotics. It introduces Johnny-Five, an open-source framework for robotics programming in JavaScript. It also discusses Firmata, a protocol for communicating with microcontrollers from software. Examples are provided of using Johnny-Five to control an LED on an Arduino and comparing capabilities of single boards like Raspberry Pi, Intel Galileo, and ESP8266. NodeBots are defined as robots controlled via Node.js.
Davide Cerbo - Kotlin: forse è la volta buona - Codemotion Milan 2017
Dopo 20 anni Java inizia a sentire il peso degli anni e la sua sintassi non evolve come vorremmo, ma la JVM resta sempre un ambiente affidabile ed è già in produzione presso moltissime aziende. Negli ultimi anni sono usciti molti linguaggi basati sulla JVM, ma non tutti hanno avuto il successo sperato. Kotlin ha conquistato Android e, ora, grazie a una sintassi intuitiva e grandi aziende che lo supportano potrebbe essere molto utilizzato anche nelle applicazioni web. Durante il talk vedremo le basi del linguaggio e come sviluppare una applicazione web pronta ad andare in produzione.
Comparing the general static analysis in Visual Studio 2010 and PVS-Studio by...
The article demonstrates errors detected with the static code analyzer integrated into Visual Studio 2010. The research was performed on five open source projects. The same projects were also checked with PVS-Studio. Results of comparing these two tools are presented at the end of the article.
Swift Ready for Production?
Swift.berlin, this time kindly hosted by Wooga, invited Crispy's own Christian Weyer to speak about whether Apple's new programming language Swift is ready for primetime use in corporate, production environments. In order to answer that question, Christian ported an existing OS X application to Swift and created a new iOS application from scratch. Watch the video to see his results and the conclusions he drew from these experiences.
Video available at https://vimeo.com/113089291
FSOFT - Test Java Exam
This document contains 30 multiple choice questions about Java programming concepts. The questions cover topics like Java keywords, data types, arrays, methods, classes, inheritance, exceptions, and more. For each question, there are 4 possible answer choices listed from A to D.
Improving Java performance at JBCNConf 2015
The document discusses ways to improve Java performance. It begins by explaining how the Java compiler (javac) does not optimize code and leaves all optimizations to the Java Virtual Machine (JVM). It then provides examples of how the C compiler can optimize simple code better than javac. The document also discusses language features like autoboxing that add overhead and provides recommendations to improve loops, string concatenation, and method calls. Finally, it discusses tools for disassembling and profiling Java bytecode.
Serial Communication in LabVIEW FPGA on Xilinx Spartan 3E Starter board
This document provides instructions for implementing serial communication between a LabVIEW FPGA project on a Xilinx Spartan-3E board and a host PC. It describes converting a "Hello World!" message to ASCII codes, building an array with the message values, sending the message over serial when a button is pressed using a sequence structure with wait VIs, and viewing the received message in HyperTerminal. The goal is to demonstrate basic serial communication using LabVIEW FPGA and a Xilinx board.
Improving Android Performance at Mobiconf 2014
The document provides an overview of improving Android performance by discussing Java virtual machines, examples of code optimizations and anti-patterns, and tools for measuring and optimizing performance. It covers topics like avoiding autoboxing when possible, using arrays over lists for loops, caching array lengths, and using StringBuilder instead of string concatenation. Tooling discussed includes using a disassembler to view bytecode, code obfuscation with Proguard, and best practices for performance measurement.
Basic iOS Training with SWIFT - Part 2
The document discusses various looping constructs in Swift including for-in loops, while loops, and repeat-while loops. It provides syntax examples and sample outputs for each type of loop. It also covers strings, arrays, and dictionaries in Swift, describing how to create, access, modify and iterate over each.
Sockets in nach0s
There are three main types of sockets: stream, which uses TCP and is reliable; raw, which provides raw data transfer over IP; and datagram, which is message-oriented. Sockets can be used for unicast, multicast, and broadcast communication as well as loopback. To open a socket in Java for a client, create a Socket object; for a server, create a ServerSocket object and then accept incoming connections. Input and output streams are created using classes like DataInputStream and PrintStream, and sockets should be closed along with their streams to free resources.
Checking Clang 11 with PVS-Studio
Every now and then, we have to write articles about how we've checked another fresh version of some compiler. That's not really much fun. However, as practice shows, if we stop doing that for a while, folks start doubting whether PVS-Studio is worth its title of a good catcher of bugs and vulnerabilities. What if the new compiler can do that too? Sure, compilers evolve, but so does PVS-Studio – and it proves, again and again, its ability to catch bugs even in high-quality projects such as compilers.
Tesseract. Recognizing Errors in Recognition Software
Tesseract is a free software program for text recognition developed by Google. According to the project description, "Tesseract is probably the most accurate open source OCR engine available". And what if we try to catch some bugs there with the help of the CppCat analyzer?
Ports and Adapters Architecture - solid
Most of us using one of the agile methodologies for managing our project, but as we grow we find our code to be less maintainable, scalable and flexible for changes which cause loss of agile capabilities. We’ll address the issue that slow us down and discuss how we can design our code to retain the agility. We'll see how the architecture help us write better TDD and what similar methods are out there.
Hidden Gems in Swift
In this talk, Adrian Kashivskyy, Netguru iOS Developer, digs into rarely discussed Swift features, such as literal convertibles, interpolation convertibles, pattern matching, reflection and advanced Objective-C bridging.
Similar to 10_isxdigit.pdf (20)
Java 5 6 Generics, Concurrency, Garbage Collection, Tuning
Java 5 6 Generics, Concurrency, Garbage Collection, Tuning
Davide Cerbo - Kotlin: forse è la volta buona - Codemotion Milan 2017
Davide Cerbo - Kotlin: forse è la volta buona - Codemotion Milan 2017
Comparing the general static analysis in Visual Studio 2010 and PVS-Studio by...
Comparing the general static analysis in Visual Studio 2010 and PVS-Studio by...
Serial Communication in LabVIEW FPGA on Xilinx Spartan 3E Starter board
Serial Communication in LabVIEW FPGA on Xilinx Spartan 3E Starter board
Tesseract. Recognizing Errors in Recognition Software
Tesseract. Recognizing Errors in Recognition Software
More from Emertxe Information Technologies Pvt Ltd
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.
04_itoa.pdf
This document discusses implementing the itoa function, which converts an integer to a string. It provides examples of converting integers like 246, +123, and 23a7 to their string representations. The key steps are: getting each digit of the integer, converting each digit to a character, reversing the characters, and returning the string. Implementing itoa requires an understanding of functions and pointers. Sample code execution and prerequisites like functions and pointers are also outlined.
More from Emertxe Information Technologies Pvt Ltd (20)
Recently uploaded
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.
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.How to Build a Module in Odoo 17 Using the Scaffold Method
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
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
Digital Artifact 1 - 10VCD Environments Unit
Digital Artifact 1 - 10VCD Environments Unit - NGV Pavilion Concept Design
The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Introduction to AI for Nonprofits with Tapp Network
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
The Diamonds of 2023-2024 in the IGRA collection
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
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.
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar KanvariaMain 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.
Recently uploaded (20)
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold Method
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
Group Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana Buscigliopptx
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
10_isxdigit.pdf
- 1. Team Emertxe Function and Pointer Basics
- 4. Assignment 10 WAP to implement your own isxdigit() function
- 5. Assignment 10 WAP to implement your own isxdigit() function Input:
- 6. Assignment 10 WAP to implement your own isxdigit() function Input: Read an ASCII character ‘ch’
- 7. Assignment 10 WAP to implement your own isxdigit() function Input: Read an ASCII character ‘ch’ Output:
- 8. Assignment 10 WAP to implement your own isxdigit() function Input: Read an ASCII character ‘ch’ Output: 0 or non-zero value based on condition success or failure.
- 9. Assignment 10 What is isxdigit()? isxdigit() checks for hexadecimal digits, that is, one of 0 1 2 3 4 5 6 7 8 9 a b c d e f A B C D E F.
- 10. Assignment 10 What is the ASCII range for hexadecimal digits?
- 11. Assignment 10 What is the ASCII range for hexadecimal digits? Hexadecimal digit ranges from ‘0’ to ‘9’ or ‘a’ to ‘f’ or ‘A’ to ‘F’.
- 13. Assignment 10 Example’s: ⮚Input: ch = ‘a’
- 14. Assignment 10 Example’s: ⮚Input: ch = ‘a’ Output: The character ‘a’ is a hexadecimal digit.
- 15. Assignment 10 Example’s: ⮚Input: ch = ‘a’ Output: The character ‘a’ is a hexadecimal digit. ⮚Input: ch = ‘*’
- 16. Assignment 10 Example’s: ⮚Input: ch = ‘a’ Output: The character ‘a’ is a hexadecimal digit. ⮚Input: ch = ‘*’ Output: The character ‘*’ is not a hexadecimal digit.
- 17. Assignment 10 Example’s: ⮚Input: ch = ‘a’ Output: The character ‘a’ is a hexadecimal digit. ⮚Input: ch = ‘*’ Output: The character ‘*’ is not a hexadecimal digit. ⮚Input: ch = ‘F’
- 18. Assignment 10 Example’s: ⮚Input: ch = ‘a’ Output: The character ‘a’ is a hexadecimal digit. ⮚Input: ch = ‘*’ Output: The character ‘*’ is not a hexadecimal digit. ⮚Input: ch = ‘F’ ⮚Output: The character ‘F’ is a hexadecimal digit.
- 26. Assignment 10 Pre-requisites:- ⮚Functions Objective:- ⮚To understand the concept of Functions.