tag:blogger.com,1999:blog-71779445792030709662024-02-21T10:24:08.412-08:00C Programming Notes download, c program solve question paper, c programming tutorial, c example c programming tutorial, c Program examples,C Programming Notes download, c language notes,c language basics,c language PDF, what is c programming ,c programming pdf,c programming basics,programing in c,embedded c programming,c programming notes,basic of c programming,programming with c,c programming programs,c programming tutorial,c for beginners,c language free download,c language download ,c language book download free,turbo c download,turbo c free download,cprogrammingProf. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comBlogger68125tag:blogger.com,1999:blog-7177944579203070966.post-27301356252113923322018-08-27T03:45:00.001-07:002018-08-27T03:45:20.876-07:00function with return value | return in c<iframe allowfullscreen="" frameborder="0" height="270" src="https://www.youtube.com/embed/O1_8RBeaJ38" width="480"></iframe>Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-4150280100005775792018-08-27T03:12:00.001-07:002018-08-27T03:12:22.888-07:00function with parameter<iframe allowfullscreen="" frameborder="0" height="344" src="https://www.youtube.com/embed/HGS-OVowPN8" width="459"></iframe>Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-76622207922543840312018-08-27T01:40:00.001-07:002018-08-27T01:40:16.915-07:00c basic function | C function basic program<iframe allowfullscreen="" frameborder="0" height="344" src="https://www.youtube.com/embed/qp-rHStf3uc" width="459"></iframe>Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-63564489675717360202018-08-27T00:28:00.001-07:002018-08-27T00:29:31.686-07:00array in c | accept array element and print c program<div dir="ltr" style="text-align: left;" trbidi="on">
<h2>
<iframe allowfullscreen="" frameborder="0" height="344" src="https://www.youtube.com/embed/Nmz9ynWXcX0" width="459"></iframe><br /></h2>
<h2>
array in c | accept array element and print c program</h2>
</div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-14096950853509085492017-03-18T01:30:00.001-07:002018-04-19T01:50:23.018-07:00Free C-Programming ebooks Download<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: center;">
<span style="color: #674ea7;"><span style="background-color: #fff2cc;"><span style="font-size: large;"><span style="color: black;"><span style="font-size: x-large;">Download C Programming Book</span></span></span></span></span></h2>
<h2 style="text-align: center;">
<span style="color: #674ea7;"><span style="background-color: #fff2cc;"><span style="font-size: large;"> ---------------------------------------------------</span></span></span></h2>
<h2 style="text-align: center;">
C programming books designed to help you better understand and study programming in C, Free C-Programming ebooks Download , Free C-Programming programming ebooks download,Download free C-Programming Ebook and C-Programming Programming Ebook,C Programming, Objective-C Programming</h2>
<div style="text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgECxaMFERb1B2Hi_DqHSvxnIXsc65n4b_8pfbOFOKBERp13Q6uUT5_brw7jy0Yr4W6tMDxRLetPt2of6yrLU9fDfcSoK981FW24y39ycc4uzbyU2714H5e7tp_LGKq1hcgcEu0qx8c8DVW/s1600/c+programming+book.bmp" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="400" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgECxaMFERb1B2Hi_DqHSvxnIXsc65n4b_8pfbOFOKBERp13Q6uUT5_brw7jy0Yr4W6tMDxRLetPt2of6yrLU9fDfcSoK981FW24y39ycc4uzbyU2714H5e7tp_LGKq1hcgcEu0qx8c8DVW/s1600/c+programming+book.bmp" width="316" /></a></div>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
<span style="font-size: x-large;"><ins class="adsbygoogle" data-ad-client="ca-pub-8696864193076876" data-ad-format="auto" data-ad-slot="1989112410" style="display: block;"></ins> </span><span style="-moz-appearance: unset; -moz-box-align: unset; -moz-box-direction: unset; -moz-box-flex: unset; -moz-box-ordinal-group: unset; -moz-box-orient: unset; -moz-box-pack: unset; -moz-context-properties: unset; -moz-control-character-visibility: unset; -moz-float-edge: unset; -moz-force-broken-image-icon: unset; -moz-image-region: unset; -moz-orient: unset; -moz-outline-radius: unset; -moz-stack-sizing: unset; -moz-tab-size: unset; -moz-text-size-adjust: unset; -moz-user-focus: unset; -moz-user-input: unset; -moz-user-modify: unset; -moz-user-select: text; -moz-window-dragging: unset; -webkit-text-fill-color: unset; -webkit-text-stroke: unset; animation: unset; backface-visibility: unset; background-blend-mode: unset; background: unset; block-size: unset; border-block-end: unset; border-block-start: unset; border-collapse: unset; border-inline-end: unset; border-inline-start: unset; border-radius: unset; border-spacing: unset; border: unset; bottom: unset; box-decoration-break: unset; box-shadow: unset; box-sizing: unset; caption-side: unset; caret-color: unset; clear: unset; clip-path: unset; clip-rule: unset; clip: rect(0px, 0px, 0px, 0px); color-adjust: unset; color-interpolation-filters: unset; color-interpolation: unset; color: unset; column-fill: unset; column-gap: unset; column-rule: unset; columns: unset; content: unset; counter-increment: unset; counter-reset: unset; cursor: unset; display: unset; dominant-baseline: unset; empty-cells: unset; fill-opacity: unset; fill-rule: unset; fill: unset; filter: unset; flex-flow: unset; flex: unset; float: unset; flood-color: unset; flood-opacity: unset; font-synthesis: unset; font: unset; grid-area: unset; grid-gap: unset; grid: unset; height: unset; hyphens: unset; image-orientation: unset; image-rendering: unset; ime-mode: unset; inline-size: unset; isolation: unset; left: unset; letter-spacing: unset; lighting-color: unset; list-style: unset; margin-block-end: unset; margin-block-start: unset; margin-inline-end: unset; margin-inline-start: unset; margin: unset; marker: unset; mask-type: unset; mask: unset; max-block-size: unset; max-height: unset; max-inline-size: unset; max-width: unset; min-block-size: unset; min-height: unset; min-inline-size: unset; min-width: unset; mix-blend-mode: unset; object-fit: unset; object-position: unset; offset-block-end: unset; offset-block-start: unset; offset-inline-end: unset; offset-inline-start: unset; opacity: unset; order: unset; outline-offset: unset; outline: unset; overflow-wrap: unset; overflow: unset; overscroll-behavior: unset; padding-block-end: unset; padding-block-start: unset; padding-inline-end: unset; padding-inline-start: unset; padding: unset; page-break-after: unset; page-break-before: unset; page-break-inside: unset; paint-order: unset; perspective-origin: unset; perspective: unset; place-content: unset; place-items: unset; place-self: unset; pointer-events: unset; position: fixed; quotes: unset; resize: unset; right: unset; ruby-align: unset; ruby-position: unset; scroll-behavior: unset; scroll-snap-coordinate: unset; scroll-snap-destination: unset; scroll-snap-points-x: unset; scroll-snap-points-y: unset; scroll-snap-type: unset; shape-rendering: unset; stop-color: unset; stop-opacity: unset; stroke-dasharray: unset; stroke-dashoffset: unset; stroke-linecap: unset; stroke-linejoin: unset; stroke-miterlimit: unset; stroke-opacity: unset; stroke-width: unset; stroke: unset; table-layout: unset; text-align-last: unset; text-align: unset; text-anchor: unset; text-combine-upright: unset; text-decoration: unset; text-emphasis-position: unset; text-emphasis: unset; text-indent: unset; text-justify: unset; text-orientation: unset; text-overflow: unset; text-rendering: unset; text-shadow: unset; text-transform: unset; top: 0px; touch-action: unset; transform-box: unset; transform-origin: unset; transform-style: unset; transform: unset; transition: unset; vector-effect: unset; vertical-align: unset; visibility: unset; white-space: pre; width: unset; will-change: unset; word-break: unset; word-spacing: unset; writing-mode: unset; z-index: unset;">http://imojo.in/5y8g8c</span></h2>
<h2 style="text-align: left;">
<span style="font-size: x-large;"> </span><span style="-moz-appearance: unset; -moz-box-align: unset; -moz-box-direction: unset; -moz-box-flex: unset; -moz-box-ordinal-group: unset; -moz-box-orient: unset; -moz-box-pack: unset; -moz-context-properties: unset; -moz-control-character-visibility: unset; -moz-float-edge: unset; -moz-force-broken-image-icon: unset; -moz-image-region: unset; -moz-orient: unset; -moz-outline-radius: unset; -moz-stack-sizing: unset; -moz-tab-size: unset; -moz-text-size-adjust: unset; -moz-user-focus: unset; -moz-user-input: unset; -moz-user-modify: unset; -moz-user-select: text; -moz-window-dragging: unset; -webkit-text-fill-color: unset; -webkit-text-stroke: unset; animation: unset; backface-visibility: unset; background-blend-mode: unset; background: unset; block-size: unset; border-block-end: unset; border-block-start: unset; border-collapse: unset; border-inline-end: unset; border-inline-start: unset; border-radius: unset; border-spacing: unset; border: unset; bottom: unset; box-decoration-break: unset; box-shadow: unset; box-sizing: unset; caption-side: unset; caret-color: unset; clear: unset; clip-path: unset; clip-rule: unset; clip: rect(0px, 0px, 0px, 0px); color-adjust: unset; color-interpolation-filters: unset; color-interpolation: unset; color: unset; column-fill: unset; column-gap: unset; column-rule: unset; columns: unset; content: unset; counter-increment: unset; counter-reset: unset; cursor: unset; display: unset; dominant-baseline: unset; empty-cells: unset; fill-opacity: unset; fill-rule: unset; fill: unset; filter: unset; flex-flow: unset; flex: unset; float: unset; flood-color: unset; flood-opacity: unset; font-synthesis: unset; font: unset; grid-area: unset; grid-gap: unset; grid: unset; height: unset; hyphens: unset; image-orientation: unset; image-rendering: unset; ime-mode: unset; inline-size: unset; isolation: unset; left: unset; letter-spacing: unset; lighting-color: unset; list-style: unset; margin-block-end: unset; margin-block-start: unset; margin-inline-end: unset; margin-inline-start: unset; margin: unset; marker: unset; mask-type: unset; mask: unset; max-block-size: unset; max-height: unset; max-inline-size: unset; max-width: unset; min-block-size: unset; min-height: unset; min-inline-size: unset; min-width: unset; mix-blend-mode: unset; object-fit: unset; object-position: unset; offset-block-end: unset; offset-block-start: unset; offset-inline-end: unset; offset-inline-start: unset; opacity: unset; order: unset; outline-offset: unset; outline: unset; overflow-wrap: unset; overflow: unset; overscroll-behavior: unset; padding-block-end: unset; padding-block-start: unset; padding-inline-end: unset; padding-inline-start: unset; padding: unset; page-break-after: unset; page-break-before: unset; page-break-inside: unset; paint-order: unset; perspective-origin: unset; perspective: unset; place-content: unset; place-items: unset; place-self: unset; pointer-events: unset; position: fixed; quotes: unset; resize: unset; right: unset; ruby-align: unset; ruby-position: unset; scroll-behavior: unset; scroll-snap-coordinate: unset; scroll-snap-destination: unset; scroll-snap-points-x: unset; scroll-snap-points-y: unset; scroll-snap-type: unset; shape-rendering: unset; stop-color: unset; stop-opacity: unset; stroke-dasharray: unset; stroke-dashoffset: unset; stroke-linecap: unset; stroke-linejoin: unset; stroke-miterlimit: unset; stroke-opacity: unset; stroke-width: unset; stroke: unset; table-layout: unset; text-align-last: unset; text-align: unset; text-anchor: unset; text-combine-upright: unset; text-decoration: unset; text-emphasis-position: unset; text-emphasis: unset; text-indent: unset; text-justify: unset; text-orientation: unset; text-overflow: unset; text-rendering: unset; text-shadow: unset; text-transform: unset; top: 0px; touch-action: unset; transform-box: unset; transform-origin: unset; transform-style: unset; transform: unset; transition: unset; vector-effect: unset; vertical-align: unset; visibility: unset; white-space: pre; width: unset; will-change: unset; word-break: unset; word-spacing: unset; writing-mode: unset; z-index: unset;">http://imojo.in/5y8g8c</span><span style="-moz-appearance: unset; -moz-box-align: unset; -moz-box-direction: unset; -moz-box-flex: unset; -moz-box-ordinal-group: unset; -moz-box-orient: unset; -moz-box-pack: unset; -moz-context-properties: unset; -moz-control-character-visibility: unset; -moz-float-edge: unset; -moz-force-broken-image-icon: unset; -moz-image-region: unset; -moz-orient: unset; -moz-outline-radius: unset; -moz-stack-sizing: unset; -moz-tab-size: unset; -moz-text-size-adjust: unset; -moz-user-focus: unset; -moz-user-input: unset; -moz-user-modify: unset; -moz-user-select: text; -moz-window-dragging: unset; -webkit-text-fill-color: unset; -webkit-text-stroke: unset; animation: unset; backface-visibility: unset; background-blend-mode: unset; background: unset; block-size: unset; border-block-end: unset; border-block-start: unset; border-collapse: unset; border-inline-end: unset; border-inline-start: unset; border-radius: unset; border-spacing: unset; border: unset; bottom: unset; box-decoration-break: unset; box-shadow: unset; box-sizing: unset; caption-side: unset; caret-color: unset; clear: unset; clip-path: unset; clip-rule: unset; clip: rect(0px, 0px, 0px, 0px); color-adjust: unset; color-interpolation-filters: unset; color-interpolation: unset; color: unset; column-fill: unset; column-gap: unset; column-rule: unset; columns: unset; content: unset; counter-increment: unset; counter-reset: unset; cursor: unset; display: unset; dominant-baseline: unset; empty-cells: unset; fill-opacity: unset; fill-rule: unset; fill: unset; filter: unset; flex-flow: unset; flex: unset; float: unset; flood-color: unset; flood-opacity: unset; font-synthesis: unset; font: unset; grid-area: unset; grid-gap: unset; grid: unset; height: unset; hyphens: unset; image-orientation: unset; image-rendering: unset; ime-mode: unset; inline-size: unset; isolation: unset; left: unset; letter-spacing: unset; lighting-color: unset; list-style: unset; margin-block-end: unset; margin-block-start: unset; margin-inline-end: unset; margin-inline-start: unset; margin: unset; marker: unset; mask-type: unset; mask: unset; max-block-size: unset; max-height: unset; max-inline-size: unset; max-width: unset; min-block-size: unset; min-height: unset; min-inline-size: unset; min-width: unset; mix-blend-mode: unset; object-fit: unset; object-position: unset; offset-block-end: unset; offset-block-start: unset; offset-inline-end: unset; offset-inline-start: unset; opacity: unset; order: unset; outline-offset: unset; outline: unset; overflow-wrap: unset; overflow: unset; overscroll-behavior: unset; padding-block-end: unset; padding-block-start: unset; padding-inline-end: unset; padding-inline-start: unset; padding: unset; page-break-after: unset; page-break-before: unset; page-break-inside: unset; paint-order: unset; perspective-origin: unset; perspective: unset; place-content: unset; place-items: unset; place-self: unset; pointer-events: unset; position: fixed; quotes: unset; resize: unset; right: unset; ruby-align: unset; ruby-position: unset; scroll-behavior: unset; scroll-snap-coordinate: unset; scroll-snap-destination: unset; scroll-snap-points-x: unset; scroll-snap-points-y: unset; scroll-snap-type: unset; shape-rendering: unset; stop-color: unset; stop-opacity: unset; stroke-dasharray: unset; stroke-dashoffset: unset; stroke-linecap: unset; stroke-linejoin: unset; stroke-miterlimit: unset; stroke-opacity: unset; stroke-width: unset; stroke: unset; table-layout: unset; text-align-last: unset; text-align: unset; text-anchor: unset; text-combine-upright: unset; text-decoration: unset; text-emphasis-position: unset; text-emphasis: unset; text-indent: unset; text-justify: unset; text-orientation: unset; text-overflow: unset; text-rendering: unset; text-shadow: unset; text-transform: unset; top: 0px; touch-action: unset; transform-box: unset; transform-origin: unset; transform-style: unset; transform: unset; transition: unset; vector-effect: unset; vertical-align: unset; visibility: unset; white-space: pre; width: unset; will-change: unset; word-break: unset; word-spacing: unset; writing-mode: unset; z-index: unset;">http://imojo.in/5y8g8c</span><span style="-moz-appearance: unset; -moz-box-align: unset; -moz-box-direction: unset; -moz-box-flex: unset; -moz-box-ordinal-group: unset; -moz-box-orient: unset; -moz-box-pack: unset; -moz-context-properties: unset; -moz-control-character-visibility: unset; -moz-float-edge: unset; -moz-force-broken-image-icon: unset; -moz-image-region: unset; -moz-orient: unset; -moz-outline-radius: unset; -moz-stack-sizing: unset; -moz-tab-size: unset; -moz-text-size-adjust: unset; -moz-user-focus: unset; -moz-user-input: unset; -moz-user-modify: unset; -moz-user-select: text; -moz-window-dragging: unset; -webkit-text-fill-color: unset; -webkit-text-stroke: unset; animation: unset; backface-visibility: unset; background-blend-mode: unset; background: unset; block-size: unset; border-block-end: unset; border-block-start: unset; border-collapse: unset; border-inline-end: unset; border-inline-start: unset; border-radius: unset; border-spacing: unset; border: unset; bottom: unset; box-decoration-break: unset; box-shadow: unset; box-sizing: unset; caption-side: unset; caret-color: unset; clear: unset; clip-path: unset; clip-rule: unset; clip: rect(0px, 0px, 0px, 0px); color-adjust: unset; color-interpolation-filters: unset; color-interpolation: unset; color: unset; column-fill: unset; column-gap: unset; column-rule: unset; columns: unset; content: unset; counter-increment: unset; counter-reset: unset; cursor: unset; display: unset; dominant-baseline: unset; empty-cells: unset; fill-opacity: unset; fill-rule: unset; fill: unset; filter: unset; flex-flow: unset; flex: unset; float: unset; flood-color: unset; flood-opacity: unset; font-synthesis: unset; font: unset; grid-area: unset; grid-gap: unset; grid: unset; height: unset; hyphens: unset; image-orientation: unset; image-rendering: unset; ime-mode: unset; inline-size: unset; isolation: unset; left: unset; letter-spacing: unset; lighting-color: unset; list-style: unset; margin-block-end: unset; margin-block-start: unset; margin-inline-end: unset; margin-inline-start: unset; margin: unset; marker: unset; mask-type: unset; mask: unset; max-block-size: unset; max-height: unset; max-inline-size: unset; max-width: unset; min-block-size: unset; min-height: unset; min-inline-size: unset; min-width: unset; mix-blend-mode: unset; object-fit: unset; object-position: unset; offset-block-end: unset; offset-block-start: unset; offset-inline-end: unset; offset-inline-start: unset; opacity: unset; order: unset; outline-offset: unset; outline: unset; overflow-wrap: unset; overflow: unset; overscroll-behavior: unset; padding-block-end: unset; padding-block-start: unset; padding-inline-end: unset; padding-inline-start: unset; padding: unset; page-break-after: unset; page-break-before: unset; page-break-inside: unset; paint-order: unset; perspective-origin: unset; perspective: unset; place-content: unset; place-items: unset; place-self: unset; pointer-events: unset; position: fixed; quotes: unset; resize: unset; right: unset; ruby-align: unset; ruby-position: unset; scroll-behavior: unset; scroll-snap-coordinate: unset; scroll-snap-destination: unset; scroll-snap-points-x: unset; scroll-snap-points-y: unset; scroll-snap-type: unset; shape-rendering: unset; stop-color: unset; stop-opacity: unset; stroke-dasharray: unset; stroke-dashoffset: unset; stroke-linecap: unset; stroke-linejoin: unset; stroke-miterlimit: unset; stroke-opacity: unset; stroke-width: unset; stroke: unset; table-layout: unset; text-align-last: unset; text-align: unset; text-anchor: unset; text-combine-upright: unset; text-decoration: unset; text-emphasis-position: unset; text-emphasis: unset; text-indent: unset; text-justify: unset; text-orientation: unset; text-overflow: unset; text-rendering: unset; text-shadow: unset; text-transform: unset; top: 0px; touch-action: unset; transform-box: unset; transform-origin: unset; transform-style: unset; transform: unset; transition: unset; vector-effect: unset; vertical-align: unset; visibility: unset; white-space: pre; width: unset; will-change: unset; word-break: unset; word-spacing: unset; writing-mode: unset; z-index: unset;">http://imojo.in/5y8g8c</span><span style="-moz-appearance: unset; -moz-box-align: unset; -moz-box-direction: unset; -moz-box-flex: unset; -moz-box-ordinal-group: unset; -moz-box-orient: unset; -moz-box-pack: unset; -moz-context-properties: unset; -moz-control-character-visibility: unset; -moz-float-edge: unset; -moz-force-broken-image-icon: unset; -moz-image-region: unset; -moz-orient: unset; -moz-outline-radius: unset; -moz-stack-sizing: unset; -moz-tab-size: unset; -moz-text-size-adjust: unset; -moz-user-focus: unset; -moz-user-input: unset; -moz-user-modify: unset; -moz-user-select: text; -moz-window-dragging: unset; -webkit-text-fill-color: unset; -webkit-text-stroke: unset; animation: unset; backface-visibility: unset; background-blend-mode: unset; background: unset; block-size: unset; border-block-end: unset; border-block-start: unset; border-collapse: unset; border-inline-end: unset; border-inline-start: unset; border-radius: unset; border-spacing: unset; border: unset; bottom: unset; box-decoration-break: unset; box-shadow: unset; box-sizing: unset; caption-side: unset; caret-color: unset; clear: unset; clip-path: unset; clip-rule: unset; clip: rect(0px, 0px, 0px, 0px); color-adjust: unset; color-interpolation-filters: unset; color-interpolation: unset; color: unset; column-fill: unset; column-gap: unset; column-rule: unset; columns: unset; content: unset; counter-increment: unset; counter-reset: unset; cursor: unset; display: unset; dominant-baseline: unset; empty-cells: unset; fill-opacity: unset; fill-rule: unset; fill: unset; filter: unset; flex-flow: unset; flex: unset; float: unset; flood-color: unset; flood-opacity: unset; font-synthesis: unset; font: unset; grid-area: unset; grid-gap: unset; grid: unset; height: unset; hyphens: unset; image-orientation: unset; image-rendering: unset; ime-mode: unset; inline-size: unset; isolation: unset; left: unset; letter-spacing: unset; lighting-color: unset; list-style: unset; margin-block-end: unset; margin-block-start: unset; margin-inline-end: unset; margin-inline-start: unset; margin: unset; marker: unset; mask-type: unset; mask: unset; max-block-size: unset; max-height: unset; max-inline-size: unset; max-width: unset; min-block-size: unset; min-height: unset; min-inline-size: unset; min-width: unset; mix-blend-mode: unset; object-fit: unset; object-position: unset; offset-block-end: unset; offset-block-start: unset; offset-inline-end: unset; offset-inline-start: unset; opacity: unset; order: unset; outline-offset: unset; outline: unset; overflow-wrap: unset; overflow: unset; overscroll-behavior: unset; padding-block-end: unset; padding-block-start: unset; padding-inline-end: unset; padding-inline-start: unset; padding: unset; page-break-after: unset; page-break-before: unset; page-break-inside: unset; paint-order: unset; perspective-origin: unset; perspective: unset; place-content: unset; place-items: unset; place-self: unset; pointer-events: unset; position: fixed; quotes: unset; resize: unset; right: unset; ruby-align: unset; ruby-position: unset; scroll-behavior: unset; scroll-snap-coordinate: unset; scroll-snap-destination: unset; scroll-snap-points-x: unset; scroll-snap-points-y: unset; scroll-snap-type: unset; shape-rendering: unset; stop-color: unset; stop-opacity: unset; stroke-dasharray: unset; stroke-dashoffset: unset; stroke-linecap: unset; stroke-linejoin: unset; stroke-miterlimit: unset; stroke-opacity: unset; stroke-width: unset; stroke: unset; table-layout: unset; text-align-last: unset; text-align: unset; text-anchor: unset; text-combine-upright: unset; text-decoration: unset; text-emphasis-position: unset; text-emphasis: unset; text-indent: unset; text-justify: unset; text-orientation: unset; text-overflow: unset; text-rendering: unset; text-shadow: unset; text-transform: unset; top: 0px; touch-action: unset; transform-box: unset; transform-origin: unset; transform-style: unset; transform: unset; transition: unset; vector-effect: unset; vertical-align: unset; visibility: unset; white-space: pre; width: unset; will-change: unset; word-break: unset; word-spacing: unset; writing-mode: unset; z-index: unset;">http://imojo.in/5y8g8c</span></h2>
<h2 style="text-align: left;">
<span style="font-size: x-large;"> </span><span style="-moz-appearance: unset; -moz-box-align: unset; -moz-box-direction: unset; -moz-box-flex: unset; -moz-box-ordinal-group: unset; -moz-box-orient: unset; -moz-box-pack: unset; -moz-context-properties: unset; -moz-control-character-visibility: unset; -moz-float-edge: unset; -moz-force-broken-image-icon: unset; -moz-image-region: unset; -moz-orient: unset; -moz-outline-radius: unset; -moz-stack-sizing: unset; -moz-tab-size: unset; -moz-text-size-adjust: unset; -moz-user-focus: unset; -moz-user-input: unset; -moz-user-modify: unset; -moz-user-select: text; -moz-window-dragging: unset; -webkit-text-fill-color: unset; -webkit-text-stroke: unset; animation: unset; backface-visibility: unset; background-blend-mode: unset; background: unset; block-size: unset; border-block-end: unset; border-block-start: unset; border-collapse: unset; border-inline-end: unset; border-inline-start: unset; border-radius: unset; border-spacing: unset; border: unset; bottom: unset; box-decoration-break: unset; box-shadow: unset; box-sizing: unset; caption-side: unset; caret-color: unset; clear: unset; clip-path: unset; clip-rule: unset; clip: rect(0px, 0px, 0px, 0px); color-adjust: unset; color-interpolation-filters: unset; color-interpolation: unset; color: unset; column-fill: unset; column-gap: unset; column-rule: unset; columns: unset; content: unset; counter-increment: unset; counter-reset: unset; cursor: unset; display: unset; dominant-baseline: unset; empty-cells: unset; fill-opacity: unset; fill-rule: unset; fill: unset; filter: unset; flex-flow: unset; flex: unset; float: unset; flood-color: unset; flood-opacity: unset; font-synthesis: unset; font: unset; grid-area: unset; grid-gap: unset; grid: unset; height: unset; hyphens: unset; image-orientation: unset; image-rendering: unset; ime-mode: unset; inline-size: unset; isolation: unset; left: unset; letter-spacing: unset; lighting-color: unset; list-style: unset; margin-block-end: unset; margin-block-start: unset; margin-inline-end: unset; margin-inline-start: unset; margin: unset; marker: unset; mask-type: unset; mask: unset; max-block-size: unset; max-height: unset; max-inline-size: unset; max-width: unset; min-block-size: unset; min-height: unset; min-inline-size: unset; min-width: unset; mix-blend-mode: unset; object-fit: unset; object-position: unset; offset-block-end: unset; offset-block-start: unset; offset-inline-end: unset; offset-inline-start: unset; opacity: unset; order: unset; outline-offset: unset; outline: unset; overflow-wrap: unset; overflow: unset; overscroll-behavior: unset; padding-block-end: unset; padding-block-start: unset; padding-inline-end: unset; padding-inline-start: unset; padding: unset; page-break-after: unset; page-break-before: unset; page-break-inside: unset; paint-order: unset; perspective-origin: unset; perspective: unset; place-content: unset; place-items: unset; place-self: unset; pointer-events: unset; position: fixed; quotes: unset; resize: unset; right: unset; ruby-align: unset; ruby-position: unset; scroll-behavior: unset; scroll-snap-coordinate: unset; scroll-snap-destination: unset; scroll-snap-points-x: unset; scroll-snap-points-y: unset; scroll-snap-type: unset; shape-rendering: unset; stop-color: unset; stop-opacity: unset; stroke-dasharray: unset; stroke-dashoffset: unset; stroke-linecap: unset; stroke-linejoin: unset; stroke-miterlimit: unset; stroke-opacity: unset; stroke-width: unset; stroke: unset; table-layout: unset; text-align-last: unset; text-align: unset; text-anchor: unset; text-combine-upright: unset; text-decoration: unset; text-emphasis-position: unset; text-emphasis: unset; text-indent: unset; text-justify: unset; text-orientation: unset; text-overflow: unset; text-rendering: unset; text-shadow: unset; text-transform: unset; top: 0px; touch-action: unset; transform-box: unset; transform-origin: unset; transform-style: unset; transform: unset; transition: unset; vector-effect: unset; vertical-align: unset; visibility: unset; white-space: pre; width: unset; will-change: unset; word-break: unset; word-spacing: unset; writing-mode: unset; z-index: unset;">http://imojo.in/5y8g8c</span></h2>
<h2 style="text-align: left;">
<a href="http://imojo.in/5y8g8c" target="_blank"><span style="font-size: x-large;">c programming basics PDF click here To Download</span></a></h2>
<center>
<script async="" src="//pagead2.googlesyndication.com/pagead/js/adsbygoogle.js"></script>
<!-- Find Job Ahmednagar -->
<br />
<ins class="adsbygoogle" data-ad-client="ca-pub-8696864193076876" data-ad-slot="2194703617" style="background: #12213a; display: inline-block; height: 280px; width: 336px;"><div style="text-align: center;">
</div>
</ins><script>
(adsbygoogle = window.adsbygoogle || []).push({});
</script>
</center>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
</h2>
<br />
<br />
<h2 style="text-align: left;">
<a href="http://imojo.in/5y8g8c" target="_blank"><span style="font-size: x-large;">c programming basics PDF click here To Download</span></a></h2>
<span style="-moz-appearance: unset; -moz-box-align: unset; -moz-box-direction: unset; -moz-box-flex: unset; -moz-box-ordinal-group: unset; -moz-box-orient: unset; -moz-box-pack: unset; -moz-context-properties: unset; -moz-control-character-visibility: unset; -moz-float-edge: unset; -moz-force-broken-image-icon: unset; -moz-image-region: unset; -moz-orient: unset; -moz-outline-radius: unset; -moz-stack-sizing: unset; -moz-tab-size: unset; -moz-text-size-adjust: unset; -moz-user-focus: unset; -moz-user-input: unset; -moz-user-modify: unset; -moz-user-select: text; -moz-window-dragging: unset; -webkit-text-fill-color: unset; -webkit-text-stroke: unset; animation: unset; backface-visibility: unset; background-blend-mode: unset; background: unset; block-size: unset; border-block-end: unset; border-block-start: unset; border-collapse: unset; border-inline-end: unset; border-inline-start: unset; border-radius: unset; border-spacing: unset; border: unset; bottom: unset; box-decoration-break: unset; box-shadow: unset; box-sizing: unset; caption-side: unset; caret-color: unset; clear: unset; clip-path: unset; clip-rule: unset; clip: rect(0px, 0px, 0px, 0px); color-adjust: unset; color-interpolation-filters: unset; color-interpolation: unset; color: unset; column-fill: unset; column-gap: unset; column-rule: unset; columns: unset; content: unset; counter-increment: unset; counter-reset: unset; cursor: unset; display: unset; dominant-baseline: unset; empty-cells: unset; fill-opacity: unset; fill-rule: unset; fill: unset; filter: unset; flex-flow: unset; flex: unset; float: unset; flood-color: unset; flood-opacity: unset; font-synthesis: unset; font: unset; grid-area: unset; grid-gap: unset; grid: unset; height: unset; hyphens: unset; image-orientation: unset; image-rendering: unset; ime-mode: unset; inline-size: unset; isolation: unset; left: unset; letter-spacing: unset; lighting-color: unset; list-style: unset; margin-block-end: unset; margin-block-start: unset; margin-inline-end: unset; margin-inline-start: unset; margin: unset; marker: unset; mask-type: unset; mask: unset; max-block-size: unset; max-height: unset; max-inline-size: unset; max-width: unset; min-block-size: unset; min-height: unset; min-inline-size: unset; min-width: unset; mix-blend-mode: unset; object-fit: unset; object-position: unset; offset-block-end: unset; offset-block-start: unset; offset-inline-end: unset; offset-inline-start: unset; opacity: unset; order: unset; outline-offset: unset; outline: unset; overflow-wrap: unset; overflow: unset; overscroll-behavior: unset; padding-block-end: unset; padding-block-start: unset; padding-inline-end: unset; padding-inline-start: unset; padding: unset; page-break-after: unset; page-break-before: unset; page-break-inside: unset; paint-order: unset; perspective-origin: unset; perspective: unset; place-content: unset; place-items: unset; place-self: unset; pointer-events: unset; position: fixed; quotes: unset; resize: unset; right: unset; ruby-align: unset; ruby-position: unset; scroll-behavior: unset; scroll-snap-coordinate: unset; scroll-snap-destination: unset; scroll-snap-points-x: unset; scroll-snap-points-y: unset; scroll-snap-type: unset; shape-rendering: unset; stop-color: unset; stop-opacity: unset; stroke-dasharray: unset; stroke-dashoffset: unset; stroke-linecap: unset; stroke-linejoin: unset; stroke-miterlimit: unset; stroke-opacity: unset; stroke-width: unset; stroke: unset; table-layout: unset; text-align-last: unset; text-align: unset; text-anchor: unset; text-combine-upright: unset; text-decoration: unset; text-emphasis-position: unset; text-emphasis: unset; text-indent: unset; text-justify: unset; text-orientation: unset; text-overflow: unset; text-rendering: unset; text-shadow: unset; text-transform: unset; top: 0px; touch-action: unset; transform-box: unset; transform-origin: unset; transform-style: unset; transform: unset; transition: unset; vector-effect: unset; vertical-align: unset; visibility: unset; white-space: pre; width: unset; will-change: unset; word-break: unset; word-spacing: unset; writing-mode: unset; z-index: unset;">http://imojo.in/5y8g8c</span><div>
<br /></div>
<div>
<br /></div>
<div>
<br /></div>
<div>
<div>
people search by using :</div>
<div>
<br /></div>
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>Free C-Programming ebooks Download</li>
<li>c programming book by dennis ritchie pdf free download</li>
<li>c language books by balaguruswamy free download</li>
<li>c programs pdf with output free download</li>
<li>c programming book by balaguruswamy free pdf</li>
<li>c programming language pdf for beginners</li>
<li>c language yashwant kanetkar pdf</li>
<li>learn c programming step by step pdf</li>
<li>notes of c language pdf</li>
</ul>
</h2>
</div>
</div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-81637321262681494482017-02-18T04:17:00.001-08:002017-03-18T00:22:48.499-07:00multiply two matrix by recursion:<div dir="ltr" style="text-align: left;" trbidi="on">
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-weight: bold;">matrix multiplication recursive algorithm</span></div>
<span style="background-color: #fff2cc; font-weight: bold;"><div style="text-align: center;">
multiplication using recursion in c</div>
</span><span style="background-color: #fff2cc; font-weight: bold;"><div style="text-align: center;">
recursive matrix multiplication java same logic</div>
</span><span style="background-color: #fff2cc; font-weight: bold;"><div style="text-align: center;">
matrix multiplication using divide and conquer in c</div>
</span><span style="background-color: #fff2cc; font-weight: bold;"><div style="text-align: center;">
using recursion in c find the largest element in an array</div>
</span><span style="background-color: #fff2cc; font-weight: bold;"><div style="text-align: center;">
strassen's matrix multiplication program in c using divide and conquer</div>
</span><span style="background-color: #fff2cc; font-weight: bold;"><div style="text-align: center;">
matrix addition using recursion</div>
</span><span style="background-color: #fff2cc; font-weight: bold;"><div style="text-align: center;">
strassen matrix multiplication code in c</div>
<div style="text-align: center;">
<br /></div>
<div style="text-align: center;">
<br /></div>
</span><br />
#include<stdio.h><br />
#define MAX 10<br />
<br />
void multiplyMatrix(int [MAX][MAX],int [MAX][MAX]);<br />
int m,n,o,p;<br />
int c[MAX][MAX];<br />
<br />
void main(){<br />
<br />
int a[MAX][MAX],b[MAX][MAX],i,j,k;<br />
<br />
printf("Enter the row and column of first matrix: ");<br />
scanf("%d %d",&m,&n);<br />
printf("Enter the row and column of second matrix: ");<br />
scanf("%d %d",&o,&p);<br />
<br />
if(n!=o){<br />
<br />
printf("Matrix multiplication is not possible");<br />
printf("\nColumn of first matrix must be same as row of second matrix");<br />
}<br />
else{<br />
<br />
printf("Enter the First matrix: ");<br />
for(i=0;i<m;i++)<br />
for(j=0;j<n;j++)<br />
scanf("%d",&a[i][j]);<br />
<br />
printf("Enter the Second matrix: ");<br />
for(i=0;i<o;i++)<br />
for(j=0;j<p;j++)<br />
scanf("%d",&b[i][j]);<br />
<br />
printf("\nyour First matrix is: \n");<br />
for(i=0;i<m;i++){<br />
printf("\n");<br />
for(j=0;j<n;j++){<br />
printf("%d\t",a[i][j]);<br />
}<br />
}<br />
<br />
printf("\nyour Second matrix is: \n");<br />
for(i=0;i<o;i++){<br />
printf("\n");<br />
for(j=0;j<p;j++){<br />
printf("%d\t",b[i][j]);<br />
}<br />
}<br />
<br />
multiplyMatrix(a,b);<br />
<br />
}<br />
<br />
printf("\n multiplication of two matrix is: \n");<br />
for(i=0;i<m;i++){<br />
printf("\n");<br />
for(j=0;j<p;j++){<br />
printf("%d\t",c[i][j]);<br />
}<br />
}<br />
<br />
}<br />
<br />
void multiplyMatrix(int a[MAX][MAX],int b[MAX][MAX]){<br />
<br />
static int sum,i=0,j=0,k=0;<br />
<br />
if(i<m){ //row of first matrix<br />
if(j<p){ //column of second matrix<br />
if(k<n){<br />
sum=sum+a[i][k]*b[k][j];<br />
k++;<br />
multiplyMatrix(a,b);<br />
}<br />
c[i][j]=sum;<br />
sum=0;<br />
k=0;<br />
j++;<br />
multiplyMatrix(a,b);<br />
}<br />
j=0;<br />
i++;<br />
multiplyMatrix(a,b);<br />
}<br />
}<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li><span style="background-color: #fff2cc;">matrix multiplication recursive algorithm</span></li>
<li><span style="background-color: #fff2cc;">multiplication using recursion in c</span></li>
<li><span style="background-color: #fff2cc;">recursive matrix multiplication java same logic</span></li>
<li><span style="background-color: #fff2cc;">matrix multiplication using divide and conquer in c</span></li>
<li><span style="background-color: #fff2cc;">using recursion in c find the largest element in an array</span></li>
<li><span style="background-color: #fff2cc;">strassen's matrix multiplication program in c using divide and conquer</span></li>
<li><span style="background-color: #fff2cc;">matrix addition using recursion</span></li>
<li><span style="background-color: #fff2cc;">strassen matrix multiplication code in c</span></li>
</ul>
</h2>
</div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-37368472241948306532017-02-14T21:30:00.000-08:002017-03-18T01:04:54.919-07:00count no of occurrences in linked list using recursion <div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">write a program to count the number of times an item is present in a linked list.</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">count nodes in linked list c++</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">algorithm to count the number of nodes in linked list</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">how to count the number of nodes in a linked list java</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">linked list count java</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">count the number of nodes in a circular linked list</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">c program to find the occurrence of a digit in a number</span></div>
<div style="text-align: center;">
<span style="font-size: small;"><span style="background-color: #fff2cc;">wap to reverse the elements in a single linked list</span>.</span></div>
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
Program to count no of occurrences in linked list using recursion</h2>
#include <stdio.h><br />
void occur(int [], int, int, int, int *);<br />
int main()<br />
{ int size, key, count = 0;<br />
int list[20]; int i;<br />
printf("Enter the size of the list: ");<br />
scanf("%d", &size);111<br />
printf("Printing the list:\n");<br />
for (i = 0; i < size; i++)<br />
{ printf("\nenter the %d element\n",i+1);<br />
scanf("%d",&list[i]); <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
}<br />
for (i = 0; i < size; i++)<br />
{<br />
printf("%d ", list[i]);<br />
}<br />
printf("\nEnter the key to find it's occurence: ");<br />
<br />
scanf("%d", &key);<br />
occur(list, size, 0, key, &count);<br />
printf("%d occurs for %d times.\n", key, count);<br />
return 0;<br />
}<br />
<br />
void occur(int list[], int size, int index, int key, int *count)<br />
{<br />
if (size == index)<br />
{<br />
return;<br />
}<br />
if (list[index] == key) { *count += 1;<br />
}<br />
occur(list, size, index + 1, key, count);<br />
}<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>write a program to count the number of times an item is present in a linked list.</li>
<li>count nodes in linked list c++</li>
<li>algorithm to count the number of nodes in linked list</li>
<li>how to count the number of nodes in a linked list java</li>
<li>linked list count java</li>
<li>count the number of nodes in a circular linked list</li>
<li>c program to find the occurrence of a digit in a number</li>
<li>wap to reverse the elements in a single linked list.</li>
</ul>
</h2>
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-80962389471506954202017-02-14T21:11:00.003-08:002017-03-18T01:05:47.366-07:00C Program to Demonstrate Circular Single Linked List<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">circular linked list in c source code</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">circular linked list in c algorithm</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">circular linked list insertion and deletion</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">circular linked list in c++</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">circular linked list in c geeksforgeeks</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">c program for doubly linked list</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">circular linked list in c pdf</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">circular linked list code java</span></div>
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
C Program to Demonstrate Circular Single Linked List</h2>
<div>
<br /></div>
<div>
<br /></div>
<br />
#include <stdio.h><br />
#include <stdlib.h><br />
struct node { int data; struct node *link; };<br />
struct node *head = NULL, *x, *y, *z;<br />
<br />
void create();<br />
void ins_at_beg();<br />
void ins_at_pos();<br />
void del_at_beg();<br />
void del_at_pos();<br />
void traverse();<br />
void search();<br />
void sort();<br />
void update();<br />
void rev_traverse(struct node *p);<br />
<br />
int main() {<br />
int ch;<br />
printf("\n 1.Creation \n 2.Insertion at beginning \n 3.Insertion at remaining");<br />
printf("\n4.Deletion at beginning \n5.Deletion at remaining \n6.traverse"); printf("\n7.Search\n8.sort\n9.update\n10.Exit\n");<br />
<br />
while (1) { printf("\n Enter your choice:");<br />
scanf("%d", &ch);<br />
switch(ch)<br />
{ case 1: create(); break; case 2: ins_at_beg(); break; case 3: ins_at_pos(); break; case 4: del_at_beg(); break; case 5: del_at_pos(); break; case 6: traverse(); break; case 7: search(); break; case 8: sort(); break; case 9: update(); break; case 10: rev_traverse(head); break; default: exit(0); } } return 0; }<br />
<br />
/*Function to create a new circular linked list*/<br />
<br />
void create() { int c; x = (struct node*)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d", &x->data); x->link = x; head = x; printf("\n If you wish to continue press 1 otherwise 0:"); scanf("%d", &c); while (c != 0) { y = (struct node*)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d", &y->data); x->link = y; y->link = head; x = y; printf("\n If you wish to continue press 1 otherwise 0:"); scanf("%d", &c); } }<br />
<br />
<br />
<br />
/*Function to insert an element at the begining of the list*/<br />
<br />
void ins_at_beg() { x = head; y = (struct node*)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d", &y->data); while (x->link != head) { x = x->link; } x->link = y; y->link = head; head = y; }<br />
<br />
/*Function to insert an element at any position the list*/<br />
<br />
<br />
void ins_at_pos() { struct node *ptr; int c = 1, pos, count = 1; y = (struct node*)malloc(sizeof(struct node)); if (head == NULL) { printf("cannot enter an element at this place"); } printf("\n Enter the data:"); scanf("%d", &y->data); printf("\n Enter the position to be inserted:"); scanf("%d", &pos); x = head; ptr = head; while (ptr->link != head) { count++; ptr = ptr->link; } count++; if (pos > count) { printf("OUT OF BOUND"); return; } while (c < pos) { z = x; x = x->link; c++; } y->link = x; z->link = y; }<br />
<br />
/*Function to delete an element at any begining of the list*/<br />
<br />
void del_at_beg() { if (head == NULL) printf("\n List is empty"); else { x = head; y = head; while (x->link != head) { x = x->link; } head = y->link; x->link = head; free(y); } }<br />
<br />
/*Function to delete an element at any position the list*/<br />
<br />
void del_at_pos() { if (head == NULL) printf("\n List is empty"); else { int c = 1, pos; printf("\n Enter the position to be deleted:"); scanf("%d", &pos); x = head; while (c < pos) { y = x; x = x->link; c++; } y->link = x->link; free(x); } }<br />
<br />
/*Function to display the elements in the list*/<br />
void traverse() { if (head == NULL) printf("\n List is empty"); else { x = head; while (x->link != head) { printf("%d->", x->data); x = x->link; } printf("%d", x->data); } }<br />
<br />
/*Function to search an element in the list*/<br />
<br />
void search() { int search_val, count = 0, flag = 0; printf("\nenter the element to search\n"); scanf("%d", &search_val); if (head == NULL) printf("\nList is empty nothing to search"); else { x = head; while (x->link != head) { if (x->data == search_val) { printf("\nthe element is found at %d", count); flag = 1; break; } count++; x = x->link; } if (x->data == search_val) { printf("element found at postion %d", count); } if (flag == 0) { printf("\nelement not found"); } } }<br />
<br />
/*Function to sort the list in ascending order*/<br />
<br />
void sort() { struct node *ptr, *nxt; int temp; if (head == NULL) { printf("empty linkedlist"); } else { ptr = head; while (ptr->link != head) { nxt = ptr->link; while (nxt != head) { if (nxt != head) { if (ptr->data > nxt->data) { temp = ptr->data; ptr->data = nxt->data; nxt->data = temp; } } else { break; } nxt = nxt->link; } ptr = ptr->link; } } }<br />
<br />
/*Function to update an element at any position the list*/<br />
void update() { struct node *ptr; int search_val; int replace_val; int flag = 0; if (head == NULL) { printf("\n empty list"); } else { printf("enter the value to be edited\n"); scanf("%d", &search_val); fflush(stdin); printf("enter the value to be replace\n"); scanf("%d", &replace_val); ptr = head; while (ptr->link != head) { if (ptr->data == search_val) { ptr->data = replace_val; flag = 1; break; } ptr = ptr->link; } if (ptr->data == search_val) { ptr->data = replace_val; flag = 1; } if (flag == 1) { printf("\nUPdate sucessful"); } else { printf("\n update not successful"); } } }<br />
<br />
/*Function to display the elements of the list in reverse order*/<br />
void rev_traverse(struct node *p) { int i = 0; if (head == NULL) { printf("empty linked list"); } else { if (p->link != head) { i = p->data; rev_traverse(p->link); printf(" %d", i); } if (p->link == head) { printf(" %d", p->data); } } }<br />
<br />
<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>circular linked list in c source code</li>
<li>circular linked list in c algorithm</li>
<li>circular linked list insertion and deletion</li>
<li>circular linked list in c++</li>
<li>circular linked list in c geeksforgeeks</li>
<li>c program for doubly linked list</li>
<li>circular linked list in c pdf</li>
<li>circular linked list code java</li>
</ul>
</h2>
<br />
<br />
<br />
<br />
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-88882150593995629602017-02-14T21:05:00.001-08:002017-03-18T01:04:30.235-07:00 Create a linked list and display the elements in the list<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">simple linked list program in c</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">linked list program in c with explanation</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">linked list program in c++</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">linked list program in c for insertion and deletion</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">singly linked list program in data structure using c</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">linked list program in c pdf</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">how to create a linked list in c++</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">how to create a linked list java</span></div>
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
Create a linked list and display the elements in the list</h2>
#include <stdio.h><br />
#include <malloc.h><br />
#include <stdlib.h><br />
void main() {<br />
struct node { int num; struct node *ptr;<br />
};<br />
typedef struct node NODE; NODE *head, *first, *temp = 0; int count = 0; int choice = 1; first = 0; while (choice)<br />
{ head = (NODE *)malloc(sizeof(NODE));<br />
printf("Enter the data item\n"); scanf("%d", &head-> num);<br />
if (first != 0) { temp->ptr = head; temp = head; }<br />
else { first = temp = head; } fflush(stdin);<br />
printf("Do you want to continue(Type 0 or 1)?\n");<br />
scanf("%d", &choice); } temp->ptr = 0;<br />
/* reset temp to the beginning */<br />
temp = first; printf("\n status of the linked list is\n");<br />
while (temp != 0)<br />
{ printf("%d=>", temp->num); count++; temp = temp -> ptr; }<br />
printf("NULL\n"); printf("No. of nodes in the list = %d\n", count);<br />
<br />
}<br />
<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>simple linked list program in c</li>
<li>linked list program in c with explanation</li>
<li>linked list program in c++</li>
<li>linked list program in c for insertion and deletion</li>
<li>singly linked list program in data structure using c</li>
<li>linked list program in c pdf</li>
<li>how to create a linked list in c++</li>
<li>how to create a linked list java</li>
</ul>
</h2>
<br />
<br />
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-52048753057309379702017-02-14T20:59:00.000-08:002017-03-18T01:06:22.186-07:00Convert a given Singly Linked List to a Circular List<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">Sorted insert for circular linked list </span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">C Program to Convert a given Singly Linked List to a Circular List</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">C program to convert a singly linked list to circular </span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">c++ - How to convert singly linked list to circular list</span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">c - Conversion from single to circular linked list </span></div>
<div style="text-align: center;">
<span style="background-color: #fff2cc; font-size: small;">Sorted insert for circular linked list</span> </div>
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
C Program to Convert a given Singly Linked List to a Circular List </h2>
#include <stdio.h><br />
#include <stdlib.h><br />
struct node { int num; struct node *next; };<br />
void create(struct node **);<br />
void tocircular(struct node **);<br />
void release(struct node **);<br />
void display(struct node *);<br />
<br />
int main() {<br />
struct node *p = NULL;<br />
int result, count;<br />
printf("Enter data into the list\n");<br />
create(&p);<br />
tocircular(&p);<br />
printf("Circular list generated\n");<br />
<br />
display(p); release (&p); return 0; }<br />
void tocircular(struct node **p)<br />
{ struct node *rear; rear = *p; while (rear->next != NULL)<br />
{ rear = rear->next; } rear->next = *p; /*After this the singly linked list is now circular*/ }<br />
<br />
void create(struct node **head)<br />
{ int c, ch; struct node *temp; do<br />
{ printf("Enter number: ");<br />
scanf("%d", &c); temp = (struct node *)malloc(sizeof(struct node));<br />
temp->num = c; temp->next = *head; *head = temp;<br />
printf("Do you wish to continue [1/0]: ");<br />
scanf("%d", &ch); } <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<br />
while (ch != 0); printf("\n");<br />
}<br />
void display(struct node *head)<br />
{ struct node *temp = head;<br />
printf("Displaying the list elements\n");<br />
printf("%d\t", temp->num);<br />
temp = temp->next;<br />
<br />
while (head != temp)<br />
{ printf("%d\t", temp->num);<br />
temp = temp->next; }<br />
printf("and back to %d\t%d ..\n", temp->num, temp->next->num); }<br />
<br />
void release(struct node **head)<br />
{ struct node *temp = *head; temp = temp->next;<br />
(*head)->next = NULL;<br />
(*head) = temp->next;<br />
while ((*head) != NULL) {<br />
free(temp); temp = *head;<br />
(*head) = (*head)->next; }<br />
}<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>Sorted insert for circular linked list </li>
<li>C Program to Convert a given Singly Linked List to a Circular List</li>
<li>C program to convert a singly linked list to circular </li>
<li>c++ - How to convert singly linked list to circular list</li>
<li>c - Conversion from single to circular linked list </li>
<li>Sorted insert for circular linked list </li>
</ul>
</h2>
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-31615949796464982742017-02-14T20:56:00.000-08:002017-03-18T01:08:16.636-07:00Construct a Balanced Binary Search Tree<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
C Program to Construct a Balanced Binary Search Tree which has same data members as the given Doubly Linked List </h2>
<br />
#include <stdio.h><br />
#include <stdlib.h><br />
struct node { int num; struct node *left; struct node *right; };<br />
void create(struct node **);<br />
void treemaker(struct node **, int);<br />
void display(struct node *);<br />
void displayTree(struct node *);<br />
void ddelete(struct node **);<br />
<br />
int main()<br />
{ struct node *headList = NULL, *rootTree,<br />
*p;<br />
int count = 1, flag = 0;<br />
create(&headList);<br />
printf("Displaying the doubly linked list:\n");<br />
display(headList);<br />
rootTree = p = headList;<br />
while (p->right != NULL)<br />
{ p = p->right; count = count + 1;<br />
if (flag) { rootTree = rootTree->right; }<br />
flag = !flag; } treemaker(&rootTree, count / 2);<br />
printf("Displaying the tree: (Inorder)\n"); displayTree(rootTree);<br />
printf("\n"); return 0; } void create(struct node **head)<br />
{ struct node *rear, *temp; int a, ch; do { printf("Enter a number: ");<br />
scanf("%d", &a); temp = (struct node *)malloc(sizeof(struct node));<br />
temp->num = a; temp->right = NULL;<br />
temp->left = NULL;<br />
if (*head == NULL)<br />
{ *head = temp; }<br />
else { rear->right = temp; temp->left = rear; }<br />
rear = temp; printf("Do you wish to continue [1/0] ?: "); scanf("%d", &ch); } <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
while (ch != 0); } void treemaker(struct node **root, int count)<br />
{ struct node *quarter, *thirdquarter;<br />
int n = count, i = 0;<br />
if ((*root)->left != NULL)<br />
{ quarter = (*root)->left; for (i = 1; (i < count / 2) && (quarter->left != NULL); i++)<br />
{ quarter = quarter->left; }<br />
(*root)->left->right = NULL; (*root)->left = quarter;<br />
<br />
/* * Uncomment the following line to see when the pointer changes */ //<br />
<br />
printf("%d's left child is now %d\n", (*root)->num, quarter->num);<br />
if (quarter != NULL)<br />
{ treemaker(&quarter, count / 2); } }<br />
if ((*root)->right != NULL)<br />
{ thirdquarter = (*root)->right;<br />
for (i = 1; (i < count / 2) && (thirdquarter->right != NULL); i++)<br />
{ thirdquarter = thirdquarter->right; } (*root)->right->left = NULL; (*root)->right = thirdquarter;<br />
<br />
/* * Uncomment the following line to see when the pointer changes */ /<br />
/printf("%d's right child is now %d\n", (*root)->num, thirdquarter->num);<br />
if (thirdquarter != NULL)<br />
{ treemaker(&thirdquarter, count / 2); } } }<br />
void display(struct node *head)<br />
{ while (head != NULL)<br />
{ printf("%d ", head->num);<br />
head = head->right; }<br />
printf("\n");<br />
}<br />
/*DisplayTree performs inorder traversal*/<br />
<br />
void displayTree(struct node *root)<br />
{ if (root != NULL) { displayTree(root->left);<br />
printf("%d ", root->num); displayTree(root->right); } }<br />
<br />
void ddelete(struct node **root)<br />
{ if (*root != NULL) { displayTree((*root)->left);<br />
displayTree((*root)->right);<br />
free(*root); }<br />
<br />
}<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>convert sorted list to binary search tree</li>
<li>sorted array to balanced bst</li>
<li>convert sorted array to binary search tree leetcode</li>
<li>binary tree using array in c program</li>
<li>what is balanced binary search tree</li>
<li>create bst from unsorted array</li>
<li>create binary tree from array java</li>
<li>binary tree array implementation c++</li>
</ul>
</h2>
<br />
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-63179463589273335602017-02-14T20:51:00.001-08:002017-03-18T01:09:41.031-07:00Check whether 2 linked Lists are Same<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<div style="text-align: center;">
<span style="font-size: small;">compare two linked lists java</span></div>
<div style="text-align: center;">
<span style="font-size: small;">compare two linked lists c++</span></div>
<div style="text-align: center;">
<span style="font-size: small;">compare two linked lists hackerrank solution</span></div>
<div style="text-align: center;">
<span style="font-size: small;">check if two linked lists are equal java</span></div>
<div style="text-align: center;">
<span style="font-size: small;">how to compare two nodes in linked list java</span></div>
<div style="text-align: center;">
<span style="font-size: small;">how would you detect a loop in a linked list?</span></div>
<div style="text-align: center;">
<span style="font-size: small;">how will you implement three stacks with one array?</span></div>
<div style="text-align: center;">
<span style="font-size: small;">merge two sorted linked lists</span></div>
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
C Program to Check whether 2 Lists are Same </h2>
<br />
#include <stdio.h><br />
#include <stdlib.h><br />
struct node { int num; struct node *next; };<br />
void feedmember(struct node **);<br />
int compare (struct node *, struct node *);<br />
void release(struct node **);<br />
int main()<br />
{ struct node *p = NULL;<br />
struct node *q = NULL;<br />
int result; printf("Enter data into first list\n");<br />
feedmember(&p);<br />
printf("Enter data into second list\n");<br />
feedmember(&q); result = compare(p, q);<br />
if (result == 1)<br />
{ printf("The 2 list are equal.\n"); }<br />
else { printf("The 2 lists are unequal.\n"); }<br />
<br />
release (&p); release (&q); return 0; }<br />
int compare (struct node *p, struct node *q)<br />
{ while (p != NULL && q != NULL)<br />
{ if (p->num != q-> num) { return 0; }<br />
else { p = p->next; q = q->next; } }<br />
if (p != NULL || q != NULL) { return 0; }<br />
else { return 1; }<br />
}<br />
void feedmember (struct node **head)<br />
{ int c, ch; struct node *temp;<br />
do { printf("Enter number: "); scanf("%d", &c); temp = (struct node *)malloc(sizeof(struct node));<br />
temp->num = c; temp->next = *head; *head = temp; printf("Do you wish to continue [1/0]: "); scanf("%d", &ch); } <span class="Apple-tab-span" style="white-space: pre;"> </span>while (ch != 0); printf("\n"); } void release (struct node **head) { struct node *temp = *head; while ((*head) != NULL) { (*head) = (*head)->next; free(temp); temp = *head; } }<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>compare two linked lists java</li>
<li>compare two linked lists c++</li>
<li>compare two linked lists hackerrank solution</li>
<li>check if two linked lists are equal java</li>
<li>how to compare two nodes in linked list java</li>
<li>how would you detect a loop in a linked list?</li>
<li>how will you implement three stacks with one array?</li>
<li>merge two sorted linked lists</li>
</ul>
</h2>
<div>
<br /></div>
<br />
<br />
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-67859424586806246272017-02-14T11:47:00.000-08:002017-03-18T01:11:17.665-07:00 Check whether a Singly Linked List is a Palindrome <div dir="ltr" style="text-align: left;" trbidi="on">
<div style="text-align: left;">
<div style="text-align: center;">
<span style="font-weight: bold;">palindrome checking using doubly linked list in c</span></div>
<span style="font-weight: bold;"></span><br />
<div style="text-align: center;">
<span style="font-weight: bold;">java program palindrome with linked lists</span></div>
<span style="font-weight: bold;">
</span><span style="font-weight: bold;"><div style="text-align: center;">
palindrome linked list python</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
a sorted array has been rotated r times to the left. find r in least possible time.</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
given a string, find the largest palindrome substring.</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
doubly linked list palindrome</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
palindrome list geeks</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
palindrome list interviewbit</div>
</span></div>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
C Program to Check whether a Singly Linked List is a Palindrome </h2>
<br />
<br />
#include <stdio.h> #include <stdlib.h><br />
struct node { int num; struct node *next; };<br />
int create(struct node **);<br />
int palin_check (struct node *, int);<br />
void release(struct node **);<br />
int main()<br />
{ <span class="Apple-tab-span" style="white-space: pre;"> </span> struct node *p = NULL;<br />
int result, count; printf("Enter data into the list\n");<br />
count = create(&p); result = palin_check(p, count);<br />
if (result == 1) { printf("The linked list is a palindrome.\n"); }<br />
else {<br />
printf("The linked list is not a palindrome.\n"); }<br />
release (&p); return 0; }<br />
int palin_check (struct node *p, int count) { int i = 0, j;<br />
struct node *front, *rear;<br />
while (i != count / 2) { front = rear = p; for (j = 0; j < i; j++<br />
) { front = front->next; }<br />
for (j = 0; j < count - (i + 1); j++) { rear = rear->next; } if (front->num != rear->num)<br />
{ return 0; }<br />
else { i++; } } return 1; } int create (struct node **head)<br />
{ int c, ch, count = 0; struct node *temp; do { printf("Enter number: ");<br />
scanf("%d", &c); count++;<br />
temp = (struct node *)<br />
malloc(sizeof(struct node)); temp->num = c; temp->next = *head; *head = temp; printf("Do you wish to continue [1/0]: ");<br />
scanf("%d", &ch); } <span class="Apple-tab-span" style="white-space: pre;"> </span>while (ch != 0); printf("\n"); return count; }<br />
<br />
void release (struct node **head) { struct node *temp = *head; while ((*head) != NULL)<br />
{ (*head) = (*head)->next; free(temp); temp = *head; }<br />
}<br />
<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>palindrome checking using doubly linked list in c</li>
<li>java program palindrome with linked lists</li>
<li>palindrome linked list python</li>
<li>a sorted array has been rotated r times to the left. find r in least possible time.</li>
<li>given a string, find the largest palindrome substring.</li>
<li>doubly linked list palindrome</li>
<li>palindrome list geeks</li>
<li>palindrome list interviewbit</li>
</ul>
</h2>
<br />
<div>
<br /></div>
<br />
<br />
<br />
<br />
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-32313311154044219262017-02-14T11:39:00.001-08:002017-03-18T00:49:32.916-07:00Add Corresponding Positioned Elements of 2 Linked Lists <div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<div style="text-align: center;">
<span style="font-size: small;">add two numbers represented by linked lists</span></div>
<div style="text-align: center;">
<span style="font-size: small;">add two linked lists c++</span></div>
<div style="text-align: center;">
<span style="font-size: small;">given a linked list of 0s, 1s and 2s, sort it.</span></div>
<div style="text-align: center;">
<span style="font-size: small;">linked list sum java</span></div>
<div style="text-align: center;">
<span style="font-size: small;">add two numbers represented by linked lists leetcode</span></div>
<div style="text-align: center;">
<span style="font-size: small;">sum of elements in linked list in c</span></div>
<div style="text-align: center;">
<span style="font-size: small;">subtract two numbers represented by linked list</span></div>
<div style="text-align: center;">
<span style="font-size: small;">add two numbers represented by linked lists c++</span></div>
</h2>
<h2 style="text-align: left;">
<br /></h2>
<h2 style="text-align: left;">
C Program to Add Corresponding Positioned Elements of 2 Linked Lists</h2>
<br />
<br />
#include <stdio.h><br />
#include <stdlib.h><br />
#include <ctype.h><br />
struct node { int num; struct node *next; };<br />
int feednumber(struct node **);<br />
struct node *addlist(struct node *, struct node *, int, int);<br />
void release(struct node **);<br />
void display(struct node *);<br />
<br />
int main() { struct node *p = NULL; struct node *q = NULL; struct node *res = NULL; int pcount = 0, qcount = 0; printf("Enter first number\n");<br />
pcount = feednumber(&p);<br />
printf("Enter second number\n");<br />
qcount = feednumber(&q);<br />
printf("Displaying list1: ");<br />
display(p); printf("Displaying list2: ");<br />
display(q); res = addlist(p, q, pcount, qcount);<br />
printf("Displaying the resulting list: ");<br />
display(res); release(&p); release(&q); release(&res); return 0; }<br />
<br />
/*Function to create nodes of numbers*/<br />
int feednumber(struct node **head)<br />
{ char ch, dig; int count = 0; struct node *temp, *rear = NULL;<br />
ch = getchar();<br />
while (ch != '\n') { dig = atoi(&ch);<br />
temp = (struct node *)malloc(sizeof(struct node));<br />
temp->num = dig; temp->next = NULL;<br />
count++;<br />
if ((*head) == NULL) { *head = temp; rear = temp; }<br />
else { rear->next = temp; rear = rear->next; }<br />
ch = getchar(); } return count; }<br />
<br />
/*Function to display the list of numbers*/<br />
void display (struct node *head)<br />
{ while (head != NULL) { printf("%d", head->num); head = head->next; }<br />
printf("\n"); } /*Function to free the allocated list of numbers*/<br />
void release (struct node **head)<br />
{ struct node *temp = *head; while ((*head) != NULL)<br />
{ (*head) = (*head)->next; free(temp); temp = *head; } }<br />
<br />
<br />
/*Function to add the list of numbers and store them in 3rd list*/<br />
<br />
struct node *addlist(struct node *p, struct node *q, int pcount, int qcount)<br />
{<br />
struct node *ptemp, *qtemp, *result = NULL, *temp; int i, carry = 0;<br />
while (pcount != 0 && qcount != 0)<br />
{ ptemp = p; qtemp = q; for (i = 0; i < pcount - 1; i++)<br />
{ ptemp = ptemp->next; } for (i = 0; i < qcount - 1; i++)<br />
{ qtemp = qtemp->next; } temp = (struct node *) malloc (sizeof(struct node));<br />
temp->num = ptemp->num + qtemp->num + carry;<br />
carry = temp->num / 10; temp->num = temp->num % 10; temp->next = result; result = temp; pcount--; qcount--; } /*both or one of the 2 lists have been read completely by now*/ while (pcount != 0) { ptemp = p; for (i = 0; i < pcount - 1; i++) { ptemp = ptemp->next; }<br />
temp = (struct node *) malloc (sizeof(struct node));<br />
temp->num = ptemp->num + carry; carry = temp->num / 10;<br />
temp->num = temp->num % 10; temp->next = result; result = temp; pcount--; }<br />
while (qcount != 0) { qtemp = q; for (i = 0; i < qcount - 1; i++)<br />
{ qtemp = qtemp->next; }<br />
temp = (struct node *) malloc (sizeof(struct node));<br />
temp->num = qtemp->num + carry; carry = temp->num / 10;<br />
temp->num = temp->num % 10;<br />
temp->next = result; result = temp; qcount--; }<br />
return result; }<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>add two numbers represented by linked lists</li>
<li>add two linked lists c++</li>
<li>given a linked list of 0s, 1s and 2s, sort it.</li>
<li>linked list sum java</li>
<li>add two numbers represented by linked lists leetcode</li>
<li>sum of elements in linked list in c</li>
<li>subtract two numbers represented by linked list</li>
<li>add two numbers represented by linked lists c++</li>
</ul>
</h2>
<br />
<br />
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-43246887542759978702017-02-07T21:49:00.003-08:002017-03-18T01:12:23.390-07:00Draw x And Y axis Center Of Screen Using C program<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<div style="text-align: center;">
<span style="font-size: small;">graphics program in c to draw a moving car</span></div>
<div style="text-align: center;">
<span style="font-size: small;">c graphics program for animation</span></div>
<div style="text-align: center;">
<span style="font-size: small;">graphics programming in c with output</span></div>
<div style="text-align: center;">
<span style="font-size: small;">graphics programming in c examples</span></div>
<div style="text-align: center;">
<span style="font-size: small;">simple graphics program in c to draw a line</span></div>
<div style="text-align: center;">
<span style="font-size: small;">c program to draw a square using graphics</span></div>
<div style="text-align: center;">
<span style="font-size: small;">graphics programming in c pdf</span></div>
<div style="text-align: center;">
<span style="font-size: small;">c program to draw a rectangle using graphics</span></div>
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
</h2>
<h2 style="text-align: left;">
Draw x And Y axis Center Of Screen Using C program</h2>
<br />
#include<conio.h><br />
#include<graphics.h><br />
#include<stdio.h><br />
void main()<br />
{<br />
int gd=DETECT,gm,maxx,maxy,midx,midy;<br />
//load driver<br />
initgraph(&gd,&gm,"c:\\tc\\bgi");<br />
cleardevice();<br />
maxx=getmaxx();<br />
maxy=getmaxy();<br />
midx=maxx/2;<br />
midy=maxy/2;<br />
line(0,midy,midx,maxy);<br />
line(midx,0,midx,maxy);<br />
getch();<br />
closegraph();<br />
}<br />
<div>
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>graphics program in c to draw a moving car</li>
<li>c graphics program for animation</li>
<li>graphics programming in c with output</li>
<li>graphics programming in c examples</li>
<li>simple graphics program in c to draw a line</li>
<li>c program to draw a square using graphics</li>
<li>graphics programming in c pdf</li>
<li>c program to draw a rectangle using graphics</li>
</ul>
</h2>
</div>
<div>
<br /></div>
</div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-17544544423995799942017-02-07T21:45:00.002-08:002017-03-18T01:15:14.495-07:00Strassen's Method For Matrix Multiplication c program<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<div style="text-align: center;">
<span style="font-size: small;">strassen matrix multiplication code in c</span></div>
<span style="font-size: small;"><div style="text-align: center;">
strassen matrix multiplication 4 4 example</div>
<div style="text-align: center;">
strassen matrix multiplication for 4x4</div>
<div style="text-align: center;">
strassen's matrix multiplication program in c using recursion</div>
<div style="text-align: center;">
strassen's matrix multiplication for nxn matrix in c</div>
<div style="text-align: center;">
strassen's matrix multiplication program in c using divide and conquer</div>
<div style="text-align: center;">
strassen's matrix multiplication algorithm implementation</div>
<div style="text-align: center;">
strassen's matrix multiplication for 4x4 matrix example in c</div>
</span></h2>
<h2>
<br /></h2>
<h2>
<br /></h2>
<h2>
Strassen's Method For Matrix Multiplication c program</h2>
<br />
#include<stdio.h><br />
void main(){<br />
int a[2][2],b[2][2],c[2][2],i,j;<br />
int m1,m2,m3,m4,m5,m6,m7;<br />
<br />
printf("Enter the 4 elements of first matrix: ");<br />
for(i=0;i<2;i++)<br />
for(j=0;j<2;j++)<br />
scanf("%d",&a[i][j]);<br />
<br />
printf("Enter the 4 elements of second matrix: ");<br />
for(i=0;i<2;i++)<br />
for(j=0;j<2;j++)<br />
scanf("%d",&b[i][j]);<br />
<br />
printf("\nThe first matrix is\n");<br />
for(i=0;i<2;i++){<br />
printf("\n");<br />
for(j=0;j<2;j++)<br />
printf("%d\t",a[i][j]);<br />
}<br />
<br />
printf("\nThe second matrix is\n");<br />
for(i=0;i<2;i++){<br />
printf("\n");<br />
for(j=0;j<2;j++)<br />
printf("%d\t",b[i][j]);<br />
}<br />
<br />
m1= (a[0][0] + a[1][1])*(b[0][0]+b[1][1]);<br />
m2= (a[1][0]+a[1][1])*b[0][0];<br />
m3= a[0][0]*(b[0][1]-b[1][1]);<br />
m4= a[1][1]*(b[1][0]-b[0][0]);<br />
m5= (a[0][0]+a[0][1])*b[1][1];<br />
m6= (a[1][0]-a[0][0])*(b[0][0]+b[0][1]);<br />
m7= (a[0][1]-a[1][1])*(b[1][0]+b[1][1]);<br />
<br />
c[0][0]=m1+m4-m5+m7;<br />
c[0][1]=m3+m5;<br />
c[1][0]=m2+m4;<br />
c[1][1]=m1-m2+m3+m6;<br />
<br />
printf("\nAfter multiplication using \n");<br />
for(i=0;i<2;i++){<br />
printf("\n");<br />
for(j=0;j<2;j++)<br />
printf("%d\t",c[i][j]);<br />
}<br />
<br />
<br />
}<br />
<br />
<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>strassen matrix multiplication code in c</li>
<li>strassen matrix multiplication 4 4 example</li>
<li>strassen matrix multiplication for 4x4</li>
<li>strassen's matrix multiplication program in c using recursion</li>
<li>strassen's matrix multiplication for nxn matrix in c</li>
<li>strassen's matrix multiplication program in c using divide and conquer</li>
<li>strassen's matrix multiplication algorithm implementation</li>
<li>strassen's matrix multiplication for 4x4 matrix example in c</li>
</ul>
</h2>
</div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-22921656852767850132017-02-07T21:42:00.002-08:002017-03-18T01:21:03.548-07:00Tower Of Hanoi c program <div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<div style="text-align: center;">
<span style="font-size: small;">tower of hanoi in c explanation</span></div>
<span style="font-size: small;"><div style="text-align: center;">
tower of hanoi in c without recursion</div>
<div style="text-align: center;">
tower of hanoi in c using stack</div>
<div style="text-align: center;">
tower of hanoi algorithm in data structure</div>
<div style="text-align: center;">
tower of hanoi using stack</div>
<div style="text-align: center;">
tower of hanoi in c++</div>
<div style="text-align: center;">
tower of hanoi in c using iteration</div>
<div style="text-align: center;">
tower of hanoi program in java</div>
</span></h2>
<h2>
<br /></h2>
<h2>
<br /></h2>
<h2>
Tower Of Hanoi Using Backtracking in c++ program </h2>
#include<iostream.h><br />
#include<conio.h><br />
void tower(int,char,char,char);<br />
void main()<br />
{<br />
int n;<br />
clrscr();<br />
cout<<"enter the disk number : ";<br />
cin>>n;tower(n,'A','C','B');<br />
getch();<br />
}<br />
void tower(int n,char from,char to,char aux)<br />
{<br />
if(n==1)<br />
{<br />
cout<<endl<<"move 1 from peg "<<from<<" to "<<to;return;<br />
}<br />
tower(n-1,from,aux,to);<br />
cout<<endl<<"move "<<n<<" from peg "<<from<<" to "<<to;<br />
tower(n-1,aux,to,from);<br />
}<br />
<br />
<h2 style="text-align: left;">
<br />Tower Of Hanoi c program </h2>
<div>
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>tower of hanoi in c explanation</li>
<li>tower of hanoi in c without recursion</li>
<li>tower of hanoi in c using stack</li>
<li>tower of hanoi algorithm in data structure</li>
<li>tower of hanoi using stack</li>
<li>tower of hanoi in c++</li>
<li>tower of hanoi in c using iteration</li>
<li>tower of hanoi program in java</li>
</ul>
</h2>
</div>
<div>
<br /></div>
<div>
<br /></div>
</div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-68289567766436732792017-02-07T21:40:00.001-08:002017-03-18T01:02:21.425-07:00 Finite Automata String Matching Algorithm c program <div dir="ltr" style="text-align: left;" trbidi="on">
<span style="font-weight: bold;"><div style="text-align: center;">
finite automata string matching c code</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
automata c program</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
finite automata string matching algorithm example</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
string matching with finite automata java code</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
automata based programming examples</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
string matching with finite automata ppt</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
finite automata c++</div>
</span><span style="font-weight: bold;"><div style="text-align: center;">
amcat automata c questions</div>
</span><h2 style="text-align: left;">
<br /></h2>
<h2 style="text-align: left;">
<br /></h2>
<h2 style="text-align: left;">
Finite Automata String Matching Algorithm c program </h2>
# include <iostream.h><br />
# include <conio.h><br />
# include <string.h><br />
class FiniteAtn<br />
{<br />
private:<br />
char *T,*P,*sig;<br />
int n,m,l,q,trans[15][15];<br />
public :<br />
void start(void);<br />
void set_trans(void);<br />
int tfunc(char);<br />
void matcher(void);<br />
int check(int,int);<br />
};<br />
void FiniteAtn :: start()<br />
{<br />
int i=0,j=0;<br />
l=0; m=0; n=0; q=0;<br />
cout<<"\n\n Enter the input text :";<br />
cin>>T;<br />
cout<<"\n\n Enter the pattern :";<br />
cin>>P;<br />
n=strlen(T);<br />
m=strlen(P);<br />
while (T[i]!='\0') {<br />
for (j=0;j<l;j++) <br />
{<br />
if (T[i]==sig[j])<br />
break;<br />
}<br />
if (j==l) <br />
{<br />
sig[l]=T[i];<br />
l++;<br />
}<br />
i++;<br />
}<br />
sig[l]='\0';<br />
for (i=0;i<15;i++)<br />
{<br />
for (j=0;j<15;j++)<br />
{<br />
trans[i][j]=0;<br />
}<br />
}<br />
<br />
cout<<sig;<br />
}<br />
void FiniteAtn :: set_trans()<br />
{<br />
int i,j=0,k=0;<br />
for (i=0;i<=m;i++)<br />
{<br />
while (sig[j]!='\0') {<br />
(q+2)>(m+1)?k=m+1:k=q+2;<br />
do<br />
{<br />
k--;<br />
}<br />
while (check(k,j));<br />
j++;<br />
}<br />
}<br />
}<br />
int FiniteAtn:: check(int k,int u)<br />
{<br />
int i;<br />
for (i=k;i>=0;i--)<br />
{<br />
}<br />
}<br />
int FiniteAtn :: tfunc(char a)<br />
{<br />
int i;<br />
for (i=0;i<l;i++)<br />
{<br />
if (sig[i]==a)<br />
break;<br />
}<br />
return(trans[q][i]);<br />
}<br />
<br />
void FiniteAtn :: matcher()<br />
{<br />
int i;<br />
for (i=0;i<n;i++) <br />
{<br />
if (tfunc(T[i])==m)<br />
cout<<"\n\n The string is found at shift s = "<<i;<br />
}<br />
}<br />
void main()<br />
{<br />
FiniteAtn fa;<br />
clrscr();<br />
fa.start();<br />
getch();<br />
<br />
}<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li>finite automata string matching c code</li>
<li>automata c program</li>
<li>finite automata string matching algorithm example</li>
<li>string matching with finite automata java code</li>
<li>automata based programming examples</li>
<li>string matching with finite automata ppt</li>
<li>finite automata c++</li>
<li>amcat automata c questions</li>
</ul>
</h2>
<div>
<br /></div>
</div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-87078393799834975352017-02-07T21:32:00.001-08:002017-02-07T21:32:12.329-08:00draw arc c program<div dir="ltr" style="text-align: left;" trbidi="on">
<h2>
Draw arc c program</h2>
<div>
<br /></div>
<div>
<br /></div>
<div>
<div>
#include<conio.h></div>
<div>
#include<graphics.h></div>
<div>
#include<stdio.h></div>
<div>
#include<dos.h></div>
<div>
void main()</div>
<div>
{</div>
<div>
int gd=DETECT,gm=0;</div>
<div>
initgraph(&gd,&gm,"c:\\tc\\bgi");</div>
<div>
// load graphics driver</div>
<div>
arc(115, 118, 0, 150, 65);</div>
<div>
/*</div>
<div>
method used </div>
<div>
arc(x,y,sa,ea,r);</div>
<div>
</div>
<div>
sa=start angle</div>
<div>
ea= end angle</div>
<div>
r=radius of arc.</div>
<div>
*/</div>
<div>
getch();</div>
<div>
closegraph();</div>
<div>
}</div>
</div>
<h2 style="text-align: left;">
<br /><br />draw arc c program, draw arc in c graphics program, draw arc in c program code, draw arc in c source code</h2>
</div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-54991201852647683392017-02-07T21:23:00.004-08:002017-02-07T21:23:56.119-08:00Rabin karp String Matching Algorithm c program<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
implementation of rabin-karp algorithm in c program</h2>
<h2 style="text-align: left;">
Rabin karp String Matching Algorithm using c program</h2>
<br />
<br />
<br />
#include<stdio.h><br />
#include<conio.h><br />
#include<string.h><br />
#include<math.h><br />
#define d 10<br />
void RabinKarpStringMatch(char *, char *, int);<br />
int main()<br />
{<br />
char *Text, *Pattern;<br />
int Number = 11; //Prime Number<br />
clrscr();<br />
printf("\nEnter Text String : ");<br />
gets(Text);<br />
printf("\nEnter Pattern String : ");<br />
gets(Pattern);<br />
<br />
RabinKarpStringMatch(Text,Pattern,Number);<br />
return 0;<br />
getch();<br />
}<br />
<br />
void RabinKarpStringMatch(char *Text, char *Pattern, int Number)<br />
{<br />
int M,N,h,P=0,T=0, TempT, TempP;<br />
int i,j;<br />
M = strlen(Pattern);<br />
N = strlen(Text);<br />
h = (int)pow(d,M-1) % Number;<br />
for(i=0;i<M;i++) {<br />
P = ((d*P) + ((int)Pattern[i])) % Number;<br />
TempT = ((d*T) + ((int)Text[i]));<br />
T = TempT % Number;<br />
}<br />
for(i=0;i<=N-M;i++) {<br />
if(P==T) {<br />
for(j=0;j<M;j++)<br />
if(Text[i+j] != Pattern[j])<br />
break;<br />
if(j == M)<br />
printf("\nPattern Found at Position : %d",i+1);<br />
}<br />
TempT =((d*(T - Text[i]*h)) + ((int)Text[i+M]));<br />
T = TempT % Number;<br />
if(T<0)<br />
T=T+Number;<br />
}<br />
<br />
}<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
rabin karp algorithm example c program<br />rabin karp hash cprogram</h2>
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-17654992258155467152017-02-06T03:51:00.001-08:002017-02-07T20:45:34.557-08:00structure for student<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
structure for student </h2>
<br />
#include<stdio.h><br />
struct student<br />
{ <span class="Apple-tab-span" style="white-space: pre;"> </span>char name[20];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int roll,age; };<br />
<br />
int main()<br />
{<span class="Apple-tab-span" style="white-space: pre;"> </span>struct student s; <span class="Apple-tab-span" style="white-space: pre;"> </span> <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
printf("\nEnter the details of the student:\n"); <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
scanf("%s %d %d" , s.name , &s.roll , &s.age); <span class="Apple-tab-span" style="white-space: pre;"> </span><span class="Apple-tab-span" style="white-space: pre;"> </span><br />
printf("\nThe details of the student is as follows\n"); <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
printf("\n %s \n %d \n %d", s.name , s.roll, s.age); <span class="Apple-tab-span" style="white-space: pre;"> </span> <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
return 0; }<br />
<br />
<br />
<h2 style="text-align: left;">
You can also find structure program </h2>
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li><span style="font-size: small;">C Structure Program to Store Information of Students Using </span></li>
<li><span style="font-size: small;">C program to store information using structure for array of structures</span></li>
<li><span style="font-size: small;">c program for student marksheet using structure</span></li>
<li><span style="font-size: small;">c program using structure to find students grades in a class</span></li>
<li><span style="font-size: small;">student mark list program in c using array</span></li>
<li><span style="font-size: small;">c program examples using structures</span></li>
<li><span style="font-size: small;">c++ program for student details using structure</span></li>
<li><span style="font-size: small;">c program using structures employee details</span></li>
<li><span style="font-size: small;">c program using structure array</span></li>
<li><span style="font-size: small;">c program for student details using files</span></li>
</ul>
</h2>
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-27055656453808385872017-02-06T03:46:00.002-08:002017-02-07T20:44:48.881-08:00c Structure for Book <div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
c Structure for Book </h2>
<br />
#include<stdio.h><br />
struct Book<br />
{ <span class="Apple-tab-span" style="white-space: pre;"> </span>char name[50],<br />
author[50];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int price; };<br />
<br />
int main() { <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
struct Book b; <span class="Apple-tab-span" style="white-space: pre;"> </span><span class="Apple-tab-span" style="white-space: pre;"> </span><br />
printf("\nEnter the details of the Book:\n");<br />
gets(b.name);<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
gets(b.author); <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
scanf("%d",&b.price);<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
printf("\nThe details of the Book is as follows\n"); <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<br />
printf("\n %s \n %s \n %d", b.name , b.author, b.price); <span class="Apple-tab-span" style="white-space: pre;"> </span> <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
return 0; }<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li><span style="font-size: small;">C Structure Program to Store Information of Book Using arrye</span></li>
<li><span style="font-size: small;">C program to store information using structure for array of structures</span></li>
<li><span style="font-size: small;">c program for Book using structure</span></li>
<li><span style="font-size: small;">c program using structure to find Book program in c using array</span></li>
<li><span style="font-size: small;">c program examples using structures</span></li>
<li><span style="font-size: small;">c++ program for Book details using structure</span></li>
<li><span style="font-size: small;">c program using structures employee details</span></li>
<li><span style="font-size: small;">c program using structure array</span></li>
<li><span style="font-size: small;">c program for Book details using files</span></li>
</ul>
</h2>
<br />
<br />
<br />
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-41468544318547628922017-02-06T03:41:00.004-08:002017-02-07T20:48:40.030-08:00Structure salary program<div dir="ltr" style="text-align: left;" trbidi="on">
<h3 style="text-align: left;">
Program to Calculate the salary for Employee using Structure c program example</h3>
#include<stdio.h><br />
struct Employee<br />
{ <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
char name[20]; <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
int id,basic; <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
float salary; };<br />
int main()<br />
{ <span class="Apple-tab-span" style="white-space: pre;"> </span>struct Employee e;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>float ta,da,hra; <span class="Apple-tab-span" style="white-space: pre;"> </span> <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
printf("\nEnter the details of the Employee\n");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>scanf("\n%s %d %d",e.name,&e.id,&e.basic); <span class="Apple-tab-span" style="white-space: pre;"> </span> <span class="Apple-tab-span" style="white-space: pre;"> </span>ta=0.2 * e.basic; <span class="Apple-tab-span" style="white-space: pre;"> </span>da=0.4 * e.basic; <span class="Apple-tab-span" style="white-space: pre;"> </span>hra=0.15 * e.basic; <span class="Apple-tab-span" style="white-space: pre;"> </span> <span class="Apple-tab-span" style="white-space: pre;"> </span>e.salary=e.basic + ta +da + hra; <span class="Apple-tab-span" style="white-space: pre;"> </span> <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
printf("\nthe details of the employee are\n"); <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
printf("\n %s \n %d \n %.2f \n",e.name ,e.id ,e.salary); <span class="Apple-tab-span" style="white-space: pre;"> </span> <span class="Apple-tab-span" style="white-space: pre;"> </span><br />
return 0; }<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
<ul>
<li></li>
<li><span style="font-size: small;">c program for employee salary calculation using structure</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">write a c program to calculate net salary of an employee</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c program for employee details using structure</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c program to calculate salary and pf</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">write a program to calculate net salary in c++</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c program for employee details using nested structure</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">employee salary calculation program in c</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c program to calculate the salary of an employee given his basic pay</span></li>
</ul>
</h2>
<br />
<br />
<br />
<br />
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-69819704318930359662017-02-04T19:28:00.000-08:002017-02-07T20:51:04.860-08:00C Program to arrange/sort the elements in descending order<div dir="ltr" style="text-align: left;" trbidi="on">
<h2>
C Program to arrange/sort the elements in descending order</h2>
<br />
#include <stdio.h><br />
int main ()<br />
{ int number[30]; int i, j, a, n;<br />
printf("Enter the value of N\n");<br />
scanf("%d", &n);<br />
printf("Enter the numbers \n");<br />
for (i = 0; i < n; ++i)<br />
scanf("%d", &number[i]);<br />
<br />
/* sorting begins ... */<br />
for (i = 0; i < n; ++i)<br />
{ for (j = i + 1; j < n; ++j)<br />
{ if (number[i] < number[j])<br />
{ a = number[i]; number[i] = number[j]; number[j] = a; } } }<br />
<br />
printf("The numbers arranged in descending order are given below\n");<br />
<br />
for (i = 0; i < n; ++i)<br />
{ printf("%d\n", number[i]); }<br />
return 0; }<br />
<br />
<br />
<h2 style="text-align: left;">
<ul>
<li></li>
<li><span style="font-size: small;">c program for sorting numbers in ascending and descending order</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c program to sort an array in ascending order using function</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c program to arrange numbers in ascending order without using array</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c++ program to sort an array in descending order</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c program to sort an array in descending order using bubble sort</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">sort array in descending order in java</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c program to sort n numbers in ascending order</span></li>
</ul>
<ul>
<li></li>
<li><span style="font-size: small;">c program to sort an array in ascending order</span></li>
</ul>
</h2>
</div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.comtag:blogger.com,1999:blog-7177944579203070966.post-78448774500328144872017-02-04T19:24:00.000-08:002017-02-07T20:53:51.202-08:00C Program to sort an array in ascending order<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
C Program to sort an array in ascending order</h2>
<br />
#include <stdio.h><br />
int main()<br />
{ int i, j, a, n, number[30];<br />
printf("Enter the value of N \n");<br />
scanf("%d", &n);<br />
printf("Enter the numbers \n");<br />
for (i = 0; i < n; ++i)<br />
scanf("%d", &number[i]);<br />
for (i = 0; i < n; ++i) { for (j = i + 1; j < n; ++j)<br />
{ if (number[i] > number[j])<br />
{ a = number[i];<br />
number[i] = number[j];<br />
number[j] = a; }<br />
}<br />
}<br />
printf("The numbers arranged in ascending order are given below \n");<br />
for (i = 0; i < n; ++i) printf("%d\n", number[i]);<br />
return 0; }<br />
<br />
<br />
<br />
<h2 style="text-align: left;">
<ul style="text-align: left;">
<li><span style="font-size: small;">c program to sort an array in ascending order</span></li>
</ul>
<ul style="text-align: left;">
<li><span style="font-size: small;">c program for sorting numbers in ascending and descending order</span></li>
</ul>
<ul style="text-align: left;">
<li><span style="font-size: small;">c program to sort an array in ascending order using function</span></li>
</ul>
<ul style="text-align: left;">
<li><span style="font-size: small;">c program to arrange numbers in ascending order without using array</span></li>
</ul>
<ul style="text-align: left;">
<li><span style="font-size: small;">c++ program to sort an array in descending order</span></li>
</ul>
<ul style="text-align: left;">
<li><span style="font-size: small;">c program to sort an array in descending order using bubble sort</span></li>
</ul>
<ul style="text-align: left;">
<li><span style="font-size: small;">sort array in descending order in java</span></li>
</ul>
<ul style="text-align: left;">
<li><span style="font-size: small;">c program to sort n numbers in ascending order</span></li>
</ul>
</h2>
<br />
<br /></div>
Prof. Prakash Sonarhttp://www.blogger.com/profile/10460261398882171463noreply@blogger.com