Tag Archives: 2007

Design an algorithm, draw a corresponding flow chart and write a ‘C’ program for Binary Search, to search a given number among the list of numbers. 10m Dec2007

Design an algorithm, draw a corresponding flow chart and write a ‘C’ program for Binary Search, to search a given number among the list of numbers. 10m Dec2007   Algorithm Step 1: Declare an array ‘k’ of size ‘n’ i.e. k(n) is an array which stores all the keys of a file containing ‘n’ records… Read More »

Give the Excitation tables and Block diagrams for the following: 10m Jun2007

Give the Excitation tables and Block diagrams for the following: 10m Jun2007 (i)                 D flip-flop (ii)               T flip-flop   D Flip-Flop: The D flip-flop shown in Figure is a modification of the clocked SR flip-flop. The D input goes directly into the S input and the complement of the D input goes to the R… Read More »

Explain the basic principle of Quine-McCluskey method of simplifying the Boolean expression with the help of an example function. 6m Jun2007

Explain the basic principle of Quine-McCluskey method of simplifying the Boolean expression with the help of an example function. 6m Jun2007 Quine McKluskey Method A tabular method was suggested to deal with the increasing number of variables known as Quine McKluskey Method. This method is suitable for programming and hence provides a tool for automating… Read More »

Design and draw a master-slave flip flop using JK flipflops. What are the advantages it offers over other flip flops? 10m Jun2007

Design and draw a master-slave flip flop using JK flipflops. What are the advantages it offers over other flip flops? 10m Jun2007 Master Slave Flip Flop Master-slave flip flop consists of two flip-flops. One is the master flip-flop & other is called the slave flip-flop. The figure shows implementation of master-slave flipflop using J-K flip-flop.… Read More »

Design and draw a 3 x 8 decoder using NOT gates and AND gates and explain its working. 8m Jun2007

Decoder converts one type of coded information to another form. A decoder has ‘n’ inputs and an enable line (a sort of selection line) and 2n output lines. Let us see diagram of 3×8 decoder which decodes a 3 bit information and there is only one output line which gets the value 1 or in… Read More »

Simplify Boolean function using Karnaugh map method F(A,B,C,D) = Σ(1,2,5,6,7,8,9,11,12,15) Also, draw the corresponding logic circuit diagram. 8m Jun2007

Simplify the following Boolean function using Karnaugh map method F( A ,B , C , D ) = Σ ( 1, 2 , 5 , 6 , 7 , 8 , 9 , 11 , 12 ,15 ) Also, draw the corresponding logic circuit diagram. 8m Jun2007   K-Map for F is: Thus, the simplified equations for F (A,… Read More »

Design an algorithm, draw a corresponding flow chart and write a program in C, to swap the values using pass by value and pass by reference methods. 10m Jun2007

Design an algorithm, draw a corresponding flow chart and write a program in C, to swap the values using pass by value and pass by reference methods. 10m Jun2007  FlowChart: Program to swap two values (Pass By Value):- #include <stdio.h> main ( ) { int x = 2, y = 3; clrscr(); void swap(int, int);… Read More »

Write a program to generate the pattern 10m Jun2007

Write a program to generate the pattern 10m Jun2007 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5   Code:   #include<stdio.h> void main() { char C[]=”12345″; int I,J; clrscr(); printf(“Result :\n”); for(I=0;I<5;I++) { printf(“\n”); for(J=0;J<=I;J++) { printf(“%c “,C[J]); } printf(“\n”); } getch(); } [codesyntax lang=”c”] #include<stdio.h> void main()… Read More »

Explain the concept of a function returning a pointer with an example 6m Jun2007

Explain the concept of a function returning a pointer in C with an example 6m Jun2007 Function returning a pointer in C A function can also return a pointer to the calling program, the way it returns an int, a float or any other data type. To return a pointer, a function must explicitly mention… Read More »