Share this:

MULTI-VIBRATOR    [ 474 — 475]

• Output Waveforms
• Ckt conditions – 474
• Frequency of Oscillations
• Maximum value of B

MONOSTABLE

• stable state
• quasi table
• gate width (gate time calculations)

BISTABLE

• base voltage calculation

COMMUTATING CAPACITORS

• settling time
• resolution time

TRIGGERING OF BISTABLE MULTIVIBRATOR

• symmetrical
• asymmetrical

COLLECTOR CATCHING DIODE IN BI-STABLE MULTI VIBRATOR.

BOOK-Gupta-Kumar ( 474 – 485 )

We have officially finished our level-2 term-1 courses and now the class routine for next semester (Level-2 Term-2) has published.

those who couldn’t manage to collect it from the campus here is a small draft for them. (only the routine is here. The course details can be found in our Undergraduate Handbook )

• Download in pdf

• Download in doc

Share this:

How are You all?

I guess everyone’s mind is stressed now for a bloody long vacation.However I gotta  post here

just to share one thrilling code with you.Infact I couldn’t but inform it all of you.Everyone knows

that we were given a assignment by Rasel Sir on typical Permutation algorithm such as to remove repetition

,to sort lexicographically etc.Might be some of us solved it,but with different algo for all specific task.

I also solved it but had used different algo for different task.I even surfed through net to find out such a code

,maybe for my inexperience how to search diligently,I failed to manage it.However I managed it myself few days

ago in this damn vacation(Im confused!!was it really damn vacation??:P)Though we know STL’s “next_permutation”

do this job perfectly,I find two flaw there.

1)It takes much time even than of mine!!  2)It’s a relative flaw of STL(Plz Recall that I said Relative)is that

somehow its odd to use STL without knowing How it works.

Well..I don’t want to stretch my introduction more..Here directly code goes:

#include<stdio.h>

#include<string.h>

#include<stdlib.h>

bool vis[10000];

long N;

char p[10000],a[10000];

int cmp(const void *a,const void *b)

{

char *x=(char*)a;

char *y=(char*)b;

return *x-*y;

}

void check(long how)

{

long i;

if(how==N)

{

printf(“%s\n”,p);

return;

}

char pr=’-‘;   //This for switching off the repetition

for(i=0;i<N;i++)

{

if(!vis[i]&&a[i]!=pr)

{

pr=a[i];

p[how]=a[i];

vis[i]=1;

check(how+1);

vis[i]=0;

}

}

}

int main()

{

while(gets(a))

{

N=strlen(a);

p[N]=”;

qsort(a,N,sizeof(char),cmp);

check(0);

}

return 0;

}

And short analysis on this code goes here:

Time complexity:

First of all,I wanna say my ability of analysing algo is poor even if it’s my own algo!!

As Far my ability,What I got is that Max depth of Recursion of above code is “Length of String”.

Let, Max depth=N and in each depth loop runs N time each making it a exponential algorithm

of like N^N.

For The string of length 11:”abcdefghijk” it takes almost 7.81 sec in Intel Dual core 2.20GHz Pc

whereas for same string STL takes 9.37 sec in same PC.(Time measured without printing results)

…Hope friends you might find it useful for ACM solving and you will notify me my errors and suggest

how to develop it..

Thanks

Sayem Mohammad Imtiaz

CUET CSE 08

Share this:

hi guyz….
this may be a little help for you…
i think.
coz i’ve seen that you guyz often face problemz with System Bios Setup…
follow the link…
i think there you will find the mysteryz of BIOS
http://www.ybet.be/en-hardware-1-23/bios-setup.htm

Share this:

There are two books often suggested by our teachers or seniors to make us prepared for not only programming contests but also for a better programming skill. The first one is “Arte of Programming Contest” by Ahmed Samsul Arefin, and the second one is

Share this:

Dear friends,

Sometimes we face  problems to find prime factor of some different numbers.This post contains some concepts on prime factorization & divisibility rules. It may help you a lot.

DIVISIBILITY RULES AND PRIME FACTORIZATION

Md.kamrujjaman Akon

(N@Y@N)

0804034

Share this:

Here is our syllabus for industrial management and accountancy (HUM-241) syllabus.

Download the pdf from the following link.

Management_&_Accountancy_Syllabus

Share this:

Note the following pattern for repeating decimals:
0.22222222… = 2/9
0.54545454… = 54/99
0.298298298… = 298/999
Division by 9’s causes the repeating pattern.

Note the pattern if zeros precede the repeating decimal:
0.022222222… = 2/90

Share this:

The individual programming contest for cuet cse 08 has successfully finished. Total 20 contestant attended the contest. Among them Md. Mehtanin Kabir Rashikh (0804044) was the champion. Md Shahed Iqbal (0804045) was the second. Well here is a brief result of the contest by their position.

Share this:

This is to inform that an individual programming contest for CSE 08 batch has been arranged by CSE 05. This is an individual contest and will be held on next Monday that is April 5,2010. Starting time of the contest is 2.30 PM. Every interested students are requested to collect the form from Shafiq Vai (multimidea lab) for tk 50. Then submit it to him. You need to inform  Saniyat Alam Bappi
vaiya by mail. The mail address is given below. All you need to do is

• collect the form and submit it to Shafiq Vai
• mail your name,roll no and acm id to    saniyat@gmail.com